GATE CSE 2016 Set 1 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2016 Set 1

Numerical

-0

Consider the following directed graph: GATE CSE 2016 Set 1 Data Structures - Graphs Question 8 English

The number of different topological orderings of the vertices of the graph is ________________.

Your input ____

GATE CSE 2016 Set 1

MCQ (Single Correct Answer)

-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)?

Both operations can be performed in $$O\left( 1 \right)$$ time

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)$$

The worst case time complexity for both operations will be $$\Omega \left( n \right)$$

Worst case time complexity for both operations will be $$\Omega \left( {\log n} \right)$$

GATE CSE 2016 Set 1

MCQ (Single Correct Answer)

-0.3

Which one of the following is NOT a part of the $$ACID$$ properties of database transactions?

Atomicity

Consistency

Isolation

Deadlock-freedom

GATE CSE 2016 Set 1

MCQ (Single Correct Answer)

-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?$$

$$VXYZ$$

$$VWXZ$$

$$VWXY$$

$$VWXYZ$$

PREVIOUS NEXT

GATE CSE Papers

2024