October 7, 2023
Question 24 A depth-first search is performed on a directed acyclic graph. Let d[u] denote the time at which vertex u is visited for the first […]
October 7, 2023
Question 4 The concatenation of two lists is to be performed in O(1) time. Which of the following implementations of a list should be used? A […]
October 8, 2023
Question 7 Let T(n) be the number of different binary search trees on n distinct elements. Then , where x is A n – k + […]
October 8, 2023
Question 48 Draw all binary trees having exactly three nodes labeled A, B and C on which Preorder traversal gives the sequence C, B, A. A […]