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

Numerical

-0

Given an instance of the STUDENTS relation as shown below: GATE CSE 2014 Set 2 Database Management System - Er Diagrams Question 12 English

For (StudentName, StudentAge) to be a key for this instance, the value $$X$$ should NOT be equal to ________.

Your input ____

GATE CSE 2014 Set 2

Numerical

-0

The maximum number of superkeys for the relation schema $$R(E, F, G, H)$$ with $$E$$ as key is ______.

Your input ____

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

PREVIOUS NEXT

GATE CSE Papers

2023