BACHELOR IN COMPUTER APPLICATIONS
Term-End Examination
December, 1999CS-06:DATABASE MANAGEMENT SYSTEM
Term-End Examination
December, 1999CS-06:DATABASE MANAGEMENT SYSTEM
Time : 3 Hours
Max. Marks : 75
Note : Question one is compulsory. Answer any three from the rest.
Q.1(a). Construct an E-R diagram for a car insurance company that has a set of customers, each of whom owns one or more cars. Each car has associated with it zero or any number of accidents.
(b)Consider the Relational database
Employee (empname, street, city)
Works (empname, companyname, salary)
Company (companyname, city)
Manages (empname, managerjname)
Give expressions in SQL for the following:
(i) Find the names of all employees who work for First Bank Corporation
(ii) Find all employees in the database who live in the same cities as the companies for which they work.
(iii) Find all employees in the database who earn more than every employee of small Bank Corporation.
(iv) Find the names, street address and cities of residence of all employees who work for First Bank Corporation and earn more $10000.
(v) Find all employees in the databases who live in the same cities and on the same street as do their managers.
(c) Define 2NF and 3NF. Produce 3NF table structures from the table below
Enrol No. Sname Dept. Year Block Name
1024 Mathews Physics 1 G
1126 John Chemistry 1 G
1016 Bill Mathematics 2 K
1420 James Botany 2 K
1503 Charles Geology 3 L
1001 Dickens Zoology 4 M
Second Normal Form (2NF)
Q.2(a). Is it possible in general to have two primary indices on the same relation for different search keys? Explain your answer.
(b)Explain the distinction between open and closed hashing. Discuss the relative merits of each technique in database applications.
Q3(a). Compare and contrast BCNF and 3NF. Show that if a relation scheme is BCNF, then it is also in
(b) List the three design goals of relational databases and explain why each desired
Q.4(a), Discuss the design issues related to distributed database through an example,
(b) Explain the trade offs in distributing the database
Q.5(a). What are the techniques available for the knowledge representation? Explain them briefly through an example.
(b) What is the difference between declarative and procedural knowledge?
Q.6(a). Describe various Relational operators that are used in Relational Algebra, perform Union, Difference, Intersection and Cartesian Product for the following relations.
(b)Write short notes on Client-Server approach.
Posted in: 1999,CS-06,IV SEMESTER
0 comments:
Post a Comment