Remember (Knowledge):

What is the fundamental concept behind problem solving by search?

Can you list some examples of intelligent agents?

Name one purpose of uninformed search strategies.

What is the key idea behind breadth-first search?

Give an example of a heuristic function used in informed search.

Understand (Comprehension): 6. Explain the process of problem solving by search.

How do problem-solving agents differ from other types of agents?

Why is uniform cost search important in problem-solving agents?

What is the main difference between depth-first search and iterative deepening
depth-first search?

How do informed (heuristic) search strategies differ from uninformed strategies?

Describe the concept of simulated annealing search.

Apply (Application): 12. Given a problem scenario, how would you choose between
depth-first search and breadth-first search as a search strategy?

Can you design a heuristic function for a specific problem-solving task?

In a specific problem domain, how might you apply bidirectional search to find a
solution?

How can you adapt hill-climbing search to handle problems with non-deterministic
actions?

Apply the A* search algorithm to find the optimal path in a grid-based maze.

Analyze (Analysis): 17. Compare and contrast depth-first search and breadth-first
search in terms of their advantages and disadvantages.

Analyze the role of heuristic functions in informed search algorithms.

Evaluate the limitations of uninformed search strategies in solving complex

problems.

Assess the potential benefits and drawbacks of bidirectional search in different

problem domains.
What are the trade-offs between using simulated annealing search and hill-
climbing search in optimization problems?

Evaluate (Evaluation): 22. Critically evaluate the efficiency of A* search compared

to other informed search algorithms.

Assess the practical applications of uninformed search strategies in real-world

scenarios.

Compare the effectiveness of greedy best-first search and A* search in finding

optimal solutions.

Evaluate the use of partial observations in search problems and its impact on
agent performance.

Critique the challenges and advantages of using online search agents in unknown
environments.

Create (Synthesis): 27. Design a problem-solving agent that combines elements of

depth-first search and uniform cost search for a specific task.

Create a new heuristic function for a well-known problem and explain its rationale.

Develop a novel search strategy that combines aspects of hill-climbing and

simulated annealing for a specific optimization problem.

Propose an innovative approach to handling non-deterministic actions in search

problems using heuristic guidance.

These questions cover a range of cognitive levels in Bloom's Taxonomy, from

basic knowledge recall to higher-order thinking and problem-solving skills.

Remember (Knowledge):

What is search in the context of problem-solving?

Define intelligent agents and their role in problem solving.

Name two examples of uninformed search strategies.

What is the primary objective of informed search algorithms?

Can you provide an example of a heuristic function used in A* search?

Understand (Comprehension): 6. Explain how problem-solving agents work and

their significance.

How do uninformed search strategies differ from informed ones in terms of their
approach to problem solving?
What is the main idea behind depth-first search, and when might it be a suitable
choice for a problem?

Describe the concept of simulated annealing search and its relevance in solving
complex problems.

How do online search agents adapt to unknown environments?

Apply (Application): 11. Given a problem scenario, which search strategy would
you apply, and why?

Design a heuristic function for a hypothetical pathfinding problem in a grid.

Apply the principles of uniform cost search to find the optimal route between two
cities on a map.

How would you implement iterative deepening depth-first search for a specific
problem with a large state space?

Apply the concept of bidirectional search to find a solution for a puzzle with two
starting and goal states.

Analyze (Analysis): 16. Compare and contrast the advantages and disadvantages
of breadth-first search and depth-first search.

Analyze the role of heuristic functions in guiding informed search algorithms

toward solutions.

Evaluate the limitations of uninformed search strategies in complex problem

domains.

Assess the efficiency and trade-offs of using iterative deepening depth-first search
compared to other search strategies.

Examine the differences between greedy best-first search and A* search in terms
of their optimality and admissibility.

Evaluate (Evaluation): 21. Critically evaluate the strengths and weaknesses of A*

search when used in real-world applications.

Assess the practical uses of uninformed search strategies in various problem-

solving scenarios.

Compare and contrast the effectiveness of heuristic-based informed search

strategies in terms of optimality and efficiency.

Evaluate the impact of partial observations on the performance of agents in search

problems.
Critique the challenges and potential benefits of implementing unknown
environment adaptation in online search agents.

Create (Synthesis): 26. Design an innovative problem-solving agent that combines

elements of breadth-first search and uniform cost search for a specific problem
domain.

Create a novel heuristic function for a well-known problem and justify its selection.

Develop a unique search strategy that merges aspects of hill-climbing and

simulated annealing for an optimization problem.

Propose an original approach for handling non-deterministic actions in search

problems using heuristic guidance and evaluate its effectiveness.

Invent a new type of online search agent specifically designed for adapting to
unknown environments and outline its key features.

Topic 1: Artificial Neural Networks-1

Remembering:

What is the basic concept of an artificial neural network?

Can you recall the components of a neural network?

Understanding: 3. How do artificial neural networks represent

information?

What types of problems are well-suited for neural network learning?

Applying: 5. Can you provide an example of a real-world problem that

can be solved using neural networks?

How are perceptrons used in neural network architectures?

Analyzing: 7. What are the limitations of single-layer perceptrons in

solving complex problems?

Explain the structure and purpose of multilayer neural networks.

Evaluating: 9. What are the advantages and disadvantages of using the

back-propagation algorithm in training neural networks?

Compare and contrast neural network learning with other machine

learning techniques.
Topic 2: Artificial Neural Networks-2
Remembering:

What is the back-propagation algorithm in neural networks?

Can you recall the key components of a face recognition system using
neural networks?

Understanding: 3. How does the back-propagation algorithm work in

training neural networks?

What are the advanced topics in artificial neural networks that go

beyond the basics?

Applying: 5. Can you provide an illustrative example of how back-

propagation is used in face recognition?

How can neural networks be applied to solve complex, real-world

problems?

Analyzing: 7. What are the potential challenges and limitations of using

back-propagation in neural networks?

Compare different approaches to face recognition, highlighting the

strengths and weaknesses.

Evaluating: 9. What are some cutting-edge developments and research

areas in artificial neural networks beyond the basics?

Evaluate the effectiveness of different advanced techniques in neural

network applications.

Topic 3: Evaluation Hypotheses

Remembering:

What is the motivation behind evaluating hypotheses in machine

learning?

Can you recall the basic concepts of estimation hypothesis accuracy?

Understanding: 3. How does sampling theory contribute to the
evaluation of hypotheses in machine learning?

What is the significance of confidence intervals in hypothesis evaluation?

Applying: 5. Can you demonstrate the general approach for deriving

confidence intervals in a specific context?

How do you apply the difference in error of two hypotheses to make

decisions in machine learning?

Analyzing: 7. What are the potential sources of bias and error in

hypothesis evaluation?

Compare and contrast different techniques for comparing learning

algorithms.

Evaluating: 9. Assess the impact of sample size and sampling methods

on the accuracy of hypothesis evaluation.

Critically evaluate the strengths and weaknesses of various approaches

to hypothesis evaluation in machine learning.

Define Bayesian learning.

Explain the relationship between probability and Bayesian learning.

Describe the key components of Bayes' theorem.

Explain how Bayes' theorem is used in probabilistic reasoning.

Provide an example of Bayesian learning in real-life applications.

Maximum Likelihood and Least Squared Error Hypotheses: 6. Define

Maximum Likelihood (ML) and its importance in statistics.

Explain how ML is used to estimate parameters in a statistical model.

Describe the least squared error hypothesis in the context of linear

regression.

Compare and contrast Maximum Likelihood and least squared error

approaches.
Provide an example illustrating the use of Maximum Likelihood
estimation.

Maximum Likelihood Hypotheses for Predicting Probabilities: 11.

Explain how Maximum Likelihood can be used to estimate probability
distributions.

Describe the concept of Maximum Likelihood estimation for categorical

data.

Discuss the applications of Maximum Likelihood in machine learning.

Minimum Description Length Principle: 14. Define the Minimum

Description Length (MDL) principle.

Explain how MDL is used for model selection and compression.

Provide an example of applying the MDL principle to a real-world

problem.

Bayes Optimal Classifier and Gibbs Algorithm: 17. Define the Bayes
optimal classifier.

Explain the principles behind the Bayes optimal decision rule.

Describe the Gibbs algorithm and its use in Bayesian sampling.

Naïve Bayes Classifier: 20. Explain the concept of the Naïve Bayes
classifier.

Describe the assumptions and simplifications made in Naïve Bayes.

Provide an example of using Naïve Bayes for text classification.

Learning to Classify Text: 23. Explain the challenges and goals of text
classification.

Describe the steps involved in training a text classifier.

Discuss the evaluation metrics used in text classification.

Bayesian Belief Networks: 26. Define Bayesian belief networks and their
components.
Explain how Bayesian belief networks represent probabilistic
dependencies.

Provide an example of using Bayesian belief networks in decision-

making.

Expectation-Maximization (EM) Algorithm: 29. Describe the EM

algorithm and its role in unsupervised learning.

Explain the iterative steps of the EM algorithm and its convergence

properties.

Computational Learning Theory: 31. Define computational learning

theory and its objectives.

Explain the concept of probably approximately correct (PAC) learning.

Discuss the sample complexity for finite hypothesis spaces in PAC

learning.

Mistake Bound Model of Learning: 34. Describe the mistake bound

model of learning.

Explain how the mistake-bound model relates to online learning and

decision-making.

Instance-Based Learning: 36. Introduce the concept of instance-based

learning.

Explain the k-nearest neighbor algorithm and its use in classification.

Discuss locally weighted regression as a technique in instance-based

learning.

Define radial basis functions and their application in function

approximation.

Explain the principles of case-based reasoning in instance-based

learning.

Compare and contrast lazy and eager learning approaches.

Now, let's create 30 small, medium, and large type questions using
Bloom's Taxonomy:

Knowledge (C1):

What is Maximum Likelihood estimation?

Define Bayesian belief networks.

Explain the purpose of the EM algorithm.

What is the fundamental idea behind the Naïve Bayes classifier?

Define the Minimum Description Length (MDL) principle.

Comprehension (C2): 6. How does the Maximum Likelihood estimation

differ from the least squared error approach?

Can you explain the concept of probably approximately correct (PAC)

learning in computational learning theory?

What are the key components of Bayes' theorem, and how do they relate
to Bayesian learning?

Describe the steps involved in the Gibbs algorithm.

How is the mistake-bound model of learning applied in online decision-

making?

Application (C3): 11. Provide an example of a real-world problem where

the Maximum Likelihood estimation is used.

How can Bayesian belief networks be applied to medical diagnosis?

Give an example of a text classification problem and explain how a

Naïve Bayes classifier can be used to solve it.

Apply the Minimum Description Length (MDL) principle to a data

compression problem.

Can you demonstrate how the EM algorithm can be used for clustering
in a dataset?

Analysis (C4): 16. Compare and contrast Maximum Likelihood and

Maximum A Posteriori (MAP) estimation methods.
Analyze the advantages and limitations of the Naïve Bayes classifier in
text classification.

Evaluate the strengths and weaknesses of Bayesian belief networks in

representing complex probabilistic relationships.

Discuss the trade-offs between the Minimum Description Length (MDL)

and Akaike Information Criterion (AIC) for model selection.

Compare the convergence properties of the Expectation-Maximization

(EM) algorithm in different scenarios.

Synthesis (C5): 21. Create a hypothetical scenario where Maximum

Likelihood estimation is used to estimate parameters in a statistical
model.

Design a Bayesian belief network for a decision-making problem in a

business context.

Develop a text classification system using a Naïve Bayes classifier for

a specific industry, such as sentiment analysis in social media.

Construct a case study illustrating the application of the Minimum

Description Length (MDL) principle in data science.

Propose a new problem domain where the Expectation-Maximization

(EM) algorithm can be applied and outline the steps for solving it.

Knowledge (C1):

What are Genetic Algorithms (GAs)?

What is the main idea behind GAs?

How do GAs mimic the process of natural selection?

What is a population in the context of GAs?

What is a fitness function in GAs?

Comprehension (C2): 6. How do selection mechanisms work in Genetic

Algorithms?

Explain the concept of crossover in GAs.

What is mutation in the context of GAs?

How does elitism benefit the convergence of GAs?

How can GAs be applied to optimization problems?

Application (C3): 11. Give an example of a real-world problem that can

be solved using Genetic Algorithms.

How would you choose the parameters (e.g., mutation rate, population
size) for a specific problem in GAs?

Describe a scenario where a single-point crossover might be more

suitable than a two-point crossover in GAs.

What are the steps involved in implementing a simple Genetic Algorithm

for a problem?

Analysis (C4): 15. Compare and contrast the advantages and

disadvantages of Genetic Algorithms compared to other optimization
techniques.

How does the choice of a fitness function affect the performance of a

Genetic Algorithm?

Discuss the role of diversity in the population of a Genetic Algorithm.

Explain how a Genetic Algorithm explores the search space of a

problem.

What are the key challenges or limitations of Genetic Algorithms?

Now, let's move on to Learning Sets of Rules and related topics:

Knowledge (C1): 20. What is the sequential covering algorithm in

machine learning?

What are rule sets in the context of machine learning?

Explain the FOIL algorithm in machine learning.

What is inductive learning?

What is deductive reasoning in machine learning?

Comprehension (C2): 25. How does sequential covering work to build a
rule set?

What is the difference between First-Order rules and propositional rules

in machine learning?

How does FOIL (First-Order Inductive Learner) generate rules?

Explain the concept of inverting resolution in machine learning.

What is the significance of learning rule sets in practical applications?

Analysis (C4): 30. Compare and contrast sequential covering with other
rule learning approaches.

How does the quality of training data impact the performance of rule
learning algorithms?

Discuss the strengths and weaknesses of FOIL in comparison to other

inductive learning algorithms.

Analyze the trade-offs between the expressiveness of First-Order logic

and computational complexity in learning First-Order rules.

How does the selection of features affect the learned rule sets?

Finally, for the topic of combining inductive and analytical learning:

Knowledge (C1): 35. What are inductive-analytical approaches to

learning in machine learning?

How can prior knowledge be used to initialize a hypothesis in learning

algorithms?

Comprehension (C2): 37. Explain the concept of combining inductive

and analytical learning.

How does prior knowledge assist in the initialization of hypotheses in

machine learning?

Analysis (C4): 39. Analyze the advantages and challenges of combining

inductive and analytical learning approaches.
Provide examples of how prior knowledge can be leveraged to improve
the efficiency of learning algorithms.