Which of the following balance factors cannot occur in an AVL tree?

Which bitwise operation can be used to set a particular bit to 0?

An example of internal sorting is

Which of the following problems should be solved using dynamic programming?

Which searching algorithm is used in combination with exponential search to find the appropriate range?

Consider the following table

Match the algorithm to design paradigms they are based on:

The main drawback of the FIFO page replacement algorithm is:

Consider the following functions from positives integers to real numbers 10, root(n), n, log₂n, 100/n. The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is:

What is the time complexity of the following code?

public boolean isBalanced(String exp)
{
int len = exp.length();
Stack<Integer> stk = new Stack<Integer>();
for(int i = 0; i < len; i++)
{
char ch = exp.charAt(i);
if (ch == '(')
{
stk.push(i);
}
else if (ch == ')')
{
if(stk.isEmpty())
{
return false;
}
stk.pop();
}
}
return stk.isEmpty();
}

An articulation point in a connected graph is a vertex such that removing the vertex and its incident edges disconnects the graph into two or more connected components. Let T be a DFS tree obtained by doing DFS in a connected undirected graph G. Which of the following options is/are correct?

1. Root of T can never be an articulation point in G
2. Root of T is an articulation point in G if and only if it has 2 or more children.
3. A leaf of T can be an articulation point in G.
4. If u is an articulation point in G such that x is an ancestor of u in T and y is a descendent of u in T, then all paths from x to y in G must pass through u.