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

Explore more Topics under UGC CBSE NET Exam

Q161.
When the priority queue is represented by max heap, the insertion and deletion of an element can be performed in (queue containing n elements)

a.

θ(n) and θ(1) respectively

b.

θ(n) and θ(n) respectively

c.

θ(1) and θ(1) respectively

d.

None of the above

Discuss
Answer: (c).θ(1) and θ(1) respectively
Q162.
An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are

a.

all of even degree

b.

all of odd degree

c.

of any degree

d.

even in number

Discuss
Answer: (a).all of even degree
Q163.
The minimum number of edges in a connected graph with ‘n’ vertices is equal to

a.

n(n–1)

b.

n(n–1)/2

c.

n^2

d.

n–1

Discuss
Answer: (d).n–1
Q164.
What is the maximum number of nodes in a B-tree of order 10 of depth 3 (root at depth 0)?

a.

111

b.

999

c.

9999

d.

None of the above

Discuss
Answer: (d).None of the above
Q165.
A binary tree with 27 nodes has …………. null branches.

a.

54

b.

27

c.

26

d.

None of the above

Discuss
Answer: (d).None of the above
Q166.
The time complexity to build a heap of n elements is

a.

O(1)

b.

O(lgn)

c.

O(n)

d.

O(nlgn)

Discuss
Answer: (d).O(nlgn)
Q167.
Which of the following can be the sequence of nodes examined in binary search tree while searching for key 88?

a.

90, 40, 65, 50, 88

b.

90, 110, 80, 85, 88

c.

190, 60, 90, 85, 88

d.

65, 140, 80, 70, 88

Discuss
Answer: (c).190, 60, 90, 85, 88
Q168.
For your ATM debit card, you have a 4-decimal-digit personal secret code. In the absence of any clue, a brute-force attack takes time-‘t’ to crack the code on an ATM terminal. Therefore ‘t’ is the secure-time for a customer to report in case the card is misplaced. Your Bank has decided to facilitate an increased secure-time. Out of the following, which option should provide the largest rise in the value of ‘t’ ?

a.

Instead of 4-decimal-digits, maintain the personal secret code in 4-hexadecimal-digits.

b.

Instead of 4-decimal digits, maintain a 5-decimal-digit personal secret code.

c.

Reduce the processing speed of the ATM terminals to the half of their current speed.

d.

None of the above provides any improvement.

Discuss
Answer: (b).Instead of 4-decimal digits, maintain a 5-decimal-digit personal secret code.
Q169.
If we have six stack operations pushing and popping each of A, B and C-such that push (A) must occur before push (B) which must occur before push (C), then A, C, B is a possible order for the pop operations, since this could be our sequence : push (A), pop (A), push (B), push (C), pop (C), pop (B). Which one of the following orders could not be the order the pop operations are run, if we are to satisfy the requirements described above?

a.

ABC

b.

CBA

c.

BAC

d.

CAB

Discuss
Answer: (d).CAB
Q170.
What is the most appropriate data structure to implement a priority queue?

a.

Heap

b.

Circular array

c.

Linked list

d.

Binary tree

Discuss
Answer: (a).Heap
Page 17 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!

Operating System

Dive deep into the core of computers with our Operating System MCQs. Learn about...

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

MS Office

Master the suite of productivity tools with our MS Office MCQs. From Word and Excel...

Software Architecture and Design

Get a strong hold on the blueprint of software systems with our Software Architecture...

R Programming

Unleash the power of statistical computing with our R Programming MCQs. Topics cover...

Cryptography and Network Security

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

Wireless and Mobile Communications

Get to grips with modern communication technologies with our Wireless and Mobile...

MongoDB

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

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...