MODEL QP FOR AI&DS alpha

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 2

16/21/2016

Date
ALPHA COLLEGE OF ENGINEERING
Format No. EXP 01
MODEL EXAM Rev. No. 00

REG.NO

Sub. Code AL3391 Sub. Name Artificial Intelligence


Department AI&DS Year/Sem Second Year / III
Date of Exam .2024 Session AN
Duration 90 mins. Maximum 100 marks
CO1 To know how to derive meaning from huge volume and information.
CO2 To understand how knowledge discovering process is used in business decision making.
CO3 Develop the ability to understand Turning raw data into useful information. by patterns
CO4 To develop supervised and unsupervised learning techniques in B I
CO5 Evaluate and choose the appropriate technologies, for knowledge discovery process in B I
BTL – Bloom’s Taxonomy Levels
(L1-Remember, L2-Understand, L3-Apply, L4-Analyse, L5-Evaluate, L6-Create)

PART- A (10x2=20Marks)

Q.No Questions Marks CO BTL


1. Define AI and write the application of AI 2 CO1 L1
2. List the steps involved in simple problem techniques 2 CO1 L2
3. What is heuristic function? 2 CO1 L4

4. Mention the things that agent knows in online search function. 2 CO2 L2

5. List the components of the game 2 CO2 L2

6. Define :Constraint propagation 2 CO2, L2


CO3
7. List the three levels in describing knowledge based agents. 2 CO2, L2
CO3
8. State about unification in first order logic 2 CO4, L4
CO3
9. List the reasons for arising of uncertainty 2 CO5 L2
10. Define Byes rule 2 CO5 L2

PART- B 5 X 1 3 (65Marks)

Q.No Questions Marks CO BTL


11 [a] What is an agent how does it interacts with the environment explain
[b] What is informed search technique explain with example
Or 13 CO1 L5
List the basic kind of intelligent agent and explain any two agent with
[c]

schematic diagram
12 [a] What is heuristic search technique in AI? How does it work explain with
its advantages CO1,
[b] 13 CO2 L2
Describe the local search algorithm with neat sketch
Or
[c] Explain steps involved in formulation of problems with examples
[d] Write a note on genetic algorithm.
13 [a] Explain the constraint satisfying problem with examples
Or
[b] i)Write a note on Monte Carlo search CO2 L4
13 CO3
ii) Describe in a note Local consistency.

14 [a] Detail with a note on the algorithm general propositional inference


based on model chequing.
Or
[b] Explain in detail the Knowledge engineering process with neat 13 CO3 L2
CO4
illustration depict the forward chaining concept

15 [a] Detail the structure of Bayesian network


Or
[b] 13 CO5 L4
Discuss exact inference in Bayesian network
[c] What are the ways to understand the semantic of bayesian network

PART C—(115=15marks)
16.

[a] Analyze minimax algorithm with Alpha beta search algorithm


15 CO4 L4
[b]
Mention the significance of Knowledge representation with CO5
its desirable properties

Or
[c]
Elaborate conjunctive normal form with its procedure to convert
conjunctive normal form with neat example.

*******

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy