Artificial Intelligence Mcq

 AI MCQ:

• What is the action of task environment in artificial intelligence?

  Problem

  1

• What is the expansion if PEAS in task environment?

  Performance, Environment, Actuators, Sensors

  3

• What kind of observing environments are present in artificial intelligence?

  Both Partial & Fully

  4

• What kind of environment is strategic in artificial intelligence?

  Deterministic

  1

• What kind of environment is crossword puzzle?

  Static

  1

• What kind of behavior does the stochastic environment posses?

  Local

  1

• Which is used to select the particular environment to run the agent?

  Environment Generator

  2

• Which environment is called as semi dynamic?

  Environment does not change with the passage of time, but Agent performance changes

  4

• Where does the performance measure is included?

  Task environment

  2

• Which is used to provide the feedback to the learning element?

  Critic

  1

• Which depends on the percepts and actions available to the agent?

  Design problem

  3

• Which were built in such a way that humans had to supply the inputs and interpret the outputs?

  AI system

  2

• Which technology uses miniaturized accelerometers and gyroscopes?

  MEMS

  3

• What is used for tracking uncertain events?

  Filtering algorithm

  1

• What is not represented by using propositional logic?

  Both Objects & Relations

  3

• Which functions are used as preferences over state history?

  Reward

  2

• Which kind of agent architecture should an agent an use?

  All of the mentioned

  4

• Specify the agent architecture name that is used to capture all kinds of actions.

  Hybrid

  3

• Which agent enables the deliberation about the computational entities and actions?

  Reflective

  2

• What can operate over the joint state space?

  Both Decision-making & Learning algorithm

  4

• What is Artificial intelligence?

  Making a Machine intelligent

  3

• Which is not the commonly used programming language for AI?

  Perl

  4

• Artificial Intelligence has its expansion in the following application.

  All of the mentioned

  4

• What is an ‘agent’?

  All of the mentioned

  4

• Agents behavior can be best described by ____________

  Agent function

  2

• What is rational at any given time depends on?

  All of the mentioned

  4

• What could possibly be the environment of a Satellite Image Analysis System?

  All of the mentioned

  4

• Categorize Crossword puzzle in Fully Observable / Partially Observable

  Fully Observablepartially Observable

  1

• Satellite Image Analysis System is

  Partially Observable

  4

• An agent is composed of ________

  Architecture and Program

  4

• Which instruments are used for perceiving and acting upon the environment?

  Sensors and Actuators

  1

• What is meant by agent’s percept sequence?

  Complete history of perceived things

  3

• How many types of agents are there in artificial intelligence?

  4

  4

• What is the rule of simple reflex agent?

  Condition-action rule

  2

• What are the composition for agents in artificial intelligence?

  Both Program & Architecture

  3

• In which agent does the problem generator is present?

  Learning agent

  1

• Which is used to improve the agents performance?

  Learning

  2

• Which agent deals with happy and unhappy states?

  Utility based agent

  4

• Which action sequences are used to achieve the agent’s goal?

  Both Search & Plan

  4

• Which element in the agent are used for selecting external actions?

  Performance

  2

• What is the main task of a problem-solving agent?

  All of the mentioned

  3

• What is state space?

  Representing your problem with variable and parameter

  4

• A search algorithm takes _________ as an input and returns ________ as an output.

  Problem, solution

  2

• A problem in a search space is defined by one of these state.

  Initial state

  1

• The Set of actions for a problem in a state space is formulated by a ___________

  Successor function, which takes current action and returns next immediate state

  3

• The process of removing detail from a given state representation is called ______

  Abstraction

  2

• A problem solving approach works well for ______________

  Mars Hover

  4

• The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour.

  Travelling Salesman problem

  2

• Web Crawler is a/an ____________

  Intelligent goal-based agent

  1

• What is the major component/components for measuring the performance of problem solving?

  All of the mentioned

  4

• A production rule consists of ____________

  Set of Rule & sequence of steps

  3

• Which search method takes less memory?

  Depth-First Search

  1

• Which is the best way to go for Game playing problem?

  Heuristic approach

  2

• Which search strategy is also called as blind search?

  Uninformed search

  1

• How many types are available in uninformed search method?

  5

  3

• Which search is implemented with an empty first-in-first-out queue?

  Breadth-first search

  2

• When is breadth-first search is optimal?

  When all step costs are equal

  2

• How many successors are generated in backtracking search?

  1

  1

• What is the space complexity of Depth-first search?

  O(bm)

  4

• How many parts does a problem consists of?

  4

  4

• Which algorithm is used to solve any kind of problem?

  Tree algorithm

  2

• Which search algorithm imposes a fixed depth limit on nodes?

  Depth-limited search

  1

• Which search implements stack operation for searching the states?

  Depth-first search

  2

• Strategies that know whether one non-goal state is “more promising” than another are called ___________

  Informed & Heuristic Search

  4

• Which of the following is/are Uninformed Search technique/techniques?

  All of the mentioned

  4

• Which data structure conveniently used to implement BFS?

  Queues

  2

• Which data structure conveniently used to implement DFS?

  Stacks

  1

• The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.)

  O(bd+1) and O(bd+1)

  1

• uniform-cost search expands the node n with the __________

  Lowest path cost

  1

• Depth-first search always expands the ______ node in the current fringe of the search tree.

  Deepest

  3

• Breadth-first search always expands the ______ node in the current fringe of the search tree.

  Shallowest

  1

• Optimality of BFS is ___________

  When all step costs are equal

  2

• LIFO is ______ where as FIFO is ________

  Stack, Queue

  1

• For general graph, how one can get rid of repeated states?

  By maintaining a list of visited vertices

  1

• DFS is ______ efficient and BFS is __________ efficient.

  Space, Time

  1

• What is the other name of informed search strategy?

  Heuristic search

  2

• How many types of informed search method are in artificial intelligence?

  4

  4

• Which search uses the problem specific knowledge beyond the definition of the problem?

  Informed search

  1

• Which function will select the lowest expansion node at first for evaluation?

  Best-first search

  2

• What is the heuristic function of greedy best-first search?

  f(n) = h(n)

  3

• Which search uses only the linear space for searching?

  Recursive best-first search

  2

• Which method is used to search better by learning?

  Metalevel state space

  3

• Which search is complete and optimal when h(n) is consistent?

  A* search

  4

• Which is used to improve the performance of heuristic search?

  Quality of heuristic function

  2

• Which search method will expand the node that is closest to the goal?

  Greedy best-first search

  2

• A heuristic is a way of trying ___________

  All of the mentioned

  4

• A* algorithm is based on ___________

  Best-First-Search

  3

• The search strategy the uses a problem specific knowledge is known as ___________

  All of the mentioned

  4

• Best-First search is a type of informed search, which uses ________________ to choose the best next node for expansion.

  Evaluation function returning lowest evaluation

  1

• Best-First search can be implemented using the following data structure

  Priority Queue

  3

• Heuristic function h(n) is ________

  Estimated cost of cheapest path from root to goal node

  3

• Greedy search strategy chooses the node for expansion in ___________

  The one closest to the goal node

  3

• What is the evaluation function in greedy approach?

  Heuristic function

  1

• What is the space complexity of Greedy search?

  O(bm)

  4

• What is the evaluation function in A* approach?

  Path cost from start node to current node + Heuristic cost

  3

• In many problems the path to goal is irrelevant, this class of problems can be solved using ____________

  Local Search Techniques

  3

• Though local search algorithms are not systematic, key advantages would include __________

  Less memory & Finds a solution in large infinite space

  4

• _______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill.

  Hill-Climbing

  2

• When will Hill-Climbing algorithm terminate?

  No neighbor has higher value

  3

• What are the main cons of hill-climbing search?

  Terminates at local optimum & Does not find optimum solution

  1

• Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next.

  Greedy local search

  3

• Hill-Climbing approach stuck for which of the following reasons?

  All of the mentioned

  4

• ___________ algorithm keeps track of k states rather than just one.

  Local Beam search

  2

• What are the two main features of Genetic Algorithm?

  Fitness function & Crossover techniques

  1

• Searching using query on Internet is, use of ___________ type of agent.

  Goal Based & Online agent

  4

• _________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations.

  Constraints Satisfaction Problems

  1

• Which of the Following problems can be modeled as CSP?

  All of the mentioned

  4

• What among the following constitutes to the incremental formulation of CSP?

  All of the mentioned

  4

• The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign.

  Backtrack search

  2

• To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________

  Forward Searching

  1

• Consider a problem of preparing a schedule for a class of student. What type of problem is this?

  CSP

  3

• Constraint satisfaction problems on finite domains are typically solved using a form of ___________

  All of the mentioned

  4

• Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size.

  NP complete

  2

• ____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment.

  Dynamic CSPs

  2

• Flexible CSPs relax on _______

  Constraints

  1

• Language/Languages used for programming Constraint Programming includes ____________

  Prolog

  1

• Backtracking is based on ____________

  Both Last in first out & Recursion

  4

• When do we call the states are safely explored?

  A goal state is reachable from every state

  3

• Which of the following algorithm is generally used CSP search algorithm?

  Depth-first search algorithm

  2

• Which is the most straightforward approach for planning algorithm?

  State-space search

  2

• What are taken into account of state-space search?

  Both Preconditions & Effects

  4

• How many ways are available to solve the state-space search?

  2

  2

• What is the other name for forward state-space search?

  Progression planning

  1

• How many states are available in state-space search?

  4

  4

• What is the main advantage of backward state-space search?

  Relevant actions

  3

• What is the other name of the backward state-space search?

  Regression planning

  1

• What is meant by consistent in state-space search?

  Not any change in the literals

  2

• What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem?

  Termination

  4

• Which approach is to pretend that a pure divide and conquer algorithm will work?

  Subgoal independence

  2

• Which search is equal to minimax search but eliminates the branches that can’t influence the final decision?

  Alpha-beta pruning

  3

• Which values are independant in minimax search algorithm?

  Pruned leaves x and y

  1

• To which depth does the alpha-beta pruning can be applied?

  Any depth

  4

• Which search is similar to minimax search?

  Depth-first search

  2

• Which value is assigned to alpha and beta in the alpha-beta pruning?

  Both Alpha = max & Beta = min

  4

• Where does the values of alpha-beta search get updated?

  Along the path of search

  1

• How the effectiveness of the alpha-beta pruning gets increased?

  Depends on the nodes

  1

• hat is called as transposition table?

  Hash table of previously seen positions

  2

• Which is identical to the closed list in Graph search?

  Transposition table

  3

• Which function is used to calculate the feasibility of whole game tree?

  Evaluation function

  1

• Translate the following statement into FOL. “For every a, if a is a philosopher, then a is a scholar”

  ∀ a philosopher(a) scholar(a)

  1

• A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula.

  Deductive Systems

  1

• The statement comprising the limitations of FOL is/are ____________

  All of the mentioned

  4

• First Order Logic is also known as ___________

  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.

  Higher Order Logic

  3

• Which is created by using single propositional symbol?

  Atomic sentences

  2

• Which is used to construct the complex sentences?

  Logical connectives

  3

• How many proposition symbols are there in artificial intelligence?

  2

  2

• How many logical connectives are there in artificial intelligence?

  5

  4

• Which is used to compute the truth of any sentence?

  Semantics of propositional logic

  1

• Which are needed to compute the logical inference algorithm?

  All of the mentioned

  4

• From which rule does the modus ponens are derived?

  Inference rule

  1

• Which is also called single inference rule?

  Resolution

  2

• Which form is called as a conjunction of disjunction of literals?

  Conjunctive normal form

  1

• What can be viewed as a single lateral of disjunction?

  Unit clause

  3

• Which is a refutation complete inference procedure for propositional logic?

  Propositional resolution

  3

• What kind of clauses are available in Conjunctive Normal Form?

  Disjunction of literals

  1

• What is the condition of literals in variables?

  Universally quantified

  2

• Which can be converted to inferred equivalent CNF sentence?

  Every sentence of first-order logic

  3

• Which sentence will be unsatisfiable if the CNF sentence is unsatisfiable?

  Original statement

  4

• Which rule is equal to the resolution rule of first-order clauses?

  Propositional resolution rule

  1

• At which state does the propositional literals are complementary?

  If one is the negation of the other

  2

• What is meant by factoring?

  Removal of redundant literal

  2

• What will happen if two literals are identical?

  Reduced to one

  3

• When the resolution is called as refutation-complete?

  Sentence is unsatisfiable

  2

• Which condition is used to cease the growth of forward chaining?

  No further inference

  3

• Which closely resembles propositional definite clause?

  First-order definite clauses

  4

• What is the condition of variables in first-order literals?

  Universally quantified

  2

• Which are more suitable normal form to be used with definite clause

  Generalized modus ponens

  3

• Which will be the instance of the class datalog knowledge bases?

  No function symbols

  2

• Which knowledge base is called as fixed point?

  First-order definite clause are similar to propositional forward chaining

  1

• How to eliminate the redundant rule matching attempts in the forward chaining?

  Incremental forward chaining

  2

• From where did the new fact inferred on new iteration is derived?

  New fact

  3

• Which will solve the conjuncts of the rule so that the total cost is minimized?

  Conjunct ordering

  2

• How many possible sources of complexity are there in forward chaining?

  3

  3

• Which algorithm will work backward from the goal to solve a problem?

  Backward chaining

  2

• Which is mainly used for automated reasoning?

  Logic programming

  3

• What will backward chaining algorithm will return?

  Substitutes matching the query

  2

• How can be the goal is thought of in backward chaining algorithm?

  Stack

  4

• What is used in backward chaining algorithm?

  Composition of substitution

  3

• Which algorithm are in more similar to backward chaining algorithm?

  Depth-first search algorithm

  1

• Which problem can frequently occur in backward chaining algorithm?

  Both Repeated states & Incompleteness

  4

• How the logic programming can be constructed?

  Expressing knowledge in a formal language

  2

• What form of negation does the prolog allows?

  Negation as failure

  1

• Which is omitted in prolog unification algorithm?

  Occur check

  2

• Knowledge and reasoning also play a crucial role in dealing with __________________ environment.

  Partially Observable

  2

• Treatment chosen by doctor for a patient for a disease is based on _____________

  Current symptoms plus some knowledge from the textbooks plus experience

  3

• A) Knowledge base (KB) is consists of set of statements. B) Inference is deriving a new sentence from the KB. Choose the correct option.

  A is true, B is true

  1

• Wumpus World is a classic problem, best example of _______

  Reasoning with Knowledge

  3

• ‘α |= β ‘(to mean that the sentence α entails the sentence β) if and only if, in every model in which α is _____ β is also _____

  True, true

  1

• Which is not a property of representation of knowledge?

  Representational Verification

  1

• Which is not Familiar Connectives in First Order Logic?

  not

  4

• Inference algorithm is complete only if _____________

  It can derive any sentence that is an entailed version & It is truth preserving

  4

• What among the following could the universal instantiation of ___________ For all x King(x) ^ Greedy(x) => Evil(x)

  All of the mentioned

  4

• Lifted inference rules require finding substitutions that make different logical expressions looks identical.

  Unification

  3

• Which of the following is not the style of inference?

  Modus Ponen

  4

• What are the two basic types of inferences?

  Reduction to propositional logic, Manipulate rules directly

  1

• Which among the following could the Existential instantiation of ∃x Crown(x) ^ OnHead(x, Johnny)?

  Crown(John) ^ OnHead(John, Jonny)

  1

• Translate the following statement into FOL. “For every a, if a is a PhD student, then a has a master degree”

  ∀ a PhD(a) -> Master(a)

  1

• What is the process of capturing the inference process as a single inference rule?

  Generalized Modus Ponens

  3

• Which process makes different logical expression looks identical?

  Unification

  2

• Which algorithm takes two sentences and returns a unifier?

  Unify algorithm

  4

• Which is a lifted version of modus ponens?

  Generalized modus ponens

  1

• Which is unique up to renaming of variables?

  Most general unifier

  2

• Which makes the complexity of the entire algorithm quadratic in the size?

  Occur check

  4

• How many functions are available in the unification and lifting process?

  4

  4

• Where did all the facts are stored to implement store and fetch function?

  Knowledge base

  2

• What is meant by predicate indexing?

  All the one kind of facts in one bucket and another kind in other bucket

  1

• How the buckets are stored in predicate indexing?

  Hashes

  3

• The process by which the brain orders actions needed to complete a specific task is referred as ____________

  Both Planning problem & Partial order planning

  4

• The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of ____________

  Planning problem

  1

• To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s.

  Planning Graphs

  4

• Planning graphs consists of ____________

  a sequence of levels which corresponds to time steps in the plan

  2

• _____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic.

  Graph-Plan

  3

• What is the other name of each plan resulted in partial order planning?

  Linearization

  2

• What are the two major aspects which combines AI Planning problem?

  Search & Logic

  1

• __________ algorithm translates a planning problem in to prepositional axioms.

  SatPlan

  2

• ____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules.

  Hierarchical task network (HTN)

  2

• Standard planning algorithms assumes environment to be ___________

  Deterministic

  1

• Incorrect information results in unsatisfied preconditions for actions and plans _____________ detects violations of the preconditions for successful completion of the plan.

  Execution monitoring

  3

• Factors which affect the performance of learner system does not include?

  Good data structures

  4

• Which of the following does not include different learning methods?

  Introduction

  4

• Which of the following is the model used for learning?

  All of the mentioned

  4

• Automated vehicle is an example of ______

  Supervised learning

  1

• Which of the following is not an application of learning?

  None of the mentioned

  4

• Which of the following is the component of learning system?

  All of the mentioned

  4

• Which is not a desirable property of a logical rule-based system?

  Attachment

  2

• In an Unsupervised learning ____________

  Specific output values are not given

  2

• Inductive learning involves finding a __________

  Consistent Hypothesis

  1

• If a hypothesis says it should be positive, but in fact, it is negative, we call it __________

  A false positive hypothesis

  3

• A perceptron is a ______________

  Feed-forward neural network

  1

• Which combines inductive methods with the power of first-order representations?

  Inductive logic programming

  3

• How many reasons are available for the popularity of ILP?

  3

  3

• S0 => { WORKS(Richard, x); WORKS(Richard, John)}Which one is the unifier for what?

  {John/X}

  1

• To provide the resolution then the facts must be in

  Conjunctive Normal Form

  2

• Introduction of constants and functions to remove existential quantifiers.

  Skolemization

  4

• For proving the Colonel west is a Criminal by resolution

  refutation and negate criminal(colonel west)

  3

• American(x)&Weapons(y)&Hostile(z) & Sell(x,y,z) => Criminal (x). Choose the canonical form of this fol fact.

  ~American(x)||~Weapons(y)||~Hostile(z) ||~ Sell(x,y,z) || Criminal (x)

  2

• Expensive to compute and Difficult to write down large number of statements that are logically correct.

  Scalability

  2

• Assign the subproblems to different agents

  task allocation

  1

• ___issues include issues that relate directly to the relationship between employer and employee.

  madatory bargaining

  4

• Agents can provide intermediate sub solutions to help other agents in their work during

  task execution

  1

• Agents have to communicate with each other to solve these situations and There may be different solutions to the same subproblem . These facts are related to (2)

  conflict management

  1

• Marcus try to assassinate Caesar. write the CNF

  trytoassasin(marcus,caesar)

  1

• What will happen if two literals are identical?

  Reduced to one

  3

• What will backward chaining algorithm will return?

  Substitutes matching the query

  2

• How this fact “All the KRCE STUDENTS are intelligent” is represented in FOL?

  for all x: student(x,KRCE)->intelligent(x)

  3

• How many literals are available in top-down inductive learning methods

  3

  3

• Which inverts a complete resolution strategy?

  Inverse resolution

  1

• Which method can’t be used for expressing relational knowledge?

  Attribute-based system

  3

• Which approach is used for refining a very general rule through ILP?

  Top-down approach

  1