GATE CS IT Question Paper 1995.
GATE CS IT Question Paper 1995 with Answers Solution Computer Science Information Technology 1995
GATE i.e. Graduate Aptitude Test in Engineering Computer Science Information Technology 1995 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 1995 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 1995 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 1995 question paper in pdf file for GATE CS IT you can download it in FRCS IT, if GATE Computer Science Information Technology 1995 paper in text for GATE CS IT you can download GATE CS IT 1995 page also just Go to menu bar, Click on File->then Save.
GATE CS IT Question Paper 1995
GATE CS IT 1995 Question paper Free Download PDF is available in www.oldquestionpapers.net which has been provided by many students this GATE Computer Science Information Technology 1995 paper is available for all the students in FRCS IT and also GATE CS IT 1995 question paper fully solved i.e with answer keys and solution.
You can get daily updates on GATE CS IT 1995 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 1995 question is also available in English.
SECTION – A
1. This question has 25 parts. Each part carries 1 mark. Choose the correct alternative for each part.
1.1 A single instruction to clear the lower four bits of the accumulator in 8085 assebly language
(a) XRI OFH (b) ANt FOH (c) XRI FOH (d) ANt OFH
1.2 Which of the following statements is true
(a) ROM is a Read/Write memory
(b) PC points to the last instruction that was executed
(C) Stack works on the principle of LIFO
(d) All instructions affect the flags
1.3 In a vectored interrupt
(a) the branch address is assigned to a fixed location in memory
(b) the interrupt source supplies the branch information to the processor through an interrupt vector
(c) the branch address is obtained from a register in the processor
(d) none of the above
1.4 In the following Pascal program segment, what is the value of X after the execution of the program segment?
If X > V then if X < 0 then X:=abs(X) else X:=2*X;
(a) 10 (b) -20 (c) -10 (d) None
1.5 Merge sort uses
(a) Divide and conquer strategy (b) Backtracking approach
(C) Heuristic search (d) Greedy approach
1.6 The principle of locality justifies the use of
(a) interrupts (b) DMA
(c) Polling (d) Cache Memory
1.7 In a paged segmented scheme of memory management, the segment table itself must have a page table because
(a) the segment table is often too large to fit in one page
(b) each segment is spread over a number of pages