Scribd
Upload
49 views2 pages

Aiml Document

The document contains 16 questions related to artificial intelligence and machine learning concepts including: - Defining artificial intelligence and explaining algorithms for representing tic-tac-toe problems. - Explaining algorithms to answer questions about a passage of text. - Explaining problem characteristics of production systems and defining production systems/components. - Defining heuristic functions and domain specific heuristic knowledge. - Writing production rules and solutions for a water jug problem. - Explaining hill climbing algorithms and simulated annealing algorithms. - Discussing issues in knowledge representation and defining control strategies. - Explaining breadth first search, depth first search, A* algorithm, and AO* algorithm. - Converting a set of well

Uploaded by

drishti parijat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
49 views2 pages

Aiml Document

The document contains 16 questions related to artificial intelligence and machine learning concepts including: - Defining artificial intelligence and explaining algorithms for representing tic-tac-toe problems. - Explaining algorithms to answer questions about a passage of text. - Explaining problem characteristics of production systems and defining production systems/components. - Defining heuristic functions and domain specific heuristic knowledge. - Writing production rules and solutions for a water jug problem. - Explaining hill climbing algorithms and simulated annealing algorithms. - Discussing issues in knowledge representation and defining control strategies. - Explaining breadth first search, depth first search, A* algorithm, and AO* algorithm. - Converting a set of well

Uploaded by

drishti parijat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Artificial Intelligence & Machine Learning – 18CS71

Assignment Questions
1. Define Artificial Intelligence. Explain three algorithms that vary in their complexity,
generalizations and knowledge in representing tic-tac-toe problem.
2. Consider the following text:
“Mary went shopping for new coat. She found a red one she really like. When she got it home,
she discovered that it went perfectly well with her favorite dress.”
Explain any two algorithms that tries to answer the following questions.
Q1: What did Mary go shopping for?
Q2: What did Mary find that she liked?
Q3: Did Mary buy anything?
3. Explain problem characteristics of production systems in detail.
4. Define production system. List components of production systems
5. Define heuristic function. Explain domain specific heuristic knowledge.
6. A water jug problem states “you are provided with two jugs, first one with 4 –gallon capacity
and the second one with 3-gallon capacity. Neither have any measuring markers on it. How can
you get exactly 2 gallons of water into 4-gallon jug”?
i) Write down the production rules for the above problem
ii) Write any one solution to the above problem
7. Explain Hill climbing algorithm with its advantages and disadvantages.
8. List the four properties of that a system should possess to represent the knowledge. Briefly
describe various approaches of representing knowledge.
9. Define Annealing schedule. Explain Simulated Annealing algorithm.
10. Briefly explain issues in knowledge representation.
11. Define control strategy. Describe two requirements of a good control strategy.
12. Explain Breadth First Search and Depth First Search with its advantages and disadvantages.
13. Explain A* algorithm with an example.
14. List the four properties of that a system should possess to represent the knowledge. Briefly
describe various approaches of representing knowledge.
15. Explain AO* algorithm with an example.

16 .Consider the following set of well-formed formulas in predicate logic

1. Man(Marcus)
2. Pompeian(Marcus)
3. ∀x: Pompeian(x) → Roman(x)
4. ruler(Caesar)
5. ∀x: Roman(x) → loyalto(X. Caesar) V hate(x, Caesar)
6. ∀x :→y: loyalto(x,y)
7. ∀x :∀ y : man(x) ∧ ruler(y) ∧ tryassassinate(x,y) → loyalto(x,y)
8. tryassassinate (Marcus, Caesar)

Convert these into clause form and prove that hate (Marcus, Caesar) using resolution proof

You might also like