MCQ Questions on Data Structures

1. What is the minimum number of nodes in a k-ary tree of height ‘h’?

Which of the following statements with respect to complexity analysis is true?

What is the replacement of x in step 1 of the topological sort algorithm?

Algorithm TSort{

    step1: x;

    step2: Arrange the nodes in the descending order of finish time;

} 

Which of the following is false with respect to an AVL tree?

What does the following function do?

void fun(struct node* START){

    if(START == NULL)

        return;

    fun(START->link);

    cout << START->data;

}

What is the time complexity of a graph if we represent it using an adjacency matrix?

Which of the following statements is false?

Which of the following is not an m-way search tree?

Why shouldn’t we represent a binary tree using an array?

Which of the following is true with respect to expression trees?

If F denotes the front, R denotes the rear and SIZE denotes the maximum possible size of a circular queue, which of the following is the correct function depicting that the circular queue is full?

Let f1=n! And let f2=2ⁿ. Which of the following statement is correct with respect to  f1  and f2?

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

Which of the following statements is false with respect to a multi-stage graph?

What is the best case time complexity in the case of modified bubble sort?

We need to create a list dynamically, where the search operation is of the order O(1). The user does not care about any statistical operations like finding max, min or medium. Which is the best data structure for such a case?

 What is the total number of stack permutations possible for ‘n’ elements?

Which of the following statements is false?

Traversal of a graph is different from a tree because

 What is the time complexity of the optimised matrix multiplication also known as Strassen’s multiplication method?