You can download Previous year question papers of OPERATING SYSTEM for B.Sc.-IT 2014. Uttarakhand Technical University (UTU) Conducted Examination of the Professional Courses. Here we provide a previous year question papers for B.SC.-IT Fourth semester subject is OPERATING SYSTEM. Check out all question papers, Exam pattern, Syllabus, results.
Previous year question paper of operating system for B.Sc. IT FORTH SEMESTER UTU 2014
B.SC. INFORMATION TECHNOLOGY
UTU FOURTH SEMESTER EXAMINATION-2014
OPERATING SYSTEM
Time Durations: 3 Hrs. Total Marks: 70
Instructions: Attempt any five Questions. All questions carry equal marks.
Q1). a). Define one essential feature of the following operating system:-
i). Batch
ii). Time sharing
iii). Network
iv). Distributed
v). Interactive
vi). Real time
vii). Parallel
b). With a neat diagram, describe the storage device hierarchy of a computing system.
Q2). a). List five services provided by an operating system. Explain how each provides convenience to the users. Explain also in which cases it would be impossible for user-level programs to provide these services.
b). What is the meaning of the term busy waiting? What other kinds of waiting are there in an OS? Can busy waiting be avoided altogether?
Q3). a). What do mean by inter process communication? Explain various methods of inter process communication.
b). What are the differences between user-level threads and kernel threads? Under what circumstances is one type better than the other?
Q4). a). Define Semaphores. How can it be used as a general synchronization tool? What advantage does a semaphore have as compared to a hardware test-and-set instruction?
b). Explain the for necessary conditions that must be in effect for a deadlock to exist. Explain two methods for handling deadlocks.
Q5). a). What is paging? What is the hardware support required for paging? Describe this with the help of a diagram. What are the security and protection mechanisms in paging?
b). What is the purpose of system calls? Describe the different types of system calls provided by an operating system.
Q6). a). What is resource allocation graph? What is its role in solving deadlock situations?
b). What is remote procedure calls (RPC)? Explain the execution of RPC.
Q7). 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 two, five, and seven frames? Remember all frames are initially empty, so the first unique pages will all cost one fault each.
i). LRU replacement
ii). FIFO replacement
iii). Optimal replacement
Q8). Write short notes on the following :
i). Mutual Exclusion in Distributed Operating System
ii). Public key encryption scheme.
iii). Virtual memory scheme.
iv). Demand paging.