Multiple Choice Questions (MCQ) on Data Structure

Computer Science Engineering

11- Which data structure is mainly used for implementing the recursive algorithm?

(A) Linked list

(B) Binary tree

(C) Stack

(D) Queue

 

12- Which one of the following is not the application of the Queue data structure?

(A) Balancing of symbols

(B) balancing

(C) Data is transferred asynchronously

(D) Resource shared between various systems

 

13- Which one of the following is not the application of the stack data structure?

(A) Asynchronous data transfer

(B) Backtracking

(C) Recursion

(D) String reversal

 

14- Which of the following options is not true about the Binary Search tree?

(A) The left and right sub trees should also be a binary search tree

(B) The value of the left child should be less than the root node

(C) The value of the right child should be greater than the root node

(D) None of the above

 

15- Which of the following is the prefix form of A+B*C?

(A) +A*BC

(B) ABC+*

(C) +AB*C

(D) A+(BC*)

 

16- Which of the following properties does a simple graph not hold?

(A) Must have no multiple edges

(B) Must have no loops or multiple edges

(C) Must be unweighted

(D) Must be connected

 

17- Which of the following principles does Queue use?

(A) Ordered array

(B) Linear tree

(C) FIFO principle

(D) LIFO principle

 

18- Quick sort algorithm is an example of

(A) Divide and conquer

(B) Dynamic Programming

(C) Improved binary search

(D) Greedy approach

 

19- Which of the following is not the correct statement for a stack data structure?

(A) Top of the stack contains the last inserted element

(B) Elements are stored in a sequential manner

(C) Stack follows FIFO

(D) Arrays can be used to implement the stack

 

20- Travelling salesman problem is an example of

(A) Divide & Conque

(B) Recursive Approach

(C) Greedy Algorithm

(D) Dynamic Algorithm

 

ANSWERS:

11-(C), 12-(A), 13-(A), 14-(B), 15-(A), 16-(D), 17-(C), 18-(A), 19-(C), 20-(C)