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

Q121.

For any two different vertices u and v of an Acyclic Directed Graph if v is reachable from u, u is also reachable from v?

True

False

May be

Can't say

Discuss

Answer: (b).False

Q122.

What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?

Depends on a Graph

Will always be zero

Will always be greater than zero

May be zero or greater than zero

Discuss

Answer: (b).Will always be zero

Q123.

In which of the following does a Directed Acyclic Word Graph finds its application in?

String Matching

Number Sorting

Manipulations on numbers

None of the mentioned

Discuss

Answer: (a).String Matching

Q124.

What is time complexity to check if a string(length S1) is a substring of another string(length S2) stored in a Directed Acyclic Word Graph, given S2 is greater than S1?

O(S1)

O(S2)

O(S1+S2)

O(1)

Discuss

Answer: (a).O(S1)

Q125.

In which of the following case does a Propositional Directed Acyclic Graph is used for?

Representation of Boolean Functions

String Matching

Searching

Sorting of number

Discuss

Answer: (a).Representation of Boolean Functions

Q126.

Every Binary Decision Diagram is also a Propositional Directed Acyclic Graph.

True

False

May be

Can't say

Discuss

Answer: (a).True

Q127.

In a Propositional Directed Acyclic Graph Leaves maybe labelled with a boolean variable.

True

False

May be

Can't say

Discuss

Answer: (a).True

Q128.

Given Adjacency matrices determine which of them are PseudoGraphs?

i) {{1,0} {0,1}}

ii) {{0,1}{1,0}}

iii) {{0,0,1}{0,1,0}{1,0,0}}

only i)

ii) and iii)

i) and iii)

i) ii) and iii)

Discuss

Answer: (c).i) and iii)

Q129.

All undirected Multigraphs contain eulerian cycles.

True

False

May be

Can't say

Discuss

Answer: (a).True

Q130.

Determine the number of vertices for the given Graph or Multigraph?
G is a 4-regular Graph having 12 edges.

Information given is insufficient

Discuss

Answer: (b).6

Page 13 of 17

Welcome to the Graphs MCQs Page

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

CompTIA PenTest+ Certification Exam PT0 002

Operating System

Object Oriented Programming Using C++

JavaScript

Wireless and Mobile Communications

Cloud Computing

Cyber Security

PHP

IT Fundamentals