0% found this document useful (0 votes)
111 views4 pages

2 - MQP - BCA303 - Artificial Intelligence

Ai imp questions

Uploaded by

kkhtt57
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
0% found this document useful (0 votes)
111 views4 pages

2 - MQP - BCA303 - Artificial Intelligence

Ai imp questions

Uploaded by

kkhtt57
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/ 4

Model Question Paper- I with effect from 2023-24

USN

DAYANANDA SAGAR ACADEMY OF TECHNOLOGY & MANAGEMENT


(An Autonomous Institute under VTU, Belagavi)

First Semester B.E Semester End Examination Jan 2024/Feb 2024

Course: Artificial Intelligence


Course Code: BCA303
Max Marks: 100 Duration: 03 Hours
Note:
Answer any FIVE full questions, choosing at least ONE question from each MODULE

Module - 1 Marks BL CO
a Define Total Turing test, bounded rationality ,decision theory, neurons 8 L1 CO1

Explain the significant contributions of various branches in the foundations of AI


b 7 L2 CO1
Q.1
Give PEAS specification for Wumpus world Problem
c 5 L3 CO1
OR
Explain Milestones of AI with reference to (i) Neural networks failure to
a generalize (ii) Advent of DENDRAL (iii) Emergence of Intelligent Agents 8 L2 CO1

Differentiate: (i)semi-dynamic vs dynamic (ii) episodic vs sequential (iii)


b deterministic vs stochastic 7 L2 CO1
Q.2
Give PEAS specification of biometric authentication system
c 5 R CO1

Module – 2
Define five components of a problem. Write a complete state space fora
a vacuum cleaner to clean 2 squares P and Q. Q is to the right of P 8 L3 CO2

Compare and contrast the time , space complexity ,optimality , completeness


b for Breadth first search and Depth First Search algorithms 6 L4 CO2
Q.3

Explain Iterative deepening Depth first search algorithm with an example


c 6 R CO2

OR
For an automatic taxi driver application, explain Goal and utility agents with
a appropriate block diagrams 8 L2 CO2
Q.4 Given a 3×3 board with 8 tiles (each numbered from 1 to 8) and one empty
b space in a 8-puzzle Problem as shown in the figure below. Place the numbers 7 L3 CO2
so as to match the final configuration using DFS and BFS. We can slide four
adjacent tiles (left, right, above, and below) into the empty space.
Model Question Paper- I with effect from 2023-24

With an algorithm explain Depth limited search


c 5 U CO2

Module – 3
The missionaries and cannibals problem is stated as follows. Three missionaries 10 L3 CO3
a and three cannibals are on one side of a river, along with a boat that can hold
Q5 one or two people. Find a way to get everyone to the other side without ever
leaving a group of missionaries in one place outnumbered by the cannibals in
that place
a. Formulate the problem precisely, making only those distinctions necessary to
ensure a valid solution. Draw a diagram of the complete state space.
b. Implement and solve the problem optimally using an appropriate search
algorithm. Is it a good idea to check for repeated states?

Define in your own words the following terms: state, state space, search tree, 5 L2 CO3
b search node, goal, action, transition model, and branching factor.
Outline a generic knowledge-based agents’ program. Write PEAS specification 5 L2 CO3
c for Wumpus world.

OR
a 10 L3 CO3
Q.6

Apply the A* search to find the solution path from a to z. Heuristics are with
nodes, and cost is with edges. Write all steps as well as open and closed lists for
full marks

Explain forward chaining and backward chaining in propositional logic with


b examples 5 L2 CO3

c Convert the following sentence B1,1 ⇔ (P1,2 ∨ P2,1) into CNF giving detailed 5 L3 CO3
steps

Module – 4
Model Question Paper- I with effect from 2023-24

Explain various reasons for failure of First Order Logic Define a sample space
a for picking 2 tokens from 6 tokens of lab questions with token taken first time is 10 L2 CO4
not replaced.
Define Universal and Existential Instantiation and give examples for both.
Q.7 b Prove the following using Backward and Forward chaining: 5 L3 CO4
"As per the law, it is a crime for an American to sell weapons to hostile nations.
Country E, an enemy of America, has some missiles, and all the missiles were
sold to it by Solan, who is an American citizen." Prove that "Solan s criminal."
OR
a Complete the following exercises about logical senntences: 10 L3 CO4
a. Translate into good, natural English (no xs or ys!):
Q.8
∀ x, y, l Speaks Language (x, l) ∧ Speaks Language (y, l)
⇒ Understands (x, y) ∧ Understands (y, x).
b. Explain why this sentence is entailed by the sentence
∀ x, y, l Speaks Language(x, l) ∧ Speaks Language(y, l)
⇒ Understands (x, y).
c. Translate into first-order logic the following sentences:
(i) Understanding leads to friendship.
(ii) Friendship is transitive.

Remember to define all predicates, functions, and constants you use


Write appropriate quantifiers for the following
b (i) Some students read well 5 L2 CO4
(ii) Some students like some books
(iii) Some students like all books
(iv) All students like some books
(v) All students like no books

Explain the concept of Resolution in First Order Logic with appropriate procedure
Consider a knowledge base containing just two sentences: P(a) and P(b). Does
c this knowledge base entail ∀x P(x)? Explain your answer in terms of models. 5 L2 CO4

Module – 5
a Show from first principles that P(a | b ∧ a) = 1. 6 L2 CO5
Q.9 Let continuous variables X1, . . . ,Xk be independently distributed according to
b the same probability density function f(x). Prove that the density function for 6 L2 CO5
max{X1, . . . ,Xk} is given by kf(x)(F(x))k−1, where F is the cumulative
distribution for f.
For each of the following statements, either prove it is true or give a
c 8 L4 CO5
counterexample.
a. If P(a | b, c) = P(b | a, c), then P(a | c) = P(b | c)
b. If P(a | b, c) = P(a), then P(b | c) = P(b)
c. If P(a | b) = P(a), then P(a | b, c) = P(a | c)
OR
The convex composition [α, q1; 1 − α, q2] of q1 and q2 is a transition probability
a distribution, that first chooses one of q1 and q2 with probabilities α and 1 − α, 6 L2 CO5
respectively, and then applies whichever is chosen. Prove that if q1 and q2 are in
Model Question Paper- I with effect from 2023-24

detailed balance with π, then their convex composition is also in detailed balance
Q.10 with π. (Note: this result justifies a variant of GIBBS-ASK in which variables are
chosen at random rather than sampled in a fixed sequence.)
b. Prove that if each of q1 and q2 has π as its stationary distribution, then the
sequential composition q =q1 ◦ q2 also has π as its stationary distribution.
Using the axioms of probability, prove that any probability distribution on a discrete
b random variable must sum to 1. 6 L4 CO5
We have a bag of three biased coins a, b, and c with probabilities of coming up
c heads of 20%, 60%, and 80%, respectively. One coin is drawn randomly from the 8 L4 CO5
bag (with equal likelihood of drawing each of the three coins), and then the coin is
flipped three times to generate the outcomes X1, X2, and X3.
a. Draw the Bayesian network corresponding to this setup and define the
necessary CPTs.
b. Calculate which coin was most likely to have been drawn from the bag if the
observed flips come out heads twice and tails once.

You might also like