MCA – I (Semester – I),OPERATING SYSTEM CONCEPTS (Old),Solapur University Question Paper,2014 Question Paper

Solapur University Question Paper
MCA – I (Semester – I) Examination, 2014
Commerce
OPERATING SYSTEM CONCEPTS (Old)
Day and Date : Saturday, 10-5-2014 Max. Marks : 70
Time : 11.00 a.m. to 2.00 p.m.
Instructions: 1) Que. No. 1 and 7 are compulsory.
2) Attempt any two questions from Q. 2 to Q. 4.
3) Attempt any one question from Q. 5 and Q. 6.
4) All question carry equal marks.
1. A) Choose the correct alternative : 10
1) The Scheduling in which CPU is allocated to the process with least CPUburst
time is called _________
a) Priority scheduling b) Shortest job first scheduling
c) Round Robin scheduling d) Multilevel scheduling
2) The “tum-around” time of a user job is the __________
a) time since its submission to the time its results become available
b) time duration for which the CPU is allocated to the job
c) total time taken to execute the job
d) time taken for the job to move from assembly phase to completion
phase
3) Which of the following is not a fundamental process state ?
a) ready b) terminated c) executing d) blocked
4) ‘LRU’ Page replacement policy is ___________
a) Last Replaced Unit b) Last Restored Unit
c) Least Recently Used d) Least Required Unit
Seat
No.
SLR-GL – 4 -2-
5) Which amongest the following is not an advantage of distributed system ?
a) Reliability b) Incremental growth
c) Resource sharing d) None of the above
6) Which of the following loader executed when a system is first turned or
restored ?
a) Boot loader b) Compiler and Go loader
c) Boot strap loader d) Relating loader
7) Which scheduling policy is must suitable for a time shared operating system ?
a) Shortest job first b) Elevator
c) Round Robin d) First come first serve
8) A critical section is a program segment
a) Which should run in a certain specified amount of time
b) Which avoids deadlocks
c) Where shared resources are accessed
d) None of above
9) A O.S contains 3 user processes each require 2 units of resourcess R.
The minimum no. of units of R such that no dead locks will ever arise is
__________
a) 4 b) 3 c) 5 d) 6
10) Jobs which are admitted to the system for processing is called __________
a) Long term scheduling b) Short term scheduling
c) Medium term scheduling d) Queuing
B) State whether True or False : 4
1) Banker’s Algorithm is also called as Deadlock Avoidence algorithm.
2) Paging suffers from external fragmentation.
3) LRU Replacement algorithm does not suffer from Belady’s Anomaly.
4) Virtual memory is implemented by demand paging.
2. Answer the following : 14
1) What is system cull ? Explain how it works.
2) Explain paging in detail.
-3- SLR-GL – 4
3. Answer the following : 14
1) What is process ? Explain process state transition diagram in detail.
2) Explain the need for synchronization in detail.
4. Answer the following : 14
1) Explain segmentation in detail.
2) What is operating system ? Explain all the services provided by operating
system.
5. What is scheduling ? Explain scheduling criteria. Explain any two scheduling
algorithm with the help of example.
6. Consider the following snapshot of a system. 14
Allocation MAX Available
ABCD ABCD ABCD
P0 0 01 2 0 01 2 1 5 20
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6
Answer the following questions using Banker’s algorithm.
a) What is content of matrix need ?
b) Is the system in safe state ?
c) If a request from process P1 arrives for (0, 4, 2, 0) can request be granted
immediately ?
7. Write a short note on (any 2) : 14
a) Deadlock Detection and Recovery
b) Semaphore
c) Virtual machine.
———————

Share This