# NIT Calicut CSE Syllabus – PART I

Department of Computer Science & Engineering

Revised Syllabi (Brief) for BTech in Computer Science and Engineering

MA2001: MATHEMATICS III

Pre-requisite: MA1001 Mathematics I
L T P C
3 1 0 3
Probability distributions:- Random variables, Binomial distribution, Hyper- geometric distribution, Chebyshev’s
theorem, Poisson distribution, Geometric distribution, Normal Distribution, Uniform distribution, Gamma distribution,
Beta distribution, Weibull distribution. Joint distribution of two random variables. Sampling distributions and
Inference concerning means:- Population and samples, The sampling distribution of the mean, Sampling distribution of
the variance, Maximum Likelihood Estimation, Point estimation and interval estimation, Tests of hypothesis, Inference
concerning variances proportions:- Estimation of variances , Estimation of proportions, Analysis of r x c tables, Chi –
square test for goodness of fit. Regression Analysis:- Bi-variate Normal distribution- joint, marginal and conditional
distributions. Curve fitting, Method of least squares, Estimation of simple regression models and hypothesis concerning
regression coefficients, Correlation coefficient- estimation of correlation coefficient, Analysis of variance:- General
principles, Completely randomized designs, Randomized block diagram, Latin square designs, Analysis of covariance.
Total Hours: 56 Hrs
CS2001 LOGIC DESIGN
Pre-requisite: Nil
L T P C
3 0 2 4
Brief Syllabus:
Number systems and codes, Boolean algebra, K map: prime cubes, minimum sum of products and product of sums,
Quine-McClusky algorithm, prime implicant chart, cyclic prime implicant chart, Petrick’s Method, Combinational
decoders and encoders, code conversion, multiplexers and demultiplexers, parity generators and checkers,
Programmable Logic Devices, PLA folding, design for testability. Introduction to sequential circuits, memory elements,
latches, Flip-flops, analysis and design of sequential circuits, Mealy and Moore models, registers, shift registers,
counters.
Total Hours: 70 Hrs
CS2002 FOUNDATIONS OF PROGRAMMING
Pre-requisite: Nil
L T P C
4 0 0 4
Brief Syllabus:
Procedural Abstraction, Recursion, Data Abstraction, Combining different data types, Modularity, Objects, State
Modeling with mutable data, Concurrency, Metalinguistic Abstraction, Lazy evaluation.
Total Hours: 56 Hrs
EC2014 SIGNALS AND SYSTEMS
Pre-requisite: Nil
L T P C
3 0 0 3
Brief Syllabus:
Elements of signal theory – LTI and LSI systems – convolution – causality and stability – signal analysis – Fourier
representation – Fourier transform – spectral density – Hilbert transform – frequency domain analysis of LTI systems –
Sampling theorem – discrete Fourier transform – Laplace and Z transforms.
Total Hours: 42 Hrs
CS2091 LOGIC DESIGN LABORATORY
Pre-requisite: Nil
L T P C
1 0 3 3
Brief Syllabus:
Design and implementation of logic gates, adder and subtractor circuits, parity generators, code converters,
comparators, multiplexers, demultiplexers, flip-flops, shift registers, counters.
Total Hours: 56 Hrs
CS2092 PROGRAMMING LABORATORY
Pre-requisite: Nil
L T P C
1 0 3 3
Brief Syllabus:
Programming assignments in the language of choice to emphasize the concepts of procedural and data abstraction,
Design and Implementation of a simple language interpreter
Total Hours: 56 Hrs
MA2002: MATHEMATICS IV
Pre-requisite: MA1001 Mathematics I, MA1002 Mathematics II
L T P C
3 1 0 3
Series Solutions and Special Functions: Power series solutions of differential equations, Theory of power series method,
Legendre Equation, Legendre Polynomials, Frobenius Method, Bessel’s Equation, Bessel functions, Sturm- Liouville’s
Problems, Orthogonal eigenfunction expansions. Partial differential Equations: Cauchy’s problem for first order
equations, Linear Equations of the first order, Nonlinear Partial Differential Equations of the first order, Charpit’s
Method, Special Types of first order equations, Classification of second order partial differential equations, Wave
equation, Heat equation, Laplace equation, Solution of a Partial Differential Equations by Laplace transforms.
Complex functions, Derivative , Analytic function, Cauchy- Reimann equations, Laplace’s equation, Geometry of
Analytic functions: Conformal mapping, Linear fractional Transformations, Schwarz – Christoffel transformation,
Transformation by other functions, Line integral in the Complex plane, Cauchy’s Integral Theorem, Cauchy’s Integral
formula, Derivatives of analytic functions.Power series, Functions given by power series, Taylor series and Maclaurin’s
series. Laurent’s series, Singularities and Zeros, Residue integration method, Evaluation of real Integrals.
Total Hours: 56 Hrs
CS2004 COMPUTER ORGANIZATION
Pre-requisite: Nil
L T P C
3 0 2 4
Brief Syllabus:
Measuring performance-evaluating, comparing and summarizing performance, Computer arithmetic, integer and
floating point arithmetic, processor design, pipelined processors, memory hierarchy, caches and virtual memory,
Input/output design.
Total Hours: 70 Hrs
CS2005 DATA STRUCTURES AND ALGORITHMS
Pre-requisite: Nil
L T P C
4 0 0 4
Brief Syllabus:
Searching and sorting algorithms, dynamic memory and recursion, lists, stacks and queues, binary search trees,
hashing, B Trees, Graph search, Minimum Spanning Tree and shortest path algorithms.
Total Hours: 56 Hrs
CS2006 DISCRETE STRUCTURES
Pre-requisite: Nil
L T P C
4 0 0 4
Brief Syllabus:
Combinatorics – asymptotic analysis of recurrences – discrete probability- random variables -linearity of expectations –
introduction to groups, rings and fields – introduction to logic and set theory
Total Hours: 56 Hrs
CS2093 HARDWARE LABORATORY
Pre-requisite: Nil
L T P C
1 0 3 3
Brief Syllabus:
80X86 Assembly language programming-integer and floating point operations, string manipulation, Embedded System
experiments using RTLinux, Performance evaluation of various cache organizations and optimizations.
Total Hours: 56 Hrs
CS2094 DATA STRUCTURES LABORATORY
Pre-requisite: Nil
L T P C
1 0 3 3
Brief Syllabus:
Implementation of standard searching, sorting algorithms, tree, expression evaluation and graph algorithms.
Total Hours: 56 Hrs