Kingdom of Saudi Arabia
‫بسم هللا الرحمن الرحيم‬
Ministry of Higher Education
Majmaah University
College Of Sciences in Alzulfi
-:‫المستوى‬
-:‫رقم ورمز المادة‬
1436/2/11 -:‫تاريخ اإلمتحان‬
‫الـمـمـلكـة الـعـربـيـة الـسـعـوديـة‬
‫وزارة الـتـعـلـيـم الـعـالـي‬
‫جـامـعـة الـمـجـمـعـة‬
‫كلية العلوم بالزلفي‬
‫نظم التشغيل‬
-:‫الرقم الجامعي‬
-:‫اسم المادة‬
-:‫اسم الطالب‬
Answer the following questions:
Question 1: Complete the following sentences:
1. Low priority processes may never execute if it suffers from a____________ problem that can
be solved by ______________
2. _____________ prevents sets of concurrent processes from completing their tasks.
3. __________is the smallest unit of processing that can be performed in an OS. A single process
may contain multiple of it.
4. __________number of processes that complete their execution per time unit.
5. In Resource Allocation Graph, we ensure that there is no deadlock if _________
Question 2: Select the best answer
1. ________________ is the amount of time process takes from when a request was
submitted until the first response is produced.
a. Turnaround time
b. Response time.
c. Waiting time.
d. Utilization time
2. The amount of time a process has been waiting in the ready queue is known as
______________.
a. Turnaround time
b. Response time.
c. Waiting time.
d. Utilization time
1
Kingdom of Saudi Arabia
‫بسم هللا الرحمن الرحيم‬
Ministry of Higher Education
Majmaah University
College Of Sciences in Alzulfi
-:‫المستوى‬
-:‫رقم ورمز المادة‬
1436/2/11 -:‫تاريخ اإلمتحان‬
‫الـمـمـلكـة الـعـربـيـة الـسـعـوديـة‬
‫وزارة الـتـعـلـيـم الـعـالـي‬
‫جـامـعـة الـمـجـمـعـة‬
‫كلية العلوم بالزلفي‬
‫نظم التشغيل‬
-:‫الرقم الجامعي‬
-:‫اسم المادة‬
-:‫اسم الطالب‬
3. _________allows sub-processes to run concurrently.
a. Multiprocessing.
b. Multicore
c. Multitasking.
d. Multithreading
4. Each user-level thread maps to kernel thread in multithreading models is called________
a. Many-to-One.
b. One-to-One.
c. Many-to-Many.
d. None of above.
5. The scheduling algorithm that cannot be preemptive is _____________
a. FCFS
b. SJF
c. RR
d. All of above.
Question 3: What are the differences between the following pairs
 Concurrency and Parallelism
2
‫بسم هللا الرحمن الرحيم‬
Kingdom of Saudi Arabia
Ministry of Higher Education
Majmaah University
College Of Sciences in Alzulfi
-:‫المستوى‬
-:‫رقم ورمز المادة‬
1436/2/11 -:‫تاريخ اإلمتحان‬
-:‫الرقم الجامعي‬
‫الـمـمـلكـة الـعـربـيـة الـسـعـوديـة‬
‫وزارة الـتـعـلـيـم الـعـالـي‬
‫جـامـعـة الـمـجـمـعـة‬
‫كلية العلوم بالزلفي‬
‫نظم التشغيل‬
-:‫اسم المادة‬
-:‫اسم الطالب‬
 Deadlock prevention and Deadlock avoidance
 Shortest Job First and Shortest Remaining Time
Question 3: Consider the following snapshot of a system
P0
P1
P2
P3
Allocation
ABC
301
221
312
051
Max
ABC
511
321
332
461
Available
ABC
0 30
Using the banker's algorithm to determine if the system will be in safe or unsafe state. If it will
be safe illustrate the sequence of execution.
3