Scribd Logo
Upload

Welcome to Scribd!

  • 41 views

    AI - Second-Sessional 2021-22 - Odd Semester

    Uploaded by

    Abhishek Tripathi
    The document is a sessional examination for an Artificial Intelligence course for a 4th year B.Tech student. It contains 7 sections with multiple choice and long answer questions. The questions assess various course outcomes related to concepts in AI like heuristics, search techniques, machine learning, logic and applications. Key questions ask students to explain A* search technique, greedy search, minimax algorithm, supervised vs unsupervised learning and convert statements to first order logic.

    Copyright:

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

    AI - Second-Sessional 2021-22 - Odd Semester

    Uploaded by

    Abhishek Tripathi
    41 views3 pages
    The document is a sessional examination for an Artificial Intelligence course for a 4th year B.Tech student. It contains 7 sections with multiple choice and long answer questions. The questions assess various course outcomes related to concepts in AI like heuristics, search techniques, machine learning, logic and applications. Key questions ask students to explain A* search technique, greedy search, minimax algorithm, supervised vs unsupervised learning and convert statements to first order logic.

    Original Title

    AI_Second-Sessional 2021-22_Odd Semester

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document is a sessional examination for an Artificial Intelligence course for a 4th year B.Tech student. It contains 7 sections with multiple choice and long answer questions. The questions assess various course outcomes related to concepts in AI like heuristics, search techniques, machine learning, logic and applications. Key questions ask students to explain A* search technique, greedy search, minimax algorithm, supervised vs unsupervised learning and convert statements to first order logic.

    Copyright:

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

    AI - Second-Sessional 2021-22 - Odd Semester

    Uploaded by

    Abhishek Tripathi
    The document is a sessional examination for an Artificial Intelligence course for a 4th year B.Tech student. It contains 7 sections with multiple choice and long answer questions. The questions assess various course outcomes related to concepts in AI like heuristics, search techniques, machine learning, logic and applications. Key questions ask students to explain A* search technique, greedy search, minimax algorithm, supervised vs unsupervised learning and convert statements to first order logic.

    Copyright:

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

    BABU BANARASI DAS

    NORTHERN INDIA INSTITUTE OF TECHNOLOGY, LUCKNOW


    B. TECH. 4th YEAR (IT) – SESSIONAL EXAMINATION-II
    ACADEMIC SESSION 2021-22(ODD SEMESTER)

    ARTIFICIAL INTELLIGENCE (KCS-071)


    Time: 1½ hrs
    Max Marks: 30
    NOTE: Attempt all sections
    CO: Course Outcomes / BTL: Bloom's Taxonomy Level
    SECTION A
    Q01. Attempt ALL parts in brief:
    [06x01 =06]

    Course Outcome(CO) & Bloom's Taxonomy Level (BT) for each question CO BTL

    1A What is Heuristics? CO 1 1

    1B What is the full form of CAPTCHA? CO 1


    1

    1C Which programming language is not generally used in AI, and why? CO 1


    1

    1D CO 1
    Which method is used for optimizing a Minimax based game? 1

    1E CO 1
    Explain the assessment that is used to test the intelligence of a machine. 1

    1F What is informed search? CO 1


    1

    SECTION B
    Q 02 Attempt any FOUR Questions from this section [04x02 =08]

    Course Outcome(CO) & Bloom's Taxonomy Level (BT) for each question CO BTL

    2A Explain Uniformed Serach Strategy. CO 1 2

    2B What do you understand by completeness and optimality? CO 1 2

    2C Describe Turing test with Diagram. CO 1 2

    2D What is OPEN SET and CLOSED SET in A*? CO 1 1

    2E Show that DFS is neither complete nor optimal CO 1 2

    2F Differentiate Uniformed and informed search. CO 1 1


    SECTION C
    Attempt any TWO questions from this section
    [02 x 08 =16]
    Q 03 Attempt any ALL Parts of the Following
    [02 x 04 = 08]

    Course Outcome(CO) & Bloom's Taxonomy Level (BT) for each question CO BTL

    3A Explain A* searching Technique . CO 2


    1

    3B What is a Chatboat? Also Give Example of Chatboat. CO 2


    1

    Q 04 Attempt any ALL Parts of the Following


    [02 x 04 = 08]

    4A Discuss the Greedy search Technique(Best First Search). CO 2


    1

    4B Compare supervised and unsupervised Learning. CO 1


    1

    Q 05 Attempt any ALL Parts of the Following


    [02 x 04 = 08]

    5A What is the Minimax Algorithm? Explain the terminologies involved in a Minimax problem. CO 2
    1

    5B What is water jug Problem? Explain with suitable example. CO 1


    1

    Q 06 Attempt any ALL Parts of the Following


    [02 x 04 = 08]

    6A Write a Lisp/prolog program to convert Centigrade program to Fahrenheit. CO 2


    1

    6B CO 1
    What is reinforcement learning .also write down the applications of its. 1

    Q 07 Attempt any ALL Parts of the Following


    [02 x 04 = 08]

    7A Convert the following statements into First order logic. CO 1


    1
    (i) All man drink coffee.
    (ii) Some boys are intelligent.
    7B Define a well-formed formula (wff) and List some of the rules of inference. CO 1
    1

    Section A Section B Section C

    Ques Ques 01 Ques 02 Ques 03 Ques 04 Ques 05 Ques 06 Ques 07

    1A 1B 1C 1D 1E 1F 2A 2B 2C 2D 2E 2F 3A 3B 4A 4B 5A 5B 6A 6B 7A 7B

    CO CO CO CO CO CO CO CO CO CO CO CO CO CO CO CO CO CO CO CO CO CO
    CO
    1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

    BTL 1 1 1 1 1 1 2 2 2 1 2 1 2 2 2 1 2 1 2 1 1 1

    You might also like