# Data Structures and Algorithms Multiple Choice Questions:- Part One

1. Which if the following is/are the levels of implementation of data structure

A) Abstract level
B) Application level
C) Implementation level
D) All of the above

Ans:- (D) All of the above

2. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……

A) AVL tree
B) Red-black tree
C) Lemma tree
D) None of the above

Ans:- (A) AVL tree

3. ……………….. level is where the model becomes compatible executable code

A) Abstract level
B) Application level
C) Implementation level
D) All of the above

Ans:- (C) Implementation level

4. Stack is also called as

A) Last in first out
B) First in last out
C) Last in last out
D) First in first out

Ans:- (A) Last in first out

5. Which of the following is true about the characteristics of abstract data types?
i) It exports a type.
ii) It exports a set of operations

A) True, False
B) False, True
C) True, True
D) False, False

Ans:- (C) True, True

6. …………… is not the component of data structure.

A) Operations
B) Storage Structures
C) Algorithms
D) None of above

Ans:- (D) None of above

7. Which of the following is not the part of ADT description?

A) Data
B) Operations
C) Both of the above
D) None of the above

Ans:- (D) None of the above

8. Inserting an item into the stack when stack is not full is called …………. Operation and deletion of item form the stack, when stack is not empty is called ………..operation

A) push, pop
B) pop, push
C) insert, delete
D) delete, insert

Ans:- (A) push, pop

9. ……………. Is a pile in which items are added at one end and removed from the other.

A) Stack
B) Queue
C) List
D) None of the above

Ans:- (B) Queue

10. ………… is very useful in situation when data have to stored and then retrieved in reverse order.

A) Stack
B) Queue
C) List

Ans:- (A) Stack

11. Which data structure allows deleting data elements from and inserting at rear?

A) Stacks
B) Queues
C) Dequeues
D) Binary search tree

Ans:- (B) Queues

12. Which of the following data structure can’t store the non-homogeneous data elements?

A) Arrays
B) Records
C) Pointers
D) Stacks

Ans:- (A) Arrays

13. A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.

C) Both of them
D) Neither of them

14. Which of the following is non-liner data structure?

A) Stacks
B) List
C) Strings
D) Trees

Ans:- (D) Trees

15. Herder node is used as sentinel in …..

A) Graphs
B) Stacks
C) Binary tree
D) Queues

Ans:- (C) Binary tree

16. Which data structure is used in breadth first search of a graph to hold nodes?

A) Stack
B) queue
C) Tree
D) Array

Ans:- (B) queue

17. Identify the data structure which allows deletions at both ends of the list but insertion at only one end

A) Input restricted dequeue
B) Output restricted dequeue
C) Priority queues
D) Stack

Ans:- (A) Input restricted dequeue

18. Which of the following data structure is non linear type?

A) Strings
B) Lists
C) Stacks
D) Graph

Ans:- (D) Graph

19. Which of the following data structure is linear type?

A) Graph
B) Trees
C) Binary tree
D) Stack

Ans:- (D) Stack

20. To represent hierarchical relationship between elements, Which data structure is suitable?

A) Dequeue
B) Priority
C) Tree
D) Graph

Ans:- (C) Tree

21. A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph

A) Weakly connected
B) Strongly Connected
C) Tightly Connected
D) Linearly Connected

Ans:- (B) Strongly Connected

22. In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.

A) Depth First
C) With First
D) Depth Limited

Ans:- (A) Depth First

23. State True of False.
i) Network is a graph that has weights or costs associated with it.
ii) An undirected graph which contains no cycles is called a forest.
iii) A graph is said to be complete if there is no edge between every pair of vertices.

A) True, False, True
B) True, True, False
C) True, True, True
D) False, True, True

Ans:- (B) True, True, False

24. Match the following.
a) Completeness i) How long does it take to find a solution
b) Time Complexity ii) How much memory need to perform the search.
c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one

A) a-iii, b-ii, c-i
B) a-i, b-ii, c-iii
C) a-iii, b-i, c-ii
D) a-i, b-iii, c-ii

Ans:- (C) a-iii, b-i, c-ii

25. The number of comparisons done by sequential search is ………………

A) (N/2)+1
B) (N+1)/2
C) (N-1)/2
D) (N+2)/2

Ans:- (B) (N+1)/2

26. In ……………, search start at the beginning of the list and check every element in the list

A) Linear search
B) Binary search
C) Hash Search
D) Binary Tree search

Ans:- (A) Linear search

27. State True or False.
i) Binary search is used for searching in a sorted array.
ii) The time complexity of binary search is O(login)

A) True, False
B) False, True
C) False, False
D) True, True

Ans:- (D) True, True

28. Which of the following is not the internal sort?

A) Insertion Sort
B) Bubble Sort
C) Merge Sort
D) Heap Sort

Ans:- (C) Merge Sort

29. State True or False.
i) An undirected graph which contains no cycles is called forest.
ii) A graph is said to be complete if there is an edge between every pair of vertices.

A) True, True
B) False, True
C) False, False
D) True, False

Ans:- (A) True, True

30. A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there are no edges between two vertices of V1 or two vertices of V2.

A) Partite
B) Bipartite
C) Rooted
D) Bisects

Ans:- (B) Bipartite