Exam Details
Subject | artifical intelligence | |
Paper | ||
Exam / Course | m.sc. computer science | |
Department | ||
Organization | solapur university | |
Position | ||
Exam Date | November, 2016 | |
City, State | maharashtra, solapur |
Question Paper
Master of Science II (Computer Science)
Examination: Oct/Nov 2016 Semester III (Old CGPA)
SLR No. Day
Date Time Subject Name Paper
No. Seat No.
SLR SC
317
Friday
18/11/2016
02:30 PM
to
05.00 PM
Artificial Intelligence
C
X
Instructions: Question no. 1 2 are compulsory
Attempt any three questions from Q. No. 3 to Q. No. 7
Figures to the right indicate full marks.
Total Marks: 70
Q.1 Choose the correct alternatives 10
The give suggestions to a chip designer, who can accept or reject
the advice.
Prospector Mycin
Knowledge Engineer Design advisor
Spot an Identical Entities as a part of Discourse and Pragmatic processing
form a text
Suresh opened the book for reading. The title page was torn.
Mohsin have a blue pen. Manish wanted it.
There was a heavy rainfall yesterday. The colleges were closed today.
Heena wanted a new bike. She decided to get a job.
The is a theory that considers sets of proposition and assigns to
each of them an interval in which the degree of belief must lie.
Theory of Artificial Intelligence
Newell, Shaw and Simon Theory
Dempster Shafer Theory
Bayes' Theorem
A that specifies the order in which the rules will be compared
to the database and a way of resolving the conflicts that arise when several
rules match at once.
Many- Many Match strategy Goal state O
Control Strategy Predicate Logic
The principle provides a way of finding contradictions by trying
a minimum number of substitutions.
Resolution Propositional logic
Computable functions Fuzzy Logic
A technique known as allows us to use a mixed strategy that
would make possible to solve the major parts of a problem first and then go
back and solve the small problems that arise in gluing the big pieces together
Property Inheritance Certainty factor
Means Ends Analysis Formal Task
Page 1 of 3
A direction in which to conduct the search can be a search through
the state space from the start state to a goal state.
Bidirectional Backward
Round and Reserve Forward
A allows us to represent set of membership as possibility
distribution.
Set Theory MiniMax Search Procedure
Fuzzy Set Theory Conceptual Dependency
system out of collections of are connected to
each other by virtue of the fact that the value of a attribute of one
may be another
Semantic network Frame
Conceptual Dependency None of these
10) An algorithm called combines the best aspects of depth first
and breadth-first search
First-Order Iterative Deepening (FOID)
Control-first Iterative Deepening (CFID)
Depth-First Iterative Deepening (DFID)
Second-Order Iterative Deepening (SOID)
State True or False 04
Top-Down parsing begins with the sentence to be parsed and apply the
grammar rules backward until a single tree whose terminals are the words of
the sentence and whose top is the start symbol.
An ATRANS as set of primitive actions stands for movement of body parts
by its owner.
The inferential adequacy is the ability to manipulate the representational
structures in such a way as to drive new structures corresponding to new
knowledge inferred from old.
A plateau is a state that is better than all its neighbors but is not better than
some other states farther away.
Q.2 Write a short note: 08
Bayes' Theorem
AI Technique
Answer the following: 06
State in brief an algorithm of Generate-and-Test
What are the Formal Task domains of Artificial Intelligence?
Q.3 Answer the following:
Enlist the various Problem Characteristics. Explain in detail the Production
System and its component.
Define the term Constraint Satisfaction. Discuss the Crypt arithmetic problem
as part of Constraints Satisfaction with suitable example.
07
07
Page 2 of 3
Q.4 Answer the followings
What are the Expert tasks? Discuss in detail process of knowledge acquisition
to design and develop the Expert Systems.
What do you mean by Certainty Factor? Discuss Certainty factor and rule based
system with suitable example.
07
07
Q.5 Answer the followings:
What do you mean by Predicate Logic? Explain in detail use of Computable
Functions and Predicates for information deduction with suitable example.
Define the term Game playing. Explain in detail MiniMax Search Procedure
with suitable example.
07
07
Q.6 Answer the following:
What do you mean by Reasoning? State and Explain in detail four factor
influence to decide a better way of Reasoning.
Discuss in detail Conceptual and Script as a strong slot and Filler Structures.
07
07
Q.7 Answer the following:
What do you mean by Natural Language Understanding? State and explain in
detail various steps of Natural Language processing.
What do you mean by Artificial Intelligence? Illustrate the solutions for
Water-Jug Problem with suitable example.
Examination: Oct/Nov 2016 Semester III (Old CGPA)
SLR No. Day
Date Time Subject Name Paper
No. Seat No.
SLR SC
317
Friday
18/11/2016
02:30 PM
to
05.00 PM
Artificial Intelligence
C
X
Instructions: Question no. 1 2 are compulsory
Attempt any three questions from Q. No. 3 to Q. No. 7
Figures to the right indicate full marks.
Total Marks: 70
Q.1 Choose the correct alternatives 10
The give suggestions to a chip designer, who can accept or reject
the advice.
Prospector Mycin
Knowledge Engineer Design advisor
Spot an Identical Entities as a part of Discourse and Pragmatic processing
form a text
Suresh opened the book for reading. The title page was torn.
Mohsin have a blue pen. Manish wanted it.
There was a heavy rainfall yesterday. The colleges were closed today.
Heena wanted a new bike. She decided to get a job.
The is a theory that considers sets of proposition and assigns to
each of them an interval in which the degree of belief must lie.
Theory of Artificial Intelligence
Newell, Shaw and Simon Theory
Dempster Shafer Theory
Bayes' Theorem
A that specifies the order in which the rules will be compared
to the database and a way of resolving the conflicts that arise when several
rules match at once.
Many- Many Match strategy Goal state O
Control Strategy Predicate Logic
The principle provides a way of finding contradictions by trying
a minimum number of substitutions.
Resolution Propositional logic
Computable functions Fuzzy Logic
A technique known as allows us to use a mixed strategy that
would make possible to solve the major parts of a problem first and then go
back and solve the small problems that arise in gluing the big pieces together
Property Inheritance Certainty factor
Means Ends Analysis Formal Task
Page 1 of 3
A direction in which to conduct the search can be a search through
the state space from the start state to a goal state.
Bidirectional Backward
Round and Reserve Forward
A allows us to represent set of membership as possibility
distribution.
Set Theory MiniMax Search Procedure
Fuzzy Set Theory Conceptual Dependency
system out of collections of are connected to
each other by virtue of the fact that the value of a attribute of one
may be another
Semantic network Frame
Conceptual Dependency None of these
10) An algorithm called combines the best aspects of depth first
and breadth-first search
First-Order Iterative Deepening (FOID)
Control-first Iterative Deepening (CFID)
Depth-First Iterative Deepening (DFID)
Second-Order Iterative Deepening (SOID)
State True or False 04
Top-Down parsing begins with the sentence to be parsed and apply the
grammar rules backward until a single tree whose terminals are the words of
the sentence and whose top is the start symbol.
An ATRANS as set of primitive actions stands for movement of body parts
by its owner.
The inferential adequacy is the ability to manipulate the representational
structures in such a way as to drive new structures corresponding to new
knowledge inferred from old.
A plateau is a state that is better than all its neighbors but is not better than
some other states farther away.
Q.2 Write a short note: 08
Bayes' Theorem
AI Technique
Answer the following: 06
State in brief an algorithm of Generate-and-Test
What are the Formal Task domains of Artificial Intelligence?
Q.3 Answer the following:
Enlist the various Problem Characteristics. Explain in detail the Production
System and its component.
Define the term Constraint Satisfaction. Discuss the Crypt arithmetic problem
as part of Constraints Satisfaction with suitable example.
07
07
Page 2 of 3
Q.4 Answer the followings
What are the Expert tasks? Discuss in detail process of knowledge acquisition
to design and develop the Expert Systems.
What do you mean by Certainty Factor? Discuss Certainty factor and rule based
system with suitable example.
07
07
Q.5 Answer the followings:
What do you mean by Predicate Logic? Explain in detail use of Computable
Functions and Predicates for information deduction with suitable example.
Define the term Game playing. Explain in detail MiniMax Search Procedure
with suitable example.
07
07
Q.6 Answer the following:
What do you mean by Reasoning? State and Explain in detail four factor
influence to decide a better way of Reasoning.
Discuss in detail Conceptual and Script as a strong slot and Filler Structures.
07
07
Q.7 Answer the following:
What do you mean by Natural Language Understanding? State and explain in
detail various steps of Natural Language processing.
What do you mean by Artificial Intelligence? Illustrate the solutions for
Water-Jug Problem with suitable example.
Other Question Papers
Subjects
- .net technology
- artifical intelligence
- computer communication network
- data mining and warehouse
- data structures
- dbms
- digital image processing
- distributed operating system
- finite automata
- internet of things
- java programming
- linux operating system (oet)
- mobile computing
- network security
- numerical analysis
- object oriented programming using c++
- office automation (oet)
- operating system
- operations research
- soft computing
- software engineering
- software testing
- uml