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.

Advertisements


website counter




Download Model question papers & previous years question papers

Posted By: kishore       Member Level: Gold       Posted Date: 24 May 2008

2007 Jawaharlal Nehru Technological University M.C.A Computer Aplications OPERATING SYSTEMS Question paper



Course: M.C.A Computer Aplications   University: Jawaharlal Nehru Technological University




1.a) What are the main purposes of an operating system?
b) Define the essential differences between the following types of
operating systems:
i) Batch ii) Interactive
iii) Time sharing iv) Real time
c) What is the purpose of the command interpreter? Why is it usually
separate from the kernel?
2.a) Define the difference between preemptive and non preemptive
scheduling. State why strict non preemptive scheduling is unlikely
to be used in a computer center.
b) Five batch jobs A through E, arrive at a computer center at almost
the same time. They have estimated running times of 10, 6, 2, 4 and
8 minutes. Their (externally determined) priorities are 3, 5, 2, 1 and
4, respectively, with 5 being the highest priority. For each of the
following scheduling algorithms, determine the mean process turn
arount time. Ignore process switching overhead.
i) Round Robin ii) Priority scheduling
iii) First come, first served (run in order 10, 6, 2, 4, 8).
iv) Shortest job first.
For i) assume that the system is multi programmed and that each
job gets its fair share of the CPU. For ii) through iv) assume that
only one job at a time runs, until it finishes. All jobs are completely
CPU bound.
3.a) Define the critical section problem.
b) Write an algorithm for solving the critical-section problem for n
processes.
4.a) State and explain the necessary conditions for a deadlock to occur.
b) Explain in detail how we can prevent the occurrence of a deadlock.
Contd….2
NR
Code No: NR-21/MCA -2-
5.a) Explain the difference between logical and physical addresses.
b) Why are segmentation and paging combined into one scheme?
c) Explain briefly the use of inverted page table.
6.a) When do page faults occur? Describe the actions taken by the
operating system when a page fault occurs.
b) Consider the following page reference string:
1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6 How many page faults
would occur for the following replacement algorithms, assuming
three frames? Remember that all frames are initially empty, so your
first unique pages will all cost one fault each.
(i) LRU replacement (ii) optimal replacement
7.a) Distinguish between the following directory structures:
i) Acyclic – Graph Directories
ii) Tree structured directory structure.
b) Explain the different approaches used in implementing free-space
list.
8. Write notes on the following:
a) Capability based protection systems
b) Computer – security classifications.





Return to question paper search

Next Question Paper: HUMAN RESOURCE MANAGEMENT

Previous Question Paper: OPERATING SYSTEMS

Related Question Papers:


  • RR-III B.Tech Software Engineering(Feb'Sup)-Set1


  • SOIL DYNAMICS AND MACHINE FOUNDATION


  • I Year Network Analysis(R05-Set 2-Aug /Sep'2007-Sup)


  • IV B.Tech I Semester Regular Examinations, November 2007 DIGITAL IMAGE PROCESSING ( Common to Electronics & Communication Engineering and Electronics & Telematics)


  • FERTILIZER TECHNOLOGY(RR) supplementary exam,Aug/Sep 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.


    Contact Us    Privacy Policy    Terms Of Use   

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