{"id":188,"date":"2026-01-29T10:24:53","date_gmt":"2026-01-29T10:24:53","guid":{"rendered":"https:\/\/staymind.shop\/?p=188"},"modified":"2026-01-29T10:24:53","modified_gmt":"2026-01-29T10:24:53","slug":"paper-of-artificial-intelligence-department-of-computer-science-and-software-engineering","status":"publish","type":"post","link":"https:\/\/staymind.shop\/?p=188","title":{"rendered":"Paper Of Artificial Intelligence Department Of Computer Science and Software Engineering"},"content":{"rendered":"\n<p>Let&#8217;s dispel the Hollywood myth right now:&nbsp;<strong>Artificial Intelligence (AI)<\/strong>&nbsp;is not about building conscious androids. It&#8217;s the rigorous, often gritty, engineering discipline of creating systems that can&nbsp;<strong>perceive, reason, learn, and act<\/strong>&nbsp;to achieve specific goals. This past paper isn&#8217;t a sci-fi quiz; it&#8217;s a demanding test of your ability to model intelligence as a computational process\u2014one filled with trade-offs, approximations, and fundamental philosophical limits.<\/p>\n\n\n\n<p>Forget magic. This is about&nbsp;<strong>search, probability, optimization, and data<\/strong>. It\u2019s the ultimate synthesis of computer science, mathematics, and cognitive science.<\/p>\n\n\n\n<p><strong>What This Paper Actually Measures: Your Mastery of Intelligent System Design<\/strong><\/p>\n\n\n\n<p><strong>1. The Philosophical &amp; Historical Foundation: What is Intelligence?<\/strong><br>The opening questions frame the entire field. You must articulate:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>The Turing Test<\/strong>\u00a0and its critiques (the Chinese Room argument).<\/li>\n\n\n\n<li><strong>Defining AI:<\/strong>\u00a0The distinction between\u00a0<strong>Acting Humanly<\/strong>\u00a0(Turing Test) and\u00a0<strong>Acting Rationally<\/strong>\u00a0(the focus of modern AI). The shift from trying to\u00a0<em>simulate<\/em>\u00a0human thought to engineering\u00a0<em>rational agents<\/em>.<\/li>\n\n\n\n<li><strong>AI&#8217;s Scope:<\/strong>\u00a0From\u00a0<strong>Weak\/Narrow AI<\/strong>\u00a0(excelling at a specific task like chess or image recognition) to the theoretical\u00a0<strong>Strong\/General AI<\/strong>\u00a0(human-level, cross-domain intelligence).<\/li>\n<\/ul>\n\n\n\n<p><strong>2. The Core Paradigms: How to Engineer &#8220;Thinking&#8221;<\/strong><br>The paper tests your fluency in the major schools of thought for creating intelligent behavior.<\/p>\n\n\n\n<p><strong>A. The Symbolic Approach: Thinking with Logic &amp; Rules<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Knowledge Representation:<\/strong>\u00a0Using\u00a0<strong>propositional logic, first-order logic<\/strong>, and\u00a0<strong>ontologies<\/strong>\u00a0to encode facts about the world (e.g., &#8220;All humans are mortal. Socrates is a human.&#8221;).<\/li>\n\n\n\n<li><strong>Reasoning &amp; Inference:<\/strong>\u00a0Applying\u00a0<strong>deduction<\/strong>\u00a0to derive new knowledge. You&#8217;ll use\u00a0<strong>resolution<\/strong>\u00a0or\u00a0<strong>forward\/backward chaining<\/strong>\u00a0in a rule-based system.<\/li>\n\n\n\n<li><strong>Limitations:<\/strong>\u00a0The\u00a0<strong>knowledge acquisition bottleneck<\/strong>\u00a0and the difficulty of handling uncertainty. This leads to&#8230;<\/li>\n<\/ul>\n\n\n\n<p><strong>B. The Stochastic Approach: Thinking with Probability &amp; Belief<\/strong><br>Since the real world is uncertain, rational agents must handle it.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Bayesian Networks:<\/strong>\u00a0The cornerstone. You&#8217;ll construct a simple network, encode conditional independence assumptions, and perform\u00a0<strong>inference<\/strong>\u00a0(compute\u00a0<code>P(Cause | Evidence)<\/code>) using concepts like Bayes&#8217; Theorem.<\/li>\n\n\n\n<li><strong>Markov Models &amp; Hidden Markov Models (HMMs):<\/strong>\u00a0For modeling time-series data (like speech recognition or robot localization). You&#8217;ll understand the tasks of\u00a0<strong>evaluation, decoding<\/strong>\u00a0(Viterbi algorithm), and\u00a0<strong>learning<\/strong>.<\/li>\n<\/ul>\n\n\n\n<p><strong>C. The Connectionist Approach: Thinking with Learning from Data<\/strong><br>Modern AI is dominated by this paradigm.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Neural Networks (NNs):<\/strong>\u00a0From biological inspiration to mathematical function approximators. You&#8217;ll diagram a simple feedforward network, understand activation functions (sigmoid, ReLU), and describe the\u00a0<strong>backpropagation algorithm<\/strong>\u00a0for learning weights.<\/li>\n\n\n\n<li><strong>Deep Learning:<\/strong>\u00a0The power of\u00a0<strong>hierarchical feature learning<\/strong>\u00a0in Convolutional Neural Networks (CNNs) for vision and Recurrent Neural Networks (RNNs\/LSTMs) for sequence data. You&#8217;ll explain their architectures and why they work.<\/li>\n<\/ul>\n\n\n\n<p><strong>D. The Action-Oriented Approach: Thinking with Goals &amp; Actions<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Search:<\/strong>\u00a0Foundational. You&#8217;ll apply and compare\u00a0<strong>uninformed search<\/strong>\u00a0(BFS, DFS, UCS) and\u00a0<strong>informed search<\/strong>\u00a0(A* with a heuristic) to problems like pathfinding or puzzles. You&#8217;ll prove properties like\u00a0<strong>admissibility and consistency<\/strong>\u00a0of heuristics.<\/li>\n\n\n\n<li><strong>Planning:<\/strong>\u00a0Representing states, actions, and goals to sequence actions (STRIPS representation). You may contrast classical planning with real-world challenges requiring\u00a0<strong>probabilistic planning<\/strong>\u00a0(Markov Decision Processes &#8211; MDPs).<\/li>\n<\/ul>\n\n\n\n<p><strong>3. Core Subfields &amp; Applications<\/strong><br>You&#8217;ll need to connect theory to concrete domains:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Computer Vision:<\/strong>\u00a0From edge detection to object classification with CNNs.<\/li>\n\n\n\n<li><strong>Natural Language Processing (NLP):<\/strong>\u00a0From n-gram models and TF-IDF to modern transformers and attention mechanisms.<\/li>\n\n\n\n<li><strong>Machine Learning:<\/strong>\u00a0The overarching field. Distinguishing\u00a0<strong>supervised<\/strong>\u00a0(classification, regression),\u00a0<strong>unsupervised<\/strong>\u00a0(clustering, dimensionality reduction), and\u00a0<strong>reinforcement learning<\/strong>\u00a0(an agent learning from rewards\/punishments).<\/li>\n\n\n\n<li><strong>Robotics:<\/strong>\u00a0The\u00a0<strong>perception-planning-action<\/strong>\u00a0loop, often integrated with techniques like SLAM (Simultaneous Localization and Mapping).<\/li>\n<\/ul>\n\n\n\n<p><strong>4. The Critical Lens: Ethics &amp; Limitations<\/strong><br>Modern AI papers demand you grapple with the consequences.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Bias &amp; Fairness:<\/strong>\u00a0How biases in training data lead to discriminatory models.<\/li>\n\n\n\n<li><strong>Explainability (XAI):<\/strong>\u00a0The &#8220;black box&#8221; problem of deep learning and the need for interpretable AI.<\/li>\n\n\n\n<li><strong>Safety &amp; Alignment:<\/strong>\u00a0Ensuring AI systems do what we intend, especially as they become more capable.<\/li>\n<\/ul>\n\n\n\n<p><strong>The Paper&#8217;s Ultimate Challenge: Synthesis and Trade-off Analysis<\/strong><br>The hardest questions are&nbsp;<strong>design and analysis problems<\/strong>. For example:<br><em>&#8220;Design a system to filter spam emails. Justify your choice of a Na\u00efve Bayes classifier over a rule-based system. Describe the features you would extract, and explain how you would handle the trade-off between precision and recall. Finally, discuss one major ethical consideration in deploying such a system.&#8221;<\/em><br>This requires you to blend algorithmic knowledge, practical implementation insight, and ethical reasoning.<\/p>\n\n\n\n<p><strong>How to Conquer This Past Paper:<\/strong><\/p>\n\n\n\n<ol start=\"1\" class=\"wp-block-list\">\n<li><strong>Think in Terms of Agents.<\/strong>\u00a0For any problem, ask: What are the agent&#8217;s\u00a0<strong>percepts<\/strong>,\u00a0<strong>actions<\/strong>, and\u00a0<strong>goals<\/strong>? What is its\u00a0<strong>utility function<\/strong>? This frames all of AI.<\/li>\n\n\n\n<li><strong>Master the Trade-offs.<\/strong>\u00a0Know when to use a symbolic vs. a stochastic vs. a learning approach. Each has strengths: logic for precision, probability for uncertainty, learning for pattern-finding in data.<\/li>\n\n\n\n<li><strong>Practice Drawing Diagrams.<\/strong>\u00a0Draw Bayesian networks, neural network architectures, search trees, and state spaces. Visualizing the model is 90% of solving the problem.<\/li>\n\n\n\n<li><strong>Understand the &#8220;Why&#8221; Behind the Math.<\/strong>\u00a0Don&#8217;t just apply Bayes&#8217; Theorem; understand it as a method for updating beliefs with evidence. Don&#8217;t just describe backpropagation; understand it as gradient descent in a high-dimensional space.<\/li>\n\n\n\n<li><strong>Stay Grounded in Reality.<\/strong>\u00a0Connect every concept to a real-world application. Search -> Google Maps. Bayesian Networks -> Medical Diagnosis. CNNs -> Face ID. This cements understanding.<\/li>\n<\/ol>\n\n\n\n<p>This past paper is your&nbsp;<strong>initiation into one of the most transformative fields in human history<\/strong>. It proves you can move beyond using intelligent tools to understanding and constructing the principles behind them. Passing it means you are equipped not just to follow the AI revolution, but to help engineer it\u2014thoughtfully and responsibly.<\/p>\n\n\n\n<p><strong>Artificial intelligence all previous\/ past question papers<br><\/strong><\/p>\n\n\n\n<p>Q4: What paths and cost will be returned by 1-Uniform Cost Search And 2-A* Search<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"893\" height=\"439\" src=\"https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/image-66.png\" alt=\"\" class=\"wp-image-190\" srcset=\"https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/image-66.png 893w, https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/image-66-300x147.png 300w, https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/image-66-768x378.png 768w\" sizes=\"auto, (max-width: 893px) 100vw, 893px\" \/><\/figure>\n<\/div>\n\n\n<h3 class=\"wp-block-heading\">AI previous question papers Sessional 1 2020<\/h3>\n\n\n\n<p><strong>Q1. Answer the following.<\/strong><\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li>Which agent makes its action better based on the feedback from critic element? (01)<\/li>\n\n\n\n<li>How does a learning agent \u201clearn\u201d? (01)<\/li>\n<\/ol>\n\n\n\n<p><strong>Q2.&nbsp;<\/strong>ANSWER THE QUESTIONS IN LIEU OF SEARCH PROBLEM GIVEN BELOW. IF YOU COME ACROSS ANY TIES BREAK THEM ALPHABETICALLY.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<\/p>\n\n\n\n<p><strong>Artificial intelligence past question paper<br><\/strong><\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li>WHAT PATH WOULD BREADTH-FIRST GRAPH SEARCH WOULD RETURN?<\/li>\n\n\n\n<li>WHAT PATH WOULD DEPTH-FIRST GRAPH SEARCH WOULD RETURN?<\/li>\n\n\n\n<li>WHAT PATH WOULD UNIFORM COST GRAPH SEARCH WOULD RETURN?<\/li>\n\n\n\n<li>WHAT PATH WOULD A* SEARCH WOULD RETURN?<\/li>\n<\/ol>\n\n\n\n<figure class=\"wp-block-table\"><table class=\"has-fixed-layout\"><tbody><tr><td><strong>S<\/strong><strong>TATE<\/strong><\/td><td><strong>S<\/strong><\/td><td><strong>L<\/strong><\/td><td><strong>M<\/strong><\/td><td><strong>N<\/strong><\/td><td><strong>O<\/strong><\/td><td><strong>G<\/strong><\/td><\/tr><tr><td><strong>H<\/strong><strong>EURISTIC<\/strong><\/td><td>5<\/td><td>3<\/td><td>4<\/td><td>2<\/td><td>1<\/td><td>0<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<ol start=\"5\" class=\"wp-block-list\">\n<li>CONSIDER THE FOLLOWING HEURISTICS<\/li>\n<\/ol>\n\n\n\n<figure class=\"wp-block-table\"><table class=\"has-fixed-layout\"><tbody><tr><td><strong>S<\/strong><strong>TATE<\/strong><\/td><td><strong>S<\/strong><\/td><td><strong>L<\/strong><\/td><td><strong>M<\/strong><\/td><td><strong>N<\/strong><\/td><td><strong>O<\/strong><\/td><td><strong>G<\/strong><\/td><\/tr><tr><td><strong>H1<\/strong><\/td><td>6<\/td><td>4<\/td><td>7<\/td><td>3<\/td><td>4<\/td><td>0<\/td><\/tr><tr><td><strong>H2<\/strong><\/td><td>5<\/td><td>3<\/td><td>7<\/td><td>1<\/td><td>4<\/td><td>0<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<ol class=\"wp-block-list\">\n<li>IS H1 ADMISSIBLE AND CONSISTENT?<\/li>\n\n\n\n<li>IS H2 ADMISSIBLE AND CONSISTENT?<\/li>\n<\/ol>\n\n\n\n<p><strong>Q3.&nbsp;<\/strong>FOR 8-PUZZLE PROBLEM, WE WANT TO SEARCH FOR A SOLUTION USING A* SEARCH. STATE THE FOLLOWING. (05)<\/p>\n\n\n\n<p>1- STATES&nbsp; &nbsp;2- SUCCESSOR FUNCTION 3- GOAL TEST&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 4- STEP COST&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 5- PATH COST<\/p>\n\n\n\n<h3 class=\"wp-block-heading\">Artificial intelligence previous question paper Sessional 2 2020<\/h3>\n\n\n\n<p><strong>Map colouring<\/strong><\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"620\" height=\"377\" src=\"https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/image-68.png\" alt=\"\" class=\"wp-image-192\" srcset=\"https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/image-68.png 620w, https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/image-68-300x182.png 300w\" sizes=\"auto, (max-width: 620px) 100vw, 620px\" \/><\/figure>\n<\/div>\n\n\n<p>1. Formulate this problem as a CSP<strong>&nbsp;<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table\"><table class=\"has-fixed-layout\"><tbody><tr><td>Draw the constraint graph below and write the constraints at the graph edges.<\/td><\/tr><tr><td>Enforce all unary constraints by reducing the initial domains.<\/td><\/tr><tr><td>Circle every graph node and write the resulting domain inside the circle.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<ol start=\"2\" class=\"wp-block-list\">\n<li><strong>Which variable should we choose next?<\/strong><\/li>\n<\/ol>\n\n\n\n<p>Now we want to color the rest of the countries using the backtracking algorithm. We need to select a variable which we can assign a value. Which one should we choose?<\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li>Which variable(s) does the\u00a0<em>Minimum Remaining Values*\u00a0<\/em>heuristic suggest that you try next? (*i.e,\u00a0<em>choose the variable with the fewest legal values<\/em>). Check all that apply:\n<ul class=\"wp-block-list\">\n<li>BEL \u25a2 EST\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u25a2 LAT\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u25a2 LIT\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u25a2 POL<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li>Which variable(s) does the\u00a0<em>Degree Heuristic*\u00a0<\/em>suggest that you try next?<\/li>\n<\/ol>\n\n\n\n<p>(*i.e,&nbsp;<em>choose the variable with most constraints on remaining variables<\/em>). Check all that apply:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>BEL \u25a2 EST\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u25a2 LAT\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u25a2 LIT\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u25a2 POL<\/li>\n<\/ul>\n\n\n\n<p>3.&nbsp; Make the graph arc consistent<\/p>\n\n\n\n<p>Assume that we color Poland Green. What are the resulting domains after enforcing arc consistency on the graph?<\/p>\n\n\n\n<p><strong>Artificial intelligence previous\u00a0 final question Paper 2020<br><\/strong><\/p>\n\n\n\n<p>Q1. Consider the following Axioms.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; (18)<\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li>0 \u2264 5<\/li>\n\n\n\n<li>B \u2264 C ( \u2264 sign changes to \u2265 if B > C)<\/li>\n\n\n\n<li>\u2200 x x \u2264 x<\/li>\n\n\n\n<li>\u2200 x\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 x \u2264 x + 0<\/li>\n\n\n\n<li>\u2200 x\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 x + 0 \u2264 x<\/li>\n\n\n\n<li>\u2200 x, y x + y \u2264 y + x<\/li>\n\n\n\n<li>\u2200 x, y, z w \u2264 y \u22c0 x \u2264 z\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u27f9 w + x \u2264 y + z<\/li>\n\n\n\n<li>\u2200 x, y, z\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 x \u2264 y \u22c0 y \u2264 z\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u27f9 x \u2264 z<\/li>\n\n\n\n<li>Give a backward chaining proof of the sentence B \u2264 5 + C. Show only the steps that lead to success.<\/li>\n\n\n\n<li>Give a Forward chaining proof of the sentence B \u2264 5 + C. Show only the steps that lead to success.<\/li>\n<\/ol>\n\n\n\n<p>NOTE: B and C are the two significant digits of your roll number i.e For roll no 023 [ 2 is B and 3 is C ]<\/p>\n\n\n\n<p><strong>Q2.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; C<\/strong><strong>ONSIDER A VOCABULARY WITH FOLLOWING SYMBOLS<\/strong><strong>.&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; (07)<\/strong><\/p>\n\n\n\n<p>OCCUPATION (P,O):&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; PREDICATE. PERSON P HAS OCCUPATION O<\/p>\n\n\n\n<p>CUSTOMER (P1, P2):&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; PREDICATE. PERSON P1 IS A CUSTOMER OF PERSON P2<\/p>\n\n\n\n<p>BOSS (P1 , P2 ):&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; PREDICATE. PERSON P1 IS A BOSS OF PERSON P2<\/p>\n\n\n\n<p>CONSTANTS DENOTING OCCUPATIONS:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ARCHITECT, TEACHER, ACCOUNTANT, ARTIST<\/p>\n\n\n\n<p>CONSTANTS DENOTING PEOPLE:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; SANA , JAMAL&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; , SALEEM<\/p>\n\n\n\n<p><strong>U<\/strong><strong>SE THE SYMBOLS TO WRITE THE FOLLOWING STATEMENTS IN FIRST ORDER LOGIC<\/strong><strong>.<\/strong><\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li>SANA IS EITHER AN ARCHITECT OR A TEACHER.<\/li>\n\n\n\n<li>JAMAL IS AN ARCHITECT AND HE HOLDS ANOTHER JOB.<\/li>\n\n\n\n<li>ALL TEACHERS ARE ARTIST.<\/li>\n\n\n\n<li>JAMAL HAS NO ACCOUNTANT (NOT A CUSTOMER).<\/li>\n\n\n\n<li>SALEEM HAS HIRED SERVICES OF ARCHITECT AND ARTIST. ( IS A BOSS)<\/li>\n\n\n\n<li>THERE EXIST AN ACCOUNTANT WHOSE CUSTOMERS ARE ALL TEACHERS.<\/li>\n\n\n\n<li>EVERY ARTIST HAS AN ACCOUNTANT.<\/li>\n<\/ol>\n\n\n\n<p><strong>Artificial intelligence past question paper Final 2022<br><\/strong><\/p>\n\n\n\n<p>Q1: IN TABLE GIVEN BELOW, FOR THE FOLLOWING TERMS ON LEFT CHOOSE THE CORRECT DEFINITION, YOU ONLY HAVE TO ANSWER 4 TERMS BASED ON LAST 2 DIGITS OF YOUR ROLL NO. (Choose two terms based on your last two digits of roll number and other two terms will be calculated according to the given formula (if digit is even, add 1 to<\/p>\n\n\n\n<p>it, if digit is odd, subtract 1 into it. For example,<\/p>\n\n\n\n<p>If your roll number is 03, the four terms you will answer for are 0 (Sound), 3 (Entailment), 0-1-1 (Term)<\/p>\n\n\n\n<p>and 3-1-2 (Conjunctive Normal Form)ROLL NO TERMS 0 SOUND TERM CHOICES<\/p>\n\n\n\n<p>DISJUNCTION OF LITERALS, AT MOST ONE OF WHICH IS POSITIVE<\/p>\n\n\n\n<p>DESCRIBE A SENTENCE THAT IS TRUE IN SOME MODEL.<\/p>\n\n\n\n<p>ASSOCIATES SYMBOLS WITH WORLD OBJECTS, RELATIONS, AND FUNCTIONS.<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>CONJUNCTIVE<\/li>\n\n\n\n<li>NORMAL FORM<\/li>\n\n\n\n<li>ENTAILMENT<\/li>\n\n\n\n<li>SATISFIABLE<\/li>\n<\/ul>\n\n\n\n<p>HORN CLAUSE<\/p>\n\n\n\n<p>REPRESENTED AS A CANONICAL CONIUNCTION OF DISJUNCTIONS<\/p>\n\n\n\n<p>DESCRIBE A SENTENCE THAT IS FALSE IN ALL MODELS. DEFINES TRUTH OF EACH SENTENCE WITH RESPECT TO EACH POSSIBLE WORLD<\/p>\n\n\n\n<p>COMPLETE<\/p>\n\n\n\n<p>CONSTRUCTED FROM SIMPLER SENTENCES, PARENTHESES, AND CONNECTORS. AN INFERENCE PROCEDURE THAT DERIVES ONLY ENTAILED SENTENCES.<\/p>\n\n\n\n<p>SEMANTICS<\/p>\n\n\n\n<p>SYNTAX<\/p>\n\n\n\n<p>DESCRIBE A SENTENCE THAT IS TRUE DE ALL MODELS<\/p>\n\n\n\n<p>AN INFERENCE PROCEDURE THAT DERVISALL ENTAILED SENTENCES.<\/p>\n\n\n\n<p>CHAIN OF INFERENCE RULE CONCLUSIONS LEADING TO A DESIRED SENTENCE.<\/p>\n\n\n\n<p>9<\/p>\n\n\n\n<p>UNSATISFIABLE<\/p>\n\n\n\n<p>10<\/p>\n\n\n\n<p>AGENT<\/p>\n\n\n\n<p>11 12<\/p>\n\n\n\n<p>PROOF<\/p>\n\n\n\n<p>VALID<\/p>\n\n\n\n<p>A FIRST ORDER LOGIC EXPRESSION THAT REFERS 30) AN OBJECT. PERCEIVES ENVIRONMENT BY SENSORS, ACTS BY ACTUATORS.<\/p>\n\n\n\n<p>SPECIFIES ALL THE SENTENCES IN THE LANGUAGE THAT ALF WELL FORMED.<\/p>\n\n\n\n<p>13<\/p>\n\n\n\n<p>INTERPRETATION<\/p>\n\n\n\n<p>14<\/p>\n\n\n\n<p>COMPLEX SENTENCES<\/p>\n\n\n\n<p>THE IDEA THAT A SENTENCE FOLLU<\/p>\n\n\n\n<p>TOUICALLY FROM HER SENTENCE.<\/p>\n\n\n\n<p>Q2-USE THE SYMBOLS TO WRITE THE FOLLOWING STATEMENTS IN FIRST ORDER LOGIC. (0)<\/p>\n\n\n\n<p>1. AYESHA PERFORMS ATHLETICS<\/p>\n\n\n\n<p>2. ATTIA PROFESSION IS MEDICINE AND SHE SPENDS HER FREE TIME WATCHING MOVIES.<\/p>\n\n\n\n<p>3. ALL STUDENTS WHO TAKE AI PASSES IT. 4. SOME STUDENTS WHO FAILED OID NOT STUDY.<\/p>\n\n\n\n<p>5. NIMBA WANTED TO BE A BOLOGIST BUT SHE BECAME PHYSICIST.<\/p>\n\n\n\n<p>6. FOR ALL STUDENTS WHO STUDY BIOLOGY, SOME BECOME DOCTORS AND SOME BECOME PHARMACIST<\/p>\n\n\n\n<p>Q3-SOLVE THE FOLLOWING PROBLEM USING RESOLUTION INFERENCE RULE.(10)<\/p>\n\n\n\n<p>EVERYONE WHO LOVES ALL ANIMALS IS LOVED BY SOMEONE, ANYONE WHO KILLS AN ANIMAL IS LOVED BY NO ONE. AC<\/p>\n\n\n\n<p>LOVES ALL ANIMALS. EITHER ALL OR IFRAH KILLED THE CAT, WHO IS NAMED PLUTO. DIDIFRAH KILLED THE CAT?<\/p>\n\n\n\n<p>Q4-CONSIDER A LOGICAL BASE FINANCIAL ADVISER. (20)<\/p>\n\n\n\n<p>THE FUNCTION IS TO ADVISE A USER ABOUT WHETHER TO INVEST IN STOCKS OR SAVINGS. SOME INVESTORS MIGHT<\/p>\n\n\n\n<p>WANT TO SPLIT THEIR MONEY, LET\u2019S SAY THAT WE HAVE DETERMINED THE FOLLOWING RULES: 1.INDIVIDUALS WITH INADEQUATE SAVINGS SHOULD MAKE INCREASING SAVINGS THEIR TOP PRIORITY, REGARDLESS OF<\/p>\n\n\n\n<p>INCOME<\/p>\n\n\n\n<p>2. INDIVIDUALS WITH ADEQUATE SAVINGS AND ADEQUATE INCOME SHOULD CONSIDER STOCKS, WHICH ARE RISKIER<\/p>\n\n\n\n<p>BUT POTENTIALLY MORE PROFIT.<\/p>\n\n\n\n<p>3. INDIVIDUALS WITH A LOWER INCOME AND ALREADY HAVE ADEQUATE SAVINGS SHOULD SPLIT THEIR INCOME<\/p>\n\n\n\n<p>BETWEEN SAVINGS AND STOCKS.<\/p>\n\n\n\n<p>OUR RULE IS TO HAVE AT LEAST $5000 IN THE BANK FOR EACH DEPENDENT. AN ADEQUATE INCOME MUST BE STEADY AND SUPPLY AT LEAST $15000 PER YEAR PLUS $4000 FOR EACH DEPENDENT. LET\u2019S START CODING UP SOME RULES:<\/p>\n\n\n\n<p>SAVINGS ACCOUNT(INADEQUATE)\u2192 INVESTMENT(SAVINGS). SAVINGS ACCOUNT(ADEQUATE) INCOME (ADEQUATE) INVESTMENT(STOCKS).<\/p>\n\n\n\n<p>SAVINGS ACCOUNT(ADEQUATE) INCOME(INADEQUATE)\u2192INVESTMENT COMBINATION).<\/p>\n\n\n\n<p>1. YOU HAVE TO DEFINE RULES IN FOL FOR MINIMUM SAVINGS AND ADEQUACY OF SAVINGS. (5+5=10) 2- SOLVE THE FOLLOWING PROBLEM USING RULES GIVEN\/DERIVED BY ABOVE INFORMATION. (5+5=10) JAMAL HAS FOUR DEPENDENTS, A STEADY INCOME OF $30,000 AND $15,000 IN HIS SAVING ACCOUNT. A)-SHOW THE ABOVE INFORMATION BY ADDING APPROPRIATE PREDICATES FROM EXAMPLE ABOVE. B)- DETERMINE HIS SUGGESTED INVESTMENT WITH THE HELP OF INFERENCE RULES.<\/p>\n\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter size-large\"><img loading=\"lazy\" decoding=\"async\" width=\"768\" height=\"1024\" src=\"https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/5bb7ddb7-983e-4600-8d69-d395f544ecee-768x1024.jpg\" alt=\"\" class=\"wp-image-193\" srcset=\"https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/5bb7ddb7-983e-4600-8d69-d395f544ecee-768x1024.jpg 768w, https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/5bb7ddb7-983e-4600-8d69-d395f544ecee-225x300.jpg 225w, https:\/\/staymind.shop\/wp-content\/uploads\/2026\/01\/5bb7ddb7-983e-4600-8d69-d395f544ecee.jpg 864w\" sizes=\"auto, (max-width: 768px) 100vw, 768px\" \/><\/figure>\n<\/div>\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Let&#8217;s dispel the Hollywood myth right now:&nbsp;Artificial Intelligence (AI)&nbsp;is not about building conscious androids. It&#8217;s the rigorous, often gritty, engineering discipline of creating systems that can&nbsp;perceive, reason, learn, and act&nbsp;to achieve specific goals. This past paper isn&#8217;t a sci-fi quiz; it&#8217;s a demanding test of your ability to model intelligence as a computational process\u2014one filled [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":194,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[44],"tags":[45,4,5,6,7,10],"class_list":["post-188","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-artificial-intelligence","tag-artificial-intelligence","tag-comsats","tag-new","tag-paper","tag-past","tag-start"],"_links":{"self":[{"href":"https:\/\/staymind.shop\/index.php?rest_route=\/wp\/v2\/posts\/188","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/staymind.shop\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/staymind.shop\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/staymind.shop\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/staymind.shop\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=188"}],"version-history":[{"count":1,"href":"https:\/\/staymind.shop\/index.php?rest_route=\/wp\/v2\/posts\/188\/revisions"}],"predecessor-version":[{"id":195,"href":"https:\/\/staymind.shop\/index.php?rest_route=\/wp\/v2\/posts\/188\/revisions\/195"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/staymind.shop\/index.php?rest_route=\/wp\/v2\/media\/194"}],"wp:attachment":[{"href":"https:\/\/staymind.shop\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=188"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/staymind.shop\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=188"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/staymind.shop\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=188"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}