MCA Assignments : CS-13 TMA Operating Systems

MCA CS-13 TMA Operating Systems

Course Code : CS-13
Course Title : Operating Systems
Assignment Number : MCA (6)-13/TMA/04
Maximum Marks : 10
Last Date of Submission : 15th October, 2004

This is a Tutor Marked Assignment. There are five questions in this Assignment. Answer all the questions. Each question carries equal weightage. You may use illustrations and diagrams to enhance explanations. Please go through the guidelines regarding assignments.

Question 1: When virtual memory is implemented in a computing system, there are certain costs associated with the technique, and certain benefits. List the costs and benefits. Is it possible for the costs to exceed the benefits? If it is, what measures can be taken to ensure that this does not happen?

Question 2: Develop algorithms nearer to C-syntax for any two encryption/decryption algorithms given in the book.

Question 3: Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:

Process

Burst Time

Priority

P1

10

3

P2

2

1

P3

4

3

P4

5

4

P5

1

2

The processes are assumed to have arrived in the order P1,P2, P3, P4, P5 all at time 0.
a. Draw four gantt charts illustrating the execution of these processes using FCFS, SJF, a non-preemptive priority (a smaller priority number implies a higher priority), and RR(quantum = 1) scheduling.
b. What is the turn around time of each process for each of the scheduling algorithms in part (a)?
c. What is the waiting time of each process for each of the scheduling algorithms in part (a)?
d. Explain the evaluation of each algorithm.

Question 4: Discuss the similarities and differences between the basic strategies for non-contiguous allocation of disk space.

Question 5: Discuss in detail the features, security and protection mechanism in Linux Operating System.

Home > Tutor Mark Assignments - MCA > MCA Assignments : CS-13 TMA Operating Systems
Comments are closed.