1
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
The optimal page replacement algorithm will select the page that.
2
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
Which of the following statements is false?
3
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
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 assigned addresses is called
4
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
Consider a virtual memory system with $$FIFO$$ page replacement policy. For an arbitrary page access pattern, increasing the number of page frames in main memory will
Questions Asked from Memory Management (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2024 Set 2 (1)
GATE CSE 2023 (1)
GATE CSE 2021 Set 1 (1)
GATE CSE 2020 (1)
GATE CSE 2016 Set 2 (1)
GATE CSE 2015 Set 1 (1)
GATE CSE 2015 Set 2 (1)
GATE CSE 2014 Set 3 (1)
GATE CSE 2010 (1)
GATE CSE 2009 (3)
GATE CSE 2005 (1)
GATE CSE 2004 (3)
GATE CSE 2003 (1)
GATE CSE 2002 (2)
GATE CSE 2001 (3)
GATE CSE 1998 (1)
GATE CSE 1997 (3)
GATE CSE 1996 (1)
GATE CSE 1995 (3)
GATE CSE 1992 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages