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 GATE CSE 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 GATE CSE 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 GATE CSE 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 16 of 30

Explore more Topics under GATE CSE Exam

Q151.
Which of the following sorting algorithms does not have a worst case running time of O(nlog n)?

a.

Insertion sort

b.

Merge sort

c.

Quick sort

d.

Bubble sort

Discuss
Answer: (b).Merge sort
Q152.
An undirected graph G with n vertices and e edges is represented by adjacency list. What is  the time required to generate all the connected components?

a.

O(n)

b.

O(e)

c.

O(e+n)

d.

O(n*e)

Discuss
Answer: (c).O(e+n)
Q153.
The quick sort algorithm exploits……..design technique.

a.

Greedy

b.

Backtracking

c.

Divide and Conquer

d.

Dynamic programming

Discuss
Answer: (c).Divide and Conquer
Q154.
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is

a.

T (n) = 2T (n - 2) + 2

b.

T (n) = 2T (n - 1) + n

c.

T (n) = 2T (n/2) + 1

d.

T (n) = 2T (n - 1) + 1

Discuss
Answer: (d).T (n) = 2T (n - 1) + 1
Q155.
Which of the following statements are TRUE?

 (1) The problem of determining whether there exists a cycle in an undirected graph is in P.
 (2) The problem of determining whether there exists a cycle in an undirected graph is in NP.
 (3) If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.

a.

1, 2 and 3

b.

1 and 2 only

c.

2 and 3 only

d.

1 and 3 only

Discuss
Answer: (a).1, 2 and 3
Q156.
The best case time complexity for a successful binary search is O(1). Similarly the best case time complexity for an unsuccessful binary search is…….

a.

O(1)

b.

O(n²)

c.

O(n)

d.

O(log n)

Discuss
Answer: (d).O(log n)
Q157.
State the worst case time complexity for quick sort.

a.

O(log n)

b.

O(n)

c.

O(nlog n)

d.

O(n²)

Discuss
Answer: (d).O(n²)
Q158.
A search technique where we keep expanding nodes with least accumulated cost so far is called

a.

Hill climbing

b.

Branch and bound

c.

Best first

d.

Divide and conquer

Discuss
Answer: (b).Branch and bound
Q159.
Both P and NP are closed under the operation of

a.

Union

b.

Intersection

c.

Concatenation

d.

Kleene

Discuss
Answer: (d).Kleene
Q160.
In general, Amortization is used for specific types of algorithms like

a.

Graphs

b.

sorting

c.

Searching

d.

Binary trees & union

Discuss
Answer: (d).Binary trees & union
Page 16 of 30

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!

Cryptography and Network Security

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

Computer Graphics

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

Digital Image Processing (DIP)

Delve into the techniques of enhancing digital images with our Digital Image...

Computer Hardware

Explore the tangible components of computers with our Computer Hardware MCQs. Learn...

Reverse Engineering

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

C# programming

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

Embedded Systems

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

Formal Languages and Automata Theory

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

Digital Communication

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