Prep Hub

Databases MCQs – Set 28

Databases MCQs – Set 28

UGC NET Paper 2 Computer Science DEC 2014 – Databases


541. To convert weak entity set into strong in ER diagram, use ___.

Databases • ER modeling • UGC NET Paper 2 Computer Science DEC 2014


542. Which is true? I. Self-join via alias. II. Outer-join basic RA op. III. Natural and outer join equivalent.

Databases • Joins • UGC NET Paper 2 Computer Science DEC 2014


543. Minimal key for R(A,B,C,D,E) with F={A→B,B→C,AC→D}?

Databases • Keys • UGC NET Paper 2 Computer Science DEC 2014


544. Best normal form of R(A,B,C,D) with F={AB→C,AB→D,C→A,D→B,AE→C}?

Databases • Normalization • UGC NET Paper 2 Computer Science DEC 2014


545. Division in RA handles queries like ___.

Databases • Relational algebra • UGC NET Paper 2 Computer Science DEC 2014


546. Which scheduling algorithm ensures both serializability and freedom from deadlock in s?

Databases • Concurrency Control • UGC NET Paper 2 Computer Science DEC 2014


547. Hiding manager’s salary from employee is ___.

Databases • DB Architecture • UGC NET Paper 2 Computer Science DEC 2014


548. SET stands for ___.

Databases • E-Commerce • UGC NET Paper 2 Computer Science DEC 2014


549. In ER modeling, a specialization lattice allows an entity to participate in:

Databases • ER Modeling: Specialization • UGC NET Paper 2 Computer Science DEC 2014


550. A clustering index is created when ___.

Databases • Indexing • UGC NET Paper 2 Computer Science DEC 2014


551. For R={A,B,C,D,E,F} with C→F,E→A,EC→D,A→B, a key is ___.

Databases • Keys • UGC NET Paper 2 Computer Science DEC 2014


552. Which statement is false?

Databases • Normalization • UGC NET Paper 2 Computer Science DEC 2014


553. Given Book(Title,Author,Cno,Pub,Year,Price) and Collection(Title,Author,Cno) with FDs Title,Author→Cno; Cno→Title,Author,Pub,Year; Pub,Title,Year→Price and key=(Author,Title), these schemas are in:

Databases • Normalization: 3NF vs BCNF • UGC NET Paper 2 Computer Science DEC 2014


554. R={S,T,U,V} with S→T, T→U, U→V, V→S (cycle). Any nontrivial decomposition R₁∩R₂=∅ yields a schema in:

Databases • Normalization: Cyclic FDs • UGC NET Paper 2 Computer Science DEC 2014


555. Match SQL: a=DDL,b=DML,c=TCL,d=Binary Op codes below.

Databases • SQL • UGC NET Paper 2 Computer Science DEC 2014


556. Subject-oriented, integrated, time-variant, nonvolatile data collection is?

Databases • Data Warehousing • UGC NET Paper 2 Computer Science DEC 2014


557. Global conceptual Schema completeness condition requires:

Databases • Distributed DBMS • UGC NET Paper 2 Computer Science DEC 2014


558. Which relationship sets can’t match the E-R diagram?

Databases • ER Modeling • UGC NET Paper 2 Computer Science DEC 2014


559. Correct matching: I.Specialization II.Generalization III.Aggregation IV.Mapping cardinalities to A∪, B#, C⊆, D relationships.

Databases • ER modeling • UGC NET Paper 2 Computer Science DEC 2014


560. T1⋈T2 on P=A; left-outer-join; T1⋈T2 on P=A and R=C. Tuple counts?

Databases • Joins • UGC NET Paper 2 Computer Science DEC 2014



Disclaimer for MCQ Quiz
This quiz is for educational purposes only…

0 0 votes
Article Rating
Subscribe
Notify of
guest
0 Comments
Oldest
Newest Most Voted
Inline Feedbacks
View all comments
Scroll to Top