Tribhuvan University
Bachelor of Computer Application
Semester 7 · TU Board 2026
Course Title: Artificial Intelligence (CACS410)
Full Marks: 60Pass Marks: 24Time: 3 hours
Candidates are required to answer the question in their own words as far as possible.
Group B
Attempt any SIX question.(6 × 5 = 30)
- 2.5
Explain Understanding AI based on thought process and behavior with example. [5]
- 3.5
Solve the following cryptarithmetic problem using constraint satisfaction principles: BASE + BALL = GAMES Define variables and domains, Apply unary constraints, Find a valid digit assignment. Verify the arithmetic correctness. [1+1+2+1]
- 4.5
Compare Depth-Limited Search and Iterative Deepening DFS with this algorithm. [1+1+2+1]
- 5.5
Convert the following expression into CNF: (P→Q)→R [5]
- 6.5
Explain steps of Genetic Algorithm. [5]
- 7.5
What is learning? Explain Inductive learning and Explanation-Based Learning with examples. [1+4]
- 8.5
Explain the tasks involved in Machine Vision. [5]
Group C
Attempt any TWO questions(2 × 10 = 20)
- 9.10
Explain Informed and Uninformed search techniques. Solve the N-Queens problem using heuristic search. Clearly explain states, operators, constraints, and solution steps. [2+1+2+2+3]
- 10.10
Derive Bayes Rule. Consider the diagram and find probability that (D,I,G,S,L) = (0,1,3,1,0). [4+6] [figure in the original paper]
- 11.10
Describe Artificial Neural Network. Prove using resolution that: Eats(Tiger, Meat) [3+7] Given: ∀x (Carnivore(x) → ∃y (Meat(y) ∧ Eats(x,y)) Carnivore(Tiger) ∀x∀y (Meat(y) → Food(y)) ∀x∀y (Carnivore(x) ∧ Food(y)) → CanEat(x,y) ∀x∀y (CanEat(x,y) → Eats(x,y))
— The End —