Explore topic-wise MCQs in Data Structures and Algorithms.

This section includes 14 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structures and Algorithms knowledge and support exam preparation. Choose a topic below to get started.

1.

MultiGraphs having self-loops are called PseudoGraphs?

A. True
B. False
Answer» B. False
Discussion
2.

What is the degree sequence of the given HyperGraph, in non-increasing order.V = {v1,v2,v3,v4,v5,v6} E = {{v1,v4,v5} {v2,v3,v4,v5} {v2} {v1} {v1,v6}}

A. 3,2,1,1,1,1
B. 3,2,2,2,1,1
C. 3,2,2,2,2,1
D. 3,2,2,1,1,1
Answer» C. 3,2,2,2,2,1
Discussion
3.

What would be the Incidence Matrix of the given HyperGraph?V = {x,y,z} E = {{x,y}{y}{x,z}{z,y}}

A. {{1,0,1,0}, {1,1,0,1}, {0,0,1,1}}
B. {{1,1,0,0}, {0,1,0,0}, {1,1,1,0}}
C. {{0,1,0,1}, {0,0,1,0}, {1,1,0,0}}
D. None of the Mentioned
Answer» B. {{1,1,0,0}, {0,1,0,0}, {1,1,1,0}}
Discussion
4.

Possible number of labelled simple Directed, Pseudo and Multigarphs exist having 2 vertices?

A. 3, Infinite, 4
B. 4, 3, Infinite
C. 4, Infinite, infinite
D. 4, Infinite, Infinite
Answer» E.
Discussion
5.

Which of the following statement is true.

A. There exists a Simple Graph having 10 vertices such that minimum degree of the graph is 0 and maximum degree is 9
B. There exists a MultiGraph having 10 vertices such that minimum degree of the graph is 0 and maximum degree is 9
C. There exists a MultiGraph as well as a Simple Graph having 10 vertices such that minimum degree of the graph is 0 and maximum degree is 9
D. None of the mentioned
Answer» C. There exists a MultiGraph as well as a Simple Graph having 10 vertices such that minimum degree of the graph is 0 and maximum degree is 9
Discussion
6.

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

A. 3
B. 6
C. 4
D. Information given is insufficient
Answer» C. 4
Discussion
7.

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

A. only i)
B. ii) and iii)
C. i) and iii)
D. i) ii) and iii)
Answer» D. i) ii) and iii)
Discussion
8.

MULTIGRAPHS_HAVING_SELF-LOOPS_ARE_CALLED_PSEUDOGRAPHS??$

A. True
B. False
Answer» B. False
Discussion
9.

What is the degree sequence of the given HyperGraph, in non-increasing order?

A.
B. 3,2,1,1,1,1
C. 3,2,2,2,1,1
Answer» C. 3,2,2,2,1,1
Discussion
10.

Which of the following is a HyperGraph, where V is the set of vertices, E is the set of edges?

A. V = {v1, v2, v3} E = {e1, e2} = {{v2, v3} {v1, v3}}
B. V = {v1, v2} E = {e1} = {{v1, v2}}
C. V = {v1, v2, v3} E = {e1, e2, e3} = {{v2, v3}{v3, v1}{v2, v1}}
D. All of the mentioned
Answer» E.
Discussion
11.

Possible number of labelled simple Directed, Pseudo and Multigarphs exist having 2 vertices?

A. 3, Infinite, 4
B. 4, 3, Infinite
C. 4, Infinite, infinite
D. 4, Infinite, Infinite
Answer» E.
Discussion
12.

Determine the number of vertices for the given Graph or Multigraph?

A.
B. 3
C. 6
Answer» C. 6
Discussion
13.

All undirected Multigraphs contain eulerian cycles.

A. True
B. False
Answer» B. False
Discussion
14.

Given Adjacency matrices determine which of them are PseudoGraphs?

A. {{1,0} {0,1}}
B. {{0,1}{1,0}}
C. {{0,0,1}{0,1,0}{1,0,0}}
D. only i)
Answer» D. only i)
Discussion