What This Document Is
This document contains practice problems designed to help students prepare for the midterm exam in CS 370, Introduction to Artificial Intelligence at New Jersey Institute of Technology (NJIT). It focuses on core search algorithms and their properties, along with a dynamic search scenario.
Why This Document Matters
This practice material is essential for students enrolled in CS 370 who want to assess their understanding of search algorithms *before* the midterm exam. Working through these problems will help identify areas needing further review and solidify key concepts. It’s intended for self-study and exam preparation, providing a focused set of challenges related to course material.
Common Limitations or Challenges
This document provides practice questions, but it does *not* include detailed solutions or explanations. It’s a tool for self-assessment, meaning students will need to rely on their understanding of the course material (lectures, readings, and assignments) to solve the problems. It also doesn’t cover all possible exam topics, serving as a focused practice set.
What This Document Provides
The full document includes:
* A series of problems exploring the equivalence of different search algorithms (Uniform Cost Search, Breadth-First Search, Depth-First Search, Greedy Search, and A* Search) under varying cost conditions.
* A dynamic A* search problem requiring analysis of how to efficiently update the optimal path after a graph edge cost changes.
* A set of multiple-choice options for each question, requiring careful consideration of algorithmic behavior.
* A scenario with example data structures (fringe, closed set, search tree, closed node map) to aid in understanding the dynamic search problem.
This preview does *not* include the solutions to the practice problems, nor does it provide detailed explanations of the concepts tested. It is intended to give you a sense of the *type* of questions you can expect on the midterm.