IGNOU MCA IGNOU BCA IGNOU MBA IGNOU CIC Courses

June, 2002

Filed under:

Question Paper of CS-13 - Operating Systems of June 2002 from IGNOU

Note :The candidates are required to attempt four questions in all.
Q. No.one is compulsory and carries 30 marks.
Q. Nos. two to six carry 15 marks each.

1(a) Explain the drawbacks of Busy-Wait implementation of semaphores. How can we overcome these by using queuing implementation of semaphores? Discuss.

(b) Explain the Rivest, Shamir, Adelman (RSA) public key algorithm.

© Explain the anatomy of Disk Address Transaction.

2(a) What is the difference between a program and a process? Explain the four general categories of process states with the help of process state-transition diagram.

(b) Explain the following scheduling algorithms:
(i) Shortest Remaining Time Next (STRN) scheduling
(ii) Time slice scheduling
(iii) Event driven scheduling
(iv) Multiple-level queues scheduling

3(a) Discuss various machine level implementation of mutual exclusions in general and of semaphores in particular. Also discuss suitability and efficiency of these algorithms.

(b) Explain how a monitor can be implemented with semaphores.

4(a) Explain the following common algorithms for selection of a free area of memory for creation of a partition:
(i) First fit
(ii) Best fit
(iii) Worst fit

(b) Write short notes on:
(i) Memory Compaction
(ii) Hierarchical Address Translation Table

5. (a) Explain the following 3 levels of device abstraction and disk storage addressing techniques which are commonly identifiable in implementation of the file management system :
(i) File Relative logical addressing
(ii) Volume Relative logical addressing
(iii) Drive Relative physical addressing

(b) Explain the Biometric authentication mechanism.

6 (a) Explain the Bus oriented systems and Multistage switch based system architectures for multiprocessor interconnections.

(b)Explain the Ricart and Agrawala�s algorithm for distributed processing.








Related pages

JUNE 2002

Question Paper of CS-12 - Computer Architecture of June 2002 from IGNOU Note : Question one is compulsory. Answer any three from the rest. 1. (i) Consider the execution of the following code segment. Use Bernstein's condition to detect the maximum parallelism embedded in this code. Justify the portion that .....

June 2002

Question Paper of CS-09 - Data Communication & Network of June 2002 from IGNOU 1 (i) A digital signalling system is required to operate at 9600 bps. If a signal element en codes 16 bit word, what is the minimum bandwidth required for this channel? (ii) Describe the various issues .....

June 2002

Question Paper of CS - 03 File Structure & Programming in COBOL of June 2002 from IGNOU Time : 2 Hours Maximum Marks : 60 1 (a) A library has two types of members : one is special and library staff and others are general members. The library keeps records of .....

June 2002

Question Paper of CS 51 - Operations Research of June 2002 from IGNOU Time: 2 hours Max. Marks: 75 Note: Question No 1 is compulsory. Attempt three more questions from questions numbered as 2 to 6. Note: There are 6 questions in this paper. Question 1 is compulsory and carries 35 marks. .....

TEE - Dec. 2002

Question Paper of CS-02 Introduction to Software of Dec 2002 from IGNOU Note: Question one is compulsory. Answer any three from the rest. 1. (a) Design an algorithm to multiply two matrices and verify the correctness by tracing. (b) Write a shell program to search for a number in the .....

TEE - Dec. 2002

Question Paper of CS-02 Introduction to Software of Dec 2002 from IGNOU Note: Question one is compulsory. Answer any three from the rest. 1. (a) Design an algorithm to multiply two matrices and verify the correctness by tracing. (b) Write a shell program to search for a number in the .....

December 2002

Question Paper of CS-13 - Operating Systems of December 2002 from IGNOU 1. (a) Write and explain one of the deadlock detection algorithms and evaluate its performance. (b) Explain the logic of Dekker�s solution to the mutual-exclusion problem and also discuss whether it is suitable to be implemented in a .....

JUNE 2002

Question Paper of CS-16 - Object-Oriented Systems of June 2002 from IGNOU Note : Question one is compulsory. Answer any three from the rest. 1.(a) Define the following terms with examples: (i) Exception Handling (ii) Derived Classes (iii) Header Files (iv) Data Abstraction (b) Design a Singly Linked List Class. The class should include .....

December 2002

Question Paper of CS-10 - Software Engineering of December 2002 from IGNOU Note: Question 1 is compulsory. Answer any three from the rest. 1. (a) Suppose we wish to design a PC based File Management System (FMS). A brief description of FMS is as follows: (25 marks) ABC is an .....

December 2002

Question Paper of CS-10 - Software Engineering of December 2002 from IGNOU Note: Question 1 is compulsory. Answer any three from the rest. 1. (a) Suppose we wish to design a PC based File Management System (FMS). A brief description of FMS is as follows: (25 marks) ABC is an organisation .....

Recently Visited Pages

Tell Us in Details What You Are Looking for
Your e-mail:


Subject:


Type verification image:
verification image, type it in the box

Message:

Latest Education Alerts
All Archive Section : Alerts News 1 2 3 4 CBSE Institutions 1 2 3 4  IGNOU Symbiosis Amity Delhi University Mumbai University Syllabus Scholarship  Bussiness Schools Results Study Abroad Career Forum Archives : 1 2 3 4 Disclaimer   About Us Site Design and SEO by : MAAS InfoMedia
Site best viewed in Opera and Google Chrome browsers with 1024x768 resolution. May not be best viewed in Internet Explorer.