Introduction of Artificial Intelligence — Winter 2025

Write down any three Artificial Intelligence techniques.

Write advantages and disadvantages of Production Systems.

Write properties of Minimax Algorithm and α-β pruning algorithm.

Write down any three factors for measuring performance of Problem Solving algorithm.

Differentiate between Breadth First Search (BFS) and Depth First Search (DFS).

Write short note on Hill Climbing Algorithm.

Write short note on informed search.

Write down properties of A* algorithm.

Provide performance measurement of Best First Search in terms of Completeness Optimality, Time Complexity and Space Complexity.

Explain Recursive Best First Search (RBFS) algorithm in detail.

Write down advantages and disadvantages of Branch and Bound algorithm.

Explain Positive Sum game and Negative Sum game under non-zero sum games in brief.

Explain implementation of Branch and Bound algorithm with an example.

Write down any three assumptions about the task environment for a classical planning.

Explain in brief four planning strategies for handling indeterminancy.

Explain progression planners with an example.

Write down any three major approaches to solve planning problems.

Give comparisons between Stanford research Institute Problem Solver (STRIPS) and Action Description Language (ADL).

Explain Total Order planning with an example.

Write down steps involved in Natural Language Processing (NLP).

Write down two major components of Natural Lnaguage Processing (NLP) and explain any one in brief.

Explain Parsing methods with its merits and demerits.1

Write down names of types of Grammar in NLP.

Write down main techniques used in analyzing Natural Language Processing (NLP) and explain any one in brief.

Write down any five application of NLP and explain any two in brief.