Dhruv BadayaMay 271 minWhy should the heuristic function of A* algorithm always underestimate? Give reason, example.
Dhruv BadayaMay 271 minDetermine whether the following sentence is satisfiable, contradictory or valid: P → Q → ~P
Dhruv BadayaMay 261 minFind the meaning of the statement:(~P ∨ Q) & R → S ∨ (~R & Q) for the interpretation: P is true, Q is false, R is true, S is true.
Dhruv BadayaMay 261 minWrite the conceptual graph and FOPL representation for the following sentence: "Every motorbike has a handle"
Dhruv BadayaMay 261 minExpress the following sentence as conceptual dependency structure: "Sohan gave Tina a box of chocolate"
Dhruv BadayaMay 261 minFind whether the following set is unifiable or not. If unifiable, find the most general unifier(m.g.u.).w = {PARENTS(x, FATHER(x), MOTHER(bill)), PARENTS(bill, FATHER(bill)...
Dhruv BadayaMay 261 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 261 minWrite a context-free grammar that can accept the sentence: "Ram hit the ball".
Dhruv BadayaMay 261 minGiven an array A of n integers, you need to find the maximum sum of any contiguous subarray. For instance, the maximum sum of any contiguous subarray in the array -1, 2, 3, -2, 5, -6, 7, -8 is 9...
Dhruv BadayaMay 261 minSuppose we perform a sequence of stack operations on a stack whose size never exceeds k. After every k operations, we make a copy of the entire stack for backup purposes. Show that the cost of n st...
Dhruv BadayaMay 261 minShow that, with the array representation for sorting an n-element heap, the leaves are the nodes indexed by floor(n/2+1), floor(n/2+2), …,n. What would be the location of the minimum element in the...
Dhruv BadayaMay 261 minWhat is the minimum number of leaves in the decision tree for a comparison sort? Use this observation to derive a lower bound on the number of comparisons performed by a comparison sort in the wors...
Dhruv BadayaMay 265 minDesign and Analysis of Algorithms (DAA) - B.Sc. (Hons.) Computer Science - Delhi University 2023 Question Paper
Dhruv BadayaMay 261 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 261 minLet G = (V,E) be a directed unweighted graph. Given two vertices s and t in V, what is the time required to determine if there exists at least one s-t path in G? Can we use the DFS algorithm to fin...
Dhruv BadayaMay 262 minA student was asked to sort a list of n numbers in decreasing order. The student writes an algorithm that works iteratively as follows. In every iteration, the following two steps are done...
Dhruv BadayaMay 261 minFor each of the following sorting algorithms, merge sort and insertion sort, discuss whether or not it is (i) stable and (ii) in-place
Dhruv BadayaMay 262 minConsider the scheduling problem wherein you are given a single resource and a set of requests having deadlines. A request is said to be late be late if it misses the deadline. Your goal is to minim...