JUNE 1999

Comments off

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

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

1 (a). Explain First come, First served (FCFS) and Round Robin scheduling algorithms.

(b). Consider the following set of processes, with the length of the CPU burst time given in milliseconds:

Process Burst Time
P1 10
P2 29
P3 3
P4 7
P5 12 Read more…

Categories: CS-13 - Operating Systems Tags:

DEC 1998

Comments off

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 producer/consumers problem with a bounded buffer. How is it different from the unbounded buffer algorithm? Explain

(b) Explain the two primitive operations of a semaphore and implement the busy-wait implementation of them.

(c) Discuss a detailed step-by-step comparison of Lamport’s and Ricart 7 Agrawala’s algorithms for mutual exclusion Read more…

Categories: IGNOU Tags:

DEC 1997

Comments off

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

Time : 3 Hours
Max. Marks : 75

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

1.
(a) Assume that in the system shown in the following figure, Process p1 does not won a disk drive and it requests two disk drives simultaneously. Illustrate that situation by means of the general resource graph and use the deadlock detection algorithm to evaluate the resulting system state.

(b) Discuss whether each of the following programming techniques and program action is good or bad with regard to the degree pf locality of page reference it is likely to exhibit. Explain your reasoning and where applicable, state roughly the number of distinct loci of activity (hot spots) that you expect the execution to generate.

(i) Sequential processing of one dimensional array Read more…

Categories: CS-13 - Operating Systems Tags:

JUNE 1998

Comments off

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

Time : 3 Hours
Max. Marks : 75

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

1.
(a) Identify and discuss all operations and parameters that influence the effective memory access time in a virtual-memory system. Indicate the most significant changes that may be expected with future technological improvements, such as introduction of the secondary storage devices with access time one or more orders of magnitude faster than that of contemporary devices.

(b) A disk has 305 cylinders, four heads and 17 sectors of 512 bytes each per track. The disk is rotated at 3000 rpm and it has a moving head assembly with an average head positioning time of 30 ms. The peak date transfer rate that the drive can sustain is 4 mbps. Calculate the best and the worst case time needed to transfer 20 consecutive and 20 randomly distributed blocks (sectors)from such a disk. Indicate the dominant factors in determining the transfer times and the variability between the best case and the worst case figures.

(c) Give several reasons why the study of concurrency is appropriate in OS design Read more…

Categories: CS-13 - Operating Systems Tags:

June 2003

Comments off

Question Paper of CS-15 – RDBMS of June 2003 from IGNOU

1. a. A bank has many branches, the bank has many customers. A customer can open many different kinds of accounts with the bank. Any customer of the bank can take loan from the bank. All branches can give loans. Banks have also installed automatic teller machines, from which a customer can withdraw from his/her bank. Draw the ER Diagram for the bank specifying aggregation, generalization or specialization hierarchy, if any. Create 3NF tables of your design. Make suitable assumptions, if any (10)

b. Why is embedded SQL used? Describe an application that need embedded language. How are static embedded SQL different from dynamic embedded SQL? (5)

c. “Fourth Normal Form is dependency preserving and ensures lossless decomposition”. Justify or falsify the above statement giving reasons and examples. (5) Read more…

Categories: CS-15 - RDBMS Tags:

Dec-2002

Comments off

Question Paper of CS-15 – RDBMS of Dec 2002 from IGNOU

Note: there are six questions in this paper.
Question 1 is compulsory and carrier 30 marks.
Attempt any three from the rest.

1. (a) Draw an E-R diagram for conduct of examination by a university. The university has examination centers and student request/register for examination. The students are issued hall tickets. An examination center has many classrooms where examinations are conducted as per a defined schedule. Translate E-R model in the relational database which should be in 3NF.

(b) What are the weaknesses of SQL? Can a host language help SQL in overcoming these weaknesses? Justify your answer with the help of examples.

(c) �Redundancy is the backbone of reliability, therefore, a reliable database system should not attempt normalization beyond 3NF.� Comment on the above statement. Give reasons in support of or against the above statement. Use an example to justify your reasoning. Read more…

Categories: CS-15 - RDBMS Tags:

June, 2002

Comments off

Question Paper of CS-15 – RDBMS of June from IGNOU

Time: 3 hours
Maximum Marks : 75

Note: There are six question in this paper.
Question 1 is compulsory and carries 30 marks.
Attempt any three from the rest.

1.
(a)A department store consists of many item sections. A section is in charge. The store has three kinds of employees: accounts and billing; administrators; section maintainers. A request for purchase of items for the store is initiated by accounts and billing department which has the inventory details. Purchases are made by administration with proper quality checks from specified vendors. The section maintainers update the inventory placed at shelf�s. Draw the E-R diagram for the store specifying aggregation, generalization or specialization hierarchy, if any. Translate your E-R diagram to relation schema and the design the tables in 3NF.

(b)What is a host language? Why is it needed? What is the purchase of dynamic embedded SQL? Explain with the help of an example. Read more…

Categories: CS-15 - RDBMS Tags:

Dec 2001

Comments off

Question Paper of CS-15 – RDBMS of Dec 2001 from IGNOU

1.
(a) A university has many academic unit named schools. Each school is administered by a Head of School. The school has administrative and teaching staff. A school offers many courses. A course consists of many subjects A subject is taught to students who have registered for a subject in a class room by a teacher. Draw the necessary E-R diagram for the university specifying aggregation, generalization or specialization hierarchy if any. Create 3 NF table from your design.

(b) What is statically embedded SQL? How is it different to dynamically embedded SQL? What are the applications of embedded SQL? Read more…

Categories: CS-15 - RDBMS Tags:

DEC 1997

Comments off

Question Paper of CS-15 – RDBMS of Dec 1997 from IGNOU

Time : 3 hours
Max. Mark : 75

Note : There are six questions in this paper.
Question 1 us compulsory and carries 30 marks.
Attempt any three from the rest.

1.
(a) Draw an E-R diagram for a Hospital System. Convert this diagram to a suitable relational schema.

(b) Convert the following query in domain calculus to relational algebra, tuple calculus and English words {< A, B > | < A, B> BELONGS rel1 6B = ‘B1’ VB = ‘B2’} Read more…

Categories: CS-15 - RDBMS Tags:

June 2003

Comments off

Question Paper of CS 51 – Operations Research of June 2003 from IGNOU

1. a. Explain briefly any two of the following OR techniques: (6)
i. Linear Programming
ii. CPM
iii. M/< / ? queing model
iv. Dynamic Programming

b. Product Mix Problem: Give the Linear Programming formulation of the following problem:

The products A and B are produced in three machine centers X, Y and Z. Each product involves operation of each of the machine centers. The time required for each operation unit amount of each product is given below: Time available at machine centers X, Y and Z are 100, 77 and 80 hours respectively. The profit per unit of each of A and B is Rs. 12 and Rs. 3 respectively. (3) Read more…

Categories: CS 51 - Operations Research Tags: