Consider the following page references, with 3 frames and FIFO page replacement policy is used. Calculate the total number of page faults.

1, 2, 3, 2, 1, 5, 2, 1, 6, 2, 5, 6, 3, 1, 3, 6, 1, 2, 4, 3

14
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Consider the following page references, with 3 frames and OPTIMAL page replacement policy is used. Calculate the total number of page faults.

1, 2, 3, 2, 1, 5, 2, 1, 6, 2, 5, 6, 3, 1, 3, 6, 1, 2, 4, 3

9
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Consider the following page references, with 3 frames and LRU page replacement policy is used. Calculate the total number of page faults.

1, 2, 3, 2, 1, 5, 2, 1, 6, 2, 5, 6, 3, 1, 3, 6, 1, 2, 4, 3

11
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Given the following queue for disk requests -- 95, 180, 34, 119, 11, 123, 62, 64 with the read-write head initially at track 50 and the tracks are labeled form 0-199. The total number of disk seeks for FCFS scheduling algorithm is________
644
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Given the following queue for disk requests -- 95, 180, 34, 119, 11, 123, 62, 64 with the read-write head initially at the track 50 and the tracks are labelled form 0-199. The total number of disk seeks for SSTF scheduling algorithm is________
236
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.00
Consider a paging system that uses 3-level page table residing in main memory and a TLB for address translation. Each main memory access takes 150 ns and TLB lookup takes 10 ns. Each page transfer to/from the disk takes 5000 ns. Assume that the TLB hit ratio is 90%, page fault rate is 10%. Assume that for 15% of the total page faults, a dirty page has to be written back to disk before the required page is read from disk. TLB update time is negligible. The average memory access time in ns (round off to 2 decimal places) is ___________
262.50
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Consider a paging system that uses 1-level page table residing in main memory and a TLB for address translation. Each main memory access takes 100 ns and TLB lookup takes 20 ns. The page fault service takes 5000 ns. Assume that the TLB hit ratio is 95%, page fault rate is 10%. TLB update time is negligible.

The average memory access time in ns (round off to 2 decimal places) is ___________

149.50
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Consider a paging system that uses 1-level page table residing in main memory and a TLB for address translation. Each main memory access takes 100 ns and TLB look up takes 20 ns. Assume that the TLB hit ratio is 95%, the average memory access time in ns (round off to 2 decimal places) is ________.
125.00
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Consider a paging system that uses 1-level page table residing in main memory and a TLB for address translation. Each main memory access takes 100 ns and TLB lookup takes 20 ns. To make the memory access faster, a physical level-1 cache is introduced, with no update mechanism. The cache access time is 75 ns, with a cache hit rate of 90%. Assume that the TLB hit ratio is 95%, and the page tables are not cached, the effective memory access time in ns (round off to 2 decimal places) is ________
102.50
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Consider a FAT system and that uses 24 bits for each entry. For a 32 GB disk, what is the minimum size of a file allocation in this system_________ KB?
2
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Consider an index-based file system with the inode containing 64 direct, 1 indirect index block, and a doubly indirect index block. Assume that each index takes 4 bytes. The maximum file size under this arrangement, ___________ KB, if a disk block is 1024 bytes?
65856
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Consider the following requests for disk access: 64, 20, 75, 70, 11, 108, 120, 9, 45, 8. The tracks are numbered from 1-200, and the head is positioned at track 100. Identify the disk scheduling algorithm used, for which the below graph would have been obtained?

First Come First Serve
Shortest Seek Time First
SCAN (direction towards left)
C-SCAN (direction towards left)
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Consider a process with a working set size of 256KB. Assuming the same system with 32 bit virtual and physical address space, with 4KB page size, what is the minimum amount of TLB entries that the system would need to support to be able to map/cache the working set size for one process?
64
128
512
1024
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66
Suppose a file system can have three disk allocation strategies, contiguous, linked, and indexed. We have just read the information for a file from its parent directory. For contiguous and linked allocation, this gives the address of the first block, and for indexed allocation this gives the address of the index block. Now we want to read the Nth data block into the memory. How many disk blocks do we have to read for each of the allocation strategies? (contiguous, linked, and indexed)
0, 1, and N
1, N, and 0
2, 1, and N
1, N, and 2
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

Consider the following memory reference string :

1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2

Calculate the average memory access time if memory access time is 100ns and 3000ns page fault service time if on demand Optimal page replacement algorithm is used with a total physical memory of 4 frames.

3000ns

1250ns

1420ns

1550ns

Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66