B

CSE316 OPERATING SYSTEM

Max Marks: - 30 Academic Task Type: - CA1
Name: - _______________ Roll No: - ___________________
Section: - ______________ Reg ID:- ____________________
Instructions: -

1. Each question carries 1 mark, wrong answer will detect 0.25 marks.
2. Overwriting of answer will not be considered.
3. Choose the correct answer and write in the cell given below.

Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8

Q9 Q10 Q11 Q12 Q13 Q14 Q15 Q16

Q17 Q18 Q19 Q20 Q21 Q22 Q23 Q24

Q25 Q26 Q27 Q28 Q29 Q30

Q1. Which of the following modes in an c) A request made by a program to the

operating system is responsible for directly operating system's kernel
interacting with hardware? d) An interrupt request from hardware

a) User Mode Q4. What is the primary function of the

b) Supervisor Mode Process Control Block (PCB) in an operating
c) Multiprogramming Mode system?
d) Multiprocessing Mode
a) To control the execution of processes
Q2. In a multiprogramming system, the b) To store the state and information of
primary goal is to? a process
a) Increase CPU utilization c) To manage memory allocation for
b) Decrease response time processes
c) Execute multiple tasks simultaneously d) To handle input/output operations for
on multiple processors processes
d) Ensure all tasks are executed in a Q5. Which of the following is not a function of
linear order
an operating system?
Q3. Which of the following best describes a
a) Process management
system call?
b) Network routing
a) A user-defined function for memory c) Memory management
management d) File system management
b) A method for the operating system to
allocate resources
 B

Q6. The transition of a process from Running Q11. What does it mean for a process to be in
state to Ready state occurs when? the "Blocked" state?

a) The process has completed its a) The process is executing on the CPU
execution b) The process is waiting for some event
b) The process is terminated by the user to occur
c) The CPU is preempted by a higher- c) The process has finished execution
priority process d) The process is waiting to be assigned
d) The process enters a waiting state to a processor

Q7. In the context of multiprocessing systems, Q12. Which of the following actions can cause
which of the following statements is true? a process to transition from the "Ready" state
to the "Running" state?
a) All processes must be independent of
each other a) The process terminates
b) Only one process can run at a time b) The process completes I/O operation
c) Multiple processes are executed c) The process is moved to a lower
simultaneously on different priority queue
processors d) The CPU scheduler picks the process
d) Multiprocessing is used to decrease for execution
system security
Q13. The Life Cycle of a process in an
Q8. Which structure in UNIX systems is used operating system includes all the following
to manage processes? states except?

a) System Call Table a) New

b) Process Control Block (PCB) b) Running
c) Interrupt Vector Table c) Terminated
d) Inode Table d) Archived
Q9. What is the role of a system call in the Q14. Consider a Shortest Job First algorithm
operating system? with preemption where processes P1, P2, P3,
P4 and P4 have burst times of 7ms, 5ms, 9ms,
a) To execute applications
2ms and 3ms, respectively, and assuming
b) To allocate memory for processes
arrival time as 1, 2, 0, 4, and 3 respectively.
c) To request a service from the
operating system's kernel Determine the order of execution.
d) To manage file systems
a) P4 -> P2 -> P3 -> P1 -> P5
Q10. The evolution of operating systems has b) P1 -> P3 -> P5 -> P2 -> P4
led to the introduction of multiprogramming. c) P2 -> P3 -> P1 -> P5 -> P4
What is the main advantage of d) P5 -> P4 -> P2 -> P1 -> P3
multiprogramming? Q15. Consider the same process list from Q14.
What is the Waiting Time of Process P1 using
a) Increased user interaction
Shortest Job First with Preemption?
b) Improved CPU utilization
c) Reduced hardware costs a) 11 c) 17
d) Simplified software development b) 10 d) 2
 B

Q21. Which of the following scheduling

algorithms is considered non-preemptive?
Q16. Consider the same process list from Q14.
What is the Throughput of system using a) Round Robin
Shortest Job First with Preemption? b) First Come First Serve
c) Shortest Remaining Time First
a) 2.5
d) Priority Scheduling
b) 6.5
c) 5.6 Q22. Which scheduling algorithm assigns the
d) 5.2 CPU to the process that has the smallest burst
time?
Q17. Consider the same process list from Q14.
What is the ideal time of CPU using Shortest a) FCFS c) SJF
Job First with Preemption? b) LJS d) RR

a) 0 Q23. In Round Robin scheduling, the time slice

b) 1 is known as the?
c) 2
d) 4 a) Burst time c) Time Quantum
b) Arrival time d) Slice Time
Q18. Consider the same process list from Q14.
What is the Response Time of process P4 Q24. What is the Criteria of Round Robin
using Shortest Job First with Preemption? Algorithm?

a) 0 a) Burst Time
b) 1 b) Arrival Time
c) 2 c) Time Quantum
d) 4 d) Time Quantum , Arrival Time

Q19. Consider the same process list from Q14. Q25. Given the following processes and their
What is the Compilation Time of process P2 burst times, what is the average waiting time
using Shortest Job First with Preemption? using Round Robin scheduling. Assuming Time
Quantum 2?
a) 12
b) 8 Process ID Arrival Time Burst Time
c) 26
P1 1 6
d) 0
P2 0 8
Q20. Consider the same process list from Q14.
what is the average waiting time using P3 2 7
Shortest Job First with preemption?
P4 3 3
a) 6.7
b) 6.8
c) 6.0
a) 13.25 c) 15.25
d) 6.6
b) 13.52 d) 15.52
 B

Q26. Consider the same process list from Q25. a) 21

What is the average turnaround time using
Round Robin scheduling. Assuming Time
Quantum 2? Q29. Consider the same process list from Q25.
a) 19.52 What is the TAT of process P1, using Round
b) 19.25 Robin scheduling. Assuming Time Quantum 2?
c) 19.55 a) 17
d) 19.22 b) 16
Q27. Consider the same process list from Q25. c) 15
What is the Response time of process p4, d) 18
using Round Robin scheduling. Assuming Time Q30. Consider the same process list from Q25.
Quantum 2? Determine the order of execution, using
a) 5 Round Robin scheduling. Assuming Time
b) 2 Quantum 2?
c) 1 a) P1 -> P2 -> P3 -> P4
d) 0 b) P4 -> P1 -> P5 -> P3
Q28. Consider the same process list from Q25. c) P4 -> P1 -> P3 -> P2
What is the Completion time of process p2, d) P4 -> P1 -> P2 -> P3
using Round Robin scheduling. Assuming Time
Quantum 2?

a) 21
b) 22
c) 23
d) 24