The recurrence relation that arises in relation with the complexity of binary search is:

Which one of the following statements is false?

Conside the following two functions:
$${g_1}(n) = \left\{ {\matrix{ {{n^3}\,for\,0 \le n < 10,000} \cr {{n^2}\,for\,n \ge 10,000} \cr } } \right.$$
$${g_2}(n) = \left\{ {\matrix{ {n\,for\,0 \le n \le 100} \cr {{n^3}\,for\,n > 100} \cr } } \right.$$ Which of the following is true:

Generation of intermediate code based on an abstract machine model is useful in compilers because

Linked lists are not suitable data structures of which one of the following problems?

Which of the following permutations can be obtained in the output (in the same order) using a stack assuming that the input is the sequence 1, 2, 3, 4, 5 in that order?

In a compact single dimensional array representation for lower triangular matrices (i.e all the elements above the diagonal are zero) of size n $$\times$$ n, non-zero elements (i.e., elements of the lower triangle) of each row are stored one after another, starting from the first row, the index of the (i, j)^th element of the lower triangular matrix in this new representation is

Give a relational algebra expression using only the minimum number of operators from $$\left( { \cup ,\, - } \right)$$ which is equivalent to $$R \cap S$$.

An instance of a relational scheme R(A, B, C) has distinct values for attribute A. Can you conclude that A is a candidate key for R?

State True or False with reason. There is always a decomposition into Boyce-codd normal form $$(BCNF)$$ that is lossless and dependency preserving.

Let $$p$$ and $$q$$ be propositions. Using only the truth table decide whether $$p \Leftrightarrow q$$ does not imply $$p \to \sim q$$ is true or false.

The rank of the matrix $$\left[ {\matrix{ 0 & 0 & { - 3} \cr 9 & 3 & 5 \cr 3 & 1 & 1 \cr } } \right]$$ is

The inverse of the matrix $$\left[ {\matrix{ 1 & 0 & 1 \cr { - 1} & 1 & 1 \cr 0 & 1 & 0 \cr } } \right]$$ is

In a compact single dimensional array representation for lower triangular matrices (i.e., all the elements above the diagonal are zero) of size $$n$$ $$x$$ $$n$$, non-zero elements (i.e., elements of the lower triangle) of each row are stored one after another, starting from the first row, the index of the $${\left( {i,\,j} \right)^{th}}$$ element of the lower triangular matrix in this new representation is

The number of distinct simple graph with upto three nodes is

If A and B are real symmetric matrices of size n x n. Then, which one of the following is true?

The number of substrings (of all length inclusive) that can be formed from a character string of length $$n$$ is

Some group (G, o) is known to be abelian. Then, which one of the following is true for G?

Let A and B be any two arbitrary events, then, which one of the following is true?

Consider the resource allocation graph given in the figure.
(a) Find if the system is in a deadlock state.
(b) Otherwise, find a safe sequence.

Consider the following heap (Figure) in which blank regions are not in use and hatched region are in use.

The sequence of requests for blocks of size $$300, 25, 125, 50$$ can be satisfied if we use.

A memory page containing a heavily used variable that was initialized very early and is in constant use is removed when

In which one of the following cases is it possible to obtain different results for call-by-reference and call-by-name parameter passing methods?

An unrestricted use of the "goto" statement is harmful because

Which of the following features cannot be captured by context-free grammars?

Which of the following conversions is not possible (algorithmically)?

Given that language $${L_1}$$ is regular and that the language $${L_1} \cap {L_2}$$ is regular is the language $${L_2}$$ is always regular?

The regular expression for the language recognized by the finite state automation of is _________.

The number of sub-strings (of all lengths inclusive) that can be formed from a character string of length $$n$$ is

State True or False with one line explanation:

A FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).