0% found this document useful (0 votes)
514 views10 pages

AI & ML Question Bank for 5th Sem

The document discusses the syllabus for the course Artificial Intelligence and Machine Learning. It includes the module outlines, textbook details, mapping of course outcomes and a set of questions related to the topics covered in the modules. The questions cover fundamental concepts in AI, machine learning algorithms and applications.

Uploaded by

Di Dinesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
514 views10 pages

AI & ML Question Bank for 5th Sem

The document discusses the syllabus for the course Artificial Intelligence and Machine Learning. It includes the module outlines, textbook details, mapping of course outcomes and a set of questions related to the topics covered in the modules. The questions cover fundamental concepts in AI, machine learning algorithms and applications.

Uploaded by

Di Dinesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

AY 2023-24
ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5th sem, Course Code: 21CS54

QUESTION BANK
Module-1

Introduction: What is AI? Foundations and History of AI


Problem‐solving: Problem‐solving agents, Example problems, Searching for Solutions,
Uninformed Search Strategies: Breadth First search, Depth First Search,

Textbook 1: Chapter 1- 1.1, 1.2, 1.3


Textbook 1: Chapter 3- 3.1, 3.2, 3.3, 3.4.1, 3.4.3

Module-2

Informed Search Strategies: Greedy best-first search, A*search, Heuristic functions.

Introduction to Machine Learning

Textbook 1: Chapter 3 - 3.5, 3.5.1, 3.5.2, 3.6

Textbook 2: Chapter 1

Textbook
1. Stuart J. Russell and Peter Norvig, Artificial Intelligence, 3rd Edition, Pearson,2015
2. S. Sridhar, M Vijayalakshmi “Machine Learning”. Oxford ,2021

All questions listed below maps CO1: Apply the knowledge of searching and reasoning
techniques for different applications.

Questions
1. What is AI? Explain the four approaches of AI. L2
2. Articulate the core intension behind the Turing Test. L2
3. Summaries history of AI. L2
4. Explain the foundations of Artificial Intelligence. L2
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

5. Illustrate with an example well defined problems and solutions. L2


6. With an example explain solving problems by searching. L2
7. Consider scenario of vacuum world state with both agent location and the dirt location in room
A and B. The agent will be in one of the location and Actions can be left, right and suck.
Develop the complete state space for vacuum world. L3
8. Construct the problem formulation for 8 puzzle game shown in figure. L3

9. The goal of the 8-queens problem is to place eight queens on a chessboard such that no queen
attacks any other. (A queen attacks any piece in the same row, column or diagonal.) Construct
the beginning of the problem. L3
10. Explain the concepts of finding routes in real world problem. L2
11. Explain infrastructure or data structure for search algorithm. L2
12. Explain Queue data structure with example for each type. L2
13. Explain how algorithms performance is measured. L2
14. Compare uniformed and informed (heuristic) search strategies. L2
15. Illustrate the space and time complexity of BFS, and give the limitations of BFS. L2
16. Illustrate the working of Breadth first search on a graph using Pseudocode. L3
17. Illustrate the working of Depth first search on a graph using Pseudocode. L3
18. What are the advantages of DFS over BFS. L1
19. Consider a route finding problem scenario, and explain the working of
Greedy best-first search. L2
20. What is the difference between uniform cost search and Greedy best-first search? L1
21. Apply greedy best-first tree search to reach Arad to Bucharest, refer figure road map of
Romania. L3
22. Apply A* tree search to reach Arad to Bucharest, refer figure road map of Romania and hSLD
values. L3
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

All questions listed below maps CO2: Have a good understanding of machine leaning in relation
to other fields and fundamental issues and challenges of machine learning.

23. With the help of Knowledge Pyramid, explain the need for machine learning. L2
24. Summarize the relationship of machine learning with other fields. L2
25. With the help of block diagram, explain types of machine learning. L2
26. What are the challenges of machine learning? Explain with an example. L2
27. With the help of block diagram, explain process machine learning/Data mining. L2
28. List out any ten applications of Machine learning and mention respective problem domain. L1
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

AY 2023-24
ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5th sem , Course Code: 21CS54

QUESTION BANK - 2
Module-2: Understanding Data
Textbook 2: Chapter 2

Module-3: Basics of Learning theory, Similarity Based Learning Regression Analysis


Textbook 2: Chapter 3 - 3.1 to 3.4, Chapter 4, chapter 5.1 to 5.4

Module-4: Decision Tree learning


Textbook 2: Chapter 6

Textbook
2. S. Sridhar, M Vijayalakshmi “Machine Learning”. Oxford ,2021

All questions listed below maps CO3: Apply the knowledge of classification algorithms on various
dataset and compare results.

Questions
1. Explain the characteristics of Big data. L2
2. Explain Data Preprocessing L2
3. Consider the following set: S={ 12,14,19,22,24,26,28,31,34}. Apply various binning techniques
and show the result. L3
4. Consider the following set: V={ 88,90,92,94}. Apply Min-Max procedure and map the marks to
a new range 0-1. L3
5. Consider the mark list V={10,20,30}, covert the marks to z-score. L3
6. Explain classification of Data types with examples. L2
7. With a simple graph write different types of Data Visualization. L2
8. Explain Design of a Learning System. L2
9. Write find S algorithm, Apply find S algorithm to given training dataset in table 3.2. And list
what are the limitations of find S. L3
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

10. Write Candidate Elimination algorithm, Apply Candidate Elimination algorithm to given
training dataset in table 3.2. L3
11. Write K-NN algorithm, Apply KNN algorithm for given table 3.3, test instance is (6.1,40,5)
L3
Table: 3.3

[Link]. CGPA Assessment Project Result


Submitted
1 9.2 85 8 Pass
2 8 80 7 Pass
3 8.5 81 8 Pass
4 6 45 5 Fail
5 6.5 50 4 Fail
6 8.2 72 7 Pass
7 5.8 38 5 Fail
8 8.9 91 9 Pass

12. Write Weighted K-NN algorithm, Apply Weighted K-NN algorithm for given table 3.3, test
instance is (7.6,60,8) L3
13. Write Nearest Centroid classifier algorithm, Apply Nearest Centroid classifier algorithm for
given table 3.4, test instance is (6,5) L3
Table: 3.4
X Y CLASS
3 1 A
5 2 A
4 3 A
7 6 B
6 7 B
8 5 B
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

14. With respect to regression analysis: explain linearity, correlation and causation. L2
15. Explain types of regression methods and its limitations. L2
16. Consider an example of five weeks sales data in thousands given in table 3.5. Apply linear
regression technique to predict 7th and 9th week sales. L3
Table 3.5

Xi Yi
(week) (Sales in Thousands)
1 1.2
2 1.8
3 2.6
4 3.2
5 3.8

17. Find the linear regression of the data of week and product sales in thousands given in
table [Link] linear regression in matrix form to predict 6th week sales. L3
Table 3.6

Xi Yi
(week) (Product Sales in
Thousands)
1 1
2 3
3 4
4 8

18. Consider the following training set table 3.7 for predicting the sales of the items.
Table 3.7
Items Actual Sales (in Thousands)
Xi Yi
I1 80
I2 90
I3 100
I4 110
I5 120

Consider two fresh items I6 and I7, whose actual values are 80 and 75, respectively. A regression
model predicts the values of the items I6 and I7 as 75 and 85, respectively. Find validation of
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

regression methods MAE, MSE, RMSE, RelMSE and CV. And also calculate standard error
estimate.

19. For the given training samples in table 3.8 apply ID3 algorithm and find the information gain of
Outlook attribute. L3

Table 3.8
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

AY 2023-24
ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

5th sem , Course Code: 21CS54

QUESTION BANK - 3
Module-4: Decision Tree learning, Bayesian Learning
Module-5: Artificial Neural Network and clustering Algorithms.

Textbook 2: Chapter 6, 8, 10, 13

Textbook
2. S. Sridhar, M Vijayalakshmi “Machine Learning”. Oxford ,2021

Questions
1. Consider the set of continuous values for the attribute CGPA in the sample dataset as shown in
Table 6.12 and find the discretized instances. L3 CO3

2. Construct a regression tree using the following Table 6.30 which consists of 10 data instances
and 3 attributes 'Assessment, 'Assignment' and 'Project. The target attribute is the 'Result' which
is a continuous attribute. L3 CO3
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

3. Assess a student's performance using Naive Bayes algorithm with the dataset provided in Table
8.1. Predict whether a student gets a job offer or not in his final year of the course. L3 CO3

Table 8.1: Training Dataset

Test data = (CGPA>=9, Interactiveness=Yes, Practical Knowledge = Average, Communication


Skills=Good)

4. Explain how Artificial Neuron derived from Biological. L2 CO4


5. List any 5 activation functions used in ANNs. L1 CO4
6. Explain Perceptron and Learning Theory and write algorithm. L2 CO4
DEPARTMENT OF INFORMATION SCIENCE AND ENGINEERING

7. Consider a perceptron to represent the Boolean function AND with the initial weights w1 = 0.3,
w2 = -0.2, learning rate learning rate = 0.2 and bias = 0.4. The activation function used here is
the Step function f(x) which gives the output value as binary, i.e., 0 or 1. If value of f(x) is
greater than or equal to 0, it outputs 1 or else it outputs 0. Design a perceptron that performs the
Boolean function AND and update the weights until the Boolean function gives the desired
output. L3 CO4
8. Explain types of Artificial Neural Networks. L2 CO4
9. Explain popular applications of Artificial Neural Networks. L2 CO4
10. Discuss Advantages and Disadvantages of ANN. L2 CO4
11. Differentiate Classification and Clustering. L2 CO5
12. Discuss Advantages and Disadvantages Clustering. L2 CO5
13. Suppose, if the coordinates of the objects are (0, 3) and (5, 8), then what is the Euclidean
distance, Manhattan distance and Chebyshev distance? L3 CO5
14. Consider the array of points as shown in the following Table. 13.4. Apply single linkage
algorithm. L3 CO5

15. Consider the following set of data given in Table 13.9. Cluster it using k-means algorithm with
the initial value of objects 2 and 5 with the coordinate values (4, 6) and (12, 4) as initial seeds.
L3 CO5

Common questions

Powered by AI

A heuristic function in informed search strategies provides an estimate of the cost to reach a goal from a given node. It guides the search algorithm towards a more promising path by evaluating which direction to take based on lower estimated costs, rather than just path costs. For example, in the A* algorithm used for route planning, heuristics might involve the straight-line distance (Euclidean distance) between the current location and the destination, to prioritize paths that seem to shorten the actual travelling distance .

The four approaches to defining AI are: thinking humanly, acting humanly, thinking rationally, and acting rationally. Thinking humanly involves cognitive modeling aimed at achieving human-like reasoning. Acting humanly involves enabling machines to mimic human behavior, such as passing the Turing Test. Thinking rationally is concerned with developing algorithms that represent and reason logically. Acting rationally involves creating agents that make decisions to maximize their performance based on available information. These approaches differ mainly in whether they emphasize processes or outcomes, and the focus on human-like attributes versus logical rationality .

Preprocessing in machine learning involves preparing raw data for modeling, which can significantly affect model performance. This includes handling missing values, scaling features, encoding categorical variables, and splitting data into training and testing sets. Proper preprocessing can enhance model accuracy by ensuring the algorithm doesn't make biased assumptions due to inconsistent data scales or incomplete data. For instance, normalizing data to eliminate scale differences among features is crucial when using distance-based models like K-NN, as it prevents dominance of features with larger ranges over smaller ones .

The Knowledge Pyramid (Data-Information-Knowledge-Wisdom, or DIKW) illustrates the transformation of raw data into actionable wisdom. It starts with data, which is processed to form information, then contextualized into knowledge, and finally applied as wisdom. Machine learning plays a crucial role in this transformation process by automating the extraction of patterns and insights from vast data sets, converting information into knowledge. This becomes increasingly important in fields where data volume is vast and manual analysis is impractical. For instance, machine learning algorithms can detect complex patterns in clinical data that inform medical decisions .

The vacuum world scenario in AI problem-solving involves defining the world as a set of states, actions available to an agent, a goal state, and path costs. Each state specifies the agent's location and the presence of dirt in any room, actions like moving left, right, or sucking dirt, seek to achieve a clean state, and costs can be associated with moving and cleaning. This problem is well-defined as it has clear state representations, specified actions, goals to be reached, and measurable costs, making it suitable for applying search strategies to find optimal solutions .

Class imbalance in machine learning occurs when one class is represented more than the other, which can lead to biased models that perform poorly on the minority class. For example, in fraud detection, there are significantly fewer fraudulent transactions compared to legitimate ones, which can result in a model that simply learns to predict the majority class with high accuracy but fails to detect actual frauds. Similarly, in medical diagnostics, rare diseases are underrepresented, leading classifiers that mainly predict negative results, missing crucial diagnoses. This necessitates techniques like re-sampling, cost-sensitive learning, and using performance metrics that account for imbalance .

Machine learning is intertwined with data mining and artificial intelligence (AI), each contributing distinct yet complementary aspects. Data mining focuses on discovering patterns in large datasets, leveraging machine learning methods for automated pattern recognition. AI uses machine learning to enhance its ability to mimic human decision-making through experience-based learning. The synergy lies in how machine learning provides the predictive accuracy for AI applications and enhances data mining with advanced algorithms, ultimately expanding capacities for intelligent automation across industries, such as intelligent personal assistants and autonomous vehicles .

Breadth-First Search (BFS) uses a queue data structure to explore neighbors level by level, searching all nodes at a given tree depth before moving on. It has a space complexity of O(b^d), where b is the branching factor and d is the depth, and a time complexity of O(b^d). Depth-First Search (DFS), on the other hand, uses a stack or recursion to follow a branch down as far as possible before backtracking, with a space complexity of O(bm) and a time complexity of O(b^m), where m is the maximum depth. BFS is typically used for finding the shortest path in unweighted graphs, while DFS is used in applications like topological sorting and solving puzzles with unique solutions .

The A* search algorithm uses both cost to reach a node and a heuristic to guide its search, aiming to find the least-cost path to a goal. Greedy Best-First Search uses only the heuristic to guide its search, aiming to proceed towards the goal as quickly as possible but without considering the path cost. A* is considered more optimal because it balances the heuristic value with the real path cost, leading to optimal solutions in terms of path cost, as long as the heuristic is admissible (never overestimates the cost to reach the goal), whereas Greedy Best-First Search can get stuck in suboptimal paths because it does not consider path costs .

Data visualization techniques translate complex datasets into graphical formats, making trends and patterns more understandable to enhance analysis. Common methods include histograms for showing frequency distributions, line charts for tracking changes over time, and scatter plots for identifying relationships between variables. For example, a scatter plot might reveal correlations between variables such as sales and advertising spend, while a histogram could highlight distribution skewness in customer age demographics. Such visualizations make it easier to spot anomalies and insights that raw data tables might obscure .

You might also like