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 3 of 17

Explore more Topics under Data Structures and Algorithms

Q21.
A connected graph T without any cycles is called ........

a.

free graph

b.

no cycle graph

c.

non cycle graph

d.

circular graph

Discuss
Answer: (a).free graph
Q22.
In a graph if E=(u,v) means ......

a.

u is adjacent to v but v is not adjacent to u

b.

e begins at u and ends at v

c.

u is processor and v is successor

d.

both b and c

Discuss
Answer: (d).both b and c
Q23.
Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements:
I. Minimum Spanning Tree of G is always unique.
II. Shortest path between any two vertices of G is always unique.
Which of the above statements is/are necessarily true?

a.

I only

b.

II only

c.

both I and II

d.

neither I and II

Discuss
Answer: (a).I only
Q24.
Let A be an adjacency matrix of a graph G. The ij th entry in the matrix Ak , gives

a.

The number of paths of length K from vertex Vi to vertex Vj.

b.

Shortest path of K edges from vertex Vi to vertex Vj.

c.

Length of a Eulerian path from vertex Vi to vertex Vj.

d.

Length of a Hamiltonian cycle from vertex Vi to vertex Vj.

Discuss
Answer: (b).Shortest path of K edges from vertex Vi to vertex Vj.
Q25.
For an undirected graph with n vertices and e edges, the sum of the degree of each vertex is equal to

a.

2n

b.

(2n-1)/2

c.

2e

d.

4n

Discuss
Answer: (c).2e
Q26.
An undirected graph G with n vertices and e edges is represented by adjacency list. What is the time required to generate all the connected components?

a.

O (n)

b.

O (e)

c.

O (e+n)

d.

O (e-n)

Discuss
Answer: (c).O (e+n)
Q27.
A graph with n vertices will definitely have a parallel edge or self loop if the total number of edges are

a.

more than n

b.

more than n

c.

more than (n+1)/2

d.

more than n(n-1)/2

Discuss
Answer: (d).more than n(n-1)/2
Q28.
The maximum degree of any vertex in a simple graph with n vertices is

a.

n–1

b.

n+1

c.

2n–1

d.

n

Discuss
Answer: (a).n–1
Q29.
The data structure required for Breadth First Traversal on a graph is

a.

queue

b.

stack

c.

array

d.

tree

Discuss
Answer: (a).queue
Q30.
In Breadth First Search of Graph, which of the following data structure is used?

a.

Stack

b.

Queue

c.

Linked List

d.

None of the above

Discuss
Answer: (b).Queue
Page 3 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!

Data Structures and Algorithms

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

Compiler Design

Unravel the process of translating source code into executable programs with our...

R Programming

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

Data Science

Discover the fascinating world of extracting insights from data with our Data Science...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...

MySQL Database

Enhance your knowledge of relational databases with our MySQL MCQs. Understand...

Digital Communication

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

Visual Basic

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

Operating System

Dive deep into the core of computers with our Operating System MCQs. Learn about...