# VITMEE Eligibility and Syllabus for Computer Science (CS-IT) 2019-20

VITMEE Eligibility and Syllabus for Computer Science (CS-IT) 2019-20

Vellore Institute of Technology Master’s entrance examination (VITMEE) For M.Tech and MCA Admission 2019-20 VITMEE Syllabus for MCA VITMEE Eligibility and Syllabus for Computer Science (CS-IT)

Computer Science and Engineering Eligibility

• B.E. / B. Tech in any branch (or)M.S / M.Sc. Computer Science or Information Technology or Software Engineering (or)MCA  (or)Any other equivalent degree with valid GATE Score in Computer Science

Information Technology (Networking) Eligibility

• B.E. / B. Tech in any branch (or)M.S / M.Sc. Computer Science or Information Technology or Software Engineering (or)MCA  (or)Any other equivalent degree with valid GATE Score in Computer Science

Syllabus for COMPUTER SCIENCE AND ENGINEERING & INFORMATION TECHNOLOGY(CS-IT)

ENGINEERING MATHEMATICS

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.

Probability and Statistics

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

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.

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 Weddle’s) eigen values and eigen vectors, Numerical solutions to ordinary (Euler, modified Euler, Runga Kutta 4th order) and partial differential (parabolic, elliptic and Hyperbolic) equations.

Theory of computation

Formal language and automata theory Regular languages and finite automata, context free languages and push down automata, recursively enumerable sets and Turing machines, undecidability

Analysis of algorithms and computational complexity

Asymptotic analysis (best, worst, average case) of time and space, Upper and lower bounds on the complexity of specific problems, NP-completeness.

Mathematical physics

Linear vector space, matrices, vector calculus; Linear differential equations; elements of complex analysis; laplace transforms, Fourier analysis, elementary ideas about tensors

COMPUTER HARDWARE Digital logic

Number systems and codes-Gates-TTL-circuits-Boolean algebra and Karnaugh maps-Arithmetic logic units-Flip flops-registers and counters-Memories – Combinational and sequential logic circuits .

Computer Architecture and organization

Machine instructions and addressing modes, ALU and data path, Register Transfer Language, hardware and micro programmed control, memory interface, RAM, ROM I/ O interface (Interrupt and DMA modes), serial communication interface, instruction pipelining, Cache, main and second memory storage-Micro processors 8085, 8086, Interfacing and memory addressing.

Electronics

Network analysis, semiconductor devices; bipolar transistors, FET’s; Power supplies, amplifier, Oscillators; Operational amplifiers; elements of digital electronics; logic circuits.

SOFTWARE SYSTEMS Data structures

Notion of abstract data types, stack, Queue, List, set, string. Tree, binary search trees, heap, graph

Programming methodology

C programming, program control, function, scope, binding, parameter passing, iteration and recursion, elementary concepts of object oriented, functional and logic programming, Java programming.

Algorithms for problem solving

Tree and graph traversal, connected components, spanning trees, shortest paths; Hashing, sorting, searching; design techniques (Greedy, dynamic programming, divide and conquer)

Programming language processors

Compiler, Interpreter, assembler, Linker, Loader, Macro processors; Compiler design-Lexical analysis, parsing-Top-down parsing and bottom up parsing, syntax directed translation, runtime environment, Symbol table, Code optimization, code generation.

Operating systems

Memory management, page faults, overlay, processor management, device management, dead lock. Processes, threads and interprocess communication, CPU scheduling, file systems, I/O systems, protection and security.

System & program development methodology

Software project phase-Life cycle of software development-steps of software development-principles of programming in any language -documentation

Management Information systems

Aspects of Management and Information systems- decision support and operation-support systems- systems approaches to MIS-computers and information system in business

Databases management systems

Data, database and DBMS-Data dictionary/directory-schema, description of database structure-forms of DBMS systems-Hierarchical, network and RDBMS-DDL, DML, stored data structure language and query language-Recent trends in database management systems-Memory management techniques used in computers, query languages (SQL), file structures (sequential files, indexing, B* trees) Transactions and concurrency control.

Computer networks & Data communications

Analog Vs Digital communication, modems, techniques, multiplexers, and concentrators, serial Vs parallel communication, simplex, duplex, and half duplex communication-synchronous and asynchronous communication- Error detection/correction methods, data link control protocols, balanced and unbalanced interfaces, communication media- ISO/OSI stack, Sliding window protocol, LAN Technologies (Ethernet, Token ring, TCP/UDP, IP, Basic concepts of switches; gateways, and routers).