GATE CS IT Question Paper 1991

GATE CS IT Question Paper 1991.

GATE i.e. Graduate Aptitude Test in Engineering Computer Science Information Technology 1991 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 1991 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 1991 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 1991 question paper in pdf file for GATE CS IT you can download it in FRCS IT, if GATE Computer Science Information Technology 1991 paper in text for GATE CS IT you can download GATE CS IT 1991 page also just Go to menu bar, Click on File->then Save.

GATE CS IT Question Paper 1991

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

You can get daily updates on GATE CS IT 1991 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 1991 question is also available in English.

1. Fill in the blanks:

(ii) In interleaved memory organization, consecutive words are stored in
consecutive memory modules in _________ interleaving, whereas consecutive
words are stored within the module in _________ interleaving.
(iii) Consider the number given by the decimal expression:
16 *9+162 *7±16*5+3
The number of l’s in the unsigned binary representation of the number is
(iv) Using the 8087 arithmetic coprocessor with the 8087 Cpu requires that the
8087 Cpu is operated _________

(vi) Consider the following PASCAL program segment:
if i mode 2 = 0 then
while i> = 0 do
beg in
i:=i div 2;
ifimod2< >Odotheni:=i—1
else i:=i — 2
end
An appropriate loop-invanant for the white-loop is ______
(vii)The minimum number of comparisons required to sort 5 elements is _____

Download Paper