Menu

Question Discussion & Solution

MCQ
Q.
In which case adjacency list is preferred in front of an adjacency matrix?

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
For an undirected graph with n vertices and e edges, the sum of the degree of each vertex is equal to
forum Discussion
MCQ
2.
Which of the following logical operation can be implemented by polynomial time graph manipulation algorithms using Binary Decision Diagrams?
forum Discussion
MCQ
3.
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)
forum Discussion
MCQ
4.
In a Binary Decision Diagrams 0 values by a _________ line and the 1 values are represented by a _________ line.
forum Discussion
MCQ
5.
On which of the following statements does the time complexity of checking if an edge exists between two particular vertices is not, depends?
forum Discussion

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