1. Which is not a desirable property of a logical rule-based system?

(a) Locality
(b) Attachment
(c) Detachment
(d) Truth-Functionality
(e) Global attribute.

2. How is Fuzzy Logic different from conventional control methods?

(a) IF and THEN Approach
(b) FOR Approach
(c) WHILE Approach 
(d) DO Approach
(e) Else If approach.

3. In an Unsupervised learning

(a) Specific output values are given
(b) Specific output values are not given
(c) No specific Inputs are given
(d) Both inputs and outputs are given
(e) Neither inputs nor outputs are given.

4. Inductive learning involves finding a

(a) Consistent Hypothesis (b) Inconsistent Hypothesis
(c) Regular Hypothesis (d) Irregular Hypothesis
(e) Estimated Hypothesis.

5. Computational learning theory analyzes the sample complexity and computational complexity of

(a) UnSupervised Learning
(b) Inductive learning
(c) Forced based learning
(d) Weak learning
(e) Knowledge based learning.

6. If a hypothesis says it should be positive, but in fact it is negative, we call it

(a) A consistent hypothesis
(b) A false negative hypothesis
(c) A false positive hypothesis
(d) A specialized hypothesis
(e) A true positive hypothesis.

7. Neural Networks are complex -----------------------with many parameters.

(a) Linear Functions
(b) Nonlinear Functions
(c) Discrete Functions
(d) Exponential Functions
(e) Power Functions.

8. A perceptron is a --------------------------------.

(a) Feed-forward neural network
(b) Back-propagation alogorithm
(c) Back-tracking algorithm
(d) Feed Forward-backward algorithm
(e) Optimal algorithm with Dynamic programming.

9. Which is true?

(a) Not all formal languages are context-free
(b) All formal languages are Context free
(c) All formal languages are like natural language
(d) Natural languages are context-oriented free
(e) Natural language is formal.

10. Which is not true?

(a) The union and concatenation of two context-free languages is context-free
(b) The reverse of a context-free language is context-free, but the complement need not be
(c) Every regular language is context-free because it can be described by a regular grammar
(d) The intersection of a context-free language and a regular language is always context-free
(e) The intersection two context-free languages is context-free.