University of Madras
Chepauk, Chennai - 600 005.
Operating System
Month & Year of Examination: 2005
Semester: III
Year: Second Year
Time: Three hours
Maximum: 100 marks
PART A- (10 x 3 = 30 marks)
Answer any TEN questions.
All questions carry equal marks.
Each answer should not exceed 50 words.
1.What is compute-server system?
2.Mention any four system components.
3.Draw the diagram of process state.
4.What are the necessary condition for deadlock?
5.What is meant by critical section problem?
6.Define segmentation.
7.Define Page, frames and frame table.
8.Name the different types of page replacement algorithm.
9.What are file attributes?
10.What is meant by Boot control block?
11.What is caching?
12.What are goals of protection?
PART B - (5 x 6 = 30 marks)
Answer any FIVE questions.
All questions carry equal marks.
Each answer should not exceed 200 words.
13. Discuss about the real time system.
14. Explain the scheduling algorithm that mainly used for time sharing system.
15. What are the possibilities to recover system from deadlock?
16. Write short notes on segmentation.
17. What are the ways to access the information in the file? Explain briefly.
18. How does DMA increase system concurrency? Explain.
19. Discuss the security problem.
PART C - (4 x 10 = 40 marks)
Answer any FOUR questions.
All questions carry equal marks.
Each answer should not exceed 500 words.
20. Explain process scheduling in detail.
21. Discuss the multi threading issues in detail.
22. Why we need semaphore tool? Explain in detail with example.
23. Explain in detail about paging.
24. Explain any two page replacement algorithm.
25. Explain the access matrix.
Month & Year of Examination: 2005
Semester: III
Year: Second Year
Time: Three hours
Maximum: 100 marks
PART A- (10 x 3 = 30 marks)
Answer any TEN questions.
All questions carry equal marks.
Each answer should not exceed 50 words.
1.What is compute-server system?
2.Mention any four system components.
3.Draw the diagram of process state.
4.What are the necessary condition for deadlock?
5.What is meant by critical section problem?
6.Define segmentation.
7.Define Page, frames and frame table.
8.Name the different types of page replacement algorithm.
9.What are file attributes?
10.What is meant by Boot control block?
11.What is caching?
12.What are goals of protection?
PART B - (5 x 6 = 30 marks)
Answer any FIVE questions.
All questions carry equal marks.
Each answer should not exceed 200 words.
13. Discuss about the real time system.
14. Explain the scheduling algorithm that mainly used for time sharing system.
15. What are the possibilities to recover system from deadlock?
16. Write short notes on segmentation.
17. What are the ways to access the information in the file? Explain briefly.
18. How does DMA increase system concurrency? Explain.
19. Discuss the security problem.
PART C - (4 x 10 = 40 marks)
Answer any FOUR questions.
All questions carry equal marks.
Each answer should not exceed 500 words.
20. Explain process scheduling in detail.
21. Discuss the multi threading issues in detail.
22. Why we need semaphore tool? Explain in detail with example.
23. Explain in detail about paging.
24. Explain any two page replacement algorithm.
25. Explain the access matrix.
Month & Year of Examination: November - 2011
Subject Code: PK3D
Semester: III
Year: Second Year
Time: Three hours
Maximum: 100 marks
PART A - (10 * 3 = 30 marks)
Answer any TEN questions.
All questions carry equal marks.
1. What is multiprogramming?
2. List the objectives of an operating system.
3. What is interprocess communication?
4. What is critical section?
5. What is the difference between page and segment?
6. What is demand cleaning?
7. What is the difference between preemptive and nonpreemptive scheduling?
8. What is interrupt driven I/O?
9. Define seek time and rotational delay.
10. List the advantages of process migration.
11. List the three methods of record blocking.
12. How do determine whether a user’s identity is authentic?
PART B - (5 * 6 = 30 marks)
Answer any FIVE questions.
All questions carry equal marks.
13. Explain the various operating system services.
14. Briefly explain any five criteria for process scheduling.
15. Discuss about semaphores and monitors.
16. Explain the different address translation mechanism in paging.
17. Explain about disk free space management.
18. Discuss about I/O buffering.
19. Explain Access Matrix with an illustration.
PART C - (4 * 10 = 40 marks)
Answer any FOUR questions.
All questions carry equal marks.
20. Describe the different operating system structures.
21. Discuss about any five scheduling algorithms in a uniprocessor environment.
22. Explain about Deadlock detection and Recovery.
23. Describe the different file allocation methods.
24. Explain any four page replacement schemes in detail.
25. Explain any two disk scheduling policies.
Subject Code: PK3D
Semester: III
Year: Second Year
Time: Three hours
Maximum: 100 marks
PART A - (10 * 3 = 30 marks)
Answer any TEN questions.
All questions carry equal marks.
1. What is multiprogramming?
2. List the objectives of an operating system.
3. What is interprocess communication?
4. What is critical section?
5. What is the difference between page and segment?
6. What is demand cleaning?
7. What is the difference between preemptive and nonpreemptive scheduling?
8. What is interrupt driven I/O?
9. Define seek time and rotational delay.
10. List the advantages of process migration.
11. List the three methods of record blocking.
12. How do determine whether a user’s identity is authentic?
PART B - (5 * 6 = 30 marks)
Answer any FIVE questions.
All questions carry equal marks.
13. Explain the various operating system services.
14. Briefly explain any five criteria for process scheduling.
15. Discuss about semaphores and monitors.
16. Explain the different address translation mechanism in paging.
17. Explain about disk free space management.
18. Discuss about I/O buffering.
19. Explain Access Matrix with an illustration.
PART C - (4 * 10 = 40 marks)
Answer any FOUR questions.
All questions carry equal marks.
20. Describe the different operating system structures.
21. Discuss about any five scheduling algorithms in a uniprocessor environment.
22. Explain about Deadlock detection and Recovery.
23. Describe the different file allocation methods.
24. Explain any four page replacement schemes in detail.
25. Explain any two disk scheduling policies.
Month & Year of Examination: April - 2009
Subject Code: PK3D
Semester: III
Year: Second Year
Time: Three hours
Maximum: 100 marks
PART A - (10 * 3 = 30 marks)
Answer any TEN questions.
All questions carry equal marks.
Each answer should not exceed 50 words.
1. What is I/O burst?
2. Define Semaphore.
3. Define Turn around time.
4. What do you mean by unsafe state?
5. What is deadlock?
6. What is internal fragmentation?
7. Under what circumstances do page faults occur?
8. What is thrashing?
9. Define fragmentation.
10. Define the term virtual memory.
11. What is encryption?
12. What do you mean by memory mapped I/O?
PART B - (5 * 6 = 30 marks)
Answer any FIVE questions.
All questions carry equal marks.
Each answer should not exceed 200 words.
13. Discuss in detail about Real time system.
14. Describe deadlock characteristics.
15. Explain the lifecycle of a process with state transition diagram.
16. Describe the basic concepts of paging in detail.
17. Describe the demand paged memory allocation scheme with an example?
18. Explain the secondary storage structures.
19. What are security threats? Explain.
PART C - (4 * 10 = 40 marks)
Answer any FOUR questions.
All questions carry equal marks.
Each answer should not exceed 50 words.
20. View the operating system as a resource manager.
21. What are the necessary conditions for a deadlock situation to arise?
Discuss the deadlocks in terms of a system resource allocation graphs.
22. Describe single contiguous allocation memory management system.
23. Explain Dynamic memory allocation strategy.
24. Discuss any two page replacement algorithms.
25. Describe the free space management.
Subject Code: PK3D
Semester: III
Year: Second Year
Time: Three hours
Maximum: 100 marks
PART A - (10 * 3 = 30 marks)
Answer any TEN questions.
All questions carry equal marks.
Each answer should not exceed 50 words.
1. What is I/O burst?
2. Define Semaphore.
3. Define Turn around time.
4. What do you mean by unsafe state?
5. What is deadlock?
6. What is internal fragmentation?
7. Under what circumstances do page faults occur?
8. What is thrashing?
9. Define fragmentation.
10. Define the term virtual memory.
11. What is encryption?
12. What do you mean by memory mapped I/O?
PART B - (5 * 6 = 30 marks)
Answer any FIVE questions.
All questions carry equal marks.
Each answer should not exceed 200 words.
13. Discuss in detail about Real time system.
14. Describe deadlock characteristics.
15. Explain the lifecycle of a process with state transition diagram.
16. Describe the basic concepts of paging in detail.
17. Describe the demand paged memory allocation scheme with an example?
18. Explain the secondary storage structures.
19. What are security threats? Explain.
PART C - (4 * 10 = 40 marks)
Answer any FOUR questions.
All questions carry equal marks.
Each answer should not exceed 50 words.
20. View the operating system as a resource manager.
21. What are the necessary conditions for a deadlock situation to arise?
Discuss the deadlocks in terms of a system resource allocation graphs.
22. Describe single contiguous allocation memory management system.
23. Explain Dynamic memory allocation strategy.
24. Discuss any two page replacement algorithms.
25. Describe the free space management.
Month & Year of Examination: November - 2009
Subject Code: PK3D
Semester: III
Year: Second Year
Time: Three hours
Maximum: 100 marks
PART A - (10 * 3 = 30 marks)
Answer any TEN questions.
All questions carry equal marks.
Each answer should not exceed 50 words.
1. State any three services provided by the operating system.
2. Describe any three process states.
3. what is Turnaound time of a job?
4. Explain any two uses of semaphores.
5. Describe any two methods of deadloack recovery.
6. What is dynamic memory partitioning?
7. What is memory fragmentation?
8. What is dynamic linking? Why is it done?
9. Explain any two methods used for page replacement.
10. state any three file access methods.
11. Describe the role of a selector in I/O hardware.
12. What is Spooling?
PART B - (5 * 6 = 30 marks)
Answer any FIVE questions.
All questions carry equal marks.
13. Describe the various goals of an operating system.
14. What is a traffic controller? What is its function in process management?
15. Explain the critical section problem in process synchronisation.
16. Bring out the advantages and disadvantages of contiguous allocation over noncontinuous allocation.
17. What is thrashing? Why and how is it done?
18. What is an access matrix? What are its uses?
19. What are threats? How are threats monitored?
PART C - (4 * 10 = 40 marks)
Answer any FOUR questions.
All questions carry equal marks.
20. Describe in detail any two scheduling algorithms used by the operating system in process management.
21. Distinguish between deadlock prevention and deadlock avoidance. Describe any two methods of avoiding deadlocks.
22. Compare segmented memory management with paged memory management bringing out with advantages of each over the
other.
23. Describe in detail the various file system structures used by the operating system.
24. How are I/O requests handled by the operating system? How are they transformed into hardware operations?
25. Discuss in detail the security problem in an operating system. How is this problem handler?
Subject Code: PK3D
Semester: III
Year: Second Year
Time: Three hours
Maximum: 100 marks
PART A - (10 * 3 = 30 marks)
Answer any TEN questions.
All questions carry equal marks.
Each answer should not exceed 50 words.
1. State any three services provided by the operating system.
2. Describe any three process states.
3. what is Turnaound time of a job?
4. Explain any two uses of semaphores.
5. Describe any two methods of deadloack recovery.
6. What is dynamic memory partitioning?
7. What is memory fragmentation?
8. What is dynamic linking? Why is it done?
9. Explain any two methods used for page replacement.
10. state any three file access methods.
11. Describe the role of a selector in I/O hardware.
12. What is Spooling?
PART B - (5 * 6 = 30 marks)
Answer any FIVE questions.
All questions carry equal marks.
13. Describe the various goals of an operating system.
14. What is a traffic controller? What is its function in process management?
15. Explain the critical section problem in process synchronisation.
16. Bring out the advantages and disadvantages of contiguous allocation over noncontinuous allocation.
17. What is thrashing? Why and how is it done?
18. What is an access matrix? What are its uses?
19. What are threats? How are threats monitored?
PART C - (4 * 10 = 40 marks)
Answer any FOUR questions.
All questions carry equal marks.
20. Describe in detail any two scheduling algorithms used by the operating system in process management.
21. Distinguish between deadlock prevention and deadlock avoidance. Describe any two methods of avoiding deadlocks.
22. Compare segmented memory management with paged memory management bringing out with advantages of each over the
other.
23. Describe in detail the various file system structures used by the operating system.
24. How are I/O requests handled by the operating system? How are they transformed into hardware operations?
25. Discuss in detail the security problem in an operating system. How is this problem handler?
Month & Year of Examination: April - 2011
Subject Code: SAZ4B
Semester: IV
Year: Second Year
Time: 3 hours
Maximum: 75 marks
SECTION A - (10x2 =20 marks)
Answer any TEN questions.
All questions carry equal marks.
1. Define computer-server system.
2. What is GUI?
3. Define program execution.
4. What is signal( ) semaphore operation?
5. Define transaction.
6. What is schedule?
7. What is meant by segmentation?
8. Define swapping.
9. Define swap space.
10. What is slab allocation?
11. Define polling.
12. Define interrupt vector.
SECTION B - (5x5 =25 marks)
Answer any FIVE questions.
All questions carry equal marks.
13. Discuss on Operating system operations.
14. Explain special purpose systems.
15. Describe on characterization.
16. Write a note on logical and physical address space.
17. Explain FIFO page and LRU page replacements.
18. Discuss about free space management and directory structure.
19. Explain threats and authentication.
SECTION C - (3x10 =30 marks)
Answer any THREE questions.
All questions carry equal marks.
20. Explain in detail about operating system structure.
21. Describe about Deadlock prevention and avoidance.
22. Discuss in detail about hardware protection and fragmentation.
23. Explain about thrashing.
24. Discuss on I/O scheduling, buffering, caching and error handling.
Subject Code: SAZ4B
Semester: IV
Year: Second Year
Time: 3 hours
Maximum: 75 marks
SECTION A - (10x2 =20 marks)
Answer any TEN questions.
All questions carry equal marks.
1. Define computer-server system.
2. What is GUI?
3. Define program execution.
4. What is signal( ) semaphore operation?
5. Define transaction.
6. What is schedule?
7. What is meant by segmentation?
8. Define swapping.
9. Define swap space.
10. What is slab allocation?
11. Define polling.
12. Define interrupt vector.
SECTION B - (5x5 =25 marks)
Answer any FIVE questions.
All questions carry equal marks.
13. Discuss on Operating system operations.
14. Explain special purpose systems.
15. Describe on characterization.
16. Write a note on logical and physical address space.
17. Explain FIFO page and LRU page replacements.
18. Discuss about free space management and directory structure.
19. Explain threats and authentication.
SECTION C - (3x10 =30 marks)
Answer any THREE questions.
All questions carry equal marks.
20. Explain in detail about operating system structure.
21. Describe about Deadlock prevention and avoidance.
22. Discuss in detail about hardware protection and fragmentation.
23. Explain about thrashing.
24. Discuss on I/O scheduling, buffering, caching and error handling.
Month & Year of Examination: November - 2008
Subject Code:
Semester: IV
Year: Second Year
Time: 3 hours
Maximum: 100 marks
SECTION A - (10x3 =30 marks)
Answer any TEN questions.
All questions carry equal marks.
1.What do you mean by Real time system?
2.Write the advantages of multiprogramming.
3.What are the necessary conditions for deadlock?
4.What do you mean by semaphore?
5.When does mutual exclusion need to be enforced?
6.Illustrate the external and internal fragmentation.
7.Define Segmentation
8.Write about overlays.
9.Give the structure of file system.
10.What do you mean by Access Control matrix?
11.What is SPOOLING?
12.What is threat monitoring?
SECTION B - (5x6=30 marks)
Answer any FIVE questions.
All questions carry equal marks.
13.What are the different performence criteria for CPU scheduling algorithms?
14.Explain the life cycle of a process with neat diagram.
15.Explain the PCB in detail.
16.What is deadlock? How can you avoid it?
17.What is page fault? When do page faults occur?
18.Discuss about virtual memory?
19.Discuss on various operations of a file.
SECTION C - (4x10 =40 marks)
Answer any FOUR questions.
All questions carry equal marks.
20.Describe the essential propertiesof the following operating systems:
(a) Batch
(b) Time-sharing
(c) Distributed
21.Describe the interprocess communication.
22.Discuss the Banker's algorithm for deadlock avoidance in detail.
23.Explain various file access methods.
24.Explain the segmentation technique with the necessary diagrams.
25.Describe the most common schemes for designing the logical structure of a directory
Subject Code:
Semester: IV
Year: Second Year
Time: 3 hours
Maximum: 100 marks
SECTION A - (10x3 =30 marks)
Answer any TEN questions.
All questions carry equal marks.
1.What do you mean by Real time system?
2.Write the advantages of multiprogramming.
3.What are the necessary conditions for deadlock?
4.What do you mean by semaphore?
5.When does mutual exclusion need to be enforced?
6.Illustrate the external and internal fragmentation.
7.Define Segmentation
8.Write about overlays.
9.Give the structure of file system.
10.What do you mean by Access Control matrix?
11.What is SPOOLING?
12.What is threat monitoring?
SECTION B - (5x6=30 marks)
Answer any FIVE questions.
All questions carry equal marks.
13.What are the different performence criteria for CPU scheduling algorithms?
14.Explain the life cycle of a process with neat diagram.
15.Explain the PCB in detail.
16.What is deadlock? How can you avoid it?
17.What is page fault? When do page faults occur?
18.Discuss about virtual memory?
19.Discuss on various operations of a file.
SECTION C - (4x10 =40 marks)
Answer any FOUR questions.
All questions carry equal marks.
20.Describe the essential propertiesof the following operating systems:
(a) Batch
(b) Time-sharing
(c) Distributed
21.Describe the interprocess communication.
22.Discuss the Banker's algorithm for deadlock avoidance in detail.
23.Explain various file access methods.
24.Explain the segmentation technique with the necessary diagrams.
25.Describe the most common schemes for designing the logical structure of a directory
Month & Year of Examination: November - 2007
Subject Code: PK3D
Semester: IV
Year: Second Year
Time: 3 hours
Maximum: 100 marks
SECTION A - (10x3 =30 marks)
Answer any TEN questions.
All questions carry equal marks.
1.What is process?
2.What is I/O burst?
3.What do you meant by unsafe state?
4.What is Deadlock?
5.What is called compaction?
6.What is meant by physical address?
7.What is thrashing?
8.Define the term virtual memory?
9.Define the term threat monitoring.
10.What is encryption?
11.What do you meant by concurrency?
12.Define Segmentation.
SECTION B - (5x6=30 marks)
Answer any FIVE questions.
All questions carry equal marks.
13.What do you mean by time sharing system?
14. Differentiate between processes and threads
15.What do you mean by deadlock recovery?
16.Discusses in detail about demand paging.
17.Discuss the any one page replacement algorithm for implemention memory management.
18. Write a note on file management systems.
19.Discuss on Authentication
SECTION C - (4x10 =40 marks)
Answer any FOUR questions.
All questions carry equal marks.
20. Describe various objectives and functions of operating systems.
21. Explain deadlock avoidance with an example.
22. Discuss in detail about internal and external fragmentation.
23. Discuss in detail about any two scheduling algorithms.
24. Discuss in detail about secondary storage structures.
25.Discuss the following classical problem of synchronization.
(a) The readers /writers problem.
(b) The dining philosophers problem.
Subject Code: PK3D
Semester: IV
Year: Second Year
Time: 3 hours
Maximum: 100 marks
SECTION A - (10x3 =30 marks)
Answer any TEN questions.
All questions carry equal marks.
1.What is process?
2.What is I/O burst?
3.What do you meant by unsafe state?
4.What is Deadlock?
5.What is called compaction?
6.What is meant by physical address?
7.What is thrashing?
8.Define the term virtual memory?
9.Define the term threat monitoring.
10.What is encryption?
11.What do you meant by concurrency?
12.Define Segmentation.
SECTION B - (5x6=30 marks)
Answer any FIVE questions.
All questions carry equal marks.
13.What do you mean by time sharing system?
14. Differentiate between processes and threads
15.What do you mean by deadlock recovery?
16.Discusses in detail about demand paging.
17.Discuss the any one page replacement algorithm for implemention memory management.
18. Write a note on file management systems.
19.Discuss on Authentication
SECTION C - (4x10 =40 marks)
Answer any FOUR questions.
All questions carry equal marks.
20. Describe various objectives and functions of operating systems.
21. Explain deadlock avoidance with an example.
22. Discuss in detail about internal and external fragmentation.
23. Discuss in detail about any two scheduling algorithms.
24. Discuss in detail about secondary storage structures.
25.Discuss the following classical problem of synchronization.
(a) The readers /writers problem.
(b) The dining philosophers problem.
Month & Year of Examination: April- 2008
Subject Code: PK3D
Semester: IV
Year: Second Year
Time: 3 hours
Maximum: 100 marks
SECTION A - (10x3 =30 marks)
Answer any TEN questions.
All questions carry equal marks.
1.Explain the main purposes of an Operative system.
2.Define turn around time .
3.Compare multiprogramming and multitasking.
4.List the method for handling dead locks.
5.Write a short note on counting semaphores.
6.What is the difference between logical and physical address?
7.What do you mean by swapping ? Explain with an example.
8. What is thrashing?
9.What is authentication?
10. List out the reason for using Demand paging.
11. What do you mean by spooling ?
12.What is threat monitoring?
SECTION B - (5x6=30 marks)
Answer any FIVE questions.
All questions carry equal marks.
13. What are the factors to be considered in CPU scheduling?
14. What are the necessary conditions for deadlocks?
15.3 Explain direct communication in interprocess communication.
16.Write a note on Critical Section Problem.
17. Briefly describe the single contiguous allocation scheme.
18. Discuss about Virtual memory,
19.Discuss on various operations of a file.
SECTION C - (4x10 =40 marks)
Answer any FOUR questions.
All questions carry equal marks.
20.Describe the essential properties of the following operating systems:
(a) Batch
(b) Time - sharing
(c) Distributed
21. Describe the steps to create a process. When the process terminated?
22. Discuss any one of the CPU scheduling with example.
23.Discuss the Banker's algorithm for deadlock avoidance in detail.
24. Explain type demand paging scheme with suitable example
25. Explain the various file access methods.
Subject Code: PK3D
Semester: IV
Year: Second Year
Time: 3 hours
Maximum: 100 marks
SECTION A - (10x3 =30 marks)
Answer any TEN questions.
All questions carry equal marks.
1.Explain the main purposes of an Operative system.
2.Define turn around time .
3.Compare multiprogramming and multitasking.
4.List the method for handling dead locks.
5.Write a short note on counting semaphores.
6.What is the difference between logical and physical address?
7.What do you mean by swapping ? Explain with an example.
8. What is thrashing?
9.What is authentication?
10. List out the reason for using Demand paging.
11. What do you mean by spooling ?
12.What is threat monitoring?
SECTION B - (5x6=30 marks)
Answer any FIVE questions.
All questions carry equal marks.
13. What are the factors to be considered in CPU scheduling?
14. What are the necessary conditions for deadlocks?
15.3 Explain direct communication in interprocess communication.
16.Write a note on Critical Section Problem.
17. Briefly describe the single contiguous allocation scheme.
18. Discuss about Virtual memory,
19.Discuss on various operations of a file.
SECTION C - (4x10 =40 marks)
Answer any FOUR questions.
All questions carry equal marks.
20.Describe the essential properties of the following operating systems:
(a) Batch
(b) Time - sharing
(c) Distributed
21. Describe the steps to create a process. When the process terminated?
22. Discuss any one of the CPU scheduling with example.
23.Discuss the Banker's algorithm for deadlock avoidance in detail.
24. Explain type demand paging scheme with suitable example
25. Explain the various file access methods.