GATE CS IT Question Paper 1994

GATE CS IT Question Paper 1994.

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

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

GATE CS IT Question Paper 1994

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

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

Section — A
1. Choose one of the alternatives for the following questions:
1.1 FORTRAN implementation do not permit recursion because
(a) they use static allocation for variables
(b) they use dynamic allocation for variables
(c) stacks are not available on all machines
(d) it is not possible to implement recursion on all machines

1.5 An unrestricted use of the goto statement is harmful because
(a) it makes it more difficult to verify programs
(b) it increases the running time of the programs
(c) it increases the memory required for the programs
(d) it results in the compiler generating longer machine code

1.6 The number of distinct simple graphs with upto three nodes is
(a) 15 (b) 10 (c) 7 (d)9

1.12 Generation of intermediate code based on an abstract machine model is useful in compilers because
(a) it makes implementation of lexical analysis and syntax analysis easier
(b) syntax-directed translations can be written for intermediate code generation
(c) it enhances the portability of the front end of the compiler
(d) it is not possible to generate code for real machines directly from high level language programs

1.13 A memory page containing a heavily used variable that was initialized very early and is in constant use is removed when
(a) LRU page replacement algorithm is used
(b) FIFO page replacement algorithm is used
(c) LFU page replacement algorithm is used
(d) None of the above

1.14 Which of the following permutations can be obtained in the output (in the same order) using a stack assuming that the input is the sequence 1, 2, 3, 4, 5 in that order?
(a) 3,4,5,1,2 (b) 3,4,5,2,1 (c) 1,5,2,3,4 (d)5,4,3,1,2

Download Paper