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

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

Q1.
The worst case time complexity of AVL tree is better in comparison to binary search tree for
Answer: (d).Search, Insert and Delete Operations
Q2.
Which of the following are two special functions that are meant for handling exception, that occur during exception handling itself ?
Answer: (a).Void terminate ( ) and Void unexpected ( )
Q3.
Given an empty stack, after performing push (1), push (2), Pop, push (3), push (4), Pop, Pop, push(5), Pop, what is the value of the top of the stack ?

a.

4

b.

3

c.

2

d.

1

Q4.
The total number of spanning trees that can be drawn using five labelled vertices is:
Q5.
Suppose there are logn sorted lists of n logn elements each. The time complexity of producing a sorted list of all these elements is (use heap data structure)
Answer: (a).O (n log logn)
Q6.
The Object Modelling Technique (OMT) uses the following three kinds of model to describe a system
Answer: (b).Object Model, Dynamic Model, and Functional Model
Q7.
An example of a dictionary-based coding technique is
Q8.
A algorithm is guaranteed to find an optimal solution if
Answer: (c).h' never overestimates h
Q9.
What is the value of the postfix expression ?
abc d + - * (where a = 8 , b = 4 , c = 2 and d = 5)