Time Left - 05:00 mins
GATE CS 2018 - Operating System Daily Quiz- 3 (Memory Management and Virtual Memory)
Attempt now to get your rank among 383 students!
Question 1
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute (RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Considera file stored in the disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average rotational latency for accessingeach sector is half of the time for one complete rotation. The total time (in milliseconds) needed to read the entire file is__________.
Question 2
Consider a system with byte-addressable memory, 32-bit logical addresses, 4 kilobyte page size and page table entries of 4 bytes each. The size of the page table in the system in megabytes is _________.
Question 3
Recall that Belady’s anomaly is that the pages-fault rate may increase as the number of allocated frames increases. Now consider the following statements:
S1: Random page replacement algorithm (where a page chosen at random is replaced) suffers from Belady’s anomaly
S2: LRU page replacement algorithm suffers from Belady’s anomaly
Which of the following is CORRECT?
S1: Random page replacement algorithm (where a page chosen at random is replaced) suffers from Belady’s anomaly
S2: LRU page replacement algorithm suffers from Belady’s anomaly
Which of the following is CORRECT?
Question 4
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3, 9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with respect to page replacement policies First In First Out (FIFO) and Least Recently Used (LRU)?
Question 5
In which one of the following page replacement algorithms it is possible for the page fault rate to increase even when the number of allocated frames increases?
- 383 attempts
- 1 upvote
- 7 comments
Apr 10GATE & PSU CS
