Lovely Professional University 2011 B.Tech Computer Science and Engineering Artificial intelligence and logic programming assignment-2 - Question Paper
Friday, 25 January 2013 12:05Web
PART: A
Q1:- Mention the differences ranging from BFS and DFS using examples. Can we use these searching techniques in Search engine?
Q2:- Compare hill climbing with steepest hill climbing discuss with the help of an example.
Q3:- Solve the subsequent cryptarithmetic puzzle using constraint satisfaction?
PART:B
Q4:- elaborate the problems faced in knowledge representation?
Q5:- elaborate differences ranging from propositional logic and predicate logic? Illustrate with example.
Q6:- Differentiate ranging from matching and indexing.
LOVELY PROFESSIONAL UNIVERSITY
HOME WORK: #2
CSE452: AI & LOGIC PROGRAMMING
PART: A
Q1:- Mention the differences between BFS and DFS using examples. Can we use these searching techniques in Search engine.
Q2:- Compare hill climbing with steepest hill climbing Explain with the help of an example .
Q3 :- Solve the following cryptarithmetic puzzle using constraint satisfaction?
SEND+MORE=MONEY.
PART:B
Q4:- What are the issues faced in knowledge representation?
Q5:- What are differences between propositional logic and predicate logic? Illustrate with example.
Q6:- Differentiate between matching and indexing.
| Earning: Approval pending. |
