B.E-B.E Computer Engineering OPERATING SYSTEM(Karunya University, Coimbatore-2012)
Saturday, 24 August 2013 01:50anudouglas
Karunya University
(Karunya Institute of Technology and Sciences)
(Declared as Deemed to be University under Sec.3 of the UGC Act, 1956)
End Semester Examination – November/ December - 2012
Subject Title : OPERATING SYSTEM Time : 3 hours
Subject Code: 09CS212 Maximum Marks: 100
Answer ALL questions
PART – A (10 x 1 = 10 MARKS)1. A single-threaded process has one ________ to specifying the next instruction to execute.
2. Write the difference between Policy and Mechanism in Operating System Design.
3. A program is a________ entity.
4. CPU Scheduler is also called ________.
5. Deadlocks can be described more precisely in terms of a directed graph called a ________.
6. An address generated by the CPU is commonly referred to as a ________.
7. A ________ never swaps a page into memory unless that page will be needed.
8. The ________ provides host-name-to-network-address translations for the entire Internet (including the World Wide Web).
9. A synchronous device performs data transfers with predictable ________.
10. The ________ is the time for the disk arm to move the heads to the cylinder containing the desired sector.
PART – B (5 x 3 = 15 MARKS)
11. Write the fundamental idea behind a virtual machine?
12. Define the term Processor Affinity.
13. What are the essential conditions of Deadlock?
14. Virtual address space of a process refers to what?
15. I/O request specifies several pieces of information. List out that information.
PART – C (5 x 15 = 75 MARKS)
16. An Operating system provides an environment for the execution of programs. What are the services provided for the convenience of the programmer, to make the programming task easier? Explain the services in detail.
(OR)
17. a. List out Various Execution modes in the Operating System. (6)
b. What is a System call? Explain the various types of system calls. (9)
18. In general a Process can be divided into Single Threaded Process and Multi Threaded Process.
a. List out the benefits of multithreaded programming. (3)
b. Explain the Multithreading Models with proper diagram. (7)
c. Explain Round robin scheduling with an example. (5)
(OR)
19. a. Define Critical Section.
b. There are some classical problems of synchronization and these problems are examples of a large class of concurrency–control problems. One of the problems is Dining-Philosophers problem. Explain this problem with proper example. Write the Monitor solution for this problem.
[P.T.O]
20. Explain the Banker’s algorithm for deadlock avoidance with an example.
(OR)
21. Paging is a memory management scheme. Draw the Paging hardware diagram. Write the working procedure of paging hardware in detail.
22. How can you handle a page fault in demand paging? Explain FIFO page replacement and Optimal Page replacement algorithms in detail.
(OR)
23. Explain the various diskspace allocation methods.
24. Explain the various disk scheduling algorithms with an example.
(OR)
25. Write short notes on:
a. RAID (10)
b. Tertiary storage structure (5)
| Earning: ₹ 5.50/- |
