MCQ
Q.
For which type of graph, the given program would run infinitely? The Input would be in the form of an adjacency Matrix and n is its dimension (1
Correct Answer: B
None.
forum Community Discussion
speaker_notes_off
No discussions yet. Be the first to start!
sync
Loading more...
You must be logged in to participate in the discussion.
login Login to Discussauto_awesome Similar Questions
MCQ
1.
In a Binary Decision Diagrams 0 values by a _________ line and the 1 values are represented by a _________ line.
Correct Answer: C
None.
MCQ
2.
For the given conditions, which of the following is in the correct order of increasing space requirement?
i) Undirected, no weight
ii) Directed, no weight
iii) Directed, weighted
iv) Undirected, weighted
i) Undirected, no weight
ii) Directed, no weight
iii) Directed, weighted
iv) Undirected, weighted
Correct Answer: A
None.
MCQ
3.
Minimum number of spanning tree in a connected graph is
Correct Answer: C
None.
MCQ
4.
Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4 regions. What will be the number of connected components?
Correct Answer: B
None.
MCQ
5.
A connected graph T without any cycles is called
Correct Answer: D
None.
category More Data Structure Topics
article
Data Structure Basics
format_list_bulleted
128 MCQs
article
Abstract data types
format_list_bulleted
37 MCQs
article
Arrays
format_list_bulleted
134 MCQs
article
Lists
format_list_bulleted
166 MCQs
article
Stacks
format_list_bulleted
165 MCQs
article
Queues
format_list_bulleted
61 MCQs
article
Trees
format_list_bulleted
133 MCQs
article
Binary Trees
format_list_bulleted
120 MCQs
article
B Trees
format_list_bulleted
8 MCQs
article
Heaps
format_list_bulleted
36 MCQs
article
Hash based structures
format_list_bulleted
7 MCQs
article
Graphs
format_list_bulleted
157 MCQs
article
Mixed
format_list_bulleted
10 MCQs