CA1

CSE316: Operating System

Name: _______________ Roll No: __________ Reg No: __________ Section: ____________
General Instructions
1. Turn off and submit all mobile phones to the invigilator before the exam starts.
2. Use blue or black ink for writing answers; pencils are allowed only for diagrams.
3. Maintain silence and do not communicate with other students during the exam.
4. Raise your hand to ask any questions; do not leave your seat without permission.
5. Submit your answer sheets promptly at the end of the exam; late submissions will not be accepted.
6. For MCQ questions, make sure to fill the table below with the correct option letter for the question.
1 2 3 4 5 6 7 8 9 10
11 12 13 14 15 16 17 18 19 20
21 22 23 24 25 26 27 28 29 30

1. Which scheduling algorithm is best suited for 2. Threads do not require saving program
real-time systems? counters.

A. First-Come-First-Served (FCFS) 3. Threads share the same memory space,

B. Shortest Job First (SJF) avoiding the overhead of memory
C. Priority scheduling management.
D. Round Robin
4. Threads operate in user mode, while processes
2. Which of the following statements about context
operate in kernel mode.
switching is correct?
1. It involves saving the PCB of the currently
running process and loading the PCB of the 5. Thread is different from a process
next process.
A. A thread is a lightweight process within a
2. It is triggered only when a process is process.
terminated. B. A thread cannot share resources with other
threads.
3. It is faster in preemptive scheduling compared C. A thread is a heavier process than a
to non-preemptive scheduling. process.
D. A thread has its own address space.
4. It always leads to a deadlock.
6. Role of device drivers in I/O operations is
3. Context switching occurs when
A. to provide an interface between the OS and
A. A process is interrupted to allow another to a hardware device.
run B. A software component that handles
B. A process is terminated interrupts from devices.
C. A process is created C. A hardware component that controls the
D. A process is waiting for I/O operation of a device.
4. Why is thread switching typically faster than D. None of the above
process switching? 7. The strategy of making processes that are
1. Threads share the same PCB. running to be temporarily suspended is called
 A. Shortest job first C. First-Served Scheduling
B. Non Preemptive scheduling D. Round-Robin Scheduling
C. Preemptive scheduling E. None of the above
D. None of the above 14. Aging involves gradually increasing the
8. What is the name of the technique in which the priority of processes that wait in the system for a
operating system of a computer executes several long time.
programs concurrently by switching back and
forth between them? A. True
A Partitioning B. False
15. User-level threads are managed by the kernel.
B Multi-tasking
C Windowing A. True
B. False
D Paging 16. There are three processes, P0, P1, and P2,
9. I. Shortest remaining time first scheduling may with arrival times 0,1,2 and burst times 9,4,9.
cause starvation II. Preemptive scheduling may Apply pre-emptive shortest job first scheduling
cause starvation III. Round robin is better than algorithm and determine the average waiting time.
FCFS in terms of response time Find out the true
from above statements A. 4.33
B. 5
A. I only C. 7.33
B. I and II only D. 6.33
C. II and III only 17. Round Robin (RR) Scheduling
D. All of the above
Consider the following processes with a time
10. Which one is sometimes called shortest- quantum of 3 ms:
remaining-time-first scheduling?
Process Arrival Time Burst Time
A. Multilevel queue scheduling
B. Non Preemptive SJF scheduling P1 0 ms 5 ms
C. Preemptive SJF scheduling
D. None of the above P2 1 ms 8 ms
11. Indefinite blocking or starvation comes in P3 2 ms 7 ms
________________________scheduling
algorithm. P4 3 ms 3 ms
Question:
A. Shortest-Job-First Scheduling
B. Priority Scheduling Calculate the average waiting time (AWT) and
C. First-Come average turnaround time (ATAT) using Round Robin
D. First-Served Scheduling Scheduling.
E. None of the above
18. There are three processes, P0, P1, and P2 and
12. ________________ is the solution to burst times 24, 3, 3. In which order do they need
indefinite blockage of low-priority processes. to be processed in FCFS so that there will be a
minimum average waiting time?
A. Swapping
B. Aging A. P0 P1 P2
C. Paging B. P2 P0 P1
D. None of the above C. P1 P2 P0
13. The ready queue is treated as a circular queue D. None of the above
in _________________________________ 19. There are three processes, P0, P1, and P2,
scheduling algorithm. with arrival times 0,1,3 and burst times 5,7,4. In
which order they will be processed when using
A. Priority Scheduling the round-robin algorithm with time quantum=2?
B. First-Come
 A. P1 P2 P3 B SRTF = 6, NP-SJF = 7.5
B. P1 P3 P2
C. P3 P1 P2 C SRTF = 7, NP-SJF = 7.5
D. None of the above D SRTF = 7, NP-SJF = 8.5
20. There are three processes with arrival times 0,
2, and 6 and burst times 10, 20, and 30. How 25. Which scheduling algorithm is most suitable
many context switches are needed if the SRTF for real-time systems where deadlines must be
scheduling algorithm is used? Do not count the met?
context switches at time zero and the end.
A. First-Come-First-Served
A. 1 B. Shortest Job First
B. 3 C. Round Robin
C. 2 D. Priority Scheduling
D. 4 26. System calls are used to
21. Key feature of a Multilevel Feedback Queue
(MLFQ) scheduling algorithm A. Manage hardware devices
B. Provide an interface between user and
A. Fixed number of queues with fixed kernel
priorities C. Handle interrupts
B. Each process is permanently assigned to D. Implement the operating system's kernel
one queue 27. Which of the following is not a type of system
C. Processes can move between queues based call?
on their behavior
D. All processes execute in a first-come A. Process control
22. How are processes moved to a lower-priority B. File management
queue in a Multilevel Feedback Queue? C. Command line interface
D. Device management
A. After a fixed amount of time 28. A process control block (PCB) contains critical
B. After completing a certain number of I/O information about a process. Which of the following
operations statements is true about the PCB during a context
C. When the system is idle switch?
D. After using a certain amount of CPU time
23. The reason for a process frequently switches 1. The PCB is destroyed and recreated during
between running and waiting states. every context switch.
2. The PCB contains information about open file
A. The process has too many open files
descriptors, memory management, and
B. The process is performing intensive
process state.
calculations
C. The process has frequent I/O requests 3. The PCB is used only for terminated
D. The process is being terminated and processes.
restarted
24. Consider a single processor system with four 4. The PCB contains details only about CPU
processes A, B, C, and D, represented as given below, registers.
where for each process the first value is its arrival
29. Operating systems that do not support more
time, and the second value is its CPU burst time. A than one program at a time
(0, 10), B (2, 6), C (4, 3), and D (6, 7). Which one of
the following options gives the average waiting times A. Linux
when preemptive Shortest Remaining Time First B. DOS
(SRTF) and Non-Preemptive Shortest Job First (NP- C. Windows
SJF) CPU scheduling algorithms are applied to the D. Mac
processes?
A SRTF = 6, NP-SJF = 7
30. The process state transition diagram in the
below figure is representative of

A a batch operating system

B an operating system with a preemptive scheduler
C an operating system with a non-preemptive scheduler
D a uni-programmed operating system