VIT Master's Entrance Examination VITMEE Syllabus

Hey buddy can you please get the VITMEE Syllabus of Computer Science and Engineering exam so that I can prepare according to the syllabus?

I will help you here to get the syllabus of VITMEE Syllabus of Computer Science and Engineering so that you can have idea and go through it easily.


Here is the syllabus

Mathematical Logic:
Syntax of First Order Logic, Semantics of First Order Logic, a Sequent Calculus, the Completeness Theorem, the Limitations of First Order Logic.

Differential and Integral Calculus :
Limit, Continuity, Differentiability, Leibniz theorem, Mean Value Theorems, Taylor’s theorem, Integrals, Improper integrals, Total Differentiation, Partial derivatives ,Maxima and Minima, vector calculus, Linear differential equations.

Probability and Statistics:
Probability, conditional probability, Baye’s theorem, means, median, mode, moments, standard deviation. Random variables, Uniform, Binomial, Poisson, normal distributions, Correlation and regression, Sampling and Tests of significance.

Numerical Methods:
Solutions to algebraic and transcendental equations(Bisection and Newton Raphsons’ methods), simultaneous linear algebraic equations(Gauss elimination, Crouts, Gauss seidal and relaxation), Interpolation methods (forward, backward and central), numerical integration (Trapezoidal, Simpson’s and Wedd le’s) eigen values and eigen vectors, Numerical solutions to ordinary (Euler, modified Euler, Runga Ku tta 4 th order) and partial diffe re ntial ( parabolic, elliptic and Hyperbolic) equations.

Linear Algebra and Transforms:
linear vector space, determinants, matrices, eigen values, eigen vectors, elements of complex analysis, laplace transforms, Fourier analysis.

Theoretical Computer Science Discrete Mathematics:
sets, relations and functions, algebra of matrices and determinants, algebraic structures, Boolean algebra and applications, order relations and structures, graph theory, logic and combinatorics.

Theory of computation:
Regular languages and finite automata, context free languages and Push down automata, recursively enumerable sets and Turing machines, undecidability.


VITMEE Syllabus of Computer Science and Engineering

__________________
Answered By StudyChaCha Member