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 241 minExpress the sentences given below into Conceptual Dependency Structures: 1. Ram drove the car fast. 2. Rita gave Sita a bunch of flowers.
Dhruv BadayaMay 241 minDetermine whether the following sentence is satisfiable, contradictory or valid.
Dhruv BadayaMay 241 minIn the following two-ply game tree, the terminal nodes show the utility values computed by the utility function. Use the Minimax algorithm to compute the utility values for other nodes in the given...
Dhruv BadayaMay 241 minTranslate the statements A1 through A4 into clausal form. Show that the predicate supports(book,cup) is true using resolution.
Dhruv BadayaMay 241 minExpress the following concepts as an associative network structure with interconnected nodes and labelled arcs.
Dhruv BadayaMay 242 minDescribe the water-jug problem. Also, give a suitable state space representation for this problem.
Dhruv BadayaMay 241 minGive the properties of Type 1 and Type 2 grammars from the Chomsky Hierarchy of grammars.