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 1995
MCQ (Single Correct Answer)
+2
-0.6
The address sequence generated by tracing a particular program executing in a pure demand paging system with $$100$$ records per page with $$1$$ free main memory frame is recorded as follows. What is the number of page faults?

$$0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0370 $$

A
$$13$$
B
$$8$$
C
$$7$$
D
$$10$$
2
GATE CSE 1995
MCQ (Single Correct Answer)
+2
-0.6
In a virtual memory system the address space specified by the address lines of the $$CPU$$ must be __________ than the physical memory size and _______ than the secondary storage size.
A
smaller, smaller
B
smaller, larger
C
larger, smaller
D
larger, larger
3
GATE CSE 1995
MCQ (Single Correct Answer)
+2
-0.6
The capacity of a memory unit is defined by the number of words multiplied by the number of bits/word. How many separate address and data lines are needed for a memory of $$4K\,\, \times \,\,16?$$
A
$$10$$ address, $$16$$ data lines
B
$$11$$ address, $$8$$ data lines
C
$$12$$ address, $$16$$ data lines
D
$$12$$ address, $$12$$ data lines
4
GATE CSE 1994
MCQ (Single Correct Answer)
+2
-0.6
Consider the following heap (Figure) in which blank regions are not in use and hatched region are in use.

The sequence of requests for blocks of size $$300, 25, 125, 50$$ can be satisfied if we use.

GATE CSE 1994 Operating Systems - Memory Management Question 27 English
A
Either first fit or best fit policy (any one)
B
First fit but not best fit policy
C
Best fit but first fit policy
D
None of the above
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