Question Papers and Solutions




CS-13 : Operating Systems of January 2001

Filed under: IGNOU MCA  

Question Paper of CS-13 : Operating Systems of January 2001

Qns 1. (a) Write an algorithm for implementing Dining philosopher problem using semaphores. Also describe the problems and the algorithm in detail.

(b) What is the time stamping scheme of distributed system for mutual exclusion? Explain the functioning of the scheme through a diagram.

(c) Describe the algorithm proposed by Ricart and Agrawal for distributed mutual exclusion. Also distinguish between this algorithm and Lamport;’s algorithm on the following lines:
- Correctness of the algorithm
- Deadlock
- Communication cost

Qns 2.Discuss various machine level implementation of mutual exclusion in general. Also discuss suitability and efficiency of these algorithms.

Qns 3. (a) Explain the advantages and disadvantages of segmented and paged implementation of virtual memory. Explain through a diagram, the principles of address translation in combined segmentation and paging. What is the drawback of this translation scheme?

(b) Describe Belady’s anomalous behaviour of FIFO.

Qns 4 (a) What is thrashing? What is the cause of thrashing? How does the system detect thrashing? Once it detects thrashing, what are the techniques tp prevent it?

(b) Discuss the difference between preemptive and nonpreemptive scheduling.

Qns 5. (a) Discuss scheduling and interprocessor communication suitable for hypercube multiprocessor operating system .

(b) What is RPC (Remote Procedure Call) ? What are the major issue in implementing the RPC? Describe them briefly.

Qns 6. (a) Describe the functioning of DES. What are its advantages and disadvantages>?

(b) Describe deadlock detection and recovery algorithm for centralized operating system.






Related Posts to: CS-13 : Operating Systems of January 2001

CS-02 : Introduction to Software January 2001

Question Paper of CS-02 : Introduction to Software January 2001 Qns 1. Design a context free grammar for the following : (i) Switch statement in C-language. (ii) An arithmetic expression in C-language. (iii) Write

CS-12 : Computer Architecture of January 2001

Question Paper of CS-12 : Computer Architecture of January 2001 Qns 1(i) The execution times (in seconds) of four programs on three computers are given below: Execution Time (in seconds) Program Computer A

CS-09 : Data Communication & Network January 2001

Question Paper of CS-09 : Data Communication & Network January 2001 Qns 1 (i) Suppose that the Aloha Protocol is used to share a 56 Kbps satellite channel. Suppose that packets

CS-13 : Operating Systems of June 2001

Question Paper of CS-13 : Operating Systems of June 2001 Qns 1. (i) Write an algorithm for bounded buffer producer/consumer problem using monitor. Also describe the problem and algorithm in detail. (ii)

CS-13 : Operating Systems of December 2001

Question Paper of CS-13 : Operating Systems of December 2001 Note : Q. No.one is compulsory and carries 30 marks. Q. Nos. two to six carry 15 marks each. Qns 1(a) Write an algorithm/program

CS-02 : Introduction to Software of Dec 1995

Question Paper of CS-02 : Introduction to Software of Dec 1995 Qns 1. (a) Design an algorithm that accepts an input a decimal number and converts it into BCD (binary coded

CS-16 : Object-Oriented Systems of June 2001

Question Paper of CS-16 : Object-Oriented Systems of June 2001 Qns 1. (i) Write a program in C++ to implement queue data structure using linked list. It may support the following

CS-13 : Operating Systems of December 2000

Question Paper of CS-13 : Operating Systems of December 2000 Qns 1. (a) Write an algorithm that solves the readers/writers problem using monitors (b) Devise an algorithm for Dead-lock detection, Discuss the

CS-54 - Finance & Accounting On Computers of June 2001

Question Paper of CS-54 - Finance & Accounting On Computers June 2001] Note : There are 6 questions in the paper. Question no. 1 is compulsory and carries 35 marks. From

CS-13 : Operating Systems of June 2000

Question Paper of CS-13 : Operating Systems of June 2000 Qns 1. (a) Hierarchical directories are more complex to manage than flat files, but their advantages are considered to outweight their





Submit

Contact Us



Search



Categories


Archives


Other Details


Links Listing
Gasket Supplier in Delhi
Lawyer in Gurgaon