MCQ on Data Structures and Algorithms

1. Dynamic programming does not work if the subproblems:

 What is the time complexity of Strassen’s multiplication algorithm using the Divide and conquer approach?

What is the time complexity of the following code?

for(int i=1; i<=n; i++){

    for(j=1; j<=i; j++)

        printf(“This is a dependent for loop”);

}

What will be the time complexity to find the greatest element in a max-heap?

Which of the following is the most appropriate definition of a bi-connected graph?

Which of the following is an application of a deque?

 The partition algorithm of quicksort divides the input elements into the ratio of 1:999. What is the time complexity of the algorithm?

What is the time complexity of insertion operation in a priority queue?

Which of the following algorithm always gives correct results for negative edges weights as well?

Which of the following statement is false with respect to the divide and conquer strategy?

We can solve an N-queens problem using:

Huffman encoding and decoding is an application of:

What is the best case time complexity for the quicksort algorithm?

 What is the advantage of finding the max and min element in an array by the divide and conquer technique?

Dynamic programming divides the problems into a number of:

Which of the following is a method to construct the binary heap data structure?

 How many different types of insertion can we perform on a Binary tree?

A connected acyclic graph is also known as:

We can access the elements of an array:

What will be the output if we reverse the string “PQPPRSQ” using a stack?