Artificial Intelligence Unit 2 Notes AKTU (BCAI501)
AKTU · BTECH · Semester 5 · Artificial Intelligence · Unit 2 · Notes
AKTU Artificial Intelligence (BCAI501) Unit 2 notes for B.Tech Semester 5 – Problem Solving Methods. Topics: Search Strategies, Local Search Algorithms…
Open the interactive reader to study this resource on AcademicArk.
Unit 2: Problem Solving Methods – AKTU syllabus topics
- Search Strategies: Uninformed Search, Informed Search, Heuristics
- Local Search Algorithms: Optimization Problems
- Partial Observation Search
- Constraint Satisfaction Problems: Constraint Propagation, Backtracking Search
- Game Playing: Optimal Decisions in Games, Alpha Beta Pruning, Stochastic Games
Most asked AKTU PYQ questions from Unit 2
- Q2b. Solve a problem using depth-first search (DFS) and show the path explored. (7 marks, 2025-26)
- Q1e. Explain Uniform-cost search algorithm. (2 marks, 2023-24)
- Q6b. Discuss the importance of a well-defined problem representation in the success of backtracking algorithms (10 marks, 2023-24)
- Q4a. Explain the formulation and solution techniques of Constraint Satisfaction Problems (CSP) with examples. (7 marks, 2025-26)
- Q4a. Discuss the structure and components of a Constraint Satisfaction Problem (CSP). (7 marks, 2024-25)
- Q2b. Explain the difference between uninformed and informed search strategies with examples. (7 marks, 2024-25)
- Q1d. Define optimal decision in games. (2 marks, 2025-26)
- Q1d. What is a Constraint Satisfaction Problem (CSP)? (2 marks, 2024-25)
- Q1f. Define backtracking in the context of search algorithms. (2 marks, 2023-24)
- Q1c. Define Backtracking Search. (2 marks, 2022-23)
AKTU paper codes: BCAI501, KCAI501
Other Artificial Intelligence units
Artificial Intelligence previous year papers
More Artificial Intelligence resources
More versions of this resource
Browse all notes · Semester 5 notes