G is an undirected graph with vertex set {v1, v2, v3, v4, v5, v6, v7} and edge set {v1v2, v1v3, v1v4, v2v4, v2v5, v3v4, v4v5, v4v6, v5v6, v6v7}. A breadth first search of the graph is performed with v1 as the root node. Which of the following is a tree edge ?
(A) v2v4
(B) v1v4
(C) v4v5
(D) v3v4

Recent Topics

• Consider the following code fragment
  void foo(int x, int y)
  {
  x+=y;
  y+=x;
  }
  main()
  {
  int x=5.5;
  foo(x,x);
  }
  What is the final value of x in both call by value and call by reference, respectively?
  (A) 5 and 16
  (B) 5 and 12
  (C) 5 and 20
  (D) 12 and 20
  
  

  by 
  Anonymous

  1 year, 2 months ago

• Ionisation energy in group 1A varies in the decreasing order as 

  (a) Li > Na > K > Cs 

  (b) Na > Li > K >Cs 

  (c) Li > Cs > K > Na 

  (d) K > Cs > Na > Li

  by 
  Anonymous

  1 year, 3 months ago

• A clustering index is defined on the fields which are of type
  (A) non-key and ordering

  (B) non-key and non-ordering
  (C) key and ordering
  (D) key and non-ordering
  
  

  by 
  Anonymous

  1 year, 2 months ago
• Howare mining activities responsible for land degradation in jharkhand
  by 
  Anonymous

  1 year, 3 months ago

• What is the number of steps required to derive the string ((() ()) ())

  S → SSS → (S)S → ε

  (A) 10
  (B) 15
  (C) 12
  (D) 16
  
  

  by 
  Anonymous

  1 year, 3 months ago