IGNOU MCA -mcs-041 solved assignments 2012 -2013

Course Code : MCS-041

Course Title : Operating Systems
Assignment Number : MCA(4)/041/Assign/12
Maximum Marks : 100
Weightage : 25%
Last Dates for Submission : 15th October, 2012 (For July 2012 Session)
15th April, 2013 (For January 2013 Session)
This assignment has four questions. Answer all questions. Each question is of 20 marks. Rest 20 marks are for viva voce. You may use illustrations and diagrams to enhance the explanations. Please go through the guidelines regarding assignments given in the Programme Guide.
Question 1:
Consider the following jobs:
Job #   Arrival time  Run time
A            0                 4
B            2                 5
C            3                 2
D            5                 4
a) Using the SJF method, compute the completion times of the above jobs, average turn around time and average waiting time.
b) Using the SRTF (Shortest Remaining Time first) method, compute the completion times of the above jobs, the average turn around time and the average waiting time. Note that SRTF is SJF with preemption. (Hint: Completion time - arrival time = turnaround time).
c) Using the Round Robin method (with Quantum = 2), compute the completion times of the above jobs and the average waiting time. (15 Marks)
Question 2:
a. Explain the Banker’s problem. Consider the following snapshot of a system:
Allocation
A
B
C
D
P0
0
0
1
2
P1
1
0
0
0
P2
1
3
5
4
P3
0
6
3
2
P4
0
0
1
4
Max
A
B
C
D
0
0
1
2
1
7
5
0
2
3
5
6
0
6
5
2
0
6
5
6
Available
A
B
C
D
1
5
2
0
4
Answer the following questions using Banker's algorithm:
i. What is the content of the matrix need?
ii. Is the system in a safe state?
iii. If a request from P1 arrives for (0, 4, 2, 0), can the request be granted
immediately? (15 Marks)
b. Consider the following page-reference string: 1, 2, 3, 4, 2, 1, 3, 4, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 4
How many page faults would occur for following replacement algorithms assuming one, two, three, four, five, six or seven frames? Remember that all frames are initially empty, so your first unique pages will all cost one fault each.
i. LRU replacement.
ii. FIFO replacement.
iii. Optimal replacement. (10 Marks)
Question 3:
a. The Linux kernel does not allow paging out kernel memory. What effect does this restriction have on kernel design? What are two advantages and two disadvantages of this design decision? (10 Marks)
b. The Windows 2000 VM manager uses a two-stage process to allocate memory. Identify several ways in which this approach is beneficial. (10 Marks)
Question 4:
a. Discuss in detail the Process management, Memory management, I/O management, File management and Security and Protection in WINDOWS 7 Operating System.
(20 Marks)


 IGNOU Coaching for BCA, MCA, MBA in Jaipur  

Python Training in Jaipur
Python Training Institute in Jaipur
python coaching in jaipur

best python coaching in jaipur

IGNOU JAIPUR

Regional Director,
IGNOU Regional Centre,
70/79,
Sector - 7,
Patel Marg,
Mansarovar
Rajasthan - 302020
India
Ph :+91-0141-2785763 / 2785750
Fax :+91-0141-2784043