1
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+1
-0.3
A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ($$n$$ refers to the number of items in the queue)?
A
Both operations can be performed in $$O\left( 1 \right)$$ time
B
At most one operation can be performed in $$O\left( 1 \right)$$ time but the worst case time for the other operation will be $$\Omega \left( n \right)$$
C
The worst case time complexity for both operations will be $$\Omega \left( n \right)$$
D
Worst case time complexity for both operations will be $$\Omega \left( {\log n} \right)$$
2
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following is NOT a part of the $$ACID$$ properties of database transactions?
A
Atomicity
B
Consistency
C
Isolation
D
Deadlock-freedom
3
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Which of the following is NOT a superkey in a relational schema with attributes $$V, W, X, Y, Z$$ and primary key $$V Y?$$
A
$$VXYZ$$
B
$$VWXZ$$
C
$$VWXY$$
D
$$VWXYZ$$
4
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+2
-0.6
Consider the following two phase locking protocol. Suppose a transaction $$T$$ accesses (for read or write operations), a certain set of objects $$\left\{ {{O_1},...,{O_k}} \right\}.$$ This is done in the following manner:

Step 1. T acquires exclusive locks to $${{O_1},...,{O_k}}$$ in increasing order of their
addresses.
Step 2. The required operations are performed.
Step 3. All locks are released.

This protocol will

A
guarantee serializability and deadlock-freedom
B
guarantee neither serializability nor deadlock-freedom
C
guarantee serializability but not deadlock-freedom
D
guarantee deadlock-freedom but not serializability
EXAM MAP