GATE CSE 2014 Set 2 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2014 Set 2

MCQ (Single Correct Answer)

-0.3

Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected, undirected graph. The tree T formed by the tree arcs is a data structure for computing

the shortest path between every pair of vertices.

the shortest path from W to every vertex in the graph.

the shortest paths from W to only those nodes that are leaves of T.

the longest path in the graph.

GATE CSE 2014 Set 2

MCQ (Single Correct Answer)

-0.6

Suppose a stack implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?

A queue cannot be implemented using this stack.

A queue can be implemented where ENQUEUE takes a single instruction and DEQUEUE takes a sequence of two instructions.

A queue can be implemented where ENQUEUE takes a sequence of three instructions and DEQUEUE takes a single instruction.

A queue can be implemented where both ENQUEUE and DEQUEUE take a single instruction each

GATE CSE 2014 Set 2

MCQ (Single Correct Answer)

-0.6

SQL allows duplicate tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives the same answer as the nested query shown below:

Select * from R where a in (select S.a from S)

Select R.* from R, S where R.a = S.a

Select distinct R.* from R, S where R.a = S.a

Select R.* from R, (select distinct a from S) as S1 where R.a = S1.a

Select R.* from R, S where R.a = S.a and is unique R

GATE CSE 2014 Set 2

MCQ (Single Correct Answer)

-0.6

Consider a join (relation algebra) between relations r(R)and s(S) using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming size(r(R)) < size(s(S)), the join will have fewer number of disk block accesses if

relation r(R) is in the outer loop.

relation s(S) is in the outer loop.

join selection factor between r(R) and s(S) is more than 0.5.

join selection factor between r(R) and s(S) is less than 0.5.

PREVIOUS NEXT

GATE CSE Papers

2024