Scribd
Upload
62 views2 pages

Set B

This document contains a practice exam for an Artificial Intelligence course. It has multiple choice and short answer questions covering topics like search algorithms, decision trees, entropy, constraint satisfaction problems, and consistency in constraint networks.

Uploaded by

sami khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
62 views2 pages

Set B

This document contains a practice exam for an Artificial Intelligence course. It has multiple choice and short answer questions covering topics like search algorithms, decision trees, entropy, constraint satisfaction problems, and consistency in constraint networks.

Uploaded by

sami khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

SET B

BRAC UNIVERSITY
Department of Computer Science and Engineering
Examination: Semester Final Total Mark: 40
Duration: 1 Hour 30 Minutes
CSE 422: Artificial Intelligence
Answer the following questions.
Figures in the right margin indicate marks.

1. CO1

a. Determine a new heuristic h2(n) which is dominant to the given heuristic and also 5
consistent.
b. Perform A* search on the h1(n) heuristic considering A as the start node alongside G 3
as the goal node and comment if the optimal path is returned. Push Nodes
alphabetically and in case of a tie during expansion, use FIFO approach.
c. Comment on the consistency of F and A for h1(n) 2

2. CO4

a. If an event X has n possible outcomes each with probabilities p1, p2,...., pn, then the 2
entropy of X is defined as H(X) = -p1log2(p1) -p2log2(p2) ..... -pnlog2(pn) . If n = 8,
what is the minimum possible value for H(X)? When does it happen? Explain.
b. Build a decision tree from the given information by ignoring the student ID column. 5
The decision column is the column named “liked”. Construct the root node only and
determine if any of the immediate children end up as a leaf node.
SET B

c. Considering a student has taken Machine Learning as a course, calculate the 3


information gain of Prior experience.

3. CO3 a. Consider two medical tests, X and Y, for a virus. Test X is 92% effective at 10
recognizing the virus when it is present, but has a 7% false positive rate (indicating
that the virus is present, when it is not). Test B is 85% effective at recognizing the
virus, but has a 5% false positive rate. The two tests use independent methods of
identifying the virus. The virus is carried by 1% of all people. Say that a person is
tested for the virus using only one of the tests, and that test comes back positive for
carrying the virus. Which test returning positive is more indicative of someone really
carrying the virus? Justify your answer mathematically.

4.CO2 a. Suppose you have four variables A, B, C, and D. Now A, B, and C take in values 8
ranging from 1 to 5, but D can only be assigned a value from 1 to 4. In addition,
whatever values they are assigned, D ≠ B, D ≠ C, B ≠ C/2, B ≠ 1, A cannot be a
multiple of B. Now you have to treat this problem as a constraint satisfaction
problem and finalize a solution that satisfies the above-given scenario.

i. Generate the constraint graph for this CSP

ii. Formulate all the unary and binary constraints.

iii. Solve the problem by employing backtracking along with forward checking. In
addition, you have to use heuristics (Variable and value ordering) wherever required
to select which variable to work with, and what value to assign it.

b. Assume two variables X and Y. They can be assigned any value from 0 to 9. But, X 2
has to be less than Y. What would it mean for X to be arc-consistent with Y? And
propose a solution such that X becomes arc-consistent with respect to Y.

You might also like