Page Loading... Please wait...
Wait

IGNOU MCA IGNOU BCA IGNOU MBA IGNOU CIC Courses

June, 2002

Filed under:

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.

©ï¿½Practically, one must decompose the tables only till 3NF as it is loss less, dependency preserving decomposition.� Comment on the above statement. Give example in support of your answer. How is 3NF different from BCNF?

(d)A bank has a client-server database for account withdrawal. What are the concurrency related problems that may occur? How can these problems be resolved? (e)Assuming that you are the data security administrator of a public sector bank, what are the different security and privacy measures that you will propose for its customer�s data.

2.
(a)A relation R (A, B, C, D, E, F, G, H) has the following set of functional dependency:
Is the decomposition of R in R1 (A, D, E, H), R2 (A, C), R3 (B, F, G) R4 (A, G) loss less and dependency preserving decomposition? Justify your answer.

(b)What is serialisability of transactions schedule? Describe with the help of an example. Does non-serialisable schedule result in concurrency related problems? Justify your answer.

©What is checkpoint? Why is it needed? What are the actions which are taken by DBMS at a checkpoint? Explain with the help of an example.

3.
(a)What is 5NF? How is it related to JOIN dependency? Explain with the help of an example.

(b)How will you recover from storage media failure such as on-line hard disk on which your database is stored? Discuss with the help of an example.

©What are statistical databases? What are the additional security/privacy concerns for statistical databases?

4.
(a)Why does deadlock occur in concurrent execution of transaction where locking scheme is followed? How can you detect deadlock in database system? How is the problem of deadlock resolved? Explain with the help of an example.

(b)What is a view in databases? How can views be used in implementing security of data in database systems? Can views be used for updation of data? Justify your answer. How can views be used in implementing concepts of data independence? Explain with the help of an example.

©Consider the following Join operation :

Assuming that A, B and C are the primary keys to relations R1, R2 and R3 respectively and all the relations are stored on their primary keys, find the total number of block transfers needed for the join operation. Please not the following:

Size of R1 = 1000 tuples
Size of R2 = 2000 tuples
Size of R3 = 3000 tuples
Records per block for R1, R2 and R3 : 100 records/block

Total number of memory buffers available = 10 nos.

5.
(a)What is time stamping? Explain a mechanism of concurrency control that uses time stamping with the help of an example.

(b)What is intention mode locking? Describe the various intention mode locks with the help of an example.

©What are the basic steps which DBMS might follow for query optimization? Describe with the help of an example.

6.
Describe the following terms in the context of distributed database management system and/or relational database management system with the help on an example (wherever needed).

(a)Deadlock detection in distributed database system

(b)Two phase commit protocol in distributed database system

©Data integrity in database systems

(d)ODBC

(e)Client-Server Databases

Related pages

June, 2002

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 .....

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-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 - 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 .....

June 2001

Question Paper of CS 08 Numerical & Statistical Computing of June 2001 from IGNOU Time: 2 hours Max. Marks: 75 Note: Note: Calculator is allowed in this examination. Question number 1 is compulsory. Attempt any three more questions from questions numbered 2 to 6. 1. a. Write, which of the following variable names, .....

Recently Visited Pages

  • Post Graduate Certificate in Copy-editing and Proof-reading
    Post Graduate Certificate in Copy-editing and Proof-reading (.....)
  • CS-69 TCP/IP Programming
    CS-69 TCP/IP Programming TCP-block-1 TCP-block-2 TCP-block-3 We will updated this pages soon.. (.....)
  • MS-97 International Business
    Syllabus of MS-97 International Business From IGNOU MS-97 International Business (.....)
  • JUNE 2001
    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. (.....)
  • IGNOU - ARMY Recognized Regional Centres - CHANDIMANDIR
    IGNOU - ARMY Recognized Regional Centres - CHANDIMANDIR Code - 52 COL. R.S KHATRI REGIONAL DIRECTOR IGNOU - ARMY RECOG. REGIONAL CENTRE COL. EDUCATION HQ WESTERN COMMAND CHANDIMANDIR HARYANA Phone: 0172-862199 / 866190 (.....)
  • MCA : CS - 08 PROJECT and Statistical Computing
    MCA : CS - 08 PROJECT and Statistical Computing Course Code : CS-08 Course Title : Numerical and Statistical Computing Assignment Number : MCA(3)-08/Project/2005 Maximum Marks : 15 Last Date of Submission : 30th April, 2005 This (.....)
  • MS-53 Production/Operations Management
    Syllabus of MS-53 Production/Operations Management From IGNOU MS-53 Production/Operations Management (.....)
  • IGNOU Regional Centres -Chennai
    IGNOU Regional Centres -Chennai Region Code - 25 Dr. (Mrs) K. Soundravalli Regional Director IGNOU Regional Centre C.I.T. Campus Taramani Chennai- 600 113 Tamil Nadu. Ph.Off 044-22541919 / 22542727 / 22542525 Fax 044-22542828 Email ignourcc@md3.vsnl.net.in soundri@hotmail.com soundri33@yahoo.com Operational (.....)
  • JUNE 1997
    Question Paper of CS-54 - Finance & Accounting On Computers of June 1997 from IGNOU Note : There are 6 questions in the paper. (.....)
  • DEC 2001
    Question Paper of CS-54 - Finance & Accounting On Computers of Dec 2001 from IGNOU Note : There are 6 questions in the paper. Question no. (.....)
  • Ahmedabad Study Centre – Rajkot
    Ahmedabad Study Centre – Rajkot SC CODE - 0928 - R NAME & ADDRESS OF THE IGNOU STUDY CENTRE DR. SANDHYA SUBRAMANIAM COORDINATOR, IGNOU RECOG STUDY CENTRE N.I.M.I.T., C/O PARAG (.....)
  • DEC 2000
    Question Paper of CS-12 - Computer Architecture of Dec 2000 from IGNOU Note : Question one is compulsory. Answer any three from the rest. 1. (.....)
  • June 2001
    Question Paper of CS 51 - Operations Research of June 2001 from IGNOU Time: 2 hours Max. Marks: 75 Note: Question No 1 is compulsory. Attempt (.....)
  • Bangalore Study Centre – Comba
    Bangalore Study Centre – Comba SC CODE - 0801 NAME & ADDRESS OF THE IGNOU STUDY CENTRE DR. I. BHANU MURTHY COORDINATOR, IGNOU STUDY CENTRE SH. DAMODAR COLL. OF COM (.....)
  • MCA CS-54 PROJECT Accounting and Finance on Computers
    MCA CS-54 PROJECT Accounting and Finance on Computers Course Code : CS-54 Course Title : Accounting and Finance on Computers Assignment Number : MCA(4)-54/Project/04 Maximum Marks : 15 Last Date of Submission : 30th October, 2004 This is a Project Assignment. (.....)