Q110: Maximum number of edges in a graph

Question #110: What is the maximum number of edges in a graph with “n” vertices?

Options:

• C(n, 2)
• C(n, n)
• n
• n²

Solution: Since an edge can be formed by taking two vertices at a time, there can be maximum of C(n, 2) pairs of vertices in a graph. Hence, the correct answer is option 1.

Q49: DFS in lexical order

Question #49: For the following graph, let’s assume A is the starting node and we traverse the graph using DFS (Depth First Search) in lexical order. What would be the order of traversal?

Options:

1. A, B, C, G, D, H, F, E
2. A, B, C, F, G, D, H, E
3. A, E, B, C, F, G, D, H
4. A, E, B, F, D, G, D, H

Solution: A would be followed by B instead of E or F to follow the lexical order. Now, after B would be C. Similarly after C, F would be preferred instead of G and so on. 2nd option is the right answer.