March 6, 2010

CS 333 – OPERATING SYSTEMS QUESTION PAPERS


B.E/B.Tech.DEGREE EXAMINATION,NOV/DEC 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)


FEEL USEFUL PLEASE GIVE +1

0 comments :

Post a Comment

Get Syllabus in your Mail

Labels

Accenture Admission Notice - 2010 Admission Notification Anna University Anna University Chennai Anna University Question Papers Anna University Trichy Apparel Technology and Management Aptitude Questions Arts and Science Colleges Biomedical Engineering C and CPP Ebooks Calicut University CBSE Question papers Civil Engineering Civil Service Exams Colleges in India Colleges Result Computer Science Engineering Core Jobs CS R2008 CSE CSIR NET EBooks Download ECE EEE EIE Electives Electrical and Electronics Engineering Electronics and communication Electronics and Instrumentation Engineering Engineering Engineering Colleges in Maharashtra Engineering Colleges in TamilNadu Engineering Admissions Engineering Colleges Engineering Colleges in Karnataka Engineering Jobs Engineering Syllabus Entrance Exam Dates Entrance Exam Results Entrance Examination Exam Time Table Experiencer First Year Syllabus Freshers Full Time Jobs Government jobs in india Hardware and Networking Jobs Hotel Management and Catering Technology IGNOU Information Technology INTEVIEW QUESTIONS IT Jobs JNTU Question Papers Jobs in Bangalore Jobs in Chennai Jobs in Coimbatore Jobs in Delhi Jobs in Hyderabad Jobs in India Jobs in Kerala Jobs in Noida Jobs in Tamilnadu Jobs in TATA Karnataka Educations Lab Manuals Mechanical Engineering Medical Colleges Placement Papers Plus 2 Preparation for exams Private Jobs in India Question Papers Question Papers Download Results Announcement Semester 1 Semester 2 Semester 3 Semester 4 Semester 5 Semester 6 Semester 7 Semester 8 Syllabus Syllabus Download Tamil Movie TCS Placement Papers Teaching Jobs TECH MAHINDRA Textile Technology Top colleges University Results UPSC VICEVESVARAYA TECHNOLOGICAL UNIVERSITY waec Walk-in Interview Web Designers

Followers

Archive

 

Privacy Policy
http://topengineeringcollegesintamilnadu.blogspot.com use third-party advertising companies to serve ads when you visit our website. These companies may use information (not including your name, address, email address, or telephone number) about your visits to this and other websites in order to provide advertisements about goods and services of interest to you. If you would like more information about this practice and to know your choices about not having this information used by these companies, click here.