Dhruv BadayaMay 261 minShow that in any subtree of a max-heap, the root of the subtree contains the largest value occurring anywhere in that subtree.
Dhruv BadayaMay 261 minWe are given a weighted graph G in which edge weights are not necessarily distinct. Can graph G have more than one minimum spanning tree (MST)? If yes, give an example, else justify.
Dhruv BadayaMay 261 minWhy is the worst-case running time for bucket sort θ(n²)? What changes would you make to the algorithm so that its worst-case running time becomes O(nlgn)?
Dhruv BadayaMay 251 minSpecify whether the above graph is bipartite or not. If yes, give the partition, else justify.
Dhruv BadayaMay 251 minLet G be a tree graph. Further, let A and B be the trees produced by performing BFS and DFS respectively on G. Can A and B be different trees? Why or why not?
Dhruv BadayaMay 251 minHow many topological orderings does the following graph have? Specify all of them.
Dhruv BadayaMay 251 minCan dynamic programming be applied to all optimization problems? Why or why not?
Dhruv BadayaMay 251 minWill the greedy strategy with the greedy parameter being value per unit weight of the items yield an optimal solution for the 0-1 knapsack problem? Justify.
Dhruv BadayaMay 251 minA team of explorers is visiting the Sahara desert. Due to the extreme heat, they need to stay hydrated and have brought n bottles of different sizes to carry water. After travelling a few kilometre...
Dhruv BadayaMay 251 minDiscuss the running time of the following snippet of code: count=0 for (i=l, i<=n, i++) for (j=1, j<=n, j=2*j) count++
Dhruv BadayaMay 250 minUse master's theorem to give tight asymptotic bounds for the recurrence T(n) = 8 T(n/2) + θ(n²).
Dhruv BadayaMay 252 minWhat is a Truth Maintenance System (TMS)? Give the architecture of a problem solver with a TMS in the form of a diagram.
Dhruv BadayaMay 251 minTransform the following into clausal form: ∃x ∀y (∀z P(f(x),y,z)→(∃u Q(x,u) & ∃v R(y,v)))
Dhruv BadayaMay 251 minWrite a Prolog program maxlist (L, Max) to find the greatest number Max in the list L.
Dhruv BadayaMay 251 minFind whether the following sets are unifiable or not? If they are unifiable, find most general unifier (m.g.u.) otherwise give justification why they are not unifiable.
Dhruv BadayaMay 253 minArtificial Intelligence - B.Sc. (Hons.) Computer Science - Delhi University 2023 Question Paper
Dhruv BadayaMay 241 minExpress the sentences given below into Conceptual Dependency Structures: 1. Ram drove the car fast. 2. Rita gave Sita a bunch of flowers.