# MCQ on Data Structure

In this article mcq on data structure we give the information about provide important mcq like Which of the following is used to implement RECURSION.

#### MCQ on Data Structure:

1:- Which of the following is related to stack?

1. push
2. pop
3. FIFO
4. All of these

2:- What type of data structure is Linked List?

1. 1.non-linear
2. linear
3. hierarchical
4. None of these

3:- If there is no item in the list then what is it called?

1. null list
2. empty list
3. Zero List
4. None of these

4:- What is the worst case complexity of quick sort?

1. O(n log n)
2. O(n2)
3. O(log n)
4. O(n)

5:- What is the postfix form of the following prefix expression?

-M/N*P\$QR

1. MNPQR\$*/-
2. M-NPQR\$*/
3. MNP\$QR/-
4. M-NQR\$*/

6:- A full binary tree having n leaves will have nodes?

1. 2n-1 nodes
2. 2n2 nodes
3. n nodes
4. log n nodes

7:- Postfix form of M*NP+/Q will be.

1. MN*PQ/+
2. M*NP+P/Q
3. *MN/PQ+
4. MNPQ+/*

8:- Which of the following is used to implement RECURSION?

1. stack
2. graph
3. queue
4. array

9:- From where are new nodes added to the queue?

1. from further
2. from behind
3. From the middle
4. From both front and back

10:- There is a technique for direct search.

1. linear search
2. tree search
3. binary search
4. hashing

#### MCQ on Data Structure:

11:- The worst case complexity of merge sort is.

1. O(n log n)
2. O(n2)
3. O(log n)
4. O(n)

12:- Which of the following is the slowest sorting algorithm.

1. selection sort
2. bubble sort
3. quick sort
4. heap sort

13:- Case complexity of bubble sort algorithm.

1. O(log n)
2. O(n log n)
3. O(n)
4. O(n2)

14:- In which of these data structures infix notation needs to be converted to postfix notation.

1. Tree
2. queue
3. Stack
4. Array

15:- Adding data to the stack is called.

1. POP
3. push
4. None of these

16:- In which of the following data structures can elements be deleted?

1. stack
2. queue
3. dequeue
4. tree

17:- Which of the following data structures stores homogeneous data items?

1. pointer
2. array
3. record
4. None of these

18:- What is the situation when we want to insert item in the data structure but there is no space in it.

1. overflow
2. underflow
3. housefull
4. saturated

19:- The average case complexity of insertion sort is.

1. O(n)
2. O(log n)
3. O(n log n)
4. O(n2)

20:- Dynamic memory area.

1. Stack
2. heap
3. Hard Disk
4. None of these

21:- If font = rear then queue is.

1. full
2. half full
3. empty
4. None of these

22:- suffix is ​​expression.

1. infix
2. postfix
3. prefix2
4. All of these

23:- polish is an expression.

1. infix
2. postfix
3. prefix
4. None of these

24:- How many pointers does a doubly linked list use?

1. three
2. four
3. one
4. two

25:- Which language has data structure?

1. hyper text markup language
2. object oriented programming language
3. There is no language for data structure
4. None of these

#### Answer:- There is no language for data structure.

26:- What is time complexity in data structure?

1. The amount of data loss in performing an operation on a data structure is called the time complexity of the data structure.
2. The time it takes for a data structure to perform an operation is called the time complexity of the data structure.
3. The cost incurred by a data structure in performing an operation is called the time complexity of the data structure.
4. None of these

Answer:- The amount of time it takes for a data structure to perform an operation is called the time complexity of the data structure.

27:- What is space complexity?

1. The amount of computer memory space freed up for the storage and operation of a data structure is called the space complexity of that data structure.
2. The amount of computer memory space used for the storage and operation of a data structure is called the space complexity of that data structure.
3. The amount of computer memory space used for the storage and operation of a data structure is called the loss complexity of that data structure.
4. None of these

Answer:- The amount of computer memory space used for the storage and operation of a data structure is called the space complexity of that data structure.

#### Some More:

POP- Introduction to Programming Using ‘C’

DS – Data structure Using C

OOP – Object Oriented Programming

Java Programming

DBMS – Database Management System

RDBMS – Relational Database Management System