Data Structure MCQ Online Test

1. Suppose a binary search tree has the inorder traversal as: 10, 20, 30, 40, 50, 60, 70. What is the output of the following code segment?

void traverse(struct node* ptr){

    if(ptr){

        cout << ptr->data;

        traverse(ptr->right);

        traverse(ptr->left);

    }

}

Which of the following statement is false for a bubble sort?

Which of the following methods is best suitable to solve a fractional knapsack problem?

Which of the following is not an application of dynamic programming? 

Which of the following statements is false with respect to Depth-first search?

Consider an empty stack. The order of performing the operations is: push(21), push(52), push(16), pop(), pop(), push(25), push(22), push(60), pop(), pop(), push(15), pop().

Which values are finally present in the stack after performing these operations?

What is Karatsuba’s algorithm used for?

Which of the following operations in a stack can be implemented only during actual implementation and not as an abstract data type? An unordered list contains n distinct elements. 

What does the following code depict?

#define Size 5 //Maximum possible size of a stack

struct stack{

    int data[SIZE];

    int TOP;

}

void fun(){

    if(ptr -> TOP == SIZE-1)

        return;

}

What is the minimum number of nodes in a complete binary tree of height ‘h’?

How many binary trees are possible if the preorder of the binary tree is ‘ABC’

Which of the following combinations does not produce a unique binary tree?

 What is the worst-case complexity of the following code?

for(i=1; i<=n; i=i*2){

    for(j=1; j<=n; j=j*2)

        cout << “Hello world”;

}

How many min-heaps can we construct using 5 distinct keys?

Let V denote the vertices in a graph and E denote the edges in a graph. What is the time complexity for Bellman Ford’s algorithm?

 Which of the following statement is false with respect to Dijkstra’s algorithm?

What time does it take to delete an element from a binary heap?

Which of the following statements is true?

In which case, the complexity is much more difficult to analyze?

Which of the following is not an application of divide and conquer?