UGC NET Computer Science Database Management Systems Previous Year Questions (PYQs)

UGC NET Computer Science Database Management Systems Previous Year Questions (PYQs)

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations
logo

Consider relation R(A, B, C, D, E) with the following functional dependencies:
C → F, E → A, EC → D, A → B. 
Which of the following is a key for R?

1
2
3
4

logo

Consider the following three relations:

Employee(eid, eName), Comp(cid, cName), Own(eid, cid).
Which of the following relational algebra expressions return the set of eids who own all brands?

(1) π_eid( π_eid,cid(Own) ÷ π_cid(Comp) )
(2) π_eid( π_eid(Own) × π_cid(Comp) )
(3) π_eid( π_eid,cid(Own) × π_cid(Comp) )
(4) π_eid( π_eid(Own) × (π_cid,cName(Own) ÷ π_cid(Comp)) )

1
2
3
4

logo

In a relational database, which one of the following is CORRECT:

1
2
3
4

logo

Consider T1(A,B,C,D,E) with FDs { EB→C, D→E, EA→B } and T2(A,B,C,D) with FDs { C→A, A→B, A→D }. Which is TRUE?

1
2
3
4

logo

Considering the following statements:
A. A non-serial schedule is said to be conflict-serializable, if it is conflict-equivalent to some serial schedule.
B. A non-serial schedule is said to be view serializable if it is view-equivalent to some serial schedule.
C. A schedule is said to be serial, if instructions of participating transactions are chronologically interleaved with each other.
D. A conflict-serializable schedule will be view-serializable also but vice-versa may not be true.

1
2
3
4

UGC NET Computer Science


Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

UGC NET Computer Science


Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Ask Your Question or Put Your Review.

loading...