adplus-dvertising

Welcome to the Graphs MCQs Page

Dive deep into the fascinating world of Graphs with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Graphs, a crucial aspect of Data Structures and Algorithms. In this section, you will encounter a diverse range of MCQs that cover various aspects of Graphs, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Data Structures and Algorithms.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Graphs. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Data Structures and Algorithms.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Graphs. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Graphs MCQs | Page 9 of 17

Explore more Topics under Data Structures and Algorithms

Q81.
What are the dimensions of an incidence matrix?

a.

Number of edges*number of edges

b.

Number of edges*number of vertices

c.

Number of vertices*number of vertices

d.

None of the mentioned statements

Discuss
Answer: (b).Number of edges*number of vertices
Q82.
The column sum in an incidence matrix for a directed graph having no self loop is __________

a.

0

b.

1

c.

2

d.

equal to the number of edges

Discuss
Answer: (a).0
Q83.
Time complexity to check if an edge exists between two vertices would be ___________

a.

O(V*V)

b.

O(V+E)

c.

O(1)

d.

O(E)

Discuss
Answer: (d).O(E)
Q84.
The graphs G1 and G2 with their incidences matrices given are Isomorphic.

e1 e2 e3 e4 e5 e6
v1 1 0 0 0 0 0
v2 1 1 0 0 0 1
v3 0 1 1 0 1 0
v4 0 0 1 1 0 0
v5 0 0 0 1 1 1



e1 e2 e3 e4 e5 e6
v1 0 0 1 0 0 0
v2 1 0 1 0 1 0
v3 1 1 0 1 0 0
v4 0 1 0 0 0 1
v5 0 0 0 1 1 1

a.

True

b.

False

c.

May be

d.

Can't say

Discuss
Answer: (a).True
Q85.
If a connected Graph (G) contains n vertices what would be the rank of its incidence matrix?

a.

n-1

b.

values greater than n are possible

c.

values less than n-1 are possible

d.

insufficient Information is given

Discuss
Answer: (a).n-1
Q86.
A Graph Structured Stack is a _____________

a.

Undirected Graph

b.

Directed Graph

c.

Directed Acyclic Graph

d.

Regular Graph

Discuss
Answer: (c).Directed Acyclic Graph
Q87.
If a Graph Structured Stack contains {1,2,3,4} {1,5,3,4} {1,6,7,4} and {8,9,7,4}, what would be the source and sink vertices of the DAC?

a.

Source – 1, 8 Sink – 7,4

b.

Source – 1 Sink – 8,4

c.

Source – 1, 8 Sink – 4

d.

None of the Mentioned

Discuss
Answer: (c).Source – 1, 8 Sink – 4
Q88.
Graph Structured Stack finds its application in _____________

a.

Bogo Sort

b.

Tomita’s Algorithm

c.

Todd–Coxeter algorithm

d.

All of the mentioned

Discuss
Answer: (b).Tomita’s Algorithm
Q89.
If in a DAG N sink vertices and M source vertices exists, then the number of possible stacks in the Graph Structured Stack representation would come out to be N*M.

a.

True

b.

False

c.

May be

d.

Can't say

Discuss
Answer: (b).False
Q90.
Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is ___________

a.

O(E)

b.

O(V*V)

c.

O(E+V)

d.

O(V)

Discuss
Answer: (c).O(E+V)
Page 9 of 17

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

Cloud Computing

Stay on top of the biggest trend in IT with our Cloud Computing MCQs. These questions...

Visual Basic

Enhance your knowledge of Microsoft's event-driven programming language with our...

Digital Communication

Master the basics of electronic communication with our Digital Communication MCQs....

R Programming

Unleash the power of statistical computing with our R Programming MCQs. Topics cover...

Software Engineering

Learn about the systematic approach to developing software with our Software...

Artificial Intelligence

Get started on the path to the future with our Artificial Intelligence MCQs. Covering...

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

Human Computer Interaction

Enhance your knowledge of Human-Computer Interaction with our specialized MCQs....