Scribd
Upload
29 views4 pages

Mcse 3

(1) The document is a 4 page exam for an Artificial Intelligence and Knowledge Management course. It contains one compulsory question (a-h) and 4 other questions, asking students to write on topics like the Chinese Room test, knowledge representation schemes, expert system components, resolution principle, and more. (2) Question 1 requires students to write about the Chinese Room test, obtaining prenex normal form, translating statements to predicate logic, writing a LISP recursive function, semantic networks, expert system shells, fuzzy sets vs crisp sets, and agent properties. (3) The other questions ask about De Morgan's laws, breadth-first search, Prolog's cut and fail predicates, knowledge representation

Uploaded by

Harshit Sharma
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
29 views4 pages

Mcse 3

(1) The document is a 4 page exam for an Artificial Intelligence and Knowledge Management course. It contains one compulsory question (a-h) and 4 other questions, asking students to write on topics like the Chinese Room test, knowledge representation schemes, expert system components, resolution principle, and more. (2) Question 1 requires students to write about the Chinese Room test, obtaining prenex normal form, translating statements to predicate logic, writing a LISP recursive function, semantic networks, expert system shells, fuzzy sets vs crisp sets, and agent properties. (3) The other questions ask about De Morgan's laws, breadth-first search, Prolog's cut and fail predicates, knowledge representation

Uploaded by

Harshit Sharma
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

No.

of Printed Pages : 4 MCSE-003

MCA (Revised)
Term-End Examination
February, 2021

MCSE-003 : ARTIFICIAL INTELLIGENCE AND


KNOWLEDGE MANAGEMENT

Time : 3 hours Maximum Marks : 100

Note : Question number 1 is compulsory. Attempt any


three questions from the rest.

1. (a) Write Chinese room test. Which limitations of


Turing test are addressed by Chinese room
test ? 5
(b) Write steps to obtain the Prenex Normal
form of the following formula : 5
x y x (( P(x, y)  Q(x, z))  R(x, y, z))

(c) Translate the following statements to First


Order Predicate Logic (FOPL). 5
(i) Every one who saves money earns
interest.
(ii) If there is no interest then nobody
saves money.
(d) Write recursive function in LISP that finds
the factorial of a natural number (n). 5
MCSE-003 1 P.T.O.
(e) What is a Semantic network ? Draw
Semantic network for the representation of
the following sentence. 5
‘‘Tom struck Jerry in the garden with a
sharp knife last month.’’
(f) What is an Expert System ? Briefly explain
the shells of Expert System. 5
(g) What are Fuzzy sets ? How do Fuzzy sets
differ from Crisp sets ? What is the
relevance of Fuzzy logic in Artificial
Intelligence ? 5
(h) What are Agents in Artificial Intelligence ?
Briefly discuss the properties of Agents. 5

2. (a) Write De Morgan’s law for both predicate


and propositional logic. Justify the
statement ‘‘De Morgan’s laws of predicate
logic are generalized form of the laws for
propositional logic.’’ 5
(b) Write Breadth First Search (BFS)
algorithm. Use BFS to search the Goal
node G and L in the following tree. 10

MCSE-003 2
(c) Write the importance of CUT and FAIL
predicates in PROLOG. Give suitable
example for each. 5

3. (a) How are programming languages used to


design expert systems different from general
purpose programming languages ? Briefly
discuss the components which make the
difference. Give two examples of each
language type. 7
(b) What do you understand by ‘‘Knowledge
Representation’’ in Artificial Intelligence ?
Briefly discuss any two knowledge
representation schemes. Also mention, how
representation schemes have an edge over
others. 8
(c) What is the principle of resolution ? What is
the resolution of ( P  Q) and ( Q  R) ? 5

4. (a) How do we transform a conceptual graph


into FOPL (First Order Predicate Logic) ?
Can we transform FOPL into conceptual
graph ? If yes, give the procedure to do so. 7
(b) Write A* algorithm. How is A* algorithm
different from AO* ? Out of the two
algorithms, which one is better and why ? 8
(c) Write Modus Tollens and Modus Ponens
Prove Modus Tollens using Modus Ponens. 5

MCSE-003 3 P.T.O.
5. Write short notes on any five of the following : 54=20
(i) Inference Engine
(ii) Associative Networks
(iii) Frames
(iv) Scripts
(v) Mean-End Analysis
(vi) Depth First Search (DFS)

MCSE-003 4

You might also like