Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Sri Ramanujar Engineering College Department of Information Technology Model Exam Ii Year/Iv Sem

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

SRI RAMANUJAR ENGINEERING COLLEGE

DEPARTMENT OF INFORMATION TECHNOLOGY


MODEL EXAM
II YEAR/IV SEM
SUB CODE/NAME: CS8493/OPERATING SYSTEMS MAX MARKS:100

PART-A (2*10=20MARKS)

1. Distinguish between system programs and system applications.


2. What is the main advantage of multiprogramming?
3. Priority inversion is a condition that occur in real time systems where a low priority
process is starved because higher priority processes have gained hold of the CPU”-
Comment on this statement.
4. Differentiate user level threads and kernel level threads.
5. What is the purpose of paging and page table?.
6. Define demand paging. What are the steps to handle page fault in demand paging?
7. Do FAT file system advantageous? Justify the answer.
8. A disk has 26310 cylinders, 16 tracks and 63 sectors. The disk spins at 7200rpm. Seek
time between adjacent track is 1ms.How long does it take to read the entire disk?
9. Mention any two features of LINUX file system.
10. What is iOS SDK?

PART-B (5*13=65MARKS)

11. a. Discuss about the operating system structures.


OR
b. (i)Explain how system call works and how the parameters are passed to system calls
(ii) Discuss the overview of computer system

12. a) Explain process scheduling in detail.


OR

b) Consider the following process, with the CPU burst time given in milliseconds.
(i) Give a Gantt chart illustrating the execution of these process using FCFS, SJF,
Priority ,Round Robin (Quantum = 1). (7marks)
(ii) Calculate the AWT and ATT for each of the algorithm. (6 marks).

Process Burst Time Priority


P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2

13. a) Explain demand paging in detail.


OR

b. Consider the following page reference string:


1,2,3,2,5,6,3,4,6,3,7,3,1,5,3,6,3,4,2,4,3,4,5,1
Indicate page fault for FIFO, LRU and Optimal page replacement algoritms for size 3 and 4.
14 . a. Consider a disk queue with requests for I/O blocks on cylinders
98,183,37,122,14,124,65,67 . If the disk head is start at 53 , then find out the total head
movement with respect to FCFS, SSTF, SCAN, C-SCAN and LOOK scheduling.

OR
b. Explain various file allocation methods.

15. a Explain in detail about Android OS


OR
b. Explain in detail about iOS.

PART-C (1*15=15 MARKS)

16. a. Consider the following system snapshot using Banker’s algorithm with resources
A,B,C and D and processes p0 to p4.

Max Allocation Available


process A B C D A B C D A B C D
P0 6 0 1 2 4 0 0 1 3 2 1 1
P1 1 7 5 0 1 1 0 0
P2 2 3 5 6 1 2 5 4
P3 1 6 5 3 0 6 3 3
P4 1 6 5 6 0 2 1 2
Answer the following questions.
(i) How many resources of type A,B,C and D are there? (2)
(ii) What are the contents of the need matrix? (2)
(iii) Is the system in a safe state?Why? (3)
(iv) If a request from process p4 arrives for additional resources of(1,2,0,0), can the
Banker’s algorithm grant the request immediately? (6)

.
OR
b. Explain various directory structures.

You might also like