Fundamentals of Artificial Intelligence Assignment 3 Answers 2022

NPTEL Fundamentals of Artificial Intelligence Assignment 3 Answers 2022:- In this post, We have provided answers of the NPTEL Fundamentals of Artificial Intelligence Assignment 3. We provided answers here only for reference. Plz, do your assignment at your own knowledge.

NPTEL Fundamentals of Artificial Intelligence Assignment 3 Answers 2022 [July-Dec]

1. For solutions in an AND-OR graph, which of the following statements are true.

A. Need an algorithm similar to best-first search; but with the ability to handle the AND arc appropriately.
B. AO* algorithm use a single structure – a graph – representing part of the search graph.
C. At least one arm of an AND arc must lead to a solution node.
D. A solution graph of an AND-OR graph is analogous to a path in an ordinary graph.

`Answer:-`

2. Alpha-beta pruning had been reinvented a number of times! The earliest version was by _______________ for a checkers simulation.

A. Allen Newell
B. Herbert A. Simon
C. John McCarthy
D. Arthur Samue

`Answer:-`

3. Give one word or a phrase for: A mathematical representation of a situation in which each participant’s gain or loss of utility is exactly balanced by the losses or gains of utility of the other participants.

A. Minimax
B. Pay-off function
C. Utility function
D. Zero-sum Game

`Answer:-`

4. Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size.

A. P complete
B. NP complete
C. NP hard
D. Domain dependent

`Answer:-`

5. ___________ is a backtracking algorithm for CSP that is aware of the underlying constraint graph; determines where to jump back to, based on the actual conflict that it has recorded.

A. Plain Backtracking
B. Chronological Backtracking
C. Conflict-directed Backjumping
D. Arc Consistency

`Answer:-`

6. Start at C. Descend to full-ply depth. Back up the values as appropriate. The alpha value at node C after traversal of the leftmost branch is _________

`Answer:-`

7. Applying alpha-beta pruning as appropriate, cut-off search below node D is __________.

A. Alpha-pruning
B. Beta-pruning
C. Incorrectly pruned
D. Deep pruning

`Answer:-`

8. Applying alpha-beta pruning as appropriate, cut-off search below node B is ___________.

A. Alpha-pruning
B. Beta-pruning
C. Incorrectly pruned
D. Deep pruning

`Answer:-`

9. Start at C. Descend to full-ply depth. Back up the values as appropriate. The beta value at node E is _______.

`Answer:-`

10. Descending to C’s great grandchildren along the middle branch in a depth-first fashion, search below node D is pruned. This is because no matter what happens on its right branch the value of node D cannot be greater than ________.

`Answer:-`

`Note:- We do not claim 100% Surety of Answers, we urge to your assignment at you own Knowledge.`

What does automatic scheduling or autonomous driving have in common with web search, speech recognition, and machine translation? These are complex real-world problems that span across various practices of engineering! Aim of artificial intelligence (AI) is to tackle these problems with rigorous mathematical tools. The objective of this course is to present an overview of the principles and practices of AI to address such complex real-world problems. The course is designed to develop a basic understanding of problem solving, knowledge representation, reasoning and learning methods of AI.

COURSE LAYOUT

• Week 1:    AI and Problem Solving by Search
• Week 2:    Problem Solving by Search
• Week 3:    Problem Solving by Search
• Week 4:    Knowledge Representation and Reasoning
• Week 5:    Knowledge Representation and Reasoning
• Week 6:    Knowledge Representation and Reasoning
• Week 7:    Reasoning under Uncertainty
• Week 8:    Planning
• Week 9:    Planning and Decision Making
• Week 10:  Machine Learning
• Week 11:   Machine Learning
• Week 12:   Machine Learning

CRITERIA TO GET A CERTIFICATE

Average assignment score = 25% of the average of the 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.

`Note:- We do not claim 100% Surety of Answers, we urge to your assignment at you own Knowledge.`