B.C.A. (Semester IV) (CGPA) Examination Mar/Apr-2018
OPERATING SYSTEM
Time: 2½ Hours
Max. Marks: 70
Instructions: Q.1 and Q.7 are compulsory. Attempt any two questions from Q. 2 to Q. 4. Solve any one questions from Q.5 and Q.6. Figures to the right indicate full marks.
Q.1

Choose correct alternatives from the following:-
10
There is guarantee that the critical tasks are completed in given amount of time called as
Soft Real time system
Hard Real Time System
Time Sharing System
Real time system
is a logical extension of multiprogramming system.
Time sharing
Parallel
Distributed
Batch system
A program in execution is called
Function
Instruction
Procedure
Process
Which process can be affected by other processes executing in the system?
Co-operating process
Child process
Parent process
init process
FIFO scheduling is
Preemptive scheduling
Non-Preemptive scheduling
Deadlock scheduling
None of these
Virtual memory is implemented using
Demand paging
Swapping
Fragmentation
None of the Above
is a technique of temporarily removing inactive programs from the Memory of computer system.
Scheduler
Spooling
Semaphore
Swapping
The priority scheduling algorithm suffers by
Deadlock
Aging
Starvation
All of these
File type can be represented by
File name
File extension
File identifier
None of the above.
10) The banker's algorithm is used for deadlock
Prevention
Avoidance
Detection
Recovery
Page 2 of 2
SLR-CV-8
Q.1

State True or False:-
04
Main Frame operating system was used for many commercial and scientific applications.
Time quantum is defined in priority scheduling algorithm.
An operating system can be viewed as "resource allocator" to control various I/O devices and user programs.
Run time mapping from virtual to physical address is done by MMU.
Q.2
Write the Answer of the following question. (Any Two)
14
Explain The Different Services provided by Operating System.
Explain process states with state transition diagram.
What is process Scheduling? Explain different types of schedulers.
Q.3
Write the Answer of the following questions:- (Any Two)
14
Define the term deadlock? Explain the necessary conditions of deadlock.
What is meant by synchronization? Explain the Dining Philosophers Problem.
Explain the Co-operating Process and threads in detail.
Q.4
Write the Answer of the following questions:- (Any Two)
14
Explain contiguous allocation method for allocating disk space.
Consider the following Example. Implement the Priority and Round Robin Scheduling.
Process
Burst Time
Priority
P1
21
2
P2
3
1
P3
6
4
P4
2
3
Take Time Slice=5 Sec.)
Draw Gantt chat for above algorithm.
Calculate the Average waiting time.
Calculate the Average turnaround time.
Explain Virtual Memory in detail.
Q.5
Write Answer of the following question:-
14
What is page replacement? Write the working LRU page replacement algorithm.
Define operating system? Explain different types of operating system.
Q.6
Write Answer of the following question:-
14
Discuss the Banker's Algorithm for deadlock-avoidance in detail.
Define paging? Explain Demand Paging in details.
Q.7
Write short notes on the following (Any Two)
14
System Component
Semaphore and Critical Region.
Segmentation.