How To Exam?

a knowledge trading engine...


Anna University Chennai 2005 B.E Computer Science DATABASE MANAGEMENT SYSTEMS - Question Paper

Monday, 25 February 2013 02:30Web

Code: C-14 / T-11 Subject: DATABASE MANAGEMENT SYSTEMS
Time: three Hours Max. Marks: 100
NOTE: There are 11 ques. in all.
ques. one is compulsory and carries 16 marks. ans to Q. 1. must be written in the space given for it in the ans book supplied and nowhere else.
ans any 3 ques. every from Part I and Part II. every of these ques. carries 14 marks.
Any needed data not explicitly given, may be suitably presumed and said
Q.1 Choose the accurate or best option in the following: (2 x 8)
a. Which of the subsequent relational algebra operations do not require the participating tables to be union-compatible?

(A) Union (B) Intersection
(C) Difference (D) Join
b. Which of the subsequent is not a property of transactions?
(A) Atomicity (B) Concurrency
(C) Isolation (D) Durability
c. Relational Algebra does not have
(A) Selection operator. (B) Projection operator.
(C) Aggregation operators. (D) Division operator.
d. Checkpoints are a part of
(A) Recovery measures. (B) Security measures.
(C) Concurrency measures. (D) Authorization measures.
e. Tree structures are used to store data in
(A) Network model. (B) Relational model.
(C) Hierarchical model. (D) File based system.
PART I
ans any 3 ques.. every ques. carries 14 marks.
Q.2 a. Briefly explain the various layers of ANSI SPARC architecture. describe physical and logical data independence. How does this architecture help in achieving these? (7)

b. Describe the storage structure of indexed sequential files and their access method. (7)

Q.3 a. Define the terms entity, attribute, role and relationship ranging from the entities, giving examples for every of them. (4)

b. Map the subsequent ER diagram to a relational database. provide the relation names and attributes in them. Also mention the primary key and foreign keys if any for every table. (10)


Q.4 a. What are the 3 data anomalies that are likely to occur as a outcome of data redundancy? Can data redundancy be completely eliminated in database approach? Why or why not? (5)

b. Given the dependency diagram shown in the subsequent figure, (the primary key attributes are underlined)

(i) Identify and explain every of the indicated dependencies.
(ii) Create a database whose tables are atleast in 3NF, showing dependency



( 0 Votes )

Add comment


Security code
Refresh

Earning:   Approval pending.
You are here: PAPER Anna University Chennai 2005 B.E Computer Science DATABASE MANAGEMENT SYSTEMS - Question Paper