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.
|
cs 333
Posted Date: 12 Jul 2008 Resource Type: Articles/Knowledge Sharing Category: Education
|
Posted By: Lakshmi priya Member Level: Silver
Rating:  Points: 3
|
|
|
B.E/B.Tech.DEGREE EXAMINATION,NOVEMBER/DECEMBER 2004.
Fifth Semester
Computer Science and Engineering
CS 333 – OPERATING SYSTEMS
Time: Three hours Maximum:100 marks
Answer ALL questions
PART A – (10* 2= 20 marks)
1. What is Time Sharing System?
2. What is the main advantage of the layered approach to system design.
3. What is job scheduler? What is CPU scheduler?
4. What are the various process states?Depict process state diagram.
5. Explain any four scheduling criteria involved in CPU scheduling.
6. Consider a logical address space of eight pages of 1024 words each, mapped
onto a physical memory of 32 Frames. How many bits are there in logical
address?
7. What is sequential address method? Mention its merits and demerits.
8. Define single level directory structure. Give one example.
9. What is a bit vector?
10. Mention any two features of linux file system.
PART B - ( 5 * 16 = 80 marks )
11. (i) Describe Working-Set model. (10)
(ii) Describe paging with illustrative example. (6)
12. (a) (i) Consider the following set of processes , with the length of the CPU
burst time given in milliseconds.
Process Burst time Priority
P1 8 3
P2 3 1
P3 4 4
P4 2 2
P5 6 5
The processes are assumed to have arrived in the order P1, P2, P3,
P4 and P5 all at time 'O'.
(1) Draw four Gantt charts illustrating the execution of these
processes using FCFS, SJF,A nonpreemptive priority (a
smaller priority number implies a higher priority) and RR
(quantum = 2) scheduling.
(2) What is the turn around time of each process for each of the
scheduling algorithms in part (1).
(3) What is the waiting time of each process for each of the
scheduling algorithms in part (1).
(4) Which of the schedules in part (1) results in the minimal
average waiting time(over all processes) (12)
(ii) Explain the three requirements that a solution to critical-section
problem must satisfy. (4)
Or
(b) (i) Describe an algorithm which satisfies all the conditions of critical
section problem and also prove how it satisfies all the conditions.
(6)
(ii) Describe deadlock prevention methods
(1) Hold and wait
(2) Circular wait
(3) No preemption. (10)
13. (a) (i) Describe internal and external fragmentation with illustrative
examples. (8)
(ii) Describe segmentation with its hardware. (8)
Or
(b) (i) Describe multilevel paging with example. (8)
(ii) Describe hardware support of paging with TLB. (8)
14. (a) Describe place replacement algorithms
(i) FIFO algorithm
(ii) Optimal algorithm
(iii) LRU algorithm with illustrative example. (16)
Or
(b) (i) Describe the layered design of file-system organisation. (10)
(ii) Describe the file system mounting. (6)
15. (a) Describe the following methods for allocating disk space.
(i) Linked allocation.
(ii) Contiguous allocation. (16)
Or
(b) (i) Describe components of a Linux system. (8)
(ii) Describe process scheduling in Linux system. (8)
|
Responses
|
No responses found. Be the first to respond and make money from revenue sharing program.
|
|
Watch TV Channels
|