Let G be a directed graph and T a depth first search (DFS) spanning tree in G that is rooted at a vertex v. Suppose T is also a breadth first search (BFS) tree in G, rooted at v. Which of the following statements is/are TRUE for every such graph G and tree T?
Let S be the specification : "Instructors teach courses. Students register for courses. Courses are allocated classrooms. Instructors guide students." Which one of the following ER diagrams CORRECTLY represents S?

In a B+ tree, the requirement of at least half-full (50%) node occupancy is relaxed for which one of the following cases?
Which of the following statements about a relation $R$ in first normal form (1NF) is/are TRUE?
GATE CSE Papers
All year-wise previous year question papers