0% found this document useful (0 votes)
11 views6 pages

Cat I Ai 2025

The document contains multiple-choice questions (MCQs) and short answer questions related to Artificial Intelligence (AI), covering topics such as definitions, goals, types of AI, search algorithms, and agent structures. It includes questions about the history of AI, applications, and specific algorithms like Breadth-First Search and A* Search. Additionally, it provides definitions and comparisons between various AI concepts and methods.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views6 pages

Cat I Ai 2025

The document contains multiple-choice questions (MCQs) and short answer questions related to Artificial Intelligence (AI), covering topics such as definitions, goals, types of AI, search algorithms, and agent structures. It includes questions about the history of AI, applications, and specific algorithms like Breadth-First Search and A* Search. Additionally, it provides definitions and comparisons between various AI concepts and methods.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

AI MCQS

1. What is Artificial Intelligence?

A) Programming logic B) Mimicking human intelligence

C) Database management D) Spreadsheet analysis

2. Which of the following is not a goal of AI?

A) Problem-solving B) Automation

C) Memory upgrade D) Reasoning

3. The term AI was first coined by:

A) Alan Turing B) John McCarthy

C) Marvin Minsky D) Charles Babbage

4. Which of these is not an application of AI?

A) Face recognition B) Online banking

C) Medical diagnosis D) Expert systems

5. What are the types of AI based on capabilities?

A) Narrow, General, Super B) Static and Dynamic

C) Weak and Strong D) Machine and Human.

6. Which is not a component of AI?

A) Learning B) Reasoning

C) Decision Making D) File Compression

7. Which of the following best describes Machine Intelligence?

A) Always logical B) Emotional-based decisions

C) Hard-coded programs D) Learning from data

8. AI Agents interact with:

A) Only databases B) Their own code


C) The environment D) Programming tools

9. An agent is considered rational if it:

A) Thinks like humans B) Acts optimally to achieve goals

C) Uses natural language D) Mimics all human errors

10. Which is not part of the agent structure?

A) Sensors B) Actuators

C) Compiler D) Performance measure

11. Which agent acts without consulting the environment again?

A) Model-based B) Reflex agent

C) Goal-based D) Utility-based

12. In AI, environment refers to:

A) Nature or surroundings B) Where an agent performs actions

C) Only weather conditions D) Server setup

13. The environment in chess game is:

A) Partially observable B) Fully observable

C) Stochastic D) Dynamic

14. AI aims to create:

A) Fast computers B) Smart machines

C) Databases D) Compilers

15. A smart assistant like Siri is an example of:

A) Super AI B) Narrow AI

C) General AI D) Reactive AI

16. Which of these is a blind search technique?

A) A* search B) Depth-first search


C) Best-first search D) Heuristic search

17. In Breadth-First Search, nodes are expanded:

A) Based on cost B) In a zigzag manner

C) Level by level D) Randomly

18. Uniform Cost Search expands:

A) Closest goal node B) Cheapest cost node

C) Deepest node D) Random node

19. Depth-first search may get stuck in:

A) Optimal solution B) Infinite loop

C) Heuristic trap D) Breadth levels

20. Bidirectional search reduces:

A) Time B) Accuracy

C) Memory D) Both A and C

21. A* Search combines:

A) BFS + DFS B) Heuristic + cost function

C) Random + Uniform D) Agent + Environment

22. Which function is used in A* Search?

A) f(n) = g(n) + h(n) B) f(n) = h(n) - g(n)

C) f(n) = g(n) / h(n) D) f(n) = g(n) × h(n)

23. Best-First Search uses:

A) Cost only B) Heuristic only

C) Depth only D) Random choice

24. Heuristic function provides:

A) Exact cost B) Estimated cost to goal


C) Random move D) Past move analysis

25. A node’s depth means:

A) Number of children B) Level in tree

C) Its cost D) Heuristic value

26. In search trees, a node with no children is called:

A) Parent B) Leaf node

C) Heuristic node D) Root

27. Which search method guarantees the shortest path (if cost is same)?

A) Depth-first B) Uniform Cost

C) Breadth-first D) Both B and C

28. Which search is memory-efficient but not optimal?

A) DFS B) BFS

C) A* D) UCS

29. What does g(n) represent in A*?

A) Goal node B) Cost from start to node n

C) Heuristic cost D) Path length

30. What is the main drawback of BFS?

A) Slow B) High memory usage

C) Incorrect results D) Needs heuristic

2 MARKS

1. Define Artificial Intelligence.

→ Artificial Intelligence is the branch of computer science that aims to create machines that can
mimic human intelligence such as learning, reasoning, and problem-solving.
2. List any four goals of Artificial Intelligence.

→ Learning, Reasoning, Problem-solving, and Perception.

3. Differentiate between Human Intelligence and Machine Intelligence.

→ Human intelligence is emotional, adaptable, and experiential, while machine intelligence is


logical, data-driven, and task-specific.

4. What is an intelligent agent?

→ An agent that perceives its environment through sensors and acts upon that environment using
actuators to achieve specific goals.

5. Write any two differences between Simple Reflex Agents and Model-Based Agents.

→ Reflex Agents act only on current percepts; Model-Based Agents use internal models to make
decisions based on past and present percepts.

6. What is a search algorithm in AI?

→ A search algorithm is a method used to navigate through problem spaces to find a solution path
from the initial state to the goal state.

7. Define Breadth-First Search.

→ BFS is a search algorithm that explores all nodes at the present depth level before moving to the
next level.

8. Mention two advantages of A search.*

→ It is both complete and optimal when using an admissible heuristic.

9. What is a heuristic function?

→ A heuristic function estimates the cost from the current node to the goal node in a search
algorithm.

10. Differentiate between Depth-First Search and Breadth-First Search.

→ DFS goes deep into the tree first, using less memory; BFS explores level by level but uses more
memory.

You might also like