Which of the following is an NP problem?

Which algorithmic technique does Fibonacci search use?

What is the least favorable place to choose a pivot in a sorting algorithm?

Which data structure is used as memory in a Pushdown Automaton (PDA)?

What type of problem is Floyd-Warshall's algorithm used to solve?

If we have a binary heap with n elements and wish to insert n more elements (not necessarily one after another) into this heap, the total time required is:

Let H be a binary min-heap consisting of n elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the maximum element in H?

What is the time complexity of the following code?

int apowb(int a, int m)
{
   if (m == 0)
       return 1;
   if (m == 1)
       return a;
   if ((m % 2) == 0)
       return apowb(a*a, m/2);
   else
       return apowb(a*a, m/2) * a;
}

Consider an undirected graph G with vertices {P, Q, R, S, T}. In graph G, every edge has a distinct weight. Edge RS has the minimum weight, and edge PQ has the maximum weight. Which of the following statements is false?

Consider the following statements:

• I. The smallest element in a max-heap is always at a leaf node.
• II. The second largest element in a max-heap is always a child of the root node.
• III. A max-heap can be constructed from a binary search tree in Θ(n) time.
• IV. A binary search tree can be constructed from a max-heap in Θ(n) time.

Which of the above statements is/are TRUE?