List of top Computer Science Questions on Graph Representation

Match List-I with List-II.

List-IList-II
A. Minimum Spanning TreeI. Height balanced
B. Topological SortII. Stack
C. RecursionIII. Kruskal’s Algorithm
D. AVL TreesIV. DFS


Choose the correct answer from the options given below:

Which of the following algorithms have time order of complexity?
• [A.] Insertion sort
• [B.] Worst case Search in Binary Search tree
• [C.] Insertion in Stack
• [D.] Quick sort worst case
Choose the correct answer from the options given below:
Which of the following algorithms have time order of complexity?
• [A.] Insertion sort
• [B.] Worst case Search in Binary Search tree
• [C.] Insertion in Stack
• [D.] Quick sort worst case
Choose the correct answer from the options given below:

Match List-I with List-II.

List-IList-II
A. Minimum Spanning TreeI. Height balanced
B. Topological SortII. Stack
C. RecursionIII. Kruskal’s Algorithm
D. AVL TreesIV. DFS


Choose the correct answer from the options given below:

Which of the following statements are TRUE, where $|E|$ represents the number of edges?
(A). In case of a directed graph, the sum of lengths of all the adjacency list is |E|
(B). For an undirected graph, the sum of the lengths of all the adjacency list is 2|E|
(C). For a dense graph, adjacency matrix representation is preferable
(D). The memory requirement of the adjacency matrix of a graph is dependent on the number of edges