1
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+2
-0.6
Consider the relational schema given below, where eId of the relation dependent is a foreign key referring to empId of the relation employee. Assume that every employee has at least one associated dependent in the dependent relation:

employee (empId, empName, empAge)

dependent (depId, eId, depName, depAge)

Consider the following relational algebra query: $$\Pi_{empId}\:(employee) - \Pi_{empId}\:(employee \bowtie_{(empId=eID) \wedge (empAge \leq depAge)} dependent)$$

The above query evaluates to the set of empIds of employees whose age is greater than that of

A
some dependent.
B
all dependents.
C
some of his/her dependents.
D
all of his/her dependents.
2
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+2
-0.6
Consider the transactions T1, T2, and T3 and the schedules S1 and S2 given below.

T1 : r1 (X) ; r1 (Z) ; w1 (X) ; w1 (Z)

T2 : r2 (X) ; r2 (Z) ; w2 (Z)

T3 : r3 (X) ; r3 (X) ; w3 (Y)

S1: r1(X); r3(Y); r3(X); r2(Y); r2(Z); w3(Y); w2(Z); r1(Z); w1(X); w1(Z)

S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z); r2(Z); w3(Y); w1(X); w2(Z); w1(Z)

Which one of the following statements about the schedules is TRUE?
A
Only S1 is conflict-serializable.
B
Only S2 is conflict-serializable.
C
Both S1 and S2 are conflict-serializable.
D
Neither S1 nor S2 is conflict-serializable.
3
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+1
-0.3
Consider the following combinational function block involving four Boolean variables $$x, y, a,$$
$$b$$ where $$x, a, b$$ are inputs and $$y$$ is the output. GATE CSE 2014 Set 3 Digital Logic - Boolean Algebra Question 37 English
Which one of the following digital logic blocks is the most suitable for implementing this function?
A
Full adder
B
Priority encoder
C
Multiplexer
D
Flip-flop
4
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+2
-0.6
Let $$ \oplus $$ denote the exclusive $$OR\left( {XOR} \right)$$ operation. Let $$'1'$$ and $$'0'$$ denote the binary constants. Consider the following Boolean expression for $$F$$ over two variables $$P$$ and $$Q$$:
$$F\left( {P,Q} \right) = \left( {1 \oplus P} \right) \oplus \left( {P \oplus Q} \right) \oplus \left( {P \oplus Q} \right) \oplus \left( {Q \oplus 0} \right)$$

The equivalent expression for $$F$$ is

A
$$P+Q$$
B
$$\overline {P + Q} $$
C
$${P \oplus Q}$$
D
$$\overline {P \oplus Q} $$
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
CBSE
Class 12