University of Madras
Chepauk, Chennai- 600 005.
Chepauk, Chennai- 600 005.
Subject Code: PSC3L Semester: III Year: Second Year Time: Three hours Maximum: 75 marks
Month & Year of Examination
November - 2012
November - 2012
PART – (10 * 1 = 10)
Answer any TEN questions.
All questions carry equal marks.
Each answer should not exceed 50 words.
1. What are the services of an OS?
2. What are the statuses of a process?
3. How does a process differ from job?
4. List the process attribute.
5. What is a storage interlearing?
6. What is a deadlock?
7. What is non-contiguous storage allocation?
8. List the disk performance parameter.
9. List down the various operation of files.
10. Give some example of single user and multi user operating system.
PART B – (5 * 5 = 25)
Answer any FIVE questions.
All questions carry equal marks.
Each answer should not exceed 200 words.
11. Explain the factors that usually determine the degree of multiprogramming.
12. Explain PCB.
13. What is a race condition? Explain.
14. Explain producer-consumer problem using semaphores.
15. Explain the concept of paging.
16. Explain directory structure organization.
17. List down the features of UNIX operating system.
PART – (4* 10 = 40)
Answer any FOUR questions.
All questions carry equal marks.
Each answer should not exceed 500 words.
18. For each of the following transitions between process
states, indicate whether the transition is possible. If it is
possible give an example of one thing that would cause it.
(a) Run-Ready
(b) Run-blocked
(c) Run –swapped-blocked
(d) blocked-run
(e) run-terminated.
19. Explain inter process communication in detail.
20. In each of the listed memory management schemes, briefly describe the function performed by the operation system software.
(a) Single absolute partition (with base register)
(b) Multiple variable partition
(c) Buddy system
(d)Simple paging.
21. On a system with 1MB of memory using the bubby system, draw a diagram showing the allocation of memory after each of the following events.
(a) Process A, request 50 K
(b)Process B, request 150 k
(c) Process C, request 60 k
(d) Process D, request 60 k
(e) Process E, request 60.
22. Write short notes on the following (a) File operation (b) File protection
23. Briefly explain the file I/O structure of UNIX operating system.
Answer any TEN questions.
All questions carry equal marks.
Each answer should not exceed 50 words.
1. What are the services of an OS?
2. What are the statuses of a process?
3. How does a process differ from job?
4. List the process attribute.
5. What is a storage interlearing?
6. What is a deadlock?
7. What is non-contiguous storage allocation?
8. List the disk performance parameter.
9. List down the various operation of files.
10. Give some example of single user and multi user operating system.
PART B – (5 * 5 = 25)
Answer any FIVE questions.
All questions carry equal marks.
Each answer should not exceed 200 words.
11. Explain the factors that usually determine the degree of multiprogramming.
12. Explain PCB.
13. What is a race condition? Explain.
14. Explain producer-consumer problem using semaphores.
15. Explain the concept of paging.
16. Explain directory structure organization.
17. List down the features of UNIX operating system.
PART – (4* 10 = 40)
Answer any FOUR questions.
All questions carry equal marks.
Each answer should not exceed 500 words.
18. For each of the following transitions between process
states, indicate whether the transition is possible. If it is
possible give an example of one thing that would cause it.
(a) Run-Ready
(b) Run-blocked
(c) Run –swapped-blocked
(d) blocked-run
(e) run-terminated.
19. Explain inter process communication in detail.
20. In each of the listed memory management schemes, briefly describe the function performed by the operation system software.
(a) Single absolute partition (with base register)
(b) Multiple variable partition
(c) Buddy system
(d)Simple paging.
21. On a system with 1MB of memory using the bubby system, draw a diagram showing the allocation of memory after each of the following events.
(a) Process A, request 50 K
(b)Process B, request 150 k
(c) Process C, request 60 k
(d) Process D, request 60 k
(e) Process E, request 60.
22. Write short notes on the following (a) File operation (b) File protection
23. Briefly explain the file I/O structure of UNIX operating system.
Month & Year of Examination
November - 2011
November - 2011
PART A - (10 * 1 = 10 marks)
Answer ALL questions.
1. Define Operating System.
2. What are the functions of a dispatcher?
3. Give an example of a non-sharable resource.
4. What are the two types of semaphores?
5. What is a logical address?
6. What is seek time?
7. What is the role of a directory structure?
8. Mention any two file types.
9. Which system call creates a new process in UNIX?
10.What is name resolution?
PART B - (5 * 5 = 25 marks)
Answer any FIVE questions.
11. Briefly discuss about the two common models of communication.
12. Discuss the following: (a) Deadlock (b) Starvation
13. Briefly discuss about the types of fragmentation. Also write the solution for solving the problem of external fragmentation.
14. Write short note on thrashing.
15. List out various file attributes.
16. Explain any one of the disk scheduling algorithms with an example.
17. Briefly explain the file I/O structure of Windows NT.
PART C - (4 * 10 = 40 marks)
Answer any FOUR questions.
18. Describe about PCB showing CPU switch from process to process.
19. Explain Bankers algorithm for deadlock avoidance.
20. Explain the procedure in handling a page fault.
21. Explain the tree-structured directory structure in detail.
22. Briefly discuss about encryption.
23. Draw the UNIX process control diagram and discuss.
Answer ALL questions.
1. Define Operating System.
2. What are the functions of a dispatcher?
3. Give an example of a non-sharable resource.
4. What are the two types of semaphores?
5. What is a logical address?
6. What is seek time?
7. What is the role of a directory structure?
8. Mention any two file types.
9. Which system call creates a new process in UNIX?
10.What is name resolution?
PART B - (5 * 5 = 25 marks)
Answer any FIVE questions.
11. Briefly discuss about the two common models of communication.
12. Discuss the following: (a) Deadlock (b) Starvation
13. Briefly discuss about the types of fragmentation. Also write the solution for solving the problem of external fragmentation.
14. Write short note on thrashing.
15. List out various file attributes.
16. Explain any one of the disk scheduling algorithms with an example.
17. Briefly explain the file I/O structure of Windows NT.
PART C - (4 * 10 = 40 marks)
Answer any FOUR questions.
18. Describe about PCB showing CPU switch from process to process.
19. Explain Bankers algorithm for deadlock avoidance.
20. Explain the procedure in handling a page fault.
21. Explain the tree-structured directory structure in detail.
22. Briefly discuss about encryption.
23. Draw the UNIX process control diagram and discuss.