1
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
The optimal page replacement algorithm will select the page that.
A
Has not been used for the longest time in the past.
B
Will not be used for the longest time in the future.
C
Has been used least number of times.
D
Has been used most number of times.
2
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
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 memory allows each program to exceed the size of the primary memory
C
Virtual memory increases the degree of multiprogramming.
D
Virtual memory reduces the context switching overhead.
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
A
Assembly
B
Parsing
C
Relocation
D
Symbol resolution
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
A
Always decrease the number of page faults.
B
Always increase the number of page faults.
C
Sometimes increase the number of page faults.
D
Never affect the number of page faults.
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12