# GATE CSE 1995

 Question 1
A single instruction to clear the lower four bits of the accumulator in 8085 assembly language?
 A XRI 0FH B ANI F0H C XRI F0H D ANI 0FH
Computer Organization
Question 1 Explanation:
 Question 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
Computer Organization   Memory Chip Design
Question 2 Explanation:
 Question 3
In a vectored interrupt:
 A The branch address is assigned to a fixed location in memory B The interrupting 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
Computer Organization   Interrupt
Question 3 Explanation:
 Question 4
In the following Pascal program segment, what is the value of X after the execution of the program segment?
X := -10; Y := 20;
If X > Y then if X < 0 then X := abs(X) else X := 2*X; 
 A 10 B -20 C -10 D None
C Programming   Conditional Statement
Question 4 Explanation:
 Question 5
Merge sort uses:
 A Divide and conquer strategy B Backtracking approach C Heuristic search D Greedy approach
Algorithm   Sorting
Question 5 Explanation:
 Question 6
The principle of locality justifies the use of:
 A Interrupts B DMA C Polling D Cache Memory
Computer Organization   Cache Memory
Question 6 Explanation:
 Question 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 C Segment tables point to page tables and not to the physical locations of the segment D The processor's description base register points to a page table
Operating System   Memory Management
Question 7 Explanation:
 Question 8
Which of the following page replacement algorithms suffers from Belady's anamoly?
 A Optimal replacement B LRU C FIFO D Both (A) and (C)
Operating System   Memory Management
Question 8 Explanation:
 Question 9
In some programming language, an identifier is permitted to be a letter followed by any number of letters or digits. If L and D denote the sets of letters and digits respectively, which of the following expressions defines an identifier?
 A $(L + D)^+$ B $(L.D)^*$ C $L(L + D)^*$ D $L(L.D)^*$
Theory of Computation   Regular Expression
Question 9 Explanation:
 Question 10
Consider a grammar with the following productions
$S \rightarrow a \alpha b \mid b \alpha c \mid aB$
$S \rightarrow \alpha S\mid b$
$S \rightarrow \alpha b b\mid ab$
$S \alpha \rightarrow bd b\mid b$
The above grammar is:
 A Context free B Regular C Context sensitive D LR(k)
Theory of Computation   Context Free Grammar
Question 10 Explanation:
There are 10 questions to complete.