IndiaStudyCenter.com
Colleges & Universities | Distance Education | Admission Notifications | Entrance Exams | Course Syllabus | Question Papers
Home / Test Papers / IGNOU / CS14 Intelligent Systems
CS14 Intelligent Systems December 2006
Ask a question
Print this page
IGNOU CS-14

CS-14 Test Papers

IGNOU MCA

About IGNOU MCA Course

IGNOU MCA Syllabus

IGNOU MCA Assignments

IGNOU MCA Test Papers

IGNOU Programs

IGNOU

Courses, Admissions & Eligibility

Admission to BA International Hospitality Administration - 2008-09 Session

Admission Procedure & Schedule

Colleges, Faculties & Departments

Who's Who at the University

Re-Admission Procedure

Study Centres in India

Partner Institutions outside India

Syllabus

IGNOU Test Papers (by Course)

IGNOU Test Papers (by Paper code)

Assignments

IGNOU Exam Timetables

Notifications, Circulars & Announcements 2008

Events, Seminars & Workshops

Examination Results

IGNOU Improvement tests

Test Papers / Previous Question Papers of IGNOU CS14 Intelligent Systems December 2006

MCA (III Yr)
Term-End Examination

CS14 (S): Intelligent Systems

Time: 3 hours
Maximum Marks: 75

Note : Question No. 1 is compulsory. Answer any three questions from the rest.

December, 2006

l. (a) How does knowledge-basecdo mputing differ from numeric computation ? Explain with examples. (3)

(b) Differentiate between the following : (2 x1/2=5)

(i) Data and Information

(ii) Hypothesis and Knowledge

(iii) Use rhe truth table-method to prove that A^(A =>B ) =>B is a tautology.(5)

(d) Write short notes on the following three LISP functions : mapcar, eval, and lambda

(6)

(e) How is knowledge stored using Semantic Network ? What are the main limitations of this scheme ? (5)

(f) What are the characteristics of a distance metric ? Illustrate with example how contingency table can be used to measure distance binary variables. (3+3=6)

2. (i) Design a scheme for representing Binary Trees in Prolog. (3)

(ii) Write a Prolog code that uses the above representationa nd retrieve.tsh e largest elements tored in tree. You may assume that the information contained in the tree is purely numeric.

(iii)Write Prolog predicate that takes a list LIST1 and partitions it on a key X into two lists less than X and PARTITION (X, UST1, LESS THAN X, GREATER THAN X) where LESS THAN X contain elements less than the key X and GREATER THAN X contain elements greater than the key X.(6)

3. (i) Explain with examples the six components that are required for defining the syntax of first order Predicate Logic.(4)

(ii) What is a Skolem function ? Give the steps needed to convert an FOPL statement into clauses form.(5)

(iii) Use Associative Network to represent the following : (6)

(a) Nine is a number.

(b) All numbers are rational.

(c) A rational has two attributes : oulrlerator and denominator.

(d) All rationals are reals.

(e) Reals have functions : addition, subtraction, multiplication and division.

4. (i) What do you mean by the term "heuristics" ?(2)

(ii) What are the heuristics used in

(a) Search using Hill-climbing

(b) Best-firsst earch (7)

(iii) What is the difference between "deductive" and 'non-deductive" reasoning ? Explain two different types of non-deductive reasoning schemes. (6)

5. (i) Represent the following sentences in Conceptual Dependency structure :(6)

(a) Sachin is a cricketer.

(b) Sourav hit the ball well.

(c) Rahul gave Viru an advice.

(ii) Write a short note on "property list" as a knowledge structure.(3)

(iii) Write an algorithm that takes as input two strings, and determines whether they have any common substring of length ten. What is the complexity of the algorithm.(6)

Most popular pages

Business Schools - Engineering Colleges - Medical & Nursing Admissions - BEd in Distance mode - Journalism & Media Studies - Forensic Science

Search this site

Enter a detailed keyword. Ex: Question Papers of IGNOU MCA Ist Semester