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 7 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

Q61.

For which of the following combinations of the degrees of vertices would the connected graph be eulerian?

1,2,3

2,3,4

2,4,5

1,3,5

Discuss

Answer: (a).1,2,3

Q62.

A graph with all vertices having equal degree is known as a __________

Multi Graph

Regular Graph

Simple Graph

Complete Graph

Discuss

Answer: (b).Regular Graph

Q63.

Which of the following ways can be used to represent a graph?

Adjacency List and Adjacency Matrix

Incidence Matrix

Adjacency List, Adjacency Matrix as well as Incidence Matrix

None of the mentioned

Discuss

Answer: (c).Adjacency List, Adjacency Matrix as well as Incidence Matrix

Q64.

The number of elements in the adjacency matrix of a graph having 7 vertices is __________

Discuss

Answer: (d).49

Q65.

What would be the number of zeros in the adjacency matrix of the given graph?

Discuss

Answer: (b).6

Q66.

Adjacency matrix of all graphs are symmetric.

False

True

May be

Can't say

Discuss

Answer: (a).False

Q67.

The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is ____________

O(V)

O(E^2)

O€

O(V^2)

Discuss

Answer: (d).O(V^2)

Q68.

For the adjacency matrix of a directed graph the row sum is the _________ degree and the column sum is the ________ degree.

in, out

out, in

in, total

total, out

Discuss

Answer: (b).out, in

Q69.

What is the maximum number of possible non zero values in an adjacency matrix of a simple graph with n vertices?

(n*(n-1))/2

(n*(n+1))/2

n*(n-1)

n*(n+1)

Discuss

Answer: (c).n*(n-1)

Q70.

On which of the following statements does the time complexity of checking if an edge exists between two particular vertices is not, depends?

Depends on the number of edges

Depends on the number of vertices

Is independent of both the number of edges and vertices

It depends on both the number of edges and vertices

Discuss

Answer: (c).Is independent of both the number of edges and vertices

Page 7 of 17

Welcome to the Graphs MCQs Page

Graphs MCQs | Page 7 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

R Programming

PHP

Hadoop

Compiler Design

Reverse Engineering

MongoDB

DBMS

Management Information Systems

Human Computer Interaction