GATE CS IT Question Paper 1992

GATE CS IT Question Paper 1992.

GATE CS IT Question Paper 1992 with Answers Solution Computer Science Information Technology

GATE i.e. Graduate Aptitude Test in Engineering Computer Science Information Technology 1992 Exam Has been Conducted by IISc Bangalore IIT Bombay IIT Delhi IIT Guwahati IIT Kanpur IIT Kharagpur IIT Madras IIT Roorkee. This GATE CS IT 1992 examination is the procedure to get the admission in M.Tech

GATE Computer Science Information Technology i.e. CS IT Question Paper, This GATE CS IT 1992 Question will help all the students for their exam preparation, here the question type is MCQ i.e multiple choice question answers, if this GATE CS IT 1992 question paper in pdf file for GATE CS IT you can download it in FRCS IT, if GATE Computer Science Information Technology 1992 paper in text for GATE CS IT you can download GATE CS IT 1992 page also just Go to menu bar, Click on File->then Save.

GATE CS IT Question Paper 1992

GATE CS IT 1992 Question paper Free Download PDF is available in www.oldquestionpapers.net which has been provided by many students this GATE Computer Science Information Technology 1992 paper is available for all the students in FRCS IT and also GATE CS IT 1992 question paper fully solved i.e with answer keys and solution.

You can get daily updates on GATE CS IT 1992 from www.oldquestionpapers.net here you can also check similar links for other related study materials on GATE Computer Science Information Technology exam. Here GATE CS IT 1992 question is also available in English.

1. Fill in the blanks:

(ii) 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
(iii) Many microprocessors have a specified lower limit on clock frequency (apart
from the maximum clock frequency limit) because ______
(iv) Many of the advanced microprocessors prefetch instructions and store it in
an instruction buffer to speed up processing. This speed up is achieved
because __________
(v) 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 ___________
(vi) In an 11-bit computer instruction format, the size of address field is 4-bits.
The computer uses expanding OP code technique and has S two-address
instructions and 32 two-address instructions and the number of zero-address
instructions it can support is __________
(vii)Macro expansion is done in pass one instead of pass two in a pass macro
assembler because _______
(viii) The purpose of instruction location counter in an assembler is ________
(ix) 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 _______
(x) Maximum number of edges in a planar graph with n vertices is _________