With 3 initially empty frames, how many page faults does LRU page replacement cause for the reference string 1, 3, 0, 3, 5, 6, 3, 1, 0, 5, 6, 3?
Correct answer D. 10
Subject / 929 questions
Page 17 of Programming multiple-choice questions with answers. Tap an option to check yourself.
Page 17 of 47
Correct answer D. 10
Correct answer C. 7
Correct answer D. Belady's anomaly
Correct answer C. A process spends more time paging pages in and out than executing, because it lacks enough frames
Correct answer B. A page that has not been modified need not be written back to disk before its frame is reused
Correct answer A. They are shared copy-on-write, so a page is copied only when either process writes to it
Correct answer B. Contiguous allocation
Correct answer D. Indexed allocation
Correct answer D. Linked allocation
Correct answer D. The file's name
Correct answer C. A hard link is another directory entry for the same inode, while a symbolic link is a separate file containing a path
Correct answer C. 48 KB
Correct answer D. 680 cylinders
Correct answer B. 230 cylinders
Correct answer A. 318 cylinders
Correct answer B. 280 cylinders
Correct answer D. 388 cylinders
Correct answer A. Requests far from the current head position can starve
Correct answer A. A device controller moves whole blocks of data to or from memory without the CPU handling each byte
Correct answer C. Spooling