adplus-dvertising

Welcome to the Data Structures and Algorithms MCQs Page

Dive deep into the fascinating world of Data Structures and Algorithms with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Data Structures and Algorithms, a crucial aspect of UGC CBSE NET Exam. In this section, you will encounter a diverse range of MCQs that cover various aspects of Data Structures and Algorithms, 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 UGC CBSE NET Exam.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Data Structures and Algorithms. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of UGC CBSE NET Exam.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Data Structures and Algorithms. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Data Structures and Algorithms MCQs | Page 15 of 27

Q141.
The number of colours required to properly colour the vertices of every planer graph is

a.

2

b.

3

c.

4

d.

5

Discuss
Answer: (d).5
Discuss
Answer: (d).All of the above
Q143.
The Inorder traversal of the tree will yield a sorted listing of elements of tree in
Discuss
Answer: (b).Binary search tree
Q144.
Which of the following data structure is linear type ?
Discuss
Answer: (d).All of the above
Q145.
To represent hierarchical relationship between elements, which data structure is suitable?
Discuss
Answer: (c).Tree
Q146.
Consider the following pseudo code segment :

K:=0
 for i1:= l to n
  for i2:= 1 to i1
   :
   :
   :
    for im:= 1 to im–1
     K:= K+1

The value of K after the execution of this code shall be
Discuss
Answer: (a).C(n + m – 1, m)
Q147.
Number of binary trees formed with 5 nodes are
Discuss
Answer: (d).42
Q148.
The following postfix expression is evaluated using a stack

823^/23* + 51* –

The top two elements of the stack after first * is evaluated
Discuss
Answer: (a).6, 1
Q149.
Consider the following pseudo-code :

If (A > B) and (C > D) then
A = A + 1
B = B + 1
Endif

The cyclomatic complexity of the pseudo-code is

a.

2

b.

3

c.

4

d.

5

Discuss
Answer: (b).3
Q150.
Which one of the following binary search tree is optimal, if probabilities of successful search and unsuccessful search are same ?

a.

A

b.

B

c.

C

d.

D

Discuss
Answer: (d).D

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!