|
CS-13 : Operating Systems of January 2001 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 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 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-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 CS-13 : Operating Systems of December 2002 Question Paper of CS-13 : Operating Systems of December 2002
Qns 1. (a) Write and explain one of the deadlock detection algorithms and evaluate its performance.
(b) Explain the logic of Dekker’s CS 06 : Database Management System of December 2001 Question Paper of CS 06 : Database Management System of December 2001
Qns 1. a. Design a Relational database to the E-R diagram given below (7)
b. Explain the following general
|