UNIT - I

PART - A

1 Define artificial intelligence (AI).

2 What is prepositional logic?

Can Predicate logic be a Propositional Logic? Illustrate with
3
example.
4 Classify the different types of agents

5 Illustrate the structure of an agent in an environment with neat diagram.

6 What is an Ideal Rational Agent?

7 Give The Structure of Intelligent Agents.

8 Interpret Simple Reflex Agents

9 List the types of Agent Architectures.

10 Compare Negotiation and Bargaining.

PART - B

1 Distinguish between Propositional Logic and Predicate Logic.

2 Illustrate Condition-Action Rule with Neat sketch.

3 Relate the Nature of Environments

Demonstrate the success of an intelligent behaviour of a system with

4
Turing Test

5 List the Properties of Environment.

6 Explain Deliberate Architecture.

Summarize the ability of an Agent to communicate actions

7
or plans.
Classify the different dimensions of meaning that are associated with
8
communication.

9 Illustrate speech act theory with its three aspects.

10 Explain the Process of Argumentation.

PART - C

1 Summarize the History of AI (1940's to Present)

2 Describe the Agents and Environments and the concept of rationality.

3 Illustrate Blackboard Architecture and Moblie Architecture of the Agent.

Explain in detail about the different dimensions of meaning that are

4
associated with communication.

5 Paraphrase Negotiation interms of AI agents.

Demonstrate the bargaining problem as a pair (S,d) and A bargaining

solution is a function f that maps every
6
bargaining problem (S,d) to an outcome in S, i.e.,
f : (S,d) → S .

7 Explain in detail about the Argumentation among Agents.

UNIT - II
PART - A

1 List the various types of uninformed search algorithms.

2 Examine the Advantages and disadvantages of Breadth First Search.

3 Distinguish between Breadth First Search and Depth first Search.

4 Define Heuristics function

5 Determine the Features of Hill Climbing Algorithm.

6 Examine Different regions in the state space landscape.

7 Define Mini-Max Algorithm in Artificial Intelligence

8 Infer the Limitation of the minimax Algorithm

9 Identify the two-parameter in Alpha-beta pruning

10 List the Rules to find good ordering.

PART - B

1 Illustrate Breadth-first Search with example.

2 Demonstrate A* Search Algorithm with Advantages and Disadvantages.

3 Sketch State-space Diagram for Hill Climbing

4 Compute Steepest-Ascent hill climbing algorithm.

5 Interpret simulated Annealing

6 Develop Mini-Max Algorithm in Artificial Intelligence

7 Compute Pseudo-code for Min Max Algorithm

8 Determine the Properties of Mini-Max algorithm.

9 Explain Alpha-Beta Pruning.

10 Examine Move Ordering in Alpha-Beta pruning.

PART - C
1 Explain Uninformed Search Algorithms with Example.

2 Demonstrate A* Search Algorithm with Example.

3 Demonstrate AO* Search Algorithm with Example.

4 Describe the Types of Hill Climbing Algorithm in detail.

5 Examine the Problems in Hill Climbing Algorithm

6 Illustrate Working of Min-Max Algorithm with example.

7 Illustrate Working of Alpha-Beta Pruning with Example.