Description : 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
Last Answer : 1) Intersection Search
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
Last Answer : a) True
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 : 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 : 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 : 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 : Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. a) True b) False
Last Answer : 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 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 : Speech Segmentation is a subtask of Speech Recognition. a) True b) False
Description : IR (information Retrieval) and IE (Information Extraction) are the two same thing. a) True b) False
Description : OCR (Optical Character Recognition) uses NLP. a) True b) False
Description : Natural Language generation is the main task of Natural language processing. a) True b) False
Description : Given a stream of text, Named Entity Recognition determines which pronoun maps to which noun. a) False b) True
Last Answer : a) False
Description : The more general task of coreference resolution also includes identifying so-called “bridging relationships” involving referring expressions. a) True b) False
Description : Modern NLP algorithms are based on machine learning, especially statistical machine learning. a) True b) False
Description : NLP is concerned with the interactions between computers and human (natural) languages. a) True b) False
Description : Decision Trees can be used for Classification Tasks. a) True b) False
Description : Decision Tree is a display of an algorithm. a) True b) False
Description : A perceptron adds up all the weighted inputs it receives, and if it exceeds a certain value, it outputs a 1, otherwise it just outputs a 0. a) True b) False c) Sometimes – it can also output intermediate values as well d) Can’t say
Description : Like relational databases there does exists fuzzy relational databases. a) True b) False
Description : Japanese were the first to utilize fuzzy logic practically on high-speed trains in Sendai. a) True b) False
Description : Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. a) True b) False
Description : Traditional set theory is also known as Crisp Set theory. a) True b) False
Description : The primitives in probabilistic reasoning are random variables. a) True b) False
Description : Using logic to represent and reason we can represent knowledge about the world with facts and rules. a) True b) False
Description : A re-planning agent uses execution monitoring and splices in repairs as needed. a) True b) False
Description : Conditional Plans allows the agent to sense the world during execution to decide what branch of plan to follow. a) True b) False
Description : Planning problem can be described as a propositional logic. a) True b) False
Description : Planning graphs works only for prepositional planning problems. a) True b) False
Description : What is meant by persistence actions? a) Allow a literal to remain false b) Allow a literal to remain true c) Allow a literal to remain false & true d) None of the mentioned
Last Answer : b) Allow a literal to remain true
Description : One the main drawback of this type of planning system is that it requires a lot of computational powers at each node. a) True b) False
Description : Sussman Anomaly illustrates a weakness of interleaved planning algorithm. a) True b) False
Description : Sussman Anomaly can be easily and efficiently solved by partial order planning. a) True b) False
Description : Partial-order planning is the opposite of total-order planning. a) True b) False
Description : Partial-order planning exhibits the Principle of Least Commitment, which contributes to the efficiency of this planning system as a whole. a) True b) False
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 : Like semantic networks, frames can be queried using spreading activation. 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
Description : Semantic Network is also known as Frame networks. 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 : Basic idea of an partitioned nets is to break network into spaces which consist of groups of nodes and arcs and regard each space as a node. 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 : ARGEX is an agricultural expert system that gives correct advice to farmers. a) True b) False
Description : GERMWATCHER is used to control infections caused by bacteria. a) True b) False
Description : MYSIN attempts to recommend appropriate therapies for patients with bacterial infections. a) True b) False
Description : CaDet is used for early cancer detection. a) True b) False
Description : PXDES is medical expert system, for diagnosis of lung disease. a) True b) False