GATE 1992

Question 1

The Boolean function in sum of products form where K-map is given below (figure) is:___________

ABC + B'C' + A'C'
Question 1 Explanation: 
We can write this as

⇒ ABC + B'C' + A'C'
Question 2

Consider a 3-bit error detection and 1-bit error correction hamming code for 4-bit date. The extra parity bits required would be ________ and the 3-bit error detection is possible because the code has a minimum distance of ________

Fill in the blanks
Question 3

Many microprocessors have a specified lower limit on clock frequency (apart from the maximum clock frequency limit) because ______

clock frequency can't go below this value.
Question 3 Explanation: 
Clock frequency becomes low memory time period of clock becomes high. When this time period increases beyond the time period in which the non-volatile memory contents must be refreshed, we loose those contents. So clock frequency can't go below this value.
Question 4

Many of the advanced microprocessors prefetch instructions and store it in an instruction buffer to speed up processing. This speed up is achieved because _________

prefetching the instructions to be executed can save considerable amount of waiting time.
Question 4 Explanation: 
Because CPU is faster than memory. Fetching the instructions from memory would require considerable amount of time while CPU is much faster. So, prefetching the instructions to be executed can save considerable amount of waiting time.
Question 5

A simple and reliable data transfer can be accomplished by using the ‘handshake protocol’. It accomplishes reliable data transfer because for every data item sent by the transmitter __________.

in this case receiver has to respond that receiver can be able to receive the data item.
Question 6

In an 11-bit computer instruction format, the size of address field is 4-bits. The computer uses expanding OP code technique and has 5 two-address instructions and 32 two-address instructions and the number of zero-address instructions it can support is _________

Question 6 Explanation: 
In encoding no. of possible instructions = 211 = 2048
The possibility of no. of encoding taken by two-address instructions = 5×24×24 = 1280
By one-address instructions = 32×24 = 512
So, the possibility of zero-address instructions = 2048 - (1280 + 512) = 256
Question 7

Macro expansion is done in pass one instead of pass two in a pass macro assembler because _________

all macro definitions are processed during the first pass only due to all macro expansions done during pass 1 only not in pass 2.
Question 8

The purpose of instruction location counter in an assembler is _______

used to assign storage address to the program's statements.
Question 8 Explanation: 
is used to assign storage address to the program's statements. As the instruction of a source module are being assembled, the location counter keeps track of current location in storage.
Question 9

Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edges if the edges are sorted is __________

O(m log n)
Question 9 Explanation: 
Though the edges are to be sorted still due to union find operation complexity is O(m log n).
Question 10

Maximum number of edges in a planar graph with n vertices is ________

3n - 6
Question 10 Explanation: 
The maximum is 3(n - 8) for every n>2.
⇒ (3n - 2) = 3n - 6
Question 11

The operation which is commutative but not associative is:

Question 11 Explanation: 
NAND and NOR operation follow commutativity but do not follow associativity.
Question 12

All digital circuits can be realized using only

Ex-OR gates
Half adders
OR gates
Both B and C
Question 12 Explanation: 
NOR gate, NAND gate, Multiplexers and Half adders can also be used to realize all digital circuits.
There are 12 questions to complete.

Access quiz wise question and answers by becoming as a solutions adda PRO SUBSCRIBER with Ad-Free content

Register Now

If you have registered and made your payment please contact to get access