All mock tests are FREE till 31 December — register to save your progress
Paper 2 CS · UNIT 05 · MOCK TEST

System Software and Operating System — Mock Test 8

25 questions · about 30 minutes. Press End Mock any time to see your score and the correct answers.

0 / 25 answered 00:00
Q1. Which of the following is NOT correct about virtual-memory segmentation?
Q2. Which of the following is NOT a characteristic of a specialised embedded OS?
Q3. In Windows scheduling, which of the following is correct?
Q4. Which RAID level is appropriate for storing the log file of a ticket-booking system where huge database updates are required?
Q5. The model of protection can be viewed as a(n)
Q6. A process in memory also contains a heap section. What is the heap used for?
Q7. How many page faults occur with the optimal algorithm for the reference string 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8 with four frames?
Q8. The degree of concurrency of thread models can be arranged as:
Q9. Which of the following statements are true?
A. If the time quantum is extremely small, round robin can result in a large number of context switches.
B. The average turnaround time of a set of processes does not necessarily improve as the time-quantum size increases.
C. The average turnaround time can be improved if most processes finish their next CPU burst in a single time quantum.
Choose the correct answer from the options given below:
Q10. Processes (arrival, execution time in ms): A (0, 6), B (3, 2), C (5, 4), D (7, 6), E (10, 3). Using shortest-remaining-time-first scheduling, the average turnaround time is ____
Q11. Select the correct order of basic page replacement:
A. A page-replacement algorithm is used if there is no free frame
B. The process is continued by restarting the instruction that caused the trap
C. The location of the desired page is found on disk
D. The desired page is brought into the newly freed frame and the page and frame tables are updated
Q12. Match List I (reference bit, modify bit) with List II (enhanced second-chance algorithm)
List IList II
A. (reference = 0, modify = 0)I. Must write out before replacement.
B. (reference = 0, modify = 1)II. Probably will be used again soon and needs to be written out.
C. (reference = 1, modify = 0)III. Best page to replace.
D. (reference = 1, modify = 1)IV. Probably will be used again soon.
Q13. A disk has 300 cylinders (0 to 299). The read-write head is at cylinder 101, moving towards the higher end. Calculate the total head movement with the C-LOOK policy for the requests 123, 45, 197, 87, 250, 198, 280.
Q14. Statement I: The main objective of using virtual memory is to increase the effective capacity of the memory system.
Statement II: The size of virtual memory can be larger than the main memory.
Q15. In the Linux operating system, when ________ is invoked, it is passed a set of flags that determine how much sharing is to take place between the parent and child tasks.
Q16. The main function of the microkernel is to provide a communication facility between the ________ program and the various ________ that are also running in user space.
Q17. Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is first come first served (FCFS). If FCFS is replaced by shortest seek time first (SSTF) and the vendor claims 50% better benchmark results, what is the expected improvement in the I/O performance of user programs?
Q18. For the following set of processes scheduled using the FCFS policy, determine the average waiting time. The processes arrived in the order P1, P2, P3, P4.
ProcessBurst Time
P18
P215
P310
P47
Q19. Which of the following statements are true?
1. Shortest remaining time first scheduling may cause starvation
2. Preemptive scheduling may cause starvation
3. Round robin is better than FCFS in terms of response time
Choose the correct answer from the options given below:
Q20. In the design of a protocol for the critical-section problem, each process must ask permission to enter the critical section in the ______ code; it then executes in the critical section; once it finishes it enters the ______ code. The process then enters the ______ code.
Q21. Match List I with List II.
Choose the correct answer from the options given below:
List IList II
a. IPCI. Resource allocation
b. Demand pagingII. Computational speed-up
c. Banker's algorithmIII. Task control block
d. PCBIV. Virtual memory
Q22. Select the correct order of events after power is turned on in a system.
I. Bootstrap loader is loaded from the disk
II. Kernel is loaded into memory
III. Firmware ROM loads the boot block
Choose the correct answer from the options given below:
Q23. An OS follows round-robin scheduling with a time quantum of 4 ms. The CPU is free now and there are 20 processes waiting in the ready queue. The maximum time a process waits before getting the CPU is ______.
Q24. If an operating system does not allow a child process to exist when its parent process has terminated, this phenomenon is called
Q25. What is called journalling in the Linux operating system?