# Artificial Intelligence and Robotics mcqs unit 2

## Artificial intelligence and robotics mcq questions and answers

1. Which of the Following problems can be modeled as CSP?

1. 8-Puzzle problem
2. 8-Queen problem
3. Map coloring problem
4. All of the mentioned

All of the mentioned

2. What among the following constitutes to the incremental formulation of CSP?

1. Path cost
2. Goal cost
3. Successor function
4. All of the mentioned

All of the mentioned

3. 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.

1. Forward search
2. Backtrack search
3. Hill algorithm
4. Reverse-Down-Hill search

Backtrack search

4. To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ______

1. Forward Searching
2. Constraint Propagation
3. Backtrack after a forward search
4. Omitting the constraints and focusing only on goals

Forward Searching

5. The BACKTRACKING-SEARCH algorithm 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 called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure

1. True
2. False

True

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

1. Search Problem
2. Backtrack Problem
3. CSP
4. Planning Problem

CSP

7. Constraint satisfaction problems on finite domains are typically solved using a form of ___

1. Search Algorithms
2. Heuristic Search
3. Greedy Search
4. All of the mentioned

All of the mentioned

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

1. P complete
2. NP complete
3. NP hard
4. Domain dependent

NP complete

9. _____ 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.

1. Static CSPs
2. Dynamic CSPs
3. Flexible CSPs
4. None of the mentioned

Dynamic CSPs

10. Flexible CSPs relax on _____

1. Constraints
2. Current State
3. Initial State
4. Goal State

Constraints

## air mcq questions SPPU | air mcq with answers

11. Language/Languages used for programming Constraint Programming includes __

1. Prolog
2. C#
3. C
4. Fortrun

Prolog

12. Backtracking is based on __

1. Last in first out
2. First in first out
3. Recursion
4. Both Last in first out & Recursion

Both Last in first out & Recursion

13. Constraint Propagation technique actually modifies the CSP problem.

1. True
2. False

True

14. When do we call the states are safely explored?

1. A goal state is unreachable from any state
2. A goal state is denied access
3. A goal state is reachable from every state
4. None of the mentioned

A goal state is reachable from every state

15. Which of the following algorithm is generally used CSP search algorithm

2. Depth-first search algorithm
3. Hill-climbing search algorithm
4. None of the mentioned

Depth-first search algorithm

16. CSPs are –

1. an alternative formulation for general problem solving method
2. ways of formulating problems using variables and constraints
3. problems that come in the way of satisfying constraints
4. problems that arise after constraint satisfaction

an alternative formulation for general problem solving method

17. A constraint is

1. something that prevents an algorithm from solving a problem.
2. a restriction on what values the variables in the problem can take.
3. a limitation of the problem solving approach.
4. none of the above.

a restriction on what values the variables in the problem can take.

18. A Binary CSP is

1. a CSP with only two variables.
2. a CSP where each variable can take only two values.
3. a CSP with only two constraints.
4. a CSP where the size of the scope of every constraint is two.

a CSP where the size of the scope of every constraint is two.

19. A CSP with only soft constraints, also called preferences

1. has only solutions with all constraints satisfied.
2. may have not any solution at all.
3. can have more than one solution with different associated costs
4. none of the above

can have more than one solution with different associated costs

## Artificial intelligence mcqand robotics mcqs questions

20. Searching using query on Internet is, use of _____ type of agent

1. Offline agent
2. Online agent
3. Both Offline & Online agent
4. Goal Based & Online agent

Goal Based & Online agent

21. Mark two main features of Genetic Algorithm

1. Fitness function & Crossover techniques
2. Crossover techniques & Random mutation
3. Individuals among the population & Random mutation
4. Random mutation & Fitness function

Fitness function & Crossover techniques

22. Optimality of BFS is

1. When there is less number of nodes
2. When all step costs are equal
3. When all step costs are unequal
4. one of the mentioned

When all step costs are equal

23. A production rule consists of

1. A set of Rule
2. A sequence of steps
3. Set of Rule & sequence of steps
4. Arbitrary representation to problem

Set of Rule & sequence of steps

24. The major component/components for measuring the performance of problem solving

1. Completeness
2. Optimality
3. Time and Space complexity
4. All of the mentioned

All of the mentioned

27. The main task of a problem-solving agent is

1. Solve the given problem and reach to goal
2. To find out which sequence of action will get it to the goal state
3. All of the mentioned
4. None of the mentioned

All of the mentioned

28. The process by which the brain orders actions needed to complete a specific task is referred as __

1. Planning problem
2. Partial order planning
3. Total order planning
4. Both Planning problem & Partial order planning

Both Planning problem & Partial order planning

29. The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of __

1. Planning problem
2. Partial Order planning problem
3. Total order planning
4. None of the mentioned

Planning problem

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

1. Stacks
2. Queue
3. BST (Binary Search Tree)
4. Planning Graphs

Planning Graphs

31. Planning graphs consists of __

1. a sequence of levels
2. a sequence of levels which corresponds to time steps in the plan
3. a sequence of actions which corresponds to the state of the system
4. none of the mentioned

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

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

1. BFS/DFS
2. A*
3. Graph-Plan
4. Greedy

Graph-Plan

32. Planning graphs works only for prepositional planning problems.

1. True
2. False

True

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

1. Polarization
2. Linearization
3. Solarization
4. None of the mentioned

Linearization

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

1. Search & Logic
2. Logic & Knowledge Based Systems
3. FOL & Logic
4. Knowledge Based Systems

Search & Logic

36. Which of the following are action langauges

1. STRIP
3. All of the mentioned
4. None of the mentioned

All of the mentioned

25. Web Crawler is a/an

1. Intelligent goal-based agent
2. Problem-solving agent
3. Simple reflex agent
4. Model based agent

Intelligent goal-based agent

26. What is state space?

1. The whole problem
2. Your Definition to a problem
3. Problem you design
4. Representing your problem with variable and parameter