DCA6208 OPERATING SYSTEMS

Description

SESSION	JULY/SEPTEMBER 2025
PROGRAM	MASTER OF COMPUTER APPLICATIONS (MCA)
SEMESTER	6
COURSE CODE & NAME	DCA6208 OPERATING SYSTEM

 

 

 

Set-I

 

 

Q1.a. Consider a system with five processes P1, P2, P3, P4, P5 and the 4 resource types A, B and C ,D. Following is the snapshot at the time t. 

 

Process	Allocation (A B C D)	Max (A B C D)	Available (A B C D)
P1	0 0 1 2	0 0 1 2	1 5 2 0
P2	1 0 0 0	1 7 5 0
P3	1 3 5 4	2 3 5 6
P4	0 6 3 2	0 6 5 2
P5	0 0 1 4	0 6 5 6

 

Answer the following questions using the banker’s algorithm: 

Calculate the Need Matrix?  

Demonstrate that system is safe or not.

Apply algorithm to identify which process will finished last.

1. Explain the Reader Writer problem using suitable pseudocode.

 

Ans 1.

(a) Banker’s Algorithm

Step 1: Data and Need Matrix

Given:

Process	Allocation (A B C D)	Max (A B C D)	Available (A B C D)
P1	0 0 1 2	0 0 1 2	1 5 2 0
P2	1 0 0 0	1 7 5 0
P3	1 3 5 4	2 3 5 6

 

 

Its Half solved only

Buy Complete from our online store

 

https://smuassignment.in/online-store/

 

MUJ Fully solved assignment available for session Jul-Aug 2025.

 

Lowest price guarantee with quality.

Charges INR 198 only per assignment. For more information you can get via mail or Whats app also

Mail id is aapkieducation@gmail.com

 

Our website www.smuassignment.in

After mail, we will reply you instant or maximum

1 hour.

Otherwise you can also contact on our

whatsapp no 8791490301.

 

Q2. a. Why Multilevel paging is required.                         

Consider

Analyze the 2-level paging scheme in operating system, where given a 32-bit logical address space and a page size of 4 KB:

1. Demonstrate how the logical address is divided into appropriate fields used in the 2-level paging. (4)
2. Illustrate the step-by-step translation process from a logical address to a physical address with a suitable example. (4)
3. Justify how this scheme improves memory management compared to single-level paging. (2)
4. Consider a paging system with the page table stored in memory.
5. If a memory reference takes 100 milliseconds, how long does a paged memory reference take?
6. If we add Translation Lookaside Buffer (TLB) s, and 75 percent of all page-table references are found in the TLBs, what is the effective memory reference time? If that finding a page-table entry in the TLBs takes zero time if the entry is there.

 

Ans 2.

(a) Multilevel Paging – 2-Level Scheme on 32-bit Address, 4 KB Page

Why Multilevel Paging?

In a large virtual address space with single-level paging, the page table can be huge and must be kept in (or at least partly in) memory. Many entries may never be used. Multilevel paging breaks the page table into smaller pieces, loading only the required parts, which saves memory and supports sparse

 

 

 

Q3. a. Explain in detail the process creation in UNIX/Linux using the fork() system call.
Also describe the working of the exec() and wait() system calls.

Support your explanation with a neat and labelled diagram showing the relationship among these three system calls.

 

1. We have the following processes with their arrival times and burst times:

 

Process	Arrival Time	Burst Time
P1	0 ms	5 ms
P2	1 ms	3 ms
P3	2 ms	8 ms
P4	3 ms	6 ms

 

Calculate the Average waiting time and average turnaround time using Time Quantum 3 ms and Round Robin Scheduling Algorithm.      7+3\

Ans 3.

(a) Process Creation with fork(), exec() and wait() in UNIX/Linux

In UNIX/Linux, new processes are created using the fork() system call. When a running process (parent) calls fork(), the kernel creates a new child process that is an almost exact copy of the parent. Both processes continue execution from the instruction following the fork() call. The return value distinguishes them: fork() returns 0 to the child and child PID to the parent. The child gets its own PID, separate address space, and copies of the parent’s code, data, and open file descriptors.

Often, the child does not want to keep running the same program; it wants to run a new one. For that, it uses an exec() family function (execl, execv, etc.). exec() replaces the child’s current memory image with a new program loaded from disk. The PID remains the same, but the code, data, and stack are all

 

SET-II

 

 

Q4. a. Explain the Disck architecture in detail

67. Consider a disk queue with requests for I/O to blocks on cylinders 98, 183, 41, 122, 14, 124, 65, 67. The C-SCAN scheduling algorithm is used. The head is initially at cylinder number 53 moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from 0 to 199. Calculate the total head movement (in number of cylinders) incurred while servicing these requests using following algorithms;
68. C-SCAN
69. SSTF 5+5

Ans 4.

(a) Explain the Disk Architecture

A traditional magnetic disk consists of one or more platters mounted on a common spindle, rotating at a constant speed. Each platter surface is coated with magnetic material and logically divided into tracks, which are concentric circles. Tracks on all surfaces with the same radius form a cylinder. Every track is further divided into small arcs called sectors, which are the minimum addressable units on the disk and usually store 512 bytes or 4 KB of data. To read or write, the disk uses read–write heads, one per surface, mounted on an actuator arm assembly. All heads move

 

Q5. a. Discuss how file allocation methods affect file system performance and disk utilization.

1. Differentiate between sequential, direct, and indexed file access methods. 5+5

Ans 5.

1. How File Allocation Methods Affect Performance and Disk Utilization

The method a file system uses to allocate blocks on disk directly influences access speed, storage efficiency, fragmentation, and overall system responsiveness. Every file allocation technique—contiguous, linked, or indexed—carries a different strategy for mapping logical file blocks to physical disk blocks, and this choice determines both performance and disk utilization patterns. In contiguous allocation, the file occupies a sequence of consecutive blocks. This produces excellent read performance, particularly for large files, because the disk head moves linearly without repeated seeks. However, it tends to suffer from external fragmentation. As files grow or shrink, finding

 

Q6. a. Explain the sequence of actions taken by the operating system from issuing an I/O request to its completion.

Illustrate the steps with a neat diagram.

1. Discuss various file consistency models used in Distributed File Systems.

Explain the difference between strict, session, and loose consistency. 5+5         

Ans 6.

1. OS Actions from I/O Request to Completion

When a process issues an I/O request, the operating system initiates a coordinated sequence of actions involving the device driver, disk controller, interrupt mechanism, and kernel-level data structures. First, the request enters the system-call interface, where parameters such as device ID, operation type, memory buffer address, and block numbers are validated. The OS then queues the request in the device’s I/O queue, applying scheduling algorithms such as FCFS or SCAN to optimize access. The device driver formats the request into device-specific commands and sends them to the disk controller. At this stage, the controller performs seek operations, waits for rotational alignment,