Câu hỏi gốc môn OSG202

707 câu gốc, sắp theo số đề từng chứa câu đó.

20 kết quả phù hợp nhất

While processing cylinder 25, new requests appear for cylinders 5, 48, 32, 50, and 12. Using the FCFS (First-Come, First-Served) scheduling algorithm, what is the total number of disk head movements?

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

What is an absolute path in operating systems?

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

A system has 3 types of resources (A, B, C) with total instances: - A = 10 - B = 5 - C = 7 \nThe Allocation and Max for each process are: - P0: Allocation = (0, 1, 0), Max = (7, 5, 3) - P1: Allocation = (2, 0, 0), Max = (3, 2, 2) - P2: Allocation = (3, 0, 2), Max = (9, 0, 2) - P3: Allocation = (2, 1, 1), Max = (2, 2, 2) - P4: Allocation = (0, 0, 2), Max = (4, 3, 3) \nWhich of the following is the correct safe sequence when applying the Banker's Algorithm?

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

Which directory structure would be the most efficient in preventing filename conflicts while allowing quick lookups?

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

In UNIX, how are devices like USB sticks integrated into the file-system hierarchy?

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

What is the primary objective of Deadlock Avoidance techniques?

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

Which recovery method can lead to data inconsistency when re-executed in the case of a deadlock?

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify ________.

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

Which of the following best describes a "race condition"?

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

Analyze the significance of the hold-and-wait condition in resource deadlock, explaining its impact on deadlock prevention strategies in an operating system.

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

Assume jobs A-D arrive in quick succession in the READY queue. Using Shortest Job First scheduling, the average waiting time for each process is ____. Arrival time: 2 3 1 0 Job: A B C D CPU cycle: 7 5 8 6

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

Which symbol is commonly used to represent the current directory in a path?

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

Which of the following best describes a process in the "Running" state?

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

Consider the following processes with their arrival and burst times: | Process | Arrival Time | Burst Time | |---|---:|---:| | A | 0 | 6 | | B | 1 | 3 | | C | 3 | 2 | \nWhat is the completion order of these processes when scheduled using First-Come, First-Served (FCFS)?

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

Which strategy prevents deadlock by requiring all resources at once?

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

Which statement is true about implementing Threads in Kernel?

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

Which system call repositions the file pointer so that data can be read from or written to a specific location in the file?

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

Which scheduling algorithm could potentially lead to starvation?

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

A computer has $4\,\text{GB}$ RAM of which the operating system occupies $2\,\text{GB}$. The processes are all $1024\,\text{MB}$ and have the same characteristics. How many percent is CPU utilization when these programs are idle waiting for I/O $50\%$ of the time?

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

In C-SCAN scheduling, what happens when arm reaches end?

🔒 Đáp án trong Source VIP

OSG202Đã xuất hiện trong 1 đề thi

Đang tải dữ liệu

Đang tải dữ liệu

Đang tải dữ liệu

Câu hỏi gốc môn OSG202

While processing cylinder 25, new requests appear for cylinders 5, 48, 32, 50, and 12. Using the FCFS (First-Come, First-Served) scheduling algorithm, what is the total number of disk head movements?

What is an absolute path in operating systems?

Which directory structure would be the most efficient in preventing filename conflicts while allowing quick lookups?

In UNIX, how are devices like USB sticks integrated into the file-system hierarchy?

What is the primary objective of Deadlock Avoidance techniques?

Which recovery method can lead to data inconsistency when re-executed in the case of a deadlock?

Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify ________.

Which of the following best describes a "race condition"?

Analyze the significance of the hold-and-wait condition in resource deadlock, explaining its impact on deadlock prevention strategies in an operating system.

Assume jobs A-D arrive in quick succession in the READY queue. Using Shortest Job First scheduling, the average waiting time for each process is ____. Arrival time: 2 3 1 0 Job: A B C D CPU cycle: 7 5 8 6

Which symbol is commonly used to represent the current directory in a path?

Which of the following best describes a process in the "Running" state?

Consider the following processes with their arrival and burst times: | Process | Arrival Time | Burst Time | |---|---:|---:| | A | 0 | 6 | | B | 1 | 3 | | C | 3 | 2 | \nWhat is the completion order of these processes when scheduled using First-Come, First-Served (FCFS)?

Which strategy prevents deadlock by requiring all resources at once?

Which statement is true about implementing Threads in Kernel?

Which system call repositions the file pointer so that data can be read from or written to a specific location in the file?

Which scheduling algorithm could potentially lead to starvation?

A computer has $4\,\text{GB}$ RAM of which the operating system occupies $2\,\text{GB}$. The processes are all $1024\,\text{MB}$ and have the same characteristics. How many percent is CPU utilization when these programs are idle waiting for I/O $50\%$ of the time?

In C-SCAN scheduling, what happens when arm reaches end?