310253 - Artificial Intelligence
Question Bank for Insem
1. What is Artificial Intelligence? Explain any one application (state of the art) of AI.
2. Explain the Turing Test approach in AI.
3. What is an Agent ? Explain different types of agent along with its architecture.
4. Describe Learning Agent Architecture (aka. general learning agent)with suitable
diagrams.
5. Define and give one example for each of the following environments:
a. Fully observable vs partially observable
b. Single agent vs multiagent
c. Deterministic vs stochastic
d. Episodic vs sequential
e. Static vs dynamic
f. Discrete vs continuous
g. Known vs unknown
6. Explain the following agents with the help of a schematic diagram or pseudo code.
a. Simple reflex agent
b. Model-based agent
c. Goal-based agent
d. Utility-based agent
e. Learning agent
7. Explain in brief about the Atomic, factored and structured representation with suitable
examples.
8. Explain the significance of PEAS in AI.
9. For each of the following activities, give a PEAS description of the task environment and
characterise it in terms of the properties.
a. Playing a tennis match.
b. Performing a high jump.
c. Shopping a laptop on the Internet.
d. College selection for Engineering course
[Link] are the various components of well-defined problems and solutions and define
the same for 8 puzzle problems?
[Link] are the evaluation parameters for the algorithm’s performance?
[Link] between Uninformed search (Blind) and Informed search.
[Link] the pseudocode/algorithm for the following:
a. Breadth first search
b. Depth first search
c. Uniform cost search
d. Depth-limited tree search
e. Iterative deepening DFS
f. Bidirectional search
[Link] does the Greedy Best first search algorithm work?
[Link] does the A*algorithm work?
[Link] Heuristics. Explain the significance of Heuristic function in the informed search
with suitable examples.
[Link] the following graph using A* and Greedy Best First search algorithm
Note: grey colour value indicates
heuristic value
h(n)
A 5
B 6
C 4
D 15
X 5
Y 8
E 0
[Link] hill climbing algorithm. Explain plateau, ridge, local maxima and global maxima.
[Link] Simulated annealing algorithm.
[Link] local beam search algorithm.
[Link] genetic algorithms with examples.
