0% found this document useful (0 votes)
210 views4 pages

2019 MTECH AI SampleQuestions PDF

The document provides a sample written test for the M.Tech AI program. It includes a syllabus covering programming, data structures, calculus, linear algebra, probability, statistics, and discrete mathematics. It then provides a sample test with 15 questions testing knowledge across these topics. Questions include writing C code, evaluating mathematical functions, finding properties of matrices, and answering multiple choice questions related to concepts in probability, graphs, and binary trees.

Uploaded by

Arnab Ray
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)
210 views4 pages

2019 MTECH AI SampleQuestions PDF

The document provides a sample written test for the M.Tech AI program. It includes a syllabus covering programming, data structures, calculus, linear algebra, probability, statistics, and discrete mathematics. It then provides a sample test with 15 questions testing knowledge across these topics. Questions include writing C code, evaluating mathematical functions, finding properties of matrices, and answering multiple choice questions related to concepts in probability, graphs, and binary trees.

Uploaded by

Arnab Ray
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
You are on page 1/ 4

EECS Division, IISc SAMPLE WRITTEN TEST: M.TECH.

(AI) CSA/ECE/EE/ESE

Syllabus for M.Tech. (AI) Written Test.

1. Programming and Data Structures: Programming in C. Recursion. Arrays, stacks, queues, linked
lists, trees, binary search trees, binary heaps, graphs.

2. Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value theorem. The-
orems of integral calculus, evaluations of definite and improper integrals. Taylor series. Partial deriva-
tives, multiple integrals, vector identities, directional derivatives.

3. Linear Algebra and Matrix Analysis: Vector space, basis, linear dependence and independence,
matrix algebra, rank, determinants, system of linear equations, eigenvalues and eigenvectors, LU de-
composition.

4. Probability and Statistics: Random variables. Uniform, normal, exponential, Poisson and binomial
distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.
Correlation and regression analysis.

5. Discrete Mathematics: Propositional and first order logic, sets, relations, functions, partial orders
and lattices, groups, graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence re-
lations, generating functions.

Sample Written Test: Please see the next few pages for a sample written test.
Please note that no model answers will be provided.
EECS Division, IISc SAMPLE WRITTEN TEST: M.TECH. (AI) CSA/ECE/EE/ESE

Name: Application Number:

Instructions. You will have 60 minutes to answer the questions. This paper has fifteen questions. The
first set of five questions are on Programming in C and Data Structures; each of these questions carries 2
points. The remaining questions are on Calculus, Linear Algebra and Matrix Analysis, Probability and
Statistics, and Discrete Mathematics and carry one point each. For multiple choice questions, you must
tick all the correct choices to get credit.

1. (2 points) Give example values of the variables x, y, i, and j that can produce the value TRUE for
the following expression:
( x > y ) && ( i > 0 ) | | ( j < 5 )

Write your answer here:

2. (2 points) Give example values of the variables x and xmin so that the following program segment
will output −5.
{
i f ( a b s ( x ) < xmin ) x = ( x >0)? xmin : −xmin ;
p r i n t f ( ”%d ” , x ) ;
}

Write your answer here:

3. (2 points) What is the mathematical function computed by the following C-function?


f l o a t e v a l ( i n t x ) / ∗ assum e x >= 0 ∗ /
{ i n t i ; f l o a t temp = 4 . 2 , v a l u e = 1 ;
i f ( x == 0 ) r e t u r n 1 ;
e l s e f o r ( i = 0 ; i < x ; i ++)
v a l u e ∗= temp ;
return value ;
}

Write your answer here:

4. (2 points) What is the number of times the printf statement is executed in the following program?
for ( i = 1 ; i < 5 ; i ++ )
f o r ( j = i + 1 ; j <6; j ++)
p r i n t f ( ”%d ,%d ” , i , j ) ;

Write your answer here:

5. (2 points) Write a C-program to find the minimum value of a two dimensional array of integers.

Page 2
EECS Division, IISc SAMPLE WRITTEN TEST: M.TECH. (AI) CSA/ECE/EE/ESE

6. (1 point) Plot f (x) = sin(xπ x) as a function of x. Mark the maximum value, the place where this value
is taken, and a representative set of x values (on either side of the origin) where f (x) = 0.

7. (1 point) The maximum of xe−x is reached at x∗ = .

8. (1 point) The sum of the squares of the eigenvalues of the matrix


 
1 2 3
A= 3 1 4 
4 5 1

is .

9. (1 point) The eigenvalues and eigenvectors of the matrix


 
1 2 3
A= 0 2 3 
0 0 4

are (write your answer in the space given below):

     
0 1 −2
10. (1 point) Which of the following choices hold true for the vectors , , ?
1 2 −4
(You must tick all that apply.)

Linearly independent
Linearly dependent
Neither linearly independent nor linearly dependent
Orthogonal

Page 3
EECS Division, IISc SAMPLE WRITTEN TEST: M.TECH. (AI) CSA/ECE/EE/ESE

11. (1 point) The rank of the matrix  


1 2
A=
2 4
is .

12. (1 point) Let a biased coin be tossed n times in succession, with the probability of heads being p.
The probability that all the tosses show the same face is .

13. (1 point) Let X and Y be two correlated random variables with means µX and µY , respectively. The
mean of the random variable X +Y is always

greater than µX + µY
less than µX + µY
21 µX + 12 µY
µX + µY
(You must tick all that apply.)

14. (1 point) The number of undirected graphs, without multiple edges and without self loops, on a set
of n labelled vertices is .

15. (1 point) The number of leaves in a complete binary tree of depth n, with the root node at depth 0,
is .

Page 4

You might also like