Description : The ____ level contains constituents at the third level which are knowledge based system, heuristic search, automatic theorem proving, multi-agent system. A. Cognition level B. Gross level C. Functional level D. All of above
Last Answer : B. Gross level
Description : A ____ is a rule of thumb, strategy, trick, simplification, or any other kind of device which drastically limits search for solutions in large problem spaces. A. Heuristic B. Critical C. Value based D. Analytical
Last Answer : A. Heuristic
Description : The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above
Last Answer : B. Logic level
Description : The core components are constituents of AI are derived from A. Concept of logic B. Cognition C. Computation D. All of above
Last Answer : D. All of above
Description : Genetic Algorithm are a part of A . Evolutionary Computing B. inspired by Darwin's theory about evolution - "survival of the fittest" C. are adaptive heuristic search algorithm based on the evolutionary ideas of natural selection and genetics D . All of the above
Last Answer : D . All of the above
Description : General algorithm applied on game tree for making decision of win/lose is ____________ a) DFS/BFS Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) MIN/MAX Algorithms
Last Answer : d) MIN/MAX Algorithms
Description : Constraint satisfaction problems on finite domains are typically solved using a form of ___________ a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) All of the mentioned
Last Answer : d) All of the mentioned
Description : Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search
Last Answer : c) Greedy local search
Description : Greedy search strategy chooses the node for expansion in ___________ a) Shallowest b) Deepest c) The one closest to the goal node d) Minimum heuristic cost
Last Answer : c) The one closest to the goal node
Description : A heuristic is a way of trying ___________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than another d) All of the mentioned
Description : Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned
Last Answer : b) Quality of heuristic function
Description : What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned
Last Answer : b) Heuristic search
Description : uniform-cost search expands the node n with the __________ a) Lowest path cost b) Heuristic cost c) Highest path cost d) Average path cost
Last Answer : a) Lowest path cost
Description : Strategies that know whether one non-goal state is “more promising” than another are called ___________ a) Informed & Unformed Search b) Unformed Search c) Heuristic & Unformed Search d) Informed & Heuristic Search
Last Answer : d) Informed & Heuristic Search
Description : What is the general term of Blind searching? a) Informed Search b) Uninformed Search c) Informed & Unformed Search d) Heuristic Search
Last Answer : b) Uninformed Search
Description : A heuristic is a way of trying __________ a) To discover something or an idea embedded in a program b) To search and measure how far a node in a search tree seems to be from a goal c) To compare two nodes in a search tree to see if one is better than the other is d) All of the mentioned
Description : What is the term used for describing the judgmental or commonsense part of problem solving? a) Heuristic b) Critical c) Value based d) Analytical
Last Answer : a) Heuristic
Description : Which term is used for describing the judgmental or commonsense part of problem solving? a) Heuristic b) Critical c) Value based d) Analytical
Description : ______ do not guarantee optimal/any solutions A. Heuristic B. Critical C. Value based D. Analytical
Description : What is the term used for describing the judgmental or commonsense part of problem solving? A. Heuristic B. Critical C. Value based D. Analytical
Description : What is the term used for describing the judgmental or commonsense part of problem solving? A. Heuristic B. Critical C. Value based D. Analytical E. None of the above
Description : Aristotle’s theory of syllogism and Descartes and kant’s critic of pure reasoning made knowledge on _____. A. Logic B. Computation logic C. Cognition logic D. All of above
Last Answer : A. Logic
Description : Mathematical game theory, a branch of economics, views any multi-agent environment as a game provided that the impact of each agent on the others is “significant,” regardless of whether the agents are cooperative or competitive. a) True b) False
Last Answer : a) True
Description : General games involves ____________ a) Single-agent b) Multi-agent c) Neither Single-agent nor Multi-agent d) Only Single-agent and Multi-agent
Last Answer : d) Only Single-agent and Multi-agent
Description : Charles Babbage and Boole who demonstrate the power of _______ A. Logic B. Computation logic C. Cognition logic D. All of above
Last Answer : B. Computation logic
Description : A computer program that contains expertise in a particular domain is called? a) intelligent planner b) automatic processor c) expert system d) operational symbolizer
Last Answer : c) expert system
Description : 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
Last Answer : c) Recurrent neural network
Description : The use of antibiotics can be based on either the clinical course of a patient without the benefit of well-defined microbiologic data (empiric therapy), or targeted at ... which polymicrobial infection is identified, specifically-directed treatment for the predominant organism is satisfactory
Last Answer : Answer: c The use of empiric therapy without the benefit of well-defined microbiologic data is appropriate when there is sufficient clinical evidence to support the diagnosis such that it would ... components of the infection if the body site is such that these microorganisms may be present
Description : What is a top-down parser? a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual pre-terminal symbols are written b) ... d) Begins by hypothesizing upper level constituents and successively predicting a sentence (the symbol S)
Last Answer : a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual pre-terminal symbols are written
Description : What is a top-down parser? a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual preterminal symbols are written b) Begins ... ) Begins by hypothesizing upper level constituents and successively predicting a sentence (the symbol S)
Last Answer : a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual preterminal symbols are written
Description : suppose you want to prove the isosceles triangle theorem by proving that JKL?
Last Answer : L
Description : Which is the best way to go for Game playing problem? a) Linear approach b) Heuristic approach (Some knowledge is stored) c) Random approach d) An Optimal approach
Last Answer : b) Heuristic approach (Some knowledge is stored)
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 search agent operates by interleaving computation and action? a) Offline search b) Online search c) Breadth-first search d) Depth-first search
Last Answer : b) Online search
Description : What are the things that agent knows in online search problems?
Last Answer : a. Actions(s) b. Step cost function C(s, a, s’) c. Goal TEST(s)
Description : Define Online Search agent.
Last Answer : Agent operates by interleaving computation and action (i.e.) first it takes an action, and then it observes the environment and computes the next action.
Description : Special programs that assist programmers are called ____________ a) heuristic processors b) symbolic programmers c) intelligent programming tools d) program recognizers
Last Answer : c) intelligent programming tools
Description : _____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy
Last Answer : c) Graph-Plan
Description : Which data structure is used to give better heuristic estimates? a) Forwards state-space b) Backward state-space c) Planning graph algorithm d) None of the mentioned
Last Answer : c) Planning graph algorithm
Description : A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False
Description : What is the evaluation function in A* approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
Last Answer : c) Path cost from start node to current node + Heuristic cost
Description : What is the evaluation function in greedy approach? a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost
Last Answer : a) Heuristic function
Description : Heuristic function h(n) is ________ a) Lowest path cost b) Cheapest path from root to goal node c) Estimated cost of cheapest path from root to goal node d) Average path cost
Last Answer : c) Estimated cost of cheapest path from root to goal node
Description : Which method is effective for escaping from local minima? a) Updating heuristic estimate b) Reducing heuristic estimate c) Eliminating heuristic estimate d) None of the mentioned
Last Answer : a) Updating heuristic estimate
Description : An Artificial Intelligence technique that allows computers to understand associations and relationships between objects and events is called _____________ a) heuristic processing b) cognitive science c) relative symbolism d) pattern matching
Last Answer : c) relative symbolism
Description : What are the two subfields of Natural language processing? a) symbolic and numeric b) time and motion c) algorithmic and heuristic d) understanding and generation
Last Answer : c) algorithmic and heuristic
Description : An AI technique that allows computers to understand associations and relationships between objects and events is called: a. heuristic processing b. cognitive science c. relative symbolism d. pattern matching
Last Answer : d. pattern matching
Description : A bidirectional feedback loop links computer modelling with: a. artificial science b. heuristic processing c. human intelligence d. cognitive science
Last Answer : d. cognitive science