1
GATE CSE 2014 Set 2
Numerical
+2
-0
Consider the expression tree shown. Each leaf represents a numerical value, which can either be 0 or 1. Over all possible choices of the values at the leaves, the maximum possible value of the expression represented by the tree is ___. GATE CSE 2014 Set 2 Data Structures - Trees Question 26 English
Your input ____
2
GATE CSE 2014 Set 2
MCQ (Single Correct Answer)
+1
-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
A
the shortest path between every pair of vertices.
B
the shortest path from W to every vertex in the graph.
C
the shortest paths from W to only those nodes that are leaves of T.
D
the longest path in the graph.
3
GATE CSE 2014 Set 2
Numerical
+1
-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 ____
4
GATE CSE 2014 Set 2
Numerical
+1
-0
The maximum number of superkeys for the relation schema $$R(E, F, G, H)$$ with $$E$$ as key is ______.
Your input ____
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12