Operating Systems
Process Concepts and Cpu Scheduling
Marks 1Marks 2
Synchronization and Concurrency
Marks 1Marks 2
Memory Management
Marks 1Marks 2Marks 5
File System IO and Protection
Marks 1Marks 2Marks 5
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 2002
MCQ (Single Correct Answer)
+1
-0.3
Which of the following is not a form of memory?
A
Instruction cache
B
Instruction register
C
Instruction opcode
D
Translation look a side buffer
3
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.
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
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization