Scribd Logo
Upload

Welcome to Scribd!

  • 23 views

    Rang 3

    Uploaded by

    Mano
    This document outlines an examination for an Artificial Intelligence course, including: 1) 5 learning outcomes that students will be able to demonstrate including knowledge representation, heuristic search algorithms, and expert systems. 2) The exam consists of multiple choice, short answer, and long answer questions testing these outcomes. 3) Sample questions are provided testing topics like search algorithms, knowledge representation, applications of AI, and converting sentences to conjunctive normal form. 4) Long answer sections include solving problems like the water jug problem using search, goal stack planning, converting sentences to CNF, using the A* algorithm on a graph, and applying alpha-beta pruning to a game tree.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Rang 3

    Uploaded by

    Mano
    23 views3 pages
    This document outlines an examination for an Artificial Intelligence course, including: 1) 5 learning outcomes that students will be able to demonstrate including knowledge representation, heuristic search algorithms, and expert systems. 2) The exam consists of multiple choice, short answer, and long answer questions testing these outcomes. 3) Sample questions are provided testing topics like search algorithms, knowledge representation, applications of AI, and converting sentences to conjunctive normal form. 4) Long answer sections include solving problems like the water jug problem using search, goal stack planning, converting sentences to CNF, using the A* algorithm on a graph, and applying alpha-beta pruning to a game tree.

    Original Title

    Rang3

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document outlines an examination for an Artificial Intelligence course, including: 1) 5 learning outcomes that students will be able to demonstrate including knowledge representation, heuristic search algorithms, and expert systems. 2) The exam consists of multiple choice, short answer, and long answer questions testing these outcomes. 3) Sample questions are provided testing topics like search algorithms, knowledge representation, applications of AI, and converting sentences to conjunctive normal form. 4) Long answer sections include solving problems like the water jug problem using search, goal stack planning, converting sentences to CNF, using the A* algorithm on a graph, and applying alpha-beta pruning to a game tree.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    23 views3 pages

    Rang 3

    Uploaded by

    Mano
    This document outlines an examination for an Artificial Intelligence course, including: 1) 5 learning outcomes that students will be able to demonstrate including knowledge representation, heuristic search algorithms, and expert systems. 2) The exam consists of multiple choice, short answer, and long answer questions testing these outcomes. 3) Sample questions are provided testing topics like search algorithms, knowledge representation, applications of AI, and converting sentences to conjunctive normal form. 4) Long answer sections include solving problems like the water jug problem using search, goal stack planning, converting sentences to CNF, using the A* algorithm on a graph, and applying alpha-beta pruning to a game tree.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    JECRC University

    END TERM Examination Dec-2020


    B.Tech – Computer Science and Engineering
    Subject: Artificial Intelligence
    Subject Code: BCO 019A

    Time: 3 hours. Maximum Marks: 100


    Instructions:
    1. Attempt all the questions.
    2. Illustrate your answers with suitable examples and diagrams, wherever necessary.
    3. Write relevant question numbers before writing the answer.
    Course Outcome (CO):
    At the end of the course, students will able to:-

     CO1: Familiar basic principles of artificial intelligence;


     CO2: To use logic and structured concepts in knowledge representation;
     CO3: To discuss the applications of artificial intelligence;
     CO4: To implement heuristic search algorithms;
     CO5: To design a natural language processor and implement a simple expert system.

    Section –A (Objective) 10*1=10 Marks

    1. (CO1) Mundane Tasks does not include:


    a) Perception b) Natural languages c) Common Sense reasoning d) Games

    2. (CO4) Which search is equal to min-max search but eliminates the branches that
    can’t influence the final decision?
    a) Depth-first search b) Breadth-first search
    c) Alpha-beta pruning d) None of the mentioned

    3. (CO2) Which form is called as conjunction of disjunction of literals?


    a) Conjunctive normal form b) Disjunctive normal form
    c) Normal form d) All of the mentioned

    4. (CO3) (PvQ) = (QVP) show the …………………. Logical equivalence.


    a) Idempotency (b) Commutative (c) Distributive (d) none of the mentioned

    5. (CO4)The MIN-MAX procedure is a Depth First Search Procedure. (True/False)

    6. (CO3) A production rule consists of


    a) A set of Rule b) A sequence of steps c) Both a and (b)
    d) Arbitrary representation to problem e) directly getting solution

    7. (CO3) How the efficiency of Apha Beta pruning gets increased?


    (a) Depends on the nodes (b) Depends on the order in which they are executed
    (c) Both a & b (d) None of the above

    8. (CO2)How do you represent “All dogs have tails”.


    (a) ۷x: dog(x)hastail(x) (b) ۷x: dog(x)hastail(y)
    (c) ۷x: dog(y)hastail(x) (d) ۷x: dog(x)hastail(x)
    9. (CO4) The initial state and the legal moves for each side define the __________ for the game.
    (a) Search Tree (b) Game Tree (c) State Space Search (d) Forest

    10. (CO4). If P is True, Q is False and R is true, the output of (P ^ ~Q v ~R) will be :
    (a) True (b) False

    Section – B (Very Short answers) 5*2 = 10marks

    1. (CO1) What is Intelligence?


    2. (CO4) What is the use of heuristic function?
    3. (CO2) Differentiate BFS & DFS.
    4. (CO3) What are the applications areas in AI
    5. (CO5)Write names of 2 Expert Systems and its function

    Section- C 5*6 = 30 Marks

    1. (CO1) Explain AI along with its tasks, techniques and domains.

    2. (CO3) Explain five Logical connectives in prepositional logic with suitable explanation and
    example

    3. (CO4) What is Game Playing? Explain the algorithm which is used for game playing with the help
    of an example.

    4. (CO5) Explain Expert System and its components in detail with diagram.

    5. (CO3) Explain Partial order planning. what are the advantage and disadvantage of Non Linear
    plan

    Section – D 5*10 = 50marks

    1. (CO1) What are the steps to formalize a problem? Draw state space search of Water Jug
    problem using Depth first search Algorithm.

    2. (CO4) Using GOAL STACK Planning Method , Solve the following and show all steps in detail
    including Database and Solution

    3. (CO3) Write all steps to convert sentences into CNF and also convert below sentence into CNF

    All Romans who know Marcus either hate Caesar or think that anyone who hates anyone is
    crazy
    4. (CO2) Traverse the given graph using the A* algorithm. The heuristic value of all states is given
    in the below table so we will calculate the f(n) of each state using the formula f(n)= g(n) + h(n),
    where g(n) is the cost to reach any node from start state.Find the optimal path with cost using
    A* algo showing each step

    5. Consider the game tree as below:

    Write Alpha –Beta Pruning algorithm. Apply Alpha –Beta Pruning and Draw Pruned Tree. Explain
    which nodes will be pruned and which nodes are never explored

    You might also like