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

Explore more Topics under UGC CBSE NET Exam

Q91.
A three dimensional array in ‘C’ is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer):

a.

&A[0][0][0]+w(y*z*q+z*p+r)

b.

&A[0][0][0]+w(y*z*p+z*q+r)

c.

&A[0][0][0]+w(x*y*p+z*q+r)

d.

&A[0][0][0]+w(x*y*q+z*p+r)

Discuss
Answer: (b).&A[0][0][0]+w(y*z*p+z*q+r)
Q92.
In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y where x is discovery time stamp and y is finishing time stamp.
It shows which of the following depth first forest?

a.

{a,b,e} {c,d,f,g,h}

b.

{a,b,e} {c,d,h} {f,g}

c.

{a,b,e} {f,g} {c,d} {h}

d.

{a,b,c,d} {e,f,g} {h}

Discuss
Answer: (a).{a,b,e} {c,d,f,g,h}
Q93.
The number of disk pages access in B-tree search, where h is height, n is the number of keys, and t is the minimum degree, is:

a.

θ(logn h*t)

b.

θ(logt n*h)

c.

θ(logh n)

d.

θ(logt n)

Discuss
Answer: (d).θ(logt n)
Q94.
The inorder traversal of the following tree is:

a.

2 3 4 6 7 13 15 17 18 18 20

b.

20 18 18 17 15 13 7 6 4 3 2

c.

15 13 20 4 7 17 18 2 3 6 18

d.

2 4 3 13 7 6 15 17 20 18 18

Discuss
Answer: (d).2 4 3 13 7 6 15 17 20 18 18
Q95.
An ideal sort is an in-place-sort whose additional space requirement is ...............

a.

O(log2n)

b.

O(nlog2n)

c.

O(1)

d.

O(n)

Discuss
Answer: (c).O(1)
Q96.
Loop unrolling is a code optimization technique:

a.

that avoids tests at every iteration of the loop

b.

that improves performance by decreasing the number of instructions in a basic block

c.

that exchanges inner loops with outer loops

d.

that reorders operations to allow multiple computations to happen in parallel

Discuss
Answer: (a).that avoids tests at every iteration of the loop
Q97.
Match the following w.r.t. programming languages:

List - I                                     List – II
(a) JAVA                        (i) Dynamically object oriented
(b) Python                     (ii) Statically Non-object oriented
(c) Prolog                      (iii) Statically object oriented
(d) ADA                         (iv) Dynamically non-object oriented

Codes:
   (a)  (b)  (c)  (d)

a.

(iii)  (i)   (ii)  (iv)

b.

(i)   (iii)  (ii)  (iv)

c.

(i)   (iii)  (iv) (ii)

d.

(ii)  (iv)  (i)   (iii)

Discuss
Answer: (d).(ii)  (iv)  (i)   (iii)
Q98.
In Activity-Selection problem, each activity i has a start time si and a finish time fi where si≤fi. Activities i and j are compatible if:

a.

si≥fj

b.

sj≥fi

c.

si≥fj or sj≥fi

d.

si≥fj and sj≥fi

Discuss
Answer: (c).si≥fj or sj≥fi
Q99.
Floyd-Warshall algorithm utilizes ............... to solve the all-pairs shortest paths problem on a directed graph in ................ time.

a.

Greedy algorithm, θ(V^3)

b.

Greedy algorithm, θ(V^2 lgn)

c.

Dynamic programming, θ(V^3)

d.

Dynamic programming, θ(V^2 lgn)

Discuss
Answer: (c).Dynamic programming, θ(V^3)
Q100.
Let n=4 and (a1, a2, a3, a4) = (do, if, int, while). Let p(1:4) = (3/8, 3/8, 1/8, 1/8) and q(1:4) = (2/8, 3/8, 1/8, 1/8, 1/8) where p(i) and q(i) denotes the probability with which we search ai and the identifier x being searched satisfy ai < x < ai+1 respectively. The optimal search tree is given by:

a.

A

b.

B

c.

C

d.

D

Discuss
Answer: (b).B
Page 10 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!

Reverse Engineering

Strengthen your understanding of Reverse Engineering with our curated set of MCQs....

Cloud Computing

Stay on top of the biggest trend in IT with our Cloud Computing MCQs. These questions...

Operating System

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

Embedded Systems

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

DBMS

Get a firm grasp on database systems with our DBMS MCQs. Explore relational...

Digital Communication

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

Management Information Systems

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

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...

Computer Graphics

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