Question 1 |

FORTRAN implementation do not permit recursion because

they use static allocation for variables | |

they use dynamic allocation for variables | |

stacks are not available on all machines | |

it is not possible to implement recursion on all machines |

Question 1 Explanation:

Question 2 |

Let A and B be real symmetric matrices of size n \times n. Then which one of the following is true?

AA'=I | |

A=A^{-1} | |

AB=BA | |

(AB)'=BA |

Question 2 Explanation:

Question 3 |

Backward Euler method for solving the differential equation \frac{dy}{dx}=f(x, y) is specified by, (choose one of the following).

y_{n+1}=y_n+hf(x_n, y_n) | |

y_{n+1}=y_n+hf(x_{n+1}, y_{n+1}) | |

y_{n+1}=y_{n-1}+2hf(x_n, y_n) | |

y_{n+1}= (1+h)f(x_{n+1}, y_{n+1}) |

Question 3 Explanation:

Question 4 |

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

P (A \cap B) = P(A)P(B) | |

P (A \cup B) = P(A)+P(B) | |

P (A \mid B) = P(A \cap B)P(B) | |

P (A \cup B) \leq P(A) + P(B) |

Question 4 Explanation:

Question 5 |

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

it makes it more difficult to verify programs | |

it increases the running time of the programs | |

it increases the memory required for the programs | |

it results in the compiler generating longer machine code |

Question 5 Explanation:

Question 6 |

The number of distinct simple graphs with up to three nodes is

15 | |

10 | |

7 | |

9 |

Question 6 Explanation:

Question 7 |

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

T(n) = 2T\left(\frac{n}{2}\right)+k, \text{ k is a constant } | |

T(n) = T\left(\frac{n}{2}\right)+k, \text{ k is a constant } | |

T(n) = T\left(\frac{n}{2}\right)+\log n | |

T(n) = T\left(\frac{n}{2}\right)+n |

Question 7 Explanation:

Question 8 |

The logic expression for the output of the circuit shown in figure below is:

\overline{AC} + \overline{BC} +CD | |

\overline{A}C + \overline{B}C + CD | |

ABC +\overline {C}\; \overline{D} | |

\overline{A}\; \overline{B} + \overline{B}\; \overline{C} +CD |

Question 8 Explanation:

Question 9 |

The rank of matrix \begin{bmatrix} 0 & 0 & -3 \\ 9 & 3 & 5 \\ 3 & 1 & 1 \end{bmatrix}is:

0 | |

1 | |

2 | |

3 |

Question 9 Explanation:

Question 10 |

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

g=g^{-1} \text{ for every } g \in G | |

g=g^2 \text{ for every }g \in G | |

(goh)^2 = g^2oh^2 \text{ for every } g, h \in G | |

G is of finite order |

Question 10 Explanation:

There are 10 questions to complete.