1.

Which are the additional concepts used in the EER model?

a. Specialization.
2.
a.
3.

c. Categorization

d. All of these.

Whenever two independent one-to-many relationships exist in the same relation,

Single valued FD.
b Multi valued FD.
c Trivial FD.
d. Transitive FD.

exists.

Which of the following is true?

a. AUB . BUA
4.

5.

b. A(BC) (AB)C c. A-B B-Ad. none of these.

.In E-R representation the location attribute for the entity DEPARTMENT is represented by two
ellipses within one another. This indicates location is a-

a. Complex attribute

6.

b. Generalization.

b. Composite attribute

c. Multi valued attribute d. Derived attribute

Regarding a weak entity which of the following is true?

a.Double rectangular boxes. b. Full participation constraint. c. Partial key d. all of these
Ais resolved in a top-to-bottom fashion.
a.Nested subquery
b. Correlated subquery c. Parallel suubquery

d. all of the above.

7. Which of the following is the fraction of records satisfying an equality condition?

a. Sensitivity.
b. Skew factor.
c. Selection cardinality. d. Blocking factor.
8. Which of the following is an example of NOREDO/UNDO algorithm?
a. Deferred update b. Immediate update c Shadow pagoing
d. Write Ahead Logging.
9. What kind of transparencies a distributed data base system should have?
a. Net work transparency
b. Fragmentation transparency c. Data independence d. all of the above.
10. Which of the following is not an internet addressing protocol.
a. IP address
b. Domain Name c. URL d. HTTP.
11. Two operations in a schedule are said to be conflicting if a. They are from two different relations
b. One is read operation and the other is a write operation.
c. They access the same data item
d. All of the above
12. Which of these can handle complex data types, has well structured query language and offers good
performance:.
a. RDBMS
b. OODBMS
c. ORDBMS
d. None of these
13. Collection type includes
a. Nested relations b. Multi sets . c. Arrays .
d. All of these.
14. Which key word in the GRANT command gives the granted privileges to all the valid users of the
DBMS?
a. ALL
b. FULL c. PUBLIC d. None of these
15. With Repeatable Read isolation level in SQL the following violations are alloweda. Dirty Read.
b. Non Repeatable Read.
c. Phantom
d. All of these
.
16. The required property of a transactiona.Atomicity b. Consistency c, Durability d .Isolation e. All of these
17. As per Thomas WRITE Rule the following stipulations hold:

a.
b.
c.
d.

If TS(Ti) < R-TimeStamp(Q) Rollback Ti

If TS(Ti) < W-TimeStamp(Q) ignore Write operation
If TS(Ti) > R-TimeStamp(Q) and If TS(Ti) > W-TimeStamp(Q)
Execute Write operation and set W-TimeStamp(Q) to TS(Ti)
All of the above

18. Which of the following commands is equivalent to omitting the ON DELETE/UPDATE clause entirely
in the foreign key definition.
a. SET NULL b. SET DEFAULT c. NO ACTION d. CASCADE
19 Which of the following operations require the participating relations to be Union compatible?
a.INTERSECTION b.DIFFERENCE c. UNION
d. All of these
20.Which of the following aggregate functions does not ignore nulls?
a. COUNT b .COUNT(*) c. MAX d.
MIN

PART B (10x2=20 marks)

21. We have two relations R1 and R2. The result of R1 R2 will be
R1

R2

SNO
PNO
S1
P1
S1
P2
S1
P3
S2
S2
S3

PNO
P1
P2
P3
P1
P2
P3

a. .S1,S2,S3

b. S1

c. S1,P1;S1,P2,S1,P3

d.. None of these

22. Consider the two relations EMPLOYEE, DEPARTMENT. If EmpId and Dnumber are PRIMARY
KEYS and SUPERId and Dno are FOREIGN KRYS, find out anamaly, if any in EMPLOYEE table.
EMPLOYEE
EmpID Name
E1
Ramu
E2
Somu
E4
Ravi
E5
Sara
Null
Mala

a.
c.

DEPARTMENT
SuperId
Null
E1
E2
E3
E3

DNumber
D1
D2
D3

Row1 Column 3 cannot be null

Row5 Column 1cannot be null
23.

<T0
< T0,
<T0,
< T0,
< T1

Dno
1
1
Null
3
3

Dname
CSE
ECE
MECH

b.
d.

Row3 Column 4cannot be null

All of the above

Consider the log entries corresponding to the execution of two transactions T0 and
T1-

STARTt>
A, 1000, 950>
B, 2000, 250>
COMMIT>
START>

< T1 , C, 600,700>
If the system crashes at this point,
datasbase modification scheme area. UNDO T1, UNDO T0
b. UNDO T1, REDO T0
c. REDO T0, UNDO T1
d. REDO T0, REDO T1
23. Is

the appropriate recovery operations with Immediate

the following schedule conflict serializable? If so find the equivalent serial schedule:
T1
r(Q)

T2

T3
r(Q)

w(Q)
r(Q)
w(Q)
a. NO
b. YES; T1,T2,T3
c. YES;T1,T3,T2
d. YES;T2,T1,T3.
24. The following schedule is an example of a
T1
r(Q)

T2

schedule.

T3

w(Q)
w(Q)
w(Q)
a. serial

b. conflict serializable

c. view serializable

d. None of these

25. Consider relation DPC .If we decompose the relation into two relations. DP and PC and join them
together we getDeale
r
D1
D1
D1
D2

Parts

Customer

P1
P1
P2
P1

C1
C2
C1
C1
a.
b.

original relation DPC

.Missing record: D2,P1,C1

c.
d.

Extra record:D2,P1,C2
None of these

26. Which is the relational algebraic equivalent of SQL query: SELECT * FROM R where
A = C;
c. A=C(R(A,B,C))
d. (a,B,C)(A =C)
e. A=C(R(A,B,C))
f. None of these
27. ARIES recovery scheme includes operations involving a. Analysis Pass.
b. Redo Pass
c. Undo Pass.
d. All of the above.
28.
Given R is a single column relation TEACHER and S is a single column relation STUDENT the list
of students who are not teachers is obtained by

a.

RS

b. S - R

c. R S

d. R U S

29. If the number of records and the number of blocks of the two relations CUSTOMER and DEPOSITOR
are respectively 10,000, 400 and 5000, 100, with Bock Nested Loop Join the number of block accesses
in the worst case will bea. 2,000,100
b. 40,100
c. 500
d. 5400
.
30.Asingle processor system takes on an average 10 msec to process a short query.With two identical
processors working in inter query processing mode average time to process a single query and throughput will
approximately be a. 10 msec; 100 queries/sec
b. 10 msec; 200 queries/sec
c. 5msec;
200 queries/sec
d. 5msec;
100queries/sec
PART C (6x10=60 marks)

31. Describe the three schema architecture of a DBMS and explain how it helps to achieve data
independence.
32. Illustrate with examples various techniques used for query optimization..
33. What is a transaction? What is a schedule? Distinguish between serial, non- serial and serializable
schedules. Illustrate with examples the conflicting operations in a schedule.
34. What is the condition for a schedule to be recoverable? Explain and illustrate with examples
recoverable ,casecadeless and non recoverable schedules.
35. Describe the architecture of distributed databases. What are fragments? What is the need for
fragmentation? Explain horizontal, vertical and hybrid fragments with examples.
36. Consider the relation R= {A, B, C, D, E, F , G, H, I} and a set of functional dependencies:
(i)
(A,B) -> D;
(ii)
A-> D,E;
(iii)
B->F;
(iv)
F->G,H;
(v)
D->I,J
What is the key for the relation R? Decompose R into 2NF and 3 NF relations.