AI & Machine Learning

AI Fundamentals — Practice MCQs for CCAT

20 Questions Section B: Programming AI & Machine Learning

Practice 20 AI Fundamentals multiple-choice questions designed for CDAC CCAT exam preparation. Click "Show Answer" to reveal the correct option with detailed explanation.

Q1.
Artificial Intelligence (AI) is the simulation of:
AHuman physical strength
BHuman intelligence by machines
CNatural phenomena
DChemical reactions
Show Answer & Explanation

Correct Answer: B — Human intelligence by machines

AI involves creating systems that can perform tasks that typically require human intelligence.

Q2.
The Turing Test evaluates:
AComputer speed
BWhether a machine can exhibit intelligent behavior indistinguishable from human
CMemory capacity
DNetwork latency
Show Answer & Explanation

Correct Answer: B — Whether a machine can exhibit intelligent behavior indistinguishable from human

The Turing Test, proposed by Alan Turing, tests if a machine's responses are indistinguishable from a human's.

Q3.
Which is an example of Narrow AI?
AA robot with consciousness
BSpam email filter
CAI with human-level intelligence
DSelf-aware AI
Show Answer & Explanation

Correct Answer: B — Spam email filter

Narrow AI (Weak AI) is designed for specific tasks like spam filtering, chess playing, or voice assistants.

Q4.
General AI (AGI) refers to:
AAI for a single task
BAI with human-level intelligence across all domains
CAI for gaming only
DAI for data storage
Show Answer & Explanation

Correct Answer: B — AI with human-level intelligence across all domains

Artificial General Intelligence (AGI) would have human-level intelligence and ability to learn any intellectual task.

Q5.
Expert systems are based on:
ANeural networks
BKnowledge base and inference rules
CGenetic algorithms
DRandom decisions
Show Answer & Explanation

Correct Answer: B — Knowledge base and inference rules

Expert systems use knowledge bases and inference engines to emulate decision-making of human experts.

Q6.
Heuristic in AI refers to:
AExact algorithm
BProblem-solving approach using practical methods
CDatabase query
DNetwork protocol
Show Answer & Explanation

Correct Answer: B — Problem-solving approach using practical methods

Heuristics are practical problem-solving approaches that may not be optimal but are sufficient for immediate goals.

Q7.
Search algorithms in AI are used for:
AData compression
BFinding solutions in problem spaces
CImage display
DAudio playback
Show Answer & Explanation

Correct Answer: B — Finding solutions in problem spaces

Search algorithms explore problem spaces to find solutions, paths, or optimal states.

Q8.
A* algorithm is known for:
ASorting data
BOptimal pathfinding using heuristics
CEncryption
DCompression
Show Answer & Explanation

Correct Answer: B — Optimal pathfinding using heuristics

A* is a best-first search algorithm that finds optimal paths using heuristics to guide the search.

Q9.
Knowledge representation in AI involves:
ADeleting knowledge
BEncoding information for reasoning
CHiding data
DNetwork routing
Show Answer & Explanation

Correct Answer: B — Encoding information for reasoning

Knowledge representation encodes information in a form that AI systems can use for reasoning and inference.

Q10.
Intelligent agents in AI:
AOnly observe
BPerceive environment and take actions to achieve goals
COnly store data
DOnly transmit data
Show Answer & Explanation

Correct Answer: B — Perceive environment and take actions to achieve goals

Intelligent agents perceive their environment through sensors and act upon it through actuators to achieve goals.

Q11.
PEAS in AI agent design stands for:
APerformance, Environment, Actuators, Sensors
BProgram, Execute, Analyze, Store
CPlan, Evaluate, Act, Sense
DProcess, Extract, Apply, Save
Show Answer & Explanation

Correct Answer: A — Performance, Environment, Actuators, Sensors

PEAS describes an agent's Performance measure, Environment, Actuators, and Sensors.

Q12.
Fuzzy logic handles:
AOnly true or false values
BDegrees of truth between 0 and 1
COnly integers
DOnly negative values
Show Answer & Explanation

Correct Answer: B — Degrees of truth between 0 and 1

Fuzzy logic deals with degrees of truth rather than strict true/false, handling uncertainty and vagueness.

Q13.
Genetic algorithms are inspired by:
AHuman brain
BBiological evolution
CChemical reactions
DPhysical laws
Show Answer & Explanation

Correct Answer: B — Biological evolution

Genetic algorithms use concepts from natural evolution: selection, crossover, and mutation to solve optimization problems.

Q14.
The Chinese Room argument challenges:
AComputer speed
BWhether computers can truly understand
CNetwork security
DData storage
Show Answer & Explanation

Correct Answer: B — Whether computers can truly understand

Searle's Chinese Room argues that symbol manipulation (like programs) doesn't constitute genuine understanding.

Q15.
Planning in AI involves:
ARandom actions
BGenerating sequence of actions to achieve goals
COnly data storage
DOnly user input
Show Answer & Explanation

Correct Answer: B — Generating sequence of actions to achieve goals

AI planning generates sequences of actions that transform an initial state into a desired goal state.

Q16.
Constraint satisfaction problems (CSP) are solved by:
ARandom guessing
BAssigning values to variables satisfying all constraints
CDeleting constraints
DIgnoring variables
Show Answer & Explanation

Correct Answer: B — Assigning values to variables satisfying all constraints

CSPs find assignments to variables that satisfy all constraints, used in scheduling, puzzles, etc.

Q17.
Breadth-first search explores:
ADeepest nodes first
BAll nodes at current depth before deeper levels
CRandom nodes
DOnly leaf nodes
Show Answer & Explanation

Correct Answer: B — All nodes at current depth before deeper levels

BFS explores all nodes at the current depth level before moving to the next depth level.

Q18.
Depth-first search uses:
AQueue data structure
BStack data structure
CHash table
DBinary tree only
Show Answer & Explanation

Correct Answer: B — Stack data structure

DFS uses a stack (or recursion) to explore as far as possible along each branch before backtracking.

Q19.
Minimax algorithm is used in:
AData compression
BGame playing (adversarial search)
CImage processing
DAudio processing
Show Answer & Explanation

Correct Answer: B — Game playing (adversarial search)

Minimax is used in two-player games to minimize the maximum possible loss (optimal adversarial play).

Q20.
Alpha-beta pruning improves minimax by:
AExploring more nodes
BEliminating branches that won't affect the outcome
CAdding random moves
DIgnoring the opponent
Show Answer & Explanation

Correct Answer: B — Eliminating branches that won't affect the outcome

Alpha-beta pruning eliminates branches that cannot influence the final decision, reducing search space.