Are you looking for the Answers to NPTEL AI Constraint Satisfaction Assignment 1? This article will help you with the answer to the National Programme on Technology Enhanced Learning (NPTEL) Course “ AI Constraint Satisfaction Assignment 1 “
What is AI Constraint Satisfaction?
The objective of the course is to impart the knowledge and understanding of causes and effects of air pollution and their controlling mechanisms. The course will provide a deeper understanding of air pollutants, pollution inventory and modelling. The course also imparts knowledge on the impacts of air pollution on different aspects such as policy, human health and various contemporary technological innovation for betterment of air quality.
CRITERIA TO GET A CERTIFICATE
Average assignment score = 25% of the average of best 8 assignments out of the total 12 assignments given in the course.
Exam score = 75% of the proctored certification exam score out of 100
Final score = Average assignment score + Exam score
YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF THE AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.
Below you can find the answers for AI Constraint Satisfaction Assignment 1
AI Constraint Satisfaction Assignment 1 Answers:-
Q1. A constraint is
Answer:- b- a restriction on what values a variable or a combination of variables in the problem can take
Q2. Which of the following statements are true regarding solving a CSP?
Answer:- d – Values must be assigned to ALL variables such that ALL constraints are satisfied
Q3. A Binary CSP is (choose the best fit answer)
Answer:- d- a CSP where the size of the scope of every constraint is two
Q4. A CSP with only soft constraints, also called preferences,
Answer:- c – can have more than one solution with different associated costs
???? Next Week Answers: Assignment 02 ????
Q5. Which of the following statements are true regarding soft and hard constraints?
Answer:- c- Every hard constraint must necessarily hold, while every soft constraint need not necessarily hold
Q6. Consider the following constraint network R = <{x1, x2, x3}, {D1, D2, D3}, {C}> where D1 = {a, b, c} D2 = {a, c} D3 = {a, b, c} and C = < { x1, x2, x3}, {< a, a, b >, < a, b, b >, < b, a, c >, < b, b, b >}. How many solutions exist?
Answer:- 4
Q7. In formulation of the 5-queens problem, how many constraints are possible, if the problem is posed as a binary constraint satisfaction problem? Your answer must be a number.
Answer:- Rest answers will be upload soon and will notify on our telegram channel so please JOIN
Q8. What is the value of K? Fill in the blank a numeric value
Answer:- Rest answers will be upload soon and will notify on our telegram channel so please JOIN
Q9. What is the value of S? Fill in the blank ………….
Answer:-
Q10. Out of the following which of the following is/are correct value of F? Select all correct options
Answer:-
Q11. How many solutions are possible for the puzzle?
Answer:-
For other courses answers:- Visit
For Internship and job updates:- Visit
Disclaimer: We do not claim 100% surety of answers, these answers are based on our sole knowledge, and by posting these answers we are just trying to help students, so we urge do your assignment on your own.
if you have any suggestions then comment below or contact us at [email protected]
If you found this article Interesting and helpful, don’t forget to share it with your friends to get this information.
