Exam Details
Subject | operating systems | |
Paper | ||
Exam / Course | m.sc. computer science | |
Department | ||
Organization | Alagappa University Distance Education | |
Position | ||
Exam Date | December, 2017 | |
City, State | tamil nadu, karaikudi |
Question Paper
DISTANCE EDUCATION
M.Sc. (Computer Science) DEGREE EXAMINATION,
DECEMBER 2017.
OPERATING SYSTEMS
(2007 onwards)
Time Three hours Maximum 100 marks
SECTION A — (10 x 3 30 marks)
Answer ALL questions.
1. Write a short note on system calls for signal
management.
2. How operating system acts as an extended machine?
3. What is meant by critical section?
4. Why do we need two level Scheduling Algorithm?
5. What is DMA?
6. What is dead lock modeling?
7. How do you realize the Multiprogramming and memory
usage?
8. Write an example for Bit Map storage.
9. What is the use of shared file?
10. Write a short note on Event Ordering.
Sub. Code
25
DE-2798
2
wk11
SECTION B — × 10 40 marks)
Answer any FOUR questions only.
11. Explain Operating System Services.
12. Discuss in detail with an example Round Robin
Scheduling Algorithm. What is its merits and demerits?
13. Explain: Virtual Memory in detail.
14. How do you increase multiprogramming performance by
using MVP?
15. How do you simulate LRU algorithm for page
replacement?
16. Discuss in detail various permissions of file settings in
LINUX.
SECTION C — × 15 30 marks)
Answer any TWO questions only.
17. Explain: Process Scheduling and Inter Process
Communication in detail.
18. Define: Dead lock. Explain deadlock avoidance by using
any one method.
19. Describe the important feature of file server.
M.Sc. (Computer Science) DEGREE EXAMINATION,
DECEMBER 2017.
OPERATING SYSTEMS
(2007 onwards)
Time Three hours Maximum 100 marks
SECTION A — (10 x 3 30 marks)
Answer ALL questions.
1. Write a short note on system calls for signal
management.
2. How operating system acts as an extended machine?
3. What is meant by critical section?
4. Why do we need two level Scheduling Algorithm?
5. What is DMA?
6. What is dead lock modeling?
7. How do you realize the Multiprogramming and memory
usage?
8. Write an example for Bit Map storage.
9. What is the use of shared file?
10. Write a short note on Event Ordering.
Sub. Code
25
DE-2798
2
wk11
SECTION B — × 10 40 marks)
Answer any FOUR questions only.
11. Explain Operating System Services.
12. Discuss in detail with an example Round Robin
Scheduling Algorithm. What is its merits and demerits?
13. Explain: Virtual Memory in detail.
14. How do you increase multiprogramming performance by
using MVP?
15. How do you simulate LRU algorithm for page
replacement?
16. Discuss in detail various permissions of file settings in
LINUX.
SECTION C — × 15 30 marks)
Answer any TWO questions only.
17. Explain: Process Scheduling and Inter Process
Communication in detail.
18. Define: Dead lock. Explain deadlock avoidance by using
any one method.
19. Describe the important feature of file server.
Other Question Papers
Subjects
- c++ and data structures – lab i
- computer architecture
- computer networks
- data structures using c++
- database management systems
- image processing and analysis
- internet programming — lab
- internet programming and web design
- mathematical foundation of computer science
- operating systems
- software engineering
- visual programming
- visual programming – lab