Dr. D. Y.

Patil Institute of Technology, Pimpri, Pune

Department of Computer Engineering
QUESTION BANK
T.E. Honours* in AI & ML Online Examination
TOPIC REFERENCE Book
Unit III Knowledge and Russell, S. and Norvig,
Reasoning P. 2015. Artificial
Intelligence - A Modern
Approach, 3rd edition,
Prentice Hall
Unit IV Learning Alpaydin, E. 2010.
Introduction to Machine
Learning. 2nd edition,
MIT.
Unit V Game Ric, E., Knight, K and
Shankar, B. 2009.
Artificial Intelligence,
3rd edition, Tata
McGraw Hill.
Unit VI Expert Systems Introduction to Artificial
Intelligence & Expert
Systems, Dan W
Patterson, PHI.,2010

Unit 3: Knowledge and Reasoning

1. Consider the problem of deciding whether a propositional logic sentence is true in a given model.
a. Write a recursive algorithm PL-TRUE?(s,m) that returns true if and only if the sentence
s is true in the model m (where m assigns a truth value for every symbol in s).
The algorithm should run in time linear in the size of the sentence. (Alternatively, use a
version of this function from the online code repository.)
b. Give three examples of sentences that can be determined to be true or false in a partial
model that does not specify a truth value for some of the symbols.
c. Show that the truth value (if any) of a sentence in a partial model cannot be determined
efficiently in general.
d. Modify your PL-TRUE? algorithm so that it can sometimes judge truth from partial
models, while retaining its recursive structure and linear run time. Give three examples
of sentences whose truth in a partial model is not detected by your algorithm.
e. Investigate whether the modified algorithm makes TT-ENTAILS? more efficient.
2. Which of the following are correct?
a. False |= True.
b. True |= False.
c. (A ∧ B) |= (A ⇔ B).
d. A ⇔ B |= A ∨ B.
e. A ⇔ B |= ￢A ∨ B.
f. (A ∧ B) ⇒ C |= (A ⇒ C) ∨ (B ⇒ C).
g. (C ∨(￢A ∧ ￢B)) ≡ ((A ⇒ C) ∧ (B ⇒ C)).
h. (A ∨ B) ∧(￢C ∨￢D ∨ E) |= (A ∨ B).
i. (A ∨ B) ∧ (￢C ∨￢D ∨ E) |= (A ∨ B) ∧ (￢D ∨E).
 j. (A ∨ B)∧ ￢(A ⇒ B) is satisfiable.
k. (A ⇔ B) ∧(￢A ∨ B) is satisfiable.
l. (A ⇔ B) ⇔ C has the same number of models as (A ⇔ B) for any fixed set of proposition
symbols that includes A, B, C.
3. State Propositional logic. Explain the knowledge representation using propositional logic.
4. State the limitations in using propositional logic to represent the knowledge base.
5. Differentiate between propositional versus first order predicate logic
6. For each of the following sentences in English, decide if the accompanying first-order logic
sentence is a good translation. If not, explain why not and correct it. (Some sentences may have
more than one error!)
a. No two people have the same social security number.
￢∃ x, y, n Person(x) ∧ Person(y) ⇒[HasSS#(x, n) ∧HasSS#(y, n)].
b. John’s social security number is the same as Mary’s.
∃ n HasSS#(John, n) ∧ HasSS#(Mary, n).
c. Everyone’s social security number has nine digits.
∀ x, n Person(x) ⇒ [HasSS#(x, n) ∧ Digits(n, 9)].
d. Rewrite each of the above (uncorrected) sentences using a function symbol SS#instead of the
predicate HasSS#.
7. Write axioms describing the predicates Grandchild , Greatgrandparent , Ancestor , Brother ,
Sister , Daughter , Son, FirstCousin, BrotherInLaw, SisterInLaw, Aunt, and Uncle. Find out the
proper definition of mth cousin n times removed, and write the definition in first-order logic.
Now write down the basic facts depicted in the family tree in Figure 8.7. Using a suitable logical
reasoning system, TELL it all the sentences you have written down, and ASK it who are
Elizabeth’s grandchildren, Diana’s brothers-in-law, Zara’s great-grandparents, and Eugenie’s

ancestors.
8. Consider a first-order logical knowledge base that describes worlds containing people, songs,
albums (e.g., “Meet the Beatles”) and disks (i.e., particular physical instances of CDs). The
vocabulary contains the following symbols:
CopyOf (d, a): Predicate. Disk d is a copy of album a.
Owns(p, d): Predicate. Person p owns disk d.
Sings(p, s, a): Albuma includes a recording of song s sung by person p.
Wrote(p, s): Person p wrote song s.
McCartney, Gershwin, BHoliday, Joe, EleanorRigby, TheManILove, Revolver : Constants
with the obvious meanings.
 Express the following statements in first-order logic:
a. Gershwin wrote “The Man I Love.”
b. Gershwin did not write “Eleanor Rigby.”
c. Either Gershwin or McCartney wrote “The Man I Love.”
d. Joe has written at least one song.
e. Joe owns a copy of Revolver.
f. Every song that McCartney sings on Revolver was written by McCartney.
g. Gershwin did not write any of the songs on Revolver.
h. Every song that Gershwin wrote has been recorded on some album. (Possibly different
songs are recorded on different albums.)
i. There is a single album that contains every song that Joe has written.
j. Joe owns a copy of an album that has Billie Holiday singing “The Man I Love.”
k. Joe owns a copy of every album that has a song sung by McCartney. (Of course, each
different album is instantiated in a different physical CD.)
l. Joe owns a copy of every album on which all the songs are sung by Billie Holiday.
9. Describe the differences and similarities between problem solving and planning.
10. Explain Partial Order Planning Show that any second-order Markov process can be rewritten as a
first-order Markov process with an augmented set of state variables. Can this always be done
parsimoniously, i.e., without increasing the number of parameters needed to specify the transition
model?
11. Often, we wish to monitor a continuous-state system whose behavior switches unpredictably
among a set of k distinct “modes.” For example, an aircraft trying to evade a missile can execute
a series of distinct maneuvers that the missile may attempt to track. A Bayesian network
representation of such a switching Kalman filter model is shown in Figure 15.21.

12. Write a short Note on:

i) Hidden Markova Models
ii) Kalman Filter
iii) Dynamic Bayesian Network

Unit 4: Learning
1. Explain the different forms of Learning
2. Explain in detail with the help of example the concept of
i) Supervised learning
ii) Unsupervised learning
iii) Reinforcement learning
3. Detail the concept of Artificial Neural Networks. List the applications of ANN.
4. Detail the concept of regression & classification with linear model
5. Suppose we generate a training set from a decision tree and then apply decision-tree learning to
that training set. Is it the case that the learning algorithm will eventually return the correct tree as
the training-set size goes to infinity? Why or why not?
6. Describe the Ensemble Learning with some Real-World Applications.
7. Explain the Support Vector machine(SVM) with the example
8. State the problems faced by SVM when used with real dataset.
9. Explain the structure of binary decision tree for sequential decision process
10. Explain with example the process building a decision tree
11. Explain the feature importance in decision tree
12. Explain random forest decision tree model with suitable example
13. Write in details 4 application of Supervised Learning
14. Write in details 3 application of Unsupervised Learning
15. Write various application of reinforcement Learning
16. Explain the different types of supervised & unsupervised learning algorithm
17. Explain supervised and unsupervised learning with an example.
18. Explain the architecture of Artificial Neural Network
19. What is Artificial Neural Network? Give two applications of artificial neural networks in detail.

Unit 5: Game
1. Explain game playing with example
2. Explain following terms in game playing with examples
i) Minimax (position, Depth, Player)
ii) Deep Enough (Position, Depth)
3. Write a short note on Stochastic games
4. Explain the Game theory
5. Explain the games, application of game theory, types of games, game playing Strategies and
major components of game playing program
6.
 Unit 6: Expert Systems
1. Explain machine translation using natural language processing (NLP).
2. Write a short note on Knowledge acquisition
3. Explain Forward chaining and backward chaining algorithms
4. Explain forward chaining and backward chaining for a simple example.
5. Twitter Sentiment Analysis: A Case Study for Apparel Brands
6. General framework for Computer Vision application
7. Explain any two NLP applications.
8. Explain the Expert System
9. Explain Expert System with example
10. How to choose the type of chaining among forward or backward chaining for a
given problem ?
11. Describe Backward Chaining Systems
12. Explain Forward Chaining Systems
13. state the Components of Expert Systems
14. List Applications of Expert System
15. State the case study on object recognition using computer vision for any suitable application