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.

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

Explore more Topics under Data Structures and Algorithms

01

Data Structures Basics

02

Data Types and Abstraction

03

Algorithm Complexity

04

Arrays and Pointers

05

Linked Lists

06

Stacks and Queues

07

Recursion

08

Trees

09

String Operations

10

Sorting and Searching

11

Object Oriented Programming

12

Dynamic Programming

Q1.

From a complete graph, by removing maximum _______________ edges, we can construct a spanning tree.

e-n+1

n-e+1

n+e-1

e-n-1

Discuss

Answer: (a).e-n+1

Q2.

Minimum number of spanning tree in a connected graph is

n(n - 1)

Discuss

Answer: (c).1

Q3.

Find the odd out

Prim's Minimal Spanning Tree Algorithm

Kruskal's Minimal Spanning Tree Algorithm

Floyd-Warshall's All pair shortest path Algorithm

Dijkstra's Minimal Spanning Tree Algorithm

Discuss

Answer: (c).Floyd-Warshall's All pair shortest path Algorithm

Q4.

The minimum number of edges required to create a cyclid graph of n vertices is

n+1

n-1

Discuss

Answer: (a).n

Q5.

What will be the running-time of Dijkstra's single source shortest path algorithm, if the graph G(V,E) is stored in form of adjacency list and binary heap is used −

Ο(|V|2)

Ο(|V| log |V|)

Ο(|E|+|V| log |V|)

None of these

Discuss

Answer: (c).Ο(|E|+|V| log |V|)

Q6.

Maximum degree of any vertex in a simple graph of vertices n is

2n - 1

n + 1

n - 1

Discuss

Answer: (d).n - 1

Q7.

If the data collection is in sorted form and equally distributed then the run time complexity of interpolation search is −

Ο(n)

Ο(1)

Ο(log n)

Ο(log (log n))

Discuss

Answer: (d).Ο(log (log n))

Q8.

A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.

Weakly connected

Strongly Connected

Tightly Connected

Linearly Connected

Discuss

Answer: (b).Strongly Connected

Q9.

State True of False.

i) Network is a graph that has weights or costs associated with it.

ii) An undirected graph which contains no cycles is called a forest.

iii) A graph is said to be complete if there is no edge between every pair of vertices.

True, False, True

True, True, False

True, True, True

False, True, True

Discuss

Answer: (b).True, True, False

Q10.

State True or False.

i) An undirected graph which contains no cycles is called forest.

ii) A graph is said to be complete if there is an edge between every pair of vertices.

True, True

False, True

False, False

True, False

Discuss

Answer: (a).True, True

Page 1 of 17

Welcome to the Graphs MCQs Page

Graphs MCQs | Page 1 of 17

Explore more Topics under Data Structures and Algorithms

Data Structures Basics

Data Types and Abstraction

Algorithm Complexity

Arrays and Pointers

Linked Lists

Stacks and Queues

Recursion

Trees

String Operations

Sorting and Searching

Object Oriented Programming

Dynamic Programming

Suggested Topics

Microprocessor

Embedded Systems

UNIX

Digital Logic Design

Computer Hardware

JavaScript

Computer Graphics

DBMS

Data Structures and Algorithms