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

Explore more Topics under UGC CBSE NET Exam

Q191.
Which of the following is true for a sorted list with ‘n’ elements?

a.

Insertion in a sorted array takes constant time.

b.

Insertion in a sorted linear linked list takes constant time.

c.

Searching for a key in a sorted array can be done in O(log n) time.

d.

Searching for a key in a sorted linear linked list can be done in O(log n) time.

Discuss
Answer: (c).Searching for a key in a sorted array can be done in O(log n) time.
Q192.
Consider the following linked list. Which of the following piece of code will insert the node pointed to by q at the end of the list ?

a.

for (p=list; p!=NULL; p=p→next); p=q;

b.

for (p=list; p!=NULL; p=p→next); p→next=q;

c.

for (p=list; p→next !=NULL; p=p→next); p=q;

d.

for (p=list; p→next !=NULL; p=p→next); p→next=q;

Discuss
Answer: (d).for (p=list; p→next !=NULL; p=p→next); p→next=q;
Q193.
Consider  a  rooted  tree  in  which  every  node  has  at  least  three  children.  What  is  the minimum number of nodes at level i (i > 0) of the tree?  Assume that the root is at level 0:

a.

3^i

b.

3i

c.

3

d.

3i + 1

Discuss
Answer: (a).3^i
Q194.
Which of the following data structure is used to implement recursion?

a.

Arrays

b.

Stacks

c.

Queues

d.

Linked lists

Discuss
Answer: (b).Stacks
Q195.
The height of a binary tree with ‘n’ nodes, in the worst case is:

a.

O(log n)

b.

O(n)

c.

Ω(n log n)

d.

Ω(n^2)

Discuss
Answer: (b).O(n)
Q196.
Given a parallel algorithm A with computation time t, if parallel algorithm A performs m computational operation, then p processors can execute algorithm A in time given by:

a.

t/p

b.

mt/p

c.

t+(m-t)/p

d.

(m-t)/p

Discuss
Answer: (c).t+(m-t)/p
Q197.
With reference to implementation of different association mining algorithms, identify the correct statement:

a.

The FP growth method was usually better than the best implementation of the apriori algorithm

b.

Apriori algorithm is usually better than CHARM

c.

Apriori algorithm is good when the support required is low

d.

At very low support the number of frequent items becomes less

Discuss
Answer: (a).The FP growth method was usually better than the best implementation of the apriori algorithm
Q198.
The maximum number of nodes in a binary tree of depth 10 is:

a.

1024

b.

2^10-1

c.

1000

d.

None of the above

Discuss
Answer: (d).None of the above
Q199.
The time required to find shortest path in a graph with n vertices and e edges is:

a.

O(e)

b.

O(n)

c.

O(e^2)

d.

O(n^2)

Discuss
Answer: (d).O(n^2)
Q200.
Pre order is also known as:

a.

Depth first order

b.

Breadth first order

c.

Topological order

d.

Linear order

Discuss
Answer: (a).Depth first order
Page 20 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!

IT Fundamentals

Navigate the basics of information technology with our IT Fundamentals MCQs. Get a...

Java Programming

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

C# programming

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

MongoDB

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

CSS

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

Digital Communication

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

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

PHP

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

DBMS

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