1
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
The following table has two attributes $$A$$ and $$C$$ where $$A$$ is the primary key and $$C$$ is the foreign key referencing $$A$$ with on-delete cascade. GATE CSE 2005 Database Management System - Er Diagrams Question 8 English

The set of all tuples that must be additionally deleted to preserve referential integrity. When the tuple $$(2,4)$$ is deleted is:

A
$$(3,4)$$ and $$(6,4)$$
B
$$(5,2)$$ and $$(7,2)$$
C
$$(5, 2),$$ $$(7,2)$$ and $$(9,5)$$
D
$$(3, 4),(4,3)$$ and $$(6,4)$$
2
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
Let $${E_1}$$ and $${E_2}$$ be two entities in an E-R diagram with simple single-valued attributes, $${E_1}$$ and $${E_2}$$ are two relationships between $${E_1}$$ and $${E_2}$$, Where $${E_1}$$ is one-to-many and $${E_2}$$ is many-to-many. $${E_1}$$ and $${E_2}$$ do not have any attributes of their own. What is the minimum number of tables required represent this situation in the relation model?
A
$$2$$
B
$$3$$
C
$$4$$
D
$$5$$
3
GATE CSE 2005
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following statements about normal forms is FALSE?
A
$$BCNF$$ is stricter than $$3NF$$
B
Lossless, dependency $$-$$ preserving decomposition into $$3NF$$ is always possible
C
Lossless, dependency - preserving decomposition into $$BCNF$$ is always possible
D
Any relation with two attributes is in $$BCNF$$
4
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
What is the first order predicate calculus statement equivalent to the following?
Every teacher is liked by some student
A
$$\forall \left( x \right)\left[ {teacher\left( x \right) \to \exists \left( y \right)\left[ {student\left( y \right) \to likes\left( {y,\,x} \right)} \right]} \right]$$
B
$$\forall \left( x \right)\left[ {teacher\left( x \right) \to \exists \left( y \right)\left[ {student\left( y \right) \wedge likes\left( {y,\,x} \right)} \right]} \right]$$
C
$$\exists \left( y \right)\forall \left( x \right)\left[ {teacher\left( x \right) \to \left[ {student\left( y \right) \wedge likes\left( {y,x} \right)} \right]} \right]$$
D
$$\forall \left( x \right)\left[ {teacher\left( x \right) \wedge \exists \left( y \right)\left[ {student\left( y \right) \to likes\left( {y,\,x} \right)} \right]} \right]$$