Scribd
Upload
102 views

VITMEE Syllabus

The document outlines the syllabus for a computer science and engineering program, covering topics such as: 1) Mathematics including calculus, linear algebra, probability, statistics and numerical methods. 2) Programming concepts like algorithms, data structures, programming languages and software engineering. 3) Computer architecture, organization and operating systems. 4) Computer networks, databases, and other computing technologies. The syllabus provides a comprehensive overview of the core topics taught in a computer science and IT degree program.

Uploaded by

dhruvarakesh7254
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
102 views

VITMEE Syllabus

The document outlines the syllabus for a computer science and engineering program, covering topics such as: 1) Mathematics including calculus, linear algebra, probability, statistics and numerical methods. 2) Programming concepts like algorithms, data structures, programming languages and software engineering. 3) Computer architecture, organization and operating systems. 4) Computer networks, databases, and other computing technologies. The syllabus provides a comprehensive overview of the core topics taught in a computer science and IT degree program.

Uploaded by

dhruvarakesh7254
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

VITMEE Syllabus

CS & IT – COMPUTER SCIENCE & ENGINEERING AND INFORMATION


TECHNOLOGY
Engineering Mathematics:
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, Bay’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 Raphson’s methods), simultaneous linear algebraic
equations (Gauss elimination, Croute’s, Gauss seidel and relaxation),
Interpolation methods (forward, backward and central), numerical integration
(Trapezoidal, Simpson’s and Weddle’s) eigenvalues and eigenvectors,
Numerical solutions to ordinary (Euler, modified Euler, Runga Kutta 4th order)
and partial differential (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.
Algebra and Complex Analysis: Algebra of matrices, rank and determinant of
matrices, linear equations. Eigenvalues and eigenvectors, Cayley-Hamilton
theorem. Matrix representation of linear transformations. Canonical forms,
diagonal forms, triangular forms, Quadratic forms, reduction and classification
of quadratic forms Analytic functions, Cauchy-Riemann equations. Contour
integral, Cauchy’s theorem, Cauchy’s integral formula, Taylor series, Laurent
series, calculus of residues. Conformal mappings, Mobius transformations—
Fourier series—harmonics.
Calculus and its Applications: Linear ordinary differential equations (ODEs),
variation of parameters, Sturm-Liouville problem. Partial differential equations
(PDEs) - Classification of second order PDEs, General solution of higher order
PDEs with constant coefficients, Method of separation of variables for Laplace,
Heat and Wave equations. Transformation techniques—Laplace
transformation—Fourier transforms—z—transformation to solve differential
and difference equations.
Numerical Methods: Numerical solutions of algebraic and transcendental
equations iteration methods and Newton—Raphson method, Solution of
systems of linear algebraic equations using Gauss elimination and Gauss-Seidel
methods -Numerical differentiation and integration, Numerical solutions of
ODEs and PDEs.
Descriptive statistics, Exploratory Data Analysis: Sample space, discrete
probability, independent events, Bayes theorem. Random variables and
distribution functions (univariate and multivariate) - expectation and
moments. Independent random variables, marginal and conditional
distributions. Characteristic functions. Standard discrete and continuous
univariate distributions. Correlation and simple and multiple linear regression.
Test of hypotheses —Large and small sample tests confidence intervals. Chi-
square test goodness of fit. Simple non parametric tests for one and two
sample problems, rank correlation and test for independence. ANOVA.
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.
Programming Language Processors: Compiler, Interpreter, assembler, Linker,
Loader, Macro processors, phases of compilers, Lexical analysis, parsing, Top-
down parsing and bottom up parsing, syntax directed translation, runtime
environment, Symbol table, type checking, intermediate Code generation,
Code optimization, code generation.
Algorithmic Analysis and Data Structures
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, code and query tuning
techniques, numerical analysis, power analysis & resiliency, intractable
problems.
Algorithms for Problem Solving: Tree and graph traversal, connected
components, spanning trees, shortest paths, hashing, sorting, searching, design
paradigms (Greedy, dynamic programming, divide and conquer).
Data Structures: Notion of abstract data types, stack, Queue, List, set, string,
Tree, binary search trees, heap, graph. Computer Architecture & Organization
and Operating Systems
Electronics: Network analysis, semiconductor devices, bipolar transistors,
FET’s, Power supplies, amplifier, Oscillators, Operational amplifiers, elements
of digital electronics, logic circuits.
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 pipe-
lining, Cache, main and secondary memory storage, organization and structure
of disk drives, RAID architectures Microprocessors: 8085, 8086, Interfacing and
memory addressing.
Operating Systems: Memory management, page faults, overlay, processor
management, device management, deadlocks, Process, thread and inter
process communication, CPU scheduling, file systems, I/O systems, protection
and security.
Software Engineering and Programming
System & Program Development Methodology: Software paradigms,
principles of programming in any language, documentation, system analysis
and design methodologies, User Interface Design (UID), software construction,
software testing, software quality, Object Oriented Analysis and Design
(OOAD) concepts.
Programming Methodology: Introduction to programming, pointers, arrays,
control structures, Iterational control structures, functions, recursion, testing,
debugging, code review, structures, files (C, C++, JAVA).
Computer Networks & Data Communications: Analog versus Digital
communication, modems, multiplexers, and concentrators, serial versus
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, switches, gateways, and
routers, security.
Computing Technologies: Client server computing, Logical layers in client
server architecture, Two-tier versus Three-tier, Distributed computing, Middle-
ware, Mobile Computing, Cloud Computing.
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, Basic concepts of transaction processing
, ACID properties of transactions, serializability of transactions, concurrency
control, recovery, OLAP.

You might also like