Section 1: Circle the correct answer? 1. ____ operating systems are designed pri
ID: 3633006 • Letter: S
Question
Section 1: Circle the correct answer?1. ____ operating systems are designed primarily to maximize resource utilization.
A) PC
B) Handheld computer
C) Mainframe
D) Network
2. A ____ can be used to prevent a user program from never returning control to the operating system.
A) Portal
B) program counter
C) Firewall
D) Timer
3. Which of the following would lead you to believe that a given system is an SMP type system?
A) Each processor is assigned a specific task.
B) There is a master-slave relationship between the processors.
C) Each processor performs all tasks within the operating system.
D) None of the above
4. Which of the following is a property of peer-to-peer systems?
A) Clients and servers are not distinguished from one another.
B) Separate machines act as either the client of the server but not both.
C) They do not offer any advantages over traditional client-server systems.
D) They suffer from the server acting as the bottleneck in performance.
5. Two important design issues for cache memory are ____.
A) speed and volatility
B) size and replacement policy
C) power consumption and reusability
D) size and access privileges
6. A process control block ____.
A) includes information on the process's state
B) stores the address of the next instruction to be processed by a different process
C) determines which process is to be executed next
D) is an example of a process queue
7. When a child process is created, which of the following is a possibility in terms of the execution or address space of the child process?
A) The child process runs concurrently with the parent.
B) The child process has a new program loaded into it.
C) The child is a duplicate of the parent.
D) All of the above
8. In a(n) ____ temporary queue, the sender must always block until the recipient receives the message.
A) zero capacity
B) variable capacity
C) bounded capacity
D) unbounded capacity
9. An instruction that executes atomically ____.
A) must consist of only one machine instruction
B) executes as a single, uninterruptible unit
C) cannot be used to solve the critical section problem
D) All of the above
10. Cancellation points are associated with ____ cancellation.
A) Asynchronous
B) Deferred
C) Synchronous
D) non-deferred
11. Which of the following is true of multilevel queue scheduling?
A) Processes can move between queues.
B) Each queue has its own scheduling algorithm.
C) A queue cannot have absolute priority over lower-priority queues.
D) It is the most general CPU-scheduling algorithm.
12. The ____ scheduling algorithm is designed especially for time-sharing systems.
A) SJF
B) FCFS
C) RR
D) Multilevel queue
13. The ____ multithreading model multiplexes many user-level threads to a smaller or equal number of kernel threads.
A) many-to-one model
B) one-to-one model
C) many-to-many model
D) many-to-some model
14. A schedule in which each transaction is executed atomically is called a(n) ____.
A) exclusive schedule
B) conflicting operation
C) nonserial schedule
D) serial schedule
15. Which of the following scheduling algorithms must be nonpreemptive?
A) SJF
B) RR
C) FCFS
D) priority algorithms
16. ____ is the number of processes that are completed per time unit.
A) CPU utilization
B) Response time
C) Turnaround time
D) Throughput
17. ____ scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU bursts.
A) Multilevel queue
B) RR
C) FCFS
D) SJF
18. Which of the following is true of cooperative scheduling?
A) It requires a timer.
B) A process keeps the CPU until it releases the CPU either by terminating or by switching to the waiting state.
C) It incurs a cost associated with access to shared data.
D) A process switches from the running state to the ready state when an interrupt occurs.
19. In multithreaded programs, the kernel informs an application about certain events using a procedure known as a(n) ____.
A) Signal
B) Upcall
C) event handler
D) Pool
20. LWP is ____.
A) short for lightweight processor
B) placed between system and kernel threads
C) placed between user and kernel threads
D) common in systems implementing one-to-one multithreading models
21. A race condition ____.
A) results when several threads try to access the same data concurrently
B) results when several threads try to access and modify the same data concurrently
C) will result only if the outcome of execution does not depend on the order in which instructions are executed
D) None of the above
22. Flash memory is slower than DRAM but needs no power to retain its contents.
A) True
B) False
23. The difference between a program and a process is that a program is an active entity while a process is a passive entity.
A) True
B) False
24. A system call is triggered by hardware.
A) True
B) False
25. Virtually all contemporary operating systems support kernel threads.
A) True
B) False
26. Race conditions are prevented by requiring that critical regions be protected by locks.
A) True
B) False
27. The value of a counting semaphore can range only between 0 and 1.
A) True
B) False
28. A deadlock-free solution eliminates the possibility of starvation.
A) True
B) False
29. In preemptive scheduling, the sections of code affected by interrupts must be guarded from simultaneous use.
A) True
B) False
30. In RR scheduling, the time quantum should be small with respect to the context-switch time.
A) True
B) False
Explanation / Answer
1.
In Mainframe operating system various programs/tasks can run at the same time. Thus,
its main objective is to maximize resource utilization.
Thus, (C) is correct.
2.
The main purpose of timer is to interrupt the CPU after the specified time. Thus, it prevents
a program from never returning control to operating system.
Thus, (D) is correct.
3.
SMP (Symmetric multiprocessing) is a technique in which various programs processed by multiple processors that share common memory and operating system. Since all the processes share the common operating system. Thus, each processor performs all tasks within the operating system.
Thus, (C) is correct.
4.
Peer-to-Peer networks are the systems in which different systems are connected to each other via the internet and each system on this network becomes the client and the server. Thus, clients and servers are not distinguished from one another.
Thus, (A) is correct.
5.
Cache memory is present in small amount in the system.
Replacement policy in cache memory is not there.
Thus, (B) is correct.
6.
PCB (Process Control Block) is a block which stores all the information about the process.
For example: Process state, process_id etc.
Thus, (A) is correct.
7.
When the child process is created, following acts will occur.
· It runs parallelly with parent process.
· Child process has a new program loaded into it.
· The child process is duplicate of parent process.
Thus, (D) is correct.
8.
The sender must always block until the receiver receives the message in a zero capacity temporary queue.
Thus, (A) is correct.
9.
An instruction that executes automatically will always executes as a single and uninterruptible unit.
Thus, (B) is correct.
10.
Cancellation points are associated with Deferred cancellation.
Thus, (B) is correct.
11.
Multilevel queue scheduling is a process scheduling technique in which each queue has its own scheduling algorithm.
Thus, (B) is correct.
12.
Round Robin is designed for time sharing systems.
Thus, (C) is correct.
13.
Many to many multithreading model multiplexes many user level threads to smaller or equal number of kernel threads. This model provides the best accuracy on concurrency.
Thus, (C) is correct.
14.
Serial Schedules are the schedules in which each transaction is executed automatically.
Thus, (D) is correct.
15.
FCFS (First Come First Serve) is a nonpreemptive algorithm in which a process enters in the running state, it cannot be preempted until it completes its allotted time.
Thus, (C) is correct.
16.
Throughput is the number of process completed per unit time.
Thus, (D) is correct.
17.
Shortest Job First scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU bursts.
Thus, (D) is correct.
18.
Cooperative scheduling is a process in which a process keeps the CPU until it releases the CPU either by terminating or by switching to the waiting state.
Thus, (B) is correct.
19.
In multithreaded programs, the kernel informs an application about certain events using a procedure known as Upcall.
Thus, (B) is correct.
20.
LWP is a Light Weight Process. Generally, threads and light weight processes are same. Thread is used at user level while LWP is used at kernel level.
Thus, (C) is correct.
21.
A race condition occurs when several threads try to access and modify the same data concurrently.
Thus, (B) is correct.
22.
Flash memory is a non-volatile memory that erase the data in units. It retains the data for an extended period of time. Thus, the given statement is false.
Thus, (B) is correct.
23.
· Program is just a code which may contains single line or billions of lines.
· Process is a program under execution.
Thus, process is an active entity and program is a passive entity.
Thus, (B) is correct.
24.
The system call is triggered by executing code. Thus, the given statement is false.
Thus, (B) is correct.
25.
Operating system supports kernel level threads. Thus, the given statement is true.
Thus, (A) is correct.
26.
Race condition is a condition which occurs when multiple threads try to access and modify the same data concurrently.
Race condition can be prevented by requiring that critical regions be protected by locks.
Thus, the given statement is true.
Thus, (A) is correct.
27.
The value of counting semaphore can be range over an unrestricted domain not only 0 and 1.
Thus, the given statement is false.
Thus, (B) is correct.
28.
The starvation occurs when the operating system refuses to give resources to the particular thread.
The deadlock occurs when two or more threads block each other.
A deadlock-free solution does not eliminates the possibility of starvation.
Thus, (B) is correct.
29.
In preemptive scheduling, the sections of code affected by interrupts must be guarded from simultaneous use.
Thus, (A) is correct.
30.
The number of context switch must not be too many to slow down the execution. Thus, time quantum in Round Robin must be large with respect to context switch time.
Thus, the given statement is false.
Thus, (B) is correct.
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.