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

Explore more Topics under UGC CBSE NET Exam

Q51.
Which of the following is a valid heap?

a.

A

b.

B

c.

C

d.

D

Discuss
Answer: (b).B
Q52.
If following sequence of keys are inserted in a B+ tree with K(=3) pointers:

8, 5, 1, 7, 3, 12, 9, 6

Which of the following shall be correct B+ tree?

a.

1

b.

2

c.

3

d.

4

Discuss
Answer: (a).1
Q53.
Any decision tree that sorts n elements has height ..............

a.

Ω(log n)

b.

Ω(n)

c.

Ω(n log n)

d.

Ω(n2)

Discuss
Answer: (c).Ω(n log n)
Q54.
Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case.

a.

O(1)

b.

O(log n)

c.

O(n)

d.

O(n log n)

Discuss
Answer: (b).O(log n)
Q55.
Dijkstra’s algorithm is based on

a.

Divide and conquer paradigm

b.

Dynamic Programming

c.

Greedy Approach

d.

Backtracking paradigm

Discuss
Answer: (c).Greedy Approach
Q56.
Match the following with respect to algorithm paradigms:
List-I                              List-II
a. Merge sort                 i. Dynamic Programming
b. Huffman coding       ii. Greedy approach
c. Optimal polygon triangulation iii. Divide and conquer
d. Subset sum problem          iv. Back tracking

Codes:
     a   b  c   d

a.

iii  i   ii   iv

b.

ii   i   iv  iii

c.

ii   i   iii  iv

d.

iii  ii  i    iv

Discuss
Answer: (d).iii  ii  i    iv
Q57.
Abstraction and encapsulation are fundamental principles that underlie the object oriented approach to software development. What can you say about the following two statements?

I. Abstraction allows us to focus on what something does without considering the complexities of how it works.
II. Encapsulation allows us to consider complex ideas while ignoring irrelevant detail that would confuse us.

a.

Neither I nor II is correct

b.

Both I and II are correct

c.

Only II is correct

d.

Only I is correct

Discuss
Answer: (a).Neither I nor II is correct
Q58.
Which of the following statement(s) with regard to an abstract class in JAVA is/are TRUE?

I. An abstract class is one that is not used to create objects.
II. An abstract class is designed only to act as a base class to be inherited by other classes.

a.

Only l

b.

Only II

c.

Neither I nor II

d.

Both l and II

Discuss
Answer: (d).Both l and II
Q59.
With respect to a loop in the transportation table, which one of the following is not correct?

a.

Every loop has an odd no. of cells and at least 5

b.

Closed loops may or may not b square in shape

c.

All the cells in the loop that have a plus or minus sign, except the starting cell, must be occupied cells

d.

Every loop has an even no. of cells and at least four

Discuss
Answer: (a).Every loop has an odd no. of cells and at least 5
Q60.
At which of the following stage(s), the degeneracy do not occur in transportation problem?
(m, n represents number of sources and destinations respectively)

(a) While the values of dual variables ui and vj cannot be computed.
(b) While obtaining an initial solution, we may have less than m + n -1 allocations.
(c) At any stage while moving towards optimal solution, when two or more occupied cells with the same minimum allocation become unoccupied simultaneously.
(d) At a stage when the no. of +ve allocation is exactly m + n - 1.

a.

(a), (b) and (c)

b.

(a), (c) and (d)

c.

(a) and (d)

d.

(a), (b), (c) and (d)

Discuss
Answer: (c).(a) and (d)
Page 6 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!

Formal Languages and Automata Theory

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

Systems Analysis and Design Methods

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

Management Information Systems

Discover how businesses leverage technology with our Management Information Systems...

Hadoop

Dive into the world of big data with our Hadoop MCQs. Cover key concepts including...

Data Science

Discover the fascinating world of extracting insights from data with our Data Science...

Systems Programming

Decode low-level programming with our Systems Programming MCQs. These questions delve...

HTML

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

Computer Graphics

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

Artificial Intelligence

Get started on the path to the future with our Artificial Intelligence MCQs. Covering...