Artificial Intelligence MCQ (Multiple Choice Questions) - SchoolingAxis

Artificial Intelligence MCQ (Multiple Choice Questions)

 Que- What kind of behavior does the stochastic environment posses? 

a. Local 

b. Deterministic 

c. Rational 

d. Primary   


Ans- Local  


Que- Where does the performance measure is included? 

a. Rational agent 

b. Task environment 

c. Actuators 

d. Sensor   


Ans- Task environment  


Que- Which is used to provide the feedback to the learning element? 

a. Critic 

b. Actuators 

c. Sensor 

d. None of the mentioned   


Ans- Critic  


Que- The main task of a problem-solving agent is 

a.   Solve the given problem and reach to goal 

b.  To find out which sequence of action will get it to the goal state 

c.   All of the mentioned 

d.   None of the mentioned  


Ans-   All of the mentioned  


Que- What is state space? 

a.   The whole problem 

b.   Your Definition to a problem 

c.   Problem you design 

d.   Representing your problem with variable and parameter  


Ans-   Representing your problem with variable and parameter   


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

a. Input, output 

b. Problem, solution 

c. Solution, problem 

d. Parameters, sequence of actions  


Ans- Problem, solution  


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

a. Initial state 

b. Last state 

c. Intermediate state 

d. All of the above  


Ans- Initial state  


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

a. Intermediate states 

b. Initial state 

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

d. None of the mentioned  


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


Que- A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. State whether true or false. 

a. TRUE 

b. FALSE 

c.  Nothing can be said 

d.  None of the mentioned  


Ans- TRUE  


Que- The process of removing detail from a given state representation is called______ 

a. Extraction 

b. Abstraction 

c. Information Retrieval 

d. Mining of data  


Ans- Abstraction  


Que- A problem solving approach works well for 

a. 8-Puzzle problem 

b. 8-queen problem 

c. Finding a optimal path from a given source to a destination 

d. Mars Hover (Robot Navigation)  


Ans- Mars Hover (Robot Navigation)   


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

a. Finding shortest path between a source and a destination 

b. Travelling Salesman problem 

c. Map coloring problem 

d. Depth first search traversal on a given map represented as a graph  


Ans- Travelling Salesman problem  


Que- Web Crawler is a/an 

a. Intelligent goal-based agent 

b. Problem-solving agent 

c. Simple reflex agent 

d. Model based agent  


Ans- Intelligent goal-based agent  


Que- The major component/components for measuring the performance of problem solving 

a. Completeness 

b. Optimality 

c. Time and Space complexity 

d. All of the mentioned  


Ans- All of the mentioned   


Que- A production rule consists of 

a.  A set of Rule 

b. A sequence of steps 

c. Set of Rule & sequence of steps 

d. Arbitrary representation to problem  


Ans- Set of Rule & sequence of steps  


Que- Which search method takes less memory? 

a.  Depth-First Search 

b. Breadth-First search 

c. Linear Search 

d.  Optimal search  


Ans-  Depth-First Search  


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

a.  Linear approach 

b. Heuristic approach (Some knowledge is stored) 

c.  Random approach 

d. An Optimal approach  


Ans- Heuristic approach (Some knowledge is stored)  


Que- Which search strategy is also called as blind search? 

a. Uninformed search 

b. Informed search 

c. Simple reflex search 

d. All of the mentioned   


Ans- Uninformed search  


Que- How many types are available in uninformed search method? 

a. 3 

b. 4 

c. 5 

d. 6 


Ans- 5  


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

a. Depth-first search 

b. Breadth-first search 

c. Bidirectional search 

d. None of the mentioned   


Ans- Breadth-first search  


Que- When is breadth-first search is optimal? 

a. When there is less number of nodes 

b. When all step costs are equal 

c. When all step costs are unequal 

d. None of the mentioned   


Ans- When all step costs are equal  


Que- How many successors are generated in backtracking search? 

a. 1 

b. 2 

c. 3 

d. 4 


Ans- 1  


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

a. O(b) 

b. O(bl) 

c. O(m) 

d. O(bm)   


Ans- O(bm)    


Que- How many parts does a problem consists of? 

a. 1 

b. 2 

c. 3 

d. 4 


Ans- 4  


Que- Which algorithm is used to solve any kind of problem? 

a. Breadth-first algorithm 

b. Tree algorithm 

c. Bidirectional search algorithm 

d. None of the mentioned   


Ans- Tree algorithm  


Que- Which search algorithm imposes a fixed depth limit on nodes? 

a. Depth-limited search 

b. Depth-first search 

c. Iterative deepening search 

d. Bidirectional search   


Ans- Depth-limited search  


Que- Which search implements stack operation for searching the states? 

a. Depth-limited search 

b. Depth-first search 

c. Breadth-first search 

d. None of the mentioned   


Ans- Depth-first search  


Que- Blind searching is general term for 

a.  Informed Search 

b.  Uninformed Search 

c.  Informed &  Unformed Search 

d.  Heuristic Search  


Ans-  Uninformed Search  


Que- Strategies that know whether one non-goal state is "more promising" than another are called 

a.  Informed &  Unformed Search 

b.  Unformed Search 

c.  Heuristic & Unformed Search 

d.  Informed & Heuristic Search  


Ans-  Informed & Heuristic Search   


Que- Which of the following is/are Uninformed Search technique/techniques 

a. Breadth First Search (BFS) 

b. Depth First Search (DFS) 

c. Bidirectional Search 

d. All of the mentioned  


Ans- All of the mentioned   


Que- Which data structure conveniently used to implement BFS? 

a. Stacks 

b. Queues 

c. Priority Queues 

d. All of the mentioned  


Ans- Queues  


Que- Which data structure conveniently used to implement DFS? 

a. Stacks 

b. Queues 

c. Priority Queues 

d. All of the mentioned  


Ans- Stacks  


Que- 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.) 

a. O(bd+1) and O(bd+1) 

b. O(b2) and O(d2) 

c. O(d2) and O(b2) 

d. O(d2) and O(d2)  


Ans- O(bd+1) and O(bd+1)  


Que- Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. State whether true or false. 

a. TRUE 

b. False  

c. Nothing can be said 

d. None of the mentioned 


Ans- False   


Que- uniform-cost search expands the node n with the__________ 

a. Lowest path cost 

b. Heuristic cost 

c. Highest path cost 

d. Average path cost  


Ans- Lowest path cost  


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

a. Shallowest 

b. Child node 

c. Deepest 

d. Minimum cost  


Ans- Deepest  


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

a. Shallowest 

b. Child node 

c. Deepest 

d. Minimum cost  


Ans- Shallowest  


Que- Optimality of BFS is 

a. When there is less number of nodes 

b. When all step costs are equal 

c. When all step costs are unequal 

d. None of the mentioned  


Ans- When all step costs are equal  


Que- LIFO is ______ where as FIFO is ________ 

a. Stack, Queue 

b. Queue, Stack 

c. Priority Queue, Stack 

d. Stack. Priority Queue  


Ans- Stack, Queue  


Que- When the environment of an agent is partially observable in search space following problem/problems could occur. 

a. Sensorless problems: If the agent has no sensors at all, then (as far as it knows) it could be in one of several possible initial states, and each action might therefore lead to one of several possible successor states 

b. Contingency problems: If the environment is partially observable or if actions are uncertain, then the agent's percepts provide new information after each action. Each possible percept defines a contingency that must be planned for. A problem is called adversarial if the uncertainty is caused by the actions of another agent 

c. Exploration problems: When the states and actions of the environment are unknown, the agent must act to discover them. Exploration problems can be viewed as an extreme case of contingency problems 

d. All of the mentioned  


Ans- All of the mentioned   


Previous Post Next Post

Responsive Ad