written 5.6 years ago by
yashbeer
★ 11k
|
|
Information Technology (Semester 7)
Total marks: 80
Total time: 3 Hours
INSTRUCTIONS
(1) Question No. 1 is compulsory.
(2) Attempt any three from remaining five questions.
1(a) Give the comparison of DFS, BFS, Iterative deeping and Bidirectional search.
(4 marks)
1541
1(b) Solve the given Crypt-arithmetic puzzle
T W O
+
T W O
=====
F O U R
(4 marks)
00
1(c) Explain modus ponen with suitable example.
(4 marks)
00
1(d) Draw and Explain general model of Learning Agent.
(4 marks)
1580
1(e) Explain the Limitation of propositional logic with suitable example.
(4 marks)
00
2(a) Explain Hill climbing and simulated Annealing with suitable example.
(10 marks)
1543
1544
2(b) Explain Goal based and utility based agent with block diagram.
(10 marks)
00
1606
1607
3(a) Consider the given game tree. Apply $\alpha$-$\beta$ pruning where $\square$-max node, 0- min node.
(10 marks)
00
3(b) Explain Role learning and Inductive learning with suitable examples.
(10 marks)
1586
1581
4(a) Consider the following sentence.
- i) mammals drink milk
- ii) Man is mortal
- iii) Man is Mammal
- iv) Tom is Man
Prove that Tom is mortal using modus ponen and Resolution.
(10 marks)
00
4(b) Draw an explain the expert system Architecture.
(10 marks)
1590
5(a) Consider the given tree, apply breadth first search algorithm and also write the order in which nodes are expanded.
(10 marks)
00
5(b) Write the Planning algorithm for spare tyre problem.
(10 marks)
1567
Q6) Write the short note on any four.
a) Wumpus world environment
1554
b) SMA* algorithm
1547
c) Forward chaining and Backward chaining.
1557
d) Bayes Theorem and conditional probability.
1575
1573
e) Supervised and Unsupervised learning.
1582
1583
(20 marks)
00