er19724, 1-05 PM { Swayam } | (https://swayam.gov.in) [An Introduction to Arial Inteligence -- Unit 8 - Week ) (reetoajom gone [email protected] v NPTEL (https:iswayam.gov.in/explorer¢ncCode=NPTEL) » An Introduction to Artificial Intelligence (course) Course outline How does an NPTEL online course work? 0 Assignment Zoro () Week 1 () Week 2 () Week 3 () Week 4() Week 5 () Weeks () Constraint Satisfaction Problems: Representation of the atomic sate (unit? Week 6 : Assignment 6 The due date for submitting this assignment has passed. Due on 2023-03-08, 23:59 IST. {As per our records you have not submitted this assignment, 1) Which of the following is true in the context of the standard search formulation of 1 point csPs? (there are n variables, each of which can take d values, at every step you branch by assigning a value to some unassigned variable) Al solutions appear at the same depth in the search tree There are d'” leaf nodes in the search tree, one for each possible assignment of values to the variables There are nla" leat nodes in the search tree, n! for each possible assignment of values to the variables Iterative deepening depth first search is the best algorithm to perform the search on the resulting formulation No, the answer is incorrect, Score: 0 ‘Accepted Answers: All solutions appear at the same depth in the search tree There are nid? leaf nodes in the search tree, n! for each possible assignment of values to the variables 2) Whats the worst-case time complexity of solving a CSP containing nk variables, each 1 point of which can take d values, if itis known that the problem can be decomposed into k independent ‘subproblems, each containing n variables? O(énk?) nitps:ontinecourses npel ac innoc23_cs0S\unt7uni=628assessment=175 15er19724, 1-05 PM nit=628lesson =63) Constraint Satistaction Problems: Map coloring and other examples of CSP (unit? Unit=628lesson 64) Constraint Satistaction Problems: Backtracking Search (unit? nit=628lesson =65) Constraint Satistaction Problems: Variable and Value Ordering in Backtracking Search (unit? unit=628lesson =66) Constraint Satisfaction Problems: Inference for detecting failures early (unit? =67) 28lesson Constraint Satisfaction Problems: Exploiting problem structure (unit? unit=628lesson 68) Week & Feedback Form (unit? 28lesson 69) [An Introduction to Artificial Inteligence -- Unit 8 - Weeks ore") Olkd") oa") No, the answer is incorrect, Score: 0 Accepted Answers: Oke) 3) Which of the following methods are unlikely to increase the speed of backtracking 1 point search for solving a CSP? Cutset conditioning on a complete (fully connected) CSP graph. Selecting variable with fewest legal values remaining Using are consistency to detect failures early Selecting the most constraining value for a variable No, the answer is incorrect. Score: 0 Accepted Answers: Cutset conditioning on a complete (fully connected) CSP graph, Selecting the most constraining value for a variable 4) Inwhich of the following settings is hill-climbing using min-conflics heuristic likely to 1 point struggle the most? Low number of constraints, low number of variables Number of constraints >> Number of variables Number of constraints << Number of variables Near the critical ratio between number of constraints and number of variables No, the answer is incorrect, Score: 0 Accepted Answers: ‘Near the critical ratio between number of constraints and number of variables 5) Which of the following is true about arc consistency as a method to improve 1 point backtracking search based constraint satisfaction algorithms? Ithelps in detecting failures early by leveraging constraints involving unassigned variables. ‘Are consistency updates the domain of unassigned variables given the current assignment and detects failure when all the modified domains are empty ‘Are-consistency can be performed in polynomial time. Backtracking search with arc consistency and forward checking solves CSPs in polynomial time No, the answer is incorrect, Score: 0 Accepted Answers: Ithelps in detecting failures early by leveraging constraints involving unassigned variables. nitps:Vontinecourses noel ac in’noc23_cs0S\unt?uni=628assessment=175 215er19724, 1-05 PM Quiz: Week 6 Assignment 6 (assessment? ‘name=175) Week 7 () Week 8 () Week 9 () Week 10 () Week 11 () Week 12 () Download Videos () Text Transcripts () Year 23 Solutions () Books () Problem Solving Session () [An Introduction to Artificial Inteligence -- Unit 8 - Weeks ‘Arc-consistency can be performed in polynomial time, 6) Consider the constraint graph given below. Each node can take values from the set {a,b ‘c') ‘and the constraints are that the variables connected by an edge in the constraint graph need to have different values, We will use the following CSP solving heuristics over backtracking searching with forward checking to find a satisfying assignment for the constraints, @ ° oe eS |. For selecting which node to assign, select the numerically smallest unassigned node. Il. For assigning value to the node, select the smallest value possible in the current domain(as determined by the forward checking algorithm). Determine the sequence of nodes that are assignedire-assigned one by one till a satisfiable solution 's reached, No, the answer is incorrect, Score: 0 Accepted Answers: (Type: String) 0123345 1 point 7) In the above problem, suppose that for assigning value to the node, instead of I, the Least Constraining Value Heuristic is used with ties broken in the alphabetical order. ‘Suppose thal nodes x; x2... Xk are assignedire-assigned values Vs .v2 ,.. vk - Determine xivixave xiv . For example, i the nodes 0,3,1,2,4,5 are assigned a, b,c, a, b, b respectively, the correct response will be Oa3b1c2a4b5b. nitps:Vontinecourses noel ac in’noc23_cs0S\unt?unit=628assessment=175 35er19724, 1-05 PM nitps:Vontinecourses noel ac innoc23_cs0S\unt?uni=628assessment=175 [An Introduction to Artificial Intellgence -- Unit 8 - Weeks No, the answer is incorrect, Score: 0 Accepted Answers: (Type: String) 0atb2e3b4a5b 1 point 8) In the above problem, the following additional unary constraints are added: 1 point Value(0) Value(1) = Valua(2) ‘Suppose we enforce these constraints(assign 0,1 and 2 with corresponding values) and perform the arc-consistency algorithm AC-3, which of the following are correct about the modified domains of the unassigned variables? Modified domain of variable 3, is {b) Using the modified domains, the search terminates without ever backtracking, i. without ever re-assigning any previously assigned variable with another value. Modified domain of variable 3 is {a,b} Using forward checking instead of AC-3 would have resulted in the same modified domains for this problem. No, the answer is incorrect, Score: 0 Accepted Answers: ‘Modliffed domain of variable 3, is (b} Using the modified domains, the search terminates without ever backtracking, .e without ever ro- assigning any previously assigned variable with another value. 9) For the constraint graph of problem 6, suppose we want to use cycle cutsets to modify it into a tree-shaped constraint graph. How many minimum nodes need to be removed in the process? No, the answer is incorrect, Scare: 0 Accepted Answers: (Type: String) 2 1 point 10) Consider constraint satisfaction problems with n variables anda domain of sized. 1 point Which ofthe following are correct regarding the worst case time complexity of algorithms for constraint satisfaction problems? Using the minimum remaining values heuristic and the least constraining value heuristic reduces the worst case time complexity to polynomial in n and Worst time complexity is O(n) respective of heuristic. Ifthe minimum cycle cutset has size c, time complexity is O(nd°*2) For a tree shaped constraint graph, time complexity is O(d) 465er19724, 1-05 PM [An Introduction to Artificial Intellgence -- Unit 8 - Weeks No, the answer is incorrect, Score: 0 Accepted Answers: Ifthe minimum cycle cutset has size ¢, time complexity is Ofnd"*2) nitps:Vontinecourses noel ac innoc23_cs0S\unt?uni=628assessment=175 55