Sri Balaji College of Engineering and Technology, Jaipur

Department of Computer Science and Engineering

B. Tech. III Year (V Sem.)
Assignment
Subject: -Operating System (5CS4-03)
1. Name different types of operating systems.
Ans. Types of operating systems include Windows, macOS, Linux (Unix-like), Android (mobile), and iOS
(mobile).

2. What do you mean by operating system?

Ans. An operating system is software that manages computer hardware and provides services for
running applications, handling resources, and user interactions.

3. What is Kernel?
Ans. The kernel is the core component of an operating system that manages hardware resources,
scheduling processes, and low-level system functions.

4. What is the difference between process and thread?

Ans. A process is a standalone program with its own memory and resources, while a thread is a smaller
unit of a process, sharing its memory and resources.

5. What is page fault?

Ans. . A page fault occurs when a program requests data that is not in physical memory, triggering the
OS to bring the needed data from secondary storage.

6. Which one is the best page replacement algorithm?

Ans. The best page replacement algorithm depends on the specific system requirements and workload;
options include FIFO, LRU, and Optimal.

7. Why there is need of Paging?

Ans. Paging is needed to efficiently manage memory by breaking it into fixed-size pages, allowing for
better memory allocation and utilization.

8. What do you understand by compaction method in memory management?

Ans. Compaction in memory management involves rearranging memory to reduce fragmentation,
ensuring efficient allocation of memory blocks..

9. How do we avoid race conditions and what are lock variables?

Ans. Race conditions are avoided by using synchronization mechanisms like locks, semaphores, and
mutexes. Lock variables are used to coordinate access to shared resources.

10. What is Critical Region? How do they relate to controlling access to shared resources?
Ans. A critical region is a code section where shared resources are accessed. They relate to controlling
access by using synchronization techniques to prevent conflicts.

11. Define Peterson Method with example.

Ans. Peterson's algorithm is a classic solution for mutual exclusion in concurrent programs. It ensures
only one process enters a critical section at a time, preventing race conditions.
12. Explain first fit, best fit, next fit and worst fit in memory management.
Ans. Memory allocation methods: - First Fit: Allocates the first available block that fits the requested
size. - Best Fit: Allocates the smallest available block that can accommodate the request. - Next Fit:
Similar to First Fit but continues from the last allocation. - Worst Fit: Allocates the largest available
block, potentially minimizing fragmentation but often less efficient.

13. Write a short note on paging.

Ans. Paging is a memory management scheme that divides physical memory and processes into fixed-
size blocks called pages. It offers efficient memory allocation, simplifies memory management, and
enables non-contiguous memory allocation. Paging eliminates external fragmentation but may still lead
to internal fragmentation.

14. Write a short note on segmentation.

Ans. Segmentation divides memory into logical segments of variable sizes, each representing a
different type of data or code. It provides flexibility in memory allocation but can result in
fragmentation. Segmentation is often used in combination with paging in modern operating systems.

15. What do you mean by Semaphores? Explain the types of Semaphores with example.
Ans. Semaphores are synchronization tools used in concurrent programming to control access to
shared resources. Two types are Binary Semaphores (0 or 1, used for mutex) and Counting Semaphores
(allow multiple resource access). For example, a binary semaphore can protect access to a critical
section, ensuring only one thread enters at a time.

16. What is the purpose of a TLB? Explain the TLB lookup with the help of a block diagram, explaining the
hardware required.
Ans. The Translation Lookaside Buffer (TLB) is a hardware cache that stores frequently used virtual-
tophysical memory address translations. It speeds up memory access by reducing the need to access
the page table. TLB lookup involves comparing the virtual page number from the CPU's memory
request with entries in the TLB, returning the corresponding physical page if found.

17. What is meant by virtual memory? With the help of a block diagram explain the data structures used.
Ans. Virtual memory is a memory management technique that uses a combination of RAM and disk
space to provide the illusion of a larger memory space than physically available. Data structures like
page tables are used to map virtual addresses to physical addresses, allowing efficient memory
management.

18. What do you understand by paging? Why there is need of multilevel paging?
Ans. Paging divides memory into fixed-size pages for efficient allocation. Multilevel paging adds an
additional level of page tables to reduce the memory overhead associated with large address spaces,
making memory management more efficient.

19. What is Batch Operating System?

Ans. A Batch Operating System is one where a set of tasks or jobs are executed without user
interaction. Jobs are queued and processed sequentially, ideal for processing large-scale, non-
interactive tasks.

20. What do you mean by preemption?

Ans. Preemption is the ability of an operating system to interrupt a currently executing process or
thread to allow another higher-priority process to run. It ensures fairness and responsiveness in
multitasking environments

21. What is Segmentation Fault?

 Ans. A Segmentation Fault (often referred to as a "segfault") occurs when a program attempts to
access a memory location it is not allowed to, typically due to accessing an invalid or protected memory
area, leading to program termination.

22. What do you understand by degree of Multiprogramming?

Ans. The Degree of Multiprogramming refers to the number of processes or threads that can be
simultaneously loaded and executed in a computer system. It reflects the system's ability to manage
multiple tasks concurrently.

23. What do you mean by Interrupt?

Ans. An Interrupt is a signal that prompts the operating system to suspend its current activities and
handle a specific event or request. Interrupts can be generated by hardware devices or software.

24. What do you mean by Thread?

Ans. A Thread is the smallest unit of execution within a process. Threads share the same memory space
as the parent process, allowing for concurrent execution and efficient resource sharing.

25. What do you understand by context switching?

Ans. Context switching is the process of saving and restoring the state of a CPU, including registers and
program counters, to switch between different processes or threads. It allows for multitasking and
efficient resource allocation in a multi-user system.

26. What is the working of process swapping scheduler?

Ans. Process swapping scheduler is a part of the operating system's CPU scheduling mechanism. When
a process needs to be suspended and moved out of CPU execution, the scheduler saves its state to
memory (such as RAM or disk), updates the process control block (PCB), and selects a new process to
run. Later, when the suspended process is scheduled to run again, it's loaded from storage into
memory, and its state is restored. This swapping allows for efficient multitasking and ensures that
processes continue their execution seamlessly.

27. Explain the Following CPU scheduling.

a) Priority scheduling (b) SJF.
Ans. (a) Priority Scheduling assigns priority levels to processes, and the CPU executes the highest
priority process first. It's essential for time-sensitive tasks but can lead to lower-priority processes
waiting indefinitely
(b) SJF (Shortest Job First) scheduling selects the process with the shortest execution time next. It
minimizes waiting time for smaller jobs but may lead to starvation for longer jobs.

28. Explain the Following CPU scheduling.

b) Round-Robin (b) FCFS
Ans. . (a) Round-Robin scheduling allocates a fixed time quantum to each process in a circular fashion.
It ensures fairness but can lead to poor response times for short jobs.
(b) FCFS (First-Come-First-Served) scheduling executes processes in the order they arrive. It's simple but
can result in long waiting times for later-arriving, longer processes.

29. Draw Process State Transition Diagram and explain each state in detail.
Ans. A Process State Transition Diagram typically includes states like: - New: The process is being
created. - Ready: The process is ready to execute but waiting for CPU time. - Running: The process is
currently executing on the CPU. - Blocked/Waiting: The process is waiting for an event or resource. -
Terminated: The process has completed execution. These states represent the life cycle of a process,
and transitions occur as the process moves through different phases of execution.
30. What is a page and what is a frame? How are the two related?
Ans. A page is a fixed-size unit of virtual memory, while a frame is a corresponding fixed-size unit in
physical memory (RAM). The two are related through a page table, which maps virtual pages to
physical frames. When a process accesses a page, the page table resolves its physical location, allowing
data to be read from or written to the associated frame. This mapping enables efficient memory
management, as pages can be dynamically loaded from secondary storage into available frames as
needed.

31. Write a short note on Dinning Philosopher Problem

Ans. The Dining Philosophers Problem is a classic synchronization and concurrency problem. It involves
a group of philosophers sitting around a dining table with forks. Philosophers alternate between
thinking and eating but need two forks to eat. The challenge is to design a solution that prevents
deadlocks and ensures fair access to forks, ensuring that no philosopher starves.

32. Write a short note on Mutual Exclusion.

Ans. . Mutual Exclusion is a fundamental concept in concurrent programming, ensuring that only one
process or thread accesses a shared resource or critical section at a time. Various synchronization
mechanisms, like semaphores and mutexes, are used to implement mutual exclusion, preventing race
conditions and ensuring data consistency in multi-threaded or multi-process environments

33. Explain all terms used in PCB. Write a short note on PCB
Ans. . A Process Control Block (PCB) is a data structure used by the operating system to manage and
store information about each process. Key terms in a PCB include: - Process ID - Program Counter - CPU
registers - Process state - Priority - Memory management information - I/O information - CPU
scheduling information - Pointer to the next PCB PCBs play a crucial role in process management and
scheduling within an operating system.

34. Consider the following five jobs assumed to be arrived at same time
JOB BURST TIME (in min.) PRIORITY
A 14 5
B 8 1
C 2 6
D 6 9
E 10 4
Here lower integer value corresponding to higher priority. Calculate the average turn-around time and
average waiting time for following scheduling algorithms.
a) Round-Robin (Time Quantum=1min), b) FCFS, c) SJF, d) Priority scheduling.
Ans. .To calculate the average turnaround time and average waiting time for the given jobs using
different scheduling algorithms, we'll apply each algorithm step by step.

Given jobs:
- A with burst time 14 and priority 5
- B with burst time 8 and priority 1
- C with burst time 2 and priority 6
- D with burst time 6 and priority 9
- E with burst time 10 and priority 4

a) Round-Robin (Time Quantum = 1 min):

We'll use a time quantum of 1 minute for Round-Robin scheduling.
 1. The initial order of execution: A, B, C, D, E
| Job | Remaining Burst Time |
|A| 13 |
|B| 7|
|C| 1|
|D| 5|
|E| 9|

2. Continue executing in a round-robin fashion:

- A, B, C, D, E, A, B, D, E, A, D, E, D, E

3. Calculate turnaround time and waiting time:

- Turnaround time (A) = Completion time (A) - Arrival time (A) = 14 - 0 = 14
- Turnaround time (B) = 32 - 0 = 32
- Turnaround time (C) = 15 - 0 = 15
- Turnaround time (D) = 43 - 0 = 43
- Turnaround time (E) = 33 - 0 = 33

4. Average turnaround time = (14 + 32 + 15 + 43 + 33) / 5 = 137 / 5 = 27.4 minutes

5. Waiting time for each job: - Waiting time (A) = Turnaround time (A) - Burst time (A) = 14 - 14
=0
- Waiting time (B) = 32 - 8 = 24
- Waiting time (C) = 15 - 2 = 13
- Waiting time (D) = 43 - 6 = 37
- Waiting time (E) = 33 - 10 = 23

6. Average waiting time = (0 + 24 + 13 + 37 + 23) / 5 = 97 / 5 = 19.4 minutes

b) FCFS (First-Come-First-Served):

1. FCFS execution order: A, B, C, D, E

2. Calculate turnaround time and waiting time:

- Turnaround time (A) = 14
- Turnaround time (B) = 22
- Turnaround time (C) = 24
- Turnaround time (D) = 30
- Turnaround time (E) = 40

3. Average turnaround time = (14 + 22 + 24 + 30 + 40) / 5 = 130 / 5 = 26 minutes

4. Average waiting time = (0 + 14 + 22 + 24 + 30) / 5 = 90 / 5 = 18 minutes

c) SJF (Shortest Job First):

1. SJF execution order: C, B, D, E, A

2. Calculate turnaround time and waiting time:

- Turnaround time (C) = 2
- Turnaround time (B) = 10
- Turnaround time (D) = 16
- Turnaround time (E) = 26
 - Turnaround time (A) = 40

3. Average turnaround time = (2 + 10 + 16 + 26 + 40) / 5 = 94 / 5 = 18.8 minutes

4. Average waiting time = (0 + 2 + 10 + 16 + 26) / 5 = 54 / 5 = 10.8 minutes

d) Priority Scheduling:
1. Priority execution order: B, E, A, C, D
2. Calculate turnaround time and waiting time:
- Turnaround time (B) = 8
- Turnaround time (E) = 18
- Turnaround time (A) = 32
- Turnaround time (C) = 35
- Turnaround time (D) = 44

3. Average turnaround time = (8 + 18 + 32 + 35 + 44) / 5 = 137 / 5 = 27.4 minutes

4. Average waiting time = (0 + 0 + 24 + 33 + 37) / 5 = 94 / 5 = 18.8 minutes

In summary: -
Round-Robin: Average Turnaround Time = 27.4 minutes, Average Waiting Time = 19.4 minutes
- FCFS: Average Turnaround Time = 26 minutes, Average Waiting Time = 18 minutes
- SJF: Average Turnaround Time = 18.8 minutes, Average Waiting Time = 10.8 minutes
- Priority Scheduling: Average Turnaround Time = 27.4 minutes, Average Waiting Time = 18.8
minutes

35. Explain all terms used in inter-process communication? Using these terms explain
(a) Producer –Consumer Problem (b) Sleeping Barber Problem
Ans. Inter-Process Communication (IPC) is essential for processes to interact and synchronize in multi-
process or multi-threaded environments. Key IPC terms include shared memory, message passing,
semaphores, mutexes, condition variables, and deadlock.
For example, in the Producer-Consumer Problem, shared memory is used as a buffer, protected by
mutexes, and controlled by semaphores to manage access. Producers add items, and consumers
remove them, ensuring proper synchronization.
In the Sleeping Barber Problem, mutexes safeguard access to the barber chair and waiting room, while
semaphores manage customer and chair availability. Customers check chair status and either wait or
leave, and the barber serves one customer at a time. IPC mechanisms like semaphores and mutexes
play critical roles in solving these classic IPC problems.

36. Explain Memory Management Unit in detail.

Ans. The Memory Management Unit (MMU) is a CPU hardware component responsible for memory
management. It translates virtual addresses to physical ones, ensuring proper memory access. It also
enforces memory protection, supports virtual memory, manages CPU cache consistency, enhances
security by isolating processes, and often includes a TLB for faster address translation. In modern
computer systems, the MMU is vital for memory management, security, and performance.