NEW
New Website Launch
Experience the best way to solve previous year questions with mock tests (very detailed analysis), bookmark your favourite questions, practice etc...
VISIT NOW

GATE CSE

Memory Management

Operating Systems

Previous Years Questions

Marks 1

More
Consider a demand paging system with four page frames (initially empty) and LRU page replacement policy. For the followi...
GATE CSE 2022
Which one of the following statements is FALSE?
GATE CSE 2022
Consider allocation of memory to a new process. Assume that none of the existing holes in the memory will exactly fit th...
GATE CSE 2020
In which one of the following page replacement algorithms it is possible for the page fault rate to increase even when t...
GATE CSE 2016 Set 2
A computer system implements a $$40$$-bit virtual address, page size of $$8$$ kilobytes, and a $$128$$-entry translation...
GATE CSE 2015 Set 2
Consider a system with byte-addressable memory, 32-bit logical addresses, 4 kilobyte page size and page table entries of...
GATE CSE 2015 Set 1
A system uses $$3$$ page frames for storing process pages in main memory. It uses the Least Recently Used $$(LRU)$$ page...
GATE CSE 2014 Set 3
A system uses FIFO policy for page replacement. It has $$4$$ pages frames with no pages loaded to begin with. The system...
GATE CSE 2010
How many $$32K\,\, \times \,\,1RAM$$ chips are needed to provide a memory capacity of $$256$$ $$K$$-bytes?
GATE CSE 2009
The essential content(s) in each entry of a page table is / are:
GATE CSE 2009
In which one of the following page replacement policies, Belady’s anomaly may occur?
GATE CSE 2009
What is the swap space in the disk used for?
GATE CSE 2005
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determi...
GATE CSE 2004
Which of the following addressing modes are suitable for program relocation at run time? $$1.$$ Absolute addressing $$2....
GATE CSE 2004
Consider a program $$P$$ that consists of two source modules $${M_1}$$ and $${M_2}$$ contained in two different files. I...
GATE CSE 2004
In a system with $$32$$ bit virtual addresses and $$1$$ $$KB$$ page size, use of one-level page tables for virtual to ph...
GATE CSE 2003
The optimal page replacement algorithm will select the page that.
GATE CSE 2002
Which of the following is not a form of memory?
GATE CSE 2002
Consider a virtual memory system with $$FIFO$$ page replacement policy. For an arbitrary page access pattern, increasing...
GATE CSE 2001
The process of assigning load addresses to the various parts of the program and adjusting the code and date in the progr...
GATE CSE 2001
Which of the following statements is false?
GATE CSE 2001
In a resident $$–OS$$ computer, which of the following systems must reside in the main memory under all situations?
GATE CSE 1998
Dirty bit for a page in a page table
GATE CSE 1997
Thrashing
GATE CSE 1997
Locality of reference implies that the page reference being made by a process
GATE CSE 1997
A ROM is sued to store the table for multiplication of two $$8$$-bit unsigned integers. The size of ROM required is
GATE CSE 1996
A linker is given object modules for a set of programs that were compiled separately. What information need to be includ...
GATE CSE 1995
The principle of locality justifies the use of
GATE CSE 1995
In a paged segmented scheme of memory management, the segment table itself must have a page table because:
GATE CSE 1995
Which page replacement policy sometimes leads to more page faults when size of memory is increased?
GATE CSE 1992

Marks 2

More
In the context operating systems, which of the following statements is/are correct with respect to paging?
GATE CSE 2021 Set 1
Consider a paging system that uses a 1-level page table residing in main memory and a TLB for address translation. Each ...
GATE CSE 2020
Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. T...
GATE CSE 2019
Consider a process executing on an operating system that uses demand paging. The average time for a memory access in the...
GATE CSE 2018
Consider a computer system with ten physical page frames. The system is provided with an access sequence $$\left( {{a_1}...
GATE CSE 2016 Set 1
Consider a computer system with $$40$$-bit virtual addressing and page size of sixteen kilobytes. If the computer system...
GATE CSE 2016 Set 1
Consider six memory partitions of sizes $$200$$ $$KB,$$ $$400$$ $$KB,$$ $$600$$ $$KB,$$ $$500$$ $$KB,$$ $$300$$ $$KB$$ a...
GATE CSE 2015 Set 2
A computer system implements $$8$$ kilobyte pages and a $$32$$-bit physical address space. Each page table entry contain...
GATE CSE 2015 Set 2
Assume that there are $$3$$ page frames which are initially empty. If the page reference string is $$1, 2, 3, 4, 2, 1, 5...
GATE CSE 2014 Set 1
A computer has twenty physical page frames which contain pages numbered $$101$$ through $$120.$$ Now a program accesses ...
GATE CSE 2014 Set 2
Consider a paging hardware with a TLB. Assume that the entire page table and all the pages are in the physical memory. I...
GATE CSE 2014 Set 3
Consider the virtual page reference string $$$1,2,3,2,4,1,3,2,4,1$$$ On a demand paged virtual memory system running on...
GATE CSE 2012
A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physi...
GATE CSE 2009
Consider the virtual page reference string $$$1,2,3,2,4,1,3,2,4,1$$$ On a demand paged virtual memory system running on...
GATE CSE 2009
A processor uses 36 bit physical addresses and 32 bit virtual addresses, with a page frame size of 4 Kbytes. Each page t...
GATE CSE 2008
A process has been allocated $$3$$ page frames. Assume that none of the pages of the process are available in the memory...
GATE CSE 2007
A process has been allocated $$3$$ page frames. Assume that none of the pages of the process are available in the memory...
GATE CSE 2007
A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to...
GATE CSE 2007
A Computer system supports $$32$$-bit virtual addresses as well as $$32$$-bit physical addresses. Since the virtual addr...
GATE CSE 2006
Consider a System with a two-level paging scheme in which a regular memory access takes $$150$$ nanoseconds, and servici...
GATE CSE 2004
A processor uses $$2$$-level page tables for virtual to physical address translation. Page tables for both levels are st...
GATE CSE 2003
A processor uses $$2$$-level page tables for virtual to physical address translation. Page tables for both levels are st...
GATE CSE 2003
Which of the following is NOT an advantage of using shared, dynamically linked libraries as opposed to using statically ...
GATE CSE 2003
Dynamic linking can cause security concerns because
GATE CSE 2002
Consider a machine with 64 MB physical memory and a 32-bit virtual address space. If the page size is 4KB, what is the a...
GATE CSE 2001
Suppose the time to service a page fault is on the average $$10$$ milliseconds, while a memory access takes $$1$$ micros...
GATE CSE 2000
Which of the following is/are advantage of virtual memory?
GATE CSE 1999
If an instruction takes $${\rm I}$$ microseconds and a page fault takes an additional $$j$$ microseconds, the effective ...
GATE CSE 1998
The overlay tree for a program is as shown below: What will be the size of the partition (in physical memory) requir...
GATE CSE 1998
A $$1000$$ Kbyte memory is managed using variable partitions but to compaction. It currently has two partitions of sizes...
GATE CSE 1996
The capacity of a memory unit is defined by the number of words multiplied by the number of bits/word. How many separate...
GATE CSE 1995
In a virtual memory system the address space specified by the address lines of the $$CPU$$ must be __________ than the p...
GATE CSE 1995
The address sequence generated by tracing a particular program executing in a pure demand paging system with $$100$$ rec...
GATE CSE 1995
Consider the following heap (Figure) in which blank regions are not in use and hatched region are in use. The sequence...
GATE CSE 1994
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed when
GATE CSE 1994
A simple two-pass assembler does the following in the first pass:
GATE CSE 1993
A part of the system software, which under all circumstances must reside in the main memory is:
GATE CSE 1993
State whether the following statement TRUE or FALSE. The $$LRU$$ page-replacement policy may cause thrashing for some ty...
GATE CSE 1991
State whether the following statement TRUE or FALSE. The use of monitors ensures that no dead -locks will be caused....
GATE CSE 1991
State whether the following statement TRUE or FALSE. The best-fit techniques for memory allocation ensures the memory wi...
GATE CSE 1991
The total size of address space in a virtual memory systems is limited by
GATE CSE 1991
A ''link editor'' is a program that:
GATE CSE 1991
State whether the following statement TRUE or FALSE. Any implementation of a critical section requires the use of an ind...
GATE CSE 1991
State whether the following statement TRUE or FALSE. The amount of virtual memory available is limited by the availabili...
GATE CSE 1991
Match the pairs in the following question by writing the corresponding letters only. ...
GATE CSE 1991
State whether the following statements are TRUE or FALSE with reason. The Link-load -and-go loading scheme required less...
GATE CSE 1990
In a two -level virtual memory, the memory access time for main memory, $${t_M} = {10^{ - 8}}\sec $$ and the memory acce...
GATE CSE 1990
Under paged memory management scheme simple lock and key memory protection arrangement may still be required if the $$....
GATE CSE 1990
State whether the following statements are TRUE or FALSE with reason. Transferring data in blocks from the main memory t...
GATE CSE 1990
Match the pairs in the following Question. $$\eqalign{ & \,\,\,\,\,\,\,\,\,\,\,\,\,\,\,List:\,{\rm I} \cr &amp...
GATE CSE 1990
Match the pairs in the following question. List - $${\rm I}$$ $$(A)$$$$\,\,\,\,$$ Virtual Memory $$(B)$$$$\,\,\,\,$$ Sha...
GATE CSE 1989

Marks 5

More
A computer system uses $$32$$-bit virtual address, and $$32$$-bit physical address. The physical memory is byte addressa...
GATE CSE 2002
A certain computer system has the segmented paging architecture for virtual memory. The memory is byte addressable. Both...
GATE CSE 1999
In a computer system where the ‘best-fit’ algorithm is used for allocating ‘jobs’ to ‘memory partitions’, the following ...
GATE CSE 1998
A demand paged virtual memory system uses $$16$$ bit virtual address, page size of $$256$$ bytes, and has $$1$$ Kbyte of...
GATE CSE 1996
A computer installation has 1000K of main memory. The jobs arrive and finish in the following sequence. Job 1 requiring ...
GATE CSE 1995
The following page addresses, in the given sequence, were generated by a program: 1 2 3 4 1 3 5 2 1 5 4 3 2 3 This prog...
GATE CSE 1993
Let the page reference and the working set window be c c d b c e c e a d and 4, respectively. The initial working set at...
GATE CSE 1992

Joint Entrance Examination

JEE Main JEE Advanced WB JEE

Graduate Aptitude Test in Engineering

GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN

Medical

NEET

CBSE

Class 12