DSA 11.07.24

1.Consider the following stack implemented using stack.

1. #define SIZE 11  

2. struct STACK  

3. {  

4.    int arr[SIZE];  

5.    int top=-1;   

6. }  

7. What would be the maximum value of the top that does not cause the overflow of the stack?

• 1. 8

• 1. 9

• 1. 11

• 1. 10

2.What would be the output after performing the following operations in a Deque?

1. Insertfront(10);  

2. Insertfront(20);  

3. Insertrear(30);  

4. Insertrear(40);  

5. Deletefront();  

6. Insertfront(50);  

7. Deleterear();  

8. Display();  

• 1. 10, 20, 30

• 1. 50, 10, 30

• 1. 40, 20, 30

• 1. None of the above

3.Minimum number of queues required for priority queue implementation?

• 5

• 4

• 3

• 2

4.Heap sort is an implementation of ____________ using a descending priority queue.

• a) insertion sort
  

• b) selection sort
  

• c) bubble sort
  

• d) merge sort

5.What does the following piece of code do?

for (int i = 0; i < arr.length-1; i++) { for (int j = i+1; j < arr.length; j++) { if( (arr[i].equals(arr[j])) && (i != j) ) { System.out.println(arr[i]); } } }

• a) Print the duplicate elements in the array
  

• b) Print the element with maximum frequency
  

• c) Print the unique elements in the array
  

• d) Prints the element with minimum frequnecy

6.In doubly linked lists

• A - a pointer is maintained to store both next and previous nodes.

• B - two pointers are maintained to store next and previous nodes.

• C - a pointer to self is maintained for each node.

• D - none of the above.

7.From a complete graph, by removing maximum _______________ edges, we can construct a spanning tree.

• A - e-n+1

• B - n-e+1

• C - n+e-1

• D - e-n-1

8.A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.

• (A) Threaded tree

• (B) Complete binary tree

• (C) M-way search tree

• (D) Full binary tree

9.Choose the correct code for merge sort.

• void merge_sort(int arr[], int left, int right) { if (left > right) {   int mid = (right-left)/2; merge_sort(arr, left, mid); merge_sort(arr, mid+1, right);   merge(arr, left, mid, right); //function to merge sorted arrays } }

• void merge_sort(int arr[], int left, int right) { if (left < right) {   int mid = left+(right-left)/2; merge_sort(arr, left, mid); merge_sort(arr, mid+1, right);   merge(arr, left, mid, right); //function to merge sorted arrays } }

• 
  void merge_sort(int arr[], int left, int right) { if (left < right) {   int mid = left+(right-left)/2; merge(arr, left, mid, right); //function to merge sorted arrays merge_sort(arr, left, mid); merge_sort(arr, mid+1, right);     } }

• void merge_sort(int arr[], int left, int right) { if (left < right) {   int mid = (right-left)/2; merge(arr, left, mid, right); //function to merge sorted arrays merge_sort(arr, left, mid); merge_sort(arr, mid+1, right);     } }

10.Given an array arr = {45,77,89,90,94,99,100} and key = 99; what are the mid values(corresponding array elements) in the first and second levels of recursion?

• 
  a) 90 and 99
  

• 
  b) 90 and 94
  

• 
  c) 89 and 99
  

• 
  d) 89 and 94