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

Explore more Topics under UGC CBSE NET Exam

Q131.
The value of postfix expression:

8 3 4 + - 3 8 2 / + * 2 $ 3+ is

a.

17

b.

131

c.

64

d.

52

Discuss
Answer: (d).52
Q132.
Consider the following statements for priority queue:

S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations.
S2: The elements of a priority queue may be complex structures that are ordered on one or several fields.

Which of the following is correct?

a.

Both S1 and S2 are incorrect

b.

S1 is correct and S2 is incorrect

c.

SI is incorrect and S2 is correct

d.

Both S1 and S2 are correct

Discuss
Answer: (d).Both S1 and S2 are correct
Q133.
Give as good a big-O estimate as possible for the following functions:

(nlogn+n^2)(n^3+2) and (n!+2^n)(n^3+log(n^2+ 1))

a.

O(n^5+2n^2) & O(n^3*n!)

b.

O(n^5) & O(n^3*2^n)

c.

O(n^5) & O(n^3*n!)

d.

O(n^5+2n^2) & O(n^3*2^n)

Discuss
Answer: (c).O(n^5) & O(n^3*n!)
Q134.
In any n-element heap, the number of nodes of height h is

a.

less than equal to [n/2^h]

b.

greater than [n/2^h]

c.

greater than [n/2^h+1]

d.

less than equal to [n/2^h+1]

Discuss
Answer: (d).less than equal to [n/2^h+1]
Q135.
A vertex cover of an undirected graph G(V, E) is a subset V1 ⊆ V vertices such that

a.

Each pair of vertices in V1 is connected by an edge

b.

If (u, v) ∈ E then u ∈ V1 and v ∈ V1

c.

If (u, v) ∈ E then u ∈ V1 or v ∈ V1

d.

All pairs of vertices in V1 are not connected by an edge

Discuss
Answer: (c).If (u, v) ∈ E then u ∈ V1 or v ∈ V1
Q136.
Suppose you want to delete the name that occurs before “Vivek” in an alphabetical listing. Which of the following data structures shall be most efficient for this operation?

a.

Circular linked list

b.

Doubly linked list

c.

Linked list

d.

Dequeue

Discuss
Answer: (b).Doubly linked list
Q137.
Consider the tree given below. Using the property of eccentricity of a vertex, find every vertex that is the centre of the given tree.

a.

d&h

b.

c&k

c.

g, b, c, h, i, m

d.

c&h

Discuss
Answer: (d).c&h
Q138.
Two graphs A and B are shown below. Which one of the following statement is true ?

a.

Both A and B are planar.

b.

Neither A nor B is planar.

c.

A is planar and B is not.

d.

B is planar and A is not.

Discuss
Answer: (a).Both A and B are planar.
Q139.
The postfix expression AB+CD–* can be evaluated using a

a.

stack

b.

tree

c.

queue

d.

linked list

Discuss
Answer: (a).stack
Q140.
The post order traversal of a binary tree is DEBFCA. Find out the preorder traversal.

a.

ABFCDE

b.

ADBFEC

c.

ABDECF

d.

None of the above

Discuss
Answer: (c).ABDECF
Page 14 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!

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....

Operating System

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

Data Warehousing and OLAP

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

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

Internet of Things (IoT)

Discover how devices communicate with each other in the smart world with our IoT...

HTML

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

Artificial Intelligence

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

Object Oriented Programming

Enhance your coding skills with our Object Oriented Programming MCQs. Understand...

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...