1
GATE CSE 2006
MCQ (Single Correct Answer)
+2
-0.6
Consider the depth-first-search of an undirected graph with 3 vertices P, Q, and R. Let discovery time d(u) represent the time instant when the vertex u is first visited, and finish time f(u) represent the time instant when the vertex u is last visited. Given that
d(P) = 5 units      f(P) = 12 units
d(Q) = 6 units      f(Q) = 10 units
d(R) = 14 unit      f(R) = 18 units
Which one of the following statements is TRUE about the graph
A
There is only one connected component
B
There are two connected components, and P and R are connected
C
There are two connected components, and Q and R are connected
D
There are two connected components, and P and Q are connected
2
GATE CSE 2006
MCQ (Single Correct Answer)
+2
-0.6
Let T be a depth first search tree in an undirected graph G. Vertices u and v are leaves of this tree T. The degrees of both u and v in G are at least 2. which one of the following statements is true?
A
There must exist a vertex w adjacent to both u and v in G
B
There must exist a vertex w whose removal disconnects u and v in G
C
There must exist a cycle in G containing u and v
D
There must exist a cycle in G containing u and all its neighbours in G.
3
GATE CSE 2006
MCQ (Single Correct Answer)
+2
-0.6
Let T be a depth-first search tree in an undirected graph G. Vertices u and v are leaves of this tree T. The degrees of both u and v in G are at least 2. Which one of the following statements is true?
A
There must exist a vertex w adjacent to both u and v in G
B
There must exist a vertex w whose removal disconnects u and v in G
C
There must exist a cycle in G containing u and v
D
There must exist a cycle in G containing u and all its neighbors in G.
4
GATE CSE 2006
MCQ (Single Correct Answer)
+2
-0.6
Consider the relation enrolled (student, course) in which (student, course ) is the primary key, and the relation Paid (student, amount) where student is the primary key. Assume no null values and no foreign keys or integrity constraints. Assume that amounts $$6000, 7000, 8000,9000$$ and $$10000$$ were each paid by $$20$$% of the students. Consider these query plans (Plan $$1$$ on left, Plan $$2$$ on right) to ''List all courses taken by students who have paid more than $$x''$$. GATE CSE 2006 Database Management System - Functional Dependencies and Normalization Question 17 English 1 GATE CSE 2006 Database Management System - Functional Dependencies and Normalization Question 17 English 2

A disk seek takes $$4ms$$, disk data transfer bandwidth is $$300MB/s$$ and checking a tuple to see if amount is greater than $$x$$ takes $$10\mu s.$$ Which of the following statements is correct?

A
Plan $$1$$ and Plan $$2$$ will not output identical row sets for all databases
B
A course may be listed more than once in the output of plan $$1$$ for some databases
C
For $$x=5000,$$ Plan $$1$$ executes faster than plan $$2$$ for all databases
D
For $$x=9000,$$ Plan $$1$$ executes slower than plan $$2$$ for all databases
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12