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.
Which of the given statement is true?
Correct Answer: A
None.
MCQ
2.
A Graph Structured Stack is a _____________
Correct Answer: C
None.
MCQ
3.
What is the number of edges present in a complete graph having n vertices?
Correct Answer: B
None.
MCQ
4.
If A[x+3][y+5] represents an adjacency matrix, which of these could be the value of x and y.
Correct Answer: A
None.
MCQ
5.
In which of the following does a Directed Acyclic Word Graph finds its application in?
Correct Answer: A
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