Description : Like semantic networks, frames can be queried using spreading activation. a) True b) False
Last Answer : a) True
Description : 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
Description : Frames in artificial intelligence is derived from semantic nets. a) True b) False
Description : Most semantic networks are not cognitive based. a) True b) False
Last Answer : b) False
Description : Semantic Network is also known as Frame networks. a) True b) False
Description : What are Semantic Networks? a) A way of representing knowledge b) Data Structure c) Data Type d) None of the mentioned
Last Answer : a) A way of representing knowledge
Description : Slots and facets are used in (A) Semantic Networks (B) Frames (C) Rules (D) All of these
Last Answer : (B) Frames
Description : What are the limitations of the semantic networks? a) Intractability b) Lack in expressing some of the properties c) Incomplete d) Has memory constraints
Last Answer : b) Lack in expressing some of the properties
Description : Which of the following is an extension of the semantic network? a) Expert Systems b) Rule Based Expert Systems c) Decision Tree Based networks d) Partitioned Networks
Last Answer : d) Partitioned Networks
Description : Which of the following are the Semantic Relations used in Semantic Networks? a) Meronymy b) Holonymy c) Hyponymy d) All of the mentioned
Last Answer : d) All of the mentioned
Description : Inheritance Search a) True b) False
Description : A knowledge-based agent can combine general knowledge with current percepts to infer hidden aspects of the current state prior to selecting actions. a) True b) False
Description : A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False
Description : A semantic network is used when one has knowledge that is best understood as a set of concepts that are related to one another. a) True b) False
Description : Why is the XOR problem exceptionally interesting to neural network researchers? a) Because it can be expressed in a way that allows you to use a neural network b) Because it is complex ... solved by a single layer perceptron d) Because it is the simplest linearly inseparable problem that exists.
Last Answer : d) Because it is the simplest linearly inseparable problem that exists.
Description : This set of Artificial Intelligence MCQs focuses on Neural Networks - 2 . 1. Why is the XOR problem exceptionally interesting to neural network researchers? a) Because it can be expressed in ... by a single layer perceptron d) Because it is the simplest linearly inseparable problem that exists.
Description : The rule of Universal Instantiation (UI for short) says that we can infer any sentence obtained by substituting a ground term (a term without variables) for the variable. a) True b) False
Description : The basic inference mechanism in semantic network is to follow the links between the nodes. a) True b) False
Description : Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search
Last Answer : b) The entire tree so far been generated must be stored in BFS
Description : Like relational databases there does exists fuzzy relational databases. a) True b) False
Description : Neurons or artificial neurons have the capability to model networks of original neurons as found in brain A. True B. False
Last Answer : A. True
Description : Which of the following is a knowledge representation technique used to represent knowledge about stereotype situation? (A) Semantic network (B) Frames (C) Scripts (D) Conceptual Dependency
Last Answer : (C) Scripts
Description : The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling ... c) Map coloring problem d) Depth first search traversal on a given map represented as a graph
Last Answer : b) Travelling Salesman problem
Description : What is Transposition rule? a) From P → Q, infer ~Q → P b) From P → Q, infer Q → ~P c) From P → Q, infer Q → P d) From P → Q, infer ~Q → ~P
Last Answer : d) From P → Q, infer ~Q → ~P
Description : The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node. a) True b) False
Description : The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is ... also possible to go all the way to set of variable that caused failure. a) True b) False
Description : 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
Last Answer : b) Word Sense Disambiguation
Description : Semantic grammars are _____________ a) Encode semantic information into a syntactic grammar b) Decode semantic information into a syntactic grammar c) Encode syntactic information into a semantic grammar d) Decode syntactic information into a semantic grammar
Last Answer : a) Encode semantic information into a syntactic grammar
Description : The “Turing Machine” showed that you could use a/an _____ system to program any algorithmic task. a) binary b) electro-chemical c) recursive d) semantic
Last Answer : a) binary
Description : Where does the dependance of experience is reflected in prior probability sentences? a) Syntactic distinction b) Semantic distinction c) Both Syntactic & Semantic distinction d) None of the mentioned
Last Answer : a) Syntactic distinction
Description : What kind of interpretation is done by adding context-dependant information? a) Semantic b) Syntactic c) Pragmatic d) None of the mentioned
Last Answer : c) Pragmatic
Description : What can’t be done in the semantic interpretation? a) Logical term b) Complete logical sentence c) Both Logical term & Complete logical sentence d) None of the mentioned
Last Answer : c) Both Logical term & Complete logical sentence
Description : What is the process of associating a FOL expression with a phrase? a) Interpretation b) Augmented reality c) Semantic interpretation d) Augmented interpretation
Last Answer : c) Semantic interpretation
Description : What is the extraction of the meaning of utterance? a) Syntactic b) Semantic c) Pragmatic d) None of the mentioned
Last Answer : b) Semantic
Description : Graph used to represent semantic network is _____________ a) Undirected graph b) Directed graph c) Directed Acyclic graph (DAG) d) Directed complete graph
Last Answer : b) Directed graph
Description : Define Semantic Interpretation.
Last Answer : The process of extracting the meaning of an utterance an expression in some representation language.
Description : Which of the following statement 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 ... it can be described by a regular grammar d) The intersection two context-free languages is context-free
Last Answer : d) The intersection two context-free languages is context-free
Description : Which of the following statement 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 ... a regular language is always context-free e) The intersection two context-free languages is context-free
Last Answer : e) The intersection two context-free languages is context-free
Description : A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state. a) True b) False
Description : The name best-first search is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the ... is choose the node that appears to be best according to the evaluation function. a) True b) False
Description : Uninformed search strategies are better than informed search strategies. a) True b) False
Description : Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. a) True b) False
Description : The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the ... . This process of looking for such a sequence is called Search. a) True b) False
Description : 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. ... ) are true c) (i), (ii) and (iii) are true d) None of the mentioned
Last Answer : a) All of the mentioned are true
Description : 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 ... ) are true c) (i), (ii) and (iii) are true d) None of the mentioned
Description : Internal validity refers to which of the following? a. The ability to infer that a casual relationship exists between 2 variables b. The extent to which study results can be generalized to and ... the study d. The ability to generalize the study results to individuals not included in the study
Last Answer : b. The extent to which study results can be generalized to and across populations of persons, settings, and times
Description : Which of the following is true? Single layer associative neural networks do not have the ability to: (i) perform pattern recognition (ii) find the parity of a picture (iii)determine whether two or more shapes in ... ) are true b) (ii) is true c) All of the mentioned d) None of the mentioned
Last Answer : a) (ii) and (iii) are true
Description : Which of the following is true? Single layer associative neural networks do not have the ability to: (i) perform pattern recognition (ii) find the parity of a picture (iii)determine whether two or more shapes in a ... ) are true b) (ii) is true c) All of the mentioned d) None of the mentioned
Description : Which is true for neural networks? a) It has set of nodes and connections b) Each node computes it’s weighted input c) Node could be in excited state or non-excited state d) All of the mentioned