17th

Apr

Apr

# Data Structure MCQ

- Admin
- 17th Apr, 2021
- 926 Followers

#### Latest MCQ Tests

#### Pratice HR Questions

## Data Structure MCQ With Answers

Following are mostly asked

**Data structure MCQ test**that are designed for professionals like you to crack you interviews. You can take this**Data structure online test**before appearing to you real interview. This**Data structure quiz**there are around 30+ multiple choice questions on Data structure with four options.### 1) For a binary search algorithm to work, it is necessary that the array (list) must be

### 2) What could be the worst case height of an AVL tree?

### 3) How many swaps are required to sort the given array using bubble sort - { 2, 5, 1, 3, 4}

### 4) Project scheduling is an example of

### 5) Binary search tree has best case run-time complexity of O(log n). What could the worst case?

Download Free : Data Structure MCQ PDF

### 6) Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

### 7) The concatenation of two lists is to be performed in O(1) time. Which of the following implementations of a list should be used?

### 8) Suppose there are two singly linked lists both of which intersect at some point and become a single linked list. The head or start pointers of both the lists are known, but the intersecting node and lengths of lists are not known. What is worst case time complexity of optimal algorithm to find intersecting node from two intersecting linked lists?

### 9) In a doubly linked list, the number of pointers affected for an insertion operation will be

### 10) Which one of the following is an application of Stack Data Structure?

Read Best: Data Structure Interview Questions

### 11) To evaluate an expression without any embedded function calls:

### 12) How many stacks are needed to implement a queue. Consider the situation where no other data structure like arrays, linked list is available to you.

### 13) A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT (n refers to the number of items in the queue)?

### 14) The minimum number of stacks needed to implement a queue is

### 15) The maximum number of binary trees that can be formed with three unlabeled nodes is:

Download Free: Data Structure Interview Questions PDF

### 16) The number of structurally different possible binary trees with 4 nodes is

### 17) A strictly binary tree with 10 leaves

### 18) Which of the following traversal outputs the data in sorted order in a BST?

### 19) Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the in-order traversal sequence of the resultant tree?

### 20) What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0.

### 21) Which of the following is a self-adjusting or self-balancing Binary Search Tree

### 22) How many undirected graphs (not necessarily connected) can be constructed out of a given set V= {V 1, V 2,...V n} of n vertices ?

### 23) Given an undirected graph G with V vertices and E edges, the sum of the degrees of all vertices is

### 24) Given a hash table T with 25 slots that stores 2000 elements, the load factor ? for T is __________

### 25) If there's no base criteria in a recursive program, the program will

### 26) The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

### 27) A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

### 28) Which of the following is non-liner data structure?

### 29) Which of the following is true about linked list implementation of queue?

### 30) What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?

#### Leave A Comment :

Valid name is required.

Valid name is required.

Valid email id is required.