Artificial Intelligence and Machine Learning (18CS71) Question Bank

MODULE-2

Artificial Intelligence and Machine Learning

Q.
No Question COs CL M
.

1. Define Concept and Concept Learning. With example explain how the Concept CO2 L1
Learning task determines the Hypothesis for given target concept. (Jan 2021)
2. Define Inductive Learning Hypothesis. (Jan 2021, Dec 2019) CO2 L1

3. Discuss Concept learning as search with respect to General to specific ordering of CO2 L6
hypothesis. (Jan 2019)
Describe Find S Algorithm. Explain its working taking the enjoy sport concept and
training instances given below. What are the properties and complaints of Find S.?
(Jan 2021, Dec 2019)
Day Sky AirTemp Humidity Wind Water Forecast EnjoySport
4. CO2 L2
1 Sunny Warm Normal Strong Warm Same Yes
2 Sunny Warm High Strong Warm Same Yes
3 Rainy Cold High Strong Warm Change No
4 Sunny Warm High Strong Cool Change Yes
5. Define Consistent Hypothesis and Version Space. With example explain Version Space and CO2 L1 1
Representation of version Space. (July 2019)
6. Write the List then Eliminate Algorithm. (July 2019) CO2 L2

7 Explain the candidate elimination algorithm for any of the example given below: CO2 L2 1
(Jan
Day Sky AirTemp Humidity Wind Water Forecast EnjoySport
1 Sunny Warm Normal Strong Warm Same Yes
2 Sunny Warm High Strong Warm Same Yes
3 Rainy Cold High Strong Warm Change No
4 Sunny Warm High Strong Cool Change Yes
2021, Jan 2020)

Department of CSE, Vemana IT Page 1 of 4

Artificial Intelligence and Machine Learning (18CS71) Question Bank

8 Explain the inductive biased hypothesis space, unbiased learner, and the futility of Bias CO2 L2
Free Learning. Describe the three types of learners. (Jan 2020, Jan 2019)
Describe in brief:
9 I) Version spaces CO2 L2
II) Candidate –Elimination Algorithm. (Jan 2019)
10 Describe Inductive Systems and Equivalent Deductive Systems. CO2 L2
(Jan 2020, sept 2020)
Rank the following three types of leaners according to their biases:
11 1. Rote Learner CO2 L2
2. Candidate Elimination Learner
3. Find S Learner. (Jan 2020)
12 Write the propositional Resolution Algorithm (Sept-2020) CO2 L2 1

1) Man (Marcus)
2) Pompeian (Marcus)
3) ∀x: Pompeian(x) → Roman(x)
4) Ruler (Caesar)
5) ∀x: Roman(x) → loyalto (x, Caesar) ∨ hate (x, Caesar)
13 6) ∀x: y loyalto (x, y) CO2 L5 1
7) : ∀t1: ∀y: Man(x) ∧ Ruler(y) ∧ tryassassinate (x, y) →loyalto (x, y)
8) Tryassassinate (Marcus, Caesar)
Consider the above set of well-defined formulas in predicate logic:
Convert these into clause form and prove that hate (Marcus, Caesar) using
resolution proof. (Sept-2020, July 2018)
14 Write the algorithm for conversion to clause form. (Jan 2019, Sept 2020) CO2 L2 1

15 Distinguish between forward and backward reasoning with example. CO2 L4 1

(Sept 2020, July 2018)
16 List and explain the issues in knowledge representation. (July 2019) CO2 L2

17 State and explain the algorithm to convert predicates to clausal form. (July 2019) CO2 L2

18 What is matching in rule-based system? Briefly explain the different proposals in CO2 L2

Department of CSE, Vemana IT Page 2 of 4

Artificial Intelligence and Machine Learning (18CS71) Question Bank

matching. (July 2019, July 2018)

Consider the following sentences: (July 2019)
Marcus was a man.
Marcus was a Pompeian.
All Pompeiians were Romans.
Caesar was a ruler.
19 All Romans were either loyal to Caesar or hated him. CO2 L5 1
Everyone is loyal to someone.
People only try to assassinate rulers they are not loyal to.
i. Translate all the sentences into formulas in predicate logic.
ii. Convert formulas from previous step into clause form.
iii. “Is Marcus alive?” by proving: ¬ alive(Marcus, now)
20 What are the properties of a good system for representation of knowledge? CO2 L2
Explain different approaches to knowledge representation. (July 2018)
21 List the issues in knowledge representation. (July 2018) CO2 L1

Consider the following sentences: (Jan 2020)

 John likes all kinds of food.
 Apples are food.
 Anything anyone eats and isn’t killed by is food.
22  Bill eats peanuts and is still alive. CO2 L5 1
 Sue eats everything Bill eats.
1) Translate all the sentences into formulas in predicate logic.
2) Convert formulas from previous step into clause form.
3) Prove that John likes peanuts using resolution.
23 Distinguish between forward and backward reasoning and list the factors that CO2 L4
influences the choices between them. (Jan 2020)
24 Define CNF. Give an algorithm to convert given prepositions to CNF. (Jan 2020) CO2 L1 1

25 Explain different approaches to knowledge representation and list the qualities a CO2 L2 1
good knowledge representation system should possess. (Jan 2020)
26 Explain different approaches to knowledge representation. (Jan 2019) CO2 L2 1

27 Write a note on control knowledge. (Jan 2019) CO2 L2

28 Write the algorithm to Unify (L1, L2) (Jan 2019) CO2 L2

29 Explain and illustrate the unification algorithm. (Feb 2021) CO2 L2

Explain proposition resolution algorithm
30 What are the properties of a good system for the representation of knowledge? CO2 L1
(Feb 2021)

Department of CSE, Vemana IT Page 3 of 4

Artificial Intelligence and Machine Learning (18CS71) Question Bank

31 Discuss how forward reasoning is different from backward reasoning. (Feb 2021) CO2 L5

32 With an illustration, explain the process of converting well formed formulas to CO2 L2
clause form. (Feb 2021)
Write a short note on: (Feb 2021)
33 i. Conflict resolution CO2 L2
ii. Logic programming

Course Faculty

Department of CSE, Vemana IT Page 4 of 4