Department of Computer Science & Engineering ARTIFICIAL INTELLIGENCE UNIT 1 Axtificial Intelligence is about __ Playing a game on Computer 3) Programming on Machine with your Own Intelligence Making a machine Intelligent D__ Putting your intelligence in Machine Who is known as the "Father of AI"? Fisher Ada 8) Alan Turing John McCarthy D_ Allen Newell Which ofthe given language is not commonly used for AI? LIsP B PROLOG Python D| Perl Atechnique that was developed to determine whether a machine could or could not demonstrate the artificial intelligence known as the__ Boolean Algebra B_ Logarithm Turing Test D_ Algorithm ‘An Al agent perceives and acts upon the environment using a. Sensors 8 b.Perceiver c. Actuators D| d.Bothaande9% 10. AL 12, Which rule is applied for the Simple reflex agent? Simple-action rule 8, Simple &Condition-action rule Condition-action rule D| None of the above Which agent deals with the happy and unhappy state? Utility-based agent 8 Model-based agent Goal-based Agent D) Learning Agent Rational agent always does the right things. True B) False What is the function of an Artificial Intelligence “Agent function”? Mapping of goal sequenceto an action) Work without the direct interference of the people Mapping of precept sequence 5 Mapping of environment sequence to an to anaction action Which of the following is not a type of Artificial Intelligence agent? Learning AT agent B| Goal-based Al agent Simple reflex AI agent D|_ Unity-based Al agent Which of the following is/are the composition for AT agents? Program only B) Architecture only Both Program and Architecture D) None of the mentioned LISP was created by? John McCarthy 8) Marvin Minsky ‘Alan Turing D| Allen Newell and Herbert Simon 72B. 16. The performance of an agent can be improved by Perceiving 8) Learning Observing D| None of the mentioned The action of the Simple refiex agent completely depends upon Perception history 8) Current perception Learning theory D) Utility Functions Which of the following is NOT an example of artificial narrow intelligence? Google Translate 8, Super-intelligent AT agents Spam Filter D_ AlphaGo Which of the following uses machine-learning technology to become smarter and more capable of understanding natural language questions and requests? Netflix 8 Siri Cogito D_ Deepblue Categorize Crossword puzzle in Fully Observable / Partially Observable. Fully Observable 8) Partially Observable All of the mentioned D__ None of the mentioned ‘An agent iS composed of, Architecture B) Agent Function Perception Sequence D| Architecture and Program LISP was created by? Marvin Minsky 8) John McCarthy Alan Turing D| Allen Newell and Herbert Simona. au Strong Artifical Intelligence is the embodiment of human intellectualcapabilities within a computer the study of mental faculties through the use of mental models implemented on a computer a set of computer programs that produce output that would be considered to reflect intelligence if it were generated by humans all of the mentioned Acertain Professor at the Stanford University coined the word ‘artificial intelligence’ in 1956 at 2 conference held at Dartmouth college. Can you name the Professor? David Levy John McCarthy Joseph Weizenbaum Hans Berliner Anatural language generation program must decide what tosay why itis being used when to say somethingUNIT 2 What is the main task of a problem-solving agent? Solve the given problem and reach to To find out which sequence of action goal will get it to the goal state Both a) & b) None of the mentioned What is state space? The whole problem Your Definition to @ problem Problem you design Representing your problem withvariable and parameter 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 best sequence. This process of looking for such a sequence is called Search. True False Asearch algorithm takes as an input and returns as an output. Input, output Problem, solution Solution, problem Parameters, sequence of actions Aproblem in a search space is defined by one of these state. Initial state Last state Intermediate state All of the mentioned a76 The Set of actions for a problem in a state space is formulated by a Intermediate states Initial state ‘Successor function, which takes D__None of the mentioned currentaction and returns next immediate state A solution to 2 problem is a path from the initial state to a goal state. Solution quality is mezsured by the path cost function, and an optimal solution has the highest path cost among all solutions, True False The process of removing detail from a given state representation is called Extraction Abstraction Information Retrieval Mining of data The ___ isa touring problem in which each city must be visited exactly once, The aim is to find the shortest tour. Finding shortest path between 'a source) Travelling Salesman problem and a destination Map coloring problem Depth first search traversal on a given map represented as a graph What is the major component/components for measuring the performance of problemsolving? Completeness b) Optimality Time and Space complexity All of the mentioned Which search strategy is also called as blind search? Uninformed search Informed search Simple reflex search All of the mentionedWhen is breadth-first search is optimal? When there is less number of nodes When all step costs are equal When all step costs are unequal None of the mentioned What is the space complexity of Depth-first search? Ob) (bl) om) (bm) Which search algorithm imposes a fixed depth limit on nodes? Depth-limited search Depth-first search Iterative deepening search Bidirectional search Which search implements stack operation for searching the states? Depth-limited search Depth-first search Breadth-first search None of the mentioned Strategies that know whether one non-goal state is “more promising” than another arecalled Informed & Unformed Search Unformed Search Heuristic & Unformed Search Informed & Heuristic Search Which data structure conveniently used to implement BFS? Stacks Queues Priority Queues D| _ Allof the mentionedWhich deta structure conveniently used to implement DFS? Stacks Queues Priority Queues All of the mentioned uniform-cost search expands the node n with the Lowest path cost Heuristic cost Highest path cost, Average path cost Optimality of BFS is When there is less number of nodes When all step costs are equal When all step costs are unequal None of the mentioned For general graph, how one can get rid of repeated states? By maintaining alist of visited vertices | By maintaining a list of traversed edges By maintaining a list of non-visited By maintaining a list of non-traversed vertices edges 7The main idea of Bidirectional search is to reduce the time complexity by searching ‘twoway simultaneously from start node and another from goal node. True False Which search uses the problem specific knowledge beyond the definition of the problem? Informed search Depth-first search Breadth-first search Uninformed search What is the heuristic function of greedy best-first search? fin) != h(n) fin) < h(n) f(n) = h(n) f(a) > h(n) Which is used to improve the performance of heuristic search? Quality of nodes Quality of heuristic function ‘Simple form of nodes None of the mentioned ‘A* algorithm is based on Breadth-first-Search Depth-First —Search Best-First-Search Hill dimbing Best-First search is a type of informed search, which uses to choose the best next node for expansion. Evaluation function returning ) Evaluation function retuming highest lowestevaluation evaluation Evaluation function returning lowest & None of them is applicable highest evaluation9322, 1.57 Pt Best-First search can be implemented using the following data structure. Queue Stack Priority Queue Circular Queue Heuristic function h(n) is Lowest path cost Cheapest path from root to goal node Estimated cost of cheapest path Average path cost fromroot to goal node What is the space complexity of Greedy search? Ob) O(bl) Om) (bm) What is the evaluation function in A* approach? Heuristic function Path cost from start node to current node Path cost from start node to | Average of Path cost from start node to currentnode + Heuristic cost current node and Heuristic costA* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) neverunderestimates the cost to reach the goal. True False In many problems the path to goal is irrelevant, this class of problems can be solved using Informed Search Techniques Uninformed Search Techniques Local Search TechniquesInformed & Uninformed SearchTechniquesUNIT 3 1. There exist only two types of quantifiers, Universal Quantification and Existential Quantification. a) True b)False 2. ‘Translate the following statement into FOL. “For every a, if a is a philosopher, then a is a scholar” a) V a philosopher(a) scholar(a) b) 4 a philosopher(a) scholar(a) c) Allof the mentioned d) None of the mentioned First Order Logic is also known as a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned 4. The adjective “first-order” distinguishes first-order logic from___in_ which there are predicates having predicates or functions as arguments, or in which one or both of predicate quantifiers or function quantifiers are permitted. a) Representational Verification b) Representational Adequacy c) Higher Order Logic d) Inferential Efficiency 5. Which condition is used to cease the growth of forward chaining? a) Atomic sentences b) Complex sentences ¢) No further inference @) Allof the mentioned6. Which knowledge base is called as fixed point? a) First-order definite clause are similar to propositional forward chaining b) First-order definite clause are mismatch to propositional forward chaining 9) All of the mentioned 4) None of the mentioned 7. How to eliminate the redundant rule matching attempts in the forward chaining? a) Decremental forward chaining b) Incremental forward chaining ©) Data complexity d)_ None of the mentioned 8. How many possible sources of complexity are there in forward chaining? a) 6) e d) One 9. Which algorithm will work backward from the goal to solve a problem? a) Forward chaining b) Backward chaining 6) Hill-climb algorithm 4) None of the mentioned 10. Which is mainly used for automated reasoning? a) Backward chaining b) Forward chaining ¢) Logic programming 4) Parallel programming11, How can be the goal is thought of in backward chaining algorithm? a) Queue b) List Vector 4) Stack 12. What is used in backward chaining algorithm? a) Conjuncts bj Substitution ¢) Composition of substitution d) None of the mentioned1) 2) 3) 4) 5) 6) UNIT 4 Suppose you are creating a bayesian network. Which of the following is the outcome between a node and its predecessors? (A). Conditionally independent (B). Dependant (C). Functionally dependent (D). Both Conditionally dependant & Dependant The compactness of the bayesian network is related to? (A). Partial structure (B). Fully structured (C). Locally structured (D). All of the mentioned How many terms do we need to construct a Bayes model? (a). 3 (B). 6 (co. 4 (D).7 Bayes rule can be used in? (A). Solving queries (8). Answering probabilistic query (C). Decreasing complexity (D). Increasing complexity Which of the following offers by the Bayesian network? (A). Partial description of the domain (B). A complete description of the domain (C). A complete description of the problem (D). None of these Select the condition that is used to impact a variable directly by all other variables? (A). Partially connected (B). Local connected (C). Fully connected (D). None of these7) Which of the following is desired to build probabilistic systems feasible in the world? (a). Reliability (B). Feasibility (C). Crucial robustness (D). None of these 8) We can calculate the entries in the full joint probability distribution by using the? (A). variables (B). information (C). Both A and B (D). None of these 9) The Bayesian network is very helpful to answer any query? (A). Full distribution (8). Partial distribution (C). Joint distribution (D). All of the mentioned. 10) Local structure is related to which of the following? (A). Linear (B). Dependant (©). Hybrid (D). None of theseUnit 5: 1A is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility. a) Decision tree b) Graphs ¢) Trees 4) Neural Networks 2. Decision Tree is a display of an algorithm. a) True b) False 3. What is Decision Tree? a) Flow-Chart b) Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label ¢) Flow-Chart & Structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label d) None of the mentioned 4. Decision Trees can be used for Classification Tasks. a) True b) False 5. Choose from the following that are Decision Tree nodes? a) Decision Nodes b) End Nodes ) Chance Nodes d) All of the mentionedDecision Nodes are represented by a) Disks b) Squares ¢) Circles ) Triangles . Chance Nodes are represented by a) Disks b) Squares c) Circles ¢) Triangles End Nodes are represented by a) Disks b) Squares ©) Circles d) Triangles Which of the following are the advantage/s of Decision ‘Trees? a) Possible Scenarios can be added +) Use a white box model, If given result is provided by a model ) Worst, best and expected values can be determined for different scenarios 4) All of the mentionedUNIT 6 1. Factors which affect the performance of learner system does not include? a) Representation scheme used b) Training scenario ©) Type of fecdback d) Good data structures 2. Which of the following does not include different learning methods? a) Memorization b) Analogy ©) Deduction 4) Introduction 3. Which of the following is the model used for learning? a) Decision trees b) Neural networks c) Propositional and FOL rules d) All of the mentioned 4. Automated vehicle is an example of a) Supervised learning b) Unsupervised learning c) Active learning d) Reinforcement learning 5. Which of the following is an example of active learning? a) News Recommender system b) Dust cleaning machine c) Automated vehicle d) None of the mentioned 6. In which of the following learning the teacher returns reward and punishment to learner? a) Active learning b) Reinforcement learning c) Supervised learning ) Unsupervised learning 7. Decision trees are appropriate for the problems where a) Attributes are both numeric and nominal b) Target function takes on a discrete number of values ¢) Data may have errors d) All of the mentioned8. Which of the following is not an application of learning? a) Data mining b) WwW ¢) Speech recognition ) None of the mentioned 9. Which of the following is the component of learning system? a) Goal b) Model c) Learning rules d) All of the mentioned 10. Which of the following is also called as exploratory learning? a) Supervised learning b) Active learning c) Unsupervised learning 4) Reinforcement learning 11. In an Unsupervised learning a) Specific output values are given b) Specific output values are not given c) No specific Inputs are given d) Both inputs and outputs are given 12. Inductive learning involves finding a a) Consistent Hypothesis b) Inconsistent Hypothesis c) Regular Hypothesis d) Lrregular Hypothesis 13. Computational learning theory analyzes the sample complexity and computational complexity of a) Unsupervised Learning b) Inductive learning ¢) Forced based learning d) Weak learning 14. If a hypothesis says it should be positive, but in fact, it is negative, we calll it a) A consistent hypothesis b) A false negative hypothesis ¢) A false positive hypothesis ) A specialized hypothesis15. Which of the following statement is true? a) Not all formal languages are context-free b) All formal languages are Context free c) All formal languages are like natural language ) Natural languages are context-oriented free