Đang tải dữ liệu
Hệ thống đang chuẩn bị tài nguyên cho bạn...
Hệ thống đang chuẩn bị tài nguyên cho bạn...
Bộ thẻ của môn OSG202
Câu 1: The hardware mechanism that allows a device to notify the CPU is called
A. interrupt
Câu 2: In Disk Arm Scheduling Algorithms: Consider the seek to cylinder 71 is in progress; new requests come in for cylinders 1, 36, 16, 34, 9, and 12; A seek takes 6 msec per cylinder. Calculate Seek time with Shortest Seek First (SSF) algorithm?
B. 366ms
Câu 3: In what scenario would a microkernel-based operating system structure be advantageous compared to a monolithic structure?
B. When isolation between user and kernel space is crucial
Câu 4: Which RAID level provides disk striping without fault tolerance?
A. RAID 0
Câu 5: Example of First-Come-First-Served (FCFS): Suppose that the processes arrive in the order: "P2, P3, P1". Calculate the Average waiting time of the processes with the following burst time: Burst Time of P1 process: 24, Burst Time of P2 process: 3, Burst Time of P3 process: 3.
A. 3
Câu 6: A problem closely related to deadlock and livelock is
A. Starvation
Còn 44 thẻ đang khóa
Mở khóa để xem toàn bộ 50 thẻ, lật thẻ ghi nhớ và chế độ Học.