INFORMATION TECHNOLOGY

3rd Semester

Sl. Course Name Course code Class Load/Week Credit Class

No load/week
L T P
1. Mathematics – III MA301 3 1 0 4 4
3. Programming & Data Structure IT 301 4 0 0 4 4
4. Digital Logic & Circuit Design IT 302 4 0 0 4 4
2. Discrete Mathematics & Graph theory IT 303 3 1 0 4 4
5. Signals, System & Circuits IT304 3 1 0 4 4
Theory Sub-total 17 3 NIL 20 20
6. Programming & Data structure lab IT 351 0 0 3 2 3
7. Digital Logic & Circuit Design Lab IT 352 0 0 3 2 3
Sessional Sub-total NIL NIL 6 4 6
3rd Semester Total 24 26

4th Semester
Sl. Course Name Course code Class Load/Week Credit Class
No load/
Week
L T P
1. Intro. to Mgmt. & Industrial Sociology HU3401 4 0 0 4 4
2. Computer Organisation & Architecture IT401 3 1 0 3 3
3. Communication Systems IT402 3 0 0 3 3
4. Computer Graphics IT403 3 0 0 3 3
5. Formal Language and Automata IT404 3 0 0 3 3
Theory Sub-total 15 4 NIL 16 16
6. Computer Graphics Lab. IT453 0 0 3 2 3
7. Computer Org. & Architecture Lab. IT451 0 0 3 2 3
8. Communication system lab IT 452 0 0 3 2 3
9. Modelling and Simulation Lab. IT455 0 0 3 2 3
Sessional Sub-total NIL NIL 12 8 12
4th Semester Total 24 28
 Detailed Syllabus
3rd Semester

MATHEMATICS-III (MA 301)

Weekly contact: 4– 0 – 0 (L-T-S) Full Marks: 100(Credit-4)

Sl. Module Name and Topics No. of

No. Classes
1. Probability : Intuitive Notion, Classical definition of probability, 14
Combinatorial applications, Axiomatic approach to probability theory,
Univariate probability distributions – discrete and continuous. Standard
distributions: Binomial, Poisson, Geometric, Hypergeometric, Exponential,
Normal, Uniform and Gamma. Bivariate distributions : concepts of joint and
conditional distributions, Mathematical expectation, variance and covariance,
Correlation coefficient, Tchebycheff’s inequality. Concept of convergence in
probability. Laws of Large Numbers (Statement only). Sample Distributions :
2, t and F
2. Statistics : Concept of Statistics, Elements of the theory of Point Estimation: 9
Unbiasedness and Mean Squared Error-Bias-variance decomposition.
Minimum Variance Unbiased Estimators. Maximum Likelihood Estimation.
Consistent Estimators. Interval Estimation: Confidence interval for mean of a
normal population. Correlation and Regression. Simple linear regression
model.
3. Laplace Transform: Definition, Laplace transform of elementary functions, 6
basic operational properties, Inverse Laplace transform, Convolution
Theorem, Applications to initial value problems involving Ordinary
Differential Equations.
4. Linear Programming Problem : Basic solution, reduction of basic solution 10
to basic feasible solution, convex combination, convex set, extreme points,
hyperplanes, slack and surplus variables, Simplex Method, Charnes’ Big-M
method , Two Phase method.
Total 39
 PROGRAMMING & DATA STRUCTURES ( IT 301)
Weekly contact: 3 – 1 – 0 (L – T – S) Full Marks: 100

Prerequisite: Concepts of C Language

Sl. Module Name and Topics No. of

No. Classes
1. Introduction:Functions; arrays; introduction to pointers; structures; dynamic 6
allocation; linked structures; time and space requirements.
2. Stack: Introduction, Array Implementation Multiple Stacks, Applications and use of 6
Stacks: Conversion from Infix to Postfix, Evaluation of Postfix Expressions, Prefix
Notation, etc.
3. Queue: Introduction, Linear Queue, Circular Queue, De-queue, Priority Queue, 4
ArrayImplementations of Queues, Applications of Queues, GeneralsLists.

4. Linked Lists:Introduction, pointer and Implementation, Linear Linked Lists, Circular 8

Linked Lists, Doubly Linked Lists, Doubly circular, Implementation of Linked Lists,
Linked Stacks and Queues, Application of Linked List: Polynomials, High precision
Arithmetic, Josephus Proble, etc.
5. Recursion: Recursion Algorithm, Type of Different Recursion Algorithms, Removal 2
of Recursion.
6. Binary Trees: Tree Terminology, Binary Tree, Binary Tree Representation, Binary 10
Tree Traversals, Threaded Binary Tree,Binary Search Tree Concepts and
Implementation.AVL Tree.
7 Search Methods:Linear search, Binary search, Complexities of the searching 4
algorithms.
8 Sorting: Introduction to sorting and Comparison of Sorting Techniques. 4

Total: 44

References:

1. Seymour Lipschutz, Data Structures, Schaum's Outlines Series, Tata McGraw-Hill.

2. Ellis Horowitz, SatrajSahni and Susan Anderson-Freed, Fundamentals of Data Structures in C, W. H.
Freeman and Company.
3. Goodrich, Michael T. & Roberto Tamassia, Algorithm Design, Wiley Singapore.
4. Cormen, Thomash H., Leiserson, Charles E., Rivest, Ronald L., & Stein, Clifford. Introduction to
Algorithms.
 DIGITAL LOGIC AND CIRCUIT DESIGN (IT 302)
Weekly contact: 3 – 1 – 0 (L – T – S) Prerequisite: None Full Marks: 100

Sl. Module Name and Topics No. of

No. Classes
1. Number systems and Codes: Number representation and Computer arithmetic 1
(fixed and floating point), Codes
2. Boolean Algebra and Minimization Techniques:Boolean Logic operations, Basic 3
laws, De Morgan's theorems, SOP/POS, K-map, Quine-McCluskey or Tabular
method
of minimization
Logic Gates:Logic Gates (OR, AND, NOT, NAND, NOR, Universal building blocks,
XOR, XNOR), Mixed Logic,Multilevel Gating networks, Multilevel output gate
3. networks 2

Logic Families: Digital Integrated Circuits, Introduction to logic families, CMOS

4. logic 2
5. Combinational Circuits:Multiplexers, Demultiplexers, Decoders, Application to 6
Liquid Crystal Display (LCD), Encoders, Parity Generator/Checker, Code converters,
Magnitude comparators, Applications
6. Arithmetic Circuits:Half adder, Full adder, Half subtractor, Full subtractor, Parallel 6
binary adder, Controlled Inverter, 4-bit parallel adder/subtractor, Fast adder, Serial
adder, Serial subtractor using 2's complement, 4-bit serial adder/subtractor, BCD
adder, Binary multiplier, Binary divider
7. Flip-Flops:Latches, Flip-Flops (Clocked SR, JK, D, T), Trigerring of Flip-flops, 6
Asynchronous inputs in flip-flops, Master-slave flip-flops, Realization of one flip-flop
using other, Flip-flop ICs, Applications
8. Counters:Asynchronous (Ripple or Serial) counters: Ripple counter with decoded 3
outputs, Ripple counter with modulus, Counter ICs, Asynchronous UP/DOWN
counter, Propagation delay in ripple counters, Synchronous (Parallel) counter:
Synchronous counter with ripple carry, Synchronous UP/DOWN counter,
Applications
9. Registers:Universal shift registers, Shift register counters, Sequence generator 2
10. Memory devices:Classification, Basic memory structure, ROM, RAM, Memory 3
decoding, Memory expansion, PLD
11. D/A and A/D converters:Analog and digital data conversions, Specifications of D/A 4
converter, Basic D/A conversion techniques (weighted resistor, R-2R ladder type
etc.), MDAC, Sampling process, A/D converters, Different A/D converters
(Successive
approximation, Single slope, Dual slope)
Applications of Digital Circuits:Frequency counter, Dot matrix display system,
12. Digital 2
multimeter etc.
Tota
l: 40
References:
Logic and Computer Design Fundamentals: by Mano, Kime: Pearson
Modern Digital Electronics: by Jain: TMH
Digital Design: by Mano
Digital Fundamentals: by Floyd, Jain: Pearson
Digital Circuits and Design: by Salivahanan, Arivazhagan: Vikas
th
Digital Principles and applications (5 Edition) : Leach & Malvino
Digital Computer Electronics : Malvino

DISCRETE MATHEMATICS AND GRAPH THEORY (IT 303)

Weekly contact: 3 – 1 – 0 (L – T – S ) Full Marks: 100
Prerequisite: Preliminary concepts of Sets

Sl. Module Name and Topics No. of

No. Classes
1. Logic and Proofs: Propositions, Conditional propositions and Logical Equivalence, 8
Predicate calculus, quantifiers, Normalization of well-formed-formulas, Method of
proofs, mathematical induction.
2. Language of Mathematics: Sets, sequences and strings, Number systems, Relations, 6
Equivalence relations, Matrices of relations, partial order sets, well order sets, quasi
order sets, lattice. Application to relational Databases, Functions, Inverse and
composition of functions, one-to-one correspondence.
3. Algebraic structures:Algebraic structures with one binary operation - semigroups, 8
monoids and groups. Free and cyclic monoids and groups, permutation groups,
normal subgroups. Algebraic structures with two binary operations - rings, integral
domains and fields. Boolean algebra and Boolean ring.
4. Counting methods: Basic principles of counting (Inclusion- exclusion, addition and 8
multiplication rules), permutations and combinations, algorithms for generating
permutations and combinations, binomial coefficients and combinatorial identities,
The pigeonhole principle. Introduction to Polya’s theory of counting.
5. Recurrence relations: Introduction, recursively defined sequences, solving 6
recurrence relations: the characteristic polynomial and generating functions.
Applications to analysis of algorithms.
6. Graph theory: Introduction to graphs and their basic properties: degree, paths and 8
cycles, subgraphs, isomorphism, Euler and Hamiltonian paths and cycles,
representation of graphs, connected graphs, planar graphs. Basic graph searching
algorithms: BFS and DFS. Basics of tree and spanning tree.
7 Coloring of Graph: graph coloring basics, chromatic number, 4-color problem. 4

Total: 48

References:

1. Discrete Mathematics and its Applications by Kenneth H Rosen, PHI

2. Discrete MATHEMATICS FOR Computer Scientists, J L Mott, A Kandel, and T P Baker
3. Concrete Mathematics: A Foundation for Computer Science, by Ronald Graham, Donald Knuth, and Oren
Patashnik
4. Graph Theory With Applications To Engineering And Computer Science, NarsinghDeo, Tata
McGraw Hill
5. Graph Theory, F Harary, Narosa
 IT-303: SIGNALS, SYSTEMS AND CIRCUITS
Weekly contact: 3 – 1 – 0 (L – T – S) Prerequisite: Vector space, probability and statistics Full Marks: 100
Objective:

signals.

Transient Analysis of the System.

igitization and reconstruction of Analog Signals
-correlation, power spectral
density

Sl. Module Name and Topics No. of

No. Classes
1. Introduction to signals: classification and representation, concepts of linear vector 4
space and orthogonal signal representation.
2. Fourier series, Fourier transform and its properties 6
3. Parseval’s theorem, Bandwidth of signals, duality of time and frequency 2
representations of signals.
4. Discrete time signal: sampling, digitization and reconstruction of analog signals. 6
5. Introduction to random signals and their properties: random variables and processes 6
for characterization and analysis of message signal and noise
6. Random process, classification of random processes, geometric representation of 10
random process, Gaussian random process, auto and cross-correlation, power spectral
density.
7 Introduction to system and classification, discrete time system, signal distortion in 8
transmission, distortionless conditions. linear time invariant (LTI) system, impulse
response, convolution, transfer function, Bandwidth of systems. System response to
random signals.
8 System realization as simple electrical circuit: Laplace transform and its properties, 6
inverse Laplace transform, application of Laplace transform for analysis of RC, RL
and RLC circuits, transient and steady state response.
Total 48
References:
1) Modern Analog and Digital Communication Systems, 4th Edition-B. P. Lathi & Z. Ding, Oxford
University Press
2) S. Haykin, Communication Systems- John Wiley
3) Linear Systems and Signals, B. P. Lathi, Oxford
4) Probability and Random Processes with Applications to Signal Processing- H. Stark, J. W.
Woods, Pearson Education Asia
5) A.V.Oppenheim, A.S.Willsky and S.H.Nawab -Signals & Systems, Pearson
6) S. Haykin & B.V.Veen, Signals and Systems- John Wiley