Exam 10: Operating Systems
Exam 1: The Big Picture52 Questions
Exam 2: Binary Values and Number Systems49 Questions
Exam 3: Data Representation51 Questions
Exam 4: Gates and Circuits49 Questions
Exam 5: Computing Components49 Questions
Exam 6: Low-Level Programming Languages and Pseudocode49 Questions
Exam 7: Problem Solving and Algorithms48 Questions
Exam 8: Abstract Data Types and Subprograms49 Questions
Exam 9: Object-Oriented Design and High-Level Programming Languages47 Questions
Exam 10: Operating Systems49 Questions
Exam 11: File Systems and Directories49 Questions
Exam 12: Information Systems45 Questions
Exam 13: Artificial Intelligence47 Questions
Exam 14: Simulation, Graphics, Gaming, and Other Applications50 Questions
Exam 15: Networks48 Questions
Exam 16: The World Wide Web44 Questions
Exam 17: Computer Security49 Questions
Exam 18: Limitations of Computing50 Questions
Exam 19: broad concept of computer security and its importance in modern society.102 Questions
Select questions type
Which of the following describes a CPU scheduling algorithm in which each process is given a small amount of time to use the CPU before being forced to wait until its turn comes around again?
(Multiple Choice)
4.8/5
(43)
A(n) _______________ is a program in execution, which the operating system must manage carefully.
(Short Answer)
4.9/5
(42)
The process life cycle describes the conceptual states through which a process moves as it is managed by the operating system.
(True/False)
4.7/5
(38)
Which of the following describes a memory management technique in which only one application program was loaded into memory?
(Multiple Choice)
4.8/5
(45)
Which of the following is a CPU scheduling algorithm that gives priority to the process with the smallest estimated remaining run time?
(Multiple Choice)
4.7/5
(34)
Which of the following describes the act of storing register values for the currently executing process and loading the register values for the process taking over the CPU?
(Multiple Choice)
4.9/5
(40)
The first-come, first-served (FCFS) CPU scheduling algorithm is a preemptive approach.
(True/False)
4.8/5
(40)
The _______________ register holds the address of the beginning of a partition.
(Short Answer)
4.9/5
(40)
Application software interacts directly with the computer hardware.
(True/False)
4.9/5
(38)
In which state does a process reside if it does not have a needed resource, such as a page from secondary memory?
(Multiple Choice)
4.9/5
(34)
_______________ occurs when pages are moved in and out of secondary memory excessively, degrading system performance.
(Short Answer)
4.8/5
(38)
The operating system has a dedicated CPU and therefore does not compete with other application programs for CPU time.
(True/False)
4.8/5
(29)
An operating system uses nonpreemptive CPU scheduling when a process moves from the waiting state to the ready state.
(True/False)
4.9/5
(38)
Application software is written to solve problems in the real world.
(True/False)
4.8/5
(29)
Which of the following is the technique for keeping multiple programs in main memory at the same time, competing for their chance at the CPU?
(Multiple Choice)
5.0/5
(36)
A context switch occurs each time a process moves to the running state.
(True/False)
4.9/5
(38)
A process in the ready state may be terminated because needed resources are not available.
(True/False)
4.7/5
(40)
If a program is loaded into memory beginning at address 555555, what is the physical address of relative address 333333?
(Multiple Choice)
4.7/5
(31)
Which of the following tracks the progress of a program during execution?
(Multiple Choice)
4.8/5
(36)
Which of the following best describes a partitioning approach that uses the base register to store the beginning address of the current partition?
(Multiple Choice)
4.8/5
(40)
Showing 21 - 40 of 49
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)