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

Explore more Topics under UGC CBSE NET Exam

Q171.
In a complete binary tree of n nodes, how far are the two most distant nodes? Assume each edge in the path counts as !

a.

About log2n

b.

About 2 log2n

c.

About n log2n

d.

About 2n

Discuss
Answer: (b).About 2 log2n
Q172.
In a B tree of order 5, the following keys are inserted as follows :

7, 8, 1, 4, 13, 20, 2, 6 and 5

How many elements are present in the root of the tree?

a.

1

b.

2

c.

3

d.

4

Discuss
Answer: (b).2
Q173.
Encapsulation is

a.

Dynamic binding

b.

A mechanism to associate the code and data

c.

Data abstraction

d.

Creating new class

Discuss
Answer: (b).A mechanism to associate the code and data
Q174.
Which of the statements are true?

I. Function overloading is done at compile time.
II. Protected members are accessible to the member of derived class.
III. A derived class inherits constructors and destructors.
IV. A friend function can be called like a normal function.
V. Nested class is a derived class.

a.

I, II, III

b.

II, III, V

c.

III, IV, V

d.

I, II, IV

Discuss
Answer: (d).I, II, IV
Q175.
If the number of leaves in a strictly binary tree is an odd number, then what can you say with full conviction about total number of nodes in the tree?

a.

It is an odd number.

b.

It is an even number.

c.

It cannot be equal to the number of leaves.

d.

It is always greater than twice the number of leaves.

Discuss
Answer: (a).It is an odd number.
Q176.
The number of edges in a complete graph of n vertices is

a.

n

b.

n(n – 1)/2

c.

n(n + 1)/2

d.

n^2/2

Discuss
Answer: (b).n(n – 1)/2
Q177.
At a hill station, the parking lot is one long drive way snaking up a hill side. Cars drive in and park right behind the car in front of them, one behind another. A car can’t leave until all the cars in front of it have left. Is the parking lot more like

a.

An array

b.

A stack

c.

A queue

d.

A linked list

Discuss
Answer: (c).A queue
Q178.
With regard to linked list, which of the following statement is false?

a.

An algorithm to search for an element in a singly linked list requires 0(n) operations in the worst case.

b.

An algorithm for deleting the first element in a singly linked list requires 0(n) operations in the worst case.

c.

An algorithm for finding the maximum value in a circular linked list requires 0(n) operations.

d.

An algorithm for deleting the middle node of a circular linked list requires 0(n) operations.

Discuss
Answer: (b).An algorithm for deleting the first element in a singly linked list requires 0(n) operations in the worst case.
Q179.
A hash function f defined as f(key) = key mod 7, with linear probing used to resolve collisions. Insert the keys 37, 38, 72, 48, 98 and 11 into the table indexed from 0 to 6. What will be the location of 11?

a.

3

b.

4

c.

5

d.

6

Discuss
Answer: (c).5
Q180.
In a B tree of order m with p nodes the average number of splits is at most:

a.

A

b.

B

c.

C

d.

D

Discuss
Answer: (b).B
Page 18 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!

Java Spring Framework

Enhance your Java development skills with our Spring Framework MCQs. Learn about...

Software Engineering

Learn about the systematic approach to developing software with our Software...

HTML

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

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

Cyber Security

Understand the fundamentals of safeguarding digital assets with our Cyber Security...

Internet of Things (IoT)

Discover how devices communicate with each other in the smart world with our IoT...

Digital Image Processing (DIP)

Delve into the techniques of enhancing digital images with our Digital Image...

Human Computer Interaction

Enhance your knowledge of Human-Computer Interaction with our specialized MCQs....

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...