Artificial Intelligence MCQ's | AI Unit 2 MCQ's | WaoFamHub

TheWaoFam 0 Comments

Artificial Intelligence MCQ's With Answers

Artificial Intelligence

AI UNIT 2 MCQ'S


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

  1. Needy local search  
  2. Heuristic local search 
  3. Greedy local search 
  4. Optimal local search

Ans : Greedy local search

2. blind search is also called as ________. 

  1. Uninformed search 
  2. Informed search  
  3. Simple reflex search 
  4. initial Search

Ans : Uninformed search 

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

  1. Input, output 
  2. Problem, solution 
  3. Solution, problem  
  4. Parameters, sequence of actions

Ans : Problem, solution 

4. an intellignret agent act to increase their ________ 

  1. Knowledge 
  2. Performance measure
  3. Database mesure 
  4. Goal Measure

Ans : Performance measure

5. Which search method takes less memory?  

  1. Breadth-First search  
  2. Depth-First Search  
  3. Optimal search 
  4. Linear Search

Ans : Depth-First Search  

6. To solve a problem which 2 phase of formulation it should pass? 

  1. Goal,Start 
  2. Goal,Problem 
  3. Path,Goal 
  4. Path,Problem

Ans : Goal,Problem

7. To solve problem using AI, Process consist of ___ steps. 

  1. 2 
  2. 4 
  3. 5 
  4. 6

Ans : 5

8. Which one of the followings is not a part of process for solving problem using AI 

  1. Defining the problem 
  2. Analysing the problem
  3. Implemenation 
  4. sensorless planning

Ans : sensorless planning

9. A* search strategy comes under ____. 

  1. Uninformed search 
  2. Blind Search 
  3. Informed Search 
  4. Classical Search

Ans : Informed Search 

10. In BFS the frontier is implemented as a ________ queue. 

  1. FIFO 
  2. LIFO 
  3. FILO 
  4. Random

Ans : FIFO

11. Hill climbing Search algorithm works like _________ algorithm. 

  1. AI 
  2. A* 
  3. Hilltop 
  4. Generate and test

Ans : Generate and test

12. When is breadth-first search is optimal? 

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

Ans : When all step costs are equal 

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

  1. f(n) = h(n) 
  2. f(n) > h(n) 
  3. f(n) != h(n) 
  4. f(n) < h(n)

Ans : f(n) = h(n) 

14. Evaluation function for A* is f(n)=__+__ . 

  1. h(n)+h(m) 
  2. h(n)+g(n) 
  3. h(n)+c(n) 
  4. g(n)+h(m)

Ans : h(n)+g(n)

15. Greedy approach in hill climbing means choosing best possible ________ solution. 

  1. Hilltop 
  2. Complex 
  3. Otimal 
  4. Nearest

Ans : Nearest

16. ___________ behavior means something which can be determined with set of logicla proofs and actios. 

  1. Smart 
  2. Bounded 
  3. Deterministic 
  4. Ridge

Ans : Ridge

17. simulated annealing is an efective and general form of ____________. 

  1. Optimization 
  2. Hill climbing 
  3. Inspiration 
  4. Agent

Ans : Optimization

18. AND/OR is implemented in the ______________ problem 

  1. Deterministic 
  2. Non-Deterministic 
  3. Otimal 
  4. Hill Climbing

Ans : Non-Deterministic 

19. "___________ based on the current situation and the agent’s performance measure, is the first step in problem solving." 

  1. Goal formulation 
  2. Problem formulation 
  3. Performance Measuring 
  4. Performance dectection

Ans : Goal formulation

20. ____________is the process of deciding what actions and states to consider, given a goal 

  1. Goal formulation 
  2. Problem formulation
  3. Performance Measuring 
  4. Performance dectection

Ans : Problem formulation

21. The process of looking for a sequence of actions that reaches the goal is called ____________. 

  1. Initial 
  2. state 
  3. search state 
  4. execution

Ans : state

22. "A search algorithm takes a ________ as input and returns a _________in the form of an action sequence." 

  1. data, problem 
  2. problem, data 
  3. data, solution 
  4. problem, solution 

Ans : problem, solution 

23. Once the solution has been executed, the agent will formulate a ___________. 

  1. solution 
  2. problem 
  3. new goal  
  4. data

Ans : new goal  

24. The ___________ state that the agent starts in.

  1. Initial 
  2. goal 
  3. basic 
  4. ongoing

Ans : Initial

25. A _________ in the state space is a sequence of states connected by a sequence of actions. 

  1. action 
  2. path 
  3. root 
  4. node

Ans : path

26. Solution quality is measured by the path cost function, and __________ has the lowest path cost among all solutions. 

  1. path cost 
  2. a minimum cost 
  3. an optimal solution  
  4. a final solution

Ans : an optimal solution

27. The process of removing detail from a representation is called _______. 

  1. abstraction 
  2. initialisation 
  3. deletion 
  4. inheritance

Ans : abstraction

28. In 8 puzzle problem, A state description specifies the location of each of the _______ tiles and the blank in one of the ____ squares. 

  1. nine, eight 
  2. eight, zero  
  3. nine, zero 
  4. eight, nine

Ans : eight, nine

29. The 8-puzzle belongs to the family of __________, which are often used as test problems for new search algorithms in AI. 

  1. sliding-window puzzles 
  2. moving dice puzzle 
  3. sliding-block puzzles 
  4. shifting-block puzzle

Ans : sliding-block puzzles 

30. ___________ involves operators that augment the state description, starting with an empty state; for the 8-queens problem, this means that each action adds a queen to the state. 

  1. The problem formulation 
  2. The Goal formulation 
  3. An incremental formulation  
  4. A complete-state formulation

Ans : An incremental formulation  

31. ___________ starts with all 8 queens on the board and moves them around 

  1. The problem formulation 
  2. The Goal formulation 
  3. An incremental formulation  
  4. A complete-state formulation

Ans : A complete-state formulation

32. A ___________ requires positioning millions of components and connections on a chip to minimize area, minimize circuit delays, minimize stray capacitances, and maximize manufacturing yield. 

  1. VLSI layout problem 
  2. A Searching problem 
  3. Depth First Search 
  4. A BFS 

Ans : VLSI layout problem 

33. The layout problem comes after the logical design phase and is usually split into two part are _________, ___________. 

  1. Cell layout and form layout 
  2. Cell layout and channel routing 
  3. Form layout and channel routing 
  4. Table layout and cell layout

Ans : Cell layout and channel routing 

34. Automatic assembly sequencing of complex objects by a robot was first demonstrated __________ in 1972. 

  1. Johnson and Story 
  2. Noyes Chapman 
  3. Slocum and Sonneveld 
  4. Freddy

Ans : Freddy

35. In searching tree, The set of all leaf nodes available for expansion at any given point is called the ______. 

  1. frontier leaf 
  2. node 
  3. loopy path 
  4. child node

Ans : frontier leaf 

36. __________ is a simple strategy in which the root node is expanded first, then all the successors of the root node are expanded next, then their successors, and so on. 

  1. Breadth-first search 
  2. Depth-first search 
  3. Depth -limited search 
  4. Bidirectiional search

Ans : Breadth-first search 

37. __________ is an instance of the general graph-search algorithm in which the shallowest unexpanded node is chosen for expansion. 

  1. Breadth-first search 
  2. Depth-first search 
  3. Depth -limited search 
  4. Bidirectiional search

Ans : Breadth-first search 

38. Instead of expanding the shallowest node, ________ expands the node n with the lowest path cost g(n). 

  1. uniform-cost search  
  2. Depth-first search 
  3. Depth -limited search 
  4. Bidirectiional search

Ans : uniform-cost search  

39. __________ tries to expand the node that is closest to the goal, on the grounds that this is likely to lead to a solution quickly. 

  1. Greedy best-first search 
  2. Breadth-first search 
  3. Depth -limited search 
  4. Bidirectiional search

Ans : Greedy best-first search

40. The agent can construct sequences of actions that achieve its goals; this process is called ______. 

  1. construction 
  2. search 
  3. execution 
  4. backtracking

Ans : search

41. _________expands the node with lowest path cost, g(n), and is optimal for general step costs. 

  1. uniform-cost search  
  2. Depth-first search 
  3. Depth -limited search 
  4. Bidirectiional search

Ans : uniform-cost search  

42. _________ expands the deepest unexpanded node first. It is neither complete nor optimal, but has linear space complexity. 

  1. Breadth-first search 
  2. Depth-first search 
  3. Depth -limited search 
  4. Bidirectiional search

Ans : Depth-first search 

43. _________ can enormously reduce time complexity, but it is not always applicable and may require too much space. 

  1. Breadth-first search 
  2. Depth-first search 
  3. Depth -limited search 
  4. Bidirectiional search

Ans : Bidirectiional search


<< AI Unit 1                                  AI Unit 3 >>

Thank You : Sourabh Patil
Tags

Post a Comment

Post a Comment

Previous Post Next Post