BCA 4th Semester
Operating System Board Question Paper 2020

Views: ...
tribhuvan university logo

Tribhuvan university

Bachelor In Computer Application

Course Title: Operating System

Code No: CACS 251

Semester:IV

2020

Full Marks:60 Pass Marks:24 Time:3 hours

Candidates are required to answer the question in their own words as far as possible.

Group A
Group B
Attempt any SIX question.
[6x5=30]
2.

What is an operating system? Explain the functions of operating system.

3.

Define the term semaphore. How does semaphore help in dining philosopher problem?

4.

A system has two process and three resources. Each process needs a maximum of two resources. Is deadlock possible? Explain with answer.

5.

Suppose a new process in a system arrives at an average of six processes per minute and each such process requires an average of 8 seconds of service time. Estimate the fraction of time the CPU is busy in a system with a single processor.

6.

Given references to the following pages by a program, 0, 9, 0, 1, 8, 1, 8, 7, 8, 7, 1, 2, 8, 2, 7, 8, 2, 3, 8, 3 How many page faults will occur if the program has three page frames for each of the following algorithms?
a) FIFO
b) LRU

7.

What is file? Explain how access control matrix provides resource protection that may access process.

8.

What do you mean by one-time password in authentication? How worms are differing from virus.

Group C

Attempt any TWO questions

[2x10=20]
9.

Write CPU scheduling criteria. For the processes listed in following table, draw Gantt chart illustrating their execution and calculate average waiting time and turnaround time using:
a) First Come First Serve
b) Shortest Remaining Time Next
c) Priority
d) Round Robin (quantum = 1 sec.)

ProcessesArrival TimeBurst Time (sec.)Priority
A0.0073
B2.0171
C3.0124
D3.0222

10.

Define the term seek time and rotational delay in disk scheduling. Suppose that a disk has 100 cylinders, numbered 0 to 99. The drive is currently serving a request at cylinder 43 and previous request was at cylinder 25.
The queue of pending request, in FIFO order is: 86, 70, 13, 74, 48, 9, 22, 50, 30 Starting from the current head position, what is total distance (in cylinders) that the disk arm moves to satisfy all pending request for each of following disk scheduling algorithms?
a) FCFS
b) SSTF
c) SCAN
d) LOOK

11.

What is clock synchronization? Explain how physical clock synchronize by Berkeley algorithm and logical clock synchronize by Lamport's algorithm with suitable example.