Operating Systems: Instructions

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

444

No of Pages : 2 Course Code: 12E703

Roll No:
(To be filled in by the candidate)

PSG COLLEGE OF TECHNOLOGY, COIMBATORE - 641 004

SEMESTER EXAMINATIONS, FEBRUARY / MARCH - 2016

BE – ELECTRICAL AND ELECTRONICS ENGINEERING Semester: 7

12E703 OPERATING SYSTEMS

Time: 3 Hours Maximum Marks: 100

INSTRUCTIONS:
1. Answer ALL questions from GROUP – I.
2. Answer any FOUR questions from GROUP – II.
3. Answer any ONE question from GROUP – III.
4. Ignore the box titled as “Answers for Group III” in the Main Answer Book.
GROUP - I Marks : 10 x 3 = 30

1. State the use of bootstrap loader.


2. What are the requirements that a solution to the critical section problem must satisfy?
3. What is deadlock and starvation?
4. Define logical address and physical address.
5. Write the difference between external and internal fragmentation?
6. What are the information associated with an open file?
7. What is Directory? Write any two operations that can be performed on a directory.
8. Define seek time and latency time.
9. What is a real-time operating system?
10. What are the items in the process identity of LINUX system?

GROUP II Marks: 4 x 12.5 = 50

11. a) Discuss about the following memory allocation schemes used in an operating
systems (i) Contiguous Memory Allocation, (ii) Paging. (8.5)
b) Define the essential properties of the following types of operating systems:
a. Data base operating systems b. Timesharing operating systems (4)
12. a) Give the four different criteria on which the different CPU scheduling algorithms are
compared. (6)
b) Explain the Shortest Job First algorithm and Round Robin algorithm with suitable
example. (6.5)

Page No: 1
444

No of Pages : 2 Course Code: 12E703

13. a) Explain the simple hardware instructions that are available on many systems and
show how they can be used effectively in solving the critical-section problems. (7.5)
b) Brief the working of a synchronization tool called a semaphore (5)
14. Write about the following disk scheduling algorithms:
(i) FCFS Scheduling, (ii) SSTF Scheduling, (iii) SCAN Scheduling,
(iv) C-SCAN Scheduling, (v) LOOK Scheduling
15. Elaborate the different file allocation methods in detail.

GROUP - III Marks : 1 x 20 = 20

16. a) Clearly address the need for page replacement. List any four common page
replacement schemes and illustrate the performance of each scheme. (10)
b) Describe the two different Deadlock avoidance schemes available in operating
systems. (10)
17. a) Brief the Components of a Linux System and Memory management aspects of Linux
(10)
b) Show the architecture of Windows 2000 operating systems and brief the system
components. (10)

/END/
FD/RL

Page No: 2

You might also like