{"pinia":{"ui":{"prefs":{"theme":"system","textScale":"md","fontFamily":"sans","reducedMotion":false,"highContrast":false}},"academy":{"universities":[],"universitySummaries":[{"slug":"rtu","name":"RTU","fullName":"Rajasthan Technical University","branches":[{"slug":"first-year-common","name":"First Year (Common)"},{"slug":"computer-science","name":"Computer Science"},{"slug":"mechanical","name":"Mechanical"},{"slug":"civil","name":"Civil"},{"slug":"ai-data-science","name":"AI & Data Science"},{"slug":"ee-ec-eee","name":"EE / EC / EEE"}]},{"slug":"aktu","name":"AKTU","fullName":"Dr. A. P. J. Abdul Kalam Technical University","branches":[{"slug":"first-year-common","name":"First Year (Common)"},{"slug":"computer-science","name":"Computer Science"}]}],"activePapers":[{"id":"principles-of-artificial-intelligence-2023","title":"Principles of Artificial Intelligence (2023)","subjectSlug":"principles-of-artificial-intelligence","subjectName":"Principles of Artificial Intelligence","universitySlug":"rtu","branchSlug":"computer-science","year":3,"semester":6,"examYear":2023,"paperCode":"6E7105","questions":[{"id":"v2-principles-of-artificial-intelligence-2023-pA-q1","number":1,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"Define Artificial Intelligence."}],"answer":{"summary":"Artificial Intelligence is the study and design of intelligent agents that perceive their environment and take actions that maximize their chances of success.","explanation":[{"type":"paragraph","content":"Artificial Intelligence is the study and design of intelligent agents that perceive their environment and take actions that maximize their chances of success. It focuses on simulating human intelligence in machines to perform tasks such as learning, reasoning, and problem-solving."}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pA-q2","number":2,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is a rational agent?"}],"answer":{"summary":"A rational agent is one that acts to achieve the best outcome or the best expected outcome when there is uncertainty.","explanation":[{"type":"paragraph","content":"A rational agent is one that acts to achieve the best outcome or, when there is uncertainty, the best expected outcome. It selects actions based on its percepts and built-in knowledge to maximize its performance measure."}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pA-q3","number":3,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"State the difference between blind search and heuristic search."}],"answer":{"summary":"Blind search explores the state space without domain-specific knowledge, whereas heuristic search uses problem-specific knowledge to find solutions efficiently.","explanation":[{"type":"paragraph","content":"Blind search (or uninformed search) explores the state space without domain-specific knowledge about the goal, relying only on the problem definition. Heuristic search (or informed search) uses problem-specific knowledge, such as an evaluation function, to guide the search and find solutions more efficiently."}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pA-q4","number":4,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"Define admissible heuristic."}],"answer":{"summary":"An admissible heuristic is an evaluation function that never overestimates the true cost to reach the goal from the current node.","explanation":[{"type":"paragraph","content":"An admissible heuristic is a heuristic function that never overestimates the true cost to reach the goal from the current node. It is inherently optimistic and ensures that optimal search algorithms like A* will always find the shortest path."}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pA-q5","number":5,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is the Turing Test?"}],"answer":{"summary":"The Turing Test is a test of a machine's ability to exhibit intelligent behavior indistinguishable from that of a human.","explanation":[{"type":"paragraph","content":"The Turing Test, proposed by Alan Turing, is a test of a machine's ability to exhibit intelligent behavior equivalent to, or indistinguishable from, that of a human. A human evaluator judges natural language conversations between a human and a machine."}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pA-q6","number":6,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"Explain the concept of Alpha-Beta pruning."}],"answer":{"summary":"Alpha-Beta pruning is an optimization technique for the minimax algorithm that reduces the number of evaluated nodes by pruning branches that cannot influence the decision.","explanation":[{"type":"paragraph","content":"Alpha-Beta pruning is an optimization technique for the minimax algorithm that reduces the number of nodes evaluated by pruning branches that cannot possibly influence the final decision. This allows the search to go deeper into the game tree within the same time limit."}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pA-q7","number":7,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is First Order Logic (FOL)?"}],"answer":{"summary":"First Order Logic is a formal logical system that uses quantified variables over objects to express complex relationships.","explanation":[{"type":"paragraph","content":"First Order Logic (FOL), also known as Predicate Logic, is a formal logical system that uses quantified variables over non-logical objects. Unlike propositional logic, it allows the representation of objects, properties, and relations, making it much more expressive."}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pA-q8","number":8,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"Define Forward Chaining."}],"answer":{"summary":"Forward Chaining is a data-driven reasoning method that applies inference rules to known facts to extract more data until a goal is reached.","explanation":[{"type":"paragraph","content":"Forward Chaining is a data-driven reasoning method that starts with known facts and applies inference rules to extract more data until a specific goal is reached. It is commonly used in expert systems and production rule systems."}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pA-q9","number":9,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is an Expert System?"}],"answer":{"summary":"An Expert System is a computer program that emulates the decision-making ability of a human expert using a knowledge base and inference rules.","explanation":[{"type":"paragraph","content":"An Expert System is an AI computer system that emulates the decision-making ability of a human expert. It operates by utilizing a rich knowledge base of facts and a set of inference rules to solve complex problems in a specific domain."}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pA-q10","number":10,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"State Bayes' Theorem."}],"answer":{"summary":"Bayes' Theorem provides a way to calculate the probability of a hypothesis based on prior knowledge and new evidence.","explanation":[{"type":"paragraph","content":"Bayes' Theorem describes the probability of an event, based on prior knowledge of conditions that might be related to the event. The formula is P(A|B) = [P(B|A) * P(A)] / P(B), where P(A|B) is the posterior probability."}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pB-q1","number":11,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Explain the PEAS description for an automated taxi driver."}],"answer":{"summary":"The PEAS description for an automated taxi driver involves Performance, Environment, Actuators, and Sensors specifically tailored for driving.","explanation":[{"type":"paragraph","content":"The PEAS (Performance, Environment, Actuators, Sensors) description defines the task environment of an intelligent agent. For an automated taxi driver:"},{"type":"paragraph","content":"- Performance Measure: Safety, reaching the destination efficiently, maximizing profit, obeying traffic laws, and passenger comfort."},{"type":"paragraph","content":"- Environment: City roads, highways, traffic lights, pedestrians, other vehicles, and varying weather conditions."},{"type":"paragraph","content":"- Actuators: Steering wheel, accelerator, brakes, horn, turn signals, and display screens."},{"type":"paragraph","content":"- Sensors: Cameras, LIDAR, GPS, speedometer, odometer, engine sensors, and microphones."}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pB-q2","number":12,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Describe the A* search algorithm and its properties."}],"answer":{"summary":"A* search is an optimal and complete informed search algorithm that uses both path cost and heuristic estimates to find the shortest path.","explanation":[{"type":"paragraph","content":"A* search is a best-first search algorithm that finds the least-cost path from a given initial node to a goal node. It evaluates nodes by combining the cost to reach the node, g(n), and the estimated cost to get from the node to the goal, h(n). The evaluation function is f(n) = g(n) + h(n)."},{"type":"paragraph","content":"Properties of A* include Completeness and Optimality. It is guaranteed to find a solution if one exists (Complete). Furthermore, it will always find the optimal (lowest cost) path, provided that the heuristic function h(n) is admissible, meaning it never overestimates the actual cost to reach the goal."}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pB-q3","number":13,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Explain the Minimax algorithm with an example."}],"answer":{"summary":"The Minimax algorithm is a decision-making strategy in two-player zero-sum games where players try to maximize their score while minimizing the opponent's.","explanation":[{"type":"paragraph","content":"The Minimax algorithm is a recursive or backtracking algorithm used in decision-making and game theory. It provides an optimal move for a player assuming that the opponent is also playing optimally. The algorithm constructs a game tree where nodes represent game states."},{"type":"paragraph","content":"In a two-player zero-sum game, one player is the 'Maximizer' trying to get the highest possible score, and the other is the 'Minimizer' trying to get the lowest score. For example, in a game of Tic-Tac-Toe, if X is the Maximizer, X will choose the move that leads to the highest evaluated terminal node (+1 for win), assuming O will always choose the move that leads to the lowest evaluated node (-1 for X loss)."}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pB-q4","number":14,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Convert the following sentence into First Order Logic: \"Every student who takes AI passes it.\""}],"answer":{"summary":"The sentence is converted using the universal quantifier and implications representing Student, Takes, and Passes predicates.","explanation":[{"type":"paragraph","content":"To convert the sentence \"Every student who takes AI passes it\" into First Order Logic (FOL), we first define the necessary predicates:"},{"type":"paragraph","content":"- S(x): x is a student"},{"type":"paragraph","content":"- T(x, y): x takes course y"},{"type":"paragraph","content":"- P(x, y): x passes course y"},{"type":"paragraph","content":"The sentence states a condition that applies to all entities x. Therefore, we use the universal quantifier (∀). The logical representation is: ∀x (S(x) ∧ T(x, AI) → P(x, AI)). This reads as: For all x, if x is a student and x takes AI, then x passes AI."}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pB-q5","number":15,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Differentiate between Propositional Logic and First Order Logic."}],"answer":{"summary":"Propositional logic uses simple factual statements, while First Order logic uses objects, predicates, and quantifiers for richer representation.","explanation":[{"type":"paragraph","content":"Propositional Logic deals with simple declarative propositions that evaluate to either true or false. It uses symbols like P, Q, and logical connectives (AND, OR, NOT). However, it lacks the expressive power to describe properties of objects or relationships between them."},{"type":"paragraph","content":"First Order Logic (FOL), or Predicate Logic, is an extension that includes objects, predicates, functions, and quantifiers (Universal ∀ and Existential ∃). While propositional logic can only say \"Socrates is a man\" as a single indivisible fact (P), FOL can represent it as Man(Socrates), allowing reasoning like \"All men are mortal\" (∀x Man(x) → Mortal(x)) to deduce Mortal(Socrates)."}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pB-q6","number":16,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Explain the architecture of a typical Expert System."}],"answer":{"summary":"A typical Expert System comprises a Knowledge Base, an Inference Engine, and a User Interface.","explanation":[{"type":"paragraph","content":"The architecture of a typical Expert System involves three primary components:"},{"type":"paragraph","content":"1. Knowledge Base: It contains the domain-specific, high-quality knowledge extracted from human experts. It stores facts, rules (usually IF-THEN statements), and relationships regarding the problem domain."},{"type":"paragraph","content":"2. Inference Engine: This is the brain of the expert system. It processes the rules and facts in the knowledge base to deduce new information, evaluate hypotheses, and reach conclusions using forward or backward chaining."},{"type":"paragraph","content":"3. User Interface: This allows the end-user to interact with the system. It accepts user queries, passes them to the inference engine, and displays the final decision along with explanations for the reasoning process."}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pB-q7","number":17,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Discuss the components of a Natural Language Processing system."}],"answer":{"summary":"An NLP system processes language through multiple stages: Lexical, Syntactic, Semantic, Discourse, and Pragmatic analysis.","explanation":[{"type":"paragraph","content":"A complete Natural Language Processing (NLP) system generally consists of five core components or phases:"},{"type":"paragraph","content":"- Lexical Analysis: Divides the text into paragraphs, sentences, and words. It involves identifying and analyzing the structure of words."},{"type":"paragraph","content":"- Syntactic Analysis (Parsing): Analyzes the sentences to check for grammar and proper word arrangements, creating a parse tree."},{"type":"paragraph","content":"- Semantic Analysis: Extracts the exact dictionary meaning from the text, checking for meaningfulness (e.g., rejecting \"hot ice\")."},{"type":"paragraph","content":"- Discourse Integration: Determines the meaning of sentences based on preceding sentences and context."},{"type":"paragraph","content":"- Pragmatic Analysis: Applies real-world knowledge to reinterpret the sentence and understand the speaker's actual intended effect or meaning."}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pC-q1","number":18,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Explain the various types of Intelligent Agents with their block diagrams."}],"answer":{"summary":"Intelligent Agents are categorized into Simple Reflex, Model-Based, Goal-Based, and Utility-Based agents, each with increasing complexity.","explanation":[{"type":"paragraph","content":"Intelligent Agents can be categorized into four main types based on their degree of perceived intelligence and capability:"},{"type":"paragraph","content":"1. Simple Reflex Agents: These agents select actions based solely on the current percept, ignoring the rest of the percept history. They function purely on condition-action rules (if-then rules). They are efficient but have limited capability and fail in partially observable environments."},{"type":"paragraph","content":"2. Model-Based Reflex Agents: These agents handle partial observability by keeping track of the part of the world they cannot see now. They maintain an internal state that depends on the percept history. They require two kinds of knowledge: how the world evolves independently of the agent and how the agent's actions affect the world."},{"type":"paragraph","content":"3. Goal-Based Agents: Beyond knowing the current state, these agents need goal information that describes desirable situations. They search through possible sequences of actions to find one that achieves the goal, making them more flexible than reflex agents."},{"type":"paragraph","content":"4. Utility-Based Agents: While goals just provide a binary 'happy' or 'unhappy' state, a utility function provides a degree of happiness. These agents evaluate states based on a utility measure, allowing them to choose the 'best' action when multiple safe paths to the goal exist or when goals conflict."},{"type":"svg","src":"/assets/diagrams/rtu/cs/3/principles-of-artificial-intelligence/diagram-18.svg","alt":"Intelligent Agents Architecture Diagram","caption":"Block diagram of different types of Intelligent Agents"}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pC-q2","number":19,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Solve the 8-puzzle problem using Hill Climbing search. Explain the algorithm and its drawbacks."}],"answer":{"summary":"Hill Climbing is a local search algorithm that can be applied to the 8-puzzle problem, but it suffers from local maxima, ridges, and plateau issues.","explanation":[{"type":"paragraph","content":"The 8-puzzle consists of a 3x3 grid with 8 numbered tiles and one blank space. The objective is to reach a specific goal configuration from an initial state by sliding tiles horizontally or vertically into the blank space."},{"type":"paragraph","content":"Hill Climbing Search is a local search algorithm that continuously moves in the direction of increasing elevation (or decreasing cost) to find the peak of the mountain (the best state). For the 8-puzzle, a heuristic function h(n) is used, such as the Manhattan distance or the number of misplaced tiles. The algorithm evaluates all neighboring states (possible moves) and always moves to the neighbor that has the strictly lowest heuristic value."},{"type":"paragraph","content":"Algorithm Steps:"},{"type":"paragraph","content":"1. Evaluate the initial state. If it is a goal state, return it."},{"type":"paragraph","content":"2. Loop until a solution is found or no better neighbors exist: Select a neighboring state with the best heuristic value. If this value is worse than or equal to the current state, stop and return the current state."},{"type":"paragraph","content":"Drawbacks:"},{"type":"paragraph","content":"- Local Maxima: A state that is better than all its neighbors but is not the global optimal goal. The algorithm gets stuck here."},{"type":"paragraph","content":"- Ridges: A sequence of local maxima that is difficult for single-move algorithms to navigate."},{"type":"paragraph","content":"- Plateaus: A flat area of the search space where all neighbors have the same value, causing the search to wander aimlessly."},{"type":"svg","src":"/assets/diagrams/rtu/cs/3/principles-of-artificial-intelligence/diagram-19.svg","alt":"Hill Climbing Search Diagram","caption":"Hill Climbing Search applied to 8-puzzle with local maximum trap"}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pC-q3","number":20,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Describe the Constraint Satisfaction Problem (CSP) with the help of the Map Coloring problem."}],"answer":{"summary":"A Constraint Satisfaction Problem involves assigning values to variables subject to constraints, perfectly illustrated by the Map Coloring problem.","explanation":[{"type":"paragraph","content":"A Constraint Satisfaction Problem (CSP) is a mathematical problem defined as a set of objects whose state must satisfy a number of constraints or limitations. A CSP consists of three components: Variables (X), Domains (D), and Constraints (C)."},{"type":"paragraph","content":"Map Coloring Problem:"},{"type":"paragraph","content":"The goal is to color a map of regions such that no two adjacent regions share the same color. For example, coloring the map of Australia:"},{"type":"paragraph","content":"- Variables (X): The regions of Australia, e.g., Western Australia (WA), Northern Territory (NT), South Australia (SA), Queensland (Q), New South Wales (NSW), Victoria (V), and Tasmania (T)."},{"type":"paragraph","content":"- Domains (D): The set of available colors, e.g., {Red, Green, Blue}."},{"type":"paragraph","content":"- Constraints (C): The rule that adjacent regions cannot have the same color. Expressed as SA != WA, SA != NT, etc."},{"type":"paragraph","content":"Solving the CSP involves search algorithms with backtracking, forward checking, or constraint propagation (like arc consistency) to assign colors systematically while ensuring no constraints are violated."},{"type":"svg","src":"/assets/diagrams/rtu/cs/3/principles-of-artificial-intelligence/diagram-20.svg","alt":"Map Coloring CSP Diagram","caption":"Constraint Graph for Map Coloring of Australia"}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pC-q4","number":21,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Explain the conceptual dependency and semantic networks for knowledge representation."}],"answer":{"summary":"Conceptual Dependency and Semantic Networks are graphical knowledge representation frameworks used to depict the meaning of sentences and relationships between concepts.","explanation":[{"type":"paragraph","content":"Knowledge Representation involves structuring information so that a computer system can process it intelligently. Two prominent graphical methods are Conceptual Dependency and Semantic Networks."},{"type":"paragraph","content":"Semantic Networks:"},{"type":"paragraph","content":"A semantic network is a directed graph consisting of nodes, which represent objects or concepts, and links (edges), which represent semantic relations between them (e.g., 'IS-A', 'HAS-A'). It provides an intuitive way to represent taxonomies and inheritance. For example, a node 'Bird' might have an 'IS-A' link to 'Animal' and a 'HAS-A' link to 'Wings'."},{"type":"paragraph","content":"Conceptual Dependency (CD):"},{"type":"paragraph","content":"Developed by Roger Schank, Conceptual Dependency represents the underlying meaning of a natural language sentence independent of the specific words used. It uses a set of primitive actions (e.g., ATRANS for transfer of abstract relationship, PTRANS for physical transfer, INGEST) to break down complex actions."},{"type":"paragraph","content":"CD graphs show the actor, the action, the object being acted upon, and the direction of the action. This abstraction allows the system to recognize that 'John gave a book to Mary' and 'Mary received a book from John' share the identical core conceptual meaning."},{"type":"svg","src":"/assets/diagrams/rtu/cs/3/principles-of-artificial-intelligence/diagram-21.svg","alt":"Semantic Network Diagram","caption":"Example of a Semantic Network depicting inheritance"}]}},{"id":"v2-principles-of-artificial-intelligence-2023-pC-q5","number":22,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Explain Bayesian Networks. Construct a Bayesian network for a medical diagnosis scenario."}],"answer":{"summary":"Bayesian Networks are probabilistic graphical models representing variables and their conditional dependencies via a directed acyclic graph.","explanation":[{"type":"paragraph","content":"A Bayesian Network (or Belief Network) is a probabilistic graphical model that represents a set of random variables and their conditional dependencies via a Directed Acyclic Graph (DAG). Nodes represent random variables, and directed edges represent causal relationships or conditional dependencies. Each node is associated with a Conditional Probability Table (CPT) that quantifies the effect of the parents on the node."},{"type":"paragraph","content":"Bayesian Networks are highly effective for reasoning under uncertainty, allowing for both predictive (forward) reasoning and diagnostic (backward) reasoning."},{"type":"paragraph","content":"Medical Diagnosis Scenario:"},{"type":"paragraph","content":"Consider a simple medical network where 'Smoking' and 'Genetics' are root causes. Both can lead to 'Lung Cancer'. 'Lung Cancer' can subsequently cause 'Fatigue' and a 'Positive X-Ray'."},{"type":"paragraph","content":"The DAG would have nodes for S (Smoking), G (Genetics), C (Cancer), F (Fatigue), and X (X-Ray). Edges would be S->C, G->C, C->F, and C->X. Using Bayes' Theorem, if a patient presents with Fatigue and a Positive X-Ray, the network can calculate the updated probability that the patient has Lung Cancer."},{"type":"svg","src":"/assets/diagrams/rtu/cs/3/principles-of-artificial-intelligence/diagram-22.svg","alt":"Bayesian Network Diagram","caption":"Bayesian Network for Medical Diagnosis"}]}}]},{"id":"principles-of-artificial-intelligence-2024","title":"Principles of Artificial Intelligence (2024)","subjectSlug":"principles-of-artificial-intelligence","subjectName":"Principles of Artificial Intelligence","universitySlug":"rtu","branchSlug":"computer-science","year":3,"semester":6,"examYear":2024,"paperCode":"6E7105","questions":[{"id":"v2-principles-of-artificial-intelligence-2024-pA-q1","number":1,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is the physical symbol system hypothesis?"}],"answer":{"summary":"The Physical Symbol System Hypothesis mathematically asserts that any physical system capable of aggressively manipulating discrete symbols possesses the necessary and sufficient architecture for general intelligent action.","explanation":[{"type":"paragraph","content":"Formulated by Newell and Simon, the Physical Symbol System Hypothesis is the absolute philosophical foundation of classical AI. It mathematically postulates that human intelligence is not biological magic, but strictly the algorithmic manipulation of physical symbols (like a Turing machine). If a computer can violently execute these symbolic rules, it will mathematically achieve Artificial General Intelligence."}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pA-q2","number":2,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"Define state-space search."}],"answer":{"summary":"State-space search is a strict mathematical architecture representing problem-solving as the aggressive algorithmic exploration of a massive graph, moving from an Initial State to a Goal State.","explanation":[{"type":"paragraph","content":"In AI, problems are mathematically translated into a State-Space. It consists of an Initial State, a massive set of possible intermediate States, a Goal State, and specific mathematical Operators (Actions) that transition between states. Algorithms like A* violently search this massive graph to find the absolute mathematically optimal path to the Goal."}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pA-q3","number":3,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is a heuristic function?"}],"answer":{"summary":"A heuristic function is a mathematically estimated evaluation function that aggressively predicts the absolute lowest remaining cost from the current state to the ultimate goal state.","explanation":[{"type":"paragraph","content":"In informed search algorithms like A*, the heuristic function, denoted strictly as $h(n)$, mathematically guesses the remaining distance to the goal (e.g., straight-line Euclidean distance in a maze). It violently prunes the massive search tree by forcing the algorithm to aggressively explore only the most mathematically promising mathematical paths."}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pA-q4","number":4,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"Explain the concept of Resolution in logic."}],"answer":{"summary":"Resolution is an absolute, mathematically sound inference rule utilized in Propositional and First-Order Logic to violently prove theorems by generating a contradiction from negated clauses.","explanation":[{"type":"paragraph","content":"Resolution is a complete inference architecture. To prove a statement $P$ is mathematically True given a Knowledge Base (KB), the AI violently negates $P$ (creating $\\neg P$) and adds it to the KB. It then strictly applies the Resolution rule to cancel out complementary literals. If it derives an empty clause (absolute contradiction), it mathematically proves the original $P$ was True."}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pA-q5","number":5,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is a Horn clause?"}],"answer":{"summary":"A Horn clause is a highly restricted mathematical architecture in propositional logic consisting of a disjunction of literals with strictly at most one positive, unnegated literal.","explanation":[{"type":"paragraph","content":"A Horn clause mathematically forces logic into a strict \"If-Then\" architecture. It is written as $\\neg P_1 \\lor \\neg P_2 \\dots \\lor Q$, which logically translates to $(P_1 \\land P_2 \\dots) \\Rightarrow Q$. This rigid mathematical restriction allows logic programming languages like PROLOG to execute incredibly violent and efficient Forward and Backward chaining algorithms."}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pA-q6","number":6,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"Define Unification in AI."}],"answer":{"summary":"Unification is the strict algorithmic process in First-Order Logic that mathematically discovers absolute variable substitutions to make two distinctly different logical expressions perfectly identical.","explanation":[{"type":"paragraph","content":"During logical inference, the AI must match rules. If the Knowledge Base contains `Knows(John, x)` and a query asks for `Knows(John, Mary)`, the Unification algorithm violently calculates the exact mathematical substitution: $\\theta = \\{x / \\text{Mary}\\}$. This substitution makes the two expressions mathematically identical, allowing the inference engine to proceed."}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pA-q7","number":7,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is Semantic Web?"}],"answer":{"summary":"The Semantic Web is an advanced architectural extension of the internet that violently forces data into strict, machine-readable mathematical ontologies (RDF/OWL) allowing AI agents autonomous understanding.","explanation":[{"type":"paragraph","content":"Current web pages are designed strictly for humans. The Semantic Web mathematically tags internet data using Resource Description Framework (RDF) and Web Ontology Language (OWL). It transforms a chaotic web page into a rigid mathematical database, allowing autonomous AI agents to violently traverse the web, query data logically, and execute complex deductions without human intervention."}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pA-q8","number":8,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"Explain the term 'Machine Learning'."}],"answer":{"summary":"Machine Learning is a mathematical subfield of AI where algorithms violently extract hidden patterns from massive datasets, aggressively improving their predictive performance without being explicitly programmed.","explanation":[{"type":"paragraph","content":"Unlike classical AI which relies on hardcoded logical rules (Expert Systems), Machine Learning utilizes massive mathematical optimization algorithms (like Gradient Descent). The architecture ingests millions of data points and mathematically alters its own internal weights to violently minimize a Loss Function, allowing it to predict future unseen data."}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pA-q9","number":9,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"Define fuzzy logic."}],"answer":{"summary":"Fuzzy Logic is a mathematical architecture that completely abandons absolute binary True/False logic, replacing it with continuous degrees of truth ranging strictly between $0.0$ and $1.0$.","explanation":[{"type":"paragraph","content":"Standard Boolean logic dictates a person is either absolutely \"Tall\" (1) or \"Not Tall\" (0). Fuzzy Logic utilizes complex mathematical Membership Functions. A person of 5'9\" might have a mathematical truth value of $0.6$ for the \"Tall\" set. It violently enables AI to handle the chaotic ambiguity of the real physical world."}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pA-q10","number":10,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is a Game Tree?"}],"answer":{"summary":"A Game Tree is a massive, directed mathematical graph architecture used in adversarial AI to strictly map every single possible sequence of moves in a competitive environment.","explanation":[{"type":"paragraph","content":"In games like Chess, the Initial State is the root node. Every legal move generates a branch to a new child node (the resulting board state). The Game Tree expands exponentially until it reaches terminal end-game states. The AI violently searches this massive mathematical tree using the Minimax algorithm to deduce the absolute optimal move."}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pB-q1","number":11,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Explain the properties of a good knowledge representation system."}],"answer":{"summary":"A critical exposition on the absolute properties required for a mathematically sound Knowledge Representation (KR) system, focusing on Representational Adequacy, Inferential Efficiency, and Acquisitional Efficiency.","explanation":[{"type":"heading","content":"Properties of an Optimal Knowledge Representation System"},{"type":"paragraph","content":"A Knowledge Representation (KR) system (like First-Order Logic or Semantic Networks) is the absolute foundational architecture that allows an AI to mathematically store and manipulate facts about the universe. To be viable, a KR system must violently enforce four strict mathematical properties."},{"type":"subheading","content":"1. Representational Adequacy"},{"type":"paragraph","content":"The absolute most critical property. The architecture must possess the mathematical vocabulary to represent EVERY SINGLE fact, relationship, and constraint that exists in the specific problem domain. If the AI is diagnosing cancer, the KR must be able to mathematically represent complex biological probabilities and time-series mutations. Propositional Logic often fails here because it cannot mathematically represent \"All humans are mortal\" without explicitly listing every human."},{"type":"subheading","content":"2. Inferential Adequacy"},{"type":"paragraph","content":"Storing data is useless if the AI cannot generate new knowledge. The system must possess strict algorithmic inference rules (like Modus Ponens or Resolution). It must be able to mathematically violently combine existing facts in the Knowledge Base to deduce absolute, previously unknown truths."},{"type":"subheading","content":"3. Inferential Efficiency"},{"type":"paragraph","content":"The inference algorithms cannot run until the heat death of the universe. The KR must be structured to allow highly aggressive, lightning-fast heuristic searches. This is why Horn Clauses are used in PROLOG; they severely restrict Representational Adequacy but provide catastrophic, mathematically explosive Inferential Efficiency."},{"type":"subheading","content":"4. Acquisitional Efficiency"},{"type":"paragraph","content":"The system must easily accept new data. If adding a single new fact requires an engineer to manually rewrite 5,000 lines of existing logical constraints, the architecture is a failure. It must support automated mathematical updates (like Machine Learning weights or automated ontological merging)."}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pB-q2","number":12,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Describe the Depth First Search algorithm with its advantages and disadvantages."}],"answer":{"summary":"An algorithmic breakdown of Depth-First Search (DFS). Violently contrasts its phenomenal memory efficiency against its catastrophic failure to guarantee optimality in infinite state-space architectures.","explanation":[{"type":"heading","content":"Depth-First Search (DFS) Architecture"},{"type":"paragraph","content":"Depth-First Search (DFS) is a massive, blind, uninformed search algorithm. When navigating a mathematical State-Space Tree, it violently plunges down the absolute deepest, leftmost branch possible. It continues this aggressive dive until it either hits a dead-end (a leaf node) or finds the ultimate goal."},{"type":"subheading","content":"The Algorithmic Execution (LIFO Stack)"},{"type":"list","items":["1. The root node is aggressively pushed onto a Last-In-First-Out (LIFO) Stack data structure.","2. The AI violently pops the top node, checks if it is the Goal. If not, it mathematically generates ALL of its children.","3. It violently pushes these new children onto the top of the stack.","4. Because the stack is LIFO, the AI is mathematically forced to immediately explore the newest, deepest child it just discovered, utterly ignoring the shallower nodes sitting at the bottom of the stack."]},{"type":"subheading","content":"Architectural Advantages"},{"type":"paragraph","content":"Its absolute greatest merit is **Memory (Space) Efficiency**. Unlike Breadth-First Search (BFS) which must violently store every single node at a given depth (costing exponential RAM, $O(b^d)$), DFS only stores the single path it is currently on and the unexpanded siblings. Its mathematical space complexity is strictly linear: $O(b \\times m)$, where $b$ is the branching factor and $m$ is the maximum depth. It can search massive graphs using almost zero RAM."},{"type":"subheading","content":"Architectural Disadvantages"},{"type":"list","items":["**Not Optimal:** It violently grabs the first solution it finds. If a path of length 5 is down the left branch, and a path of length 2 is down the right branch, DFS will output the length 5 path.","**Not Complete:** If the graph possesses an infinite loop (e.g., $A \\rightarrow B \\rightarrow A$), DFS will plunge into the loop and mathematically hang forever, never finding the goal."]}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pB-q3","number":13,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Explain the process of Knowledge Acquisition in Expert Systems."}],"answer":{"summary":"A definitive guide to Knowledge Acquisition in Expert Systems. Details the horrific architectural bottleneck of manually extracting subconscious heuristic logic from human domain experts and violently translating it into strict mathematical IF-THEN rules.","explanation":[{"type":"heading","content":"Knowledge Acquisition in Expert Systems"},{"type":"paragraph","content":"An Expert System (like MYCIN for blood infections) is entirely dependent on its Knowledge Base. The physical hardware is useless without the data. **Knowledge Acquisition** is the highly aggressive, incredibly difficult architectural process of extracting absolute domain knowledge from a human expert and mathematically encoding it into the machine."},{"type":"subheading","content":"The Feigenbaum Bottleneck"},{"type":"paragraph","content":"This process is universally recognized as the absolute greatest bottleneck in AI architecture. Human experts (like senior doctors) utilize \"Subconscious Heuristics.\" They look at a patient and \"just know\" the diagnosis. They mathematically struggle to explain the exact rigid IF-THEN rules they used. The AI engineer (the Knowledge Engineer) must violently force the human to break down their intuition into strict, programmable logic."},{"type":"subheading","content":"The Algorithmic Steps"},{"type":"list","items":["**1. Elicitation:** The Knowledge Engineer executes highly structured interviews, case-study analyses, and protocol analysis (forcing the expert to think aloud while solving a problem).","**2. Interpretation:** The Engineer mathematically analyzes the interview transcripts to identify the absolute core concepts, objects, and relationships.","**3. Formalization:** The extracted concepts are violently forced into a rigid mathematical Knowledge Representation architecture (e.g., translating \"If the patient has a high fever, they might have an infection\" into strictly weighted PROLOG rules: `infection(X) :- fever(X, high), CF 0.8`).","**4. Verification & Validation:** The Expert System is fed test cases. The output is aggressively compared against the human expert's output. If it fails, the rules are violently mathematically tweaked until perfection is achieved."]}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pB-q4","number":14,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Discuss the concept of Simulated Annealing."}],"answer":{"summary":"A detailed theoretical exposition on Simulated Annealing. Explains how the architecture mathematically injects randomized \"bad\" moves based on a decaying Temperature parameter to violently rip the algorithm out of local minima traps.","explanation":[{"type":"heading","content":"Simulated Annealing Architecture"},{"type":"paragraph","content":"Standard local search algorithms (like Hill Climbing) suffer a catastrophic mathematical flaw: they get permanently trapped in **Local Maxima/Minima**. They aggressively climb the nearest hill, reach the top, look around, see that every step is down, and halt, completely missing the massive Mount Everest located just across a small valley. **Simulated Annealing** is the absolute mathematical solution to this crisis, inspired by the physical metallurgy process of cooling molten metals."},{"type":"subheading","content":"The Mathematical Mechanism"},{"type":"paragraph","content":"The algorithm violently alters the standard Hill Climbing logic by intentionally injecting Chaos (Probability)."},{"type":"list","items":["**The Temperature Parameter ($T$):** The algorithm initializes with a massive mathematical \"Temperature.\" When $T$ is high, the system is chaotic and molten.","**Accepting Bad Moves:** In Hill Climbing, a move that worsens the score is absolutely rejected. In Simulated Annealing, if a move is worse (it goes down into the valley), the algorithm calculates a strict mathematical probability based on the Boltzmann distribution: $P = e^{\\Delta E / T}$.","**The Escape:** Because $T$ is massive at the beginning, this probability $P$ is very high. The AI will frequently and aggressively accept \"bad\" moves. This violently throws the algorithm out of the local minimum trap and across the valley.","**The Cooling Schedule:** Over time, the algorithm mathematically decays $T$ (cooling). As $T$ approaches zero, the probability of accepting bad moves drops to absolute zero. The chaotic system crystallizes, locking into a standard, greedy Hill Climb right as it hits the global maximum."]}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pB-q5","number":15,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Differentiate between Forward Chaining and Backward Chaining."}],"answer":{"summary":"An architectural comparison of Forward and Backward Chaining inference engines. Contrasts the data-driven explosive generation of Forward Chaining against the highly directed, goal-driven mathematical execution of Backward Chaining.","explanation":[{"type":"heading","content":"Forward Chaining vs. Backward Chaining Architecture"},{"type":"paragraph","content":"In Rule-Based AI (Expert Systems), the Inference Engine utilizes strict mathematical algorithms to deduce truths from a Knowledge Base of `IF-THEN` rules. The two absolute dominant algorithms are Forward and Backward Chaining, executing in completely opposite architectural directions."},{"type":"subheading","content":"1. Forward Chaining (Data-Driven)"},{"type":"list","items":["**Mechanism:** It begins with the raw absolute Facts. It aggressively searches the Knowledge Base for any rules where the `IF` condition mathematically matches the known facts. It fires the rule, deducing a brand new fact (the `THEN` part). It adds this new fact to the database and repeats the entire violent cycle until no new rules can fire.","**Use Case:** Highly optimal for systems where you have all the data upfront and want to see what happens (e.g., Weather Forecasting. \"If Pressure is Low, and Humidity is High $\\rightarrow$ Rain\").","**Demerit:** Catastrophically inefficient. It might fire 10,000 rules deducing useless facts completely unrelated to the user's actual question."]},{"type":"subheading","content":"2. Backward Chaining (Goal-Driven)"},{"type":"list","items":["**Mechanism:** It begins with the Goal (the Hypothesis). The user asks, \"Does the patient have Malaria?\" The algorithm mathematically works backward. It finds the rule `IF X and Y THEN Malaria`. It then aggressively spawns sub-goals: \"Is X true? Is Y true?\" It searches the database for X. If X is unknown, it searches for a rule that concludes X, and chains violently backward until it hits raw facts or asks the user.","**Use Case:** Highly optimal for Medical Diagnostics (PROLOG uses this natively). The AI does not blindly deduce every disease; it strictly focuses on proving the specific hypothesis.","**Merit:** Absolutely mathematically efficient. It only explores the exact logical paths required to prove the goal, ignoring 99% of the irrelevant Knowledge Base."]}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pB-q6","number":16,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"What is a decision tree? Explain its role in learning."}],"answer":{"summary":"A critical analysis of Decision Tree learning architectures. Details how the algorithm utilizes strict Information Gain and Entropy mathematics to violently partition data, creating highly interpretable classification models.","explanation":[{"type":"heading","content":"Decision Tree Architecture and Learning"},{"type":"paragraph","content":"A Decision Tree is a highly aggressive, non-parametric Supervised Machine Learning algorithm used for both Classification and Regression. Unlike Neural Networks, which are mathematical black boxes, a Decision Tree creates a massive, visually interpretable flowchart. The internal nodes represent strict mathematical tests on specific features (e.g., `Age > 30?`), the branches represent the outcome (`True/False`), and the leaf nodes represent the final predicted class."},{"type":"subheading","content":"The Mathematical Role in Learning"},{"type":"paragraph","content":"The learning process is an algorithm (like ID3 or CART) that violently attempts to construct the absolute smallest possible tree that perfectly separates the training data."},{"type":"list","items":["**Entropy (Chaos):** The algorithm evaluates a node containing 50 Yes and 50 No labels. This node has absolute maximum Chaos (Entropy = 1.0). The algorithm's mathematical goal is to completely annihilate this entropy.","**Information Gain:** The AI tests every single feature in the dataset (e.g., `Gender`, `Income`). It mathematically calculates how much splitting the data by `Gender` reduces the Entropy in the resulting child nodes. The feature that provides the absolute highest Information Gain (the biggest drop in chaos) is violently selected as the Root Node.","**Recursive Partitioning:** The algorithm aggressively repeats this mathematical splitting process on every child node, continuing deeper and deeper until every single leaf node is absolutely \"Pure\" (contains strictly 100% Yes or 100% No)."]},{"type":"subheading","content":"Architectural Merits and Demerits"},{"type":"paragraph","content":"The model is mathematically beautiful and requires zero feature scaling. However, if unconstrained, the algorithm will violently Overfit, growing a massively deep tree that perfectly memorizes the training data but fails catastrophically on new data. This is countered by mathematically \"Pruning\" the deepest branches."}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pB-q7","number":17,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Explain the steps involved in Natural Language processing."}],"answer":{"summary":"An architectural breakdown of the Natural Language Processing (NLP) pipeline. Explains the strict sequential phases: Lexical, Syntactic, Semantic, and Pragmatic analysis required to mathematically translate chaotic human speech into machine-executable logic.","explanation":[{"type":"heading","content":"The Sequential Architecture of Natural Language Processing (NLP)"},{"type":"paragraph","content":"Human language is mathematically horrific. It is filled with ambiguity, sarcasm, and chaotic grammar. Natural Language Processing (NLP) is the absolute AI architecture designed to violently dissect human text and force it into rigid mathematical representations. It executes through a strict, multi-layered pipeline."},{"type":"subheading","content":"The Algorithmic Steps"},{"type":"list","items":["**1. Lexical / Morphological Analysis:** The most basic layer. The AI violently chops the raw sentence into individual tokens (words). It strips suffixes using algorithms like Porter Stemming (e.g., mathematically reducing \"running\", \"runs\", and \"ran\" into the base token `run`).","**2. Syntactic Analysis (Parsing):** The AI aggressively enforces the rules of grammar. It utilizes Context-Free Grammars (CFG) to mathematically build a massive Parse Tree. If a user says \"The fast dog jumped,\" the AI categorizes `The fast dog` as a Noun Phrase and `jumped` as a Verb Phrase. If the grammar is mathematically invalid, it fails here.","**3. Semantic Analysis:** The AI attempts to extract actual mathematical meaning. It resolves dictionary definitions. If the sentence is \"The rock ate the sky,\" the Syntactic Parse Tree says it is grammatically perfect, but the Semantic Analyzer violently rejects it because its mathematical ontology dictates that a `Rock` cannot execute the verb `Eat`.","**4. Discourse Integration:** A single sentence is meaningless without context. The AI mathematically tracks pronouns across sentences. In \"John hit the ball. He threw it.\", the algorithm violently links the pronoun `He` back to the entity `John`, and `it` to `ball`.","**5. Pragmatic Analysis:** The absolute highest level of AI. It attempts to mathematically deduce the user's true intent. If a user says \"Do you know the time?\", the Semantic analyzer would output \"Yes/No\". The Pragmatic analyzer overrides this, recognizing it as a request, and forces the system to output the actual time."]}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pC-q1","number":18,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Explain the Alpha-Beta Pruning algorithm in detail with a complete game tree example showing pruned nodes."}],"answer":{"summary":"A massive mathematical exposition on the Alpha-Beta Pruning algorithm. Violently details how the Minimax engine utilizes Alpha (Max's best) and Beta (Min's best) boundaries to mathematically prove entire subtrees are useless, pruning them to slash time complexity.","explanation":[{"type":"heading","content":"The Alpha-Beta Pruning Architecture in Game AI"},{"type":"paragraph","content":"The standard Minimax algorithm is the absolute mathematical engine for adversarial AI (Chess, Tic-Tac-Toe). It violently generates a massive Game Tree down to the terminal states, scores them, and propagates the numbers up. However, Minimax suffers a catastrophic flaw: its time complexity is $O(b^m)$ (where $b$ is the branching factor). In Chess, this tree is mathematically larger than the number of atoms in the universe. **Alpha-Beta Pruning** is an aggressive optimization architecture that mathematically proves certain branches of the tree are absolutely useless, violently severing (pruning) them from memory without ever evaluating them, slashing the complexity to $O(b^{m/2})$."},{"type":"heading","content":"The Mathematical Mechanics"},{"type":"paragraph","content":"The algorithm utilizes two strict mathematical bounds passed down the tree:"},{"type":"list","items":["**$\\alpha$ (Alpha):** The absolute best (highest) value that the MAX player can currently guarantee on the current path or above. Initially set to $-\\infty$.","**$\\beta$ (Beta):** The absolute best (lowest) value that the MIN player can currently guarantee on the current path or above. Initially set to $+\\infty$."]},{"type":"subheading","content":"The Pruning Condition"},{"type":"paragraph","content":"The absolute core mathematical rule: **If at any node, $\\alpha \\ge \\beta$, the algorithm violently halts evaluation of that node's remaining children and returns.**"},{"type":"paragraph","content":"Why? If MAX knows they can already force a score of $+10$ ($\\alpha = 10$) in another branch, and they are currently exploring a branch where MIN has just found a move that scores $+5$ ($\\beta = 5$), MAX will absolutely NEVER choose this branch, because MIN will force the score down to $5$ or worse. Evaluating the rest of MIN's options is a catastrophic waste of CPU cycles."},{"type":"heading","content":"Algorithmic Walkthrough (Game Tree Example)"},{"type":"list","items":["1. **Root Node (MAX):** Spawns Left Node (MIN) and Right Node (MIN). $\\alpha = -\\infty$, $\\beta = +\\infty$.","2. **Left MIN Node:** Spawns two leaf nodes with values `3` and `5`."," - MIN looks at `3`. MIN wants the lowest number. MIN's current best is `3`. $\\beta$ updates to `3`."," - MIN looks at `5`. `3` is better. MIN returns `3` to the Root MAX Node.","3. **Root Update:** MAX receives the `3`. MAX wants the highest number. MAX's current guaranteed floor ($\\alpha$) becomes `3`.","4. **Right MIN Node:** The algorithm dives right. It passes down the absolute bounds from the Root: $\\alpha = 3$, $\\beta = +\\infty$.","5. **The Prune:** The Right MIN node explores its first leaf, which is a `2`. MIN wants the lowest number, so MIN's $\\beta$ updates to `2`.","6. **The Mathematical Trigger:** At this exact moment, $\\alpha = 3$ (from the Root) and $\\beta = 2$ (at the current MIN node). **The condition $\\alpha \\ge \\beta$ ($3 \\ge 2$) is met!**","7. **The Execution:** MIN knows it will guarantee a score of `2` or lower. MAX at the root already has a guaranteed score of `3` from the left branch. MAX will absolutely NEVER willingly choose this right branch. Therefore, the algorithm violently PRUNES the remaining unexplored leaves of this Right MIN node. It saves massive computational power."]},{"type":"svg","content":""}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pC-q2","number":19,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Discuss the A* algorithm. Prove that A* is optimal and complete if the heuristic is admissible."}],"answer":{"summary":"An exhaustive theoretical proof of the A* Search Algorithm. Details how the absolute evaluation function $f(n) = g(n) + h(n)$ guarantees optimal and complete search traversal strictly when the heuristic $h(n)$ is mathematically admissible (never overestimates).","explanation":[{"type":"heading","content":"The A* Search Algorithm Architecture"},{"type":"paragraph","content":"A* is the absolute pinnacle of informed pathfinding algorithms. Breadth-First Search is blind. Greedy Best-First Search is fast but mathematically flawed (it gets trapped). A* aggressively merges the absolute optimality of Dijkstra's Algorithm (tracking past costs) with the explosive speed of Greedy Search (predicting future costs) to violently navigate massive state-space graphs."},{"type":"heading","content":"The Mathematical Evaluation Function"},{"type":"paragraph","content":"At every node, A* calculates a strict mathematical score: \n$$ f(n) = g(n) + h(n) $$"},{"type":"list","items":["**$g(n)$:** The exact, absolute physical cost to travel from the Start node to the current Node $n$. (Known data).","**$h(n)$ (The Heuristic):** The mathematically estimated cost to travel from Node $n$ to the final Goal. (Predicted data).","**$f(n)$:** The estimated total cost of the absolute cheapest solution path that physically passes through Node $n$."]},{"type":"paragraph","content":"The algorithm maintains an \"Open List\" (a priority queue) of discovered nodes, violently sorting them by $f(n)$. It always pops and expands the node with the absolute lowest $f(n)$ score."},{"type":"heading","content":"The Proof of Optimality and Completeness"},{"type":"paragraph","content":"A* is mathematically guaranteed to find the absolute shortest path (Optimal) and guaranteed to find a path if one exists (Complete), strictly under one condition: The Heuristic function $h(n)$ must be **Admissible**."},{"type":"subheading","content":"What is an Admissible Heuristic?"},{"type":"paragraph","content":"An admissible heuristic NEVER mathematically overestimates the true cost to reach the goal. \n$h(n) \\le h^*(n)$ (where $h^*$ is the actual physical true cost)."},{"type":"paragraph","content":"Example: In a maze, a straight Euclidean line between $n$ and the Goal is perfectly admissible because the true physical path (dodging walls) will always be mathematically greater than or equal to the straight line. It is physically impossible to travel shorter than a straight line."},{"type":"subheading","content":"The Mathematical Proof of Optimality"},{"type":"paragraph","content":"Assume A* is flawed and it selects a suboptimal Goal $G_2$ instead of the true optimal Goal $G_1$."},{"type":"list","items":["Because $G_2$ is suboptimal, its true cost is higher: $f(G_2) > f(G_1)$.","Because $G_2$ is a Goal node, its heuristic is zero: $h(G_2) = 0$. Thus, $f(G_2) = g(G_2)$.","Consider a node $n$ that is currently on the Open List and is physically on the correct path to $G_1$.","Because $h(n)$ is Admissible, it does not overestimate. Therefore: $f(n) = g(n) + h(n) \\le f(G_1)$.","Since we established $f(G_1) < f(G_2)$, it mathematically proves that $f(n) < f(G_2)$."]},{"type":"paragraph","content":"The Contradiction: A* always expands the node with the absolute lowest $f$ score. Therefore, A* will mathematically be forced to expand node $n$ BEFORE it is ever allowed to expand the suboptimal goal $G_2$. A* will relentlessly follow $n$ all the way to $G_1$. It is mathematically impossible for A* to terminate on a suboptimal goal if $h(n)$ is admissible."}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pC-q3","number":20,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Explain different techniques of Knowledge Representation in AI with suitable examples."}],"answer":{"summary":"A massive architectural review of AI Knowledge Representation techniques. Violently compares the absolute mathematical rigidity of First-Order Logic against the psychological graph associations of Semantic Networks and structured Object-Oriented Frames.","explanation":[{"type":"heading","content":"Techniques of Knowledge Representation in AI"},{"type":"paragraph","content":"To execute intelligent actions, an AI must mathematically map the chaotic physical universe into its RAM. Knowledge Representation (KR) architectures define the exact mathematical data structures used to store facts, constraints, and relationships."},{"type":"heading","content":"1. Propositional and First-Order Logic (FOL)"},{"type":"paragraph","content":"The absolute most rigorous mathematical architecture. It utilizes strict Boolean logic and quantifiers."},{"type":"list","items":["**Mechanism:** It uses predicates, variables, Universal Quantifiers ($\\forall$), and Existential Quantifiers ($\\exists$).","**Example:** To represent \"All dogs are mammals\": $\\forall x (Dog(x) \\Rightarrow Mammal(x))$.","**Merit:** Absolute Inferential Adequacy. It allows the AI to use strict mathematical Resolution theorem proving to guarantee absolute truth.","**Demerit:** It is incredibly rigid and catastrophically fails at handling probability or vague concepts (\"most dogs are friendly\")."]},{"type":"heading","content":"2. Semantic Networks"},{"type":"paragraph","content":"A graphical architecture inspired by human psychological memory. Knowledge is violently represented as a massive directed graph."},{"type":"list","items":["**Mechanism:** Nodes represent objects or concepts (e.g., `Bird`, `Tweety`). Directed edges represent strict relationships (e.g., `IS-A`, `HAS-A`).","**Example:** Node(`Tweety`) $\\xrightarrow{IS-A}$ Node(`Bird`) $\\xrightarrow{HAS-A}$ Node(`Wings`).","**Merit:** It handles Property Inheritance flawlessly. The AI mathematically traces the graph from `Tweety` up to `Bird` to instantly deduce that `Tweety` has wings, without explicitly storing that fact in `Tweety's` node. Highly efficient."]},{"type":"heading","content":"3. Frames"},{"type":"paragraph","content":"An architectural precursor to Object-Oriented Programming (OOP), proposed by Marvin Minsky."},{"type":"list","items":["**Mechanism:** Knowledge is aggressively grouped into structured objects called \"Frames\". Each Frame has \"Slots\" (attributes) and \"Facets\" (values, default values, or executable procedures).","**Example:** \n Frame: `Classroom` \n Slot `Seats`: Default 30 \n Slot `Chalkboard`: Yes \n Slot `If_Added_Student`: Execute Procedure `Update_Roster()`.","**Merit:** It flawlessly models stereotypical situations. If the AI walks into a room and identifies a chalkboard, the `Classroom` frame is violently instantiated, and the AI instantly makes massive default assumptions about the room without needing to scan every single object."]},{"type":"heading","content":"4. Production Rules (Expert Systems)"},{"type":"paragraph","content":"The architecture used in almost all early Expert Systems (like MYCIN)."},{"type":"list","items":["**Mechanism:** Strict `IF-THEN` conditional statements combined with a massive working memory database.","**Example:** `IF (Engine is overheated) AND (Coolant is empty) THEN (Status = Critical_Failure)`.","**Merit:** Highly modular. You can violently inject a new rule into the database without rewriting the engine. It flawlessly supports Forward and Backward chaining algorithms."]}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pC-q4","number":21,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Describe the architecture and learning process of an Artificial Neural Network."}],"answer":{"summary":"An exhaustive architectural analysis of Artificial Neural Networks. Violently details the feedforward propagation of inputs through dense mathematical weight matrices and the explosive calculus of Backpropagation used to minimize the Loss function.","explanation":[{"type":"heading","content":"Architecture and Learning Process of an Artificial Neural Network (ANN)"},{"type":"paragraph","content":"An Artificial Neural Network (ANN) is a massive mathematical architecture heavily inspired by biological brain structure. It completely abandons hardcoded logical rules (like Expert Systems) and instead utilizes millions of interconnected mathematical equations to aggressively learn patterns directly from raw data."},{"type":"heading","content":"1. The Mathematical Architecture"},{"type":"paragraph","content":"An ANN is violently structured into distinct vertical layers of interconnected \"Neurons\" (Nodes)."},{"type":"list","items":["**The Input Layer:** Receives the raw mathematical data (e.g., 784 pixels of an image).","**The Hidden Layers:** The dense computational core. Every single neuron in Layer $A$ is mathematically wired to every single neuron in Layer $B$. Each wire possesses a specific numerical **Weight ($W$)**, representing the absolute strength of that connection.","**The Output Layer:** Generates the final mathematical prediction (e.g., a probability distribution for 10 digits)."]},{"type":"subheading","content":"The Neuron Execution (Forward Propagation)"},{"type":"paragraph","content":"For a single neuron to fire, it executes a massive linear algebra dot product followed by a violent non-linear squeeze:"},{"type":"list","items":["1. It multiplies every incoming input ($x$) by its corresponding weight ($W$) and sums them up: $\\sum (x_i \\cdot w_i)$.","2. It adds a scalar Bias ($b$) to shift the function: $Z = \\sum (x_i \\cdot w_i) + b$.","3. The linear $Z$ is violently forced through a Non-Linear Activation Function (like ReLU or Sigmoid). This ensures the massive network doesn't mathematically collapse into a single straight line."]},{"type":"heading","content":"2. The Learning Process (Backpropagation)"},{"type":"paragraph","content":"When an untrained ANN is initialized, all weights are absolute random garbage. The learning process is the mathematical execution of Gradient Descent to violently correct these weights."},{"type":"list","items":["**Step 1 (The Forward Pass):** An image of a \"Cat\" is fed in. The network mathematically processes it and predicts \"99% Dog\".","**Step 2 (The Loss Function):** The AI mathematically calculates the absolute horrific error of its prediction using a Loss Function (like Mean Squared Error or Cross-Entropy). Let's say Error = 100.","**Step 3 (The Calculus Engine / Backpropagation):** The absolute core of AI. The algorithm uses the Chain Rule of Calculus to violently calculate the Partial Derivative (the Gradient) of the massive Loss Function with respect to EVERY SINGLE WEIGHT in the entire network. It mathematically asks: \"If I tweak weight $W_{342}$ by 0.001, exactly how much will the total Error decrease?\"","**Step 4 (The Weight Update):** The algorithm violently updates every weight in the network simultaneously, moving them in the exact mathematical direction that minimizes the Loss, scaled by the Learning Rate ($\\alpha$).\n $$ W_{new} = W_{old} - \\alpha \\cdot \\text{Gradient} $$","**Step 5 (Iteration):** This cycle is aggressively repeated millions of times across the dataset until the Loss Function is absolutely mathematically minimized. The ANN has now \"Learned\"."]}]}},{"id":"v2-principles-of-artificial-intelligence-2024-pC-q5","number":22,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"What are Expert Systems? Explain the role of the inference engine and knowledge base in detail."}],"answer":{"summary":"A critical dissection of Expert Systems. Details how the architecture mathematically decouples the static Knowledge Base of human domain rules from the aggressive, generalized algorithmic execution of the Inference Engine.","explanation":[{"type":"heading","content":"The Architecture of Expert Systems"},{"type":"paragraph","content":"An Expert System is a classical AI architecture designed to mathematically emulate the exact decision-making capabilities of a human domain expert (like a cardiologist or a geologist). Unlike modern Neural Networks which learn from raw data, an Expert System is aggressively hardcoded with absolute human logical rules. Its fundamental architectural genius is the strict, violent separation of Data (The Knowledge Base) and Algorithm (The Inference Engine)."},{"type":"heading","content":"1. The Knowledge Base (The Brain)"},{"type":"paragraph","content":"The Knowledge Base is the massive, static database containing all the specialized facts and heuristics extracted from human experts. It is NOT code; it is purely structured data."},{"type":"list","items":["**Factual Knowledge:** Absolute, undeniable truths about the domain. (e.g., `Patient_Temp = 104F`).","**Heuristic Knowledge:** The intuitive, probabilistic rules-of-thumb that experts use. (e.g., `IF (Fever is High) AND (Cough is Severe) THEN (Pneumonia Probability is 0.8)`).","**Architectural Merit:** Because it is completely separated from the execution code, a medical Knowledge Base can be instantly swapped out for a geological Knowledge Base without rewriting a single line of the core software."]},{"type":"heading","content":"2. The Inference Engine (The Engine)"},{"type":"paragraph","content":"The Inference Engine is the absolute mathematical algorithmic core. It does not know anything about medicine or geology. Its sole purpose is to violently traverse the Knowledge Base, mathematically matching conditions, and firing rules to deduce new facts."},{"type":"subheading","content":"Algorithmic Execution Methods"},{"type":"list","items":["**Forward Chaining (Data-Driven):** The Engine is fed raw patient data. It aggressively scans the massive Knowledge Base for any `IF` rule that matches the data. It fires the rule, deducing a new fact. It repeats this violent cycle until it mathematically deduces the final disease.","**Backward Chaining (Goal-Driven):** The user asks, \"Does this patient have Leukemia?\" The Engine finds the rule `IF (White_Blood_Count is X) THEN (Leukemia)`. It then aggressively queries the user or database: \"Is the White Blood Count X?\" It chains violently backward to prove the specific hypothesis."]},{"type":"heading","content":"3. Auxiliary Components"},{"type":"list","items":["**User Interface:** The system queries the human for missing data.","**Explanation Facility:** The absolute greatest advantage over Neural Networks. If the system diagnoses Cancer, the human can ask \"Why?\". The Inference Engine will mathematically print out the exact sequence of logical rules it fired, providing absolute transparency and legal accountability."]}]}}]}],"loading":false,"error":null}}}

Q2Principles of Artificial Intelligence

Question

Answer