You are on page 1of 3

c s145

B.E.lB.Tech.DEGREEEXAMINATION, MAY/JL|N ZAAT E .


Fifth Semester Information Technology CS 1252- OPERATING SYSTEMS (Regulation 2004) Time : Three hours Answer ALL questions. PART A - (fO x 2 = 20 rnarks) Maximum : 100 marks

2. 3. 4. 5' 6. 7. 8. 9. 10.

Describe the difference between preemptive and non preemptive scheduling.

What are two differences between user-level threads and kernel-level threads?

what is the main advantage of the layered approach to system design?

What are the five major activities of an operating system in regard to memory management? PARTB-(Sx16=80marks)

11.

(a)

(i) (ii)

ww

lVhat is Virtual memory?

List five senrices provided by .n operating system. Explain how each provides convenience the users. to (6) Describe the difference arnong the short term, medium term. and long term schedulers. (10) Or

(b)

Discuss briefly the various issues involved in implementing Inter process communication (IPC) in messagepassing system. (16)

w.

Describe the difference between first-fit, best-fit and worst-frt dpramic storage allocation strategies.

aa na

Discuss the relative advantagesand disadvantages ofsector sparing and sector slipping.

va

What is the purpose of the command interpreter? Why is it usually separate from the kernel?

N.

What is the purpose of system calls?

co m

1'

Describe the differences between slanmetric and asymmetric multiprocessing.

t2.

(a)

Discuss the critical section problem. problem using semaPhores. Or

solving

the Readers-writers (16)

(b) .

indicated Assume the following processesarrive for execution at the time given in and also mention with the length of the cPU-burst time milliseconds. (ms) Job Burst time (ms) Priority Arrival lims A1050 8620 c741 D411 E532 (i) processes Give a Gantt chart illustrating the execution of these (Preemptive using FCFS, Round Robin (quantum = $), and Priority @) and Non PreemPtive).

13.

(a)

algorithm Consider the following snapshot of a system. Execute Banker's answer the following. Available Max Allocation

aa na

ABCAB 00100 10017 13523 06316 00156

w.

Po Pr

ww

Pz

Pa Pr

va

(ii)

time calculate the average waiting time and average turn around (12) for each of the above scheduling algorithm'

N.
CABC 1152 5 5 5
D

co m

(i) (ii)

What is the content of need matrix?

Q)

how all the Is the system in a safe state? If the system is safe, show is process could completethem execution successfully.If the system (6) unsafe, show how deadlockmight occur' Explain' request be If a request from process Pr arrives (0,4,2) can the (8) granted? If granted, write the sequenceof processes'

(iii)

Or

c 3145

(b) (i) (ii)

What is a translation look-aside buffer? Why is it needed?

( 12) (4)

Considerthe following segmenttable' Segment Base Length 0 1 2 3 4 2L9 2300 90 L327 L952 600 L4 100 580 96

What are the physical addresses for the following logical addresses? (1) 0,430 (2) 1,10 (3) 2,500 (4) 3'4oo L4. (a) Consider the following page reference string :

Or (b) (i) (ii)


15. (a)

va

N.

page Calculate the number of page faults would occur for the following replacement algorithm with frame size of 3 and 6' (16) (i) LRU (ii) FIFO (iii) Optimal'

co m

! , 2 1 3 , 4 12 , l , 5 , 6 12 , L r 2 13 r 7 , 6 , 3 r 2 ' L r 2 , 3 r 6 '

aa na

methods' Explain the various file Access Discussthe layeredarchitecture of file system'

(6) (10)

to What is the total distance (in cylinders) that the disk arm moves satisfy all the pending requests for each of the following disk-scheduling algorithms? (16) (i) SSTF (ii) FCFS (iii) SCAN (iv) C-SCAN Or (b) list, Explain the free space management using Bit Vector, Linked (16) Grouping and Counting methods.

ww

1509,L022,1750,130' 86,L470,913,1774,948,

w.

is A hard disk having 2000 cylinders, numbered from 0 to 1999' The drive currently serving the request at cylinder 143, and the previous request was at cylinder 125. The status of the queue is as follows :

c 3145