Artificial Intelligence MCQs

1. Which were built in such a way that humans supply the inputs and interpret the outputs?

   1. Agents
   2. AI system
   3. Sensor
   4. Actuators
   Answer :     Option ( b )

2. The test conducted finds out whether a machine's ability to think is equivalent to, or indistinguishable from, that of a human, known as

   1. Artificial Intelligence
   2. Turing Test
   3. Eliza
   4. None of these
   Answer :     Option ( b )

3. What type of AI system is able to perform a dedicated task with intelligence____?

   1. General AI
   2. Narrow AI
   3. Strong AI
   4. All of these
   Answer :     Option ( b )

4. we have to design an Artificial Intelligence system, which having short period of time and less storage system to store past experience, in which category this AI system falls

   1. Reactive Memory
   2. Limited Memory Type 2
   3. Theory of Mind
   4. none of these
   Answer :     Option ( b )

5. When we have to design an intelligent agents, what instruments are required for perceiving and acting upon the environments?

   1. sensors
   2. actuators
   3. perceivers
   4. both a and b
   Answer :     Option ( d )

6. An agent which is based on current situations and do not perceives from past experience, then the agent is defined as

   1. Goal-based agent
   2. utility based agent
   3. situation action rule
   4. none of these
   Answer :     Option ( c )

7. A function that maps a state or sequence of states, by measuring an agent over the long run based on its happy or unhappy states_____

   1. simple reflex agent
   2. Goal based agent
   3. utility based agent
   4. none of these
   Answer :     Option ( c )

8. If an organization has developed an agent and they have to improve the performance of their agent. Then which approach used to improve their agent performance

   1. perceiving
   2. learning
   3. observing
   4. none of these
   Answer :     Option ( b )

9. Which action sequences are required to accomplish the agent’s goal?

   1. Search
   2. Plan
   3. Retrieve
   4. Both Search & Plan
   Answer :     Option ( d )

10. DFS agents will work in which state space

    1. irreversible state spaces
    2. reversible state spaces
    3. searchable state spaces
    4. all of these
    Answer :     Option ( b )

11. A production system consists of

    1. A set of Rule
    2. A sequence of steps
    3. Directly getting solution
    4. both a and b
    Answer :     Option ( d )

12. Which is the most straightforward method for designing an algorithm?

    1. Best-first search
    2. State-space search
    3. Depth-first search
    4. Hill-climbing search
    Answer :     Option ( b )

13. Control strategy is a strategy by which we come to know which rule is to be applied next during the process of reaching for a solution to a problem and should always cause motion

    1. True
    2. False
    Answer :     Option ( a )

14. The application of rule never prevents the later application of another rule that could also have been applied at the time that the first rule was selected, defined as

    1. Monotonic Production System
    2. Nonmonotonic production system
    3. commutative production system
    4. None
    Answer :     Option ( a )

15. Heuristic function of Best First Search is

    1. f(n) != h(n)
    2. f(n) < h(n)
    3. f(n) = h(n)
    4. f(n) > h(n)
    Answer :     Option ( c )

16. how can the performance of an agent improved if using heuristic search

    1. based on quality of heuristic function
    2. by improving quality of the nodes
    3. both a and b
    4. none
    Answer :     Option ( a )

17. If an intelligent agent using Breadth First Search then what is the time complexity in reaching the desired goal state?

    1. O(b^d)
    2. O(b-d)
    3. O(b)
    4. None of these
    Answer :     Option ( b )

18. depth-first search is that it can get stuck going down the wrong path and should be avoided for search trees with large or infinite maximum depths

    1. True
    2. False
    Answer :     Option ( a )

19. In complete, local search algorithm goal finds if one exists, an optimal algorithm always finds a global minimum/maximum

    1. True
    2. False
    Answer :     Option ( a )

20. If we are using Hill Climbing algorithm then when this algorithm will terminate?

    1. Stopping criterion met
    2. Global Min/Max is achieved
    3. No neighbor has higher value
    4. All of the mentioned
    Answer :     Option ( c )

21. What are the main limitation of hill-climbing search?

    1. Terminates at local maximum & does not find optimum solution
    2. Terminates at global maximum & does not find optimum solution
    3. Does not find optimum solution & fail to find a solution
    4. Fail to find a solution
    Answer :     Option ( a )

22. What is the role of heuristic function?

    1. A function to solve mathematical problems
    2. A function which takes parameters of type string and returns an integer value
    3. A function whose return type is nothing
    4. A function that maps from problem state descriptions to measures of desirability
    Answer :     Option ( d )

23. Which of the Following problems can be solved using Constraints Satisfaction Problems?

    1. 8-Puzzle problem
    2. 8-Queen problem
    3. Map coloring problem
    4. All of the mentioned
    Answer :     Option ( d )

24. If we have to prepare a schedule for a class of student. What type of problem is this?

    1. Search Problem
    2. Backtrack Problem
    3. Constraint Satisfaction Problem
    4. Planning Problem
    Answer :     Option ( c )

25. Make a big jump or randomly select a state far away from the current state. This is a possible solution to overcome issue in

    1. A* Algorithm
    2. Best First Search
    3. Hill Climbing
    4. Generate and test
    Answer :     Option ( c )

26. What is the heuristic function of A* algorithm

    1. f(n) = g(n) != h(n)
    2. f(n) = g(n) < h(n)
    3. f(n) = g(n) + h(n)
    4. f(n) = h(n)
    Answer :     Option ( c )

27. Using A* algorithm find the path with least cost (from a to z).

    
    1. abez
    2. abecfz
    3. adfz
    4. acez
    Answer :     Option ( a )

28. Using Best First Search algorithm find the path with least cost (from a to z)

    
    1. abez
    2. acfz
    3. adfz
    4. acez
    Answer :     Option ( a )

29. Which algorithm can be used in traversing graph and finding path?

    1. A*
    2. C*
    3. D*
    4. E*
    Answer :     Option ( a )

30. if the next state of environment is completely determined by the current state and the actions selected by agents , then this type of agent environment is termed as

    1. accessible
    2. deterministic
    3. episodic
    4. static
    Answer :     Option ( b )

31. Additional information or clue restricts the expansion of only promising nodes in search tree and guides the search in a specific direction towards the goal

    1. True
    2. False
    Answer :     Option ( a )

32. A Heuristic function maps the desirability of a problem state from descriptive to quantitative numbers

    1. yes
    2. no
    Answer :     Option ( a )

33. Compute heuristic function (h(n)) of the given 8 puzzle problem

    
    1. 12
    2. 10
    3. 11
    4. 13
    Answer :     Option ( b )

34. Which two heuristic approaches were used In DENDRAL AI?

    1. hill climbing and Constraint satisfaction technique
    2. A* and generate-test
    3. plan-generate-test and Constraint satisfaction technique
    4. none of these
    Answer :     Option ( c )

35. Which heuristic technique is also termed as OR-graph?

    1. A* algorithm
    2. Hill climbing
    3. both a and b
    4. Best-First Search
    Answer :     Option ( d )

36. Hill climbing is a variant of which heuristic approach

    1. Best First Search
    2. Generate-test
    3. Depth First Search
    4. both b and c
    Answer :     Option ( b )

37. How local maximum problem in Hill climbing can be overcome

    1. Randomly select a state
    2. move in several directions at once
    3. Utilise the backtracking technique
    4. None of these
    Answer :     Option ( c )

38. The heuristic approach which computes distance of current node from start state and distance of current node to goal state

    1. Best First Search
    2. A*
    3. Hill Climbing
    4. All of these
    Answer :     Option ( b )

39. An heuristic algorithm is admissible heuristic if its heuristic function never____

    1. underestimates the cost to reach the goal
    2. overestimate the cost to reach the goal
    3. both a and b
    4. None of these
    Answer :     Option ( b )

40. Which data structure is used in A* algorithm

    1. stack
    2. queue
    3. priority queue
    4. both b and c
    Answer :     Option ( c )

41. If a blind search technique i.e depth first search used to solve an AI problem. Then which data structure is used

    1. LIFO
    2. FIFO
    3. Hash Table
    4. none of these
    Answer :     Option ( a )

42. Artificial Intelligence (AI) is a way to make machines think and behave intelligently. Then these machines are controlled by

    1. Hardware
    2. Software
    3. both a and b
    4. none of these
    Answer :     Option ( b )

43. Which is the first artificial intelligent chatbot

    1. Siri
    2. Tay
    3. Alexa
    4. Eliza
    Answer :     Option ( d )

44. During 1970 to 1980, funding was reduced in the development of AI, then this period is stated as__

    1. cold period
    2. AI cold
    3. AI winter
    4. none of these
    Answer :     Option ( c )

45. Assume that in water jug problem, at a certain state, we required an operation i.e, “empty 3 liter jug by pouring all its water into 4 liter jug”. Then which condition is applied at this state

    1. (x+y,0)
    2. (x-x1,y)
    3. (x,3)
    4. (x,0)
    Answer :     Option ( a )