vu experts - FW: WebLyceum Fwd: FINAL TERM EXAMINATION SPRING 2011 CS604 - OPERATING SYSTEMS

Thanks…

 

Regards

 

Bilal Farooq | Final Semester

 

Admin Weblyceum

www.weblyceum.com

 

From: weblyceum@googlegroups.com [mailto:weblyceum@googlegroups.com] On Behalf Of Eman khan
Sent: Wednesday, July 20, 2011 8:46 PM
To: weblyceum@googlegroups.com
Subject: WebLyceum Fwd: FINAL TERM EXAMINATION SPRING 2011 CS604 – OPERATING SYSTEMS

 

 

 

FINAL TERM EXAMINATION
SPRING 2011 (15 JULY 2011)
CS604 – OPERATING SYSTEMS

Time: 120 min
Marks: 80
Total 53 Questions
40 x MCQs
5 x 2 Marks Questions
5 x 3 Marks Questions
3 x 5 Marks Questions

Subjective Portion is as under:-


Question No: 41 ( Marks: 2 )
Give one solution of Dinning Philosophers problem.

Question No: 42 ( Marks: 2 )
In swapping what does mean by Roll In and Roll Out?

Question No: 43 ( Marks: 2 )
How taking backup in Linux / Unix is easier than windows?

Question No: 44 ( Marks: 2 )
Number of free frames = 64, Number of processes = 3 and Process sizes: P1 = 10 pages; P2 = 40 pages; P3 = 127 pages. Calculate free frames using fixed allocation method.

Question No: 45 ( Marks: 2 )
Virtual memory is a separation of user logical memory from Physical Memory. Is it makes programming easy or difficult?

Question No: 46 ( Marks: 3 )
What do you understand by protection bit in Primary Protection Scheme under paging?

Question No: 47 ( Marks: 3 )
Is in necessary to have reference count with in a file descriptor in order to implement a soft link?

Question No: 48 ( Marks: 3 )
If a process is starved then a system is in state of Deadlock. Statement is correct or incorrect?
Question No: 49 ( Marks: 3 )
What I the difference in Deadlock Prevention and Deadlock Avoidance

Question No: 50 ( Marks: 3 )
Differentiate between a library call and a system call

Question No: 51 ( Marks: 5 )
Following hole sizes are available in a variable memory system
20k 15k 40k 60k 10k 25k
A new process of 25k is loaded into system, which hole sizes will be used by Best Fit, First Fit and Worst Fit?

Question No: 52 ( Marks: 5 )

How a page fault occurs and who is responsible to handle page faults?

Question No: 53 ( Marks: 5 )
Differentiate between Least Frequent Used Algorithm and Most Frequent Used Algorithm in context of Page Replacement Algorithms

Another paper

What is mounting and mount count 2marks
Some way to reduce external fragmentation 2marks
Four characteristic of deadlock preventation 2 marks
Is starvation and deadlock are same. Accept or reject with solid reason 3 marks
Why we need medium term scheduling? 3marks
If hard realtime system cannot manage output with in given slot then what happen? 3marks
Difference between deadlock avoidance and deadlock prevention? 3marks

Working of copy on write in virtual memory 5marks
2 numerical thy 5 marks k ek 3 marks ka bhi numerical tha

Another paper


CS604 Final Term Paper 15 July 2011 -

80% mcqz from past papers
3 question 5 marks per
deadlock detect and recover how?
decreasing page fault.
Thrashing.
5 questions 3 marks per
scan algorithm
swap space
reader,writer first problem
demand page
fifo page replacement
5 questions 2 marks per
deadlock
banker's algorithm
segmentation
external fragmention
pipe structure

 

 

 

--
Please visit http://www.weblyceum.com and get registered for Past Papers, Quiz, Assignments, GDBs and much more...
To post to this group, send email to weblyceum@googlegroups.com
If you are interested to join Weblyceum Team follow this link:
http://portal.weblyceum.com/join-weblyceum-team