DEC 1997

Comments off

Question Paper of CS-16 – Object-Oriented Systems of Dec 1997 from IGNOU

Note : Question one is compulsory. Answer any three from the rest.

1. (a) For each of the following systems, identify the relative importance of three aspects of modeling:

(i) Object modeling
(ii) Dynamic modeling
(iii) Functional modeling

Explain your answer
� Chess Player
� Remote Controlled Machine
� Electronic Typewriter
� Software to Mail Merge
� Telephone Answering Machine

(b) Design a linked list base class. Define all its possible methods and data structure. Through inheritance mechanism create one class namely Binary Search tree. Implement its data structure and important methods.

Observe the following while designing classes.
� Clearly indicate public and private class
� Use pointers to implement classes
� Design constructors in each class and explain its purpose
� Identify data structure and methods, which can be inherited
� Implementation should be in C++

(c) Design a template class for sorting.

2. (a) Draw an object diagram (using relationship instead of pointers) for interlibrary loan of books.

(b) Categorize the following relationship into generalization, aggregation or association. Beware there may be ternary or n-ary association in the list, so do not assume every relationship involving three or more object classes is a generalization. Defend your answer

(i) A country has a capital city
(ii) A dining philosopher is using a fork
(iii) A file is an ordinary file or a directory file
(iv) File contains records
(v) A person uses a computer language on a project
(vi) A route connects two cities
(vii) A student takes a course from a professor.

3. (a) Comment on the importance data persistence what are different approaches to providing persistent data services? (b) Discuss the features of parameterized classes, assertion constraints and garbage collection in Smalltalk, Clos, C++ and Eiffel object oriented programming languages.

4. (a) Many conventional data structures can be replaced with associations. Draw sample object diagrams in which each of the following conventional data structures is replaced by one or more associations. Keep your answers simple.
� Array
� List
� Stack
� Binary tree

(b) Draw OMT object model for participant’s registration system for a seminar.

5. (a) Discuss the efficiency of object oriented programming languages.

(b) Describe some situation in which strong typing would help you. Describe some circumstances in which strong typing would cause problems.

(c) Explain the concept of Packaging.

6 Write short notes on the following

(a) Identifying concurrency in a system
(b) Programming in the large
(c) Drawbacks of RDBMS

JUNE 1997

Comments off

Question Paper of CS-16 – Object-Oriented Systems of June 1997 from IGNOU

Note : Question one is compulsory. Answer any three from the rest.

1.
(a) Design a linked list base class. Implement all its possible methods and data structures. Through inheritance mechanism create two more subclasses namely stack and queue class. Implement its data structures and important methods.
Observe the following while designing classes:
� Clearly indicate public and private class
� Use pointers to implement classes
� Design constructors in each class and explain its purpose
� Identify data structures and methods which can be inherited
� Implementation should be in C++

(b) Use the above example to illustrate the main advantages offered as compared to conventional data type.

(c) Generalize your definition of stack to define it as a template class.

(d) Print out which statements in the following C++ code fragment violate the access control mechanism for
class X or class Y class X { private : int i; void pvt_X(); protected : int j; void prot_X(); public : int K; void pub_X(int, int); }; class Y : public X { char C; }; X x; Y y; x.i=10; x.K=15; y.prot_X(); y.pub_X(5, 10); };

2. (a) Describe the following concepts through examples:
(i) Generalization
(ii) Aggregation
(iii) Multiple inheritance
(iv) Metadata

(b) Prepare an object diagram for a graphical document editor that supports grouping which is a concept used in a variety of graphical editors. Assume that a document is composed of several sheets, each sheet contains drawing objects, including text, geometrical objects and graphs. A group must contain at least two drawing objects which can be a direct member of at most one group. Geometrical objects include circle, ellipse, rectangle, line and square.

3. (a) Explain the notion of in line and friend functions in C++ through example.

(b) In C++ what happens if a constructor or destructor assigns a value to the pointer this ? Explain what precautions must be taken when writing such a constructor to ensure that it can correctly initialize both free store and automatic objects.

(c) What is object identity? How is it supported in Smalltalk?

4. (a) C++ supports virtual destructor but not virtual instructors. Give an example to show the use of virtual destructor. Justify the absence of virtual constructors in C++.

(b) Why is the overhead associated with method dispatch (or action calls) in Smalltalk higher than C++?

(c) Give an example to explain the notion of virtual base class in C++. Illustrate what happens to your example when the base class is not declared as virtual ?

5. (a) Comment on the importance of data persistence. What are different approaches to providing persistent data services?

(b) Discuss important features of OODBMS( Object Oriented DBMS).

(c) Discuss the feature of parameterized class, assertion, constraints and garbage collection in Smalltalk, Clos and Eiffel object-oriented programming languages.

6. (a) Apply Booch’s methodology for Object Oriented Analysis and Design specification of Sales Office Automation.

(b) Discuss features of Shlaer and Mellor OOA and OOD method

December 2002

Comments off

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 multiprocessors system with shared memory.

(c) Describe Belady�s anomaly and provide an example that illustrates anomalous behaviors of FIFO.

2 (a) Compare and contrast implicit tasking and Explicit tasking of the processes. Also highlight the advantages of Explicit tasking.

(b) The identified disadvantages of semaphores are
(i)Semaphores are unstructured
(ii) Semaphores do not support data abstraction.

3 (a) Write short notes on the following:
(i) Two-phase locking
(ii) Wait-die and Wound-wait
(iii)Busy waiting

(b) Compare and contrast Remote Procedure Call (RPC) With Message passing in Distributed O/S environment.

4 (a) Explain the difference between internal fragmentation and external fragmentation. Which one occurs in paging system? Also, explain through a diagram, the principle of address translation in paging scheme.

(b) What are PAGE MAP TABLE (PMT), MEMORY MAP TABLE (MMT) and FILE MAP TABLE (FMT)? Explain how they are associated in the management of virtual memory.

5 (a) Explain why shared-bus multiprocessors are generally regarded as having limited scalability.

(b) State and discuss the differences in resource management requirements between Uniprocessor and Multiprocessor operating systems.

(c) What is disk caching? What are its advantages?

6 Wrote short notes on:
(i) Bell-LaPadula Model
(ii) Chaining and Indexing allocation strategies of disk space
(iii)Rivest, Shamir, Adelman (RSA) algorithm

Categories: CS-13 - Operating Systems Tags:

June, 2002

Comments off

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.

(c) 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.

Categories: CS-13 - Operating Systems Tags:

Dec, 2001

Comments off

Question Paper of CS-13 – Operating Systems of Dec 2001 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) Write an algorithm/program using the file system calls (open, creat, read, write, break, close, unlink) That determines the lenght of a file without using a loop in the code.

(b) Explain the following 3 primary forms of explicit interprocess interaction:
(1) Interprocess synchronization
(2) Interprocess signaling
(3) Interprocesscommunication.

Also discuss the need for Interprocess synchronization.

(c) What is Translation lookaside buffer (TLB)? Describe the functions of TLB in a paging system and also discuss the issues and operations involved in TLB management by the operating system.
2 (a) Explain how �threads� approch improves performance of operating system.

(b) �Any syncronization problem that can be solved with sempaphores can be solved with messages and vice versa�. Explain the reasoning you need to come up with your answer.

3 (a) Discuss the Multiprocessor classification based on Flynn�s caheme. Also mention the advantages of multiprocessor.

(b) Explain the merits and demerits of distributed processing.

4(a) Compare contiguous allocation and Non contiguous allocation with respect to following measures:
(i) Wasted memory
(ii) Time complexity
(iii) Memory Access overhead.

(b) Explain the role of file map table (FMT) in the management of virtual memory.

5 (a) Explain the following with respect to the Disk space management :
(1) Chaining
(2) Indexing.

(b) Explain the Saltzer and Schroeder�s general design principles for protection mechanisms.

6 Write short notes on:
(1) Artifact based Authentication
(2) Hyper cubes
(3) Remote procedure Calls
(4) Distributed shared memory.

Categories: CS-13 - Operating Systems Tags:

JUNE 2001

Comments off

Question Paper of CS-13 – Operating Systems of June 2001 from IGNOU

1. (i) Write an algorithm for bounded buffer producer/consumer problem using monitor. Also describe the problem and algorithm in detail.

(ii) Discuss in detail the distribution of control and the degree o functional specification of the individual processing elements in the three major classes of multiprocessor operating system.

(iii) A processor references five page A ,B,C,D and E in the following order :

A, B,C,D,A,E,B,C,E,D
Read more…

Categories: CS-13 - Operating Systems Tags:

JAN 2001

Comments off

Question Paper of CS-13 – Operating Systems of Jan 2001 from IGNOU

Time : 3 Hours
Max. Marks : 75

Note: Question 1 is compulsory.
Answer any three from the rest.

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 Read more…

Categories: CS-13 - Operating Systems Tags:

DEC 2000

Comments off

Question Paper of CS-13 – Operating Systems of Dec 2000 from IGNOU

Time : 3 Hours
Max. Marks : 75

Note: Question 1 is compulsory.
Answer any three from the rest.

1. (a) Write an algorithm that solves the readers/writers problem using monitors

(b) Devise an algorithm for Dead-lock detection, Discuss the operational aspects of this algorithm

(c) Discuss the common performance measures and optimization criteria that the schedulers use in attempting to maximize system performance. Read more…

Categories: CS-13 - Operating Systems Tags:

JUNE 2000

Comments off

Question Paper of CS-13 – Operating Systems of June 2000 from IGNOU

Time : 3 Hours
Max. Marks : 75

Note: Question 1 is compulsory.
Answer any three from the rest.

1. (a) Hierarchical directories are more complex to manage than flat files, but their advantages are considered to outweight their drawbacks by many system designers. Explain why.

(b) Design algorithms/functional specifications for the basic range of file-related system services given below :
(i) CREATE
(ii) SEEK
(iii) READ
(iv) WRITE

(c) Discuss the queuing implementation of Semaphores. The algorithm should be nearer to ‘C’ Language implementation Read more…

Categories: CS-13 - Operating Systems Tags:

DEC 1999

Comments off

Time : 3 Hours
Max. Marks : 75

Note: Question 1 is compulsory.
Answer any three from the rest.

1. (a) Given a set of cooperating process, some of which produce” data items (producers) to be “consumed” by others (consumers), with possible disparity between production and consumption rates. Devise a synchronization protocol that allows both producers and consumers to operate concurrently at their respective service rates in such a way that produced items are consumed in the exact order in which they are produced (FIFO). Read more…

Categories: IGNOU Tags:
Pages: Prev 1 2 3 4 5 6 7 8 9 10 ...57 58 59 Next