Scribd
Upload
14 views3 pages

Set 2A

Operating Systems Question paper chapter 1,2,3

Uploaded by

Anupam H Bhattarai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views3 pages

Set 2A

Operating Systems Question paper chapter 1,2,3

Uploaded by

Anupam H Bhattarai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

SET A

Group A (12*1=12)
Multiple choice questions

1. What is a race condition?


a) A situation where multiple threads or processes read and write shared data and
the final outcome depends on the order of execution.
b) A condition where processes run at the same speed.
c) A situation where processes are executed in a strict order.
d) A condition that occurs due to lack of synchronization among processes.

2. The Process Control Block (PCB) does not contain which of the following
information?
a) Process state
b) Program counter0
c) Stack pointers
d) OS information

3. Which deadlock handling method involves periodically checking the system for
deadlocks and recovering from them?
a) Deadlock prevention
b) Deadlock avoidance
c) Deadlock detection and recovery
d) Mutual exclusion

4. Which component of the Operating System handles system calls?


a) User Interface
b) Device Manager
c) Kernel
d) File System

5. A system call used for creating a new process is:


a) fork()
b) open()
c) read()
d) exec()

6. In a layered operating system, what is the main drawback of having too many layers?
a) Increased system complexity
b) Reduced modularity
c) Higher overhead
d) Difficulty in debugging

7. What is the primary function of an operating system?


a) Compiling code
b) Managing hardware resources
c) Designing web pages
d) Calculating mathematical problems

8. What does the "Hold and Wait" condition for deadlock imply?
a) Processes must request all required resources at once.
b) A process holds at least one resource and is waiting to acquire additional
resources that are being held by other processes.
c) Resources can be forcibly taken from a process.
d) Processes wait indefinitely for resources.

9. Which of the following is a correct statement about threads?


a) Threads have their own separate memory space.
b) Threads of the same process share the same memory space.
c) Threads can exist independently without a process.
d) Threads do not share any resources.

10. What is a key characteristic of a microkernel operating system structure?


a) It contains all operating system services within the kernel.
b) It provides minimal services within the kernel, moving most services to user space.
c) It uses a hybrid approach combining monolithic and layered architectures.
d) It relies heavily on hardware for implementing system functions.

11. Which method is used in deadlock avoidance?


a) Resource Allocation Graph
b) Semaphores
c) Multiprogramming
d) Critical Section

12. Which of the following is a valid method to handle race conditions?


a) Deadlock Prevention
b) Mutual Exclusion
c) Batch Processing
d) Multiprogramming’

Group B (Attempt any 3 questions) (3*6=18)

1. What are functions of the Operating System? Explain the evolution of Operating
Systems. (2+4)
2. Define Inter Process communication. Explain Sleeping Barber Problem.
3. Define Deadlock. What are the conditions that could result in Deadlock in the system.
Explain with necessary examples and diagrams. (2+4)
4. Write short notes on (3*2)
a. Semaphores
b. Multiprogramming and Multi threading
c. Monolithic Operating systems.

Group C (1*20=20)
5. Differentiate Processes and Threads. Explain five state process model. Consider
following process data and compute average waiting time and average turnaround
time for RR(quantum 10) and priority scheduling algorithms. 4+8+8

PID Burst Time Arrival Time Priority

A 16 0 1

B 37 12 2

C 25 7 3

You might also like