2 Marks Questions

Q1. Define an Operating System.

An Operating System (OS) is a program that acts as an intermediary between the user
and the computer hardware. Its goals are to execute user programs, make solving problems
easier, and use hardware efficiently.

Q2. What are the two modes of operation in OS?

The two modes are:

 User Mode – where applications run with limited access.

 Kernel Mode – where the OS kernel runs with full access to hardware.

Q3. What is a system call?

A system call is a programmatic way by which a program requests a service (like file
handling, process control, device management) from the operating system’s kernel.

Q4. Give two examples of application programs.

Examples: Web browsers, Word processors, Compilers.

5 Marks Questions

Q1. Explain the storage-device hierarchy.

Storage devices are arranged according to speed and cost:

 Registers (fastest, most expensive, volatile)

 Cache memory

 Main memory (RAM – volatile)

 Solid State Disks (non-volatile, faster than HDD)

 Hard Disks (non-volatile, cheaper, slower)

 Optical storage (CD/DVD)

 Magnetic tapes (cheapest, slowest, used for backup)

As we move down, cost/bit decreases but access time increases.

Q2. List and explain four main services provided by an OS.

1. Process Management – Creating, scheduling, and terminating processes.

2. Memory Management – Allocating and deallocating memory.

3. File System Management – Storing, retrieving, and organizing files.

 4. Device Management – Handling I/O devices and communication.
(Others: Security & Access Control, User Interface.)

Q3. What are the differences between monolithic kernel and microkernel OS structures?

 Monolithic Kernel:

o All OS services run in a single block of kernel space.

o Fast but harder to maintain (e.g., UNIX).

 Microkernel:

o Only essential services run in kernel space; others run in user space.

o Easier to maintain and portable, but slower due to communication overhead

(e.g., macOS, QNX).

10 Marks Questions

Q1. Explain the different generations of Operating Systems.

 First Generation (1940s): Vacuum tubes, no OS, manual batch processing.

 Second Generation (1950s–60s): Transistors, early OS with batch processing,

multiprogramming, GMOSIS (first OS).

 Third Generation (1960s–70s): Integrated circuits, multiprogramming, time-sharing,

introduction of minicomputers (DEC PDP-1).

 Fourth Generation (1980s–Present): Personal computers, GUI-based OS, networking,

Microsoft Windows, Linux, Android.

Q2. Explain the different types of Operating Systems.

1. Batch OS: Executes jobs in batches without user interaction. Example: IBM OS/360
(1964).

2. Multiprogramming OS: Multiple jobs kept in memory, CPU switches between them.
Example: UNIX.

3. Multitasking OS: Multiple programs run simultaneously with preemptive scheduling.

Examples: Windows, Linux, macOS.
 4. Real-Time OS: Ensures tasks are executed within deadlines, used in embedded
systems. Example: VxWorks, RTLinux.

5. Distributed OS: Multiple computers connected and act as one system. Example:
Amoeba OS.

Q3. Compare Simple, Layered, Monolithic, and Microkernel structures of OS.

 Simple Structure: Small, no clear modules, limited (MS-DOS).

 Monolithic: One large kernel with all services (UNIX).

 Layered: Divides OS into layers; each uses services of the lower layer (Linux,
Windows).

 Microkernel: Only essential parts in kernel; rest in user space (macOS).

15 Marks Questions

Q1. Compare Batch OS, Multiprogramming OS, and Multitasking OS. Give advantages and
disadvantages.

Feature Batch OS Multiprogramming OS Multitasking OS

Jobs grouped into

Several jobs loaded in memory, Multiple programs
Definition batches, run without
CPU switches among them run at the same time
interaction

Good for repetitive Interactive,

Advantage High CPU utilization
tasks responsive

No interaction, long
Disadvantage Difficult memory management Complex scheduling
waiting

Examples IBM OS/360 UNIX Windows, Linux

Q2. Explain OS functions from the User’s and System’s view.

 User’s View:

o Users want convenience, ease of use, good performance.

o Examples: GUI, file access, multitasking.

  System’s View:

o OS is a resource manager.

o Manages CPU, memory, devices, storage.

o Ensures fairness among users in mainframes, efficiency in personal computers,

optimization in embedded systems.

Thus, OS acts as both a user interface and a resource manager.

2 Marks Ques ons

1. What is a process in an opera ng system?

A process is a program in execu on. It includes the program code, current ac vity
(program counter, registers), stack, data sec on, and heap.

2. Differen ate between I/O-bound and CPU-bound processes.

I/O-bound: Spends more me in I/O, with many short CPU bursts.
CPU-bound: Spends more me in computa on, with few long CPU bursts.

3. List any two states of a process.

(i) Ready – process is wai ng for CPU.
(ii) Wai ng – process is wai ng for an event.

5 Marks Ques ons

1. Explain the process states with a diagram.

A process can be in five states: New, Ready, Running, Wai ng, Terminated.

o New: Process crea on.

o Ready: Wai ng for CPU.

o Running: Instruc ons are executed.

o Wai ng: Wai ng for an event (e.g., I/O).

o Terminated: Execu on finished.

(Diagram should show transi ons among these states.)

2. What is a Process Control Block (PCB)? What are its components?

PCB stores all informa on related to a process:

o Process state

o Program counter

o CPU registers

o CPU scheduling info (priority, queue pointers)

o Memory management info

o Accoun ng info (CPU usage, me limits)

 o I/O status (open files, devices)

3. Differen ate between process and thread.

Process: Independent program in execu on. Needs its own memory space.
Thread: Lightweight unit within a process. Mul ple threads share resources of a single
process.

10 Marks Ques ons

1. Explain different types of schedulers in OS.

o Long-term scheduler: Controls degree of mul programming, selects which processes

enter the ready queue. Invoked less frequently.

o Short-term scheduler: Allocates CPU to processes in the ready queue. Invoked very
frequently (milliseconds).

o (Note: Medium-term scheduler can also be added — suspends/resumes processes.)

2. Explain the concept of process crea on with examples.

A parent process creates child processes, forming a tree. Each process is iden fied by a
process iden fier (PID).
Resource sharing op ons:

o Parent and child share all resources.

o Child shares subset.

o No sharing.
Execu on op ons:

o Parent and child run concurrently.

o Parent waits for child to finish.

(Example: In Linux, fork() system call creates a child process.)

15 Marks Ques ons

1. What is mul threading? Compare mul threading and mul tasking with examples.
Mul threading: Running mul ple threads within a program simultaneously. Increases
performance of applica ons. Example: A browser loading a page, handling input, and
downloading files.
Mul tasking: Running mul ple programs at the same me. Example: Listening to music
while typing.

Comparison:

o Scope: Mul threading → single program; Mul tasking → mul ple programs.

o Switching: Threads managed by program; Programs managed by OS.

 o Purpose: Mul threading → performance of applica on; Mul tasking → system
efficiency.

2. Discuss thread lifecycle with a neat diagram.

States:

o New → created but not started.

o Runnable → ready to run.

o Wai ng → wai ng for another thread/event.

o Timed wai ng → waits for fixed me then moves back to runnable.

o Terminated → task completed.

(Diagram showing transi ons should be drawn.)