Skip to content

Category Archives: ISRO

The persist timer is used in TCP to (A) To detect crashes from the other end of the connection (B) To enable retransmission (C) To… Read More
To send same bit sequence, NRZ encoding require (A) Same clock frequency as Manchester encoding (B) Half the clock frequency as Manchester encoding (C) Twice… Read More
The SQL query SELECT columns FROM TableA RIGHT OUTER JOIN TableB ON A.columnName = B.columnName WHERE A.columnName IS NULL returns the following: (A) All rows… Read More
If every non-key attribute functionally dependent on the primary key, then the relation will be in (A) First normal form (B) Second normal form (C)… Read More
One instruction tries to write an operand before it is written by previous instruction. This may lead to a dependency called (A) True dependency (B)… Read More
In a two-pass assembler, resolution of subroutine calls and inclusion of labels in the symbol table is done during (A) second pass (B) first pass… Read More
The number of tokens in the following C code segment is switch(inputvalue) { case 1 : b = c * d; break; default : b… Read More
If ABCD is a 4-bit binary number, then what is code generated by the following circuit ? (A) BCD code (B) Gray code (C) 8421… Read More
Minimum number of NAND gates required to implement the following binary equation (A’+B’)(C+D) (A) 4 (B) 5 (C) 3 (D) 6 Answer: (A) Explanation: Given… Read More
Of the following, which best approximates the ratio of the number of non-terminal nodes in the total number of nodes in a complete K-ary tree… Read More
In a class definition with 10 methods, to make the class maximally cohesive, number of direct and indirect connections required among the methods are (A)… Read More
Consider the following pseudo-code: I = 0; J = 0; K = 8; while (I < K – 1) //while-1 { J = J +… Read More
Raymonds tree based algorithm ensures (A) no starvation, but deadlock may occur in rare cases (B) no deadlock, but starvation may occur (C) neither deadlock… Read More
The Master theorem (A) assumes the subproblems are unequal sizes (B) can be used if the subproblems are of equal size (C) cannot be used… Read More
The minimum height of an AVL tree with n nodes is (A) Ceil (log2 (n + 1)) (B) 1.44 log2 n (C) Floor (log2 (n… Read More