Sikkim-Manipal University of Health Medical and Technological Sciences (SMUHMTS) 2008 M.C.A Computer S.M.UAssignment s . -university question paper

Session
MC0053 – 01
Marks: 30
OPERATING SYSTEM
[Book-ID: B0067]
Part-A
(Each ques. carries equal marks) 1* five =5 marks
1. Define Operating Systems. Name any 4 various kinds of operating systems
2. Name any 2 command based and 2 Graphical User Interface (GUI) based operating systems
3. Define Process. Name various process states available in Operating systems
4. Define Deadlock. Mention the 4 necessary conditions for Deadlock to occur.
5. Define fragmentation and mention its kinds.
Part-B
1. Write a note on: (3+3) Marks
• Context-switching concept
• Inter Process Communication (IPC)
2. CPU- Scheduling: (4+4) Marks
i) Define the terms: a) CPU utilization b) Throughput
ii) Write Gantt Charts for the subsequent set of process:
If Shortest-Job 1st (SJF) algorithm is used
If First-Come 1st Serve algorithm is used



Process Burst time
P1 7
P2 6
P3 3
P4 5

3. Explain Terms: a) 1st Fit b) Best-Fit c) Worst-fit d) Paging (2*3) marks
4. What is thrashing? explain the causes for thrashing. (5)























MC0053 – 02
Marks: 30
OPERATING SYSTEM

[Book-ID: B0067]
1. What is multilevel queue scheduling algorithm? discuss. (5)
2. Explain Bankers algorithm (5)
3. Page Replacement Algorithms: (3+3)
For the subsequent reference string with 3 page memory frame:
6, 0, 1, 2, 3, 4, 2, 3, 6, 0, 3, 2, 1, 2, 0, 1, 6, 1, 0, three
a. Apply FIFO algorithm
b. Apply LRU algorithm
4. CPU- Scheduling: (3+3) Marks
iii) Define the terms: a) Turnaround time b) Response time c) Waiting time
iv) Write Gantt Charts for the subsequent set of process:
If priority scheduling algorithm is used
Process Burst time Arrival time
P1 7 3
P2 6 1
P3 3 4
P4 5 2






5. What is Virtual Memory? How can you implement it using Demand paging technique? (4) marks
6. Explain the terms: (2+2) marks
Contiguous allocation
Indexed allocation with suitable diagrams

Earning:   Approval pending.