Scribd Logo
Upload

Welcome to Scribd!

  • Btech Cs It 6 Sem Artificial Intelligence 610405 2022

    Uploaded by

    Ishaan Sharma
    7 views2 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    Download as pdf
    7 views2 pages

    Btech Cs It 6 Sem Artificial Intelligence 610405 2022

    Uploaded by

    Ishaan Sharma

    Copyright:

    © All Rights Reserved
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    Download as pdf
    of 2
    Total No. of Pages: [2 Roll No, wn So 61 3 B. Tech. VI - Sem. (Main) Exam., (Academic Session 2021- 2022) a Computer Science & Engineering wo 6CS4 - 05/61T4-05 Artificial Intelligence Common with CSE & IT Time: 2 Hours Maximum Marks: 80 Min. Passing Marks: Instructions to Candidates: e Part—A: Short answer questions (up to 25 words)(2)x 3 marks = 6 marks. Candidates have to answer two questions out of; five. Part - B: Analytical/Problem solving questions( 3) x 15 marks = 45 marks. Candidates have to answer three questions out of six. Part ~ C: Descriptive/Analytical/Problem Solving question(¥ 29 marks =09)narks. Candidates have to answer one questions out of three. Schematic diagrams must be shown wherever necessary. Any data you feel missing may suitably be assumed and stated clearly. Units of quantities used/calculated must be stated clearly. Use of following supporting material is permitted during examination. {Mentioned in form No. 205) 1. NIL 2.NIL PART-A Ge) pefine an Al agent. [ Q.2 Define heuristic function. ; Q3 > Define resolution. Q4 State the importance of Bayesian network. | © GB What isa learning decision tree? {610405} Page 1 of 2 https:/Awww.btubikaner.com PART-B Q.I Explain the procedure of forward state-space search with an example. Q.2 Inthe given example use alpha-beta pruning (o select the next move 2, 1, 6, 1.8, 3, 5, 2.3, 4, 2, 6 (Root node having degree 3 and rest of node having degree 2). ® Explain greedy best-first search algorithm. Qe Discuss in brief the various ways of knowledge representation. GBF Explain how decision trees can be used in machine learning? Q6 Briefly discuss about the phases available in expert systems. PART-C Ay explain the procedure of implementing Hill climbing search technique with an example, Q2 1% of women over age fory who are screened, have cancer. 80% of women who really do have cancer will have a positive mammography (meaning the test indicates she has cancer), 9.6% of women who do not actually have cancer will have a Positive mammography (meaning that they are incorrectly di sed with cancer), Define two Boo} random variables, M meaning a positive mammography test and

    You might also like