Community Sites
Create your own community website and start earning today !
It's Free !
 
Communities Members BookmarksPolls Fresher Jobs Funny Pictures MCA Projects New Member FAQ  



My Profile
Active Members
TodayLast 7 Days more...



Awards & Gifts
Online Exams

Fresher Jobs


Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian cities including Bangalore, Chennai, Hyderabad, Pune or Kochi

Resources


Find educational articles, blogs, discussion threads and other resources.

Colleges


Find details about any college in India or search for courses.

website counter




Download Model question papers & previous years question papers

Posted By: satish       Member Level: Gold       Posted Date: 01 Nov 2007

2006 Jawaharlal Nehru Technological University B.E Computer Science III B.Tech I Semester Regular Examinations, November 2006 OPERATING SYSTEMS Question paper



Course: B.E Computer Science   University: Jawaharlal Nehru Technological University





Code No: RR311301 Set No. 1
III B.Tech I Semester Regular Examinations, November 2006
OPERATING SYSTEMS
(Electronics & Control Engineering)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks

1. (a) Describe the basic instruction cycle with example.
(b) What is an Interrupt? Describe the different types of interrupts. [marks 8+8]
2. (a) Describe various operations on threads.
(b) Discuss about threads synchronization.
(c) Write about Kernel level threads. [marks 6+5+5]
3. Explain the various mechanisms provided by UNIX for inter process
communication and synchronization in detail [marks 16]
4. (a) What are the conditions that must satisfy for deadlock occurrence and explain
them.
(b) Is the deadlocks problem preventable? Justify your answer with example and
diagram. [marks8+8]
5. (a) Explain in detail about the fetch policy supported by the Operating System
(b) A computer has a cache main memory and a disk used for virtual memory.
If a referenced word is in the cache, 20 nanoseconds are required to access it.
If it is in the main memory but not in the cache, 60 nanoseconds are needed
to load it into the cache, and then the reference is started again. If the word
is not in main memory, 12 milliseconds are required to fetch the work from
disk, followed b 60 nanoseconds to copy it to the cache, and then reference is
started again. The cache hit ratio is 0.9 and the main memory hit ratio is 0.6.
What is the average time in nanoseconds required to access a referenced word
on this system?
(c) Differentiate using a neat sketch between direct and associate lookup for page
table entries. [marks 5+5+6]
6. (a) What are preemptive and nonpreemptive
scheduling policies?
(b) Describe nonpreemptive
scheduling policies [marks 8+8]


7. (a) What do you understand by a file directory?
(b) Explain briefly the information elements of a file directory
(c) Explain what is treestructured
directory?

8. What do you understand by Trusted systems? Draw a figure of reference monitor
concept and explain. [ marks 5+5+6]






Return to question paper search

Next Question Paper: IF254-DATABASE MANAGEMENT SYSTEM

Previous Question Paper: III B.Tech I Semester Regular Examinations, November 2006 SET-3

Related Question Papers:


  • II B.Tech II Semester Supplimentary Examinations, Aug/Sep 2008,ANALOG COMMUNICATIONS


  • II B.Tech Supplimentary Examinations, Aug/Sep 2008 ENZYME ENGINEERING AND TECHNOLOGY


  • III B.Tech II Semester Regular Examinations, Apr/May 2008 REGULATORY AFFAIRS AND CLINICAL TRIALS


  • COMMUNICATION ENGINEERING (Supplimentary Examinations, November 2007)


  • LOGISTICS AND SUPPLY CHAIN MANAGEMENT December-2007.


  • Categories


    Submit Previous Years University Question Papers and make money from adsense revenue sharing program

    Are you preparing for a university examination? Download model question papers and practise before you write the exam.

    Watch TV Channels



    Contact Us    Privacy Policy    Terms Of Use   

    SpiderWorks Technologies Pvt Ltd. 2006 - 2007 All Rights Reserved.