Roll No

PRESIDENCY UNIVERSITY
BENGALURU
SET – B

SCHOOL OF ENGINEERING
END TERM EXAMINATION – MAY/JUNE 2024

Semester : Semester II - 2023 Date : June 18, 2024

Course Code : CSA1006 Time : 09.30am to 12.30pm
Course Name : Operating Systems and Unix Programming Max Marks :100

Program : BCA Weightage : 50%

________________________________________________________________________________________________

Note: 1. Answer ALL 5 FULL Questions.

2. Each Full Question carries 20 Marks
3. Scientific and non-programmable calculator are permitted.
4. Do not write any information on the question paper other than Roll Number.
________________________________________________________________________________________________

1.a. Differentiate the efficiency and performance of any two OS. [Knowledge] (CO1) (04 Marks)

1.b. Explain File operations. [Comprehension] (CO2) (06 Marks)

1.c. Considering a system with 5 processes P0 through P4 and three resources (CO3) (10 Marks)
of type A, B, C. Answer the following queries using Bankers algorithm.
a) Is the system in safe sequence.
b) If request from process p1 arrives for (1 0 2) can the request be
granted immediately. [Application]

Process Allocation Max Available

A B C A B C A B C
P0 0 2 0 14 10 3 6 6 4
P1 4 0 0 6 4 4
P2 6 0 4 13 0 4
P3 4 2 2 4 4 4
P4 0 0 4 8 6 6

or
2.a. Discuss PCB. [Knowledge] (CO1) (04 Marks)

2.b. Outline in detail the process and its process state using a labeled figure. (CO3) (06 Marks)
[Comprehension]
2.c. Outline the UNIX architecture in detail with a neat diagram. [Application] (CO4) (10 Marks)

Page 1 of 3
3.a. Explain the resource allocation graph. [Knowledge] (CO1) (04 Marks)

3.b. Define the Critical section problem. What are the requirements that a (CO3) (06 Marks)
solution to the critical section problem must satisfy? [Comprehension]
3.c. Considering a system with five processes P0 through P4 and three (CO4) (10 Marks)
resources of type A, B, C.
Answer the following queries using Bankers algorithm.
a) Is the system in safe sequence.
b) If request from process p1 arrives for (1 0 2) can the request be
granted immediately [Application]

Process Allocation Max Available

A B C A B C A B C
P0 0 1 0 7 6 3 3 3 2
P1 2 0 0 3 2 2
P2 3 0 2 9 0 2
P3 2 1 1 2 2 2
P4 0 0 2 4 3 3

or
4.a. Differentiate between shared memory and message passing. (CO2) (04 Marks)
[Knowledge]
4.b. Define inter-process communication. Explain the two fundamental (CO3) (06 Marks)
models of IPC. [Comprehension]
4.c. What is Deadlock in OS? State and explain the necessary conditions for a (CO4) (10 Marks)
process to enter into a deadlock state. [Application]

5.a. Differentiate between internal and external fragmentation. [Knowledge] (CO1) (04 Marks)

5.b. What is the purpose of using Page Replacement in OS? List various Page (CO2) (06 Marks)
Replacement Algorithms used for Page Replacement. [Comprehension]
5.c. a) Write a shell program to reverse a number. (CO4) (10 Marks)
b) Write a shell program to count the number of digits of a value.
[Application]
or
6.a. What is Contiguous Memory allocation? [Knowledge] (CO2) (04 Marks)

6.b. Show the address binding done in memory management with the help of (CO3) (06 Marks)
a neat diagram. [Comprehension]
6.c. Discuss in detail the memory management system's basic hardware and (CO4) (10 Marks)
control structure. [Application]

7.a Outline about virtual memory. [Knowledge] (CO1) (04 Marks)

7.b. Define pure demand paging. Explain the purpose of lazy swapper with (CO2) (06 Marks)
the help of a neat diagram. [Comprehension]

Page 2 of 3
7.c Consider the following page reference string 6, 7, 8, 9, 6, 7, 1, 6, 7, 8, 9, 1 (CO4) (10 Marks)
How many page faults and page hits would occur using FIFO and Optimal
page replacement algorithms, assuming three frames that all frames are
initially empty? [Application]

or
8.a a) Define Segmentation. (CO2) (04 Marks)
b) Define
i) segment number
ii) segment offset [Knowledge]
8.b. Define paging. Depict a diagram to show the steps required to handle a (CO3) (06 Marks)
page fault in demand paging. [Comprehension]
8.c Consider the following page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, (CO4) (10 Marks)
2, 1, 2, 0, 1, 7, 0, 1 How many page faults and page hit would occur using
LRU and Optimal page replacement algorithms, assuming three frames
that all frames are initially empty? [Application]

9.a What do you mean by fragmentation? Write the solution for overcoming (CO1) (04 Marks)
the Internal fragmentation. [Knowledge]
9.b Write a note on memory management. [Comprehension] (CO2) (06 Marks)

9.c a) Write a shell program to find the smallest digit of a value. (CO4) (10 Marks)
b) Write a shell program to find the sum of even and odd numbers in an
array. [Application]
or
10.a What are the steps required to handle a page fault in demand paging? (CO2) (04 Marks)
[Knowledge]
10.b Explain File System structure. [Comprehension] (CO3) (06 Marks)

10.c Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, (CO4) (10 Marks)
3, 7, 6, 3, 2, 1, 2, 3, 6 Identify the no. of page faults and page hits would
occur using FIFO and Optimal page replacement algorithms assuming
frames size as three? Calculate the page fault rate and page hit rate for
the same. [Application]

Page 3 of 3