Following are some of the multiple choice questions on the **Data Structure** with answers that will help the students in developing their knowledge.

## Data Structure MCQ

### 1. What is a data structure?

### 2. Which of the following data structure is linear type?

### 3. Which data structure is used for implementing recursion

### 4. Which data structure is needed to convert infix notation to postfix notation

### 5. Which data structure is needed to convert infix notation to postfix notation

### 6. Which of the following is the most widely used external memory data structure?

### 7. A variant of linked list in which last node of the list points to the first node of the list is?

### 8. In simple chaining, what data structure is appropriate

### 9. In simple chaining, what data structure is appropriate

### 10. Which of the following is not a linear data structure

### 11. Which of the following is not a linear data structure

### 12. The data structure used to implement recursive function calls

### 13. Which of the following is the advantage of the array data structure

### 14. With what data structure can a priority queue be implemented

### 15. With what data structure can a priority queue be implemented

### 16. Example of non linear data structure

### 17. Suppose we are sorting an array of eight integers using quick sort, and we have just finished the first partitioning with the array looking like this:2 5 1 7 9 12 11 10Identify the correct statement?

### 18. Which one of the following is not a linear data structure

### 19. Which one of the following is not a linear data structure

### 20. Which of the following applications may use a stack?

### 21. A complete binary tree with 5 levels has how many nodes? (Root is Level 1)

### 22. Which data structure can be used to test a palindrome

### 23. Which data structure is needed to convert infix to postfix

### 24. What is the data structure used to perform recursion?

### 25. A struct is typically a ____ data structure.

### 26. Which data structure conveniently used to implement dfs

### 27. The data structure required to check whether an expression

### 28. A terminal node in a binary tree is called __________

### 29. Which one of the following is not the application of the stack data structure

### 30. The data structure available in the banker's algorithm are

### 31. Which among the below specified condition is applicable if the Queue is non - empty?

### 32. A tree sort is also known as__________ sort.

### 33. Which of the following principle does queue use?

### 34. Entries in a stack are “ordered”. What is the meaning of this statement?

### 35. Which of the following is not a data structure

### 36. Which of the following tree data structures is not a balanced binary tree?

### 37. Which of the following data structure is not a linear data structure

### 38. TREE[1]=NULL indicates is _____________

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

### 40. Which data structure is used by map

### 41. A tree is composed of ____ connected by edges or lines.

### 42. To measure Time complexity of an algorithm Big O notation is used which:

### 43. Which ospf data structure is identical on all ospf routers that share the same area?

### 44. In ____________ data structure, the data items are arranged in a linear sequence.

### 45. While implementing Stack using list when we want to delete element we must use pop function as__________

### 46. In a graph if E=(u,v) means _____________

### 47. Stack is also called as

### 48. What does the following function do for a given Linked List with first node as head?

void fun1(struct node * head) {
if (head == NULL) return;
fun1(head->next);
printf("%d ", head->data);
}

### 49. Consider the following operation performed on a stack of size 5.Push(1);Pop();Push(2);Push(3);Pop();Push(4);Pop();Pop();Push(5);After the completion of all operation, the number of elements present in stack are

### 50. Identify the types of sorting that used partition and exchange sort.

### Enjoyed the Quiz. Share this with friends