1
GATE CSE 2024 Set 1
MCQ (More than One Correct Answer)
+2
-0.66

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?

A

There are no back-edges in G with respect to the tree T

B

There are no cross-edges in G with respect to the tree T

C

There are no forward-edges in G with respect to the tree T

D

The only edges in G are the edges in T

2
GATE CSE 2021 Set 1
+2
-0.67

Consider the following array.

 23 32 45 69 72 73 89 97

Which algorithm out of the following options uses the least number of comparisons (among the array elements) to sort above array in ascending order?
A
Insertion sort
B
Selection sort
C
Quicksort using the last element as pivot
D
Merge sort
3
GATE CSE 2018
Numerical
+2
-0
The number of possible min-heaps containing each value from $$\left\{ {1,2,3,4,5,6,7} \right\}$$ exactly once is _____.
4
GATE CSE 2016 Set 2
Numerical
+2
-0
A complete binary min-heap is made by including each integer in $$[1,1023]$$ exactly once. The depth of a node in the heap is the length of the path from the root of the heap to that node. Thus, the root is at depth $$0.$$ The maximum depth at which integer $$9$$ can appear is ___________.