Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Embodied cognitive science wikipedia , lookup
Collaborative information seeking wikipedia , lookup
Existential risk from artificial general intelligence wikipedia , lookup
Visual Turing Test wikipedia , lookup
History of artificial intelligence wikipedia , lookup
Multi-armed bandit wikipedia , lookup
Computer Go wikipedia , lookup
Can we precisely define Artificial Intelligence? yes we can not at all AI actually tries to recreate the functions of the inside of the brain as opposed to simply emulating behavior weak strong both weak and strong none of given Intelligence is the ability to think /learn /plain recognize /remember problem solving all of given option are right From discipline of _____________ we have information about the network structure of a human brain and all the theories on functionalities of different human organs. biology mathematics computer science psychology In optimal path searches we try to find the __________ solution best worst least but not worst none of given Some essential components of problem solving are Problem Statement, _________, Solution Space and Operators. complex statement initial statement intermediate statement gaol statement In Adversarial search there may occur such a scenario where two opponents also called ___________ are searching for a goal. adversaries friends player intruder Hit and trial is a classical approach to solve the ___________ problems easily. trivial medium From discipline of _____________ we have the tools and techniques to investigate the human mind and ways to represent the resulting theories computer science mathematics biology psychology Which of the following disciplines provides us with the theories of structure and meaning of language linguistic philosophy biology psychology Quiz Start Time: 06:30 AM Time Left 71 sec(s) Question # 1 of 10 ( Start time: 06:30:24 AM ) Total Marks: 1 Which of the following is NOT a search strategy? Select correct option: Blind/uninformed search Informed/heuristic search Any path search Leaf path search Quiz Start Time: 06:30 AM Time Left 67 sec(s) Question # 2 of 10 ( Start time: 06:31:36 AM ) Total Marks: 1 _________ is branch and bound technique with the improvement of underestimates and dynamic programming. Select correct option: A* Procedure Progressive deepening Beam search None of the given options Quiz Start Time: 06:30 AM Time Left 67 sec(s) Question # 5 of 10 ( Start time: 06:33:39 AM ) Total Marks: 1 In depth first search we keep our priority function as given below and given give priority to elements with ______ P(n) value. P(n) = 1 / height(n). Select correct option: Minimum Maximum Average Absolute Quiz Start Time: 06:30 AM Time Left 68 sec(s) Question # 6 of 10 ( Start time: 06:34:25 AM ) Total Marks: 1 A "circle" symbol in a tree structure is called: Select correct option: Node Edge Ancestor Descendant Quiz Start Time: 06:30 AM Time Left 89 sec(s) Question # 8 of 10 ( Start time: 06:35:41 AM ) Total Marks: 1 “If you find the goal, exit, otherwise repeat DFS to the next lower level”. The statement refers to: Select correct option: Depth first search Breadth first search Progressive depending None of the given options Quiz Start Time: 06:30 AM Time Left 85 sec(s) Question # 9 of 10 ( Start time: 06:36:17 AM ) Total Marks: 1 In progressive depending, the idea is to simply apply DFS to a specific. Select correct option: Level Node Branch Branching factor ▶ Reply Question # 1 of 10 ( Start time: 02:48:00 PM ) Total Marks: 1 From discipline of _____________ we have information about the network structure of a human brain and all the theories on functionalities of different human organs. Select correct option Mathematics Biology Computer Science Psychology Question # 2 of 10 ( Start time: 02:48:24 PM ) Total Marks: 1 Most of the solution spaces for problems can be represented in a ________ Select correct option: Graph Table Demo None of the above Question # 3 of 10 ( Start time: 02:48:40 PM ) Total Marks: 1 Some essential components of problem solving are Problem Statement, _________, Solution Space and Operators. Select correct option: Complex State Initial State Intermediate State Goal State Question # 4 of 10 ( Start time: 02:49:00 PM ) Total Marks: 1 Can we precisely define Artificial Intelligence? Select correct option: Yes we can No we can not Question # 5 of 10 ( Start time: 02:49:15 PM ) Total Marks: 1 We use graphs to represent problems and their solution spaces. Select correct option: False True Question # 6 of 10 ( Start time: 02:49:33 PM ) Total Marks: 1 Ability to tackle ambiguous and fuzzy problems demonstrate Select correct option: Intelligence Non intelligence behavior All of the given None of the given Question # 7 of 10 ( Start time: 02:49:48 PM ) Total Marks: 1 _____ AI actually tries to recreate the functions of the inside of the brain as opposed to simply emulating behavior Select correct option: Weak Strong Weak and Strong None of the given Question # 8 of 10 ( Start time: 02:50:03 PM ) Total Marks: 1 The traveling inside a solution / space requires something called as ___________. Select correct option: Operands Inner solution Space solution Operators Question # 9 of 10 ( Start time: 02:50:18 PM ) Total Marks: 1 Trying to catch out own thoughts as they go by Select correct option: Introspection Psychological Experiments Introspection and Psychological Experiments None of the given Question # 10 of 10 ( Start time: 02:50:39 PM ) Total Marks: 1 Answering the Sequence Problem need Select correct option: Intelligence Ability to make plan Ability to schedule None of the given Some essential components of problem solving are Problem statement _________ solution space are Operators Complex State Initial State Intermediate State Goal State The traveling inside a solution space requires something called as ___________ Operands Inner solution Space solution Operators Genetic Algorithms is a search method in which multiple search paths are followed in _______ Series Parallel None of the give Sequential Every Graph can be converted into a tree. True False Which of the following disciplines provides us with the theories of structure and meaning of language Linguistic Philosophy Biology Psychology In optimal path searches we try to find the ____________ solution Least Worst Least but not worst Best In Depth First Search the node with the largest value of height will be at the _______ priority to be picked. Minimum Maximum Zero Both Minimum and maximum In adversarial search there may occur such a scenario where two opponents also called _____ are searching for goal. Adversaries Friend Players Intruders From discipline ____________ we have information about the network structure of a human brain and all the theories on functionalities of different human organs. Mathematics Biology Computer Science Psychology Hit and trial is classical approach to solve the ________ problem easily Trivial Medium Most of the solution spaces for problems can be represented in a ________ Graph Table Demo Tree We use graph to represent problems and their solution spaces. False True By getting grips on ___________ that deal with searching techniques in graphs and trees, problem solving can be performed in an efficient manner. Pseudocode Algorithms Charts Graphs Every graph can be converted into a tree. True False In Breadth First Search the node with the largest value of height will be at the _________ priority to be picked. Maximum Minimum None of the given Breadth-First Search checks all paths of a given length before moving on to any longer paths. True False Breadth-first search is a good idea when you are confident that the branching factor is _________ Extremely small Small Medium Large The foothhill problem occurs whenever there are___________ peaks. High Secondary Primary Deep Which one of the problem is more subtle, and consequently, is more frustrating: Foothill problem Plateau Ridge Box The paths found by best-first search are likely to be __________ than those found with other methods. None od the given Shorter Longer In Basic Genetic Algorithm the term mutation refers to a small random ________. Number Change Operator Operand Semantic networks are graphs, with nodes representing ____________ and arcs representing ____________ between objects. objects, relationships relationships, distance objects, distance distance, relationships A proposition is the statement of a ________. Fact Equation Action Theorem ___________ reasoning is based on forming, or inducing a ‘generalization’ from a limited set of observations. Deductive Abductive Inductive An ___________ is “A computer program designed to model the problem solving ability of a human expert." Expert system Intelligent System Echo System Energy System Another expert system named __________ was developed by Digital Equipment Corporation, as a computer configuration assistant. R1/XCON MYCIN Dendral R3/XCON An expert system may replace the expert or assist the expert. True False Conventional programming focuses on _______, while ES programming focuses on ________ Solution, Problem Problem, Solution Problem, Expert Solution, Expert In backward chaining terminology, the hypothesis to prove is called the ________. Proof Goal Plan None of the given An expert system may replace the expert or assist the expert True False Every graph can be converted into a tree True False Which one of the problem is more subtle and consequently is more frustrating? Foothill Plateau Ridge Box In GA, the random process is repeated until an individual with required _________ level is found. Select correct option: Higher Lower Fitness Logical Mutation can be as simple as just flipping a bit at random or any number of bits Select correct option: True False Genetic algorithm uses evolutionary techniques, based on function optimization and artificial intelligence, to develop a solution. Select correct option: True False We can get optimal solution given some parameters using Genetic Algorithm. Select correct option: True False ___________ reasoning is based on forming, or inducing a ‘generalization’ from a limited set of observations. Select correct option: Deductive Abductive Analogical Inductive A proposition is the statement of a ________. Select correct option: Equation Action Theorem Fact An AI system has a ____________ component that allows the system to get information from its environment. Select correct option: Planning Perception Learning Execution In the worst case of semantic network, we may need to traverse the entire network and then discover that the requested info ________. Select correct option: Does not exist Exists Is incorrect Is correct A statement in conjunctive normal form (CNF) consists of __________ Select correct option: ANDs of Ors. ANDs Ors Ors of ANDs __________ is the process of deriving logical conclusions from given facts. Select correct option: Representation Execution Reasoning Planning What is the correct order for solving a problem using GA I. Choose the best individuals from the population for crossover II. Choose initial population III. Evaluate the fitness of each individual Select correct option: I,II,III I,III,II II,I,III II,III,I An AI system must form a meaningful and useful _____________ of the internal information. Select correct option: Representation Execution Learning Planning Question # 2 of 10 ( Start time: 05:58:25 PM ) Total Marks: 1 In ____ searches we are concerned with finding any one solution to our problem. Select correct option: Non optimal Optimal path Contrary path None of the given options Question # 3 of 10 ( Start time: 05:58:25 PM ) Total Marks: 1 Which of the following is/are example(s) of uninformed search? Select correct option: Breadth first search Depth first search Progressive deepening All of the given options not confrm Question # 4 of 10 ( Start time: 05:58:25 PM ) Total Marks: 1 Which of the following is NOT one of the steps of simple search algorithm? Select correct option: Initialize priority queue. Check if the priority queue is empty. If node picked from priority queue is goal node then return. Copy visited queue to priority queue. Question # 5 of 10 ( Start time: 05:58:25 PM ) Total Marks: 1 In ______ search, rather than trying all possible search paths, we focus on paths that seem to be getting closer to goal state using some kind of “guide”. Select correct option: Heuristic Uninformed Depth first Progressive deepening Question # 6 of 10 ( Start time: 05:58:25 PM ) Total Marks: 1 One of the advantages of breadth first search is that it: Select correct option: Guarantees finding the shallowest path even in presence of infinite paths Has a small space requirement Can work with broken edges None of the given options Question # 7 of 10 ( Start time: 05:58:25 PM ) Total Marks: 1 A "circle" symbol in a tree structure is called: Select correct option: Node Edge Ancestor Descendant Question # 8 of 10 ( Start time: 05:58:25 PM ) Total Marks: 1 Which of the following is NOT a search strategy? Select correct option: Blind/uninformed search Informed/heuristic search Any path search Leaf path search Question # 9 of 10 ( Start time: 05:58:25 PM ) Total Marks: 1 Which of the following is NOT one of the drawbacks of depth first search? Select correct option: Can run forever in search spaces with infinite length paths Does not guarantee finding the shallowest goal Requires the tree to be a complete tree None of the given options Question # 10 of 10 ( Start time: 05:58:25 PM ) Total Marks: 1 “In context of Hill climbing algorithm, a person may reach the portion of a mountain which is totally flat, whatever step he takes gives him no improvement in height hence he gets stuck.” The above statement refers to: Select correct option: Foothill problem Plateau problem Ridge problem Slope problem