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

Explore more Topics under UGC CBSE NET Exam

Q111.
What is the maximum number of parenthesis that will appear on the stack at any one time for parenthesis expression given by

( ()     (())         (()) )

a.

2

b.

3

c.

4

d.

5

Discuss
Answer: (b).3
Q112.
The solution of the recurrence relation of

a.

O(n^2)

b.

O(nlg n)

c.

O(n)

d.

O(l g n)

Discuss
Answer: (c).O(n)
Q113.
Suppose that the splits at every level of quicksort are in the proportion (1 – a) to a, where 0 < a ≤ ½ is a constant. The minimum depth of a leaf in the recursion tree is approximately given by

a.

A

b.

B

c.

C

d.

D

Discuss
Answer: (c).C
Q114.
Suppose that the splits at every level of Quicksort are in proportion 1-β to β, where 0<β≤0.5 is a constant. The number of elements in an array is n. The maximum depth is approximately

a.

0.5 β Ig n

b.

0.5 (1–β) Ig n

c.

– (Ig n)/(Ig β)

d.

– (Ig n)/Ig (1–β)

Discuss
Answer: (d).– (Ig n)/Ig (1–β)
Q115.
The minimum number of nodes in a binary tree of depth d (root is at level 0) is

a.

2^d – 1

b.

2^d+1 – 1

c.

d + 1

d.

d

Discuss
Answer: (c).d + 1
Q116.
The efficient data structure to insert/delete a number in a stored set of numbers is

a.

Queue

b.

Linked list

c.

Doubly linked list

d.

Binary tree

Discuss
Answer: (c).Doubly linked list
Q117.
Consider the following statements:

(i) A graph in which there is a unique path between every pair of vertices is a tree.
(ii) A connected graph with e = v – 1 is a tree.
(iii) A graph with e = v – 1 that has no circuit is a tree.

Which of the above statements is/are true?

a.

(i) & (iii)

b.

(ii) & (iii)

c.

(i) & (ii)

d.

All of the above

Discuss
Answer: (d).All of the above
Q118.
Consider the In-order and Post-order traversals of a tree as given below:

In-order: j e n k o p b f a c l g m d h i
Post-order: j n o p k e f b c l m g h i d a
The Pre-order traversal of the tree shall be

a.

a b f e j k n o p c d g l m h i

b.

a b c d e f j k n o p g l m h i

c.

a b e j k n o p f c d g l m h i

d.

j e n o p k f b c l m g h i d a

Discuss
Answer: (c).a b e j k n o p f c d g l m h i
Q119.
A simple graph G with n-vertices is connected if the graph has

a.

(n – 1) (n – 2)/2 edges

b.

more than (n – 1) (n – 2)/2 edges

c.

less than (n – 1) (n – 2)/2 edges

d.

Σki=1 C(ni, 2) edges

Discuss
Answer: (b).more than (n – 1) (n – 2)/2 edges
Q120.
Linked Lists are not suitable for ...................

a.

Binary Search

b.

Polynomial Manipulation

c.

Insertion

d.

Radix Sort

Discuss
Answer: (a).Binary Search
Page 12 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!

CSS

Polish your web design skills with our CSS MCQs. Learn about selectors, properties,...

Cyber Security

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

Compiler Design

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

Data Warehousing and OLAP

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

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

Java Programming

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

Microprocessor

Understand the heart of your computer with our Microprocessor MCQs. Topics include...

Systems Analysis and Design Methods

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

MongoDB

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