| Course
Code |
CS-14 |
| Course
Title |
Intelligent
Systems |
| Assignment
Number |
MCA(6)-14(TMA)/2003 |
| Maximum
Marks |
10
|
| Last Date of
Submission
|
15th October,
2003 |
This is a Tutor Marked
Assignment. There are five questions in this assignment. Answer all the
questions. All questions carry equal marks. You may use illustrations and
diagrams to enhance explanations. Please go through the guidelines
regarding assignments.
| Question 1: |
Construct Truth-table for the following logical expression:
(( S ® T) Ù (~S Ú ~T)), where S and T are prepositional symbols and
'®'
'Ù'
'~' and 'Ú' are standard logical operators. |
| Question 2: |
Transform the following logical expression into Conjunctive
Normal Form: ~ (~ (S « T) Ù (R v S)) where R, S, and T are prepositional
symbols and '~' '«' 'Ù' and
'Ú'
are standard logical operators. |
| Question
3: |
Evaluate the
following LISP
expressions: (i) (cadadr '(p
(q r) s)) (ii) (member '(s) '(p q
r s)) (iii) (and (equal 'c (car '(c a
b))) (equal 'a (cadr '(c a
b)))) (iv) (putprop 'car 'red
'colour) |
| Question
4: |
Translate (no
validity check) the following argument given in English into
prepositional/predicate logic: (i) If capital
punishment is justified and justice doesn't demand a vindication for
past injustices, then either capital
punishment reforms the offender or else capital punishment
effectively deters crime. (ii)
Capital punishment doesn't reform the
offender. (iii) Capital punishment
doesn't effectively deter crime. there for Capital punishment
isn't justified. (Conclusion) |
| Question
5: |
Discuss briefly
the following issues about
Knowledge: (i) Knowledge
Representation (ii) Knowledge
Organization (iii) Knowledge
Manipulation (iv) Knowledge
Acquisition
| |