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/ 2
CHRIST DEEMED TO BE UNIVERSITY,BENGALURU - 560029
End Semester Examination September/October - 20 19
MSc (Data Science) I SEMESTER Code: MDS131 Max.Marks: 10 0 Course: MATHEMATICAL FOUNDATION FOR DATA SCIENCE - I Duration: 3Hrs SECTION A Answer all Questions 5X20 =10 0 1 a) Prove that the union of two subspace of V is a subspace iff one of the (10 ) subspaces is contained in the other. [OR] 2 b) Prove or give a counterexample: If v1, ....., vm and w1, ..... wm are linearly (10 ) independent list of vectors in V, then v1 + w1, ....,vm + wm is linearly independent. 3 a) Prove that dim(U 1 + U 2 .. + U m ) < dim(U 1) + dim(U 2) + dim(U m ) where (10 ) U 1, ..... , U m are finite dimensional subspaces of V. [OR] 4 b) Prove that any two bases of a finite dimensional vector space have the (10 ) same length. 5 a) Prove that Tv1, ....., Tvn is linearly independent in W where is (10 ) injective and v1, ... vn is linearly independent in V. [OR] 6 b) Prove that a map to a larger dimension space is not surjective. (10 ) 7 a) Prove that the product of direct sum is the sum of individual dimension of (10 ) the subspaces. [OR] 8 b) Prove that S is injective where V is a finite dimensional vector space and (10 ) are such that RST is surjective. 9 a) Determine all eigenvalues and eigenvectors of T where (10 ) and T is defined by (Tp)(x) = xp’(x) for all x. [OR] 10 b) Prove that T / (null T) is injective iff (null T) ∩ (range T) = {0} where (10 )
11 a) Prove t hat where and is an eigenvector of (10 )
T with eigenvalue and . [OR] 12 b) Prove that (x + x + ... + x )2 <= n(x 2 + ..+ x 2) (10 ) 1 2 n 1 n
13 a) Explain an SVD (Singular Value Decomposition) basis classification (10 )
algorithm to recognize handwritten digits. [OR] 14 b) Elaborate the concept to recognize handwritten digits with a mathematical (10 ) formulation. 15 a) Elaborate N onnegative Matrix Factoriztion algorithm for text mining (10 ) applications. [OR] 16 b) Explain the vector space model algorithm for text mining applications. (10 ) 17 a) Prove that -(-v) = v for every . (10 ) [OR] 18 b) Prove t hat if v1 + w,.., vm+w is linearly dependent , t hen (10 ) span(v1, ... vm) where v1, ... vm is linearly independent in V and . 19 a) Prove that T - is invertible where and ||Tv|| <= ||v|| for (10 ) every . [OR] 20 b) Find vect ors su ch t hat u is a scalar mu lt iple of (1,3), v is (10 ) ort hogonal t o (1,3) and (1,2) = u + v.