ITM102
Operating Systems
Assignment - I
Assignment Code: 2013ITM102B1 Last Date of Submission: 15th October 2013
Maximum Marks: 100
Attempt all the questions. All the questions are compulsory and carry equal marks.
Section-A
1. Define concurrent Programming with help of example. Differentiate between multitasking and multiprogramming.
2. Describe mutual exclusion primitives. Explain Dekker’s Algorithm of mutual exclusion primitives.
3. What is process management and its use. Describe the different state of the process.
4. Write a note on Peripheral Devices.
Section-B
Case study
In single user dedicated systems, it is generally obvious when a program goes into an infinite loop. But in the multi-user systems running tens of hundreds of processes, it cannot easily be determined that an individual process is not progressing.
Case Questions:
5. a. Can the operating systems determine that a process is in an infinite loop?
b. What reasonable safeguards might be built into an operating system to prevent process in infinite loops from running indefinitely?
ITM102
Operating Systems
Assignment - II
Assignment Code: 2013ITM102B2 Last Date of Submission: 15th November 2013
Maximum Marks: 100
Attempt all the questions. All the questions are compulsory and carry equal marks.
Section-A
1. What are the different Kernel Scheduling Algorithms? Which scheduling Algorithm is used by UNIX Operating System? Describe.
2. Discussed the role and various factions of the multiprocessor in detail.
3. What is disk scheduling? Explain the various goals of disk scheduling.
4. Explain the concepts of Segmentation and Paging of a Virtual memory.
Section-B
Case Study
Explain following in the context of the deadlock:-
Suppose a spooling system is susceptible to deadlock. An operating systems designer, what features might you provide in this operating system to help an operator unwind spooling deadlocks without loss of work done so far by any of the deadlocked user processes?
Operating Systems
Assignment - I
Assignment Code: 2013ITM102B1 Last Date of Submission: 15th October 2013
Maximum Marks: 100
Attempt all the questions. All the questions are compulsory and carry equal marks.
Section-A
1. Define concurrent Programming with help of example. Differentiate between multitasking and multiprogramming.
2. Describe mutual exclusion primitives. Explain Dekker’s Algorithm of mutual exclusion primitives.
3. What is process management and its use. Describe the different state of the process.
4. Write a note on Peripheral Devices.
Section-B
Case study
In single user dedicated systems, it is generally obvious when a program goes into an infinite loop. But in the multi-user systems running tens of hundreds of processes, it cannot easily be determined that an individual process is not progressing.
Case Questions:
5. a. Can the operating systems determine that a process is in an infinite loop?
b. What reasonable safeguards might be built into an operating system to prevent process in infinite loops from running indefinitely?
ITM102
Operating Systems
Assignment - II
Assignment Code: 2013ITM102B2 Last Date of Submission: 15th November 2013
Maximum Marks: 100
Attempt all the questions. All the questions are compulsory and carry equal marks.
Section-A
1. What are the different Kernel Scheduling Algorithms? Which scheduling Algorithm is used by UNIX Operating System? Describe.
2. Discussed the role and various factions of the multiprocessor in detail.
3. What is disk scheduling? Explain the various goals of disk scheduling.
4. Explain the concepts of Segmentation and Paging of a Virtual memory.
Section-B
Case Study
Explain following in the context of the deadlock:-
Suppose a spooling system is susceptible to deadlock. An operating systems designer, what features might you provide in this operating system to help an operator unwind spooling deadlocks without loss of work done so far by any of the deadlocked user processes?
No comments:
Post a Comment