Learn more about IndiaStudyChannel
Install Alexa Toolbar
and earn more...
 
Communities Members BookmarksPolls Fresher Jobs Funny Photos B.Tech 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: Nitin       Member Level: Silver       Posted Date: 18 Jun 2008

2008 Punjab Technical University B.Tech Computer Science & Engineering Operating System Question paper



Course: B.Tech Computer Science & Engineering   University: Punjab Technical University




Paper ID[CS202]
B.Tech(Sem-4th)
Operating System
Time: 03 Hours Maximum Marks: 60
Instructions to Candidates:
1) Section –A is Compulsory.
2) Attempt any Four questions from section –B.
3) Attempt any Two questions from Section –C.

Section – A
Q1) (10 x 2 = 20)
a) What is buffering?
b) What is logical address space?
c) What is a thrashing?
d) What is meant by critical section?
e) What for are Resource Allocation Graphs used.
f) What is real time processing?
g) What are Semaphores?
h) What is Spooling?
i) What is garbage collection?
j) What are program threats?
Section – B
(4 x 5 = 20)
Q2) Explain virtual memory and associative memory.
Q3) Discuss in details the Data Encryption Standard(DES) algorithm. What are its limitations?
Q4) Write short notes on the following:
a) Two phase locking
b) Wait-die and Wound-wait.
Q5) What do you mean by page-faults? When do page fault occurs? Describe the action taken by the O.S. when page-fault occurs?
Q6)Explain the difference between internal fragmentation and external fragmentation. Which one occurs in paging system?
Section – C
(2 x10 = 20)
Q7) a) How can you prevent circular waiting condition in a deadlock?
b) Which is the main limitation of resource allocation graph?
Q8) Compare and contrast Public-key cryptography technique with Conventional cryptography technique.
Q9) What do you mean by file management? Explain the various access and allocation methods of files in details.






Return to question paper search

Next Question Paper: Data Communication

Previous Question Paper: MALP

Related Question Papers:


  • GEOGRAPHY OF TOURISM (INDIA) PART - I (B.Sc.(ATM)-104)


  • Advertising and Sales Management (N2) MB502


  • PROGRAMMING IN C


  • NON-CONVENTIONAL ENERGY RESOURCES


  • System programming CS210 (May 2008)


  • 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    Editors    Privacy Policy    Terms Of Use   

    ISC Technologies. 2006 - 2008 All Rights Reserved.