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

Explore more Topics under UGC CBSE NET Exam

Q241.
In a ternary tree, the number of internal nodes of degree 1, 2, and 3 is 4, 3, and 3 respectively. The number of leaf nodes in the ternary tree is

a.

9

b.

10

c.

11

d.

12

Discuss
Answer: (b).10
Q242.
Match List-I with List-II and choose the correct answer from the code given below:

List I (Graph Algorithm) List II (Time Complexity)
(a) Dijkstra’s algorithm (i) O(E lg E)
(b) Kruskal’s algorithm (ii) Θ(V3)
(c) Floyd-Warshall algorithm (iii) O(V2)
(d) Topological sorting (iv) Θ(V+E)

where V and E are the number of vertices and edges in graph respectively.

a.

(a)-(i), (b)-(iii), (c)-(ii), (d)-(iv)

b.

(a)-(iii), (b)-(i), (c)-(ii), (d)-(iv)

c.

(a)-(i), (b)-(iii), (c)-(iv), (d)-(ii)

d.

(a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)

Discuss
Answer: (b).(a)-(iii), (b)-(i), (c)-(ii), (d)-(iv)
Q243.
In K-coloring of an undirected graph G=(V,E) is a function. c:V→{0,1,…,K−1} such that c(u)≠c(v) for every edge (u,v)∈E.

Which of the following is not correct?

a.

G is bipartite

b.

G is 2-colorable

c.

G has cycles of odd length

d.

G has no cycles of odd length

Discuss
Answer: (c).G has cycles of odd length
Q244.
Consider a singly linked list. What is the worst case time complexity of the best-known algorithm to delete the node a, pointer to this node is q, from the list?

a.

O(n lg n)

b.

O(n)

c.

O(lg n)

d.

O(1)

Discuss
Answer: (b).O(n)
Q245.
The second smallest of n elements can be found with ............... comparisons in the worst case.

a.

n−1

b.

lg n

c.

n+ceil(lg n) - 2

d.

3n/2

Discuss
Answer: (c).n+ceil(lg n) - 2
Q246.
Consider the following statements related to AND-OR Search algorithm.

S1: A solution is a subtree that has a goal node at every leaf.
S2: OR nodes are analogous to the branching in a deterministic environment.
S3: AND nodes are analogous to the branching in a non-deterministic environment.

Which of the following is true referencing the above statements?

a.

S1 – False, S2 – True, S3 – True

b.

S1 – True, S2 – True, S3 – False

c.

S1 – True, S2 – True, S3 – True

d.

S1 – False, S2 – True, S3 – False

Discuss
Answer: (c).S1 – True, S2 – True, S3 – True
Q247.
The solution of the recurrence relation
T(m) = T(3m/4) + 1 is:

a.

θ (lg m)

b.

θ (m)

c.

θ (mlg m)

d.

θ (lglg m)

Discuss
Answer: (a).θ (lg m)
Q248.
Consider the array A=<4, 1, 3, 2, 16, 9, 10, 14, 8, 7>. After building heap from the array A, the depth of the heap and the right child of max-heap are .............. and .................. respectively. (Root is at level 0).

a.

3, 14

b.

3, 10

c.

4, 14

d.

4, 10

Discuss
Answer: (b).3, 10
Q249.
A hash function h defined h(key)=key mod 7, with linear probing, is used to insert the keys 44, 45, 79, 55, 91, 18, 63 into a table indexed from 0 to 6. What will be the location of key 18?

a.

3

b.

4

c.

5

d.

6

Discuss
Answer: (c).5
Q250.
Which of the following algorithms solves the single-source shortest paths?

a.

Prim’s algorithm

b.

Floyd - Warshall algorithm

c.

Johnson’s algorithm

d.

Dijkstra’s algorithm

Discuss
Answer: (d).Dijkstra’s algorithm
Page 25 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...

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...

MS Office

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

Computer Graphics

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

Object Oriented Programming Using C++

Enhance your programming skills with our MCQs on Object Oriented Programming using...

Systems Analysis and Design Methods

Get familiar with the process of designing and improving business systems with our...

Java Spring Framework

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

Data Warehousing and OLAP

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

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...