QUESTION 11 The refers to the number of processes in memory. OA) process count OB) long-term scheduler OC) degree of multiprogramming OD) CPU scheduler QUESTION 12 A process may transition to the Ready state by which of the following actions? OA) Completion of an I/O event OB) Awaiting its turn on the CPU OC) Newly-admitted process OD) All of the above

QUESTION 11 The refers to the number of processes in memory. OA) process count OB) long-term scheduler OC) degree of multiprogramming OD) CPU scheduler QUESTION 12 A process may transition to the Ready state by which of the following actions? OA) Completion of an I/O event OB) Awaiting its turn on the CPU OC) Newly-admitted process OD) All of the above

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

A function of an operating system is to coordinate memory
Describe what an operating system uses Process Control Block for and why? Explain 4 reasons why a process is created in a computer system Explain 3 reasons why a process may be terminated from a computer system Distinguish between short-term scheduling and long-term scheduling of the processor. Suppose 5 processes A, B, C, D and E arrive at the times indicated, and each of them is executed for the amount of time specified in the table below: Process Arrival Time Service Time (Ts) A 0 4 B 2 3 C 5 6 D 8 4 E…
There should be a list and description of the four memory allocation methods taught in Operating Systems. In which two of the four are the most often used?
Task 'A' run on a CPU. The task starts by running for 6 ms. 'A' waits for 4 ms while the operating system runs some instructions to access memory. The CPU is then idle for 1 ms while waiting for the memory read to complete. Finally, the task 'A' runs another 25 ms and completes. What is the CPU performance in ms? [ Give answer as a number only]
8. Switching the CPU to another process requiring to save the state of the old process and loading new process state is called: a) Process Blocking b) Context Switch c) Time Sharing d) None of the above
(True or False) A system can reach a saturation point if the CPU is fully utilized but is allowed to accept additional jobs (True or False) Blocking increases the number of physical I/O requests. (True or False) Buffering helps the CPU match the slower speed of I/O devices. ____ is a measure of how much each unit is contributing to the overall operation. _____ is the systematic updating of the operating system and other system software. “____” is a term used by certain vendors for patches to the operating system and other software. The term ____ is used to describe software that assists in patch installation. A(n) ____ is a piece of programming code that replaces or changes some of the code that makes up the software.
Real-time Scheduling: Select all of the following statements that are true. Rate Monotonic (RM) scheduling works by dividing the total amount of time available up into an equal number of shares, and then each process must request a certain share of the total when it tries to start. A real-time system is schedulable under RM when its overall CPU utilization is less than 1. A real-time system is schedulable under Earliest Deadline First (EDF) when its overall CPU utilization is less than or equal to 1. If a process has period p, it is activated every p units of time. RM scheduling assigns a higher priority to processes with shorter periods. EDF scheduling assigns the highest priority to a process with the smallest remaining time until its deadline.
write true or false for each of the following statements:
Course: Operating Systems Given below is the pseudocode to synchronize processes P1, P2, P3, P4, P5, and P6 byusing three semaphores X, Y and Z that are initialized as follow: X=0, Y=0, Z= –2. TheOperating System can schedule the processes which are ready to execute in any order.List down at least 5 possible orders of execution in which the processes can run.
Several concurrently and the outcome of the execution depends on the particular order in which the access takes place; this is called a/an processes access and manipulate the same data A Shared memory condition B Race condition C Multi- processing D Process synchronization
= Q6: Invalid internal memory size NULL this error occurred when: a)start memory address is other than 0x0000 b)internal memory size not changed to 0x10000 c)internal memory size changed to 0x10000 d)start memory address changed to 0x10000 Q7: To test if the code have error or not we make: a) synthesis project b) build project c) compile project d) recompile project
Memory Management: Select all of the following statements that are true. The memory management unit (MMU) maps virtual to physical addresses. When using a single-partition allocation scheme, the main memory is divided into two partitions. The frame table that is applied in systems that use paging is a per-process data structure. Indirect relative addressing refers to an addressing scheme in which the memory address to be accessed is specified explicitly. Segmentation is a memory management approach in which memory areas (segments) allocated to processes are defined by their starting address (base) and length.