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 3 of 27

Explore more Topics under UGC CBSE NET Exam

Q21.
How many PUSH and POP operations will be needed to evaluate the following expression by reverse polish notation in a stack machine (A * B) + (C * D/E)?

a.

4 PUSH and 3 POP instructions

b.

5 PUSH and 4 POP instructions

c.

6 PUSH and 2 POP instructions

d.

5 PUSH and 3 POP instructions

Discuss
Answer: (b).5 PUSH and 4 POP instructions
Q22.
Consider an array A[20. 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11,5]? Assume row major storage.

a.

560

b.

565

c.

570

d.

575

Discuss
Answer: (a).560
Q23.
Convert the following infix expression into its equivalent post fix expression (A + B^D)/(E - F) + G

a.

ABD^ + EF-/G+

b.

ABD + ^EF-/G+

c.

ABD + ^EF/-G+

d.

ABD^ + EF/-G+

Discuss
Answer: (a).ABD^ + EF-/G+
Q24.
Any decision tree that sorts n elements has height

a.

Ω (n)

b.

Ω(/gn)

c.

Ω(n/gn)

d.

Ω(n^2)

Discuss
Answer: (d).Ω(n^2)
Q25.
Match the following .
     List- I                                                    List - II
a. Bucket sort                                      i. O(n^3/gn)
b. Matrix chain multiplication           ii. O(n^3) 
c. Huffman codes                             iii. O(nlgn)
d. All pairs shortest paths               iv. O(n)

code:
a   b   c   d

a.

iv   ii   i   iii

b.

ii   iv   i   iii

c.

iv   ii   iii   i

d.

iii   ii   iv   i

Discuss
Answer: (d).iii   ii   iv   i
Q26.
Suppose that we have numbers between 1 and 1000 in a binary search tree and we want to search for the number 365. Which of the following sequences could not be the sequence of nodes examined ?

a.

4, 254,403, 400,332,346, 399, 365

b.

926,222,913,246,900,260,364,365

c.

927,204,913, 242,914,247,365

d.

4,401,389,221,268, 384,383, 280,365

Discuss
Answer: (c).927,204,913, 242,914,247,365
Q27.
Converting a primitive type data into its corresponding wrapper class object instance is called

a.

Boxing

b.

Wrapping

c.

Instantiation

d.

Autoboxing

Discuss
Answer: (d).Autoboxing
Q28.
Consider the following statements-

(a) Depth - first search is used to traverse a rooted tree. 
(b) Pre - order, Post-order and Inorder are used to list the vertices of an ordered rooted tree.
(c) Huffman's algorithm is used to find an optimal binary tree with given weights.
(d) Topological sorting provides a labelling such that the parents have larger labels than their children.

Which of the above statements are true ?

a.

(a) and (b)

b.

(c) and (d)

c.

(a) , (b) and (c)

d.

(a), (b) , (c) and (d)

Discuss
Answer: (d).(a), (b) , (c) and (d)
Q29.
The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively.The post order traversal is ______________.

a.

dbefacg

b.

debfagc

c.

dbefcga

d.

debfgca

Discuss
Answer: (d).debfgca
Q30.
Level order Traversal of a rooted Tree can be done by starting from root and performing

a.

Breadth First Search

b.

Depth first search

c.

Root search

d.

Deep search

Discuss
Answer: (a).Breadth First Search
Page 3 of 27

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!

IT Fundamentals

Navigate the basics of information technology with our IT Fundamentals MCQs. Get a...

MongoDB

Learn the leading NoSQL database with our MongoDB MCQs. Understand everything from...

Data Warehousing and OLAP

Strengthen your knowledge of Data Warehousing and OLAP with our specialized MCQs....

HTML

Start your journey in web development with our HTML MCQs. Learn the building blocks...

Microprocessor

Understand the heart of your computer with our Microprocessor MCQs. Topics include...

Digital Communication

Master the basics of electronic communication with our Digital Communication MCQs....

CompTIA PenTest+ Certification Exam PT0 002

Prepare for the CompTIA PenTest+ PT0-002 exam with our targeted MCQs. Covering...

Digital Logic Design

Understand the foundation of digital computers with our Digital Logic Design MCQs....

UNIX

Become proficient with the Unix operating system using our UNIX MCQs. Learn about...