1
GATE CSE 2011
MCQ (Single Correct Answer)
+2
-0.6

Consider a database table T containing two columns X and Y each of type integer. After the creation of the table, one record (X = 1, Y = 1) is inserted in the table.

Let MX and MY denote the respective maximum values of X and Y among all records in the table at any point in time. Using MX and MY, new records are inserted in the table 128 times with X and Y values being MX + 1, 2*MY + 1 respectively. It may be noted that each time after the insertion, values of MX and MY change.

What will be the output of the following SQL query after the steps mentioned above are carried out?

SELECT Y FROM T WHERE X=7; 
A
127
B
255
C
129
D
257
2
GATE CSE 2011
MCQ (Single Correct Answer)
+2
-0.6
Consider a relational table r with sufficient number of records, having attributes A1, A2,....., An and let 1 $$ \le $$ p $$ \le $$ n. Two queries Q1 and Q2 are given below.

$$Q1: \pi_{A_1, \dots ,A_p} \left(\sigma_{A_p=c}\left(r\right)\right)$$ where is a constant

$$Q2: \pi_{A_1, \dots ,A_p} \left(\sigma_{c_1 \leq A_p \leq c_2}\left(r\right)\right)$$ where c1 and c2 are constants

The database can be configured to do ordered indexing on Ap or hashing on Ap. Which of the following statements is TRUE?

A
Ordered indexing will always outperform hashing for both queries
B
Hashing will always outperform ordered indexing for both queries
C
Hashing will outperform ordered indexing on Q1, but not on Q2
D
Hashing will outperform ordered indexing on Q2, but not on Q1
3
GATE CSE 2011
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following circuits is NOT equivalent to a $$2$$-input $$XNOR$$ (exclusive NOR) gate
A
GATE CSE 2011 Digital Logic - Boolean Algebra Question 41 English Option 1
B
GATE CSE 2011 Digital Logic - Boolean Algebra Question 41 English Option 2
C
GATE CSE 2011 Digital Logic - Boolean Algebra Question 41 English Option 3
D
GATE CSE 2011 Digital Logic - Boolean Algebra Question 41 English Option 4
4
GATE CSE 2011
MCQ (Single Correct Answer)
+1
-0.3
The simplified $$SOP$$ (Sum of product) form of the Boolean expression
$$\left( {P + \overline Q + \overline R } \right).\left( {P + \overline Q + R} \right).\left( {P + Q + \overline R } \right)$$ is
A
$$\left( {\overline P .Q + \overline R } \right)$$
B
$$\left( {P + \overline Q .\overline R } \right)$$
C
$$\left( {\overline P .Q + R} \right)$$
D
$$\left( {P.Q + R} \right)$$
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12