[ 4000+ ] Data Structure MCQ Questions and Answers [ SET - 4 ] | Data Structure Multiple Choice Questions and Answers pdf

 

1. Which of the following data structure permits insertion and deletion operations only on one end of the structure?

A) Linked list
B) Array
C) Stack
D) Queue

ANSWER= (C) Stack

 

2. What is the worst-case time for serial search finding a single item in an array?

A) Quadratic time
B)  Linear time
C) Logarithmic time
D) Constant time

ANSWER= (B) Linear time

 

3. Which type of linked List contains. pointer to the next as well as previous node in the sequence?

A) Singly Linked List 
B) Circular Linked List 
C) Doubly Linked List
D) All of these

ANSWER= (C) Doubly Linked List

 

4. The average case complexity of quick sort for sorting n numbers is

A) O(n2)
B) O(nlog2n)
C) O(n)
D) O(log2n)

ANSWER= (B) O(nlog2n)

 

5.  In stack deletion operation is referred as _____

A) push
B) pop
C) peek
D) none of these

ANSWER= (B) pop

 

6. Queue is _____ type of data structure.

A) lifo
B) fifo
C) both a & b
D)  none of these

ANSWER= (B) fifo

 

7.  Linked list is not suitable data structure for which one of the following problems?

A) insertion sort
B) radix sort 
C) binary search
D) polynomial addition

ANSWER= (C) binary search

 

8. Which of following operations are generally not performed on report files?

A)  Updation
B) Maintenance
C)  Retrieval
D)  All of above

ANSWER= (D) All of above

 

9.  In Pseudocode part consists of?

A) Sequence
B) Selection
C) Iteration
D) All of the above

ANSWER= (D) All of the above

 

10. Self-referential pointer is used in defining

A)  an array 
B) a node of linked-list 
C)  a queue
D)  all of these

ANSWER= (D)  all of these

 

11.In bottom-up approach-

A) A problem is subdivided into subproblems; each one is attacked without worrying about others.
B) A problem is tackled from beginning to end in one go.
C) Subproblems are solved first; then all solution of subproblems are put together to solve the main problem
D) None of these.

ANSWER= (C) Subproblems are solved first; then all solution of subproblems are put together to solve the main problem

 

12. Which of the following statements about a binary tree is correct?

A) No binary tree is both complete and full
B) Every full binary tree is also a complete binary tree
C) Every complete binary tree is also a full binary tree
D) Every binary tree is either complete or full

ANSWER= (B)  Every full binary tree is also a complete binary tree

 

13. Inserting a node after a given node in a doubly linked list requires

A) four pointer exchanges.
B)  two pointer exchanges 
C) one pointer exchange.
D)  no pointer exchange

ANSWER= (B) two pointer exchanges 

 

14.  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

ANSWER= (A) last in first out

 

15. Binary search is not possible for

A) array
B) linked list
C) stack 
D) queue

ANSWER= (B) linked list

 

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

A)  stack
B) queue
C)  list
D) link list

ANSWER= (A) stack

 

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

A) stacks
B)  queues
C) dequeues
D) binary search tree

ANSWER= (B) queues

 

18.  A linear link list can be traversed using

A) recursion
B)  both (a) and (c) are correct
C)  Stack
D)  both (a) and (c) are wrong

ANSWER= (A) recursion

 

19. When does top value of the stack changes?

A)  before deletion
B) while checking underflow
C)  at the time of deletion
D) after deletion

ANSWER= (D) after deletion

 

20. How will you implement dynamic arrays in Java?

A)  Set
B) Map
C)  HashMap
D) List

ANSWER= (D) List

 

21. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.

A) circular queue
B) random of queue
C)  priority
D) dequeue

ANSWER= (D) dequeue

 

22. The data structure used to solve recursive problem is

A) Linked list 
B) Queue
C)  stack
D) none of these

ANSWER= (C) stack

 

23.  The term "push" and "pop" is related to the

A)  array
B)  lists
C) stacks
D) all of the above

ANSWER= (C) stacks

 

24. What is the difference between a normal(naive) array and a sparse array?

A) Sparse array is memory efficient
B) Sparse array can hold more elements than a normal array
C) Sparse array is dynamic
D)  A naive array is more efficient

ANSWER= (A) Sparse array is memory efficient

 

25. The adjacency matrix of an undirected graph is

A) Unit matrix
B) Asymmetric matrix
C) Symmetric matrix
D) None of these

ANSWER= (C) Symmetric matrix

 

26. Suffix array can be created in O(nlogn) time.

A) True
B)  False

ANSWER= (A) True

 

27. The disadvantage in using a circular linked list is …………………….

A) it is possible to get into infinite loop
B) last node points to first node.
C)  time consuming
D) requires more memory space

ANSWER= (A) it is possible to get into infinite loop

 

28. A simple undirected graph with eight (8) vertices is said to be completed if number of edges equals to 

A) 56
B) 28
C) 16
D) 24

ANSWER= (B) 28

 

29. If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?

A) 1036
B) 1028
C) 1038
D) none of these

ANSWER= (D) none of these

 

30.Which of the following data structure is mainly used for implementing the recursive algorithm?

A)  Stack
B) Queue
C) Linked list
D) Binary tree

ANSWER= (A) Stack

Friends if you like this post,kindly comment bellow and do share your responce.Thank You for Visiting.