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

Explore more Topics under UGC CBSE NET Exam

Q61.
Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the representation, which of the following operation cannot be implemented in O(1) time ?

a.

Insertion at the front of the linked list

b.

Insertion at the end of the linked list

c.

Deletion of the front node of the linked list

d.

Deletion of the last node of the linked list

Discuss
Answer: (d).Deletion of the last node of the linked list
Q62.
Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j) | 1 ≤ i ≤ 12, 1 ≤ j ≤ 12}. There is an edge between (a, b) and (c, d) if |a – c| ≤ 1 or |b–d| ≤ 1. The number of edges in this graph is

a.

726

b.

796

c.

506

d.

616

Discuss
Answer: (d).616
Q63.
The runtime for traversing all the nodes of a binary search tree with n nodes and printing them in an order is

a.

O(lg n)

b.

O(n lg n)

c.

O(n)

d.

O(n^2)

Discuss
Answer: (c).O(n)
Q64.
Consider the following statements :

S1: A queue can be implemented using two stacks.
S2: A stack can be implemented using two queues.

Which of the following is correct ?

a.

S1 is correct and S2 is not correct

b.

S1 is not correct and S2 is correct

c.

Both S1 and S2 are correct

d.

Both S1 and S2 are not correct

Discuss
Answer: (c).Both S1 and S2 are correct
Q65.
Given the following prefix expression:

* + 3 + 3 ↑ 3 + 3 3 3

What is the value of the prefix expression?

a.

2178

b.

2199

c.

2205

d.

2232

Discuss
Answer: (c).2205
Q66.
A priority queue is implemented as a max-heap. Initially, it has five elements. The level-order traversal of the heap is as follows:

20, 18, 15, 13, 12

Two new elements ‘10’ and ‘17’ are inserted in the heap in that order. The level-order traversal of the heap after the insertion of the element is:

a.

20, 18, 17, 15, 13, 12, 10

b.

20, 18, 17, 12, 13, 10, 15

c.

20, 18, 17, 10, 12, 13, 15

d.

20, 18, 17, 13, 12, 10, 15

Discuss
Answer: (d).20, 18, 17, 13, 12, 10, 15
Q67.
If there are n integers to sort, each integer has d digits, and each digit is in the set  {1, 2, …, k}, radix sort can sort the numbers in:

a.

O (k (n + d))

b.

O (d (n + k))

c.

O ((n + k) l g d)

d.

O ((n + d) l g k)

Discuss
Answer: (b).O (d (n + k))
Q68.
Match the following:

a. Prim’s algorithm                  i. O(V^2E)
b. Bellman-Ford algorithm     ii. O(VE lgV)
c. Floyd-Warshall algorithm   iii. O(E lgV)
d. Johnson’s algorithm           iv. O(V^3)

Where V is the set of nodes and E is the set of edges in the graph.

Codes :
     a    b   c   d

a.

i    iii   iv  ii

b.

i    iii   ii   iv

c.

iii  i    iv   ii

d.

iii  i    ii   iv

Discuss
Answer: (c).iii  i    iv   ii
Q69.
Constructors have ............. return type.

a.

void

b.

char

c.

int

d.

no

Discuss
Answer: (d).no
Q70.
Method over-riding can be prevented by using final as a modifier at ...............

a.

the start of the class

b.

the start of method declaration

c.

the start of derived class

d.

the start of the method declaration in the derived class

Discuss
Answer: (b).the start of method declaration
Page 7 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!

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

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

Computer Hardware

Explore the tangible components of computers with our Computer Hardware MCQs. Learn...

Digital Logic Design

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

Software Engineering

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

Digital Communication

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

MongoDB

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

Compiler Design

Unravel the process of translating source code into executable programs with our...