MCQ bookmark_border Q. What is the number of words that can be formed from the given Directed Acyclic Word Graph? A 2 B 4 C 12 D 7 Correct Answer: B None. Check Answer report_problem Report
MCQ bookmark_border 1. Regarding implementation of Depth First Search using stacks, what is the maximum distance between two nodes present in the stack? (considering each edge length 1) A Can be anything C At most 1 D Insufficient Information Correct Answer: A None. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 2. A graph with all vertices having equal degree is known as a __________ A Multi Graph B Regular Graph C Simple Graph D Complete Graph Correct Answer: B None. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 3. Which of these adjacency matrices represents a simple graph? A [ [1, 0, 0], [0, 1, 0], [0, 1, 1] ] B [ [1, 1, 1], [1, 1, 1], [1, 1, 1] ] C [ [0, 0, 1], [0, 0, 0], [0, 0, 1] ] D [ [0, 0, 1], [1, 0, 1], [1, 0, 0] ] Correct Answer: D None. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 4. Floyd Warshall Algorithm used to solve the shortest path problem has a time complexity of __________ A O(V*V) B O(V*V*V) C O(E*V) D O(E*E) Correct Answer: B None. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 5. A connected graph T without any cycles is called A a tree graph B free tree C a tree D All of above Correct Answer: D None. Check Answer report_problem Report forum Discussion
