Skip to content

Tag Archives: GATE-CS-2001

Where does the swap space reside? (A) RAM (B) Disk (C) ROM (D) On-chip cache Answer: (B) Explanation: Swap space is an area on disk… Read More
Consider a set of n tasks with known runtimes r1, r2, …. rn to be run on a uniprocessor machine. Which of the following processor… Read More
Which of the following statements is false? (A) An unambiguous grammar has same leftmost and rightmost derivation (B) An LL(1) parser is a top-down parser… Read More
The process of assigning load addresses to the various parts of the program and adjusting the code and date in the program to reflect the… Read More
Let f(n) = n2Logn and g(n) = n (logn)10 be two positive functions of n. Which of the following statements is correct? (A) f(n) =… Read More
Consider any array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For… Read More
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized… Read More
A CPU has two modes-privileged and non-privileged. In order to change the mode from privileged to non-privileged (A) a hardware interrupt is needed (B) a… Read More
A processor needs software interrupt to (A) test the interrupt system of the processor (B) implement co-routines (C) obtain system services which need execution of… Read More
Given the following Karnaugh map, which one of the following represents the minimal Sum-Of-Products of the map? (A) xy + y’z (B) wx’y’ + xy… Read More
Suppose a processor does not have any stack pointer register. Which of the following statements is true? (A) It cannot have subroutine call instruction (B)… Read More
A low memory can be connected to 8085 by using (A) INTER (B) RESET IN (C) HOLD (D) READY Answer: (D) Explanation: A low memory… Read More
Which of the following statements is false? (A) Virtual memory implements the translation of a program‘s address space into physical memory address space (B) Virtual… Read More
More than one word are put in one cache block to (A) exploit the temporal locality of reference in a program (B) exploit the spatial… Read More
Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least (A) N2… Read More