What is fragmentation in the context of file-system implementation?🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
What are the four important issues for I/O software? Choose correct answers.🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
How many layers are there in the I/O software system?🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
If a process has begun to burn a Blu-ray, suddenly taking the Blu-ray recorder away from it and giving it to another process will result in a garbled Blu-ray. What does the scenario above indicate?🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
Which operating system runs on systems with any CPU (multi-processor, multi-core, multi-chip)?🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
When using the Critical Regions solution, which of the following conditions is NOT necessary?🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
In the context of a file system, how many letters do all current operating systems allow as legal file names?🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
Suppose there are 4 memory blocks, B1, B2, B3, and B4, with sizes of 600K, 500K, 200K, and 300K, respectively. And we have 4 processes, P1, P2, P3, and P4, with corresponding request sizes of 250K, 420K, 150K, and 450K. \nWhen applying the best-fit algorithm, which memory blocks are allocated to the process?🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
A key concept in all operating systems is the _____.🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
If optimal page replacement is used with four page frames, how many page faults will occur with the reference string $7, 0, 1, 2, 0, 3, 0$ if the four frames are initially empty?🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
What does a resource allocation graph represent in the context of deadlock detection?🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
Which of the following is not correct about hard links?🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
Assume jobs A-D arrive in quick succession in the READY queue. Using round robin scheduling (quantum = 4), the turnaround time for job D is ____. \nArrival time: $0\quad 1\quad 2\quad 3$ \nJob: $A\quad B\quad C\quad D$ \nCPU cycle: $8\quad 4\quad 9\quad 5$🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
Which of a system call is to allow the system to specify from where to take the data in file?🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
What is true about non-preemptable resources?🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
In order to implement mutual exclusion on a critical resource for competing processes, only one program at a time should be allowed:🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
A computer has four page frames. The time of loading, time of last access, and the R and M bits for each page are as shown below (the times are in clock ticks): | Page | Loaded | Last ref. | R | M | |------|--------|-----------|---|---| | 0 | 226 | 280 | 0 | 0 | | 1 | 160 | 265 | 0 | 1 | | 2 | 110 | 270 | 1 | 0 | | 3 | 120 | 285 | 1 | 1 | \nWhich page will NRU replace?🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
Suppose a virtual address space of $2^{24}$ words and the page size is $2^{12}$ words. If the virtual address is $123456$ in hexadecimal, what would be the page number in hexadecimal?🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
Which of the following is not file structure?🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi
The disk blocks in a partition that contains the top of the file system tree is called:🔒 Đáp án trong Source VIPOSG202Đã xuất hiện trong 3 đề thi