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?**

- push
- pop
- FIFO
- All of these

**Answer:- All these**

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

- 1.non-linear
- linear
- hierarchical
- None of these

**Answer:- linear**

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

- null list
- empty list
- Zero List
- None of these

**Answer:- null list**

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

- O(n log n)
- O(n2)
- O(log n)
- O(n)

**Answer:- O(n2)**

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

-M/N*P$QR

- MNPQR$*/-
- M-NPQR$*/
- MNP$QR/-
- M-NQR$*/

**Answer:- MNPQR$*/-**

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

- 2n-1 nodes
- 2n2 nodes
- n nodes
- log n nodes

**Answer:- 2n-1 nodes**

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

- MN*PQ/+
- M*NP+P/Q
- *MN/PQ+
- MNPQ+/*

**Answer:- MN*PQ/+**

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

- stack
- graph
- queue
- array

**Answer:- stack**

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

- from further
- from behind
- From the middle
- From both front and back

**Answer:- from behind**

**10:- There is a technique for direct search.**

- linear search
- tree search
- binary search
- hashing

**Answer:- hashing**

#### MCQ on Data Structure:

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

- O(n log n)
- O(n2)
- O(log n)
- O(n)

**Answer:- O (n log n)**

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

- selection sort
- bubble sort
- quick sort
- heap sort

**Answer:- bubble sort**

**13:- Case complexity of bubble sort algorithm.**

- O(log n)
- O(n log n)
- O(n)
- O(n2)

**Answer:- О(n2)**

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

- Tree
- queue
- Stack
- Array

**Answer:- Stack**

**15:- Adding data to the stack is called.**

- POP
- add
- push
- None of these

**Answer:- push**

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

- stack
- queue
- dequeue
- tree

**Answer:- dequeue**

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

- pointer
- array
- record
- None of these

**Answer:- record**

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

- overflow
- underflow
- housefull
- saturated

**Answer: overflow**

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

- O(n)
- O(log n)
- O(n log n)
- O(n2)

**Answer:- O(n2)**

**20:- Dynamic memory area.**

- Stack
- heap
- Hard Disk
- None of these

**Answer:- Heap**

**21:- If font = rear then queue is.**

- full
- half full
- empty
- None of these

**Answer:- empty**

**22:- suffix is expression.**

- infix
- postfix
- prefix2
- All of these

**Answer:- postfix**

**23:- polish is an expression.**

- infix
- postfix
- prefix
- None of these

**Answer:- infix**

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

- three
- four
- one
- two

**Reply.**

**25:- Which language has data structure?**

- hyper text markup language
- object oriented programming language
- There is no language for data structure
- None of these

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

**26:- What is time complexity in data structure?**

- The amount of data loss in performing an operation on a data structure is called the time complexity of the data structure.
- The time it takes for a data structure to perform an operation is called the time complexity of the data structure.
- The cost incurred by a data structure in performing an operation is called the time complexity of the data structure.
- 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?**

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

OOP – Object Oriented Programming

DBMS – Database Management System

RDBMS – Relational Database Management System

Join Now: Data Warehousing and Data Mining