Data structures Viva

What is the output of the below code?

1. #include <stdio.h>  

2. int main()  

3. {  

4.    int arr[5]={10,20,30,40,50};  

5.    printf("%d", arr[5]);  

6.   

7.     return 0;  

8. }  

• 50

• 10

• 0

• Garbage value

Consider the following stack implemented using stack.

1. #define SIZE 11  

2. struct STACK  

3. {  

4.    int arr[SIZE];  

5.    int top=-1;   

6. }  

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

• 9

• 10

• 11

• 12

Which one of the following is the overflow condition if a circular queue is implemented using array having size MAX?

• rear= MAX-1

• rear= MAX

• front=(rear+1) mod MAX

• None of these

Consider the following code.

1. int fun()  

2. {  

3.    if(isEmpty())  

4.    {  

5.       return -10;   

6.    }  

7.   else  

8.   {  

9.      int n;  

10.      n= q[front];  

11.      front++;  

12.      return n;   

13.   }  

14.     

15. }   

Which operation does the above code perform?

• A)Enqueue

• B) Dequeue

• C) Returns the front element

• Both B & C

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();  

• 10, 20, 30

• 50, 10, 30

• 40, 20, 30

• None of the above

In a circular queue implementation using array of size 5, the array index starts with 0 where front and rear values are 3 and 4 respectively. Determine the array index at which the insertion of the next element will take place.

• 5

• 0

• 1

• 2

Minimum number of fields in each node of a doubly linked list is

____

• 2

• 3

• 4

• 5

Which of the following is true about linked list implementation of stack?

• In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end

• In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.

• Both are correct

• None are correct

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?

• 7 5 1 0 3 2 4 6 8 9

• 0 2 4 3 1 6 5 9 8 7

• 0 1 2 3 4 5 6 7 8 9

• 9 8 6 4 2 3 0 1 5 7

Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?

• Deleting a node whose location is given

• Searching of an unsorted list for a given item

• Inverting a node after the node with given location

• Traversing a list to process each node