AI Mid 1 QB

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

1.

List and explain the categories of Intelligent Systems


2. What are the components of AI program? Explain them.
3. Define heuristic function with an example
4. What are the components of AI program? Explain them.
5. Write the applications of AI
6. Define Agent. Explain the types of Agents
7. Explain structure of any one agent
8. Perform A* algorithm for the below graph

9. Explain the Water Jug problem in detail


10. Implement Alpha-beta pruning and calculate the value of the tree

9 8 6 7 6 5 4 5 3
11. Differentiate between Depth First Search and Breadth First Search
12. Explain the missionaries and cannibals
13. Demonstrate n-queen problem.
14. Compare and contrast heuristic search and non-heuristic search.
15. Mention relationships in knowledge representation using semantic networks with
examples.
16. Give semantic tableau rules for
A<->B and ~ (A->B).
17. Define Quantification and give types of quantifiers with examples
18. Write three axioms of axiomatic system and give the inference rule
19. Define tautology with an example truth table
20. What are the characteristics of a problem
21. Show that S={~(AvB), CB, AvC} is unsatisfiable using semantic tableau
method
22. Construct a semantic network for the given knowledge using prop link
“Birds, Animals and Human beings are living things. Every man and woman is
human who have two eyes and two ears. John is a man. A parrot is a bird and eats
fruits.”
23. Construct the frame knowledge representation for the below knowledge
“Child Hospital and Heart Hospital are the types of hospitals. Labs, Doctors, Wards
are present in hospital. Pathology and X-ray lab are labs in a hospital. Escorts is a
heart hospital.”
24. Show that q(a) is a logical consequence of formulae A and B where
A: (for all x) [p(x)q(x)] B: p(a)
Using resolution refutation principle in predicate logic.
25. Establish that AC is a deductive consequence of set {AB, BC} using
axiomatic system approach.
26. Using resolution refutation principle show that CvD is a logical consequence of set
S={AvB, ~AvD, Cv~B}
27. Solve the given constraint satisfaction problem
T W O
+T W O
F O U R
28. Transform the following formula into PNF and skolemize the obtained PNF
(For all x) p(x)  (There Exists y) q[f(c), y]
29. Solve the given constraint satisfaction problem
T O
+G O
O U T
30. Write semantic tableau rules.
31. Explain Natural deduction system.
32. Write rules of inferences.

You might also like