Artificial Intelligence Questions and Answers - Fuzzy Logic
Artificial Intelligence Questions and Answers - Fuzzy Logic
Artificial Intelligence Questions and Answers - Fuzzy Logic
This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses
on “Fuzzy Logic”.
11. Like relational databases there does exists fuzzy relational databases.
a) True
b) False
View Answer
Answer: a
Explanation: Once fuzzy relations are defined, it is possible to develop fuzzy relational
databases. The first fuzzy relational database, FRDB, appeared in Maria Zemankova
dissertation.
12. ______________ is/are the way/s to represent uncertainty.
a) Fuzzy Logic
b) Probability
c) Entropy
d) All of the mentioned
View Answer
Answer: d
Explanation: Entropy is amount of uncertainty involved in data. Represented by H(data).
13. ____________ are algorithms that learn from their more complex environments
(hence eco) to generalize, approximate and simplify solution logic.
a) Fuzzy Relational DB
b) Ecorithms
c) Fuzzy Set
d) None of the mentioned
View Answer
Answer: c
Explanation: Local structure is usually associated with linear rather than exponential growth in
complexity.
1. There exist only two types of quantifiers, Universal Quantification and Existential
Quantification.
a) True
b) False
View Answer
Answer: a
Explanation: None.
2. Translate the following statement into FOL.
“For every a, if a is a philosopher, then a is a scholar”
a) ∀ a philosopher(a) scholar(a)
b) ∃ a philosopher(a) scholar(a)
c) All of the mentioned
d) None of the mentioned
View Answer
Answer: a
Explanation: None.
3. A _________ is used to demonstrate, on a purely syntactic basis, that one formula is
a logical consequence of another formula.
a) Deductive Systems
b) Inductive Systems
c) Reasoning with Knowledge Based Systems
d) Search Based Systems
View Answer
Answer: a
Explanation: Refer the definition of Deductive based systems.
4. The statement comprising the limitations of FOL is/are
a) Expressiveness
b) Formalizing Natural Languages
c) Many-sorted Logic
d) All of the mentioned
View Answer
Answer: d
5. A common convention is:
• is evaluated first
• and are evaluated next
• Quantifiers are evaluated next
• is evaluated last.
a) True
b) False
View Answer
Answer: a
Explanation: None.
6. A Term is either an individual constant (a 0-ary function), or a variable, or an n-ary
function applied to n terms: F(t1 t2 ..tn).
a) True
b) False
View Answer
Answer: a
Explanation: Definition of term in FOL.
7. First Order Logic is also known as ___________
a) First Order Predicate Calculus
b) Quantification Theory
c) Lower Order Calculus
d) All of the mentioned
View Answer
Answer: d
Explanation: None.
advertisement
1. Which algorithm will work backward from the goal to solve a problem?
a) Forward chaining
b) Backward chaining
c) Hill-climb algorithm
d) None of the mentioned
View Answer
Answer: b
Explanation: Backward chaining algorithm will work backward from the goal and it will chain the
known facts that support the proof.
2. Which is mainly used for automated reasoning?
a) Backward chaining
b) Forward chaining
c) Logic programming
d) Parallel programming
View Answer
Answer: c
Explanation: Logic programming is mainly used to check the working process of the system.
3. What will backward chaining algorithm will return?
a) Additional statements
b) Substitutes matching the query
c) Logical statement
d) All of the mentioned
View Answer
Answer: b
Explanation: It will contains the list of goals containing a single element and returns the set of all
substitutions satisfying the query.
4. How can be the goal is thought of in backward chaining algorithm?
a) Queue
b) List
c) Vector
d) Stack
View Answer
Answer: d
Explanation: The goals can be thought of as stack and if all of them us satisfied means, then
current branch of proof succeeds.
5. What are used in backward chaining algorithm?
a) Conjuncts
b) Substitution
c) Composition of substitution
d) None of the mentioned
View Answer
Answer: c
Explanation: None
6. Which algorithm are in more similar to backward chaining algorithm?
a) Depth-first search algorithm
b) Breadth-first search algorithm
c) Hill-climbing search algorithm
d) All of the mentioned
View Answer
Answer: a
Explanation: It is depth-first search algorithm because its space requirements are linear in the
size of the proof.
7. Which problem can frequently occur in backward chaining algorithm?
a) Repeated states
b) Incompleteness
c) Complexity
d) Both Repeated states & Incompleteness
View Answer
Answer: d
Explanation: If there is any loop in the chain means, It will lead to incompleteness and repeated
states.
8. How the logic programming can be constructed?
a) Variables
b) Expressing knowledge in a formal language
c) Graph
d) All of the mentioned
View Answer
Answer: b
Explanation: Logic programming can be constructed by expressing knowledge in a formal
expression and the problem can be solved by running inference process.
9. What form of negation does the prolog allows?
a) Negation as failure
b) Proposition
c) Substitution
d) Negation as success
View Answer
Answer: a
Explanation: None
10. Which is omitted in prolog unification algorithm?
a) Variable check
b) Occur check
c) Proposition check
d) Both Occur & Proposition check
View Answer
Answer: b
Explanation: Occur check is omitted in prolog unification algorithm because of unsound
inferences.
1. Frames is
a) A way of representing knowledge
b) Data Structure
c) Data Type
d) None of the mentioned
View Answer
Answer: a
Explanation: None.
2. Frames in artificial intelligence is derived from semantic nets.
a) True
b) False
View Answer
Answer: a
Explanation: A frame is an artificial intelligence data structure used to divide knowledge into
substructures by representing “stereotyped situations.”.
3. Following are the elements, which constitutes to the frame structure.
a) Facts or Data
b) Procedures and default values
c) Frame names
d) Frame reference in hierarchy
View Answer
Answer: a
Explanation: None.
4. Like semantic networks, frames can be queried using spreading activation.
a) True
b) False
View Answer
Answer: a
Explanation: None.
5. Hyponymy relation means,
a) A is part of B
b) B has A as a part of itself
c) A is subordinate of B
d) A is superordinate of B
View Answer
Answer: c
Explanation: In linguistics, a hyponym is a word or phrase whose semantic field is included within
that of another word, its hypernym (sometimes spelled hypernym outside of the natural language
processing community). In simpler terms, a hyponym shares a type-of relationship with its
hypernym..
6. The basic inference mechanism in semantic network in which knowledge is
represented as Frames is to follow the links between the nodes.
a) True
b) False
View Answer
Answer: a
Explanation: None.
7. There exists two way to infer using semantic networks in which knowledge is
represented as Frames.
1) Intersection Search
2) Inheritance Search
a) True
b) False
View Answer
Answer: a
Explanation: None.
1. A 3-input neuron is trained to output a zero when the input is 110 and a one when the
input is 111. After generalization, the output will be zero when and only when the input
is:
a) 000 or 110 or 011 or 101
b) 010 or 100 or 110 or 101
c) 000 or 010 or 110 or 100
d) 100 or 111 or 101 or 001
View Answer
Answer: c
Explanation: The truth table before generalization is:.
2. A perceptron is:
a) a single layer feed-forward neural network with pre-processing
b) an auto-associative neural network
c) a double layer auto-associative neural network
d) a neural network that contains feedback
View Answer
Answer: a
Explanation: The perceptron is a single layer feed-forward neural network. It is not an auto-
associative network because it has no feedback and is not a multiple layer neural network
because the pre-processing stage is not made of neurons.
3. An auto-associative network is:
a) a neural network that contains no loops
b) a neural network that contains feedback
c) a neural network that has only one loop
d) a single layer feed-forward neural network with pre-processing
View Answer
Answer: b
Explanation: An auto-associative network is equivalent to a neural network that contains
feedback. The number of feedback paths(loops) does not have to be one.
4. A 4-input neuron has weights 1, 2, 3 and 4. The transfer function is linear with the
constant of proportionality being equal to 2. The inputs are 4, 10, 5 and 20 respectively.
The output will be:
a) 238
b) 76
c) 119
d) 123
View Answer
Answer: a
Explanation: The output is found by multiplying the weights with their respective inputs, summing
the results and multiplying with the transfer function. Therefore:
Output = 2 * (1*4 + 2*10 + 3*5 + 4*20) = 238.
5. Which of the following is true?
(i) On average, neural networks have higher computational rates than conventional
computers.
(ii) Neural networks learn by example.
(iii) Neural networks mimic the way the human brain works.
a) All of the mentioned are true
b) (ii) and (iii) are true
c) (i), (ii) and (iii) are true
d) None of the mentioned
View Answer
Answer: a
Explanation: Neural networks have higher computational rates than conventional computers
because a lot of the operation is done in parallel. That is not the case when the neural network is
simulated on a computer. The idea behind neural nets is based on the way the human brain
works. Neural nets cannot be programmed, they can only learn by examples.
6. Which of the following is true for neural networks?
(i) The training time depends on the size of the network.
(ii) Neural networks can be simulated on a conventional computer.
(iii) Artificial neurons are identical in operation to biological ones.
a) All of the mentioned
b) (ii) is true
c) (i) and (ii) are true
d) None of the mentioned
View Answer
Answer: c
Explanation: The training time depends on the size of the network; the number of neuron is
greater and therefore the number of possible ‘states’ is increased. Neural networks can be
simulated on a conventional computer but the main advantage of neural networks – parallel
execution – is lost. Artificial neurons are not identical in operation to the biological ones.
7. What are the advantages of neural networks over conventional computers?
(i) They have the ability to learn by example
(ii) They are more fault tolerant
(iii)They are more suited for real time operation due to their high ‘computational’ rates
a) (i) and (ii) are true
b) (i) and (iii) are true
c) Only (i)
d) All of the mentioned
View Answer
Answer: d
8. Having multiple perceptrons can actually solve the XOR problem satisfactorily: this is
because each perceptron can partition off a linear part of the space itself, and they can
then combine their results
a) True – this works always, and these multiple perceptrons learn to classify even
complex problems
b) False – perceptrons are mathematically incapable of solving linearly inseparable
functions, no matter what you do
c) True – perceptrons can do this but are unable to learn to do it – they have to be
explicitly hand-coded
d) False – just having a single perceptron is enough
View Answer
Answer: c
Explanation: None.
9. The network that involves backward links from output to the input and hidden layers is
called as ____
a) Self organizing maps
b) Perceptrons
c) Recurrent neural network
d) Multi layered perceptron
View Answer
Answer: c
Explanation: RNN (Recurrent neural network) topology involves backward links from output to
the input and hidden layers.
10. Which of the following is an application of NN (Neural Network)?
a) Sales forecasting
b) Data validation
c) Risk management
d) All of the mentioned
View Answer
Answer: d
Explanation: All mentioned options are applications of Neural Network.
1. Given a stream of text, Named Entity Recognition determines which pronoun maps to
which noun.
a) False
b) True
View Answer
Answer: a
Explanation: Given a stream of text, Named Entity Recognition determines which items in the
text maps to proper names.
2. Natural Language generation is the main task of Natural language processing.
a) True
b) False
View Answer
Answer: a
Explanation: Natural Language Generation is to Convert information from computer databases
into readable human language.
3. OCR (Optical Character Recognition) uses NLP.
a) True
b) False
View Answer
Answer: a
Explanation: Given an image representing printed text, determines the corresponding text.
4. Parts-of-Speech tagging determines
a) part-of-speech for each word dynamically as per meaning of the sentence
b) part-of-speech for each word dynamically as per sentence structure
c) all part-of-speech for a specific word given as input
d) all of the mentioned
View Answer
Answer: d
Explanation: A Bayesian network provides a complete description of the domain.
5. Parsing determines Parse Trees (Grammatical Analysis) for a given sentence.
a) True
b) False
View Answer
Answer: a
Explanation: Determine the parse tree (grammatical analysis) of a given sentence. The grammar
for natural languages is ambiguous and typical sentences have multiple possible analyses. In
fact, perhaps surprisingly, for a typical sentence there may be thousands of potential parses
(most of which will seem completely nonsensical to a human).
6. IR (information Retrieval) and IE (Information Extraction) are the two same thing.
a) True
b) False
View Answer
Answer: b
7. Many words have more than one meaning; we have to select the meaning which
makes the most sense in context. This can be resolved by
a) Fuzzy Logic
b) Word Sense Disambiguation
c) Shallow Semantic Analysis
d) All of the mentioned
View Answer
Answer: b
Explanation: Shallow Semantic Analysis doesn’t cover word sense disambiguation.