AI Exam Paper for GTU Semester VII
Uploaded by
feyayel988AI Exam Paper for GTU Semester VII
Uploaded by
feyayel988Common questions
Powered by AIHill climbing is a local search algorithm that optimally finds the best solution by iteratively moving towards adjacent states. The key challenges associated with hill climbing include: (1) Local maxima, where the algorithm may get stuck at a nearby suboptimal solution. (2) Plateaus, which are flat areas of the search space where no gradient exists to guide the movement. (3) Ridges, which are paths that have a high value and are difficult to navigate as the algorithm moves orthogonally to the ideal path .
Artificial intelligence (AI) refers to the creation of systems that can perform tasks that typically require human intelligence. These include reasoning, learning, and problem-solving. Machine learning (ML), a subset of AI, focuses on the development of algorithms that improve automatically through experience. While AI encompasses a broader scope of intelligent behavior in machines, ML emphasizes on enabling machines to learn from data and experience .
Breadth-first search (BFS) explores all nodes at the present depth before moving on to deeper nodes, making it complete and optimal for uniform cost problems but memory intensive. Conversely, depth-first search (DFS) goes as deep as possible along a branch before backtracking, using less memory but not guaranteeing the shortest solution. BFS is often used when the solution is close to the root, while DFS is more suitable when solutions are deep but the branching factor is manageable .
The A* algorithm combines features of both Dijkstra’s algorithm and a greedy best-first search to efficiently find the most cost-effective path. It uses a heuristic function to estimate the cost to reach the goal from a given node. A* evaluates nodes by combining g(n), the cost to reach the node, and h(n), the estimated cost from the node to the goal, forming f(n) = g(n) + h(n). This enables the algorithm to prioritize paths that appear to be leading closer to the goal, thus optimizing pathfinding by balancing current cost and future estimates .
Forward state space planning begins from the initial state and incrementally applies actions to progress towards the goal state, often generating a large number of possible states. Conversely, backward state space planning starts from the goal and works backwards by applying operators that revert actions, potentially reducing the number of states considered by focusing on relevant actions that lead directly towards the goal .
Alpha-beta pruning enhances the efficiency of the Minimax algorithm by eliminating branches in the game tree that cannot affect the final decision. It does this by maintaining two values, alpha and beta, which represent the minimum score that the maximizing player is assured of and the maximum score that the minimizing player is assured of respectively. When a branch's potential outcome does not fall within this range, it is pruned, reducing the number of nodes that need to be evaluated, and thus speeding up the decision-making process without affecting the outcome .
The Branch & bound algorithm offers several advantages, such as potentially reducing the search space by eliminating large portions of the search tree that do not need to be explored. However, it also has disadvantages, including high computational resource requirements, as it may still need to evaluate a large number of possibilities before concluding, making it unsuitable for large or complex problems .
Constraint satisfaction problems (CSPs) consist of three main components: variables, domains (possible values for each variable), and constraints (rules that restrict the values the variables can take). Challenges in CSPs include ensuring consistency, avoiding unnecessary complexity by reducing constraints without losing meaningful combinations, and choosing efficient methods for variable ordering and value assignment. They often require intelligent backtracking and heuristics to efficiently solve complex instances .
A production system in artificial intelligence consists of three primary components: (1) A set of rules or production rules, which are made up of conditions and actions. (2) A database, which represents the state of the system and is continuously updated. (3) A control system, which manages the execution of the rules based on the current state, often through an inference mechanism such as forward or backward chaining .
Topological sorting is an ordering of vertices in a directed acyclic graph (DAG) such that for every directed edge UV from vertex U to vertex V, U comes before V in the ordering. It is used in scenarios where certain tasks must be performed before others, such as scheduling, and can be achieved via algorithms like Kahn's algorithm or depth-first search-based methods .
