Scribd Logo
Upload

Welcome to Scribd!

  • 16 views

    AI Question Paper Oct - 2022

    Uploaded by

    rajjarad01
    This document contains a test paper with 4 questions related to artificial intelligence. It includes topics like intelligent agents, search algorithms, state-space search, constraint satisfaction problems, rationality, problem solving agents, learning agents, model-based vs utility-based agents, and alpha-beta tree search. The test has a total of 30 marks and is to be completed within 1 hour.

    Copyright:

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

    AI Question Paper Oct - 2022

    Uploaded by

    rajjarad01
    16 views1 page
    This document contains a test paper with 4 questions related to artificial intelligence. It includes topics like intelligent agents, search algorithms, state-space search, constraint satisfaction problems, rationality, problem solving agents, learning agents, model-based vs utility-based agents, and alpha-beta tree search. The test has a total of 30 marks and is to be completed within 1 hour.

    Original Description:

    Good Luck Guys For Your Exam !

    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 contains a test paper with 4 questions related to artificial intelligence. It includes topics like intelligent agents, search algorithms, state-space search, constraint satisfaction problems, rationality, problem solving agents, learning agents, model-based vs utility-based agents, and alpha-beta tree search. The test has a total of 30 marks and is to be completed within 1 hour.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    16 views1 page

    AI Question Paper Oct - 2022

    Uploaded by

    rajjarad01
    This document contains a test paper with 4 questions related to artificial intelligence. It includes topics like intelligent agents, search algorithms, state-space search, constraint satisfaction problems, rationality, problem solving agents, learning agents, model-based vs utility-based agents, and alpha-beta tree search. The test has a total of 30 marks and is to be completed within 1 hour.

    Copyright:

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

    Total No. of Questions : 4] SEAT No.

    8
    23
    P8869 [Total No. of Pages : 1

    ic-
    Oct-22/TE/Insem-631

    tat
    T.E. (Artificial Intelligence and Data Science)

    6s
    ARTIFICIAL INTELLIGENCE

    7:0
    02 91
    (2019 Pattern) (Semester - I) (310253)

    0:3
    0
    21
    Time : 1 Hour] [Max. Marks : 30
    7/1 13
    Instructions to the candidates:
    0
    1) Answer questions Q.1 or Q.2, Q.3 or Q.4
    0/2
    .23 GP

    2) Neat diagrams must be drawn wherever necessary.


    3) Assume suitable data if necessary.
    E
    80

    8
    C

    23
    ic-
    Q1) a) What is AI? Explain risk and benefits of AI. [5]
    16

    tat
    b) What is Intelligent Agent? Explain structure of agent and example with
    8.2

    6s
    PEAS Property for Automatic Taxi Driving. [10]
    .24

    7:0
    OR
    91
    49

    0:3
    Q2) a) Differentiate between informed and uninformed search algorithms also
    30
    21

    explain iterative deepening search in short. [5]


    01
    02

    b) i) Define state-space search technique


    0/2

    ii) Define CSP. Solve SEND


    GP

    + MORE
    7/1
    CE

    [10]
    80

    8
    23
    Q3) a) Explain the concept of Rationality [5]
    .23

    b) i) Explain problem solving agents with suitable example. ic-


    16

    tat
    ii) Explain learning agents with its components.
    8.2

    6s

    [10]
    .24

    7:0

    OR
    91
    49

    0:3

    Q4) a) Differentiate between model-based agents & utility-based agents [5]


    30
    21

    b) Explain Min Max Tree. Solve alpha-beta tree search for following search
    01
    02

    problem. Also given minimum two advantages of alpha beta algorithm


    0/2

    over min max algorithm. [10]


    GP
    7/1
    CE
    80
    .23
    16
    8.2

    ooo
    .24

    TE-Insem-631
    49

    You might also like