AMITY UNIVERSITY MADHYA

PRADESH,GWALIOR
QUESTION BANK
OF
MATHEMATICAL FOUNDATIONS FOR ARTIFICIAL
INTELLIGENCE

CSA201

PREPARED BY
Dr. Rajat Vaish
Assistant Professor
Department of Applied Mathematics
Amity School of Engineering & Technology
AMITY UNIVERSITY MADHYA PRADESH, GWALIOR
 AMITY SCHOOL OF ENGINEERING & TECHNOLOGY (ASET)
META DATA : QUESTION PAPER

Course B.Tech.

Batch

Semester II Sem
MATHEMATICAL FOUNDATIONS FOR ARTIFICIAL INTELLIGENCE
Course Subject

Course Code CSA201

Course Credits 03

Syllabus Attached

Question bank Attached

Name of the Faculty
Dr. Rajat Vaish, Assistant Professor
Member, Designation
Name of Assisting/
Re-checking Faculty Dr. Pradip R. Patle, Assistant Professor
Member
Name of the HOD Dr. Santosh Kumar Sharma, Associate Professor
 MATHEMATICAL FOUNDATIONS FOR ARTIFICIAL INTELLIGENCE

Course Code: CSA201 Credit Units: 03

Total Hours : 45

Course Objective:

The course will introduce students to the fundamental mathematical methods concepts for
applications in artificial intelligence and machine learning.

Course Contents:

Module I: Linear Algebra (13 Hours)

Floating point arithmetic; inner product; norm and distance (vector norm, distance, matrix norm etc.);
clustering (objective, the k-means algorithm etc.); singular values of a matrix; min-max principle;
notion of hyperplanes; half-planes; Matrix factorizations: LU, Cholesky method, QR, Singular Value
Decomposition; Projections; Matrix diagonalization, matrix triangularization, Gram-Schmidt
orthogonalization; iterative methods for large linear systems; Krylov subspace methods;
approximating eigenvalues and eigenvectors.

Module II: Descriptive and Inferential Statistics (13 Hours)

Data exploration (histograms, bar chart, box and whisker Plot, line graph, scatter plot), Probability
distributions, covariance matrices, Inequalities of statistics, Multivariate Gaussian and weighted least
square, linear regression and logistic regression, Multiple Linear Regression; Sampling: Basic
Concept, Types of Sampling Errors and Precautions, Parameter and Statistic, Sampling Distribution of
the mean, Sampling distribution of proportion, Markov Chains.

Module III: Fuzzy set theory (10 Hours)

Fuzzy Sets : Classical sets vs Fuzzy Sets – Need for fuzzy sets – Definition and Mathematical
representations – Level Sets – Fuzzy functions - Zadeh’s Extension Principle; Operations on Fuzzy
Sets: Operations on [0,1] – Fuzzy negation, triangular norms, t-conorms, fuzzy implications,
Aggregation Operations, Fuzzy Functional Equations.

Module IV: Optimization (9 Hours)

Fundamentals of Unconstrained Optimization; Necessary and sufficiency conditions for optima;

Lagrange Multipliers, Numerical properties of modified Newton, quasi-Newton, steepest descent for
unconstrained optimization; theory of Constrained Optimization, KKT conditions;

Examination Scheme:

Components CT Attendance Assignment/ EE

Project/Seminar/Quiz
Weightage (%) 15 5 10 70

Text & References:

Text Books:

 G. Strang (2016). Introduction to Linear Algebra, Wellesley-Cambridge Press, Fifth

edition, USA.
 George J Klir and Bo Yuan, Fuzzy Sets and Fuzzy Logic : Theory and Applications, Prentice Hall
NJ,1995.
 Gupta C B, Gupta V - An Introduction to Statistical Methods (Vikas1995, 23rd Edition).
 S. Boyd and L. Vandenberghe(2009). Convex Optimization, Cambridge University
Press.
 Montgomery, D. C. and G. C. Runger (2011). Applied Statistics and Probability for
Engineers. 5th Edition. John Wiley & Sons, Inc., NY, USA:
 J. Nocedal and S. Wright. Numerical Optimization, Springer Series in Operations
Research and Financial Engineering, 2006

Reference Books:

 Lloyd N. Trefethen and David Bau, III. Numerical linear algebra, SIAM, 1997.
 Edward A. Bender. Mathematical Methods in Artificial Intelligence, IEEE Computer Society
Press.
 SUMMARY OF QUESTIONS

S.N. Module Section –A Section –B Section –C

(6 Marks) (10 Marks) (20 Marks)

1 I 10 10 10
2 II 10 10 10
3 III 10 10 10
4 IV 05 05 05
TOTAL 50 28 24
 CSA201
Module-I
Q1 Determine whether the following sets of vectors are independent or dependent.
(a) (1,2,-1,3), (3,-1,1,1),(1,9,-5,11)
(b) (1,1,0),(0,1,1),(1,0,1)
Q2 Solve the following system 𝐴𝑥 = 𝑏 by Gaussian elimination without pivoting.
1 1 −1 1
A=[ 1 2 −2], 𝑏 = [0]
−2 1 1 1
Q3 Solve the following system 𝐴𝑥 = 𝑏 by Gaussian elimination without pivoting.
1 −1 1 −1 0
A=[−1 3 −3 3 ], 𝑏 = [ 2 ]
2 −4 7 −7 −2
3 7 −10 14 8
Q4 Consider the linear system

6𝑥1 + 2𝑥2 + 2𝑥3 = −2,

2 1
2𝑥1 + 𝑥2 + 𝑥3 = 1,
3 3
𝑥1 + 2𝑥2 − 𝑥3 = 0,

And verify its solution is 𝑥1 = 2.6, 𝑥2 = −3.8, 𝑥3 = −5.0.

Using the four digit floating-point decimal arithmetic with rounding, solve the preceeding
system by Gaussian elimination without pivoting.

Q5 Using Choleski method, calculate the decomposition 𝐴 = 𝐿𝐿𝑇 for

2.25 −3.0 4.5

[−3.0 5.0 −10.0]
4.5 −10.0 34.0

Q6 Using Choleski method, calculate the decomposition 𝐴 = 𝐿𝐿𝑇 for

15 −18 15 −3
−18 24 −18 4
[ ]
15 −18 18 −3
−3 4 −3 1

Q7 Calculate the condition numbers 𝑐𝑜𝑛𝑑(𝐴)𝑝 , p=1,2,∞, for

100 99
A=[ ]
99 98
Q8 Calculate the condition numbers 𝑐𝑜𝑛𝑑(𝐴)𝑝 , p=1,2,∞, for

110.3 99.9
A=[ ]
78 101

Q9 Consider the matrix

2 −1 −1 1
−1 2 1 −1
A= [ ]
−1 1 2 −1
1 −1 −1 2

(a) Determine the spectral norm 𝜌(𝑨).

(b) Determine a vector x with || 𝒙 ||2 = 1 satisfying || 𝑨𝒙 ||2 = 𝜌(𝑨).

Q10 Determine the condition number of the matrix

1 4 9
[4 9 16]
9 16 25
using the (i) maximum absolute row sum norm, and (ii) spectral norm.

0.1𝛼 0.1𝛼
Q11 𝐴(𝛼) = [ ], Determine 𝛼such that 𝑐𝑜𝑛𝑑 (𝑨(𝛼)) is minimized. Use the maximum norm.
1.0 1.5

Q12 Solve the system of equations

4𝑥1 + 2𝑥2 + 𝑥3 = 4,

𝑥1 + 3𝑥2 + 𝑥3 = 4,

3𝑥1 + 2𝑥2 + 6𝑥3 = 7,

Using the Gauss-Jacobi method, directly and in error format. Perform three iterations
using the initial approximation 𝑥 0 = [0.1 0.8 0.5]𝑇 .

Q13 Solve the system of equations

4𝑥1 + 2𝑥2 + 𝑥3 = 4,

𝑥1 + 3𝑥2 + 𝑥3 = 4,

3𝑥1 + 2𝑥2 + 6𝑥3 = 7,

Using the Gauss-Seidel method, directly and in error format. Perform three iterations
using the initial approximation 𝑥 0 = [0.1 0.8 0.5]𝑇 .

Q14 Given the matrix A = I + L + U where

1 2 −2
𝐴 = [1 1 1]
2 2 1
L and U are strictly lower and upper triangular matrices respectively, decide whether
(a) Jacobi and (b) Gauss-Seidel methods converge to the solution of Ax = b.

Q15 Solve the system of equations

2𝑥 − 𝑦 = 1,

−𝑥 + 2𝑦 − 𝑧 = 0,

−𝑦 + 2𝑧 − 𝑤 = 1,

−𝑧 + 2𝑤 = 1.

using Gauss-Seidel iteration scheme with 𝒙𝟎 = [0.5 0.5 0.5 0.5]𝑇 . Iterate three times.

Obtain the iteration matrix and determine its eigenvalues. Use the extrapolation method

and iterate three times. Compare the maximum absolute error and the rate of convergence

of the methods.

Q16 The following system of equations is given

4𝑥 + 𝑦 + 2𝑧 = 4,

3𝑥 + 5𝑦 + 𝑧 = 7,

𝑥 + 𝑦 + 3𝑧 = 3.

Set up the Jacobi and Gauss-Seidel iterative schemes for the solution and iterate three times
starting with the initial vector 𝑥 0 = [0 0 0]. Compare with the exact solution.
Q28 Apply Gram-Schmidt orthogonalization to the following set of vectors
(i)(1,2,0), (8,1, −6), (0,0,1), (ii) (1, −1,1,1), (1,0,1,0), (0,1,0,1).

Q17 Find the singular values of the matrix

1 1 0 1
𝐴 = [0 0 0 1]
1 1 0 0
1 2
Q18 Find the singular values of the matrix 𝐴 = [ ].
2 1
0 1 1
Q19 Find the singular values of A=[√2 2 0] and find the singular value decomposition
0 1 1
of A.
1 0 1 0
Q20 Find the SVD of the matrix A [ ].
0 1 0 1
Q21 Find the QR factorization and singular value decomposition of the following matrices.
0.9 1.1
𝐴 = [−1.0 −1.0]
1.1 0.9
Q22 Find the QR factorization and singular value decomposition of the following matrices.
 1 2 3
𝐴 = [2 3 4]
3 4 5
4 5 6

Module II
Q1 Define dependent and independent events and concept of conditional probability.
Q2 State compound probability theorem for dependent and independent events.
Q3 Define following terms-
(i) Random Variable
(ii) Discrete Probability Distribution
(iii) Distribution Function
Q4 Define following terms-
(i) Binomial distribution and its application
(ii) Constant of Binomial distribution
(iii) Binomial frequency distribution
Q5 Define following terms-
(i) Continuous Probability distribution
(ii) Distribution function.
(iii) property of Distribution function
Q6 Define the terms with suitable examples: Data, Primary data, secondary data.
Q7 Define the following: Sample, Population, Parameter.
Q8 Define: Frequency distribution, Cumulative frequency distribution.
Q9 Explain the terms: frequency distribution, lower class limit, upper class limit, class width.
Q10 Explain the various techniques for data collection.
Q11 Define the term with suitable examples: quantitative data, qualitative data.
Q12 Represent the following data using a histogram:
Class Frequency Class Frequency
0-10 5 50-60 10
10-20 11 60-70 8
20-30 19 70-80 6
30-40 21 80-90 3
40-50 16 90-100 1
Q13 The January 1990 issue of Arizona Trend contains a supplement describing the 12
“best” golf courses in the state. The yardages (lengths) of these courses are as follows:
6981, 7099, 6930, 6992, 7518, 7100, 6935, 7518, 7013, 6800, 7041, and 6890. Calculate the
sample mean and sample standard deviation. Construct a dot diagram of the data.
Q14 An engineering professor purchases a new computer every two years with preferences
for three models: M1, M2, M3. If the present model is M1, the next computer may be M2
with probability0.2 or M3 with probability 0.15. If the present model is M2, the probabilities
of switching to M1 and M3 are 0.6 and 0.25 respectively. And if the present model is M3 ,
then the probabilities of switching to M1 and M2 are 0.5 and 0.1 respectively. Represent the
situation as Markov chain.
Q15 Patients suffering from kidney failure can either get a transplant or undergo periodic
dialysis. During one year, 30% undergo cadaveric transplants and 10% receive living-donor
kidneys. In the year following a transplant, 30% of the cadaveric transplants and 15% of
living donor recipients go back to dialysis. Death percentage among the group are 20% and
10% respectively. Of those in dialysis pool 10% die and of the ones who survive more than
one year after a transplant, 5% die and 5% go back to dialysis. Represent the situation as
Markov chain.

Module-III
Q1 Explain the difference between randomness and fuzziness?
Q2 Find some examples of prospective fuzzy variable in daily life?
Q3 Describe concept of a fuzzy set in your own words.
Q4 Explain why we need fuzzy set theory?
Q5 Compute the scalar cardinalities for each of the following fuzzy sets:
0.4 0.2 0.5 0.4 1
(a) 𝐴 = 𝑣 + 𝑤 + 𝑥 + 𝑦 + 𝑧 ;
1 1 1
(b) 𝐵 = 𝑥 + 𝑦 + 𝑧 ;
Q6 Consider the fuzzy sets A,B,C defined on the interval 𝑋 = [0,10] of real numbers by the
membership grade functions
𝑥 1 2
𝐴(𝑥) = 𝑥+2, 𝐵(𝑥) = 2−𝑥 , 𝑐(𝑥) = (1+10𝑥) .
Determine mathematical formulas and graphs of the membership grade functions of each of
the sets:
(a) 𝐴̅, 𝐵̅ , 𝐶̅
(b) 𝐴 ∪ 𝐵, 𝐴 ∪ 𝐶, 𝐵 ∪ 𝐶
(c) 𝐴 ∩ 𝐵, 𝐴 ∩ 𝐶, 𝐵 ∩ 𝐶
Q7 Calculate the 𝛼 − 𝑐𝑢𝑡𝑠 and strong 𝛼 − 𝑐𝑢𝑡𝑠 of the fuzzy set defined above for some
values of alpha for example 𝛼 = 0.2,0.5,0.8,1.
Q8 What are the roles of 𝛼 −cuts and strong 𝛼 −cut in fuzzy set theory? What is difference
between them? Describe these concepts in your own words.
0.5 0.4 0.7 0.8 1
Q9 Let A be a fuzzy set defined by 𝐴 = 𝑥 + 𝑥 + 𝑥 + 𝑥 + 𝑥 . List all 𝛼 − 𝑐𝑢𝑡𝑠 and strong
1 2 3 4 5
𝛼 −cuts of A.
(a) .
Q10 Determine which fuzzy sets defined by the following functions are fuzzy numbers:
sin 𝑥, 𝑓𝑜𝑟 0 ≤ 𝑥 ≤ 𝜋
(a) 𝐴(𝑥) = { ,
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
𝑥 , 𝑓𝑜𝑟 0 ≤ 𝑥 ≤ 1
(b) 𝐵(𝑥) = { ,
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
1 , 𝑓𝑜𝑟 0 ≤ 𝑥 ≤ 10
(c) 𝐵(𝑥) = { ,
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
Q11 Calculate the following:
(a) [−1,2] + [1,3];
(b) [-2,4]-[3,6];
(c) [-3,4].[-3,4];
 (d) [-4,6]/[1,2];
Q12 Let A and B be two fuzzy numbers whose membership functions are given by
𝑥+2
, 𝑓𝑜𝑟 − 2 < 𝑥 ≤ 0
2
𝐴(𝑥) = 2 − 𝑥
, 𝑓𝑜𝑟 0 < 𝑥 < 2
2
{ 0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
and
𝑥−2
, 𝑓𝑜𝑟 2 < 𝑥 ≤ 4
2
𝐵(𝑥) = 6 − 𝑥
, 𝑓𝑜𝑟 4 < 𝑥 ≤ 6
2
{ 0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
Calculate the fuzzy numbers 𝐴 + 𝐵, 𝐴 − 𝐵, 𝐵 − 𝐴, . 𝐵, 𝐴/𝐵, MIN(A,B) and MAX(A,B).
Q13 Let A, B be two fuzzy numbers defined above and Let

𝑥−6
, 𝑓𝑜𝑟 6 < 𝑥 ≤ 8
2
𝐶(𝑥) = 10 − 𝑥
, 𝑓𝑜𝑟 8 < 𝑥 ≤ 10
2
{ 0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
Solve the following equations for X:
(a) 𝐴 + 𝑋 = 𝐵;
(b) 𝐵. 𝑋 = 𝐶.

Module-IV

Q1 The system of equations

2(𝑥1 + 𝑥2 )2 + +(𝑥1 − 𝑥2 )2 = 8,
5𝑥12 + (𝑥2 − 3)2 − 9 = 0.
Carry out one iteration of Newtons’s method from 𝑥 0 = (2,0)𝑇 .

Q2 Carry out the second iteration of Newtons’s method on the system

𝑒 𝑥1 − 1 = 0,
𝑒 𝑥2 − 1 = 0,
𝑇
Starting from 𝑥0 = (−10,10) .

Q3 Consider applying the one iteration of Newtons’s method to

𝑥1
2
𝐹(𝑥) = [𝑥2 + 𝑥2 ]
𝑒 𝑥3 − 1
1 1
Q4 Let 𝑓(𝑥1 , 𝑥2 )=2 (𝑥12 − 𝑥2 )2 + 2 (1 − 𝑥1 )2 . What is the minimize of 𝑓? Compute one
iteration of Newton’s method for minimizing𝑓(𝑥) starting from 𝑥0 = (2,2)𝑇 . Is this a good
step?

Q5 Consider applying Newton’s method to find a minimize of 𝑓(𝑥) = sin 𝑥 from 𝑥 ∈

[−𝜋, 𝜋].
Q6 Minimize the function 𝑓(𝑥1 , 𝑥2 ) = 𝑥1 − 𝑥2 + 2𝑥12 + 2𝑥1 𝑥2 + 𝑥22 starting from the point
𝑥 0 = [0,0]𝑇 using method of steepest descent.
Q7 Show that the Newton’s method finds the minimum of a quadratic function in one
iteration.
Q8 Minimize the function 𝑓(𝑥1 , 𝑥2 ) = 𝑥1 − 𝑥2 + 2𝑥12 + 2𝑥1 𝑥2 + 𝑥22 starting from the point
𝑥 0 = [0,0]𝑇 using Newton’s method.

Q9 Determine the extreme point points of following functions

(a) 𝑓(𝑥1 , 𝑥2 ) = 𝑥13 + 𝑥23 − 3𝑥1 𝑥2
(b) 𝑓(𝑥1 , 𝑥2 , 𝑥3 ) = 2𝑥12 +𝑥22 + 𝑥32 + 6(𝑥1 + 𝑥2 + 𝑥3 ) + 2𝑥1 𝑥2 𝑥3
(c)
Q10 Verify that the function
𝑓(𝑥1 , 𝑥2 , 𝑥3 ) = 2𝑥1 𝑥2 𝑥3 − 4𝑥1 𝑥3 − 2𝑥2 𝑥3 + 𝑥12 + 𝑥22 + 𝑥32 − 2𝑥1 − 4𝑥2 + 4𝑥3 , has the
stationary points (0,3,1), (0,1,-1),(1,2,0),(2,1,1) and (2,3,-1). Use the sufficient condition to
identify the extreme points.

Q11 Write the KKT necessary conditions for the following problems
(a) Maximize 𝑓(𝒙) = 𝑥13 − 𝑥22 + 𝑥1 𝑥32 ,
Subject to 𝑥1 + 𝑥22 + 𝑥3 = 5,
5𝑥12 − 𝑥22 − 𝑥3 ≥ 2,
𝑥1 , 𝑥2 , 𝑥3 ≥ 0
(b) Minimize 𝑓(𝒙) = 𝑥14 + 𝑥22 + 5𝑥1 𝑥2 𝑥3 ,
Subject to 𝑥12 − 𝑥22 + 𝑥33 ≤ 10,
𝑥13 + 𝑥22 + 4𝑥32 ≥ 20