SCHEME OF EXAMINATION & SYLLABI

COMPUTER SCIENCE & ENGINEERING

B. Tech. Degree Course of

CALICUT UNIVERSITY

2004
ADMISSION ONWARDS
 2
COMBINED FIRST AND SECOND SEMESTER
Session
Hours/Week Uni./Exam.
Code Subject Marks
L T P/D Hrs Marks
EN04 101 Engineering Mathematics I 3 - - 50 3 100
EN04 102 Engineering Mathematics 11 3 - - 50 3 100
EN04 103 A Engineering Physics(A) 2 - - 50 3 100
EN04 104A Engineering Chemistry(A) 2 - - 50 3 100
EN04 105 Humanities 2 - - 50 3 100
EN04 106A Engineering Graphics(A) 1 - 3 50 3 100
EN04 107A Engineering Mechanics(A) 2 1 - 50 3 100
CS04 108 Computer Programming in C 2 - 1 50 3 100
EN04 109 Basic Electrical Engineering 2 1 - 50 3 100
EN04 110(P) Civil and Mechanical Workshop - - 3 50 - -
EN04 111(P) Electrical and Electronics Workshop - - 2 50 - -

TOTAL 19 2 9 550 - 900

Note : Details of Common Course

SL SUBJECT
NO. NAME OF SUBJECT COMMON FOR
CODE
1 EN04-10I MATHEMATICS-1 COMMON FOR ALL.
2 ENO4-102 MATHEMATICS-II COMMON FOR ALL.
3 ENO4-103A ENGINEERING PHYSICS(A) Al, S,EE,EC, IT,IC,BM,BT, PT
ENO4-103A(P) PHYSICS LAB(A) AI,EE,EC,1C,BM,BT
ENO4-103B ENGINEERING PHYSICS(B) CH,CE,ME,PE CH,CE.ME,PE
EN04-103B(P) PHYSICS LAB(B)
4 EN04-104A ENGINEERING CHEMISTRY(A) AI,CS,EE,EC,IT,IC,BM,BT,PT
EN04-104A(P) CHEMISTRY LAB(A) AI,EE,BC,IC,BM,BT
EN04-104B ENGINEERING CHEMISTRY(B) CE,ME,PE
EN04-104B(P} CHEMISTRY LAB(B) CE,ME,PE
ENO4-104C ENGINEERING CHEM1STRY(C) CH
EN04-104C(P) CHEMISTRY LAB(C) CH
5 EN04-105 HUMANITIES COMMON FOR ALL
6 EN04-106A ENGINEERING GRAPHICS(A) AI,CS,EE,IT,IC,PT,BM,BT
EN04-106B ENGINEERING GRAPHICS(B) CE,CH,ME,PE

7 EN04-107A ENGINEERING MECHANICS(A) AI,CH,CS,EE,EC,IT,IC,BM,B

EN04-107B ENGINEERING MECHANICS(B) T,PT CE.ME.PE
8 EC04-108 BASIC ELECTRONICS EC,BM,BT,AI,IC CS. IT. PT
CS04-108 COMPUTER PROGRAMMING IN C
9 EE04-I09 BASIC ELECTRICAL ENGINEERING AI,EE,EC,IC,BM,BT, CS,IT.PT
CS04-109 BASIC ELECTRICAL ENGINEERING
10 EE04-110(P) CIVIL AND MECHANICAL WORKSHOP EE,CS,IT,PT
EC04-110(P) MECHANICAL WORKSHOP EC,A1,BT,BM,IC
11 ELECTRICAL AND ELECTRONICS EE,EC,AI,BT,BM,CS, IT,IC,PT
EEO4-111(P)
WORKSHOP
 3

THIRD SEMESTER
Session University
Code Subject Hours/Week
Marks Exam
L T P/D Hrs Marks

EN04 301B ENGINEERING MATHEMATICS-III 3 1 - 50 3 100

DATA STRUCTURES AND
CSO4 302 ALGORITHMS 3 1 2 50 3 100
DISCRETE COMPUTATIONAL
CS04 303 3 1 - 50 3 100
STRUCTURES
CSO4 3O4 BASIC ELECTRONICS ENGINEERING 3 1 - 50 3 100
SWITCHING THEORY AND
CSO4 305 3 1 - 50 3 100
LOGIC DESIGN
CS04 306 ELECTRIC CIRCUITS AND SYSTEM 3 1 - 50 3 100

CS04307(P) PROGRAMMING LAB - - 3 50 3 100

CS04 308(P) ELECTRONIC LAB - - 3 50 3 100
TOTAL 18 6 6 400 - 800

FOURTH SEMESTER
Hours/Week Session University
Code Subject
Marks Exam
L T P/D Hrs Marks
EN04401B MATHEMATICS – IV 3 1 - 50 3 100
ENO4 402 ENVIRONMENTAL STUDIES 3 1 - 50 3 100
CS04 403 SYSTEMS PROGRAMMING 3 1 - 50 3 100
CSO4 4O4 MICROPROCESSOR BASED DESIGN 3 1 - 50 3 100
CSO4 405 COMPUTER ORGANISATION DESIGN 3 1 - 50 3 100
ELECTRONIC CIRCUITS AND
CS04 406 3 1 - 50 3 100
SYSTEMS
CS04 407(P) DATA STRUCTURE LAB - - 3 50 3 100
CS04 408(P) DIGITAL ELECTRONICS LAB - - 3 50 3 100
TOTAL 18 6 6 400 - 800

FIFTH SEMESTER
Hours/Week Session University
Code Subject Marks Exam
L T P/D Hrs Marks
CS4 501 Software Engineering 3 1 - 50 3 100
CS04 502 Digital Data Communication 3 1 - 50 3 100
CS04 503 Operating Systems 3 1 - 50 3 100
Numerical Analysis and Optimization
CSO4 5O4 3 1 - 50 3 100
Techniques
CSO4 505 Programming Paradigms 3 1 - 50 3 100
CS04 506 Theory of Computation 3 1 - 50 3 100
CS04507(P) Programming Paradigms Lab - - 3 50 3 100
CS04 508(P) Hardware Lab - - 3 50 3 100
TOTAL 18 6 6 400 - 800
 4

SIXTH SEMESTER
Hours/Week Session University
Code Subject Marks Exam
L T P/D Hrs Marks

CS04 601 Embedded Systems 3 1 - 50 3 100

CS04 602 Database Management 3 1 - 50 3 100
CS04 603 Computer Networks 3 1 - 50 3 100
Graph Theory and
CS04 604 Combinatorics 3 1 - 50 3 100
CS04 605 Compiler Design 3 1 - 50 3 100
Computer Graphics and
CS04 606 Multimedia 3 1 - 50 3 100

CS04 607(P) Systems Lab - - 3 50 3 100

CS04 608(P) Mini Project - - 3 50 - -
TOTAL 18 6 6 400 - 700

SEVENTH SEMESTER
Code Subject Hours/Week Session University
Marks Exam
L T P/D Hrs Marks
Industrial Management &
CS04 701 Economics 3 1 - 50 3 100
Cryptography and Network
CS04 702 Security 3 1 - 50 3 100
CS04 703 Distributed Systems 3 1 - 50 3 100
CS04 704 Design and Analysis of Algorithms 3 1 - 50 3 100
CS04 705 Elective I 3 1 - 50 3 100
CS04 706(P) Complier Lab - - 3 50 3 100
CS04 707(P) Seminar 1 - 4 50 - -
CS04 708(P) Project Work - - 3 50 - -
TOTAL 16 5 9 400 - 600

ELECTIVE – 1

CS04 705A - Digital Signal Processing

CS04 705B - Advanced Topics in Database Systems
CS04 705C - Simulation & Modeling
CS04 705D - Stochastic Processes
CS04 705E - Technical Argumentation
CS04 705F - Entrepreneurship.
 5

EIGHTH SEMESTER
Hours/Week Session University
Code Subject Marks Exam
L T P/D Hrs Marks

EC04 801 Information Retrieval 3 1 - 50 3 100

Computer Architecture and
EC04 801 Parallel processing 1
3 - 50 3 100
EC04 803 Internet Technologies 3 1 - 50 3 100
EC04 804 Elective-II 3 1 - 50 3 100
EC04 805 Elective-III 3 1 - 50 3 100
EC04 806 Networks Lab - - 3 50 3 100
EC04 807(P) Project Work - - 7 50 3 100
EC04 808(P) Viva Voce - - - - - 100
TOTAL 15 6 6 400 - 700

AGGREGATE FOR EIGHT SEMESTERS: 8250 2950 5300

ELECTIVE – II
CS04 804A Artificial Intelligence
CS04 804B Image Processing
CS04 804C Information Theory and Coding
CS04 804D Computational Complexity
CS04 804E Mobile Communication Systems
CS04 804F Quantum Computing

ELECTIVE – III
CS04 805A Neural Networks and Fuzzy Logic
CS04 805B Pattern Recognition
CS04 805C Management Information System
CS04 805D VLSI Design
CS04 805E Data Mining and Data Warehousing
CS04 805F Advanced Topics in Algorithms
 6
EN04- 101: MATHEMATICS I
(common for all B. Tech. programmes)
3 hours lecture per week

Module I: Differential Calculus (15 hours)

Indeterminate forms - L' hospital's rule - radius of curvature - centre of curvature -evolute -
functions of more than one variable - idea of partial differentiation – Euler's theorem for
homogeneous functions - chain rule of partial differentiation - applications in errors and
approximations - change of variables - Jacobians – maxima and minima of functions of two -
method of Lagrange multipliers.
Module II: Infinite Series (15 hours)
Notion of convergence and divergence of infinite series - ratio test - comparison test - Raabe's
test - root test - series of positive and negative terms - absolute convergence - test for
alternating series - power series - interval of convergence - Taylors and Maclaurins series
expansion of functions - Leibnitz formula for the nth derivative of the product of two
functions - use of Leibnitz formula in the Taylor and Maclaurin expansions.
Module III: Matrices (21 hours)
Rank of a matrix - reduction of a matrix to echelon and normal forms - system of linear
equations - consistency of linear equations - Gauss' elimination -homogeneous linear
equations - fundamental system of solutions - solution of a system of equations using matrix
inversion - Eigen values and eigen vectors - Cayley-Hamilton theorem - Eigen values of
Hermitian, skew-Hermitian and unitary matrices- Diagonalisation of a matrix using Eigen
values and Eigen vectors- quadratic forms- matrix associated with a quadratic form- definite,
semidefmite and indefinite forms
Module IV: Fourier series and harmonic analysis (15 hours)
Periodic functions - trigonometric series - Fourier series - Euler formulae - even and odd
functions - functions having arbitrary period - half range expansions -approximation by
trigonometric polynomials - minimum square error - numerical method for determining
Fourier coefficients - harmonic analysis
Reference Books
1. Michael D. Greenberg, Advanced Engineeing Mathematics(second edition), -
Pearson Education Asia.
2. Wylie C.R. and L.C. Barrent, Advanced Engineering Mathematics, McGraw Hill
3. Kreyszig E., Advanced Engineering Mathematics, Wiley Eastern
4. PiskunovN., Differential and Integral calculus, MIR Publishers
5. Ayres F., Matrices, Schaum's Outline Series, McGraw Hill
6. Sastry, S.S., Engineering Mathematics-Vol. 1 and 2., Prentice Hal! of India
Internal work assessment
60 % - Test papers ( minimum 2)
30 % - Assignments/Term project/any other mode decided by the teacher.
10 % - Other measures like Regularity and Participation in Class.
Total marks = 50.
University examination pattern
QI - 8 short type questions of 5 marks, 2 from each module
QII - 2 questions A and B of l5 marks from module I with choice to answer any one
QIII- 2 questions A and B of 15 marks from module II with choice to answer any one
QIV- 2 questions A and B of 15 marks from module III with choice to answer any one
QV - 2 questions A and B of I5 marks from module IV with choice to answer anyone.
 7
EN04 - 102: MATHEMATICS II
(common for all B. Tech. programmes)
3 hours lecture per week

Module I: Ordinary differential equations (21 hours)

Equations of first order - separable, homogeneous and linear types - exact equations -
orthogonal trajectories - linear second order equations -homogeneous linear equation of the
second order with constant coefficients -fundamental system of solutions -Solutions of the
general linear equations of second order with constant coefficients- method of variation of
parameters -Cauchy's equation - simple applications of differential equations in engineering
problems, including problems in mechanical vibrations, electric circuits and bending of
beams.

Module II: Laplace transforms (15 hours)

Gamma and Beta functions - definitions and simple properties - Laplace transform -inverse
transform - Laplace transform -shifting theorems-Transforms of derivatives and integrals -
differentiation and integration of transforms – transforms of unit step function and impulse
function - transform of periodic functions - solution of ordinary differential equations using
Laplace transforms.

Module III: Vector differential calculus (15 hours)

Vector function of single variable - differentiation of vector functions – scalar and vector
fields - gradient of a scalar field - divergence and curl of vector fields - their physical
meanings - relations between the vector differential operators.

Module IV: Vector integral calculus (15 hours)

Double and triple integrals and their evaluation - line, surface and volume integrals - Green's
theorem - Gauss' divergence theorem - Stokes' theorem (proofs of these theorems not
expected) - line integrals independent of the path.

Reference books
1. Michael D. Greenberg, Advanced Engineering Mathematics(second edition),
Pearson Education Asia.
2. Wylie C.R. and L.C. Barrent, Advanced Engineering Mathematics, McGraw Hill
3. Kreyszig E., Advanced Engineering Mathematics, Wiley Eastern
4. Piskunov N., Differential and Integral calculus, MIR Publishers
5. Ayres F., Matrices, Schaum's Outline Series, McGraw Hill
6. Sastry, S.S., Engineering Mathematics-Vol.1 and2., Prentice Hall of India

Internal work assessment

60 % - Test papers (minimum 2)
30 % - Assignments/Term project/any other mode decided by the teacher.
10 % - Other measures like Regularity and Participation in Class.
Total marks =50

University examination pattern

QI - 8 short type questions of 5 marks, 2 from each module
QII - 2 questions A and B of l5 marks from module I with choice to answer any one
QIII - 2 questions A and B of 15 marks from module II with choice to answer any one
QIV - 2 questions A and B of 15 marks from module III with choice to answer any one
Q V - 2 questions A and B of 15 marks from module IV with choice to answer any one.
 8

EN04 - 103A: ENGINEERING PHYSICS(A)

(common for AI, CS, EE, EC, IT, IC, BM,BT, PT)
2 hours lecture per week

Module I (11 hours)

Semi conductor Physics- Formation of energy bands in solids- Classification of solids on the
basis of energy band gap-Intrinsic and extrinsic semiconductors-Elemental and compound
Semiconductors- Fermi level in intrinsic semiconductor- Electron and hole concentrations in
intrinsic semi conductor in thermal equilibrium- Law of mass action-Electrical conductivity
of intrinsic semiconductor- Fermi level in n-type and p-type semiconductors- Electrical
conductivity of extrinsic semi conductor- Diffusion and total current. Application of semi
conductors- Band model of p-n junction- Junction diode and its characteristics-
characteristics of a transistor in common emitter configuration-Input, output resistance and
current amplification factor- Light emitting diode, photo diode, solar cell, photo resistor
(LDR),photo transistor, liquid crystal display(LCD) and zener diode- Avalanche and zener
breakdown- Application of zener diode as a voltage regulator. Hall effect in semiconductors-
Derivation of Hall coefficient-Determination of Hall coefficient by measuring Hall voltage-
Applications of Hall effect Super conductivity-Properties of superconductors (critical
magnetic field, Meisnner effect, critical current, flux quantisation)- Types of super
conductors- BCS theory of super conductivity (qualitative) - Josephon's effect- Theory of d.c.
Josephon's effect- SQUID - Applications of super conductivity.

Module II (11 hours)

Interference of light- Interference due to division of amplitude- Interference from plane
parallel thin films- Colours of thin films in reflected and transmitted light- Newton's rings-
Measurement of wavelength and refractive index- Thin wedge shaped film- Air wedge-
Testing of optical planeness of surfaces. Interferometry- Michelson's interferometer-Types of
fringes-Visibility of fringes-Application of Michelson's interferometer in determination of
wavelength of monochromatic light, resolution of spectral lines and refractive index of gases.
Diffration of light-Introduction of Fresnel and Fraunhoffer class of diffraction and their
distinction- Fresnels diffraction and rectilinear propogation of light-Diffraction pattern due to
straight edg and expression for intensity maximum and minimum- Fraunhoffer diffraction
-Simple theory of diffraction grating, its construction and working- Rayleigh's criteria, for
resolution of spectral lines- Resolving power and dispersive power of grating.

Module III (11 hours).

Poarisation of light- Double refraction- Huygen's explanation of double refraction in uniaxial
crystals-Positive and negative crystals- Nicol prism, construction and working -Quarter and
half wave plates- Theory of circularly and elliptically polarised light, their production and
detection- Rotatory polarisation- Laurent's half shade (brief explanation)- Laurent's half
shade polarimeter- Applications of polarised light. Laser physics- Basic concepts and
properties of laser-Spontaneous and stimulated emission- Expression for ratio of their
coefficients-Absorption,-population inversion and optical pumping-Construction and
components of a laser-Ruby,Helium and Neon and semiconductor lasers-Application of
lasers. Basic principle of holography and its application. Fibre optics- Basic principle -fibre
dimensions and construction- Step index single mode and multi mode- fibre- Graded index
fibre-Numerical aperature and acceptance angle- Signal distortion in optical fibres and
transmission losses( brief ideas only)- optic fibre communication (block diagram) and it's
advantages-Applications of optic fibres.
 9
Module IV (11 hours).
Planck's quantum theory- Absorbing power, reflecting power and transmitting power of a
body or surface- Perfect black body- Distribution energy in the spectrum of a black body-
Wein's displacement law- Planck's hypothesis-Derivation of Planck's law of radiation.
Quantum mechanics- Distinction between Newtonian and quantum mechanics- Schroedinger
wave equation for free particle -Potential in schrodinger equation -Time dependant and time
independent schroedinger equations and their derivations- Expectation values-Applications-
Particle in a box (motion in one dimension). Ultrasonics- Piezo electric effect- Piezo electric
crystal- Production of ultrasonics by piezo-electric oscillater- Detection of ultrasonics -
General properties and applications of ulltrasonics - Ultrasonic diffractometer and
determination of velocity of ultrasonics in a liquid.

Text books
1. Sreenivasan M .R, Physics for Engineers, New Age International
2. Vasudeva A.S; Modern Engineering Physics, S. Chand
3. S.O. Pillai, Solid state physics, New Age International.

Reference books
1. Tyagi, M.S. Introduction to semi conductor materials and devices,
John Wiley and Sons
2. Mayer, Intoduction to classical and modern optics, Arendt
3. John Senior, Fibre optic communiction
4. G Aruldhas Quantum mechanics Prentice Hall of India
5. Murukesan R. Modern Physics —S.Chand and Co
6. Brijlal and Subrahmanyam N, Text book of Optics, S. Chand
7. Kale Gokhale;. Fundamentals of Solid State Electronics, Kitab Mahal
8. Gupta S.L. and Kumar, V; Solid State Physics, K.Nath

Internal work assessment

60 % - Test papers (minimum 2)
30 % - Assignments/Term project/any other mode decided by the teacher. 10 % 10% - Other
measures like Regularity and Participation in Class.
Total marks = 50.

University examination pattern

QI - 8 short type questions of 5 marks, 2 from each module
QII - 2 questions A and B of l5 marks from module I with choice to answer any one
QIII- 2 questions A and B of l5 marks from module II with choice to answer any one
QIV- 2 questions A and B of 15 marks from module III with choice to answer any one
QV - 2 questions A and B of 15 marks from module IV with choice to answer any one
 10
EN04-104A: ENGINEERING CHEMISTRY(A)
(common for AI, CS, EE, EC, IT, IC, BM, BT, PT)
2 hours lecture per week

SECTION-1

CHEMISTRY OF ENGINEERING MATERIALS:

Module 1 (13 Hours)

Solids: Classification of solids with examples- (Crystalline - Polycrystalline -Amorphous -
Partially melted solids - (KCN) - Super cooled liquids - (Glass) - liquid crystals.)
(l Hour)

Crystalline state: Steno's law - Internal structure - Space lattices -Crystallographic axes- Law
of rational indices-Crystal systems - Elements of symmetry - X-ray study- Braggs equation
(derivation) single crystal and powder method -(Debye-Scherrer Camera) Cubic systems --
structure elucidation -d100: d110: d111 ratio (problems to be worked out) - crystal
imperfections(point-line-surface-volume -burgers vector- dislocations- edge and screw)
Physical properties, bonding characteristics and Structure relation of- (Covalent solids - Ionic
solids - metals) - metallic bonding- Stacking of atoms- (ABCABC....),(ABAB) - tetrahedral
and octahedral voids-Alloys - Hume Rothery rule-Conductivity - Resistivity -(Free electron
theory-explanation with Fermi - Diracstatistics)- Fermi level -Applications of conductors-
(transmission lines-OFHC Copper, ACSR, Contact materials, Precision resistors- heating
elements-Resistance thermometers)- Super Conductors (type I and II-examples)
(5 Hours)

Semi conductors - Band theory-(MOT) Valence band-Conduction band-intrinsic and extrinsic

semiconductors-Fabrication of semiconductor materials-Crystal Growth-ultra pure Silicon
production-zone refining-Fabrication of Integrated Circuits (IC).
(2 Hours)

Dielectric materials-Polarization - Ferro-electricity - Piezoelectricity - Applications with

examples- Introduction to Nano Science -Carbon nano tubes and nanowires
(l Hour)

Non-crystalline state - glass - properties - (applications- conducting glasses - solid supported

liquids (stationary phases in reverse phase chromatography)- Optical fibre
(l Hour)
Liquid crystals- Characterization- Nematic phases-Smectic Phases-Cholesteric Phases-
Columnar Phases- Chemical Properties-thermotropic-lyotropic - epitaxial- growth-
Freedericksz transition-applications -Liquid crystal thermometers- LCD displays
(3 Hours)

Reference books
1. J. D. Lee (1996) "Concise Inorganic Chemistry" Chapman and Hall Ltd. London,
pp-1032
2. S. Glasstone {1997) "Textbook of Physical Chemistry" Macmiilan, New Delhi,
pp-1320
3. P. W. Atkins (1987) "Physical Chemistry" Oxford University Press, Oxford, pp-857
4. P. W. Atkins and J. Depaula (2001)" Physical Chemistry" W.R Freeman and Co,
pp-1000.
 11

5. V. Raghavan (2000) "Material Science and Engineering-A First Course" Fourth

edition,
Prentice-Hall of India Pvt. Ltd, New Delhi, pp-485
6. L.H. Van Vlack (1998) "Elements of Materials Science and Engineering" Sixth
edition,
Addison-Wesley, London pp-598
7. J. W.Goodby (1997) "Chemistry of liquid crystals" VCH Publishing, pp-400.
8. K. W. KoIasinski (2002) "Surface Science: Foundations of Catalysis and Nano
science" John-Wiley and Sons, pp-326.
9. K. J.Klaubunde (2001) ''Nano scale Materials in Chemistry" Wiley-Interscience,pp-
304.
10. J.l.Gersten and F. W.Smith (2001)" The Physics and Chemistry of Materials" Wiley-
Interscience, pp-856

Module 2 (13 Hours)

High Polymers and Lubricants- Classification of Polymers-(Natural and Synthetic, Organic
and Inorganic, Thermoplasic and Thermosetting, Plastics, Elastomers, Fibres and liquid
resins) Polymerization (Chain polymerization Polythene- PVC- Teflon -polystyrene -poly-
methylmethacrylate) Condensation1 polymerization(Polyamide and Polyesters) Co-
polymerization (Buna-S, Buna-N, PVC- Co-polyvinylacetate, PAN-Co-poly vinyl
Chloride),Coordination polymerization (Ziegler- Natta Polymerization)-Electrochemical
Polymerization-Metathetical Polymerization-Group transfer Polymerization
(3 Hours)
Mechanism of polymerization (Cationic, anionic, and free radical).Polymerization
techniques( Bulk polymerization, Solution polymerization, Suspension polymerization,
Emulsion polymerization, Melt polycondensation, Solution polycondensation, Interfacial
condensation, Solid and Gas Phase Polymerization
(2 Hours)
Structure relation to properties(Chemical resistance, Strength, Plastic deformation,
Extensibility, Crystallinity) -Mol.Wt of Polymers-Number average Molecular wt, Weight
average Mol.wt- Gel Permeation Chromatography
(1 Hour)
Thermosetting resins (Bakelite, Urea-Formaldehyde, Silicones), Thermoplastic resins
(Acrylonitrile, PVC, PVA ,PS, PMMA, PE).-Fibres (Nylon6, Nylon66,NyIon6,10, Cellulose
fibres, dacron, Kevlar) Application of polymers in electronic and electrical industry.
Elastomers-Natural rubber-Structure- Vulcanization-Synthetic rubbers (Neoprene, Buna-S,
Buna-N, thiokol, Silicone rubber)
(3 Hours)
Compounding of Plastics (Fillers, Plasticizers, lubricants, pigments, antioxidants, Stabilizers)
and Fabrication (Calendering, Die Casting, Film casting, Compression, injection, Extrusion
and Blow moulding, Thermoforming, Foaming, Reinforcing)
(1 Hour)
Lubricants: Theory of friction - mechanisms of lubrication -Fluid film or hydrodynamic, thin
film or boundary lubrication, extreme pressure lubrication- Classification of Lubricants-
(Liquid(animaI and vegetable oils, Petroleum oiIs),Semi-solid (Ca-soap grease, Li-soap
grease, Al-soap grease, Axle grease) Solid lubricants (Graphite, Molybdenum di-sulphide-
Structure relation to lubrication property) and synthetic lubricants (Di-basic acid esters, Poly
glycol ethers, Organo phosphates, Organo silicones)). Properties of Lubricants (Viscosity
index, Cloud point and pour point, flash point and fire point, Corrosion stability,
 12
Emulsification, Aniline point). Additives and their functions (Fatty acids,
Sulphurised fats, Phenols, Calcium sulphonates, Organo-metallics, Hexanol, Amine
phosphates, Tricresyl phosphates, Silicon polymers)
(3 Hours)
Reference books
1. B.R.Gowarikeret.al (2002) "Polymer Science" New Age International pp-505
2. B.W.Gonser et.al (1964)" Modem Materials-advances in development and
application" Vol 1-7, Academic Press, New York.
Module - 3 (9 Hours)
Electrochemistry: Single Electrode potential (theory - Nernst equation, derivation from
thermodynamic principles) - types of electrodes (M|M+; M|MA|A-, M|A+, A+2, Pt|H21H+,
Pt|CL|Cl-, Pt|02|OH" -glass electrode) Electrochemical cells-concentration cells-Salt bridge -
Liquid junction potential- emf measurement - Poggendorf's compensation method- digital
method - electrochemical series - over voltage - theory - application in corrosion control -
Polarography- storage cells - lead acid, Ni/Cd, - Fuel cells - H2/O2 fuel cells(Bacon cell),
Hydrocarbon/air fuel cell-Bio-chemical fuel Cell.
(5 Hours)
Acid- Bases - (Lowry-Bronsted and Lewis concepts - examples) - concept of pH - pH
measurement- (instrumental details required) - Dissociation constants-Potentiometric
titrations-(Neutralization, Oxidation-reduction, and Precipitation) Buffer solutions -
Henderson's equation for calculation of pH.
(4 Hours)
Reference books
1 S. Glasstone (1997) “Text book of Physical Chemistry” Macmillan, New Delhi,
pp-1320.
2 P.W Atkins(1987)"Physical Chemistry Oxford University
3. C.A. Hampel (Ed)(1964)'Encyclopedia of Electrochemistry" Reinhold Publishing
Corporation, New York, pp-1206
4. A. Standen (Ed)(1964) "Kirk - Othmr Encyclopedia of Chemical Technology " Vol. 3
John Wiley and Sons. lnc, New York, pp-925.

SECTION – 2

CHEMISTRY OF MATERIAL AND ENVIRONMENTAL DAMAGE

Module - 4 (9 Hours) Material damages and prevention:

Corrosion - theoretical aspects -(electrochemical theory) - Galvanic series -Pourbiax diagram
- assessment of corrosion potential of materials - Types of corrosion - Dry corrosion-direct
chemical -Wet Corrosion-Electrochemical-differential aeration -Corrosion of Iron in acidic
neutral, basic condition (Corrosion in boilers) - Galvanic corrosion-(corrosion at contact
points in computers-Ag/Au)-Inter granular corrosion (18-8 Steel).Microbial corrosion-Factors
influencing corrosion.

Corrosion protection-Self protecting corrosion products-Pilling-Bedworth rule- Coatings

-Organic-(paints and polymers )-Inorganic Coatings-Galvanizing (dip coating, Sherardizing,
Wire-gun method)-Tinning- ElectropIating-(Chromium, Nickel), Anodization of Aluminium-
Passivation of metals by chemical treatment- Protection by Sacrificial Anode- Impressed
current.
(4 Hours)
 13

Environmental damages and prevention:

Pollution - Definitions - Classification of pollutants (Global, Regional, Local; Persistent and
Non-persistent; Pollutants - Eg: CO2, CO, SOx, NOx, VOC, SPM, CFC, POP, Dissolved
metals) - effects on environments -Air pollution – Fossil fuel burning - Automobile exhausts -
Photochemical smog - PAN, PBN formation-chemical equations required) - Stratospheric
Ozone depletion- CFCs -Nomenclature CFCs -Chapman cycle of Ozone formation- CFC
dissociation
and its reaction with Ozone -Alternate refrigerants — Monitoring of pollution -
gases (CO, SO2,NOX )and paniculate (High volume sampler) -Pollution from
thermal power plants - Coal composition- fly ash - Thermal pollution. Methods of control of
Air pollution - Bag filters, cyclones, Scrubbing, ESP, Catalytic converters -composition and
action with CO, NOs. Water pollution- Pollutant Classification-(Organic, Inorganic,
Suspended and Dissolved- Toxic metal waste- BOD-COD-) monitoring (analytical methods-
brief discussion) and control -Waste water treatment-Aerobic, Anaerobic-USAB process-
Industrial waste water treatment.- Soil pollution-Solid waste-radio nuclides-Toxic metals-
monitoring and. control-Incineration-Dioxins- hazardous waste - deep-well injection
(5 Hours)

Reference books
1. L L Shreir (Ed) ''Coirosion Control” Vol 1 and II Newnes-Butterworths, London.
2 C. A. Harnpel (Ed) "Encyclopedia of Electrochemistry' Reinhold Publishing
corporation, pp-1206.
3. V Raghavan (2000) 'Material Science and Engineering – A First Course “Prentice-
Hall of India Pvt. Ltd, New Delhi, pp-485.
4 A. K. De (I996), "Environmental Chemistry Newage International Pvt. Ltd.,
New Delhi pp-364.
5 C.N. Sawyer and P. L. McCarty (1986) “Chemistry for Environmental
Engineering” McGraw Hill Book Company, New Delhi – pp-530.
6 H. S. Peavy, D. R. Rowe and G.T. Chobangoglus(1985) “Environmental
Engineering” MaGraw Hill International, pp-720.
7. S P Mahajan (1985) “Pollution Control in Process Industries " Tata McGraw Hill,
New Delhi – pp-273.
8. S. E. Manahan (1975) “Environmental Chemistry” Willard Grant Press Boston,
pp-532.

Internal work assessment

60 % - Test papers (minimum 2)
30 % - Assignments/Term project/any other mode decided by the teacher.
10 % - Other measures like Regularity and Participation in Class.
Total marks = 50.

University examination pattern

QI - 8 short type questions of 5 marks, 2 from each module
QII - 2 questions A and B of l5 marks from module I with choice to answer any one
QIII- 2 questions A and B of l5 marks from module II with choice to answer any one
QIV - 2 questions A and B of 15 marks from module III with choice to answer any one
QV - 2 questions A and B of 15 marks from module IV with choice to answer any one.
 14
EN04-105: HUMANITIES
(Common for all B. Tech. programmes)
2 hours lecture per week

Module I (10 hours) Introduction to English usage and grammar-

Review of grammar - affixes, prefixes, suffixes, participles and gerunds -transformation of
sentences - commonly misspelt words - correction of mistakes - punctuation - idioms - style -
vocabulary building.
Reading comprehension -
Exposure to a variety of reading materials, articles, essays, graphic representation,
journalistic articles, etc.

Writing comprehension-
Skills to express ideas in sentences, paragraphs and essays.

Module II (10 hours) Technical communication and report writing

Need, importance and characteristics of technical communication -correspondance on
technical matters-aspects of technical description of machinery, equipment and processes -
giving instructions in an industrial situation - note taking and note making - correspondence
on technical topics -different types of technical reports.

Module III (14 hours) History of science and technology

Science and technology in the primitive society - the development of human civilization from
primitive to modern society- impact of sciences and technology on societies - Cultural and
industrial revolutions - the rise and development of early Indian science - contribution of
Indian scientist-JC Bose CV Raman Visweswaraya-Ramanujam and Bhabha- Gandhian
concepts- recent advances in Indian science
Module IV (10 hours) Humanities in a technological age
Importance of humanities to technology, education and society - relation of career interests of
engineers to humanities - relevance of a scientific temper -science, society and culture

Reference Books:
1. Huddleston R., English Grammer - An outline, Cambridge University Press
2. Pennyor, Grammar Practice Activities, Cambridge University Press
3. Murphy, Intermediate English Grammar, Cambridge University Press
4. Hasgemi, Intermediate English Grammar – Supplementary Exercise with answer”
Cambridge University Press.
5. Vesilind; Engineering Ethics and the Environment, Cambridge University Press.
6. Larson E; History of Inventions, Thompson Press India Ltd..
7. Bemal J.D., Science in History, Penguin Books Ltd.
8. Dampier W.C., History of Science", Cambridge University Press.
9. Encyclopedia Britannica, History of Science, History of Technology.
10. Subrayappa; History of Science in India, National Academy or Science, India.
11. Brownoski J., Science and Human Values, Harper and Row.
12. Schrodinger, Nature and Greeks and Science and Humanism, Cambndge University
Press.
13. Bossel, H, Earth at a Crossroads - paths to a sustainable Future, Cambridge
University Press.
14. McCarthy, English Vocabulary in Use, Cambridge University Press.
15. Anna University, English for Engineers and "Technologists, Orient Longman.
16. Meenakshi Raman etal, Technical Communication-Principles and practice.
 15

Internal work assessment

60 % - Test papers (minimum 2)
30 % - Assignments/Term project/any other mode decided by the teacher.
10 % - Other measures like Regularity and Participation in Class.
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks, 2 from each module
QII - 2 questions A and B of l5 marks from module I with choice to answer any one
QIII- 2 questions A and B of l5 marks from module II with choice to answer any one
QIV - 2 questions A and B of 15 marks from module III with choice to answer any one
QV - 2 questions A and B of 15 marks from module IV with choice to answer any one.
 16

EN04- 106A: ENGINEERING GRAPHICS(A)

(common for AI, CS, EE, EC, IT, IC, PT, BM,PT)
1 hour lecture and 3 hours drawing

Module-0 ( 8 Hours -1 Drawing exercise)

Drawing instruments and their use - different types of lines - lettering and dimensioning -
familiarization with current Indian Standard Code of practice for general engineering
drawing. Construction of ellipse, parabola and hyperbola. Construction of cycloid, involute
and helix. Introduction to Computer Aided Drafting. (For practice only, not for University
Examination)

Module - 1 (12 Hours - 3 drawing exercises)

(a) Introduction to orthographic projections - vertical, horizontal and profile planes -
principles of first angle and third angle projections. Projections of points in different
quadrants. Orthographic projections of straight lines parallel to one plane and inclined to
the other plane - straight lines inclined to both the planes and occupied in one quadrant-
traces of lines.
(b) True length and inclination of a line with reference planes. Line occupied in
more than one quadrant. Line inclined to the two reference planes but parallel
to the profile plane. line dimensioned in surveyor's unit.

Module - II (16 Hours - 3 drawing exercises)

(a) Projections of plane laminae of geometrical shapes parallel to one plane and inclined to
the other plane - plane laminae inclined to both the planes. Auxiliary projections of plane
laminae. Projections of laminae inclined to the two reference planes but perpenticular to
the profile plane.

(b) Projections of polyhedra and solids of revolution - frustums - projections of solids with
axis parallel to one plane and inclined to the other plane. Projections of solids with the
axis inclined to both the planes.(Solids to be drawn : Cube, prisms, pyramids, tetrahedron,
cone, and cylinder.)Projections of solids on auxiliary planes. Projections of combinations
of solids. ( Solids to be drawn : Prisms, pyramids, tetrahedron, cube, cone, and sphere)

Module-III (12 Hours - 3 drawing exercises)

(a) Sections of solids - sections by planes parallel to the horizontal or vertical
planes and by planes inclined to the horizontal or vertical planes. True shape of section by
projecting on auxiliary plane, ( Solids to be drawn : Cube, prisms, pyramids, tetrahedron,
cone, and cylinder.)

(b) Development of surfaces of solids - method of parallel line, radial line, triangulation and
approximate developments. Development of polyhedra, cylinder, cone, and sectioned
solids. Development of solids having hole or cut.

Module-IV (12 Hours - 3 drawing exercises)

(a) Introduction to isometric projection - isometric scale - isometric views - isometric
projections of prisms, pyramids, cylinder, cone, spheres, sectioned solids and
combinations of them. Principle of oblique projection - cavalier, cabinet and general
oblique projections of solids and simple objects.
(b) Introduction to perspective projections - Classification of perspective views - parallel,
angular and oblique perspectives - visual ray method and vanishing point method of
drawing perspective projection- perspective views of prisms, pyramids and circles.
 17

Module-V (12 Hours - 6 drawing exercises)

(a) Introduction to multiview projection of objects - the principle of the six orthographic
views - convertion of pictorial views of simple engineering objects into orthographic
views.

(b) Conventional representation of threaded fasteners. Drawing of nuts, bolts, washers and
screws. Locking arrangements of nuts. Bolted and Screwed joints. Foundation bolts of
eye end type, hook end type and split end type.

NOTE: All drawing exercises mentioned above are for class work. Additional exercises
where ever necessary may be given as home assignments.

Text books
1. John K.C., Engineering Graphics, Jet Publications
2. P.I. Varghese, Engineerng (Graphics, VIP Publications'
3. Bharr N.D., Elementary Engineering Drawing, Charotar Publishing House

Reference books
4. LuzadderW. J., Fundamentals of Engineeiing Drawing, Prentice Hall of lndia
5. Narayanana K. I. and Kannaiiah P, Engineering Graphis, Tata McGraw Hill
6. Gill P. S., Geomatrical Drawing , Kataria and sons

Internal work assessment

Drawing exercises (Best 10) 10x3 = 30
2 Tests 2x10 = 20
Total marks = 50

University examination pattern

No questions from module 0
QI - 2 questions A and B of 20 marks from module I with choice to answer any one
QII- 2 questions A and B of 20 marks from module II with choice to answer any one
QIII - 2 questions A and B of 20 marks from module III with choice to answer any one
QIV - 2 questions A and B of 20 marks from module IV with choice to answer any one
QV - 2 questions A and B of 20 marks from module I with choice to answer any one
 18

EN04- 107A: ENGINEERING MECHANICS(A)

(Common for AI, CH, CS, EE, EC, IT, IC, BM, BT, PT)
2 hours lecture and 1 hour tutorial per week

Objectives
1. To acquaint the student with general methods of analyzing engineering problems.
2. To illustrate the application of the methods to solve practical engineering
problems

Module I (17 hours)

Principles of statics - Free body diagrams - Coplanar forces and Force systems -Resultant and
equilibrium conditions for concurrent, parallel and general system of forces - Solution of
problems by scalar approach.
Introduction to vector approach (Application to simple problems only) - Concurrent forces in
space - Resultant - Equilibrium of a particle in space - Non-concurrent forces in space -
Resultant of force systems.

Module II (17 hours)

Friction - Laws of friction - Simple contact friction problems - Wedge - Screw jack and its
efficiency.
Properties of surfaces - First moment and centroid of curve and area - Centroid of composite
plane figures - Theorems of Pappus-guldinus- Second moments of plane figures and
composite sections - Transfer theorems - Polar moment of area - Product of area and
Principal axes (conceptual level treatment only). Moment of inertia of a rigid body - M.I of a
lamina - M.I of 3 dimensional bodies (cylinder, circular rod, sphere).

Module III (17 hours)

Introduction to structural mechanics - Different types of supports, loads and beams -
Reactions at supports. Shear force and Bending moment in beams -Shear force and bending
moment diagrams for cantilever and simply supported beams (only for concentrated and
uniformly distributed load cases). Plane trusses - Types of trusses (Perfect, Deficient and
Redundant trusses) -Analysis of trusses - Method of joints - Method of sections.

Module IV (15 hours)

Kinetics of rectilinear motion - Newton's second law- D'Alembert's principle -Motion on
horizontal and inclined surfaces - Analysis of lift motion - Motion of connected bodies.
Curvilinear motion - Equation of motion - Tangential and normal acceleration -Centripetal
and centrifugal forces - Motion of vehicles on circular path. Work, Power and Energy - Work
done by a force - Work of the force of gravity and force of spring - Work-energy equation -
Transformation and conservation of energy - Applications to problems.
Kinematics of rotation - Rigid body rotation about a fixed axis - Rotation under the action of
constant moment.

Introduction to mechanical vibrations - Simple harmonic motion- free vibration - Oscillation

of spring - Torsional vibration.

Text Books
1. Timoshenko and Young, "Engineering Mechanics", McGraw Hill Publishers
2. Hibbeler, Engineering Mechanics, Vol.1 statics, Vol II Dynamics, Pearson
3. Shames, I.H., "Engineering Mechanics- Statics and Dynamics", Prentice
Hall of India.
 19

Reference Books
1. Beer,F.P. and Johnson, E.R., "Mechanics for Engineers- Statics and Dynamics",
McGraw Hill Publishers.
2. Rajasekharan and Sankarasubramanian, "Engineering Mechanics", Vikas
Publishing House.

Internal work assessment

60%- Test papers (minimum)
30%- Assignment / Term Project/any other mode decided by the teacher.
(atleasst one assignment should be computer based using spread sheet or suitable
tools)
10 % - Other measures like Regularity and Participation in Class
Total marks =50

University examination pattern

QI - 8 short type questions of 5 marks, 2 from each module (in which atleast 5 questions to
be Numerical)
QII - 2 questions A and B of 15 marks from module! with choice to answer anyone
QIII - 2 questions A and B of 15 marks from module III with choice to answer any one
QIV - 2 questions A and B of l5 marks from module III with choice to answer any one.
Q V - 2 questions A and B of 15 marks from module IV with choice to answer any one
(QII to V can have subdivisions and at least 80 % weightage for numerical problems)
 20

CS04 -108 : COMPUTER PROGRAMMING IN C

(Common for CS, IT,PT)
2 hours lecture and 1 hour practical per week

Module I (15 hours)

Programming and problem solving - Functional units of a computer - High level and low
level languages - Steps involved in computer programming -Developing algorithms and flow
charts - Efficiency of algorithms - Running, debugging and testing of programs - Program
design methods - Top-down modular programming - measures of program performance-
Introduction to operating system.

Module II (15 hours)

Overview of C - Introduction - Basic structure of C programs - Executing a C program -
Constants, Variables and Data Types and sizes - Operators and Expression -Implicit type
conversion, explicit type casting- precedence- syntax notations- Managing Input and Output-
formatted I/O- Decision Making and Branching -break and continue-Looping.

Module III {16 hours)

Arrays -one dimensional and multidimensional arrays- Handling of character strings -
Functions ~ introduction -user-defined functions - form of C functions - Return values and
their types - Calling a function - Category of functions -Handling of non-integer functions -
Recursion - Functions with arrays - Scope and lifetime of variables in functions - Structures
and Unions- Pointers - Declaring and initialising pointers- Pointers and arrays- Pointers and
functions Dynamic memory allocation-, calloc, free, ralloc- basic concepts of linked lists-Bit
fields.

Module IV (20 hours)

File Management in C - Introduction - Defining and opening a file - Closing a file - Input/
Output operations on files formatted I/O files - The unix system interface: File descriptors,
Low level I/O- read and write- open, create, close unlink -Random access -Iseek - I/O error
handling - stderr -exit- An implementation of fopen and getc- Implementation of sequential
access file records - random access file records.

Programme development - command line arguments- Scope and linkage in the context of a
project- Environmental variables provided by OS- Preprocessing and portability of program
to multiple platforms-Standardised C library header files Programming with standard I/O -
Assessing environment from within program-unix system calls - Handling processes, signals
and interrupts as examples Debugging runtime errors - Diagnostic header file assert.h -
Introduction Unix 'make' utility- Introduction to Unix 'version control system'.

Text books

1. E.Balagurusamy;ProgramminginAnsiC;2.1 Edition; Tata McGraw Hill

2. Brian W Kernighan and Rob Pike, The Unix programming environment,
Printice Hall of India
3. Brian W Kemighan, Dennis M Ritchie; C Programming Language; 2nd edition
Prentice Hall of India
 21

Reference books
1. G. Michael Schneider, Steven W. Weingart, David M. Perlman; An Introduction to
Programming and Problem solving with Pascal; 2nd edition John Wiley
2. Byron Gottfried; Programming with C; 2nd edition; Tata McGraw Hill
3. K.R Venugopal, Sudeep R Prasad; Programming with C; Tata McGraw Hill
4. Yashavant Kanetkar; Let Us C; 3rd edition; BPB Publications.
5. Barrett & Wagner; C and Unix : Tools for Program Design; John Wiley
6. Deitel H.M & Deitel P.J; C How to Program; Pearson Education Asia

Internal work assessment

60 % - Test papers (minimum 2)
30 % - Assignments/Term project/any other mode decided by the teacher.
10 % - Other measures like Regularity and Participation in Class.
Total marks = 50

University examination pattern

Q1 - 8 short type questions of 5 marks,2 from each module
QII - 2 questions A and B of 15 marks from module I with choice to answer any one
QIII- 2 questions A and B of 15 marks from module II with choice to answer any one
QIV- 2questions A and B of l5rnarks from module III with choice to answer any one
QV - 2questions A and B of l5marks from module IV with choice to answer anyone.
 22
CS04 -109 : BASIC ELECTRICAL ENGINEERING
(common for CS, IT, PT)
2 hours lecture and 1 hour tutorial per week

Module 1 (16 hours)

Elementary Concepts - Voltage, current, Electric energy and power, Basic Circuit Elements,
Independent sources, Modeling, Linear Circuits. Resistive Circuits - Resistances in Series and
Parallel, voltage and current division, Star-delta Conversion, Network reduction, Source
Representation d Conversion, Mesh Analysis, Superposition, Thevenin and Norton
Theorems. Reactive Circuits - Inductance and capacitance, RL/RC Circuit Transients,
Quiescent Circuit, Duality of Networks, RLC transients, Circuit Analysis, Circuit response to
Pulse and Impulse Excitations.
Module II (18 hours)
AC single phase circuits - Sinusoidal Voltage and Current, RMS and Average Values, Form
factor and Peak factor, Phasor representation, Kirchoff's Voltage and Current laws, RLC
series and parallel circuits, Power in steady state, Resonance in series and parallel circuits.
Three - Phase Circuits - Three phase Voltages and Currents, Phasor diagram, Star & delta
connections, Three-phase power, Three- phase Circuit Analysis, Star-delta conversions,
Measurement of Three phase Power using single and two watt meter methods. Circuit
Analysis by Laplace Transformation - Definition and properties of Laplace and Inverse
Laplace Transforms, Partial fraction expansion, Circuit analysis, Transformed Networks,
Circuit transients using Laplace transform.
Module 111 (16 hours)
Magnetism - Magnetic Circuits & Induction - Induced emf, Self and mutual inductance,
energy stored in magnetic field, Coupled Circuits. Transformers- Construction, Core Types,
Rating, Induced emf, Ideal Transformers, Magnetizing and Core Loss Current, Equivalent
Circuit of a transformer, Voltage Regulation, efficiency, Autotransformers, Three- Phase
Transformers (basic idea only).
DC Machines - Constructional features of various types of DC machines, Circuit model,
Commutation, Excitation, Magnetization characteristic, shunt generator, other DC generators,
Characteristics of DC motors, speed control (armature and field control methods), Principle
of operation of Series - Shunt and Compound motors, Applications.
Module IV (16 hours)
Synchronous machines - Types and Constructional features, Principle of Operation, Voltage
regulation (using emf and mmf methods), Synchronizing to Mains, Starting a Synchronous
Motor, Damper winding, Speed Control. Induction Machine - Constructional features,
Squirrel-cage and Slip - Ring motors, Equivalent Circuits, Speed control, Comparisons and
Applications. Measurement Technique and Instrumentation - Classification and types of
instruments, Construction and working of moving coil / moving iron voltmeter and ammeter -
Dynamo meter type watt meter - Induction type energy meter, Bridge Measurement,
Electronic Voltmeter and Multimeter, Measurement of Electronic Components, Q-Meter,
Frequency and Phase measurement, Digital instruments.
Text books
1. Kothari DP &NagrathU, Theory and Problems of Basic Electrical Engineering;
Prentice-Hall of lndia.
2. William H. Hoyt and Jack E Kemmerly, Engineering Circuit Analysis, Tata
McGraw Hill.
3. SawhnyA. K, A course in electrical & electronics measurements and
instrumentation, Dhanrai.
 23

Reference books
1. Chakrabarthi A Circuit Theory (Analysis and Synthesis), Dhanpat Rai & Co. (Pvt) Ltd
2. Smith R.J& Dorf R.C, Circuits, Devices and Systems John Wiley
3. Cohon H. Fundamentals of Electrical Engineering ELBS
4. Srinivasa Murthy R V. Basic Electrical Engineering.
5. Edminister J. A., Electric Circuits, Schaum’s series, McGraw Hill.

Internal Work Assessment

60 % - Test papers (minimum 2)
30 % - Assignments/Term project/any other mode decided by the teacher.
10 % - Other measures like Regularity and Participation in Class-
Total marks = 50

University examination pattern

Q1 - 8 short type questions of 5 marks,2 from each module
QII - 2 questions A and B of 15 marks from module I with choice to answer any one
QIII - 2 questions A and B of 15 marks from module II with choice to answer any one
QIV - 2questions A and B of l5 marks from module III with choice to answer any one
Q V - 2 questions A and B of 15 marks from module IV with choice to answer any one.
 24
CS04-110(P): CIVIL AND MECHANICAL WORKSHOP
(Common for EE, CS, IT, PT)
3 hours practicals per week (Part A and Part B in alternate week)

Part A: Civil engineering workshop(33 hours)

1. Chain surveying - study of instruments and chain survey traverse
2. Compass surveying - study of instruments and compass traverse
3. Plane table surveying - study of instruments and plane tabling by
intersection and radiation methods
4. Plane table surveying - plane table traverse
5. Levelling - study of instruments, temporary adjustments of dumpy level
6. Fly levelling
7. Theodolite surveying - study of instruments, temporary adjustments,
8. Theodolite surveying - measurement of horizontal angles by reiteration method and
repetition method
9. Study of electronic distance/ level measuring equipment (or total station)

Internal work assessment

Surveying practicals and record -15
Test -10
Total marks =25

Part B: Mechanical engineering workshop (33 hours)

Machine shop practice (9 hours)
Study of different machine tools - lathe, shaper, milling machine, drilling machine grinding
machine - exercises on lathe - models involving straight turning, taper turning, facing
knurling, and thread machining.
Fitting practice (6 hours)
Study of hand tools and measuring tools used in fitting work - fabrication exercises involving
cutting, chiseling, filing and drilling - use of thread dies and taps.
Welding practice (6 hours)
Study of electric arc welding and gas welding equipments - accessories and tools - safety
practices - exercises involving preparation of different types of welded joints - lap and butt
joints - gas cutting equipment and demonstration.
Sheet metal practice (6 hours)
Study of shearing bending and folding machines, press brake etc. used in sheet metal work -
hand tools in sheet metal work - development and fabrication of simple sheet metal
components like cylindrical dish, funnel, rectangular duct, tray, panel board etc. - soldering
and brazing of joints - die cutting operations.
Carpentry practice (6 hours)
Wood and its processing - shop equipment - measuring and marking tools -wood working
hand tools - wood working machinery - preparation of joints -lap, butt, dovetail, mortise and
tenon and bridle joints - wood turning.

Internal work assessment

Surveying practicals and record -15
Test -10
Total marks =25
 25

EC04- 111(P): ELECTRICAL AND ELECTRONICS

WORKSHOP
(Common for EE, EC, AI, IC,BT, BM, CS, IT, PT)
2 hours practicals per week

Part A: Electrical Workshop (2 hours per alternate weeks)

1. Familiarisation of various types of Service mains - Wiring installations -

Accessories and house-hold electrical appliances
2. Methods of earthing - Measurement of earth resistance - Testing of electrical
installations - Precautions against and cure from electric shock.
3. Practice of making Britannia joints on copper / aluminium bare conductors
4. Practice of making Married joints on copper / aluminium conductors
5. Practice of making T joints on copper / aluminium conductors
6. Wiring practice of a circuit to control 2 lamps by 2 SPST switches
7. Wiring practice of a circuit to control 1 lamp by 2 SPDT switches
8. Wiring practice of a circuit to control 1 fluorescent lamp and 1 three-pin
plug socket
9. Wiring practice of a main switch board consisting of ICDP switch, DB,
MCB's, and ELCB's
10. Familiarisation of various parts and assembling of electrical motors and
Wiring practice of connecting a 3-phase / 1-phase motor with starter

Internal work assessment

Surveying practicals and record -15
Test -10
Total marks =25

Part B - Electronics Workshop (2 hours per alternate weeks)

1. Familiarisation of various electronics components such as resistors, AF&RF

chokes, capacitors, transistors, diodes, IC's and transformers
2. Assembling and soldering practice of single phase full wave bridge rectifiers
circuit with capacitor filter
3. Assembling and soldering practice of common emitter amplifier circuit
4. Assembling and soldering practice of common emitter amplifier circuit on PCB
5. Assembling and soldering practice of non inverter amplifier circuit using OPAMP on
PCB.
6. Assembling of a timer circuit IC555, phase shift oscillator circuit using OPAMP and
JK flip-flop using NAND gates on a bread-board.
7. Coil winding - Single layer and multi layer - Demonstration.
8. Miniature transformer winding – Demonstration
9. PCB layout using software like ORCARD, CIRCUITMAKER, EDWIN.
10. PCB fabrication – Demonstration

Internal work assessment

Surveying practicals and record -15
Test -10
Total marks =25
 26

THIRD SEMESTER

EN04 301B: MATHEMATTCS - III

(Common with IT)
3 hours lecture and 1 hour tutorial per week

Module I: Linear Algebra (13 hours)

Vector spaces - Linear dependence and independence, and their computation -Bases and
dimension - Subspaces-Gram-Schmidt orthogonalization process -Linear transformations -
Elementary properties of linear transformations - Matrix of a linear transformation (Proofs of
Theorems are not required).

Module II: Fourier integrals and Fourier transforms (13 hours)

Fourier integral (Proof not required)-Fourier sine and cosine integral representations-Fourier
transforms-Fourier sine and cosine transforms-Properties of Fourier transforms-Singularity
functions and their Fourier transforms.

Module III: Complex Analytic Functions (13 hours)

Function of a complex variable-Derivative-Analytic function-Cauchy-Reimann equations-
Laplace's equation-Conformal mapping-Exponential function -Trigonometric functions-
Hyperbolic functions-Logarithm-Linear fractional transformations.

Module IV: Complex Integrals (13 hours)

Line integral in the complex plane - Cauchy's integral theorem (Proof of existence of
indefinite integral to be omitted) - Cauchy's integral formula - Derivatives of an analytic
functions (Proof to be omitted) - Taylor series - Laurent series - Singularities and zeros -
Residue integration method -Evaluation of real integrals.

Text book

Module 1: K.B. Datta, Matrix and Linear algebra for engineers, Prentice hall of India
Module 2: Wylie C.R and Barret L.C, Advanced Engineering Mathematics 6th Edition,
McGraw Hill
Module 3: Erwin Kreyszig - Advanced Engineering Mathematics 8th Edition, John Wiley &
Sons
Module 4: Erwin Kreyszig - Advanced Engineering Mathematics 8th Edition, John Wiley &
Sons.

Reference books

1. R.S.L Srivastava, Engineering Mathematics (Volume II) Tata McGraw Hill.

2. S.Narayan, T K Manicavachagom Pillai & Dr. Ramanaiah- Advanced Mathematics
for Engineering Students,S Viswanathan Publishers
3. RK Jain & RK Iyengar, Advanced Engineering Mathematics, Narosa Publishing
house
4. Lipschutz S, Linear Algebra, Schaum's Outline Series, McGraw Hill
 27

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII -2 questions of 15marks each from module 1 with choice to answer any one
QIII-2questions of 15markseach from module II with choice to answer any one
QIV-2questions of l5 marks each from module III with choice to answer any one
Q V- 2 questions of 15marks each from module IV with choice to answer any one.
 28
CS04 302: DATA STRUCTURES & ALGORITHMS
(Common with IT04 302)
3 hours lecture and I hour tutorial per week

Objective: Views data as the central resource in computing process and to visualize the
importance of structuring data. It describes the impact of organizing data on the efficiency of
algorithms that process the data. Static and dynamic data structures, linear and nonlinear data
structures are extensively covered and is indispensable in any stream of study in computing.]
Module I (12 hours)
Review of data types - Scalar types - Primitive types - Enumerated types -Subranges
Structures types - Character strings - arrays - records - sets - tiles -Data abstraction -
Complexity of algorithms - Time and space complexity of algorithms using "big oh" notation
- Recursion: Recursive algorithms - Analysis of recursive algorithms.
Module II (12 hours)
Linear data structures - Stacks - Queues - Lists - Stack and queue implementation using array
- Linked list - Linked list implementation using pointers.
Module III (12 hours)
Non linear structures: Graphs -Trees - Sets - Graph and tree implementation using array
linked list - Set implementation using bit string, linked list.
Module IV (16 hours)
Searching - Sequential search - Searching arrays and linked lists - Binary search -Searching
arrays and binary search trees - Hashing - Introduction to simple hash functions - resolution
of collisions - Sorting: n2 Sorts - Bubble sort - Insertion Sort - Selection sort - NlogN sorts -
Quick sort - Heap sort - Merge sort - External sort - Merge files.
Text book
1. Aho A.V., Hopcroft J.E. & Ullman J.D., Data Structures and Algorithms,
Addison Wesley.
Reference books
1. Sahni S., Data Structures, Algorithms, & Applications in C++, McGraw Hill.
2. Wirth N., Algorithms +Data Structures = Programs, Prentice Hall.
3. Cormen T.H., Leiserson C.E., & Rivest R.L., Introduction to Algorithms, MIT Press,
1990.
4. Adam Drozdek, Data Structures and Algorithms in C++, Thomson Brooks/ cole -
Vikas Pub. House Pvt. Ltd.
5. Deshpande P. S, Kakde O.G, C and Data structures, Dream – tech India Pvt. Ltd.

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15marks each from module I with choice to answer any one
QIII- 2questions of 15marks each from module II with choice to answer any one
QIV- 2questions of 15marks each from module III with choice to answer any one
Q V- 2questions of 15marks each from module IV with choice to answer any one
 29

CS04 303: DISCRETE COMPUTATIONAL STRUCTURES

(Common with IT04 303)
3 hours lecture and 1 hour tutorial per week

[Objective: This course provides fundamental computational concepts. This course intends
to cover basic computational structures and methods such as logic, groups, rings and fields
useful for the students of computing sciences stream.]

Module 1 (13 hours)

Logic - Logical connectives and Truth tables - Logical equivalence and laws of logic -
Logical implication and rules of inference- Quantifiers -Proofs of theo rems using rules of
universal specification and universal generalization.

Module II (13 hours)

Relational Structures - Cartesian products - Relations - Relation matrices - Properties of
relations - Composition of relations- Equivalence relations and partitions- Functions - One-
to-one, onto functions - Composition of function and inverse functions- Partial orders- Hasse
diagrams.

Module III (13 hours)

Group Theory - Definition and elementary properties- Cyclic groups- Homomor phisms and
Isomorphisms - Subgroups- Cosets and Lagrange's theorem-Elements of coding theory-
Hamming metric-Generator matrices-Group codes- Hamming matrices.

Module IV (13 hours)

Rings and Fields - Definitions and examples of rings, integral domains and fields-Elementary
properties and substructures - Homomorphisms and isomorphisms -The ring Zn - Polynomial
rings - Irreducible polynomials and finite fields.

Textbook
1. Ralph P Grimaldi, Discrete and Computational Mathematics: An applied introduction
(Fourth Edition), Pearson Education, 2004.

Reference books
1. Tremblay, J P & Manohar,R, Discrete and Mathematical Structures with Applications
to Computer Science, McGraw Hill Book Company.
2. Kolman B & Busby R C, Discrete and Mathematical Structures for Computer
Science, Prentice Hall of India.
3. Donald F Stanat & David F Mc Allister, Discrete and Mathematical Structures in
Computer Science, Prentice Hall.
4. Truss J K, Discrete Mathematics for Computer Scientists, Pearson Education, 2001.
5. Herstein I N, Topics in Algebra, Wiley Eastern.
6. Garding, L & Tambour T, A Igebra for Computer Science, Narosa Publishing House,
New Delhi.

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50
 30

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15marks each from module I with choice to answer any one
QIII- 2questions of 15marks each from module II with choice to answer any one
QIV- 2questions of 15marks each from module III with choice to answer any one
Q V- 2questions of 15marks each from module IV with choice to answer any one
 31

CS04 – 304: BASIC ELECTRONICS ENGINEERING

(Common with IT04 304)
3 hours lecture and 1 hour tutorial per week

[Objective: This course is to introduce the Basic Electronic components and concepts as a
background information useful for the computing sciences. It covers the principle, properties
and characteristics of various analog electronics devices and circuits. For adequacy this has to
be complemented by exercises appearing in texts and references.]

Module I (15 hours)

Electronic components - Concepts of voltage and current sources - Energy bands in solids,
metals, insulators and semiconductors - Intrinsic and extrinsic semiconductors - PN junction
theory - V-I characteristics - Diode resistance -Rectifiers - Performance analysis of rectifiers -
Filters, zener, varactor and power diodes - LEDs. Transistors - Working and amplifying
action - Characteristics -Comparison between CE, CB and CC configurations - CE Amplifier,
construction of transistors - Use of data sheet - Thermal runaway - UJT, introduction to
FETs.

Module II (12 hours)

Transistor biasing - Selection of operating point - Bias stabilization - Different biasing
circuits - PNP biasing - Small signal amplifiers - Single stage amplifier -Graphical method -
Equivalent circuit method - Amplifier analysis - FET amplifier - Multistage amplifiers -
Gain analysis - RC coupled amplifier - Frequency response - Two stage RC coupled amplifier
- Distortion in amplifiers - Classification of amplifiers.

Module III (13 hours)

Power amplifiers - Single-ended power amplifier - Harmonic distortion - Push-pull amplifier
- Tuned voltage amplifier - Resonance - Single-tuned voltage amplifier - Feedback in
amplifiers - Types of feedback - Voltage gain with feedback Negative feedback - Oscillators
- Classification - LC oscillators - RC oscillators Crystal oscillators - A stable multivibrator

Module IV (12 hours)

Operational amplifiers - Inverting and non-inverting amplifiers - Adder - Voltage follower -
Differential amplifier - Integrator and differentiator - Zero-crossing detector - Precision
diode - Peak detector - Logarithmic amplifier - Square and triangle wave generator - Analog
computation - Active filters.

Text books
1. Bhargava N.N., Kulshreshtha D.C. & Gupta S.C., Basic Electronics & Linear
Circuits, Tata McGraw Hill (Modules I, II & III)
2. Nagarath J., Electronics Analog & Digital, Prentice Hall India (Module IV)

Reference books
1. Millman J. & Halkias C.C., Integrated Electronics: Analog &Digital Circuits &
Systems, Tata McGraw Hill
2. Schilling D.L. & Belove C, Electronic Circuits: Discrete & Integrated, McGraw Hill
 32

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

Q I - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of I5 marks each from module l with choice to answer any one
QIII- 2 questions of 15marks each from module II with choice to answer any one
QIV- 2 questions of 15marks each from module III with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.
 33
CS04 305: SWITCHING THEORY& LOGIC DESIGN
(Common with IT04 305)
3 hours lecture and 1 hour tutorial per week

[Objective: To introduce the principles, features and properties of digital devices and
circuits. This provides the basic concepts of computations and logic designs of Arithmetic
Logic Unit (ALU) of a Computer. Books have been carefully chosen to get examples from
diverse computing application for practice along with theory].

Module I (14 hours)

Number Systems and codes - Boolean algebra - Postulates and theorems -Constants, variables
and functions - Switching algebra - Electronic gates and mechanical contacts Boolean
functions and logical operations - Normal and canonical forms - Self-dual functions -
Logical operations - Karnaugh map -prime cubes - Minimum sum of products and product of
sums - Quine-McClusky algorithm.

Module II (13 hours)

Combinational Logic - Analysis and design of combinational logic circuits -Universal
property of the NAND and NOR gates - Adders - Parallel adders and look-ahead adders -
Comparators -Decoders and encoders - Code conversion -Multiplexers and demultiplexers -
Parity generators and checkers - ROMs, PLAs.

Module III (10 hours)

Fault diagnosis and tolerance - Fault classes and models - Fault diagnosis and testing - Test
generation - Fault table method - Path sensitization method -Boolean difference method -
Fault-tolerance techniques. Programmable logic arrays - PLA minimization - Essential prime
cube theorem - PLA folding – Design for testability.

Module IV (15 hours)

Counters and shift registers - SR, JK, D and T flip-flops - Excitation tables -Triggering of
flipflops - Flip-flop applications - Latches - Ripple counters - Synchronous counters - Up-
down counters - Design of sequential circuits - Counter decoding - Counter applications -
Shift registers and their applications - Clock mode sequential machine - State tables and
diagrams.
Text books
1. Biswas N. N., Logic Design Theory, Prentice Hall of India (Modules I, II & III)
2. Floyd T.L., Digital Fundamentals, Universal Book Stall (module IV).
Reference books
1. Kohavi Z., Switching & Finite Automata Theory, Tata McGraw Hill
2. Millman J. & Halkias C.C., Integrated Electronics: Analog & Digital Circuits &
Systems, Tata McGraw Hill.
3. M.Morris Mano, Charles R. Kime, Logic and Computer Design Fundamentals,
Pearson Education.

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50
 34

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
Q II -2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV- 2 questions of I5 marks each from module III with choice to answer any one
Q V- 2 questions of 15 marks each from module IV with choice to answer any one
 35

CS04 -306: ELECTRIC CIRCUITS AND SYSTEMS

3 hours lecture and 1 hour tutorial per week

[Objective: This course is to introduce the Electric Circuits and Systems useful for the
computing technology stream. Being a vast subject, the course can only introduce systems
and devices essential for the computing field.]

Module l (12 hours)

Review of basic circuit concepts - Matrix methods & circuit analysis, Mesh current analysis,
driving point impedance, transfer impedance, node voltage analysis, driving point admittance,
transfer admittance, Coupled circuits - Dal rule for coupled circuits - conductively coupled
and equivalent circuits, Defini-tion of graph - trees, Incidence matrix - Properties of
incidence matrix, Cut sets -Fundamental cut sets - Cut set schedule, Tie sets - Fundamental
tie sets - Tie set schedule, Relationship among incidence matrix - Cut set matrix & Tie set
matrix, KirchhofFs law in terms of network topological methods - Loop analysis - Cut set
analysis.

Module II (14 hours)

Single phase circuits - Analysis of a.c circuits using phasor concepts, Concept of impedance -
Admittance - Conductance and Susceptance, S domain circuits Power in a.c circuits,
Thevenin's and Norton's theorem, Maximum power trans-fer theorem, Frequency response.
Polyphic circuits - Three phase circuits with balanced and unbalanced loads (both star and
delta), Three wire and four wire systems, Three phase power Introduction to Power factor in
balanced and unbalanced three phase systems.

Module III (12 hours)

Bridge circuits - Principles of Maxwells bridge - Wiens bridge - Adersons bridge and
Scherring bridge, Two port networks , Impedance - Admittance and Hybrid parameters,
Interconnection of two port networks, Driving point and Transfer functions, Introduction to
Poles and Zeros.

Module IV (14 hours)

Introduction to systems - Systems engineering- transfer function, System modeling -Block
diagrams & its reductions, Control system characteristics, Signal flow graphs. Introduction to
dynamic responses, Feedback control systems first and second order systems, system time
constants, Frequency response, Introduction to stability analysis using frequency
response( bode plot only).

Text books
1. I. Nagrath & M. Gopal Control System Engineering, Wiley Eastern Ltd.
2. Edminister J.A, Electric Ciiruits, Schaum's Outline Series, McGraw Hill
3. Vaikenberg, Network Analysis, Prentice Hall of India

Reference books
1. Kuo F., Network Analysis & Synthesis, John Wiley
2. Chang D.K., Analysis of Linear Systems.
3. Siskind, Electrical Circuits, McGraw Hill
 36

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
Q II - 2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV- 2questions of 15 marks each from module III with choice to answer any one
Q V- 2 questions of 15 marks each from module IV with choice to answer any one.
 37

CS04 307(P) : PROGRAMMING LAB

3 hours practical per week

[Objective: This course is to give a strong programming concept so as to introduce the

software engineering techniques to the students of computing streams. For adequacy this has
to be complemented by exercises appearing in texts and references. Books have been
carefully chosen to get examples from diverse computing applications for practice]

Set 1 (3 lab sessions)

HCF (Euclid's algorithm) and LCM of given numbers - Find mean - Median and mode of a
given set of numbers - Conversion of numbers from binary to decimal, hexadecimal, octal
and back - Evaluation of functions like ex, sinx, cosx etc. for a given numerical precision
using Taylor's series - Testing whether a given number is prime.

Set 2 (2 lab sessions)

String manipulation programs: sub-string search, deletion - Lexicographic sorting of a given
set of strings - Generation of all permutations of the letters of a given string using recursion.

Set 3 (2 lab sessions)

Matrix operations: Programs to find the product of two matrices - Inverse and determinant
(using recursion) of a given matrix - Solution to simultaneous linear equations using Jordan
elimination

Set 4 (3 lab sessions)

Files: Use of files for storing records with provision for insertion - Deletion, search, sort and
update of a record

Reference books
1. Schildt H., C The Complete Reference, Tata McGraw Hill
2. TanH.H. &D'OrazioT.B., C Programming for Engineering & Computer Science,
McGraw Hill
3. Cormen T.H. et al, Introduction to Algorithms, Prentice Hall of India

Sessional work assessment

Lab practical & record =25

Regularity =05
2 tests 2 x 10 =20
Total marks = 50
 38

CS04 308(P) : ELECTRONICS LAB

3 hours practical per week

[Objective: This course is to give a hand on experience to students in the static and dynamic
characteristics of the electronics components and systems. The most fundamental and
essential devices and circuits are chosen for this laboratory course.]

1. Silicon, germanium and zener diode characteristics

2. Characteristics of UJT and UJT relaxation oscillator
3. Static transistor characteristics in CE and CB configurations
4. Clipping, clamping, differentiating and integrating circuits
5. Series voltage regulator
6. Frequency response of CE amplifier with and without feedback
7. Emitter follower: measurement of input and output impedance
8. RC phase shift oscillator
9. Op amp: inverting and non-inverting amplifier, voltage follower
10. Op amp: differential amplifier.

Reference books
1. Millman & Halkias, Integrated Electronics, Tata McGraw Hill.
2. Bhargava etal., Basic Electronic Circuits and Linear Circuits, Tata McGraw Hill.

Sessional work assessment

Lab practical & record =25

Regularity =05
2 tests 2 x 10 =20
Total marks = 50
 39
FOURTH SEMESTER

EN04 401B MATHEMATICS - IV

(Common with IT04 401)
3 hours lecture and 1 hour tutorial per week

Module I: Probability Distributions (16 hours)

Introduction - Probability distributions - Continuous random variables - Probability density
functions - Mathematical expectation - The expected value of a random variable - Moments -
Moment generating function - Special probability distributions Binomial distribution -
Geometric distribution - Hyper-geometric distribution - Poisson distribution - Special
probability densities - Uniform density - Gamma and chi-square distributions - Normal
distribution.

Module II: Sampling Distributions & Estimation (10 hours)

Population and samples - The sampling distribution of the mean - The sampling distribution
of the variance.
Estimation Introduction- Unbiased estimators - Efficiency-Consistency- Sufficiency - The
method of maximum likelihood - Interval estimation - The estimation of means - The
estimation of variances.

Module III: Testing of hypotheses (10 hours)

Tests of hypotheses - Null hypotheses and tests of hypotheses - Hypotheses concerning one
mean - Hypotheses concerning two means Hypotheses concerning one variance - Hypotheses
concerning two variances - Chi-square test for goodness of fit.

Module IV: Jointly distributed random variables, Markov chains & Poisson processes
(16 hours)
Joint distribution functions - Independent random variables - Covariance and variance of
sums of random variables - Joint probability distribution of functions of random variables -
Stochastic processes - Conditionals probability and conditional expectations
Markov chains-Champman-Kolmogorov equations - Exponential distribution -Properties of
exponential distribution - Counting processes - Definition of Pois-son process - Inter arrival
and waiting time distributions.

Text book
Module 1: John E Freund, Mathematical Statistics 5th Edition, Prentice Hall of India
Module 2: Johnson R.A, Miller & Freud's Probability & Statistics for Engineers 6th Edition
Pearson Education Asia
John E Freund, Mathematical Statistics 5th Edition, Prentice Hall of India
Module 3: Johnson R.A, Miller & Freud's Probability & Statistics for Engineers 6th Edition
Pearson Education Asia
Module 4: Ross S.M, Introduction to Probability Models 7th Edition, Academic Press

Reference books
1. Erwin Kreyszig - Advanced Engineering Mathematics 8th Edition, John Wiley &
Sons
2. R.E.Walpole, R.H Myers, S.L Myers & Keying, Probability and Statistics For
Engineers 7th Edition, Pearson Education Asia
3. Karlin S & Tailor.H, A first course in Stochastic process, Academic Press.
 40

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15marks each from module l with choice to answer anyone
QIII- 2questions of 15 marks each from module II with choice to answer any one
QIV- 2questions of 15 marks each from module III with choice to answer any one
Q V- 2 questions of 15 marks each from module IV with choice to answer any one.
 41

EN04 402 ENVIRONMENTAL STUDIES

(Common for all branches)
3 hours lecture & 1 hour tutorial per week

[Objective: The importance of environmental science and environmental studies cannot be

disputed. Continuing problems of pollution, loss of forest, solid waste disposal, degradation
of environment, loss of bio diversity etc have made everyone aware of environment issues.
The objective of this course is to create" general awareness among the students regarding
these environmental issues.]

Module 1 (12 Hours)

The Multidisciplinary nature of environmental studies
Definition - scope and importance-need for public awareness.
Natural Resources - Renewable and non-renewable resources:
Natural resources and associated problems - forest resources: Use and over exploitation,
deforestation, case studies. Timber extraction, mining, dams and their defects on forests and
tribal people. - Water resources: Use and over-utilization of surface and ground water, floods,
drought, conflicts over water, dams-benefits and problems. - Mineral resources: Use and
exploitation, environmental effects of extracting and using mineral resources, case studies. -
Food resources: World food problems, changes caused by agriculture overgrazing, effects of
modern agriculture, fertilizer-pesticide problems, water logging, salinity, case studies. -
Energy resources: Growing energy needs, renewable and non renewable energy sources, use
of alternate energy sources, case studies - Land resources: Land as a resource, land
degradation, man induced land slides, soil erosion and desertification - Role of an individual
in conversation of natural resources - Equitable use of resources for sustainable lifestyle.

Module II (14 Hours)

Ecosystems - Concept of an ecosystem - Structure and function of an ecosystem - Producers,
consumers and decomposers - Energy flow in the ecosystem -Ecological succession - Food
chains, food webs and ecological pyramids - Introduction, types, characteristic features,
structure and function of the following ecosystem:-Forest ecosystem - Grassland ecosystem -
Desert ecosystem - Aquatic ecosystem(ponds, streams, lakes, rivers, oceans, estuaries)
Bio-diversity and its conservation
Introduction - Definition: genetic, species and ecosystem diversity - Biogeo-graphical
classification of India - Value of biodiversity: consumptive use, productive use, social,
ethical, aesthetic and option values - Biodiversity at global, national and local levels - India
as a mega-diversity nation - Hot-spots of biodiversity - Threats to biodiversity: habitat loss,
poaching of wild life, man-wildlife conflicts - Endangered and endemic species of India -
Conservation of biodiversity: In-situ and Ex-situ conservation of biodiversity.

Module III (11 Hours)

Environmental Pollution
Definition - Causes, effects and control measures of:- Air pollution - Water pollution - Soil
pollution - Marine pollution-Noise pollution -Thermal pollution -Nuclear hazards - Solid
waste Management: Causes, effects and control measures of urban and industrial wastes
-Role of an individual in prevention of pollution - Pollution case studies - Disaster
management: floods, earthquake, cyclone and landslides -
Environmental Protection Act - Air (Prevention and Control of Pollution) Act -Water
(Prevention and Control of Pollution) Act - Wildlife Protection Act -Forest Conservation Act
- Issues involved in enforcement of environmental legislation - Public Awareness
 42

Module IV ( 10 Hours)
Social Issues and the Environment
From unsustainable to sustainable development - Urban problems related to energy - Water
conservation, rain water harvesting, watershed management -Resettlement and rehabilitation
of people; its problems and concerns, case studies - Environmental ethics: Issues and
possible solutions - Climate change, global warming, acid rain, ozone layer depletion, nuclear
accidents and holocaust. Case studies - Wasteland reclamation - Consumerism and waste
products.
Human Population and the environment
Population growth, variation among nations - Population explosion - Family welfare
Programme - Environment and human health - Pollution hazards, Sanitation and health -
Human Rights for clean environment - Value Education - HIV/ AIDS-social concern -
Women and Child Welfare - Role of information Technology in Environment and human
health - Case studies

Field Work (5 Hours)

+ Visit to a local area to document environmental assets - river/forest/grassland/hill/mountain
+ Visit to local polluted site - Urban/Rural/Industrial/Agricultural
+ Study of common plants, insects, birds
+ Study of simple ecosystems - pond, river, hill slopes, etc.

Text book
1. Clark, R.S. Marine Pollution. Clanderson Press Oxford
2. Mhaskar A.K, Matter Hazardous. Techno-science Publications
3. Miller, T.G Jr. Environmental Science. Wadsworth Publishing Co.
4. Townsend, C, Harper, J. and Michael Begon, Essential of Ecology. Blackwell
Science.
5. Trivedi. R.K. and Goel. P.K. Introduction to air pollution. Techno - Science
Publications.

Reference books
1. Agarval. K.C.2001 Environmental biology. Nidi Publ. Ltd. Bikaner
2. Bharucha Erach, Biodiversity of India, Mapin Publishing Pvt. Ltd., Ahmedabad - 380
013, India, Email: [email protected]
3. Brunner, R.C. 1989. Hazardous Waste Incineration. McGraw Hill Inc. 480p.
4. Cunningham, W.P., Cooper, T.H., Gorhani, E & Hepworth, M.T. 2001
Environmental encyclopedia Jaico publ. House Mumbai 1196p
5. De, A.K. Environmental Chemistry. Wiley Eastern Ltd.
6. Down to Earth, Centre for Science and Environment
7. Gleick, H.P. 1993. Water in crisis. Pacific Institute for Studies in Dev., Environment
and security, Stockholm Env. Institute. Oxford Univ. Press. 473p
8. Hawkins, R.E. Encyclopedia of Indian Natural History, Bombay Natural History
Society, Bombay
9. Heywood, V.H. & Watson, R.T. 1995. Global Biodiversity
Assessment. Cambridge Univ. Press 1140p.
10. Jadhav, H. & Bhosale, V.M. 1995. Environmental Protection and
Laws. Himalaya Pub. House, Delhi
11. Mckinney, M.L. & School, R.M. 1996. Environmental Science system
& Solutions, Web enhanced edition, 639p.
12. Odum,E.P. 1971. Fundamentals of Ecology. W.B.SaundersCo.
USA,574p.
 43

13. Rao,M.N.&Datta,A.K 1987. Waste Water treatment. Oxford &

IBH Publ. Co. Pvt. Ltd., 345p
14. Shaima, B.K. 2001. Environmental Chemistry. Goel Publ. House, Meerut.
15. Survey of the Environment, The Hindu (M)
16. Trivedi, R.K., Handbook of Environmental Laws, Rules, Guidelines,
Compliances and Standards, Vol I and II. Enviro Media
17. Wagner.K.D. 1998. Environmental Management. W.B. Saunders Co.
Philadelphia, USA 499p.

Sessional work assessment

2 tests = 15
Field work and Report (Internal Assessment) = 30
Regularity in the Class = 05
Total marks = 50

University examination pattern

QI- 16 short type question (to answer l2 out of l6) of 5 marks each ,4 from each
Module (12x5=60Marks)
QII - 2quesion of 10 marks from module I with choice to answer any one
QIII- 2 question of 10 marks each from module II with choice to answer any one
QIV- 2 questions of l0 marks each from module III with choice to answer any one
QV- 2 question of 10 marks each from module IV with choice to answer any one.
 44
CS04 - 403 : SYSTEMS PROGRAMMING
(Common with IT04 403)
3 hours lecture and 1 hour tutorial per week

(Objective: The subject gives the essentials of system software design. System software
consists of programs necessary to make the hardware function properly. The objective of the
study of this subject is to equip the student with the right kind of tools for computer systems
design and development.]
Module I (15 hours)
Background - system software machine architecture - the simplified instructional computer -
traditional machines - RISC machines - assemblers – basic assembler functions - machine
dependent and machine independent - assembler features - assembler design - assembler
design options - implementation examples - AIX Assembler.
Module II (13 hours)
Loaders and linkers - basic loader functions - machine dependent and machine independent
loader features - loader design options and implementation examples - macro processors -
basic macro processor functions - machine-independent macro processor features - macro
processor design options and implementation examples.
Module III (15 hours)
Introduction to operating systems - basic principles - batch processing - multiprogramming -
timesharing systems and real-time systems - parallel and distributed systems - computer
system structure - computer system operation - I/O structure - structure - storage hierarchy -
hardware protection - general system architecture - operating system structure - system
components - OS services -system calls - system structure - virtual machines.
Module IV (9 hours)
General overview of the UNIX operating system - history of UNIX - system structure - user
perspective - services - hardware assumptions - unix architecture - system concepts - kernel
data structures - system administration process (concepts only)
Text books
1. Beck L.L., System Software - An introduction to Systems Programming,Addison Wesley
2. Bach M. J., The Design of the Unix Operating System, Prentice Hall India
Reference books
1. Dhamdhere D.M., Systems Programminmg and Operating Sytems, Tata McGraw Hill
2. Godbole S., Operating Systems, Tata McGraw Hill
Sessional work assessment
Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks, 2 from each module
QII- 2 questions A and B of I5 marks from module I with choice to answer any one
QIII-2 questions A and B of 15 marks from module II with choice to answer any one.
QIII-2 questions A and B of 15 marks from module III with choice to answer any one
QV -2 questions A and B of 1 5 marks from module IV with choice to answer any one
 45

CS04 - 404 : MICROPROCESSOR BASED DESIGN

3 hours lecture and 1 hour tutorial per week

[Objective: This paper is to familiarize the student with the internals of real processor with a
wide range of processing capabilities. It also gives a fair idea of various interfacing methods
and devices, along with a detailed treatment of important design issues.]

Module I (13 hours)

Historical background of microprocessors - Inside the PC: Motherboard - Graphic adapters
and monitors - Drive controllers - Floppy and hard disk drives - Streamers and other drives -
Parallel interfaces and printers - Serial interfaces and modems -Network adapters and LANs -
CMOS RAM and real clock - Keyboard, mouse and other rodents - The power supply -
Operating system - BIOS and memory organization - 8086/8088 Hardware specification:
Clock generator - Bus. buffering and latching - bus timing - Ready and wait states -
Minimum and maximum modes -Advanced processors - Features of 80386, 80486 and
Pentium processors.

Module II (13 hours)

Microprocessor architecture: Real mode and protected mode memory addressing - Memory
paging - Addressing modes - Data addressing - Program memory addressing - Stack memory
addressing - Data movement instructions - Arithmetic and logic instructions - Program
control instructions - Programming the microprocessor: modular programming - Using
keyboard and display - Data conversions - disk files - interrupt hooks.

Module III (13 hours)

Memory interface: Memory devices - Address decoding, 8 bit (8088), 16 bit (8086), 32 bit
(80486) and 64 bit (Pentium) memory interfaces - Dynamic RAM. 1/ O interface- Port
address decoding - PPI, 8279 interface - 8254 timer interface -165 50 UART interface -
ADC/DAC interfaces.

Module IV (13 hours)

Interrupts: Interrupt processing - Hardware interrupts - Expanding the interrupt - 8259A
programmable interrupt controller - DMA: DMA operation - 8237 DMA controller - Shared
bus operation - Disk memory systems - Video displays - Bus interface: ISA bus - EISA and
VESA buses - PCI bus.

Text book
1. Brey B.B., The Intel Microprocessors 8086 to Pentium: Architecture, Programming
and Interface, Prentice Hall of India
2. Messmer H.P., The Indispensable PC Hardware Book, Addison Wesley

Reference books
1. Ray K. & Bhurchandi K.M., Advanced Microprocessors & Peripherals, Tata
McGraw Hill
2. Hall D.V., Microprocessors & Interfacing: Programming & Hardware, Tata McGraw
Hill
3. Miller K., An Assembly Language Introduction to Computer Architecture using the
Intel Pentium, Oxford University Press
4. Bigelow SJ., Troubleshooting, Maintaining & Repairing PCs, Tata McGraw Hill.
 46

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

Q I- 8 short type questions of 5 marks each, 2 from each module
QII -2 questions of 15marks each from module I with choice to answer any one
QIII-2questionsof 15marks each from module Il with choice to answer any one
QIV- 2questions of l5 marks each from module III with choice to answer any one
Q V- 2 questions of 15 marks each from module IV with choice to answer any one.
 47

CS04 - 405 : COMPUTER ORGANISATION & DESIGN

3 hours lecture and 1 hour tutorial per week

[Objective: This course lays the foundation for the study of hardware organization of digital
computers. It brings out the interplay between various building blocks of computers, without
being specific to any particular computer. At the end of the course, the student is expected to
gain a fair idea about the functional aspects of each building block in computer design, in the
general sense]

Module I (14 hours)

Computer abstraction and technology: Below your program - Under the covers -Historical
perspective - Measuring performance - Relating the metrics - evaluating, comparing and
summarizing performance - Case study: SPEC95 bench mark - Instructions - Operations and
operands of the computer hardware - Representing instructions - Making decision -
Supporting procedures – Beyond numbers - Other styles of addressing - Starting a program -
Case study: 80x86 instructions.
Module II (12 hours)
Computer arithmetic - Signed and unsigned numbers - Addition and subtraction -Logical
operations - Constructing an ALU - Multiplication and division - Floating point - Case study:
floating point in 80x86
Module III (11 hours)
The processor: Building a data path - Simple and multi-cycle implementations -
Microprogramming - Exceptions - Case study: Pentium Pro implementation.
Module IV (15 hours)
Memory hierarchy - Caches - Cache performance - Virtual memory - Common framework
for memory hierarchies - Case study - Pentium Pro memory hierarchy . input/output - I/O
performance measures - Types and characteristics of I/O devices - Buses - Interfaces in I/O
devices - Design of an I/O system
Textbook
1. Pattersen D.A. & Hennesy J.L., Computer Organisation & Design: The Hardware/Software
Interface, Harcourt Asia.
Reference books
1. Heuring V.P. & Jordan H.F., Computer System Design & Architecture, Addison Wesley
2. Hamacher, Vranesic & Zaky, Computer Organisation, McGraw Hill
Sessional work assessment
Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

Q l - 8 short type questions of 5 marks each, 2 from each module
QII -2 questions of 15 marks each from module I with choice to answer any one
QIII- 2 questions of l5 marks each from module II with choice to answer anyone
QIV-2 question of l5marks each from module III with choice to answer any one
QV-2questions of l5marks each from module IV with choice to answer any one.
 48

CS04 406 : ELECTRONIC CIRCUITS & SYSTEMS

3 hours lecture and 1 hour tutorial per week

[Objective: This course is to introduce the principles, features and characteristics of

switching circuits, logic families, memories and analog communication systems. For
adequacy this has to be complemented by exercises appearing in texts and references.]

Module I (13 hours)

Diode switch, clipping and clamping circuits - Transistor switch – Bistable multivibrator -
Schmitt trigger - Monostable and astable multivibrator - Miller and bootstrap sweep
generators.

Module II (13 hours)

Logic levels - Concepts of SSI, MSI, LSI and VLSI - Logic families: NOT gate, TTL, ECL,
CMOS logic - Interfacing - Comparison of logic families - TTL and, MOS flip-flops.

Module III (13 hours)

Memories: Basic concepts - Read only memories - Programmable ROMs - Static and
dynamic random access memories - Memory expansion - Magnetic bubble] memories -
Magnetic surface storage devices - CD-ROMs - Special memories -1 Sample and hold circuit
- D/A converters - A/D converters - Timing circuits.
Module IV (13 hours)
Communication systems - Need for modulation - External and internal noise -Noise figure
definition - Amplitude modulation and demodulation - Frequency j and phase modulation -
Noise and FM - FM demodulation - TRF and super-heterodyne receivers - Radiation and
propagation of electromagnetic waves.
Text books
1. Millman J. & Taub H., Pulse, Digital & Switching Waveforms, McGraw Hill
(Module I)
2. Taub H. & Schilling D., Digital Integrated Electronics, McGraw Hill (Modules II
&HI)
3. Kennedy G., Electronic Communication Systems, Tata McGraw Hill (Module FV)
Reference books
1. Nagarath I. J., Electronics Analog & Digital, Prentice Hall India
2. Floyd T.L., Digital Fundamentals, Universal Book Stall
3. Schilling D.L. & Belove C, Electronic Circuits: Discrete & Integrated, McGraw Hill
Sessional work assessment
Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII- 2 questions of 15 marks each from module II with choice to answer any one
QIV- 2 questions of 15 marks each from module III with choice to answer any one
Q V- 2 questions of 15marks each from module IV with choice to answer any one.
 49

CS04 407(P) : DATA STRUCTURES LAB

3 hours practical per week

[Objective: This course gives hand on experience in viewing data as the central resource in
computing process and to visualize the importance of structuring data. It demonstrates the
impact of organizing data on the efficiency of algorithms that process the data. Static and
dynamic data structures as well as linear and nonlinear data structures are extensively cov-
ered. This course is indispensable in any stream of study in computing..]

1. Stack and Queue: Implementation using arrays and Linked lists

2. Searching Methods: Binary search and Hashing
3. Sorting: Recursive implementation of Quick Sort and Merge Sort
4. Binary Search Tree. Implementation with insertion, deletion and traversal
5. Infix Expression Evaluation: Using expression tree
6. Graph Search Algorithms: DFS and BFS on A connected directed graph
7. Minimal Spanning Tree. Implementation of Kruskal's and Prim's Algorithms
8. Shortest Path Algorithm. Dijkstra and Floyd Warshall Algorithsm
9. Disjoint Set operations: Union and Find using rank and path compression
10. Applications of Heap: Priority Queue and Heap Sort.

Reference books

1. Cormen T.H., Lieserson C.E. & Rivest R.L., Introduction to Algorithms,

Prentice Hall of India
2. SahniS., Data structures, Algorithms & Applications in C++, McGraw Hill

Sessional work assessment

Lab practicals & record = 25

Regularity in the Class = 05
2 Tests 2x10 = 20
Total marks = 50
 50

CS04 408 (P) : DIGITAL ELECTRONICS LAB

3 hours practical per week

[Objective: This course gives hand on experience on digital electronics components and
systems; which are fundamental building blocks of the Computer systems. Experiments are
structured to cover extensively the characteristic and features of indispensable digital
electronic circuits and systems.]

1. Verification of truth tables of AND, OR, NOT, NAND, NOR and XOR gates, use
for gating digital signals.
2. TIL characteristics
3. Verification of the postulates of Boolean algebra and DeMorgan's theorem using
logic gates.
4. Half and full adders, half and full subtractors.
5. Digital comparator, parity gererator and checker, and code converter
6. Characteristics and operations of RS, gated RS, D, T, and JK master slave flipflops
7. Multiplexer and demultiplexer using gates
8. Shift register, ring counter, and twisted ring counter.
9. Decade counter and variable modulo asynchronous counter
10. Astable multivibrator and schmitt trigger using gates, astable and monostable
rnultivibrator and frequency divider using 555.

Reference books

1. Nagarath J., Electronics Analog & Digital, Prentice Hall India

2. Millman & Halkias, Integrated Electronics, Tata McGraw Hill

Sessional work assessment

Lab practicals & record = 25

Regularity in the Class = 05
2 Tests 2x10 = 20
Total marks = 50.
 51

FTFTH SEMESTER
CS04 501 : SOFTWARE ENGINEERING
(common with IT04 501)
3 hours lecture and 1 hour tutorial per week

[Objective of the course is to introduce the software engineering techniques and background
information to the students of computing sciences stream. For adequacy this has to be
complemented by exercises appearing in texts and references. One suggestion is to consider
using techniques learned here while doing mini project.)

Module I (11 hours) Introduction:

Definition - History - Software life cycle - Software Engineering & other areas of computer
science - Nature of a software product - Representative qualities -Quality requirements in
different application areas - Idea of quality assurance. Software Engineering principles -
Illustrative case studies.

Module II (14 hours)

Design:
Relation of software engineering principles to design - Design activity & its objectives -
Modularization techniques - module structure and its representation, interface and
information hiding, categories, specific techniques to accommodate change, stepwise
refinement, top-down and bottom-up design - Handling anomalies.

Concurrent software - methods to keep consistency - Real time software - Distributed

software - issues in building modules, module integration – Object oriented design.

Architecture:
Standard - Components - Architecture for component integration –Architecture for
distributed systems.

Specification:
The different contexts - Typical uses - Different styles - Verification of specification.

Operational specification notations - Definition with example for DFD, UML, Finite state
machines - Descriptive specification notations - Definition with example of E-R diagrams,
logic specification, algebraic specification - Building & using specifications in practice.

Module III (15 hours)

Verification:
Goals and requirements of verification - Approaches to verification.
Testing - Goals for testing - Theoretical foundations - Empirical testing principle - White
box testing, black box testing - Top-down & bottom-up integration - Testing object oriented
programs - Separate concerns in testing activity – Testing concurrent & real time systems.

Analysis - Informal techniques - Basic concepts of correctness proof- Using correctness proof
in practice - Symbolic execution - Basic concepts – Model checking.

Verifying other software properties - Metrics for verifying qualities.

 52

Production Process:
Software Process Model - Importance - Main activities in software production - feasibility
study, specifying requirements, detailed design, testing, system testing, delivery &
maintenance, other related activities.
Process models - Waterfall model, Evolutionary model, Transformational model, Spiral
model - An assessment of process models - Dealing with Legacy software - Case
study: A telephone switching system - Case study: Synchronize & stabilize process - Case
Study: Open source approach.
Configuration management - Software standards.

Module IV (12 hours)

Management:
Functions - Project planning - Software productivity - Productivity metrics -Factors affecting
productivity - Cost estimation - Predictive models - COCOMO & COCOMO II - Project
control - Work breakdown structures, Gantt charts, PERT charts - Dealing with deviations -
Team organization - centralized, de-centralized, mixed - An assessment of team organizations
- Risk management -Capability maturity model.

Tools & Environments:

Evolution - Dimensions for comparing tools - Representative tools - Tools for software
testing - Static analyzers - GUI tools - Configuration management tools - Tracking tools -
Reverse and re-engineering tools - Management tools -Tool integration - Evolution of tools.
Future - Role of the software engineer - Ethics and social responsibility.

Text book
1. Carlo Ghezzi, Mehdi Jazayeri, Dino Mandrioli; Fundamentals of Software Engineering;
2nd
edition; Pearson Education Asia.

Reference books
1. Pressman R.S.; Software engineering -A practitioner's approach; 5lh edition; McGraw
Hill Higher education series.
2. Mall R.; Fundamentals of Software Engineering; Prentice Hall of India
3. Behferooz A. & Gydsib F.J.; Software Engineering fundamentals; Oxford University
Press.
4. Jalote P.; An Integrated approach to Software Engineering; Narosa
5. Ian Sommervillie; Software Engineering, Pearson Education Asia

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2questions of 15marks each from 1 module with choice to answer any one
QIII - 2 questions of 15marks each from module II with choice to answer any one
QIV - 2 questions of 15marks each from module III with choice to answer any one
Q V - 2 questions of 15marks each from module IV with choice to answer any one.
 53

CS04 502 : DIGITAL DATA COMMUNICATION

3 hours lecture and 1 hour tutorial per week

[Objective: This course is useful for the students in understanding the fundamental theory
associated with Data Communication, which is the basis for all forms of Computer networks.
This syllabus focuses on essential principles of digital transmission and the reliable transfer
of data between Computers located at various places.]

Module I (13 hours)

Data Communication - networks - protocols - standards, Basic concepts -Line configuration -
topology- transmission modes, Categories of Networks, Internet works, OSI model -
functions of the layers, Electronic noise - external and internal noises - signal to noise ratio -
noise figure, Signals - analog and digital signals - time & frequency domains, Analog and
digital data transmission, Transmission impairments, Channel Capacity - Nyquist and
Shannon theorems.

Module II (13 hours)

Encoding - digital to digital - analog to digital (PAM, PPM, PWM & PCM) -digital to analog
(ASK, FSK, PSK & QAM) - analog to analog, Spread spectrum, Transmission of digital data
- asynchronous & synchronous transmission -DTE-DCE interface - El A - 232 standard -
Modems, Transmission media -guided media - Twisted pair, Co-axial cable & Fiber optics,
Unguided media -Microwave - Satellite & cellular.

Module III (13 hours)

Multiplexing - TDM - FDM, Telephone system - analog services (switched & leased), digital
service (switched/56, DDS and DS), Error detection (VRC, LRC, CRC & checksum), Error
correction- Hamming code, Data compression -Huffman coding - dynamic Huffman coding -
Facsimile compression.

Module IV (13 hours)

Data link control - line discipline - flow control - error control (stop & wait ARQ, Go back N
& selective repeat), Data link protocols, Asynchronous protocols (X-MODEM, Y-MODEM,
Z-MODEM & Kermit), Synchronous protocols - character oriented protocol - Bit oriented
protocols (HDLC, LAPs).

Text book
1. Behrouz Forouzan, Introduction to Data Communication and Networking, Tata
McGraw- Hill Publishing Company Ltd..

Reference books
1. Fred Halsall, Data Communication, Computer Networks and Open System,
Pearson Educations
2. William Stallings, Data & Computer Communications, Prentice Hail of India
Pvt. Ltd.
3. Harold Kolimbiris, Digital Communications Systems, Pearson Education
4. Ray Horak, Communications Systems and networks. Dream- tech
5. William A Shay, Understanding Communication and Networks, Thomson
Books/Cole
6. Michael A Miller, Data & Network Communications, Thomson Delmar Learning.
 54

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.
 55
CS04 503: OPERATING SYSTEMS
(common with IT04 503)
3 hours lecture and 1 hour tutorial per week

[Objective: This course is to impart the students the need and requirement on an interface
between Man and Machine; to enable them to identify the difference-; between the system
software and the application software and their design requirements. The syllabus includes
the features of operating systems and the fundamental theory associated with process,
memory and file managements] components of operating systems.]
Module 1 (12 hours)
Review of operating system strategies - resources - processes - threads - objects, -operating
system organization - design factors - functions and implementation considerations - devices
- characteristics - controllers - drivers – device management - approaches - buffering - device
drivers - typical scenarios such as serial communications - storage devices etc.
Module II (12 hours)
Process management - system view - process address space - process and resource abstraction
- process hierarchy - scheduling mechanisms - various strategies - synchronization -
interacting & coordinating processes – semaphores - deadlock - prevention - avoidance
- detection and recovery.
Module 111 (12 hours)
Memory management - issues - memory allocation - dynamic relocation various
management strategies - virtual memory - paging - issues and algorithms segmentation -
typical implementations of paging & segmentation systems.
Module IV (16 hours)
File management - files - implementations - storage abstractions - memory mapped files -
directories and their implementation - protection and security - policy and mechanism -
authentication - authorization - case study of unix kernel and Microsoft windows NT
(concepts only).
Textbook
1. Nutt G.J., Operating Systems - A Modern Perspective, Addison Wesley.
Reference books
1. Silberschatz & Galvin, Operating System Concepts, Addison Wesley
2. Crowley C, Operating Systems- A Design Oriented Approach, Tata McGrawHill
3. Tanenbaum A.S., Modern Operating Systems, Prentice Hall, Pearson Education.

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII -2 questions of l5 marks each from module l with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 m arks each from module III with choice to answer any one
QV -2 questions of l5 marks each from module IV with choice to answer any one.
 56
CS04 504 : NUMERICAL ANALYSIS & OPTIMIZATION
TECHNIQUES
3 hours lecture and 1 hour tutorial per week

[Objective: This course is aimed to introduce numerical method, which is unique for typical
computer related applications compared to any other digital methods. Also methods to
optimize various applications are introduced with suitable examples which are essential in
computer simulation techniques.)
Module I: Numerical analysis I (10 hours)
Errors in numerical calculations - sources of errors - significant digits - numerical solution of
polynomial and transcendental equations - bisection method – regular falsi method - Newton-
Raphson method - fixed point method of iteration - rates of convergence of these methods -
solution of system of algebraic equations - exact methods - Crout's triangularization method –
iterative methods - gauss - seidel and relaxation method - polynomial interpolation
-Lagrange interpolation polynomial - divided differences - Newtons' divided difference
interpolation polynomial - finite differences - operators A,V,e,8-gregory - Newton forward
and backward difference interpolation polynomials -central differences - stirlings
interpolation formulae.
Module II: Numerical analysis II (16 hours)
Numerical differentiation - differentiation formulae in the case of equally spaced points -
numerical integration - trapezoidal and Simpsons' rules - compounded rules - errors of
interpolation and integration formulae numerical solution of ordinary differential equations -
single step methods - Taylor series method - Eulers' method - modified Eulers' method -
Picards' iteration method - runge - kutta methods (2nd, 3rd and 4th order formulae -
derivations not required) -multistep methods - Milnes' predictor and corrector formulae.
Module III: Optimization techniques I (16 hours)
Optimization methods - mathematical formulation of linear programming problem - simplex
method - artificial variables - Charnes M method - two phase technique - duality in linear
programming - dual simplex method.
Module IV: Optimization techniques II (10 hours)
Transportation assignment and routing problems.
Reference books
1. Sastry S.S., Numerical Analysis, Prentice Hall India
2. Froberg, Introduction to Numerical Analysis, Second Edition, Addition Wesley.
3. Salvadori & Baron, Numerical Methods in Engineering, Prentice Hall India.
4. Gerald, Applied Numerical Analysis, Addison Wesley.
5. Grawin W. W., Introduction to Linear Programming, McGraw Hill.
6. Gass S.I., Introduction to Linear Programming, Tata McGraw Hill
Sessional work assessment
Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50
University examination pattern
QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module l with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
 57
Q V - 2 questions of 15 marks each from module IV with choice to answer any one

CS04 505: PROGRAMMING PARADIGMS

3 hours lecture and 1 hour tutorial per week

[Objective: This course is to introduce the different models of programming and the various
constructs and their implementation to support on a bare machine. It is hoped that the
students will be familiar with principles of design of programming language after going
through the course. The text given is presenting the idea using abstract notation.]

Module I (15 hours)

Role of programming languages- high level languages- programming paradigms-language
implementation on a machine- language Syntax description- notation for expressions, abstract
syntax trees, lexical syntax, context free grammars, variants of grammars- Language
Semantic description- introduction to synthesized attributes, attributed grammar, natural
semantics, de-notational semantics.
Imperative programming: Introduction- structured programming- constructs for structured
control flow- syntactic concerns- handling special cases in loops-discussion based on C. Role
of types: Basic types- compound types like arrays, records, union and variant records, sets-
pointers and dynamic allocation- Types and error checking- discussion based on C.
Introduction to procedures: parameter passing methods- scope rules- nested scopes-
implementation-discussion based on C.

Module II (12 hours)

Object oriented programming: Introduction- grouping of data and operations-constructs for
program structuring- information hiding- program design with modules- modules and defined
types- illustration based on C++ on class declaration, dynamic allocation, templates, objects.
Definition of object- object oriented thinking- Inheritance- derived classes and information
hiding-illustration based on C++.

Module III (12 hours)

Functional Programming: Elements of Functional programming- Types: values and
operations- Functional declaration- approaches to expression evaluation-lexical scopes- type
checking. Functional programming with lists- introduction to scheme- structures of lists- list
manipulation- simplification of expressions-storage allocation for lists.

Module IV (13 hours)

Logic Programming: Introduction - computing with relations- introduction to PROLOG- data
structures- programming techniques- control in PROLOG- cuts. Concurrent programming:
parallelism in hardware- implicit synchronization-interleaving- liveness properties- safe
access to shared data- synchronized access to shared variables.

Text book
1. Sethi R., Programming Languages: Concepts and Constructs, Addison Wesley

Reference books
1. Tennent R.D., Principles of Programming Languages, Prentice Hall International.
2. Sayed. H, Roosta; Foundation of programming languages Design and
implementations; Vikas Publising House, New Delhi.
3. Pratt T. W., and Zelkowitz M. V., Programming Languages: Design and
Implementation, Prentice Hall International.
4. Appleby. D and J. J. VandeKopple J. J; Programming Languages: Paradigm
 58
and Practice, Tata McGraw-Hill.

5. Scott M.L; Programming Language Pragmatics; Harcourt Asia(Morgan

Kaufman).
6. Clocksin W F, Mellish C S; Programming in PROLOG

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one
 59

CS04-506 : THEORY OF COMPUTATION

3 hours lecture and 1 hour tutorial per week

[Objective: This is a fundamental course on computational models and computability. It

begins with the introductory concepts of languages and their classification, and proceeds
through their recognizers and automata. The course concludes with a treatment on the ways
and means of classifying algorithm into the various computability classes and proofs of some
standard algorithms. ]

Module I (13 hours)

Introduction to formal proof- Inductive proofs - Concepts of automata theory - Deterministic
finite automata - Nondeterministic finite Automata - equivalence of deterministic and
nondeterministic finite automata - Nondeterministic Finite automata with a transitions -
Regular expressions - Finite automata and regular expressions - Algebraic laws for Regular
expressions - Pumping lemma for regular languages - closure properties of regular languages
- Decision properties of regular languages - Equivalence and minimization of automata.

Module II (13 hours)

Context free Grammars - Derivations - sentential forms - The language of grammar -
Parse trees - Ambiguity in grammar and languages - Inherently ambiguous languages
- Pushdown automata - Formal definition - Graphical notation – The language of a PDA -
Acceptance by PDA - Empty stack - Final state - PDAs to grammars - Deterministic PDAs
and CFLs - Non deterministic PDAs – Chomsky Normal Form - Greibach Normal Form -
Pumping lemma for CFLs – Closure properties of CFLs - Decision properties of CFLs - CYK
algorithm.

Module III (14 hours)

Turing Machines - Notation - Instantaneous Description - Transition Diagram - The
language of a Turing Machine - Halting of TMs - Programming techniques for Turing
Machines - Extension to basic TMs - Nondeterministic TMs - Restricted TMs - Recursive
and Recursively Enumerable Languages – Halting problem of TMs - Undecidable problem
about TMs - Rice's Theorem - Post's Correspondence problem - Undecidablity of PCP -
Undecidable problems on
Languages.

Module IV (12 hours)

Intractable problems - The classes P and NP - Polynomial time reducibility -NP-Complete
problems - The Satisfiability problem - NP-Completeness of the satisfiability problem - NP-
Completeness of CSAT- NP-Completeness of 3SAT - Node cover problem - Directed
Hamiltonian circuit problem - The class of languages Co-NP - Problems solvable in
polynomial space.

Text books
1. Hopcroft J.E, Motwani R & Ullman J. D., Introduction to Automata Theory,
Languages and Computation, Pearson Education.
Reference books
1. Hopcroft J. E. & Ullman J. D., Introduction to Automata Theory, Languages and
Computation, Narosa
2. Linz: P., An Introduction to Formal Languages & Automata, Narosa
3. Martin I C, Introduction to Languages & the Theory of Computation, Tata McGraw
 60
Hill

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module in with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.
 61

CS04 507(P) : PROGRAMMING PARADIGM LAB

3 hours practical per week

[Objective:
This Laboratory is intended to impart the working experience on paradigms of programming.
This additionally serves as introduction to various programming languages representative of
each paradigm. The thrust is in teaching the paradigms not the platforms. However, adequate
knowledge about platform is a need for successful experimentation]

Lab. 1: (object-oriented programming in - Java /C+ +) - programming to bring out the

concept of classes and objects- for example the abstract data type binary tree.
Lab 2: (object-oriented programming) - programming to demonstrate inheritance and class
hierarchy - for example define a base class "shape" and derived classes for rectangle,
square, ellipse, circle with proper class hierarchy.
Lab.3: (object oriented programming) programming to demonstrate polymorphism, virtual
functions- for example define base class for vectors and use inheritance to define
complex and real vector with standard operations.
Lab.4: (functional programming - in Lisp) - programming to demonstrate functional
specification for a solution - for example implementation of quick sort.
Lab.5: (functional programming) - programming to demonstrate implementation of
conventional data structures- for example implementation of binary search tree with
insertion, deletion and search operations.
Lab.6: (functional programming) - programming to demonstrate the use of available data
structures in functional programming languages-for example implementation of set
with membership, union and intersection operations

Lab.7: (logic programming - in prolog) - programming to demonstrate ready implementation

of propositional logic statements- for example to find the gcd of two given integers.
Lab.8: Lab.9: (logic programming) - programming to demonstrate language specific features-
for example implementation of a logic program to check whether a given NFA
accepts the given string.
Lab.9: (concurrent programming- in Java) - demonstration of concurrency support- for
example programming to find the least common ancestor of two given nodes in a
binary tree.
Lab.10:concurrent programming- in Java) - demonstration of synchronized concurrency - for
example programming for the readers and writers problem.
Reference books
1. Sethi R., Programming Languages: Concepts and Constructs, Addison Wesley
2. Appleby D. & Vandekopple J.J., Programming Languages: Paradigm and Practice,
Tata McGraw Hill
3. Luger & Stubblefield, Artificial Intelligence, Addison Wesley
4. Samuel A. Rebelsky, Experiments in Java, Pearson Education.

Sessional work assessment

Lab Practical and Record = 25
Test = 20
Regularity = 05
 62
Total marks = 50

CS04 508(P) : HARDWARE LAB

3 hours practical per week

[Objective: This course is to teach the relevance and characteristics of hardware and
operating system components of a digital computer system through various laboratory
experiments. It also gives the students the ability to interface devices to computer systems
through various interfacing techniques.]

Lab 1: Identification of components/cards and PC assembling from components

Lab 2 : Assembly language program for implementing arithmetic operations.

Lab3,4: Implementation of a file manager using DOS/BIOS interrupts.

Lab 5: TSR (Terminate and Stay Resident) Programming.

Lab 6: ADC interface.

Lab 7: Stepper Motor interface using DAC.

Lab 8,9: Parallel Interface: Printer and HEX keyboard..

Lab 10: Serial Interface: PC to PC serial interface using MODEM..

Reference books
1. Messmer H.P., The Indispensable PC Hardware Book, Addison Wesley
2. Hall D. V., Microprocessors and Interfacing, Tata McGraw Hill
3. Norton P., Dos Internals.

Sessional work assessment

Lab Practical and Record = 25
Test = 20
Regularity = 05
Total marks = 50
 63

SIXTH SEMESTER
CS04 601: EMBEDDED SYSTEMS
(Common with IT04 601)
3 hours lecture and 1 hour tutorial per week

[Objective of the course is to teach students about architecture, hardware and software
elements, programming models and practices and tools for embedded system design and
implementation. The syllabus gives thrust on the hardware and real time operating systems
used for the embedded systems design. Project works in the concerned field will supplement
the learning process.]
Module I (10 hours)
Introduction: Definition - Classification - Processors in the system - Other h/w units.
Software components - Typical applications - Embedded systems on a chip (SoC) and use of
VLSI circuits.
Module II (12 hours)
Hardware organization: Structured units of a processor - Processor selection factors.
Common memory devices - Memory selection - Memory map - Internal devices & I/O
devices map - Direct memory access - Interfacing the above. Types of I/O devices - Serial
devices - Parallel port devices - Sophisticated features - Timer and Counting devices -
Advanced serial bus & I/O - High speed Buses - Common types - Advanced Buses.
Module III (15 hours)
programming: Compiling, cross-compiling - Optimized use of memory - Use of DFG for
program analysis - Control Data Flow graph - Use of finite state machines model - Use of
Petrinet models - Use of Petri table for Real time programming -Issues in multiprocessor
systems.
Real time programming issues during software development process - Distinction between
functions, ISR and tasks - Problems of sharing data in RTOS - Interprocess communication in
RTOS.
Device drivers - Parallel port driver - Driver for internal programmable timing devices -
Interrupt servicing mechanism - Context and periods for context switching - Deadline and
Interrupt latency.
Module IV (15 hours)
Real Time Operating Systems: Typical OS structure - RTOS structure - The context of its
use - Schedule management for multiple tasks - Scheduling in real time -Interrupt routines in
RTOS environment - RTOS task scheduling models - List of basic actions in pre-emptive
scheduler and expected time taken - Strategy for synchronization - Discussion using Linux -
OS securities issues - Mobile OS. Case study of RTOS using MUCOS. Case study for RTOS
based programming - Coding for Automatic Chocolate vending machine using MUCOS.
Text books
1. Raj Kamal; Embedded systems - architecture, programming and design;
Tata McGraw-Hill.
Reference books
1. J.B. Peatman; Design with Microcontrollers and Microcomputers; McGraw-hill
2. David E. Simon; An embedded software primer; Pearson Education Asia
3. Daniel W. Lewis; Fundamentals of Embedded Software where C and assembly
 64
meet; Pearson Education Asia

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII -2 questions of l5marks each from module l with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one
 65

CS04 602 : DATABASE MANAGEMENT SYSTEMS

(common with IT04 602)
3 hours lecture and 1 hour tutorial per week

[Objective: To introduce basic concepts of data bases connected with software engineering
techniques and background information useful for the management of data bases. The
syllabus includes the file organization, database design and transaction processing
techniques.]

Module 1 (12 hours)

Introduction: characteristics of database approach - advantages of using DBMS -database
concept and architecture - data models - schemes - instances – data independence - database
languages and interfaces - database modeling using entity - relationship (ER) - entity sets
attributes and keys - relationships – type role and structural constraints - weak entity types -
enhanced entity-relations hip (EER) and object modeling - sub classes - super classes and
inheritance - specialization and generalization - modeling of union types.

Module II (10 hours)

File organization and storage: secondary storage devices - RAID technology -operations in
files - heap files and sorted files - hashing techniques - types of single level ordered index,
multi-level indexes - B - trees and B + trees – indexes on multiple keys - other types of
indexes.

Module III (14 hours)

Database design: functional dependencies - normal forms - general definition of second and
third normal forms - boyce-codd normal form - multi valued dependencies and fourth normal
form -join dependencies and fifth normal form -inclusion dependencies - practical database
design tuning - database design process relational model concepts - relational algebra
operations - queries in SQL - insert - delete and update statements in SQL views in SQL.

Module IV (16 hours)

Transaction processing: desirable properties of transactions, schedules and recoverability -
serializability of schedules concurrency control - locking techniques - time stamp ordering
multi version concurrency control - granularity of data items - database recovery techniques
based on deferred up data and immediate updating - shadow pages - ARIES recovery
algorithm - database security and authorization - security issue access control based on
granting/ revoking of privileges introduction to statistical database security.

Text book
1. Elmasri & Navathe, Fundamentals of Database Systems, Addison Wesley

Reference books
1. Ramakrishnan R. & Gehrke J., Database Management Systems, McGraw Hill
2. O'neil P. & O'neil E., Database Principles, Programming, and Performance,
Harcourt Asia, Morgan Kaufman
3. Silberschatz A., Korth H.F., & Sudarshan S., Database System Concepts,
Tata McGraw Hill
4. Ullman J.D., Principles of Database Systems, Galgotia Publications
5. Date C.J., An Introduction to Database Systems, Addison Wesley
6. Dubois P., My SQL, Techmedia Publication.
 66

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII -2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.
 67

CS04 603 : COMPUTER NETWORKS

(Common with IT04 603)
3 hours lecture and 1 hour tutorial per week

[Objective: This course is beneficial for the students to understand the mode of operation of
different types of Computer networks that are used to interconnect a distributed community
of computers and various interfacing standards and protocols. This course includes the
essential theory and different techniques associated with Local Area Network (LAN), Wide
area Network (WAN) and Inter network.]

Module I (13 hours)

Local Area Networks - Project 802 - Ethernet - Token Bus - Token ring -FDDI, Wireless
LANs, Wireless media, Transmission schemes, Medium access control, Switching - circuit
switching - packet switching (Data gram & Virtual circuit) - Message switching, Connection
oriented & Connectionless services.

Module II (14 hours)

ISDN - services - history - subscriber access - ISDN layers, Broadband ISDN, X.25 - layers -
PLP packets - Information packet - Control Packet, Frame relay - layers - operation -
implementation, ATM - design goals - topology -protocol architecture, SONET/SDH - layers
- frames - multiplexing STS frames.

Module III (13 hours)

Networking devices - Bridges - Routers - Gateways, Routing algorithms -distance vector -
link state, Transport layer - duties - connection - OSI transport protocol, Upper OSI layers -
session layer - presentation layer -application layer.

Module IV (14 hours)

Overview of TCP/IP, Network layer - IP - ARP - RARP - ICMP - IGMP, Transport layer
- UDP - TCP, Application layer - DNS - TELNET - FTP - Electronic Mail - SNMP -
HTTP, World Wide Web URL - browser architecture - WWW documents.

Text books
1. Behrouz Forouzan, Introduction to data communication and networking, Tata McGraw-
Hill
Publishing Company Ltd..

Reference books
1. Halsall F., Data Communication, Computer Networks and Open Systems, Addison
Wesley
2. Peterson L.L. &Davie B.S., Computer Networks, A systems approach, Harcourt Asia
3. Keshav S., An Engineering Approach to Computer Networking, AWL
4. Andrew S. Tanenbaum, Computer Networks, PHI
5. Leon-Garcia A. & Widjaja I., Communication Networks, Tata McGraw Hill
6. Bertsekas & Gallagar, Data Networks, PHI
 68

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module HI with choice to answer any one
QV -2 questions of 15 marks each from module IV with choice to answer any one.
 69
CS04 604 : GRAPH THEORY & COMBINATORICS
3 hours lecture and 1 hour tutorial per week

[Objective: This course introduces the basics of graph theory as a modeling and analysis tool
in computer science and engineering. It introduces the structures such as graphs and trees and
several combinatorial techniques which are needed in number theory based computing and
network security studies in Computer Science.]
Module I (13 hours)
Introduction to graphs - definitions - subgraphs - paths and cycles - matrix representation of
graphs - Euler tours - Chinese postman problem - planar graphs -Euler's formula - platonic
bodies - applications of Kuratowski's theorem - Hamiltonian graphs - graph colouring and
chromatic polynomials - map colouring.
Module II (14 hours)
Trees - definitions and properties - rooted trees - trees and sorting - weighted trees and prefix
codes - biconnected components and articulation points - the max-flow min-cut theorem -
maximum bipartite matching - Matchings -matchings and augmenting paths -the personal
assignment problem – Networks - flows and cuts - ford and Fulkerson algorithm - separating
sets.
Module III (11 hours)
Fundamental principles of counting - permutations and combinations - binomial theorem -
combinations with repetition - combinatorial numbers - principle of inclusion and exclusion -
derangements - arrangements with forbidden positions.
Module IV (14 hours)
Generating functions - partitions of integers - the exponential generating function - the
summation operator - recurrence relations - first order and second order - non-homogeneous
recurrence relations - method of generating functions.
Text books
1. Grimaldi R.P., Discrete and Combinatorial Mathematics: An Applied Introduction,
Addison Wesley
2. Clark J. & Holton D. A., A First Look at Graph Theory, Allied Publishers
(World Scientific)
Reference books
1. Corman T.H., Leiserson C.E. & Rivest R.L., Introduction to Algorithms,
Prentice Hall India
2. Mott J.L., Kandel A. & Baker T.P, Discrete Mathematics for Computer
Scientists And Mathematicians, Prentice Hall of India
3. Liu C.L., Elements of Discrete Mathematics, McGraw Hill
4. Rosen K.H., Discrete Mathematics and Its Applications, McGraw Hill
Sessional work assessment
Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50
University examination pattern
QI - 8 short Type question of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
 70
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.
CS04 605 : COMPILER DESIGN
3 hours lecture and 1 hour tutorial per week

[Objective: Continuing on the fundamentals laid by Theory of Computation this course aims
throwing light on the aspects of compilation and automatic generation of compilers as this is
one important example of language conversion and its computability. For adequacy this has
to be complemented with additional exercises selected from text/reference. ]
Module I (10 hours)
Introduction - analysis of the source program - phases of a compiler - compiler construction
tools - lexical analysis - role of the lexical analyzer - specification of tokens - recognition of
tokens - lexical analyzer generators.
Module II (15 hours)
Syntax analysis: role of the parser - context-free grammars - top-down parsing -bottom-up
parsing - operator precedence parsing - LR parsers (SLR, canonical LR, LALR) - parser
generators.
Module III (13 hours)
Syntax-directed translation - syntax-directed definitions - S-attributed definitions - L-
attributed definitions - bottom-up and top-down translation - type checking - type systems -
specification of a type checker - run-time environments - source language issues - storage
organization - storage allocation strategies - access to non-local names - parameter passing -
symbol tables.
Module IV (14 hours)
Intermediate code generation - intermediate languages - declarations -assignment statements -
Boolean expressions - procedure calls - introduction to code optimization - sources of
optimization - introduction to data-flow analysis - introduction to code generation - issues
in the design of a code generator – the target machine - a simple code generator
Text book
1. Aho A.V.Sethi R.&Ullman J.D.Compilers: Principles, Techniques and Tools, Addison Wesley
Reference books
1. Aho A. V. & Ullman J.D. Principles of Compiler Design, Narosa
2. Muchnick S.S., Advanced Compiler Design Implementation, Harcourt Asia (Morgan
Kaufman)
3. Holub A.I., Compiler Design in C, Prentice Hall India
4. Appel A.W., Modern Compiler Implementation in C, Cambridge University Press
5. Kenneth C Lauden, Compiler Construction - Principles and practice, Thomson
Brooks/Cole - Vikas Publishing House.
6. Dick Grune, Henri E Bal, Ceriel J.H Jacobs & Koen G Langendoen, Modern
Compiler design, Dream - tech
Sessional work assessment
Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50
University examination pattern
Q I - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII- 2 questions of 15 marks each from module II with choice to answer any one
 71
QIV- 2 questions of 15 marks each from module Id with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.

CS04 606 : COMPUTER GRAPHICS & MULTIMEDIA

3 hours lecture and 1 hour tutorial per week

[Objective: This course is to introduce fundamental principles of computer graphics and

different media formats. The subject is very relevant in view of the continuing trend of
convergence of media and communication engineering. For adequacy this has to be
complemented by exercises appearing in texts and references.)

Module I (13 hours)

Introduction to computer graphics - programming in the simple raster graphics package -
basic raster graphics algorithms for drawing 2D primitives - scan converting lines - circles -
generating characters - geometrical transformations - 2D transformations - homogeneous
coordinates and matrix representation of transformations - window-to-view-port
transformation
Module II (9 hours)
Viewing in 3D projections - 3D transformations - basics of solid modeling -Input devices and
interactive techniques - interaction hardware - basic interaction tasks - computer graphics
programming in C/C++.

Module III (13 hours)

Introduction to multimedia - media and data streams - properties of a multimedia system -
data stream characteristics - information units Multimedia building blocks - audio - basic
sound concepts - music - speech - MIDI versus digital audio - audio file formats - sound for
the web - images and graphics - basic concepts - computer image processing - video and
animation - basic concepts - animation techniques - animation for the web.
Module IV (12 hours)
Data compression - storage space and coding requirements - classification of coding /
compression techniques - basic compression techniques like JPEG, H.261, MPEG and DVI -
multimedia database systems - characteristics of multimedia database management system -
data analysis - data structure -operations on data - integration in a database model.
Text books
1. Foley J.D., Van Dam A., Feiner S.K., & Hughes J.F., Computer Graphics Principles
and Practice, Addison Wesley
2. Steinmetz R. & Nahrstedt K., Multimedia: Computing, Communications and
Applications, Pearson Education

Reference books
1. Newmann W & Sproull R.F., Principles of Interactive Computer Graphics,
McGrawHill
2. Rogers D.F., Procedural Elements for Computer Graphics, McGraw Hill
3. Hearn D. & Baker P.M, Computer Graphics, Prentice Hall India
4. Koegel Buford J.F., Multimedia System, Addison Wesley
5. Vaughan T, Multimedia: Making it Work, Tata McGraw Hill
 72

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module ELI with choice to answer any one
QV -2 questions of 15 marks each from module IV with choice to answer any one
 73

CS04 607(P) : SYSTEMS LAB

3 hours practical per week

|Objective: This course is useful to understand the operating system structures and the
implementation aspects of various OS functions and schedulers. The data base problems are
incorporated to familiarize the students with issues related to data base design.]

Operating systems
1. Implementation of dining philosophers problem by multiprogramming using
threads, semaphores and shared memory
2. Implementation of ls/dir command of Unix/Dos to display contents of a
given floppy disk.
3. Program to generate disk usage status report for a given Unix/Dos formatted
floppy disk giving details like free space availability etc.
4. Implementation of banker's algorithm
5. Inter-process communication using mailboxes and pipes
6. Program to find the least common ancestor of two given nodes in a binary
tree (Concurrent Programming)
7. Program for the readers and writers problem (Concurrent Programming)

Database management systems

1. Conversion of a given relational scheme to 3NF and BCNF
2. Implementation of B tree and B+ tree
3. Implementation of a database stored in an RDBMS accessible through a
web browser.
4. Program to convert SQL subset into relational algebra (tools like YACC
may be used.)
5. Implementation of optimistic concurrency control algorithm

Reference books
1. Nutt G.I., "Operating Systems - A Modern Perspective", Addison Wesley
2. Bach M.J., "The Design of the Unix Operating System ", Prentice Hall India
3. Elmasri & Navathe, "Fundamentals of Database Systems", Addison Wesley
4. Ramakrishnan R. & Gehrke J., "Database Management Systems", McGraw Hill

Sessional work assessment

Lab practical & record = 25

Tests 2x10 = 20
Regularity = 05
Total marks = 50
 74

CS04 608(P) : MINI PROJECT

3 hours per week

[Objective: The mini project is aimed at improving the professional competency of the
students, touching those areas which otherwise are not covered in the normal course. The
work practice here will help student to develop the ability to apply theoretical and practical
tools/techniques to solve real life problems related to industry and current research]

Guidelines
Each student group (not more than 5 members in a group) is expected to develop a complete
software product using the software engineering techniques - the product is to be deployed
and should have user manuals - a detailed report is also to be submitted - the students may be
assessed individually and in groups.

The project work may include the use of the following.

OS platforms: Relevant to the current state of the art with support for networked
environment, distributed computing and development of multi- platform applications.
Internet technologies: Architectural concepts, XML, Scripting languages, Middleware
(Component) technologies.
Front end / GUI: Code development or development based on tools.
RDBMS/Back End: Relevant to current state with database connectivity to different
platforms.
Languages: Qt, Glade or any similar 4GLs, Scripting languages and C & C++ in
Linux (under GNU gcc) etc.
Universal n/w applications development platforms such as JAVA, .NET.
OS internals: Device drivers, RPC, Threads, Socket programming etc.
Networking: Mechanisms, protocols, security etc.
Embedded systems: RTOS, Embedded hardware with software for an application, Code
optimization, security etc.

Sessional work assessment

Design & development = 20

Testing and installation = 15
Regularity = 05
Report = 10
Total marks = 50
 75

SEVENTH SEMESTER
CS04 701: INDUSTRIAL MANAGEMENT AND ECONOMICS
(Common with IT04 701)
3 hours lecture & 1 hour tutorial per week

PART A: ENGINEERING ECONOMICS

Objective: a brief exposure of Engineering Economics necessary for engineering graduate.

Module I (13 Hours)

1. Introductory Background - Nature and scope of Economics, Science, Engineering
and Technology, their relationship with economic development.
2. Basic Economic Concepts - Wants and utility, Demand and supply, Elasticity of
demand and supply, concept of cost and revenue, concept of equilibrium and margin,
wealth and capital.
3. Money and Banking - Functions of money - Functions of banks – Commercial and
Central Banks, Monetary policy of the Reserve Bank of India.
Module II (13 Hours)
4. Industrialization and Economic Planning in India - Need for industrialization,
Development of Indian Industry since independence, Role of public sector in India,
Industrial Policy of the Government of India, A brief study of Five Year Plans of
India
5. Agriculture-Role of Agriculture in Indian Economy- Problems of Indian Agriculture –
Green Revolution in Indian Features and effects.
6. Foreign exchange and International Trade - Determination of rate of exchange -
Balance of payments and Trade - India's Foreign Trade Policy -A short note on
International Monetary Fund (I.M.F.).

PART B: PRINCIPLES OF MANAGEMENT

Objective: an elementary level exposure of management principles relevant for industrial

sector.
Module III (13 hours)
Need for management - principles of management - management functions -span of control -
delegation - directing - leadership and motivation (basic concepts only)Theories of scientific
management (an overview only expected) - Fredric Taylor's theory - Frank Gilbreth's theory
- Henry Foyal's theory - present concepts of management.
Financial management - objectives and functions - time value of money (numerical examples
included) - basics of financial accounting (problem solving not required) - profit and loss
account - balance sheet (only introduction) -sources of industrial finance- shares - debentures
- public deposits - bank loans - financial institutions.
Module IV (13 hours)
Marketing management -concept of market and marketing - marketing mix -market research -
advertising and sales promotion, Scope and objective of Human Resource Management -
manpower recruitment analysis- recruitment and training -job analysis -job evaluation -
 76
wages and incentives. Decision making - Introduction and definition- techniques of decision
making - decision making process -under certainty - uncertainty and risk (problems not
included), Network analysis - CPM and PERT (analysis of simple networks).

Assignments:
1. Economics: Assignment should be able to help students appreciate necessity of
economics in engineering.
2. Management: Individual documentation of best management practices by various
organizations.

Text books
1. Mazda F, Engineering management, Low priced edition, Addison Wesley.
2. O. P. Khanna, Industrial Management.
3. Kotler. P, Marketing Management: Analysis, Planning, Implementation and
Control, Prentice Hall.
4. Venkata Ratnam C.S & Srivastva B.K, Personnel Management and Human
Resources, Tata McGraw Hill.
5. Prasanna Chandra, Financial Management: Theory and Practice, Tata McGraw Hill.
6. K.K.Dewett, Modern Economic Theory
7. Ishwar C. Dhingra, The Indian Economy (Resources Planning development and
Problem).

Reference books
1. Koontz H, O'Donnel C & Weihrich H, Essentials of management, McGraw Hill.
2. Satya Raju R & Parthasarathy A, Management: Text & Cases, Prentice Hall.
3. Ramaswamy VS & Namakumari S, Marketing Management: Planning,
Implementation and Control, MacMillan.

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2questions of 15 marks each from module l with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one
 77

CS04 702: CRYPTOGRAPHY & NETWORK SECURITY

(Common with IT04 702)
3 hours lecture and 1 hour tutorial per week

[Objective: This course introduces the principles and practice of cryptography and network
security. It includes the issues related to network security and practical applications that have
been implemented to provide network security. It is very relevant in the contemporary
scenario of increased number and complexity of cyber-crimes such as hackers, electronic
eavesdropping and electronic fraud etc.]

Module I (14 hours)

Congruence equations : properties - complete and reduced residue systems -Fermat's theorem
- Euler function. Indeterminate equations - linear and second degree diophantine equations -
congruences in one unknown - congruences of higher degree with prime and composite
modulo - Wilson's theorem - quadratic residues.
Introduction to cryptography - attacks - services and mechanisms - security attacks - security
services - conventional encryption - classical techniques -model - steganography - classical
encryption techniques - modern techniques - DES - cryptanalysis - block cipher principles
and design - algorithms - triple DES - IDEA - blowfish - confidentiality - placement of
encryption function -traffic confidentiality - key distribution - random number generation.

Module II (14 hours)

Public key enciyption - RSA algorithm - key management and exchange. RSA Design and
implementation- Chinese Remainder theorem, Garner's formula, RSA Model Definition,
Digital signatures and public Exponents, Public Key, RSA Key generating functions, Pitfalls
in using RSA ,RSA encryption function, Signature functions- Key Negotiation Protocol- Key
setting, Authentication convention, Views of the protocol, Attacker's view, Key compromise,
complexity and optimization,
Implementation issues- Large integer issues, checking DH computations and RSA
encryption, faster multiplication, Elliptic curve cryptography - message authentication -
requirements - functions and codes - hash functions - security of hash functions and MACs
algorithms - MD5 message digest algorithm . Secure Hash (SHA-1 ) algorithm -

Module III (14 hours)

Digital signature algorithm- DSA Decription -DSA prime generation-Security of DSA-GOST
Digital Signature Algorithm-ONG-Schnorr-Shamir, ESIGN, - Identification schemes- Feige-
Fiat-Shamir and its simplified form , enhancements - Guillou-Quisquater schemes, - Schnorr
schemes – Key - exchange Algorithms, Diffie-Hellman scheme and modifications- Encrypted
Key exchange(EKE),- Conference Key Distribution and secret Broadcasting -Multiple-Key
Public-Key cryptography, Secret-Scharing Algorithms, Subliminal Channel .Undeniable
Digital Signatures-Computing with encrypted data,.Fair Coin Flips- Fair and Failsafe
Cryptosystems ,Blind Signatures- Probabilistic Encryption- Quantum Cryptography.

Module IV (10 hours)

Kerberos- Model, working principle, key servers, Sesame- Common Cryptographic
Architecture (CCA),ISO Authentication framework, Privacy-Enhanced Mail(PEM), Prety
Good Privacy(PGP), Public-Key Cryptography Standards(PKCS).
IP Security - Architecture, Authentication Header, Encapsulating security payload,
 78
Combining security associations, Key-management, ISAKMP- Internet Protocol security -
WEB Security-Socket layer and Transport layer security, Secure Electronic transaction,
password selection strategies, Intrusion detection.

Text book
1. Stallings W., Cryptography and Network Security Principles and Practice, Pearson
Education Asia.
2. Schneier B., Applied Cryptography: Protocols, Algorithms, and Source Code in C,
John Wiley
3. Schneier B, Ferguson N., Practical Cryptography, Wiley-Dream – tech India Pvt.Ltd.

Reference books
1. Wenbo Mao , Modern cryptography - Theory and Practice, Pearson Education Asia
2. Niven & Zuckerman H.S., An Introduction to The Theory of Numbers, John Wiley
3. Pfleeger C.P., Pfleeger S.L., Security in Computing „ Pearson Education (Singapore)
Pvt. Ltd.
4. Michel E. Whiteman, Herbert J.Mattord, Principles of Information Security,
Thomson, Vikas Publishing House.

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
Q III - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module HI with choice to answer any one
QV -2 questions of 15 marks each from module IV with choice to answer any one.
 79

CS04 703 : DISTRIBUTED SYSTEMS

(Common with IT04 703)
3 hours lecture and 1 hour tutorial per week

[Objective: The development of distributed systems followed the emergence of high-speed

local area networks, the availability of high performance PCs, workstations and servers has
resulted in a recent shift towards distributed systems, and away from centralized, multi user
systems. This trend has been accelerated by the development of distributed system software
designed to support the development of distributed applications. This course is to impart
basic knowledge of the issues concerning distributed systems, from both software and
hardware viewpoints.)
Module I (10 hours)
Operating system fundamentals - distributed system concepts and architectures - major
design issues - distributed computing environments (DCE).
Module II (13 hours)
Concurrent processes and programming - threads and processes - client server model - time
services language mechanisms for synchronization - concurrent programming languages.
Module III (13 hours)
Inter-process communication and coordination - message passing communication -
request/reply communication - transaction communication -name and directory services -
distributed mutual exclusion - leader election.
Module IV (16 hours)
Distributed process scheduling - static process scheduling, dynamic load sharing and
balancing - distributed process implementation - real-time scheduling - concepts of
distributed file systems - distributed shared memory - distributed computer security.
Text book
1. Chow R. & Johnson T, "Distributed Operating Systems and Algorithms", Addison
Wesley.
Reference books
1. Sinha P.K., "Distributed Operating Systems Concepts and Design", PHI
2. Tanenbaum S., "Distributed Operating Systems", Pearson Education.
3. Coulouris G, Dollimore J. & Kindberg T., "DistributedSystems Concepts and
Design", Addison Wesley
4. Singhal M. & Shivaratri, "Advanced Concepts in Operating Systems, Distributed
Databases And Multiprocessor Operating Systems", McGraw Hill
Sessional work assessment
Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50
University examination pattern
QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
 80
QIV - 2 questions of 15 marks each from module III with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one

CS04 704: DESIGN & ANALYSIS OF ALGORITHMS

3 hours lecture and 1 hour tutorial per week

[Objective of the course is to provide a sound basis of algorithm design and analysis
techniques. A background of data structures and programming languages is assumed. After
completing the course, one is expected to be able to design efficient algorithms, compare
different algorithms for efficiency and also to have an idea about what is computable by a
machine]

Module l (13 hours)

Analysis: RAM model - cost estimation based on key operations - big Oh - big omega - little
Oh - little omega and theta notations - recurrence analysis -master's theorem - solution to
recurrence relations with full history probabilistic analysis - linearity of expectations - worst
and average case analysis of quick-sort - merge-sort - heap-sort - binary search - hashing
algorithms - lower bound proofs for the above problems - amortized analysis - aggregate -
accounting and potential methods - analysis of Knuth-Morris-Pratt algorithm - amortized
weight balanced trees.

Module II (13 hours)

Design: divide and conquer - Strassen's algorithm, o(n) median finding algorithm - dynamic
programming - matrix chain multiplication - optimal polygon triangulation - optimal binary
search trees - Floyd-Warshall algorithm - CYK algorithm - greedy - Huffman coding -
Knapsack, Kruskal 's and Prim's algorithms for mst - backtracking - branch and bound -
travelling salesman problem -marroids and theoretical foundations of greedy algorithms.]
Module III (13 hours)
Complexity: complexity classes - P, NP, Co-NP, NP-Hard and NP-compIete problems -
cook's theorem (proof not expected) - NP-completeness reductions for clique - vertex cover -
subset sum - hamiltonian cycle - TSP – integer programming - approximation algorithms -
vertex cover - TSP - set covering and subset sum.
Module IV (13 hours)
probabilistic algorithms: pseudo random number generation methods - Monte Carlo
algorithms - probabilistic counting - verifying matrix multiplication -primality testing - miller
rabin test - integer factorization - Pollard's rho heuristic - amplification of stochastic
advantage - applications to cryptography -interactive proof systems - les vegas algorithms -
randomized selection and sorting - randomized solution for eight queen problem - universal
hashing -Dixon's integer factorization algorithm.
Text books
1. Corman T.H., Lieserson C.E. & Rivest R.L., Introduction to Algorithms,
Prentice Hall India, Modules I, II and III
2. Motwani R. & Raghavan P., Randomized Algorithms, Cambridge University
Press, Module IV.
Reference books
1. Basse S., Computer Algorithms: Introduction to Design And Analysis, Addison
Wesley
2. Manber U., Introduction to Algorithms: A Creative Approach, Addison Wesley
3. Aho V., Hopcraft J.E. & Ullman J.D., The Design And Analysis of Computer
 81
Algorithms, Addison Wesley
4. Kenneth A Berman, Jerome L Paul, Fundamentals of sequential and parallel
algorithms, Vidya Vikas Publications

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.
 82

CS04 705A : DIGITAL SIGNAL PROCESSING

(Common with IT04 705A)
3 hours lecture and 1 hour tutorial per week

[Objective: Current communication technology is based on digital signal processing. Here

the fundamental principles of various transforms and the tools used in analysis and design of
discrete-time systems for signal processing are introduced.]

Module I (12 hours)

Discrete time signals and systems - discrete signal sequences - linear shift invariant systems -
discrete signals - stability and casualty - difference equations –frequency domain
representations - fourier transform and its properties - relationship between system
representations, review of Z-transforms.
Module II (15 hours)
Discrete fourier transform - representation of discrete fourier series - properties of discrete
fourier series - periodic convolution - DFT - properties of DFT -computation of DFT -
circular convolution - linear convolution using DFT -FFTs - DIT-FFT and DIF-FFT - FFT
algorithm for composite N.
Module III (13 hours)
Design of digital filters - IIR and FIR filters - low pass analog filter design -Butterworth and
Chebyshev filters - design examples - bilinear transformation and impulse invariant
techniques - FIR filter design - linear phase characteristics - window method.
Module IV (12 hours)
Realization of digital filters- discrete form I and II - cascade and parallel form-finite word
length effects in digital filters - quantizer characteristics - saturation overflow - quantization
in implementing systems - zero input limit cycles -introduction to DSP processors.
Reference books
1. Proakis & Manolalus, Digital Signal Processing, Principles, Algorithm &
Applications, Prentice Hall
2. Oppenheim & Schafer, Discrete Time Signal Processing, Prentice Hall
3. Ludeman L.C., Fundamentals of Digital Signal Processing, Harper & Row Publishers.
4. Van Valkenburg M.E., Analog Filter Design, Holt Saunders
5. Terrel T.J. & Shark L.K., Digital Signal Processing, Macmillan.
6. Sanjit K. Mitra, Digital Signal Processing- A Computer- Based Approach, Tata
McGraw-Hill.

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50
University examination pattern
QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module l with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
 83
QIV - 2 questions of 15 marks each from module III with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.

CS04 705B: ADVANCED TOPICS IN DATABASE SYSTEMS

(Common with IT04 705B)
3 hours lecture and 1 hour tutorial per week

[Objective: The course is intended to impart knowledge on the latest advancements in

implementations of database management systems. This imparts sound idea on the latest
methodologies such as object oriented, distributed and deductive database systems along with
comparisons supported by some case studies. By the end of the course, it enables the student
to analyze, design and implement modern database systems, especially for a distributed
environment.]

Module I (11 hours)

Overview of relational database concept - object oriented database - overview of object
oriented concepts - object definition language - object query languages - object database
conceptional design - overview of CORBA standard for distributed objects.

Module II (13 hours)

Distributed database concepts - data fragmentation replication and allocation -types of
distributed database system - query process - concurrency control for distributed database -
overview of client - server architecture and its relationship to distributed database.

Module III (13 hours)

Deductive database - introduction to deduction database prolog/datalog notation -
interpretation of rules - basic inference mechanism for logic programs - datalog programs and
their evaluation - deduction database systems - data Warehousing and data mining - database
on World Wide Web - multimedia database - mobile database - geographic information
system - digital libraries

Module IV (15 hours)

Oracle and microsoft access - basic structure of the oracle system - database structures and its
manipulation in oracle - storage organization programming oracle applications - oracle tools -
an overview of Microsoft access features and functionality of access - distributed databases in
oracle.

Text book
1. Elmasri & Navathe, Fundamentals of Database Systems, Addison Wesley

Reference books
1. Ramakrishnan R. & Gehrke J., Database Management Systems, McGraw Hill
2. O'neil P. & O'neil E., Database Principles, Programming, And Performance, Harcourt
Asia (Morgan Kaufman)
3. Silberschatz, Korth H.F. & Sudarshan S., Database System Concepts, Tata McGraw
Hill
4. Theory T.J., Database Modelling And Design, Harcourt Asia (Morgan Kaufman)

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
 84
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
Q III - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
QV - 2 questions of l5 marks each from module IV with choice to answer any one.
 85

CS2K 705C: SIMULATION & MODELING

3 hours lecture and 1 hour tutorial per week

[Objective: In simulation scientists try to reproduce real-world events or process under

ontrolled laboratory conditions, using mainly mathematical models. Some of the most
important scientific discoveries stem from the use of computers tosimulate the complex
natural phenomena. Hence, both from research perspective and from application perspective,
study of the course is inevitable.]
Module I (10 hours)
Introduction - systems and models - computer simulation and its applications -continuous
system simulation - modeling continuous systems - simulation of continuous systems -
discrete system simulation - methodology – event scheduling and process interaction
approaches - random number generation -testing of randomness - generation of stochastic
variates - random samples from continuous distributions - uniform distribution - exponential
distribution m-Erlang distribution - gamma distribution - normal distribution - beta
distribution - random samples from discrete distributions - Bernoulli - discrete uniform
-binomial - geometric and poisson.
Module II (12 hours)
Evaluation of simulation experiments - verification and validation of simulation experiments
- statistical reliability in evaluating simulation experiments -confidence intervals for
terminating simulation runs - simulation languages -programming considerations - general
features of GPSS - SIM SCRIPT and SIMULA.
Module III (15 hours)
Simulation of queueing systems - parameters of queue - formulation of queueing problems -
generation of arrival pattern - generation of service patterns -Simulation of single server
queues - simulation of multi-server queues -simulation of tandom queues.
Module IV (15hours)
Simulation of stochastic network - simulation of PERT network - definition of network
diagrams - forward pass computation - simulation of forward pass -backward pass
computations - simulation of backward pass - determination of float and slack times
determination of critical path - simulation of complete network - merits of simulation of
stochastic networks.
Note to the question paper setter - programming questions must be based on 'C ' language
or specified simulation languages in the syllabus.
Reference books
1. Deo N., System Simulation And Digital Computer, Prentice Hall of India.
2. Gordan G., System Simulation, Prentice Hall of India.
3. Law A.M. & Ketton W.D., Simulation Modelling and Analysis, McGraw Hill.
Sessional work assessment
Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50
University examination pattern
QI - 8 short type questions of 5 marks each, 2 from each module
 86
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module HI with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.
CS04 705D : STOCHASTIC PROCESSES
(Common with IT04 705D)
3 hours lecture and 1 hour tutorial per week
[Objective: Dynamic indeterminism is to be analyzed in any field of Science and
Technology with reference to time, which is in other words defined as random processes.
Students are introduced to various methods to model and analyze such systems.]
Module I (12 hours)
Markov chains and poisson processes (a brief revision) - continuous time Markov chains -
definition -transition probability function - Chapman -Kolmogorov equations - rate matrix -
Kolmogorov forward and backward equations - computing the transition probabilities -
limiting probabilities - pure birth process - birth and death process - M/ M/ 1 queue.
Module II (12hours)
Renewal theory and its applications - the renewal process N(t) - distribution of N(t) - renewal
function - renewal equation - limit theorems and their applications - elementary renewal
theorem (without proof) - applications of renewal theorem - central limit theorem of renewal
processes (without proof) - renewal reward processes - regenerative processes - delayed
renewal processes – alternating renewal processes.
Module III (12 hours)
Queueing theory I: introduction - preliminaries - cost equations - Little's formula -steady state
probability. - exponential models - single server exponential queueing system - single server
exponential - system having finite capacity – a queueing system with bulk service - network
of queues - open systems – closed systems - the system M/G/l - preliminaries - work and cost
identity – applications of work to M/G/I - busy periods - discussion ofM/D/1 model and
M/Ek/l model.
Module IV (12 hours)
Queueing theory II: variations on the M/G/l - the M/G/I with random sized batch arrivals -
priority queues - the model G/M/I - the G/M/l busy and idle periods - multi server queues -
Erlang loss system - the M/M/k queue -the G/M/ k queue - the M/G/k queue - M/G/oo queue.
Text books
1. Ross S.M., Introduction to Probability Models, Sixth edition, Harcourt AsiaPvt. Ltd. and
Academic Press Chapter 6 Sections 6.1,6.2,6.3,6.4,6.5, 6.8; Chapter 7 Sections
7.1,7.2,7.3,7.4,7.5; Chapter-S Section 8.1 to 8.5 for module III and remaining for module
IV
Reference books
1. Ross S.M., Introduction to Probability Models, Sixth edition, Harcourt Asia Pvt. Ltd.
and Academic Press
2. Medhi J., Stochastic Processes, Wiley Eastern Ltd.

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50
University examination pattern
QI - 8 short type questions of 5 marks each, 2 from each module
 87
QII - 2 questions of 15 marks each from module l with choice to answer any one
Q III - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.
CS04 705E : TECHNICAL ARGUMENTATION
3 hours lecture and 1 hour tutorial per week

[Objective: This topic is concerned with the most fundamental aspects of academic study
such as the abilities to reason with ideas and evidence, to formulate arguments effectively and
to appreciate the interplay between ideas and evidence in debate. It introduces a student to the
nature of good reasoning and how to test and construct good arguments without assuming any
prior knowledge of logic or philosophy. The subject may work as a much-needed guide to
thinking critically for oneself.]

Module I (13 hours)

Introduction to argument - choice of topic - defining audience - defining terms - planning
argument - avoiding logical fallacies - case study of classic arguments of Mahatma Gandhi,
Martin Luther King Jr.

Module 11(13 hours)

Understanding forms of persuasion - Reading critically - Plagiarism -documenting sources -
guide to research - avoiding selective research - case study involving issue of surfing the web.

Module III (13 hours)

Searching for magazine, journal, newspaper articles - using abstracting services, internet,
books, other library resources - case study involving culture and curriculum

Module IV (13 hours)

Conducting interviews, surveys, compiling bibliography-organizing, writing and preparing
researched paper - case study involving gun control and immigration - case study of select
classic argument of Plato.
Text book
1. Robert K Miller, The Informed Argument, Fifth Edition, Harcourt Brace College
Publishers.

References
1. John Shand, Arguing Well, Routledge Publishers
2. Peter J Phelan, Peter J Reynolds, Argument and Evidence, Routledge
Publishers
3. Tracy Bowell and Garry Kemp, Critical Thinking, Routledge Publishers
4. David Sanford, If P then Q, Routledge Publishers

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module l with choice to answer any one
Q III - 2 questions of 15 marks each from module II with choice to answer any one
 88
QIV - 2 questions of 15 marks each from module III with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.

CS2K 705F : ENTREPRENEURSHIP

3 hours lecture and 1 hour tutorial per week

[Objectives: The course intends to strengthen the entrepreneurial capabilities of a student

while preparing to graduate as a professional. These capabilities include identification of
opportunities, studying project feasibility, and implementing business ventures. The course
also exposes the intricacies of economic fundamentals of a business venture, needed for
commissioning one.]

Module I (20 hours)

Entrepreneurial perspectives - understanding of entrepreneurship process -entrepreneurial
decision process - entrepreneurship and economic development - characteristics of
entrepreneur - entrepreneurial competencies - managerial functions for enterprise.

Module II (10 hours)

Process of business opportunity identification and evaluation - industrial policy environment
- market survey and market assessment - project report preparation study of feasibility and
viability of a project - assessment of risk in the industry.

Module III (12 hours)

Process and strategies for starting a venture - stages of small business growth -
entrepreneurship in international environment - entrepreneurship – achievement motivation -
time management creativity and innovation structure of the enterprise - planning,
implementation and growth.

Module IV (l0hours)
Technology acquisition for small units - formalities to be completed for setting up a small
scale unit - forms of organizations for small scale units - financing of project and working
capital - venture capital and other equity assistance available - break even analysis and
economic ratios technology transfer and business incubation

Reference books
1. Harold Koontz & Heinz Weihrich, Essentials of Management, McGraw Hill
International
2. Robert D Hirich & Michael P Peters Irwin, Entrepreneurship, McGraw Hill
3. Rao T. V., Deshpande M. V, Prayag Metha & Manohar S Nadakarni, Developing
Entrepreneurship - A Hand Book, Learning Systems
4. Donald Kurado & Richard M Hodgelts, Entrepreneurship A Contemporary
Approach, The Dryden Press New York
5. Dr Patel V.G, Seven Business Crisis, Tata McGraw Hill, New Delhi
6. Jeffry A Timmons, New Venture Creation - Entrepreneurship for 21st Centuty,
McGraw Hill International, 5lh Edition
7. Patel J.B., Noid S. S., A Manual on Business Opportunity Identification, Selections,
EDII Ahmedabad.
8. Rao C.R., Finance for Small Scale Industries
9. Pandey G W., A Complete Guide to Successful Entrepreneurship, Vikas Publishing,
New Delhi.
 89

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module l with choice to answer any one
Q III - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.
 90

CS04 706(P) : COMPILER LAB

3 hours Practical per week

(Objective: This practical course is introduced to familiarize the design of all phases of
compilers up to a stage of intermediate code generation. This course enables the students to
design and implement modern compilers for any environment.]

Lab 1,2 : Generation of lexical analyzer using tools such as LEX.

Lab 3,4 : Generation of parser using tools such as YACC.
Lab 5,6 : Creation of Symbol tables.
Lab 7,8 : Creation of type checker.
Lab 9,10 : Generation of intermediate code.

Reference books
1. Halub A.I., Compiler Design in C, Prentice Hall India
2. Appel A.W., Modern Compiler Implementation in C, Cambridge University Press

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50
 91

CS04 707(P) : SEMINAR

4 hours per week

Each student is expected to present a seminar on a topic of current relevance in Computer

Science and Engineering - they are expected to refer research and review papers from
standard journals like ACM, IEEE, JPDC, IEE etc. - at least three cross references must be
used - the seminar report must not be the reproduction of the original paper.

Sessional work assessment

Presentation = 15
Regularity = 05
Discussion = 10
Report = 20
Total marks = 50
 92

CS04 708(P) : PROJECT

3 hours practical per week

[Objective: The project is aimed at improving the professional competency by touching the
areas which otherwise is not covered in theory or laboratory classes. There is a greater
realization of the importance of the application of ideas to build a solution to complement the
learning process. The work practice will help the students to develop ability to apply
theoretical and practical tools/ techniques to solve real life problems related to industry and
current research.]

Guidelines
This project is for a duration of two semesters - each student group (not more than 5
members in a group) is expected to develop a complete product – the design and
development may include hardware and/or software - the seventh semester is mainly for the
design of the product - an interim report is to be submitted at the end of the semester - the
assessment may be made individually and in groups
The project work may include the use of the following.
OS platforms: Relevant to the current state of the art with support for networked
environment, distributed computing and development of multi-platform applications.
Internet technologies: Architectural concepts, XML, Scripting languages, Middleware
(Component) technologies.

Front end / GUI: Code development or development based on tools.

RDBMS/Back End: Relevant to current state with database connectivity to different
platforms.
Languages: Qt, Glade or any similar 4GLs, Scripting languages and C & C-Linux (under
GNU gcc) etc.
Universal n/w applications development platforms such as JAVA, etc.
OS internals: Device drivers, RPC, Threads, Socket programming etc.
Networking: Mechanisms, protocols, security etc
Embedded systems: RTOS, Embedded hardware with software for an
application,
Code optimization, security etc.

Sessional work assessment

Design = 30
Regularity = 05
Report = 15
Total marks = 50
 93

EIGHTH SEMESTER
CS04 801 : INFORMATION ETRIEVAL
3 hours lecture and t hour tutorial per week

[Objective: In the current scenario of information explosion, tools and techniques for
deriving the right information at the right time will give a competitive edge to an
organization. This paper examines this aspect in detail in the context of the World Wide Web.
It covers many forms of information, such as text, image, audio and video formats, and
presents several research issues related to different IR tasks.]
Module I (10 hours)
Introduction: Information versus Data Retrieval, IR: Past, present, and future. Basic concepts:
The retrieval process, logical view of documents. Modeling: A Taxonomy of IR models, ad-
hoc retrieval and filtering. Classic IR models: Set theoretic, algebraic, probabilistic IR
models, models for browsing.
Module II (12 hours)
Retrieval evaluation: Performance evaluation of IR: Recall and Precision, other measures,
Reference Collections, such as TREC, CACM, and ISI data sets. Query Languages: Keyword
based queries, single word queries, context queries, Boolean Queries, Query protocols, query
operations.
Module III (12 hours)
Text and Multimedia Languages and properties, Metadata, Text formats, Markup languages,
Multimedia data formats, Text Operations. Indexing and searching: Inverted files, Suffix
trees, Suffix arrays, signature files, sequential searching, Pattern matching.
Module IV (16 hours)
Multimedia IR: Spatial access methods, Generic multimedia Indexing approach, Distance
functions, feature extraction, Image features and distance functions. Searching the Web:
Characterizing and measuring the Web. Search Engines: Centralized and Distributed
architectures, user Interfaces, Ranking, Crawling the Web, Web directories, Dynamic search
and Software Agents.
Text book
1. R.Baeza-Yates and B. R. Neto: Modern Information Retrieval:, Pearson Education, 2004.
Reference books
1. C.J. van Rijsbergen: Information Retrieval, Butterworths, 1979.
2. CD. Manning and H. Schutze: Foundations of Statistical natural Language
Processing (Chapters 13, 14, and 15 only), The MIT Press, Cambridge, London.2001.
3. David Hand, Heikki Mannila, Padhraic Smyth, Data Mining, Prentice hall of India
Sessional work assessment
Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50
University examination pattern
QI - 8 short type questions of 5 marks each, 2 from each module
 94
QII - 2 questions of 15 marks each from module l with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
QV - 2 questions of l5 marks each from module IV with choice to answer any one.
CS04 802: COMPUTER ARCHITECTURE AND
PARALLEL PROCESSING
3 hours lecture and 1 hour tutorial per week

[Objective: This subject is aimed to introduce a concentrated course on parallel computing

based computer architectures with a quantitative approach. The students will be able to
understand new design paradigms to achieve parallelism, memory hierarchy design and inter-
connection networks.]
Module I (15 hours)
Fundamentals - task of a computer designer - trends in technology usage and cost -
performance measurement - quantitative principles of computer design -instruction set
architectures - classification - addressing and operations -encoding an instruction set - role of
compilers - case study - the DLX architecture -pipelining - pipeline for DLX - pipeline
hazards - data and control hazards -implementation difficulties - pipelining with multicycle
operations.
Module II (12 hours)
Instruction level parallelism - concepts and challenges - dynamic scheduling -dynamic
hardware prediction - multiple issue of instructions - compiler and hardware support for ILP -
vector processing - vector architecture – vector length and stride - compiler vectorization -
enhancing vector performance
Module III (13 hours)
Memory hierarchy design - reducing cache misses and miss penalty, reducing hit time - main
memory - virtual memory and its protection - case study - protection in the Intel Pentium -
crosscutting issues - I/O systems - performance measures - reliability and availability -
designing an I/O system - case study - Unix file system performance.
Module IV (12 hours)
Interconnection networks - simple networks - connecting more than two computers - practical
issues - multiprocessors - introduction – application domains - centralised-shared memory
and distributed-shared memory architectures - synchronisation - models of memory
consistency
Text book
1. Hennesy J.L. & Pattersen D.A., Computer Architecture: A Quantitative approach,
Harcourt Asia Pte Ltd. (Morgan Kaufman).
Reference books
1. Pattersen D.A. & Hennesy J.L., Computer Organisation and Design: The
Hardware/Software Interface, Harcourt Asia Pte Ltd (Morgan Kaufman)
2. Hwang K., Advanced Computer Architecture: Parallelism, Scalability and
Programmability, McGraw Hill
Sessional work assessment
Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50
University examination pattern
 95
QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of I5 marks each from module l with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
QV - 2 questions of 5 marks each from module IV with choice to answer any one.

CS04 803 : INTERNET TECHNOLOGIES

(Common with IT04 803)
3 hours lecture and 1 hour tutorial per week

[Objective: This course introduces the algorithms and protocols implemented to have human
interaction with internet with an emphasis on application layer and multimedia networking. It
also introduces the techniques and methods of E-Commerce.]

Module I (14 hours)

Network Applications-Client-Server Interaction-Socket Interface-Connection Oriented
Service-Simple Client and Server example -Domain Name System-Electronic Mail
Representation and Transfer-VoIP-File Transfer and Remote File Access-RPC and
Middleware-Initialization.

Module II (12 hours)

Multimedia networking-applications-streaming stored audio and video - internet telephony -
RTP- scheduling and policing mechanisms - integrated services - RS VP -differentiated
services - network management - the internet network management framework - network
security - integrity, Access control attacks & control measures.

Module III (13 hours)

E-commerce-Difference between E-commerce and E-Business, Unique features, types -
Portals - E-distributor. Emerging E-commerce areas. Technology infrastructure - Internet and
web features (case study not required). Building an E-commerce website- choosing server
software- choosing hardware- E-commerce site tools. Security needs in E-commerce
environment.

Module IV (13 hours)

E-commerce payment systems - credit cards, E-commerce transactions - digital payments in
B2C arena - B2B payment systems, B2B E-commerce and Supply Chain Management -
Evolution - Procurement process & Supply Chain Management - Trends in Supply Chain
Management and collaborative commerce, Net Marketers - characteristics, types, e-
distributors, e-procurement.

Text books
1. Douglas E. Comer, Computer Networks and Internets with Internet Applications -
Pearson Education
2. Kurose J.F. & Ross K.W, Computer Networking: A Top -Down Approach Featuring
the Internet- Pearson Education
3. Kenneth C. Laudon, Carol Guercio Traver, E-Commerce-Business, Technology,
Society- Pearson Education.

Reference books
1. Nalin K. Sharda, Multimedia Information Networking - Prentice Hall of India.
2. Stallings, Computer Networking with Internet Protocols – Pearson Education Asia.
3. Greenla w R. & Hepp E.,In-line / On-line: Fundamentals of the Internet and the
 96
World Wide Web- Tata McGraw Hill.
4. Goncalves M., Firewalls: A Complete Guide - Tata McGraw Hill
5. Kalakota R. & Whinston A.B., Frontiers of Electronic Commerce – Addison Wesley
6. Schneider G.P. & Perry J.T. Electronic Commerce, Course Technology.

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module in with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.
 97

CS04 804A : ARTIFICIAL INTELLIGENCE

3 hours lecture and 1 hour tutorial per week

[Objective: AI is the study of how to make computers do things which, at the moment people
do better. This course introduces AI problems and Search techniques, Knowledge
Representations, Neural networks, LISP and various approaches of AI problems solving. This
leads the students to design their own systems of artificial Intelligence and expert systems.]

Module I (16 hours)

Introduction - definition and basic concepts - aims - approaches - problems in AI - AI
applications - perception and action - representing and implementing action functions -
production systems - networks - problem solving methods - forward versus backward
reasoning - search in state spaces - state space graphs - uninformed search - breadth first
search - depth first search – heuristic search - using evaluation functions - general graph-
searching algorithm - algorithm A* - admissibility of A* - the consistency condition –
iterative deepening A* - algorithm AO* - heuristic functions and search efficiency -
alternative search formulations and applications - assignment problems - constraint
satisfaction - heuristic repair - two agent games - the mini-max search - alpha beta procedure
- games of chance.

Module II (14 hours)

Knowledge representation - the propositional calculus - using constraints on feature values -
the- language - rules of inference - definition of proof -semantics - soundness and
completeness - the PSAT problem - meta-theorems associative and distributive laws -
resolution in propositional calculus - soundness of resolution - converting arbitrary wffs to
conjunctions of clauses -resolution refutations - horn clauses - the predicate calculus -
motivation - the language and its syntax - semantics - quantification - semantics of quantifiers
- resolution in predicate calculus - unification - converting arbitrary wffs to clause form -
using resolution to prove theorems - answer extraction - knowledge representation by
networks - taxonomic knowledge – semantic networks - frames – scripts.

Module III (12 hours)

Neural networks - introduction - motivation - notation - the back propagation method -
generalization and accuracy - reasoning with uncertain information - review of probability
theory - probabilistic inference - bayes networks - - genetic programming - program
representation in GP - the GP process - communication and integration - interacting agents - a
modal logic of knowledge -communication among agents - speech acts - understanding
language strings - efficient communication - natural language processing - knowledge based
systems - reasoning with horn clauses - rule based expert systems.

Module IV (10 hours)

Programming in LISP - basic LISP primitives - definitions - Predicates -conditionals and
Binding - recursion and iteration - association lists - properties and data abstraction - lambda
expressions - macros - I/O in LISP - examples involving arrays and search.
 98
Text book

1. Nilsson N. J., Artificial Intelligence - A New Synthesis, Harcourt Asia Pvt. Ltd.

Reference books
1. Luger G.F. & Stubblefield W.A., Artificial Intelligence, Addison Wesley
2. Elain Rich & Kevin Knight, A rtificial Intelligence, Tata McGraw Hill
3. Tanimotto S.L., The Elements of Artificial Intelligence, Computer Science Press
4. Winston P.H., LISP, Addison Wesley
5. George F. Luger, Artificial Intelligence - Structures and strategies for complex
problem solving, Pearson Education
6. Stuart Russell, Peter Noxvig, Artificial Intelligence ~ A modern approach, Pearson
Education

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
QV -2 questions of l5 marks each from module IV with choice to answer any one
 99

CS04 804B : IMAGE PROCESSING

(Common with IT04 804B)
3 hours lecture and 1 hour tutorial per week

[Objective: The subject deals with techniques of image processing such as enhancement,
encoding and compression, which are inevitable in the present networked multimedia
scenario. A basic knowledge of information theory and digital signal processing is assumed.
The study is very significant in research perspective as well as in the application perspective.]
Module I (20 hours)
Introduction - digital image representation - fundamental steps in image processing -
elements of digital image processing systems - digital image fundamentals - elements of
visual perception - a simple image model -sampling and quantization - basic relationship
between pixels - image geometry - image transforms - introduction to Fourier transform -
discrete Fourier transform- some properties of 2-fourier transform (DFT) - the FFT-other
separable image transforms - hotelling transform.
Module II (12 hours)
Image enhancement - point processing - spatial filtering - frequency domain - color image
processing - image restoration - degradation model -diagonalization of circulant and block
circulant matrices - inverse filtering -least mean square filter.
 
Module III (10 hours)
Image compression - image compression models - elements of information theory - error-free
compression - lossy compression - image compression standards.
Module IV (10 hours)
Image reconstruction from projections - basics of projection - parallel beam and fan beam
projection - method of generating projections - Fourier slice theorem - filtered back
projection algorithms - testing back projection algorithms
Text book
1. Rafael C, Gonzalez & Woods R.E., Digital Image Processing, Addison Wesley
Reference books
1. Rosenfeld A. & Kak A.C., Digital Picture Processing, Academic Press
2. Jain A.K, Fundamentals of Digital Image Processing, Prentice Hall, Englewood
Cliffs
3. Schalkoff R. J., Digital Image Processing and Computer Vision, John Wiley
4. Pratt W.K., Digital Image Processing, John Wiley.

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of l5 marks each from module l with choice to answer any one
 100
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.

CS04 804C: INFORMATION THEORY & CODING

3 hours lecture and 1 hour tutorial per week

[Objective: The subject deals with the fundamentals of information quality, error control in
communication process and various systems of coding information for reliable communications.
Built on a sound mathematical basis, the methods developed in this field of study are essential in
a study of communication systems, information Technology and computing. A background in
algebraic structures would prove helpful while learning this subject.]
Module I (14 hours)
Information theory - information and entropy - properties of entropy of a binary memory less
source - extension of a discrete memory less source -source coding theorem - Shannon-Fano
coding - Huffman coding - Lempel Ziv coding - discrete memory less source - binary
symmetric channel - mutual information - properties - channel capacity - channel coding
theorem -information capacity theorem.
Module II (14 hours)
Coding - linear block codes - generator matrices - parity check matrices -encoder - syndrome
and error detection - minimum distance - error correction and error detection capabilities -
cyclic codes - coding and decoding.
Module III (14 hours)
Introduction to algebra - groups - fields - binary field arithmetic - construction of galois field -
basic properties - computations - vector spaces - matrices -BCH codes - description - decoding
- reed 55eneral codes
Module IV (10 hours)
Coding - convolutional codes - encoder - generator matrix - transform domain representation
- state diagram - distance properties - maximum likelihood decoding - Viterbi decoding -
sequential decoding - interleaved convolutional codes.
Text books
1. Simon Haykin, Communication Systems, John Wiley
2. Shu Lin & Costello D.J., Error Control Coding - Fundamentals and Applications,
Prentice Hall Inc. Englewood Cliffs.
Reference books
1. Das J., Malik S.K. & Chatterje P.K., Principles of Digital Communication, New Age
International Limited
2. Sam Shanmugham, Digital and Analog Communications, John Wiley
3. Simon Haykin, Digital Communications, John
4. Taub & Shilling, Principles of Communication Systems, Tata McGraw Hill.
Sessional work assessment
Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50
University examination pattern
QI - 8 short type questions of 5 marks each, 2 from each module
 101
QII -2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
QV -2 questions of 15 marks each from module IV with choice to answer any one.

CS04 804D : COMPUTATIONAL COMPLEXITY

3 hours lecture and 1 hour tutorial per week

[Objective: This course gives a clear cut idea to the students how to evaluate computational
complexities, so that they would be capable of design systems with maximum efficiency.]
Module I (13 hours)
Problems and algorithms - classification of problems - decision - search -optimization and
enumeration problems - review of unsolvability - rice theorem - fixed point theorem - degrees
of unsolvability - complexity classes - P, NP, co-NP, PSPACE - NP hardness - NP
completeness - cook's theorem - reductions -NP n co-NP - primality - pratt's theorem -
approximability - weak verifiers and non approximability.

Module II (13 hours)

Parallel models and complexity - class NC - P-completeness - lograthimic . Space - L and NL
- NL completeness - randomized computation - randomized complexity classes RP, BPP, PP
etc. - relation between classes.

Module III (13 hours)

Function (search) problems - classes FP and FNP - FNP completeness -optimization
problems - DP completeness - relation with P=NP problem -polynomial hierarchy - counting
problems - #P completeness - class ©P relation between P and NP.

Module IV (13 hours)

One way functions - public key cryptography - class UP - randomized cryptography -
alternation and games - AP - completeness - equivalence of AP and PSPACE - PSPACE
completeness - games against nature - interactive protocols - classes APP, ABPP and IP -
Shamir's theorem (IP-PSPACE) - zero knowledge proofs.

Textbook
1. Papadimitirou C.H., Computational Complexity, Addison Wesley

Reference books
1 Moret, B.M., The Theory of Computation, Addison Wesley
2. Bovet D.P. & Crescenzi P., Introduction to the Tlteory of Complexity, Prentice Hall

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
 102
QIV - 2 questions of 15 marks each from module III with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.

CS04 804E : MOBILE COMMUNICATION SYSTEMS

(Common with IT04 802)
3 hours lecture and 1 hour tutorial per week

[Objective: This course is an introduction to the field of mobile communications and focuses
on the aspects of digital data transfer in wireless and mobile environments. The students
require a basic understanding of communication and a rough knowledge of the Internet or
networking in general.]

Module I (12 hours)

Introduction - applications - history of wireless communications - reference model wireless
transmission - frequencies for radio transmission - signals -antennas - signal propagation -
multiplexing - modulation - spread spectrum - cellular systems - medium access control
- specialized MAC - SDMA - FDMA - TDMA - aloha - CSMA - collision avoidance -
polling - CDMA - comparison of S/T/F/CDMA.

Module II (12 hours)

Telecommunication systems - GSM - mobile services - system architecture -radio interface -
protocols - localization and calling - handover - security -new data services - DECT - TETRA
- UMTS and IMT-2000 - satellite systems - history - applications - basics - rooting -
localization - handover – examples - broadcast systems - overview - cyclic repetition of data -
digital audio broadcasting - digital video broadcasting.

Module 111(12 hours)

Wireless LAN - infrared Vs radio transmissions - infrastructure and ad-hoc networks - IEEE
802.11 - HIPERLAN - blue-tooth - wireless ATM - motivation for WATM working group -
WATM services - reference model - functions -radio access layer - handover - location
management - addressing - mobile quality of service - access point control protocol.

Module IV (16 hours)

Mobile network layer - mobile IP - packet delivery - registration - tunneling and
encapsulation - optimizations - reverse tunneling - dynamic host configuration protocol - ad-
hoc networks - routing - algorithms - metrics - mobile transport layer - TCP - indirect TCP -
snooping TCP - mobile TCP - retransmission -recovery - transaction oriented TACP - support
for mobility - file systems -WWW - WAP - architecture - datagram protocol - transport
security -transaction protocol - session protocol - application - environment - WML -WML
script - wireless telephony application - example stacks with WAP.

Text book
1. Schiller J., Mobile Communications, Addison Wesley.

Reference books
1. Singhal et.al S., The Wireless Application Protocol, Addison Wesley
2. Wesel E., Wireless Multimedia Communications: Networking Video, Voice and
Data, Addison Wesley
3. Gordman D., Wireless Personal Communications
4. Martyn Mallick, Mobile and wireless design essentials, Dream – tech India Pvt. Ltd.
 103
5. Lee W.C., Mobile Collection Tele Communications, McGraw Hill.
6. Ojawpera T. & Ranjee Prasad, Wide Band CDMA for Third Generation Mobile
Communication

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 rnarks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV -2 questions of I5 marks each from module lll with choice to answer any one.
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.
 104

CS04 804F : QUANTUM COMPUTING

(Common with IT04 804F)
3 hours lecture and 1 hour tutorial per week

[Objective: Experimental and theoretical research in quantum computation is accelerating

world-wide. New technologies for realizing quantum computers are being proposed, and new
types of quantum computation with various advantages over classical computation are
continually being discovered and analyzed. This course introduces the concepts of quantum
computation and its applications]

Module I (13 hours)

Foundations of quantum theory - states - observable - measurement -dynamics quantum
measurement - quantum entanglement - bell's theorems.

Module II (13 hours)

Classical information theory - entropy - quantum information theory -quantification of
entanglement - communication complexity - quantum cryptography.

Module III (13 hours)

Turing machines - reversible computation - universal logic gates and circuits - quantum
computers and circuits - quantum algorithms - search - FFT - prime factorization.

Module IV (13 hours)

Quantum simulations - quantum error correction and codes - fault tolerant quantum
computation - physical implementations — ion traps - quantum dots - cavity QED-
NMR.

Reference Books
1. Preskill J., Lecture Notes for the Course on Quantum Computation,
http://www.theory.caltech.edu/people.preskill/ph229
2. Berman G. P., Dooten G.D., Mainieri. R. & Tsifrinovich V., Introduction to
Quantum Computers, World Scientific
3. Lo. H. K., Popescu S. & Spiller T, Introduction to Quantum Computation and
Information, World Scientific .
4. Press A., Quantum Theory: Concepts and Methods, Kluwer Academic

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

Q I - 8 short type questions of 5 marks, 2 from each module
QII - 2 questions of 15 marks from module I with choice to answer any one
Q III -2 questions of 15 marks from module II with choice to answer any one
QIV - 2 questions of 15 marks from module III with choice to answer any one
 105
Q V - 2 questions of I 5 marks from module IV with choice to answer any one.

CS04 805A : NEURAL NETWORKS & FUZZY LOGIC

(common with IT04 805 A)
3 hours lecture and 1 hour tutorial per week

[Objective: This course is intended to introduce some of the methods and techniques by
means of which it is possible to incorporate human like performance in machine. At the end
of this course students will be able to design and develop such systems using neural networks
and fuzzy logic.]
Module I (13 hours)
Introduction to artificial neural networks - biological neurons - Mc Culloch and Pitts modals
of neuron - types of activation function - network architectures - knowledge representation -
learning process - error-correction learning -supervised learning - unsupervised learning -
single unit mappings and the perception - perception convergence theorem (with out proof) -
method of steepest descent - least mean square algorithms - adaline/medaline units
-multilayer perceptrons - derivation of the back-propagation algorithm.
Module II (13 hours)
Radial basis and recurrent neural networks - RBF network structure - covers theorem and the
separability of patterns - RBF learning strategies - K-means and LMS algorithms -
comparison of RBF and MLP networks - recurrent networks - Hopfield networks - energy
function - spurious states - error performance - simulated annealing - the Boltzman machine -
Boltzman learning rule - the mean field theory machine - MFT learning algorithm -
applications of neural network - the XOR problem - traveling salesman problem - image
compression using MLPs - character retrieval using Hopfield networks.
Module III (13 hours)
Fuzzy logic - fuzzy sets - properties - operations on fuzzy sets - fuzzy relations - operations
on fuzzy relations - the extension principle - fuzzy measures - membership functions -
fuzzification and denazification methods – fuzzy controllers - Mamdani and Sugeno types -
design arameters - choice of membership functions - fuzzification and defuzzification
methods – applications.
Module IV (13 hours)
Introduction to genetic algorithm and hybrid systems - genetic algorithms -natural evolution -
properties - classification - GA features - coding – selection - reproduction - cross over
and mutation operators basic GA and structure. Introduction to Hybrid systems - concept of
neuro-fuzzy and neuro-genetic systems.
Text books
1. Simon Haykins, "Neural Network a - Comprehensive Foundation ", Macmillan
College, Proc, Con, Inc.
2. Ross T.J., "Fuzzy Logic with Engineering Applications ", McGraw Hill.
Reference books
1. Zurada J.M., "Introduction to Artificial Neural Systems, Jaico publishers
2. Driankov D., Hellendoorn H. & Reinfrank M.,""-4n Introduction to Fuzzy Control",
Narosa.
3. Bart Kosko. "Neural Network and Fuzzy Systems ", Prentice Hall, Inc., Englewood
 106
Cliffs.
4. Goldberg D.E., "Genetic Algorithms in Search Optimisation and Machine Learning",
Addison Wesley.
5. Suran Goonatilake & Sukhdev Khebbal (Eds.), "Intelligent Hybrid Systems", John
Wiley.

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
QV - 2 questions of l5 marks each from module IV with choice to answer any one.
 107

CS2K 805B: PATTERN RECOGNITION

(common with IT04 805B)
3 hours lecture and 1 hour tutorial per week

[Objective: The course will impart a basic knowledge on pattern recognition and will give a
sound idea on the topics of parameter estimation and supervised learning, linear discriminant
functions and syntactic approach to PR. It will provide the strong foundation to students to
understand and design pattern recognition systems.]
Module 1(12 hours)
Introduction - introduction to statistical - syntactic and descriptive approaches - features and
feature extraction - learning - Bayes Decision theory - introduction - continuous case - 2-
category classification -minimum error rate classification - classifiers - discriminant functions
- and decision surfaces - error probabilities and integrals - normal density -discriminant
functions for normal density.
Module II (12 hours)
Parameter estimation and supervised learning-maximum likelihood estimation - the Bayes
classifier - learning the mean of a normal density - general 55enerali learning - nonparametric
technic - density estimation - parzen windows - k-nearest neighbour estimation - estimation
of posterior probabilities - nearest -neighbour rule - k-nearest neighbour rule.
Module 111(12 hours)
Linear discriminant functions - linear discriminant functions and decision surfaces -
55eneralized linear discriminant functions - 2-category linearly separable case - non-
separable behaviour - linear programming procedures -clustering - data description and
clustering - similarity measures - criterion functions for clustering.
Module IV (16 hours)
Syntactic approach to PR - introduction to pattern grammars and languages -higher
dimensional grammars - tree, graph, web, plex, and shape grammars -stochastic grammars -
attribute grammars - parsing techniques – grammatical inference.
Text books
1. Duda & Hart P.E, Pattern Classification And Scene Analysis, John Wiley
2. Gonzalez R.C. & Thomson M.G., Syntactic Pattern Recognition – An Introduction,
Addison Wesley.
Reference book
1. Fu K.S., Syntactic Pattern Recognition And Applications, Prentice Hall, Eaglewood
cliffs
Sessional work assessment
Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50
University examination pattern
 108
QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module l with choice to answer any one
QIII - 2 questions of 15 marks each from module IE with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.

CS04 805C : MANAGEMENT INFORMATION SYSTEMS

(Common with IT04 801)
3 hours lecture and 1 hour tutorial per week

[Objective: This course will introduce the methods and the influence of the information
systems in management milieu and use MIS as an effective tool in management and decision
making.]
Module I (12 hours)
Information systems - functions of management - levels of management -framework for
information systems - systems approach - systems concepts -systems and their environment -
effects of system approach in information systems design - using systems approach in
problem solving - strategic uses of information technology.
Module II (10 hours)
An overview of computer hardware and software components - file and database
management systems - introduction to network components -topologies and types - remote
access - the reasons for managers to implement networks - distributed systems - the internet
and office communications.
Module III (14 hours)
Application of information systems to functional - tactical and strategic areas of management,
decision support systems and expert systems.
Module IV (16 hours)
Information systems planning - critical success factor - business system planning -
ends/means analysis - organizing the information systems plan - systems analysis and design
- alternative application development approaches - organization of data processing - security
and ethical issues of information systems.
Text book
1. Schultheis R. & Mary Sumner, Management Information Systems-The Manager's
View, Tata McGraw Hill.
Reference books
1 Laudon K.C. & Laudon J.P., Management Information Systems - Organization and
Technology, Prentice Hall of India
2. Sadagopan S., Management Information Systems, Prentice Hall of India
3. Basandra S.K., Management Information Systems, Wheeler Publishing
4. Alter S., Information Systems: A Management Perspective, Addison Wesley
5. Effy Oz., Management Information Systems, Thomson, Vikas Publishing House
Sessional work assessment
Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50
University examination pattern
 109
QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
QV -2 questions of 15 marks each from module IV with choice to answer any one.

CS04 805D : VLSI DESIGN

3 hours lecture and 1 hour tutorial per week

[Objective: Design of high-performance, low power and cost effective systems demands
knowledge of all aspects digital design from application algorithms to fabrication and
packaging. The VLSI design is system design and this course imparts those skills to the
students and will be invaluable to every future VLSI design Engineer and Manager.]

Module I (14 hours)

Introduction to MOS technology - IC technology - MOS and VLSI - NMOS and "CMOS
fabrication - thermal aspects - MOS circuits tub ties and latch up - wire parasitic - design
rules and layouts - multilayer CMOS process - layout diagrams - stick diagrams -
hierarchical stick diagrams - layout design analysis tools.

Module II (14 hours)

Logic gates - review of combinational logic circuits - basic gate layouts – delay - power
Consumption - speed power product - wires and delay – combinational logic networks -
layout design methods -network delay - cross talk – power optimization - switch logic
networks.

Module III (12 hours)

Sequential machines - latches and flip flops - sequential system design -subsystem design -
pipelining - data paths - adders - ALU - ROM - RAM -FPGA - PLA – multipliers.

Module IV (12 hours)

Floor planning - methods - floor plan of a 4 bit processor - off chip connections –architecture
design - register transfer design - architecture for low power - architecture testing - cad
systems and algorithms - simulation - layout synthesis.

Reference books
1. Puck Nell D. A. & Eshraghm K., Basic VLSI Design - Systems and Circuits
2. Mead C, Conway L., Introduction to VLSI System, Addison Wesley
3. Wayne Wolf, Modern VLSI Design, Phipe.

Sessional work assessment

Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
QIII - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
 110
QV - 2 questions of l5 marks each from module IV with choice to answer any one.

CS04 805E : DATA MINING AND DATA WAREHOUSING

3 hours lecture and 1 hour tutorial per week

[Objective: This subject has evolved over the last decade to address the problem of
decreasing amount of useful information even when the amount of data keeps on increasing.
Many new applications including those in business and even security related areas have been
developed using the techniques of data mining. The objective of this subject of. study is to
familiarize the students with the concepts, algorithms, and applications of data mining, data
warehousing, and the related areas, emphasizing on real-world examples involving large
databases.]

Module I (12 hours)

Basic data mining tasks: Classification, Regression, Time Series Analysis, Prediction,
Clustering, Summarization, Sequence discovery.
Introduction to data ware housing, OLAP, OLTP, Knowledge discovery in databases.

Module II: (10 Hours)Data Mining Techniques:

Statistical Perspective on Data Mining: Point Estimation, Models based on summarization,
Bayes Theorem, Hypothesis testing, similarity measures, Application of Decision trees,
Neural Networks and Genetic algorithms in data mining.
Module III (12 hours) Core Topics in Data Mining:
Classification: Issues in classification, statistical algorithms, Distance-based algorithms,
Decision tree based algorithms, Neural Network-based algorithms, rule-based algorithms.
Clustering: Similarity and distance measures, outliers, partitional and hierarchical algorithms
(16 hrs).
Module IV (14 hrs) Association Rules
Large Item sets: Basic algorithms, Comparison of approaches. Advanced topics: Generalized
Association rules, multiple-level association rules, Quantitative rules, web mining, spatial
Mining and temporal mining (Introduction only).

Text books
1. Data mining: Introductory and Advanced Topics-Margaret H.Dunham. 2004 (Pearson
Education)
Reference books
1 Data Mining: Concepts & Techniques-Jiawei Han and Micheline Kamber 2002.
(Morgan Kauffman Publishers)
2. Principles of Data Mining: David Hand, Heikki Mannila, and Pedhraic Smyth. 2004.
(Prentice Hall India).
3. Data ware housing in the real world: A practical Guide for building decision
support systems-Sam Anahory and Dennis Thurray, 2000. (Addision Wesley).
4. Modern Information Retrieval: Richardo Baeza-Yates and Berthier Riberio-Neto.
1999, Addison Wesley.
 111
Sessional work assessment
Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each, 2 from each module
QII - 2 questions of 15 marks each from module l with choice to answer any one
Q III - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
Q V - 2 questions of 15 marks each from module IV with choice to answer any one.
 112

CS04 805F : ADVANCED TOPICS IN ALGORITHMS

3 hours lecture and 1 hour tutorial per week

[Objective of this paper is to acquaint the student with the advanced algorithmic techniques
for manipulating complex data structures in order to solve nontrivial problems. Wide ranging
applications of these techniques can be found in areas such as database management,
distributed systems, parallel processing, signal processing, etc. Study of the topics covered in
this paper is essential for anyone involved in the design of complex applications in the above
areas.]

Module I: Advanced data structures (13 hours)

Balanced binary search trees - AVL trees - red black trees - B/B+ trees - priority queues -
binomial heaps - Fibonacci heaps - mergeable heap operations - disjoint set representation -
path compression algorithm - hashing - chaining - open addressing hash functions - probing -
double hashing - universal hashing -graph algorithms - review - DFS - BFS - connected
Components - topological sorting - strong connectivity - minimal spanning tree - kruskal and
prim algorithms - shortest path problem - Dijkstra's and bellman - ford algorithms -Johnson's
algorithm for sparse graphs - flow networks - ford fukerson algorithm - maximum bipartite
matching - preflow push and lift to front algorithms.
Module II (13 hours)
Introduction to parallel algorithms - PRAM models - EREW, ERCW, CREW and CRCW -
relation between various models - handling read and write conflicts -work efficiency - Brent's
theorem - parallel merging, sorting, and connected components - list rank - Euler tour
technique - parallel prefix computation -deterministic symmetry breaking.
Module III: Distributed algorithms (13 hours)
Distributed models - synchronous algorithms - leader election - BFS - shortest path - maximal
independent set - minimal spanning tree - consensus algorithms with link and process failures
- byzantine agreement problem - asynchronous algorithms - Dijkstra's mutual exclusion
algorithm - bakery algorithm - randomized algorithm for dining philosophers' problem.
Module IV Selected topics (13 hours)
Polynomials and FFT - representation of polynomials - DFT and FFT - divide and conquer
FFT algorithm - efficient parallel FFT implementations - pattern matching - finite automata
based methods - Rabin Karp algorithm - Knuth Morris Pratt algorithm - Boyer Moore
heuristic - computational geometry - two dimensional problems - line segment intersection
convex hull - Graham's scan -Jarvis's march technique - closest pair of points in a set.
Textbook
1. Cormen T.H., Leiserson C.E., Rivest R.L., Introduction to Algorithms, Prentice Hall
of India.
Reference books
1. Brassad G. & Bratley P., Fundamentals of Algorithmics, Prentice Hall of India
2. Basse S., Computer Algorithms - Introduction to Design and Analysis, Addison
Wesley
3. Lynch N.A., Distributed Algorithms, Harcourt Asia (Morgan Kaufman)
 113
Sessional work assessment
Assignments (minimum 2) 2 x 7.5 = 15
2 tests 2 x 15 = 30
Regularity = 05
Total marks = 50

University examination pattern

QI - 8 short type questions of 5 marks each 2 from each module
QII - 2 questions of 15 marks each from module I with choice to answer any one
Q III - 2 questions of 15 marks each from module II with choice to answer any one
QIV - 2 questions of 15 marks each from module III with choice to answer any one
QV -2 questions of 15 marks each from module IV with choice to answer any one.
 114

CS04 806(P): NETWORKS LAB

3 hours practical per week

[Objective: This practical course includes experiments in computer networking using basic
network components and systems there by allowing the students to gain an intuitive feel for
network protocols. This course is very much significant both from research perspective and
from application perspective.]

Lab 1 : Implementation of PC to PC fiie transfer using serial port and MODEM.

Lab 2,3: Software Simulation of IEEE 802.3,802.4 and 802.5 protocols.
Lab4,5: Software Simulation of Medium Access Control protocols –
1) GoBackN,
2) Selective Repeat and
3) Sliding Window.
Lab 6 : Implementation of a subset of Simple Mail Transfer Protocol using UDP
Lab 7,8: Implementation of a subset of File Transfer Protocol using TCP/IP
Lab 9 : Implementation of "finger" utility using Remote Procedure Call (RPC)
Lab 10 : Generation and processing of HTML forms using CGI.

Reference books
1. Richard S.W., Unix Network Programming, PHI
2. Comer D.E., Internetworking with TCP/IP, Vol. 1,2 & 3, PHI
3. Campione et. al M., The Java Tutorial Continued, Addison Wesley.

Sessional work assessment

Lab practical and record = 25

Tests = 20
Regularity = 05
Total marks = 50
 115

CS04 807(P) : PROJECT

7 hours per week

[Objective: The project is aimed at improving the professional competency by touching the
areas which otherwise is not covered in theory or laboratory classes. There is a grater
realization of the importance of the application of ideas to build a solution to complement the
learning process. The work practice will help the students to develop ability to apply
theoretical and practical tools/ techniques to solve real life problems related to industry and
current research.]

This project is the continuation of the seventh semester project - the eighth semester is for the
development - testing and installation of the product - the product should have user manuals -
a detailed report is to be submitted at the end of the semester - the internal assessment may be
made individually and in groups.

Sessional work assessment

Design & development = 40

Testing and installation = 30
Regularity = 10
Report = 20
Total marks = 100
 116

CS 04 808(P) : VIVA VOCE

There is only university examination for Viva-voce - University will appoint examiners for
conducting the viva voce examination - the examiners will ask questions from subjects
studied for the B. Tech course, project, mini project and seminar reports of the student - the
relative mark distribution should be as follows

Marks distribution for Viva-Voce

Subject = 40
Project = 30
Mini project = 20
Seminar = 10
Total marks = 100

*******************