ISRO CSE 2011


Q21.

Which of the following statements about peephole optimization is False?
GateOverflow

Q22.

In DMA transfer scheme, the transfer scheme other than burst mode is
GateOverflow

Q23.

Number of comparisons required for an unsuccessful search of an element in a sequential search organized, fixed length, symbol table of length L is
GateOverflow

Q24.

A symbol table of length 152 is processing 25 entries at any instant. What is occupation density?
GateOverflow

Q25.

If A and B are square matrices with same order and A is symmetric, then B^TAB is
GateOverflow

Q26.

What is the matrix that represents rotation of an object by \theta^0 about the origin in 2D?
GateOverflow

Q27.

Number of chips (128 \times 8 RAM) needed to provide a memory capacity of 2048 bytes
GateOverflow

Q28.

An example of poly-alphabetic substitution is
GateOverflow

Q29.

What is the decimal value of the floating-point number C1D00000 (hexadecimal notation)? (Assume 32-bit, single precision floating point IEEE representation)
GateOverflow

Q30.

In functional dependency Armstrong inference rules refers to
GateOverflow