Browse papers
A

Section A: Long Answer Questions

Attempt any TWO questions.

3 questions·10 marks each
1long10 marks

Explain uninformed search strategies. Compare Breadth-First Search and Depth-First Search in terms of completeness, optimality, time, and space complexity with examples.

searchuninformed-search
2long10 marks

What is heuristic search? Explain the A* search algorithm with a suitable example and discuss the conditions of admissibility and consistency of a heuristic.

searcha-starheuristic
3long10 marks

Explain knowledge representation using predicate logic. Convert given English sentences into First-Order Predicate Logic and explain the resolution method with an example.

knowledge-representationpredicate-logicresolution
B

Section B: Short Answer Questions

Attempt any EIGHT questions.

9 questions·5 marks each
4short5 marks

Explain the Wumpus world problem in brief.

knowledge-representationagents
5short5 marks

Differentiate between depth-first search and best-first search.

search
6short5 marks

What is the goal of unification in predicate logic?

predicate-logicunification
7short5 marks

Explain the components of an expert system.

expert-system
8short5 marks

Differentiate between strong AI and weak AI.

ai-basics
9short5 marks

What is the Turing test? Explain its significance.

ai-basicsturing-test
10short5 marks

Define a rational agent. List the properties of a task environment.

intelligent-agents
11short5 marks

Differentiate between informed and uninformed search.

search
12short5 marks

Explain the hill-climbing search algorithm and its problems.

searchhill-climbing