LOADING

Questions

DIPLOMA ENGINEERING – SEMESTER – IV • EXAMINATION – WINTER 2016 -Winter-Nov-2016

Q-1(a)

Define: Decomposition, functional Dependency 

(2)
Q-1(b)

Define: Trivial dependency, Nontrivial dependency

(2)
Q-1(c)

What is normalization? List out various normal forms.

(2)
Q-1(d)

Define: Transaction, Concurrency control

(2)
Q-1(e)

Define: Schedule, Serializable Schedule

(2)
Q-1(f)

Write full form: DCL, TCL

(2)
Q-1(g)

Define: View, Index

(2)
Q-1(h)

Define: Sequences, Synonyms

(2)
Q-1(i)

Define: Function, Procedures

(2)
Q-1(j)

Define: Packages, Triggers

(2)
Q-2(a)

Explain lossy join decomposition with example.

(3)

OR

Explain lossless join decomposition with example.

Q-2(b)

Explain dependency preserving decomposition with example.

(3)

OR

Write algorithm to find redundant functional dependency.

Q-2(c)

Write short note: functional dependency

(4)

OR
Explain full functional dependency with example.

Q-2(d)

Write short note: 1NF

(4)

OR
Write short note: Armstrong’s Axioms for functional dependency.

Q-3(a)

 Explain COMMIT command.

(3)

OR

Explain ROLLBACK & SAVEPOINT command.

Q-3(b)

Explain GRANT command by example.

(3)

OR
Explain REVOKE command by example.

Q-3(c)

Write short note: 2 NF

(4)

OR

Write short note: 2 PL

Q-3(d)

Write short note: 3NF

(4)

OR
What is deadlock? How to control deadlock.

Q-4(a)

Write short note: Implicit locks

(3)

OR
Write short note: Explicit locks

Q-4(b)

Explain advantages of view with example.

(4)

OR

How sequence can be created explain by example.

Q-4(c)

Write PL/SQL program to reverse a given string.

(7)
Q-5(a)

How to handle named exception explain by example.

(4)
Q-5(b)

Write short note: Parameterized cursor

(4)
Q-5(c)

Write short note: PL/SQL data types

(3)
Q-5(d)

Explain GOTO statement by example.

(3)