1. |
Graph G is .............. if for any pair u, v of nodes in G there is a path from u to v or path from v to u.
|
||||||||
Answer:
Option (c) |
2. |
A connected graph T without any cycles is called ........
|
||||||||
Answer:
Option (a) |
3. |
In a graph if E=(u,v) means ......
|
||||||||
Answer:
Option (d) |
4. |
The Data structure used in standard implementation of Breadth First Search is?
|
||||||||
Answer:
Option (b) |
5. |
The Depth First Search traversal of a graph will result into?
|
||||||||
Answer:
Option (b) |
6. |
In Depth First Search, how many times a node is visited?
|
||||||||
Answer:
Option (c) |