MCQ bookmark_border Q. The given Graph is regular. A 1 C May be D Can't say Correct Answer: A None. Check Answer report_problem Report
MCQ bookmark_border 1. If there are more than 1 topological sorting of a DAG is possible, which of the following is true. A Many Hamiltonian paths are possible B No Hamiltonian path is possible C Exactly 1 Hamiltonian path is possible D Given information is insufficient to comment anything Correct Answer: B None. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 2. Time Complexity of DFS is? (V A O(V + E) B O(V) C O(E) D None of the mentioned Correct Answer: A None. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 3. Breadth first search __________ A Scans each incident node along with its children. B Scans all incident edges before moving to other node. C Issame as backtracking D Scans all the nodes in random order. Correct Answer: B None. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 4. Dijkstra A 1 C May be D Can't say Correct Answer: B None. Check Answer report_problem Report forum Discussion
MCQ bookmark_border 5. Regarding implementation of Breadth First Search using queues, what is the maximum distance between two nodes present in the queue? (considering each edge length 1) A Can be anything C At most 1 D Insufficient Information Correct Answer: C None. Check Answer report_problem Report forum Discussion
