Dhruv BadayaMay 231 minWhat is the smallest possible depth of a leaf in a decision tree for a comparison sort? Name a sorting technique to which this smallest depth would correspond.
Dhruv BadayaMay 232 minWrite a pseudocode for the memoized recursive algorithm to compute the nth Fibonacci number. What would be its time complexity?
Dhruv BadayaMay 231 minThe BFS algorithm has been used to produce the shortest paths from a node s to all other nodes in a graph G. Can the Dijkstra's algorithm be used in place of BFS? In a different scenario, the Djik...
Dhruv BadayaMay 221 minGiven two keyframes for an object transformation, first keyframe contains a triangle and the second keyframe contains a quadrilateral. Convert the triangle into the quadrilateral by equalizing ver...
Dhruv BadayaMay 181 minUniversity of Delhi - B.Sc. (Hons.) Computer Science Past Year Question Papers