Wednesday, October 28, 2009

IF 254 — DATA BASE MANAGEMENT SYSTEMS

PART A — (10 x 2 = 20 marks)

1. List different data models.

2. What is the difference between logical data independence and physical data

independence?

3. Define the following terms :(a) Granting a privilege(b) Revoking a privilege.

4. Define Boyce–Codd normal norm. How does it differ from 3NF?

5. What are the additional functions of distributed databases?

6. Why is concurrency control needed? Give an example.

7. What is transaction time relation?

8. What are the insertion options available in CODASYL (network model)?

9. Define the terms OLAP (Online Analytical Processing) and OLTP (Online Transaction

Processing).

10. What are the types available for access to databases on the World Wide Web?

PART B — (5 x 16 = 80 marks)

11. (i) Consider the following relational database :employee (employee¬_name, street,

city)works (employee_name, company_name, salary)company (company_name,

city)manages (employee_name, manager_name)Each of the following queries given an

expression in a relational algebra :(1) Find the names of all employees who work for First

Bank Corporation.

(2) Find the names, address and cities of resistance of all employees.

(3) Find the names of all employees in the data base who do not workfor First Bank

Corporation.(4) Give all managers a 10 per cent salary raise.

(5) Delete all tuples in the works relation for employees of Small Bank Corporation. (10)

(ii) What are factors that influence physical database design in relational databases? (6)

12. (a) (i) Define primary key, super key and candidate key. (5)

(ii) Write any five naming conversions used for ER schema diagram. (5)

(iii) Discuss the various type of join operation in relational database. (6)

Or

(b) (i) Discuss about the operations performed on files. (8)

(ii) What is a functional dependency? Explain minimal set of functional dependencies? (8)

13. (a) (i) What are the cost components to be taken for query execution? (5)

(ii) How is select operation done in query processing? (7)

(iii) What is heuristic in query optimization? (4)

Or


(b) (i) Discuss the internal and external hashing. (5)

(ii) Write algorithm procedures for the following : (8)

(1) Collision resolution in internal hashing.

(2) Search in linear hashing.

(iii) What are the types available in ordered indices and explain? (3)

14. (a) (i) Explain briefly about parallel join and parallel sort. (8)

(ii) Discuss about data manipulation and data definition in hierarchical model. (8)

Or

(b) (i) The following is the company database :Employee : Name, Emp¬_No., Salary,

Dept_No, Supervisor Emp_No.Department : Dept_name, Dept_No, total_salary, manager

Emp_No. Write an active rules to find the total salary. (8)

(ii) Explain the multimedia data types and its application. (8)

15. (a) (i) What is the difference between persistence and transient objects? How is

persistence handled in typical object oriented database systems? (6)

(ii) Discuss the concept of polymorphism. (6)

(iii) Compare object oriented and object relational databases. (4)

Or

(b) (i) Describe the association rule among hierarchies with a suitable example. (5)

(ii) What are the classification rules? How is regression related to classification? (6)

(iii) What are the main features of commercial available data mining tools? (5)


Click the link to download:
http://www.ziddu.com/download/7201255/dbms.pdf.html

IF 254 -DATA BASE MANAGEMENT SYSTEM

PART A — (10 * 2 = 20 marks)

1. Define Data Base Management System.

2. Name the different types of attributes that occur in the ER model.

3. What is the difference between a key and a superkey?

4. Explain functional dependency.

5. Mention the advantages of Distributed DBMS.

6. What is a fully inverted file and indexed sequential file?

7. What is a set type? How are the set instances of a set type identified?

8. What is an occurrence tree of a hierarchy?

9. Define Object oriented database.

10. Mention some applications of data mining.

PART B — (5 * 16 = 80 marks)

11. (i) List the operations of the relational algebra and explain with suitable examples.

(10)

(ii) Discuss the various types of constraints that can be specified on a relational data base

schema. (6)

12. (a) (i) Draw the three schema architecture of data base systems and explain in detail.

(10)

(ii) Compare logical data independence and physical data independence. (6)

Or

(b) (i) Explain nested queries with suitable examples. (9)

(ii) Discuss the substring comparisons, arithmetic operators and ordering features of SQL.

(7)

13. (a) Discuss the process of normalization used in designing a data base system. Explain

the various normal forms for relation schemas.

Or

(b) Discuss the following two types of hashing techniques that allow dynamic file

expansion :(i) Dynamic hashing. (8)

(ii) Extendible hashing. (8)

14. (a) What are the different types of ordered indexes for the files? Explain any two

types in detail giving the block diagrams that explain the indexing structure.

Or

(b) (i) Using an example data base schema, explain the data definition in the network

model. (10)


(ii) How a conceptual data base design specified as an ER schema can be mapped to a

network schema? (6)

15. (a) Explain the following with respect to a Hierarchical data base model :

(i) Data base structure

(ii) Virtual Parent–child relationships

(iii) Integrity constraints

(iv) Data Definition Language. (4 * 4 = 16)

Or

(b) Write detailed note on the following :

(i) Data warehousing and data mining. (8)

(ii) Temporal data bases and multimedia data bases. (8)


Click the following link to download:
http://www.ziddu.com/download/7201277/dbms1.pdf.html

;;