Operating System

BTL questions typically follow this format:

• Knowledge level (K)
• Understanding level (U)
• Application level (A)
• Analysis level (AN)
• Synthesis level (S)
• Evaluation level (E)

Topic 1: Definition of Operating System

K-Level: What is an Operating System?

Answer: An Operating System is a system software that
manages computer hardware, software resources, and
provides common services for computer programs. It
acts as an intermediary between computer hardware
and the user.

U-Level: Explain the main objectives of an Operating

System.
Answer: The main objectives are:
- Resource management (processor, memory, files, I/O
devices)
- Process management and scheduling
- Providing user interface
- File management and security
- Error handling and detection

Topic 2: Types of Operating Systems

A-Level: How would you classify Windows 11 based on

different types of operating systems? Justify your
answer.
Answer: Windows 11 can be classified as:
- Multi-user: Supports multiple user accounts
- Multi-tasking: Can run multiple applications
simultaneously
- Multi-programming: Manages multiple programs in
memory
- GUI-based: Uses graphical interface for user
interaction
- Real-time: Supports real-time applications with
deadline constraints

AN-Level: Compare and contrast Batch Operating

System and Time-sharing Operating System.
Answer:
Batch OS:
- Executes jobs in batches without user interaction
- Higher throughput but longer response time
- No direct user interaction during processing
Time-sharing OS:
- Multiple users share computer resources
simultaneously
- Lower throughput but faster response time
- Direct user interaction through terminals

Topic 3: Operating System Structure

S-Level: Design a basic microkernel architecture for an

operating system explaining the placement of its
essential components.
Answer: A microkernel design would include:
Core components in kernel space:
- Basic IPC (Inter-Process Communication)
- Elementary memory management
- Basic scheduler
User space components:
- Device drivers
- File system
- Higher-level memory management
- Security services
Benefits: Enhanced reliability, easier extensibility, and
better security

Topic 4: Operating System Services

E-Level: Evaluate the effectiveness of different CPU

scheduling algorithms in a multi-programming
environment.
Answer: Evaluation criteria:
1. Throughput: Round Robin provides better throughput
for time-shared systems
2. Response Time: SJF (Shortest Job First) minimizes
average waiting time
3. Fairness: Priority scheduling may lead to starvation
4. CPU utilization: FCFS (First Come First Serve) may
lead to convoy effect
Recommendation: Use combination of algorithms -
Round Robin for interactive processes and SJF for
background processes

Topic 5: Operating System Services

K-Level: List the fundamental services provided by an

operating system.
Answer: The fundamental services include:
- Program execution
- I/O operations
- File system manipulation
- Communications between processes
- Error detection
- Resource allocation
- Protection and security
- Accounting and logging

U-Level: Explain how the protection service works in an

operating system.
Answer: Protection service in OS works through:
- User authentication through passwords/biometrics
- Access control mechanisms for files and resources
- Memory protection through memory management unit
(MMU)
- Process isolation to prevent interference
- Permission levels (user mode vs kernel mode)

Topic 6: Concept of Virtualization

A-Level: How would you implement virtual memory in a

system with 4GB physical memory to support 8GB of
total memory requirements?
Answer: Implementation would involve:
- Setting up page tables to map virtual to physical
addresses
- Configuring swap space on hard disk (minimum 4GB)
- Implementing page replacement algorithms (like LRU)
- Setting up memory management unit (MMU)
- Handling page faults and page transfers between RAM
and disk

AN-Level: Analyze the impact of hardware virtualization

on system performance.
Answer: Impact analysis:
- CPU overhead due to hypervisor layer
- Memory overhead for maintaining virtual machine
states
- Improved resource utilization through consolidation
- Possible I/O bottlenecks due to shared resources
- Network performance impact due to virtual switches

S-Level: Design a virtualization solution for a small

business with 5 physical servers to optimize resource
utilization.
Answer:
- Implement Type-1 hypervisor on physical servers
- Create virtual machines based on workload
requirements
- Set up virtual networking with VLAN segregation
- Implement shared storage solution for VM migration
- Configure high availability and backup solutions

E-Level: Evaluate the benefits and drawbacks of using

containers versus traditional virtual machines.
Answer:
Benefits of Containers:
- Lighter weight and faster startup
- Better resource utilization
- Easier application deployment
- Consistent development environment

Drawbacks:
- Less isolation compared to VMs
- OS dependency
- More complex networking
- Security concerns due to shared kernel

Topic 1: Concept of Process

K-Level: What is a process?
Answer: A process is an instance of a program in
execution. It is an active entity that contains the program
code, its current activity (program counter), stack, heap,
and data. Each process has its own address space and
resources allocated by the operating system.

U-Level: Explain the different states in a process life

cycle.
Answer: The main process states are:
- New: Process is being created
- Ready: Process is waiting to be assigned to a
processor
- Running: Instructions are being executed
- Waiting/Blocked: Process is waiting for some event
(I/O completion)
- Terminated: Process has finished execution
Additional states may include Suspended Ready and
Suspended Blocked.

A-Level: How would you implement a process state

transition from Running to Waiting state?
Answer: Implementation steps:
1. Save current process context in PCB
2. Update process state from Running to Waiting
3. Move process to appropriate wait queue
4. Select new process from ready queue
5. Update scheduler data structures
6. Perform context switch to new process

Topic 2: Process Control Block (PCB)

AN-Level: Analyze why PCB is considered the most

important data structure in an operating system.
Answer: PCB is crucial because:
- Stores all process-related information
- Enables process switching and resumption
- Maintains process state and scheduling info
- Tracks resource allocation
- Stores accounting and security information
Impact analysis:
- Without PCB, multiprogramming would be impossible
- Essential for process management and scheduling
- Enables OS to maintain process isolation
- Critical for context switching operations

Topic 3: CPU Scheduling

S-Level: Design a scheduling algorithm that optimizes
both CPU utilization and response time for a mixed
workload of interactive and batch processes.
Answer: Multi-level Feedback Queue Design:
1. Create multiple queues with different priorities
2. Top queue: Round Robin with small quantum (for
interactive processes)
3. Middle queue: Round Robin with medium quantum
4. Bottom queue: FCFS (for CPU-bound processes)
Implementation details:
- New processes enter top queue
- Processes not completing in given quantum are
demoted
- Aging mechanism to prevent starvation
- Dynamic quantum adjustment based on workload

E-Level: Evaluate the impact of context switching

overhead on system performance in a heavily
multitasking environment.
Answer: Impact Analysis:
1. Direct Costs:
- Saving/restoring CPU registers
- Switching memory maps
- Flushing CPU caches
- TLB invalidation

2. Indirect Costs:
- Cold cache misses
- Pipeline flushes
- Memory access delays
- Increased memory bus traffic

3. Performance Impact:
- Reduced effective CPU utilization
- Increased response time
- Higher energy consumption
- Decreased throughput

4. Mitigation Strategies:
- Optimize scheduling quantum
- Group related processes
- Minimize unnecessary switches
- Use processor affinity

Topic: Preemptive vs Non-preemptive Scheduling

K-Level: Define preemptive and non-preemptive
scheduling.
Answer:
- Preemptive scheduling: The CPU can be taken away
from a process during execution based on events or
time quantum expiration
- Non-preemptive scheduling: Once CPU is allocated to
a process, it keeps the CPU until it terminates or
switches to waiting state voluntarily

U-Level: Explain the key differences between

preemptive and non-preemptive scheduling.
Answer: Key differences:
1. Resource Control
- Preemptive: OS maintains control over CPU resources
- Non-preemptive: Process maintains control until
completion

2. Context Switching
- Preemptive: Frequent context switches possible
- Non-preemptive: Context switching only at process
termination or I/O

3. Response Time
- Preemptive: Better response time for high-priority tasks
- Non-preemptive: Can lead to poor response time for
urgent tasks

A-Level: Apply appropriate scheduling methods for the

following scenarios:
1. Real-time operating system monitoring nuclear
reactor
2. Batch processing system handling payroll
Answer:
1. Nuclear Reactor System:
- Use Preemptive scheduling because:
* Critical safety monitoring needs immediate attention
* System must respond to emergencies instantly
* High-priority tasks must interrupt lower ones

2. Payroll System:
- Use Non-preemptive scheduling because:
* Tasks are not time-critical
* Batch jobs need to complete in entirety
* Reduced overhead from context switching

AN-Level: Analyze the advantages and disadvantages

of preemptive scheduling.
Answer:
Advantages:
1. Better system responsiveness
2. Fair CPU allocation
3. Good for real-time systems
4. Prevents single process monopolization

Disadvantages:
1. Higher context switching overhead
2. Complex implementation
3. Shared resource synchronization issues
4. Potential race conditions

S-Level: Design a hybrid scheduling system that

combines both preemptive and non-preemptive features
for a multi-user operating system.
Answer:
Design Components:
1. Priority Levels:
- High: Preemptive (interactive processes)
- Medium: Semi-preemptive (regular tasks)
- Low: Non-preemptive (background jobs)

2. Scheduling Rules:
 - Allow preemption for high-priority tasks
- Use time quantum for medium priority
- Let low-priority tasks complete uninterrupted

3. Implementation Features:
- Priority inheritance protocol
- Dynamic priority adjustment
- Resource monitoring system
- Starvation prevention mechanism

E-Level: Evaluate which scheduling method would be

most appropriate for a modern smartphone operating
system.
Answer:
Analysis factors:

1. User Experience Requirements:

- Quick app switching
- Responsive UI
- Background processes
- Battery efficiency

2. Recommendation: Modified Preemptive Scheduling

because:
 - Ensures responsive user interface
- Handles multiple apps effectively
- Can prioritize foreground apps
- Manages battery-intensive processes

3. Implementation Considerations:
- Use priority boosting for foreground apps
- Implement intelligent background process
management
- Include power-aware scheduling decisions
- Maintain balance between responsiveness and
battery life
4. Trade-offs:
- Higher battery consumption vs better responsiveness
- More complex implementation vs better user
experience
- Increased memory usage vs improved multitasking
Topic 1: Scheduling Criteria

K-Level: What are the major criteria considered in CPU

scheduling?
Answer: The major scheduling criteria are:
- CPU Utilization: Keep CPU as busy as possible
- Throughput: Number of processes completed per time
unit
- Turnaround Time: Time from submission to completion
- Waiting Time: Time spent in ready queue
- Response Time: Time from submission to first
response
- Fairness: Fair CPU time allocation among processes

Topic 2: Process Scheduling Algorithms

U-Level: Explain how Round Robin scheduling works

with its advantages and disadvantages.
Answer: Round Robin scheduling:
- Uses time quantum to execute processes
- When quantum expires, process moves to queue end
- Preemptive in nature
Advantages:
- Fair CPU distribution
- Good for time-sharing systems
- Better response time
Disadvantages:
- Higher context switching overhead
- Performance depends on quantum size
- Average turnaround time can be high
A-Level: Given processes P1(0,5), P2(1,3), P3(2,8),
P4(3,2) [arrival time, burst time], calculate average
waiting time using SJF algorithm.
Answer:
1. Order by arrival and burst time
2. Execution sequence: P1(0-5), P4(5-7), P2(7-10),
P3(10-18)
3. Waiting times:
- P1: 0
- P2: 6
- P3: 8
- P4: 2
4. Average waiting time = (0+6+8+2)/4 = 4 units

Topic 3: Advanced Scheduling Algorithms

AN-Level: Analyze why Multilevel Queue scheduling

might be more efficient than single-queue algorithms.
Answer: Multilevel Queue benefits:
1. Process Classification:
- Separates processes by priority/type
- Different algorithms for different queues
- Better handling of varied process needs
2. Resource Optimization:
- Foreground/background process separation
- Appropriate scheduling per queue
- Better response for interactive processes

3. System Performance:
- Reduced scheduling overhead
- Better process management
- Improved system responsiveness

Topic 4: Threads

S-Level: Design a multithreaded server application

handling multiple client requests simultaneously.
Answer: Design components:
1. Thread Pool Architecture:
- Main thread for accepting connections
- Worker thread pool for request processing
- Thread management system

2. Implementation Features:
- Dynamic thread pool sizing
 - Task queue for pending requests
- Synchronization mechanisms
- Resource sharing controls

3. Thread Types:
- Listener thread
- Worker threads
- Management thread
- Cleanup thread

E-Level: Evaluate the effectiveness of different thread

models (User-level vs Kernel-level) in modern operating
systems.
Answer:
1. User-Level Threads:
Advantages:
- Lower overhead
- User-space scheduling
- Platform independence
Disadvantages:
- Cannot utilize multiple CPUs
- Blocking system calls affect all threads
- Limited system integration
2. Kernel-Level Threads:
Advantages:
- True parallelism
- Better system integration
- Improved scheduling
Disadvantages:
- Higher overhead
- More system resources
- Complex implementation

3. Hybrid Approach Recommendation:

- Use both types based on needs
- User-level for lightweight operations
- Kernel-level for CPU-intensive tasks