;;.iif' Paper ID[ C 8305]

2
"'"'" - -- --- Roll No. ",,,,,,""'''''''''' [Total No. of Pages : 02 Total No. of Questions: 09] ID[ C . 8305] ;;.iif' Paper (Please fill this Pllper ID in OMJ!.Sheet) B_Tech.. (Sem. - 5th) DATABASE MANAGEMENT SYSTEM (CS - 305) Maximum Marks: 60 Time: 03 Hours Instruction to Candidates: 1) 2) 3) Ql) a) b) c) d) e) 1) g) h) " i) j) Section - A is Compulsory. Attemptany Four questionsfrom Section -B. Attempt any Two questions f~om Section - C'. MAY 200a Section..: A (lox2=20) What is physical data indepe~dence? What do you mean by data redundancy? What are single-valued and multivalued attributes? What is statistical database security? What do you mean'by database schema? Define the term data manipulation language. What do you mean by the term deadlock? What are graphical user interfaces? What do you understand by a distributed database? What is serializability of schedules? MAY 2UO' Section - B (4 x 5 = 20) Q2) D~aw an ER diagram for a library management system, make suitable assumptions. Q3) Explain the difference between physical and logical data independence. I Q4) Define the concept of aggregation. Give two examples of where this concept . is useful. R-I06 [2058J P.T.O. ~ "

Transcript of ;;.iif' Paper ID[ C 8305]

Page 1: ;;.iif' Paper ID[ C 8305]

"'"'"- -- ---

Roll No. ",,,,,,""''''''''''[Total No. of Pages : 02

Total No. of Questions: 09]

ID[ C. 8305];;.iif' Paper(Please fill this Pllper ID in OMJ!.Sheet)

B_Tech.. (Sem. - 5th)

DATABASE MANAGEMENT SYSTEM (CS - 305)

Maximum Marks: 60Time: 03 Hours

Instruction to Candidates:

1)

2)

3)

Ql)a)

b)c)

d)

e)

1)

g)

h)" i)

j)

Section - A is Compulsory.

Attemptany Four questionsfrom Section-B.Attempt any Two questions f~om Section - C'.

MAY 200a

Section..: A(lox2=20)

What is physical data indepe~dence?

What do you mean by data redundancy?What are single-valued and multivalued attributes?What is statistical database security?

What do you mean'by database schema?Define the term data manipulation language.

What do you mean by the term deadlock?

What are graphical user interfaces?

What do you understand by a distributed database?What is serializability of schedules?

MAY 2UO'

Section -B

(4 x 5 =20)

Q2) D~aw an ER diagram for a library management system, make suitableassumptions.

Q3) Explain the difference between physical and logical data independence.I

Q4) Define the concept of aggregation. Give two examples of where this concept. isuseful.

R-I06 [2058JP.T.O.

~"

Page 2: ;;.iif' Paper ID[ C 8305]

.L

Q5) Describe the differences in meaning between the terms relation and relationschema with the help of suitable examples. ~

Q6) Compare the shadow-paging recovery scheme with log-based recoveryschemes. .

Section - C

(2 x 10 ~ 20)Q7) (a) Explain the distinctions among the terms primary key, candidate key and

superkey.

(b) What is normalization? Discuss various ormal f°.rms with the help ofexamples."

Q8) (a) Discuss the basic operations that.can performed using relational algebraand SQL.

(b) Consider the following employee database, where the primary keys areunderlined.

Employee (employee-name. street, city)

Works (employee-name. company-name, salary)

Company (company-name. city)

Nlanagers (employee-name. manager-name)

Give an expression in SQL for each of the following queries.

ti) Find the names of all employees who work for First BankCorporation and live in Las Vegas.

(ii) Find the names, street addresse.s and ci.ties of residences of allemployees who work for First Bank Corporation and earn morethan $10000.

(iii) Find all employees who do not work for First Bank Corporation.

(iv) Find the company that has the smallest payroll.

(v) Find all employees iI).the database who do not live in the samecities and on the same .streets as do their managers.

Q9) Write short notes on the following:(a) MultipleGranularity.(b) Transaction Processing Systems.(c) Advantages of DBMS.

R-I06

@@@@

2

.