BTech CSE

ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY
Course Structure and Syllabus

For First Semester B.Tech Programme
(For All Branches)

FIRST SEMESTER
(AUGUST-NOVEMBER)
Course Structure:
Sub Hrs/week Credits

Sl. Subject
Code C
No L T P
Theory
MA131101 Mathematics-I 3 2 0 4
1
PH131102 Physics-I 2 2 0 3
2
CY131103 Chemistry-I 2 2 0 3
3
EE131104 Basic Electrical & Electronics Engineering-I 3 2 0 4
4
CS131105 Introduction to Computing 2 0 0 2
5
HS131106 English Communication & Technical Report Writing. 0 2 2 2
6
1 2
7 CE131107 Engineering Graphics-I 0 2
Practical
PH131112 Physics-I Lab 0 0 1
8 2
0 0
9 CY131113 Chemistry-I Lab 2 1
0 0 2 1
10 EE131114 Basic Electrical & Electronics Engineering-I Lab
0 0 1
11 CS131115 Introduction to Computing Lab 2
12 CE131117 Engineering Graphics-I-Lab 0 0 2 1
25
Total 13 12 12
Total Contact Hours = 37
Total Credits = 25
1
Detailed Syllabus:
Subject Code : MA131101

Subject: Mathematics - I
L-T-P: 3-2-0 Credit 4
Expected Weeks :12
Modules Topics Course Content Hours
I DIFFERENTIAL Single variable calculus:
CALCULUS Successive Differentiation-Leibnitz theorem, Taylors and 16
Maclaurins Series, Expansion of function.
Multi variable calculus:

Partial Derivatives, Eulers theorem on homogeneous
function (Statement & Application), Total derivatives.
Curve tracing:
Concept of curve tracing, Some important curves.
Jacobian:
Jacobians and their applications (for two and three
variables), Errors and Approximations.
Maxima and Minima:

Maxima and Minima of Functions of two variables,
Lagrange's method of undetermined multipliers.
II INTEGRAL Single variable calculus: 20

CALCULUS Reduction formula
/2 /2 /2
sin cos sin

n n m
xdx xdx x cos n xdx
0 , 0 0
, .
Areas under Plane curves (Cartesian & Polar),

Volume and surface area of solids of revolution of plane
curves.
Multi variable calculus:

Differentiation under integral sign (Leibnizs rule) Multiple
integrals.
Areas and Volumes by double and triple integrals
Beta and Gamma functions.
III DIFFERENTIAL First order first degree equation: 12
EQUATIONS Exact differential equation, reducible to exact differential
equation.
First order higher degree equation:
Solvable for p, x, y, Clairauts equation.
Higher order homogenous linear differential equation:
With constant coefficients, Homogeneous (Cauchy-Euler)
Equation.
Higher order Non homogenous linear differential
equation:
Differential operator methods, Variation of parameter
method, Method of undetermined coefficients.
Solution Of Simultaneous Equations.

Total 48
2
Text Books/Reference Books:
1. Advanced Engineering Mathematics by Erwin Kreyszig (Wiley Eastern Ltd.).

2. Higher Engineering Mathematics by B. S. Grewal (Khanna Publication, Delhi).
3. Engineering Mathematics, Wylie C.R. & Barrett L.C. (McGraw-Hill, Inc.)
4. An Introduction to Differential Equations, R.K. Ghosh and K.C.Maity (New Central Book Agency)
5. Engineering Mathematics(part I and part II), Babu Ram (Pearson).
6. A textbook of Engineering Mathematics I by U.N.Mishra, A.Devi, B.Sarma and R.Kalita.
(Mani Manik Prakash, Guwahati).
3
Subject Code : PH131102
Subject: Physics-I

Expected Weeks :12
I GENERAL PHYSICS Stress and Strain, Hookes law, Types of elasticity, 6
Equivalence of a shear to a compression and an extension
at right angles to each other, Energy of a strained body,
Relation connecting the elastic constants, Poissons ratio,
Bending of beams, Expression for bending moment,
Cantilever.
II GEOMETRICAL AND Spherical and Chromatic aberrations, Expression for 8
WAVE OPTICS longitudinal chromatic aberration, Achromatism of thin
lens, Interference of light, Types of Interference (division
of wavefront and division of amplitude), Interference in
thin films and wedge shaped films, Newton Rings
Fresnel and Fraunhoffer diffraction, Fraunhoffer
diffraction at a single slit, Intensity distribution in the
diffraction pattern due to single slit, Plane diffraction
grating, Conditions for secondary maxima and minima,
Dispersive and Resolving power of a grating.
III LCR CIRCUIT IN DC Helmholtz equation of Growth and Decay of current in 6
NETWORK L-R circuit, Charging of a condenser, Discharging of a
condenser through an inductor, Charging of a capacitor
through L&R, Discharge of a capacitor through L&R.
IV DIELECTRICS AND Polar and Non-polar Materials, Dielectric Constant and 8
MAGNETIC Dielectric Susceptibility of a material, Polarizability and
MATERIALS Polarization, Different types of Polarization, Expression
for local field inside a Dielectric, ClausiusMossotti
Relation, Effect of temperature and frequency on
polarization, Dielectric Loss, Applications of Dielectric
materials.
Classification of Magnetic Materials- Diamagnetism,
Paramagnetism, Ferromagnetism, Domain theory of
Ferromagnetism, Hysteresis Loop, Hysteresis Loss,
Expression for Hysteresis Loss in B-H Loop, Soft and
Hard Magnetic Materials, Antiferromagnetism and
Ferrimagnetism, Applications of Magnetic Materials in
different fields
V ELECTROMAGNETIC The Del Operator, Gradient of a Scalar Function, 8
THEORY Divergence of a Vector, Curl of a Vector and their
Physical Significance, Amperes Law, Poissons Equation
and Laplaces Equation, Continuity Equation,
Inconsistency in Amperes Law, Displacement Current,
Maxwells Equations (Derivation not required), Physical
Significance of Maxwells Equations, Differences between
Conduction Current and Displacement Current.
Total 36
Text Books and Reference Books:

1. Applied Physics for Engineers, Neeraj Mehta, PHI Learning Private Limited, New Delhi
2. Detailed Text Book of Engineering Physics, S.P. Basavaraju, Subhas Publication Subhas Stores, Bangalore.
3. Fundamentals of Physics - Jearl Walker, Published by Wiley India Private Limited,
ISBN: 978-81-265-1442-7.
4. Elements of Properties of Matter, D.S. Mathur. Publisher: S. Chand.
4
Subject Code : CY131103
Subject: Chemistry I
Expected Weeks :12

I THERMODYNAMICS: Meaning of system and surroundings; extensive and 4
FIRST LAW intensive thermodynamic functions. Internal energy and
work. Work of expansion of a gas under various
conditions. The convention of sign; Infinitesimal change
and reversibility of a process; First law of
thermodynamics.
State and path functions. Exact and inexact differentials
and the use of the laws of partial derivatives. Heat capcity
Cv; Enthalpy and Cp. Relation between Cp and Cv for an
ideal gas. Work of expansion and temperature change.
Heats of vaporization, fusion, chemical reaction, hydration
etc.
II THERMODYNAMICS: Entropy and randomness; measuring entropy; entropy 4
SECOND LAW change in a reversible and a spontaneous process; entropy
of melting and mixing; entropy change in a chemical
process.
Carnots engine and its efficiency. Second law of
thermodynamics. Absolute entropy.
III THERMODYNAMICS: Helmholtz free energy; Gibbs free energy and chemical 3
FREE ENERGY potential. Dependence of Gibbs function on temperature.
Thermodynamic equilibrium constant K; equilibrium
constants Kp and Kc. Dependence of equilibrium constant
on temperature and pressure.
IV ELECTROCHEMISTRY Electrode and electrode potential; Various types of 4
electrodes; Electrolytic cell and Galvanic cell; Cell emf;
Concentration cell; lead storage battery; dry battery and
Nickel - cadmium battery. Fuel cell.
V WAVE PROPERTY OF A brief summary of the failure of the laws of classical 4
MATTER mechanics.
Wave-particle duality: De Broglie relation; Heisenbergs
uncertainty principle; Electron-diffraction as a proof of
wave property of matter.
VI WAVEFUNCTION AND Wave function and its properties. Borns interpretation of 4
OPERATOR wave function; Operators and observables; Linear
momentum operator. Schrodingers introduction of kinetic
energy operator. Hamiltonian operator; Eigenvalue
equations, eigen function and eigen value.
VII QUANTIZATION OF Particle in an one-dimensional box and quantization of 4
ENERGY, QUANTUM energy; three-dimensional potential box and degeneracy of
NUMBERS energy states.
Schrodinger equation for hydrogen atom in Cartesian and
polar coordinates; radial and angular wavefunction. Three
space quantum numbers; Energy of hydrogen atom;
Mathematical expressions for different hydrogen
wavefunctions (radial and angular) and their graphical
representation; radial distribution function and probability
density.
Spin quantum number; Paulis exclusion principle.
Relative energy levels of the electron in hydrogen atom;
Electronic structure of multi-electron atoms and
classification of elements into s, p, d and f blocks.;
Ionization energy and electron affinity.
5
VII MOLECULAR Molecular orbital theory; linear combination of atomic 4
ORBITAL THEORY orbitals in simple diatomic molecule. Bonding and anti-
bonding M.O. in H2+ and H2 molecules. Orbital overlap
diagrams (s-s, s-p, p-p etc.).
Energy level diagrams for homonuclear and heteronuclear
diatomic molecules; explanation of bond order, bond
energy and magnetic property based on MO energy level
diagrams.
The concept of hybrid atomic orbitals with different types
of hybrid orbitals. Concept of resonance.
IX BONDING IN Bonding in Coordination compounds: valence bond theory 2
COORDINATION and crystal field theory.
COMPOUNDS
X MOLECULAR Introduction to molecular spectra. Infrared spectra: 3
SPECTRA principle, modes of vibration (stretching, bending),
absorption frequencies of functional groups and
application.
Proton magnetic resonance spectra: principle, chemical
shift, interpretation of PMR spectra of simple molecules.
Total 36
Text/Reference Books
1. P. W. Atkins, Physical Chemistry, Elbs, (Any Edition). (Low Cost Ed.).
2. D. K. Chakrabarty, Inorganic Chemistry, (Second Edition), New Age International, 2012 (New Delhi).
3. B. Sivasankar, Engineering Chemistry, Mcgraw-Hill (2008), New Delhi.
4. David W. Ball, Physical Chemistry, Cengage, 2009 (Low Cost Ed.)
5. R.S.Berry, S.A.Rice And J.Ross, Physical Chemistry. John Wiley, 1980.
6
Subject Code : EE131104
Subject: Basic Electrical And Electronics Engineering - I
Expected Weeks :12

I DC NETWORKS: Definitions of active, passive, linear nonlinear circuit 8
elements and networks; Kirchoffs laws; Nodal and mesh
analysis; Voltage and current sources; Network theorems
superposition. Thevenins, Nortons and maximum power
transfer.
II MAGNETIC Definitions of mmf, flux, flux-density and reluctance; 8
CIRCUITS: comparison between electric and magnetic circuits;
series, parallel and series-parallel circuits and their
solutions; energy stored in a magnetic circuit; lifting
power of a magnet; electromagnetic induction, self and
mutual inductance, hysteresis and eddy current losses.
.
III SINGLE PHASE AC Alternating voltages and currents- instantaneous, average 10
CIRCUITS: and rms values, form factor and peak factor; forms of
representation of alternating quantities; concept of phasor
and phasor diagrams; concept of lead and lag; reactance
and impedance; AC circuits- resistive, inductive,
capacitive, R-L, R-C and R-L-C circuits; AC circuits in
series, parallel and series-parallel combinations;
impedance triangle; admittance, susceptance and
conductance; apparent, active and reactive power and
power factor; resonance in AC circuits
IV THREE-PHASE AC Concept of three-phase AC , connections, phase and line 6
CIRCUITS values in star and delta connections; solutions of simple
3-ph balanced circuits with resistive and reactive loads;
3-ph power, phase sequence.
V INSTRUMENTS: Classification of instruments; essentials of indicating type 8

instruments- deflecting controlling and damping torque;
types of indicating instruments; moving coil and moving
iron ammeters and voltmeters; extension of range of
instruments - use of shunts and multiplier; Wattmeter,
Single phase induction type energy meter; Errors and
compensations.
VI ELECTRONICS: Diode as a rectifier- half wave and full wave rectifier 8

circuits; ripples in output waveform- ripple factor;
introduction to filters; zener diode and its application as
voltage regulator; bipolar junction transistor and its
classification, static characteristics.
Total 48
Text/Reference Books:
1. Basic Electrical Engineering: I J Nagrath
2. Basic Electrical Engineering: Mittle
3. Electro Technology: H Cotton
4. A Text book of Electrical Technology: B L Theraja
5. Electrical and Electronic Technology- Edward Hughes
6. Principles of Electronics- V. K. Mehta
7
Subject Code : CS131105
Subject: Introduction To Computing

Expected Weeks :12

I INTRODUCTION Definition of algorithm and computer programming. Use 2
of Flow Charts. Symbols and their uses. Introduction to
Editing Tools
II PROGRAM Brief discussion on different types of programming 4
DEVELOPMENT AND languages. Introduction to C language,
PROGRAMMING
LANGUAGES
III PROGRAMMING IN C Identifiers, data types, operators in C language. Header 4
LANGUAGE and Library files. Simple programs using assignment
statements
IV CONDITIONAL If, nested if, switch-case etc. Ex- Conversion between 3F 4
CONTROL & c, Simple Interest, Compound Interest etc.
STATEMENTS
V ARRAYS: Definition and example of arrays. Single dimension and 4
multi dimensional arrays. Ex. Sorting in ascending &
descending , Minimum & Maximum of an array, Reverse
of an array elements, Palindrom, roots of an Second degree
equation etc.
VI FUNCTIONS: Type Of Functions, Function Definition ,Function 4

prototype, declaration, function calling. Formal argument
& actual argument. Parameter passing technique.
VII INFORMATION Elements of Information Technology. 2

TECHNOLOGY
Total 24
1. Computer Programming in C (PHI ) Rajaraman
2. Computer Fundamentals and Programming in C(Oxford) Reema Thareja
3. Mastering C (Tata McGraw Hill) Venugopal and Prasad
4. Let us C (Bpb) Yashawant kanetkar
5.Balaguruswamy.
8
Subject Code : HS131106
Subject: English Communication And Technical Report Writing

Expected Weeks :12

I BASICS OF Need of Communication Skills; Channels, forms and 1
COMMUNICATION dimensions of Communication; Oral and written
communication; Internal and external communication;
Verbal and non-verbal communication; Barriers to
communication; Principles of effective communication.
II WRITING SKILLS Letters, reports, notes, memos; Language and format of 3
various types of business letters; Language and style of
reports; Report writing strategies; Analysis of a sample
report.
III GRAMMAR AND Tenses and Concept of Time; Active and Passive 3
VOCABULARY Constructions; Direct-Indirect Speeches; Preposition;
Conditionals; Parallel Structure; Modifiers; Sentence
Transformation;.Vocabulary (Idioms, Confusables, One-
word substitute, Synonyms-Antonyms).
IV CAREER ORIENTAL Resume Writing, Curriculum Vitae (Cv) ,Statement Of 3
COMMUNICATION Purpose (Sop)
Team-Talks, Group Discussion And Interviews
V ADVANCED Interview through telephone/video-conferencing; Power- 2
TECHNIQUES IN point presentation: structure and format; Using e-mail
TECHNICAL for business communication; Standard e-mail practices;
COMMUNICATION Language in e-mail; Using internet for collecting
information; Referencing while using internet materials for
project reports.
VI LANGUAGE (a)Emphasizing Listening and comprehension skills; 12
LABORATORY Reading Skills; Sound Structure of English and intonation
patterns
(b)Language laboratory training in speaking skills
covering oral presentations, mock interviews and model
group discussions through the choice of appropriate
programmes.
total 24
1. Technical writing, B.N. Basu, PHI Learning Private Limited, ISBN: 978-81-203-3334-5.
2. Communication Skills for Engineers and Scientists, Sangeeta Sharma Binod Mishra, PHI Learning
Private Limited, ISBN: 978-81-203-3719-0.
3. Communication Skills for Engineers, C. Muralikrishna, Sunita Mishra, Dorling Kindersley Private
Limited, licensees of Pearson Education in South Asia, ISBN: 978-81-317-3384-4.
4. Technical Communication: A Practical Approach, William Sanborn Pfeiffer, T.V.S. Padmaja, Dorling
Kindersley Private Limited, licensees of Pearson Education in South Asia,
ISBN: 978-81-317-0088-4.
5. A Handbook of Pronunciation of English Words by J.Sethi, D.V. Jindal (PHI Learning)
6. Common Mistakes in English by T.J.Fitikides ( Pearson)
9
Subject Code : CE131107/ CE131117
Subject: Engineering Graphics I / Engineering Graphics I Lab
L-T-P: 1-2-0/ 0-0-2 Credit 2/1
Expected Weeks :12
COURSE CONTENTS:
Module Topic Hours
1 Introduction: Drawing Instruments, Handling & Use 2
Lines, Lettering and Dimensioning: Types, Thickness, Shades, single stroke letters, general
2 5
rules of dimensioning.
Scales: Representative fraction, Types of scales-Plain scales, Diagonal scales, Comparative

3 5
scale, Vernier scale, Scale of chords.
Curves used in engineering practices: Conic sections Ellipse, Parabola, Hyperbola, Tangent
4 and normal to conics, Cycloid,Trochoid, Epicycloid, Hypocycloid, Epitrochoid, Hypotrochoid, 5
Spiral, Logarithmic spiral.
Orthographic Projection: Planes of projection, four quadrants, First angle projection, Third 2
angle projection.
i. Projection of Points
ii. Projection of Straight Line: Introduction, Inclined to one plane and parallel to the 3
5 other, Line incline to both the planes, Line contained by a plain perpendicular to both
the reference planes, true length of a straight line and its inclinations with to 5
reference plane.
iii. Projections of Planes: Traces of planes, projection of planes inclined to one
reference plane and perpendicular to other, projection of oblique planes.
5
Isometric View
6 Introduction 4
Axes, Line, Plane, Scale
Isometric drawing of objects (prism, pyramids)
TOTAL 36
1. Engineering Graphics Degree, K.C. John, Published by PHI Learning Private Limited,
ISBN-978-81-203-3788-6.
2. Engineering Drawing, N. D. Bhatt, Charotar Publishing House Pvt. Ltd., ISBN: 978- 93-80358-17-8.
3. Engineering Drawing with an introduction to AutoCAD, Dhananjay A Jolhe, Tata McGraw Hill Education Pvt.
Ltd., ISBN: 978-0-07-064837-1.
10
Subject: Physics-I Lab
Expected Weeks: 12
Experiment Experiment Title Hours

No.
I Determination of Rigidity of Modulus of the material of the given rod by 1
Statical method.
II Determination of Moment of Inertia of a given solid about its own axis by 1
using M.I.Table.
III Determination of Resistance of a Galvanometer using Post Office Box. 1
IV Determination of ratio of E.M.F of two cells using Potentiometer. 1
V Determination of Youngs Modulus using Searles Apparatus 1
VI Determination of Powers of Given lenses using an Optical Bench 2

(i) Concave Lense
(ii) Convex Lense
VII Determination of Horizontal Components of Earths Magnetic field using 1
Magnetometer
VIII Determination of 2
(i)Angle of Incidence(i) and Deviation Curve (d) of a Prism using
Spectrometer.
(ii)The angle of minimum deviation and refractive index of material of the
Prism
IX Determination of coefficient of Viscosity of water by Capillary Flow Method. 1
X Revision of the Experiments and Internal Viva 1
Total 12

Subject: Chemistry-I Lab
Expected Weeks :12

No.
I Qualitative Analysis of an Organic sample:
Detection of elements (N,S and Halogens) and functional groups in different
organic samples :
1. -Naphthol 1
2. m-Nitrobenzene 1
3. Oxalic Acid 1
4. Benzophenone 1
5. o-Chloro benzoic acid 1
6. p -Toluidine 1
7. Resorcinol 1
II Inorganic preparation
1. Mohrs salt 2
2. Potash Alum 2
III Revision of the Experiments and Internal Viva 1
Total 12
11
Subject: Basic Electrical & Electronics Engineering-I Lab
Expected Weeks :12

No.
I Calibration of a Milliammeter as a Voltmeter. 1
II Calibration of a Millivoltmeter r as an Ammeter 1
III Characteristics of Filament Lamp. 1
IV Verification of Thevenins Theorem 1
V Verification of Maximum Power Transfer Theorem 1
VI Study of R-L-C Series Circuit 1
VII Study of R-L-C Parallel Circuit 1
VIII Forward Characteristics of Semiconductor Diode 1
IX Measurement of Power with Wattmeter. 1
X Measurement of Ohmic & Effective Resistance 1
XI Revision of the Experiments and Internal Viva 2
Total 12
12
Subject Code : CS131115
Subject: Introduction to Computing Lab
Expected Weeks :12

No.
I (a) Write a program to display Hello World. 1
(b) Write a program to find:
i. Addition of two numbers.
ii. Subtraction of two numbers.
iii. Multiplication of two numbers.
iv. Division of two numbers.
II (a) Write a program to find area of : 1

i. Rectangle. (ii) Circle.(iii)Triangle.
(b) Write a program to find simple interest, compound interest and
amount.
III (a) Write a program to check whether the number is odd or even. 1
(b) Write a program to find the greater of two numbers.
(c) Write a program to do swapping of two numbers using third
variable.
(d) Write a program to find the greatest of three numbers using if else.
IV (a) Write a program to calculate the sum of all the numbers from 1 to 1
50 using for loop.
(b) Write a program to display your name upto 10 times using while
loop.
(c) Write a program to print even numbers from 1 to 50.
V (a) Write a program to add the digits of a 4 digit number. 1

(b) Write a program to covert temperature from C to F and F to C.
(c) Write a program to check whether a year is leap year or not.
VI (a) Write a program to display an array of elements. 1

(b) Write a program to find the factorial of a number.
(c) Write a program to print all the numbers divisible by 2 and 3
between 1 and 50.
VII (a) Write a program to find the greatest among 10 numbers. 1

(b) Write a program to perform a multiplication table of a user given
number.
(c) Write a program to reverse a number.
VIII (a) Write a program to find the area of a triangle,rectangle and circle 1
using switch case.
(b) Write a program to calculate the grade using nested if and case
statements.
(c) Write a program to perform addition, subtraction & multiplication
of two numbers using switch case.
IX (a) Write a program to find the smallest among 10 numbers. 1

(b) Write a program for swapping of two numbers using functions.
(c) Write a program to find the factorial of a number using function.
13
X (a) Write a program to copy a string using library function. 1
(b) Write a program to calculate x=a*(b*c)/(b-c).
(c) Write a program to calculate sum of even numbers from 1 to 50.
(d) Write a program to find the sum of numbers divisible by 7.
XI (a) Write a program to display your name upto 10 times using for 1
loop.
(b) Write a program to find the length of a string using library
function.
(c) Write a program to reverse a string using library function.
(d) Write a program to concatenate a string using library function.
XII Revision of the Experiments and Internal Viva 1
Total 12
******
14
GUWAHATI
SYLLABUS FOR SECOND SEMESTER BTech

Syllabus and Course Structure for the Second Semester for
B.Tech Programme
SECOND SEMESTER
(JANUARY-JUNE)
Sl No
Semester II: Common to all Branches Hrs Credits
Sub Code Subject
L T P C
Theory
1 MA131201 Mathematics-II 3 0 0 3
2 PH131202 Physics-II 2 2 0 3
3 CY131203 Chemistry-II 2 2 0 3
4 ET131204 Basic Electrical & Electronics Engineering - II 2 2 0 3
5 ME131205 Basic Mechanical Engineering 3 0 0 3
6 CE131206 Basic Civil Engineering 3 0 0 3

7 HS131207 Environmental Science 2 0 0 2
Practical
8 PH131212 Physics- II Lab 0 0 2 1
9 CY131213 Chemistry- II Lab 0 0 2 1
Basic Electrical & Electronics Engineering II
10 ET131214 0 0 2 1
Lab
11 ME131215 Basic Mechanical Engineering Lab 0 0 2 1
ME131218/
13 EE131218 Work shop 0 0 2 1
17 6 10 25
Total Contact Hours = 33
Total Credits = 25
Subject Code : MA131201
Subject: Mathematics - II
Expected Weeks :12
I LINEAR ALGEBRA A.Linear Algebra 1:
(i) Recapitulation of Matrix theory, Elementary 18
transformations, Reduction of the given matrix to echelon
and normal forms
(ii) Rank of a matrix, Consistency of a system of linear
equations and solution Solution of a system of linear
homogeneous equations (trivial and non-trivial solutions)
(iii) Solution of a system of non-homogeneous equations by
Gauss elimination and Gauss Jordan methods
B.Linear Algebra 2:
(i) Vector Space and subspace (Definition and example
only),Basis and dimension, Row rank and column rank,
Equality of rank
(ii) Inner product and inner product space, Orthogonal and
orthonormal vectors,Orthogonalisation of vectors(Gram-
Schimdt method),
(iii) Eigen values and eigen vectors of a matrix(for
dimension 2 and 3),Caley-Hamilton theorem,
Diagonalisation, Reduction of matrix to diagonal form,
necessary and sufficient condition for diagonalisation.
II VECTOR ALGEBRA A.Vector Algebra: 12
AND CALCULUS (i) Scalar and vector triple products and related problems.
(ii) Equation of straight line, Plane and sphere.
B.Vector calculus:
(i) Vector function of a scalar variable.
(ii) Differentiation of a vector function.
(iii) Scalar and vector point functions.
(iv) Gradient of a scalar point function.
(v) Directional derivative and related problems.
(vi) Divergence and curl of a vector point function.
(vii) Idea of line, Surface and volume integrals.
(viii) Greens theorem.
(ix) Gauss Divergence Theorem and
(x) Stokes theorem (Statements and applications).
III FOURIER SERIES Fourier series: 6
(i) Even and Odd function,
(ii) Eulers formula,
(iii) Fourier series expansion of f ( x) in c x c 2 ,
(iv) Dirichlets conditions,
(v) Fourier series for discontinuous functions, change of
intervals, half range series.
Total 36
Text Books/Reference Books:
1. Advanced Engineering Mathematics by Erwin Kreyszig (Wiley Eastern Ltd.).
2. Higher Engineering Mathematics by B. S. Grewal (Khanna Publication, Delhi).
3. Engineering Mathematics, Wylie C.R. & Barrett L.C. (McGraw-Hill, Inc.)
4. Engineering Mathematics(part I and part II), Babu Ram (Pearson).
5. Vector Calculus- Shantinarayan, S.Chand & Co.
6. A Text book of Vector algebra by Shanti Narayan: S. Chand & Co.
7. Higher Engineering Mathematics by Bandaru Venkata Ramana, Tata McGraw - Hill Education.
8. Schaums outline of Linear Algebra.
Subject Code : PH 131202
Subject: Physics-II
Expected Weeks : 12
I X-RAYS Production and Properties of X-rays, Hard X-rays and Soft X- 4
rays, Continuous and Characteristic X-rays Spectrum, Origin
of X-rays, Difference between X-ray spectra and Optical
spectra, Moseleys Law.
II ACOUSTICS AND Weber Fechner law, Units of Loudness- Decibel, Phone, 9

ULTRASONICS Sone, Absorption coefficient, Reverberation, Reverberation
time, Sabines formula for reverberation time (Derivation not
required), Factors affecting acoustics of buildings and their
remedies, Design of a Good Acoustical Building
Properties of ultrasonic waves, Ultrasonic production

(Magnetostriction and Piezoelectric method), Applications of
Ultrasonics.
III LASER AND FIBRE Induced absorption, Spontaneous and Stimulated emission, 7
OPTICS Einsteins coefficients (A & B), Population Inversion,
Pumping, Principle of Laser, Characteristics of a laser beam,
Ruby and Semiconductor Laser, Application of Lasers.
Optical fibre- Principles and Structure, Propagation of light in

optical fibres, Numerical aperture and acceptance angle,
Classification of optical fibres- Single and Multimode, Step
Index and Graded Index fibres, Losses in fibres, Optical fibre
communication system (Block diagram only).
IV QUANTUM De-Broglie hypothesis (concept of group velocity and phase 6

MECHANICS velocity), Expression for de-Broglie wavelength in terms of
group velocity and phase velocity, Davisson and Germer
Experiment, Heisenbergs Uncertainty principle and its
applications.
V SOLID STATE P-N Junction Diode, Biasing of P-N Junction Diode & its I-V 10
ELECTRONICS AND Characteristics, Breakdown of a P-N Junction Diode
SUPERCONDUCTIVITY (Avalanche and Zener breakdown), Junction Capacitance,
Hall Effect, Determination of Hall Coefficient, Bipolar
Junction Transistor, Transistor Connections, Constants of a
Transistor, Common-Emitter Transistor Amplifier.
Physical Properties of Conventional Superconductors

(Meissner Effect, Critical Magnetic Field, Isotope Effect,
Persistent Current, Magnetic Levitation), Type-I and Type-II
Superconductors and their comparison, BCS theory of
Superconductivity (Qualitative only).
Total 36
Text Books and Reference Books:
1. Applied Physics for Engineers, Neeraj Mehta, PHI Learning Private Limited, New Delhi
2. Detailed Text Book of Engineering Physics, S.P. Basavaraju, Subhas Publication Subhas Stores, Bangalore.
3. Fundamentals of Physics - Jearl Walker, Published by Wiley India Private Limited,
ISBN: 978-81-265-1442-7.
4. Elements of Properties of Matter, D.S. Mathur. Publisher: S. Chand.
Subject: Chemistry II
Expected Weeks :12
I CRYSTAL STRUCTURE Crystalline solids and crystal structure. Plane and space 4
lattice. Unit cell. Types of Bravais lattice. Crystal planes
and Miller index. X-ray diffraction and Braggs law.
Powder method. Indexing powder diffraction pattern for
cubic and tetragonal crystals
II STRUCTURE OF Ionic bonding in solids and lattice energy. Born-Lande 4
INORGANIC SOLIDS equation of lattice energy.
Close packing of atoms and packing efficiency. Structure
of metals and alloys. Octahedral and tetrahedral holes.
Radius ratio rules.
III FUELS Soild fuels with emphasis on coal; domestic and 4
metallurgical coke. Calorific value and its determination;
Dulongs formula for GCV and LCV.
Liquid fuel with emphasis on petroleum; processing of
petroleum crude; Octane and Cetane numbers; reforming
of straight run gasoline; cracking. Types of cracking.
Non-conventional sources of energy: solar, wind and
nuclear energy.
IV LIQUID CRYSTALS Mesomorphic phases: thermotropic and lyotropic; 4
smectic, nemetic and cholesteric liquid crystals. Use of
liquid crystals.
V REFRACTORY Preparation of refractory materials; Classification into 2
MATERIAL acidic, basic and neutral refractories and their uses
VI POINT DEFECTS IN Point defects in metals and ionic crystals (vacancy, 4

SOLIDS interstitial, impurity and valence defects, Frenkel and
Schottky defects, F centre).
Electrical property
Electrical property of solids. Fermi energy. The concept of
hole. Metals, insulators and semiconductors. n- and p-type
semiconductors. Photovoltaic cell.
Elemental semiconductors; III-V and II-VI
semiconductors.
VII POLYMER Monomer, oligomer and polymer. Types of 5
polymerization. Methods of polymerization. Molecular
weight of polymers. Structure and properties of polymers.
Natural polymers.
Important thermosetting polymers: cellulose derivatives,
polythene, PVC, PTFE, PMMA, polystyrene,
polycarbonate, polyamide and phenolic resins.
Speciality polymers: silicones, conducting polymers and

biodegradable polymers.
VIII NANOMATERIAL Introduction, differences from other materials, Properties 2

of nanomaterials, one, two and 3D nanomaterials,
preparation of nanomaterials (top down and bottom up
approach), applications of nanomaterials, carbon
nanotubes.
IX COMPOSITE Composites and their constituents; Classification: particle 3
MATERIALS reinforced composites, fiber reinforced composites and
properties; Metal matrix, ceramic matrix and polymer
matrix composites
X CEMENT Portland cement: raw materials, manufacture. Different 2
types of Portland cement; chemical reaction during
formation of cement and in hardening of cement.
XI LUBRICANTS Mechanism of lubrication, liquid lubricants and their 2

properties, grease; solid lubricants
Total 36
Text/Reference Books
1. H. V. Keer, PRINCIPLES OF THE SOLID STATE, New Age International, New Delhi, 1993.
2. D. K. Chakrabarty, SOLID STATE CHEMISTRY, (second edition), New Age International, New Delhi,
2009.
3. B. Sivasankaar, ENGINEERING CHEMISTRY, Tata McGraw-Hill, New Delhi, 2008.
4. R. Bapna and R. Gupta, ENGINEERING CHEMISTRY, Macmillan India (2010)
Subject Code : ET131204
Subject: Basic Electrical and Electronics Engineering - II
Expected Weeks :12
I FUNDAMENTALS OF i) Basic constructional Features, types, elementary idea of 3
DC MACHINES DC machine winding, EMF equations, characteristics of
DC generators, OCC and the load characteristics,
ii) Working principle of DC motor, back emf, speed 3

equation, speed control.
II TRANSFORMER i) Theory of an ideal transformer, iron core transformer, 3
EMF equation, voltage, current and transformation ratio,
ii) Losses and efficiency of a transformer, 2
iii) Condition for maximum efficiency, all - day efficiency, 3

voltage regulation.
III A.C. SYNCHRONOUS i) Constructional features, EMF equation, rotating mmf. 2
MACHINES
ii) Principle of operation of synchronous motor, 2
iii) Applications
IV INDUCTION MOTOR i) Constructional features of three phase induction motors, 3
working principle, concept of slip
3
ii) Introduction to single phase induction motor, types,
applications.
V ANALOG Introduction to transistors, types, CE,CB,CE-configuration, 6
ELECTRONICS concept of and , and their relationship, characteristics of
CE transistor, cut-off, saturation and active mode, concept
of DC operating point.
Preliminary ideas on Operational Amplifier.
VI DIGITAL Number system and codes, Decimal and binary numbers, 6
ELECTRONICS conversion of decimal to binary and vice versa, Basic
building blocks in digital electronics, NOT, AND,OR,
NAND, NOR, XOR ,X-NOR, Boolean algebra,
DMorgans theorem, combinational circuit, truth table,
realization using gates
Total 36
Reference Books:
1. Basic Electrical and Electronics Engineering- -S.K Bhattacharya
2. Basic Electrical and Electronics Engineering- -Sukheja and Nagsarkar
3. Basic Electrical Engineering-R.S Ananda Murthy.
4. Basic Electronics-Debashish De
5. Foundation of Electronics-J.R Cogdell
Subject Code : ME131205
Subject: Basic Mechanical Engineering
Expected Weeks :12
I THERMODYNAMICS System, properties, different Processes, work done during 6
the process, Statement of Laws of Thermodynamics,
Carnot, Reversed Carnot, Otto and Diesel Cycles air
standard efficiency (No derivations). Simple problems on
air standard efficiency.
II PROPERTIES OF Formation of steam at constant pressure, Thermodynamic
STEAM properties of steam, Condition of steam, Classification of
boilers, mounting and accessories.
ENERGY 7
Working principles and applications of Turbines - Steam
CONVERSION turbines, Gas turbines, Hydraulic turbines, I.C. engines,
DEVICES household refrigerator.
III HEAT TRANSFER Definition of heat transfer, modes of heat transfer,

Fouriers law. Insulating materials and their properties. 3
IV FLUID MECHANICS Properties of Fluids: Pressure or intensity of Pressure, 3

Mass Density or Density or Specific Mass, Weight
Density or Specific Weight, Specific Volume, Specific
Gravity. Viscosity: Newtons Law of Viscosity, Kinematic
Viscosity.
V ENGINEERING Force, Moment and Couple, Free body diagrams, General 7
MECHANICS equations of equilibrium, Friction, Center of gravity and
moment of inertia, Simple problems on CG, MI and
Friction- simple definitions, Law of friction (inclined plane
only)
VI SIMPLE MACHINES Definition of machine, Velocity ratio, Mechanical 6

advantage, Efficiency, Laws of machines, Reversibility of
machine, Simple problems
POWER Simple systems of belt drives and gear drives.

TRANSMISSION
VII MANUFACTURING Description of Die casting, forging and welding 4

PROCESS
Total 36
Text Book/ Reference Books:
1. Basic Mechanical Engineering, T.S. Rajan, New Age International

2. Basic Mechanical Engineering, C.M. Agrawal, Basant Agrawal, Wiley India Private Limited
3. Theory of Machines, S.S. Rattan, Tata McGraw Hill
4. Engineering Mechanics , Timoshenko & Young, Tata McGraw Hill
5. Fluid Mechanics, R.K. Bansal, Laxmi Publications
6. Thermodynamics, P.K. Nag, Tata McGraw Hill
7. Power Plant Engineering, P.K. Nag, Tata McGraw Hill.
8. Workshop Technology, B S Raghuwanshi, Dhanpat Rai and Company (P) Limited
Subject Code : CE131206
Subject: Basic Civil Engineering
Expected Weeks: 12

AN INTRODUCTION Developments in Civil Engineering; Importance of Civil
TO CIVIL Engineering; Branches in Civil Engineering (Surveying,
1 2
ENGINEERING Building, Transportation, Geotechnical, Hydraulics,
Hydrology, Environmental etc).
BUILDING Bricks; Types of Bricks; Classification of Bricks- First
MATERIALS Class, Second Class, Third Class and Fourth Class Brick;
Characteristics of Good Brick; Calculation of number of
bricks for a given area; Rocks; Classification of Rocks-
2 8
geological, chemical and structural; Quarrying of Rocks-
without blasting and by blasting; Cement; Chemical
Composition of Cement; Mortar; Concrete; Difference
between Mortar and Concrete, Cement as stabilizer.
STRENGTH OF Simple Stress and Strain;Types of stress and strain-
MATERIALS Tensile, Compressive, Shear and Bending; Hooks
3 Law; Youngs Modulus; Simple Problems on 7
Youngs Modulus; Introduction to Beams and
Columns; Types of Beams.
ENGINEERING Surveying; Classification of Surveying- Plane and
SURVEY Geodetic; Principle of Surveying; Methods of
Chaining; Errors in Chaining; Chain and Tape
Correction; Types of Compass Traversing- Closed
and Open; Problems on WCB and QB, FB and BB;
4 10
Local Attraction; Datum, R.L., Bench Mark, FS and
BS, HI, Change Point; Methods of Calculation of
RL- Height of instrument system, Rise and Fall
Method; Total Station; Photogrammetry; Remote
Sensing.
HIGHWAY Classification of highways based on location and
5 ENGINEERING function; Ideal cross-section of highway and related 3
terms with sketches.
ENERGY EFFICIENT Basic concept, Safety measures of building against
6 BUILDING
3
fire, earthquake, electricity
SOIL MECHANICS Introduction to Soil Mechanics; Soil formation and
7 soil types- Residual and Transported; Civil 3
engineering problems related to soil.
Total hours 36
Recommended Books:
1. Building Materials by Rangwala; Charotar Publishing House.
2. Surveying and Levelling by N NBasak; Tata McGraw Hill.
3. Strength of Materials by Dr. R.K. Bansal; Laxmi Publication.
4. Highway Engineering by Rangwala; Charotar Publishing House
Subject Code : HS131207
Subject: Environmental Science
Expected Weeks :12

I CONCEPTS OF Environment, Levels of organizations in environment, 4
ENVIRONMENTAL Structure and functions in an ecosystem; Biosphere, its
SCIENCES Origin and distribution on land, in water and in air, Broad
nature of chemical composition of plants and animals
II NATURAL Renewable and Non-renewable Resources, Forests, water, 4
RESOURCES minerals, Food and land (with example of one case study);
Energy, Growing energy needs, energy sources
(conventional and alternative)
III BIODIVERSITY AND Biodiversity at global, national and local levels; India as a 4
ITS CONSERVATION mega-diversity nation; Threats to biodiversity (biotic,
abiotic stresses), and strategies for conservation
IV ENVIRONMENTAL Types of pollution- Air, water (including urban, rural, 6
POLLUTION marine), soil, noise, thermal, nuclear; Pollution prevention;
Management of pollution Rural /Urban/Industrial waste
management [with case study of any one type, e.g., power
(thermal/nuclear), fertilizer, tannin, leather, chemical,
sugar], Solid/Liquid waste management, disaster
management
V SOCIAL ISSUES AND Problems relating to urban environment- Population 6
ENVIRONMENT pressure, water scarcity, industrialization; remedial
measures
Climate change- Reasons, effects (global warming, ozone
layer depletion, acid rain) with one case study; Legal
issues- Environmental legislation (Acts and issues
involved), Environmental ethics;
Environmental Monitoring covering, Monitoring-
Identification of environmental
Total 24
1. Agarwal, K.C., Environmental Biology, Nidi Publication Ltd., Bikaner, 2001.
2. Bharucha Erach, Biodiversity of India, Mapin Publishing Pvt. Ltd., Ahmadabad, 2002.
3. Dr R J Ranjit Daniels. And Dr Jagadish Krishnaswamy.-- Environmental studies-2010-willey india.
Subject: Physics-II Lab
Expected Weeks :12
Experiment Experiment Title Lab Hour
I To determine the mechanical equivalent of heat by Joules calorimeter 1
II To determine the specific heat of the given liquid by the method of cooling 1
III To measure the current flowing through an external circuit with the help of a 1
potentiometer.
IV To determine the grating element and number of lines per unit length of a given 2
grating by spectrometer.
V Determination of the value of a low resistance by the drop of potential method 1

(by a meter-bridge).
VI To determine the internal resistance of a cell with the help of a potentiometer. 1
VII To draw the characteristics curves of semiconductor diode (p-n diode). 1
VIII To draw the input and output characteristics curves of common emitter type of 1
transistor (N-P-N).
IX Investigation of a series resonant L-C-R circuit; 1
To draw the resonance curve and to find out the Resonance Frequency (RF).
from RF, find out the values of the unknown capacitances.
X To determination of the focal length of a convex mirror with the help of an 1
auxiliary lens.
XI Revision of the Experiments and Internal Viva 1
Total 12
.
Subject: Chemistry-II Lab
Expected Weeks :12

I To estimate the hardness of a given sample of water by using a standard 1
solution of EDTA
II To estimate the total quantity of Fe++ in a given solution by using a standard 1
solution of KMnO4.
III To estimate the total quantity of Cu++ ions in a given solution by iodometric 1
method.
IV To prepare a complex compound, e.g. potassium trioxalato chromate (III). 1
V To verify Onsagers equation and also to determine the equivalent 2

conductance of a strong electrolyte (e.g KCI and HCI) at infinite dilution.
VI To verify the Beer- Lamberts law and determine ferrous ions in a given 2
solution spectrophotometrically
VII To determine the strength of a given strong acid (e.g. HCI) pH- metrically by 2
titrating against a strong base (e.g. NaOH).
VIII Revision of the Experiments and Internal Viva 2
Total 12
Subject Code : ET131214
Subject: Basic Electrical and Electronics Engineering-II Lab
Expected Weeks :12
I Open circuit characteristics (OCC) of a DC Generator. 1
II Testing of a single phase transformer 1
III Speed control of a DC shunt motor 2
a) Armature control method
b) Field control method
IV Open circuit characteristics on a three phase alternator 1
V Study of logic gates 1
VI Realization of Boolean expression 1
VII To study the operational amplifier circuit used as an inverting voltage 1
amplifier
VIII To study the output characteristics of a common emitter (CE) mode of 2
a transistor as an amplifier.
IX Demonstration on 2
a) Starting method of a three-phase induction motor and
b) Synchronous motor.
TOTAL 12
Subject: Basic Mechanical Engineering Lab
Expected Weeks :12

I Engineering Mechanics
1. Verification of Polygon Law of Forces 1
2.Verification of Parallel Law of Forces 1
3. Determination the co-efficient of friction 2
4. Moment of Inertia of Flywheel 2
5. Determination of forces in truss 2
II Demonstration
1.Boiler - mounting and accessories 1
2.I.C. Engines, Steam Engines 1
3.Governors, Gears, Belt drives, brakes, clutches 1
III Revision of the Experiments and Internal Viva 1
Total 12
Subject: Workshop for CE and ME
Expected Weeks :12

I Carpentry Shop 1
Timber, definition, engineering applications, seasoning and preservation
Plywood and ply boards
List of jobs: 1. T Lap joint 2. Bridle joint
II Foundry Shop 1
Moulding Sands, constituents and characteristics
Pattern, definition, materials types, core prints
Role of gate, runner, riser, core and chaplets
Causes and remedies of some common casting defects like blow holes,
cavities, inclusions.
List of jobs: 1. Mould of any pattern 2. Casting of any simple pattern
III Welding Shop 2

Definition of welding, brazing and soldering processes and their applications
Oxyacetylene gas welding process, equipment and techniques, types of flames
and their
applications
Manual metal arc welding technique and equipment, AC and DC welding
Electrodes: Constituents and functions of electrode coating, welding positions
Types of welded joints, common welding defects such as cracks,
undercutting, slag inclusion and boring
List of jobs:
1.Gas welding practice by students on mild steel flat
2.Lap joint by gas welding
3.MMA welding practice by students
4.Square butt joint by MMA welding
5.Lap joint by MMA welding
6. Demonstration of brazing
IV Fitting Shop : Files, materials and classification. 2
List of job:
1. Finishing of two sides of a square piece by filing.
V Smithy Shop 2
Forging, forging principle, materials
Operations like drawing, upsetting, bending and forge welding
Use of forged parts
List of job:
1Tin smithy for making mechanical joint and soldering of joint
2. To cut a square notch using hacksaw and to drill three holes on PCD and
tapping
VI Computer Engineering Shop 3
Hardware Shop
List of Jobs
1.Disassemble and assemble the PC back to working condition;
2: Install MS windows and Linux on the personal computer and
configure to dual boot the system;
3: Troubleshooting: Students to be given a PC which does not boot due
to improper assembly or defective peripherals and system software
problems. To identify the problem and fix it to get the PC back to
working condition
Software Shop
List of Jobs
4: Students to get connected to their Local Area Network and access the
Internet. In the process to configure the TCP/IP setting, access the
websites and email;
Job 5: Productivity Tools- Use Office Tools Word, Excel for creating
Scheduler, Calculating GPA, basic Power Point utilities and tools which
help to create basic Power Point Presentation as well as interactive
Presentation using Hyperlinks, Inserting Images, Clip Art, Audio,
Video, Objects, Tables and Charts.
VIII Revision of the Experiments and Internal Viva 1
Total 12

Subject: Workshop for EE,EEE,ECE,AEI, CSE,IT etc
Expected Weeks :12

I Welding Shop 2
Definition of welding, brazing and soldering processes and their applications
Oxyacetylene gas welding process, equipment and techniques, types of flames
and their
applications
Manual metal arc welding technique and equipment, AC and DC welding
Electrodes: Constituents and functions of electrode coating, welding positions
Types of welded joints, common welding defects such as cracks,
undercutting, slag inclusion and boring
List of jobs:
1.Gas welding practice by students on mild steel flat
2.Lap joint by gas welding
3.MMA welding practice by students
4.Square butt joint by MMA welding
5.Lap joint by MMA welding
6. Demonstration of brazing
II Electrical & Electronics Engineering Shop 5
List of Jobs
1. Exposure to different types of electrical accessories like types of
switches, types of lamps, wires and cables
2. Identification and use of Electrical and electronics components and
laboratory tools.
3. Soldering Practice and fabrication of D.C Power supply circuits on
General Purpose PCB/bread board.
4. Fabrication of comparator circuit/square wave generator using 555
Timer/IC 741 on general purpose PCB and bread board.
5. Importance of Neutral and structure Grounding and exposure to various
earthing schemes.
6. Exposure to different types of illumination equipments Viz. (various
lamps sodium high pressure mercury vapour lamp, CFL, LED etc
(which may include Commercial illumination schemes and a typical
illumination scheme).
7. Realization of different types of wiring systems like tube light wiring,
staircase wiring along with the protection elements like fuse, MCB,
ELCB etc.
8. Different faults in domestic appliances like automatic iron, mixture,
Oven, washing machine and repairing of the same. Application of
Tester and Test Lamp for fault finding in Electrical Systems.
9. Assembling and dissembling of D. C. Machine, single phase motor and
its meggering.
10. Assembling and dissembling of single phase transformer and its
meggering.
11. Assembling and dissembling of three phase induction motor and its
meggering.
12. Demonstration of distribution system for domestic wiring/commercial
wiring
13. Calibration of Energy meter.
14. Introduction to DOL starter with power circuit and its control circuit
15. Introduction to STAR-DELTA starter with power circuit and its control
circuit
16. Study of electric shocks and first aid treatments.
III Computer Engineering Shop 4
Hardware Shop
List of Jobs
1.Disassemble and assemble the PC back to working condition;
2: Install MS windows and Linux on the personal computer and
configure to dual boot the system;
3: Troubleshooting: Students to be given a PC which does not boot due
to improper assembly or defective peripherals and system software
problems. To identify the problem and fix it to get the PC back to
working condition
Software Shop
List of Jobs
4: Students to get connected to their Local Area Network and access the
Internet. In the process to configure the TCP/IP setting, access the
websites and email;
Job 5: Productivity Tools- Use Office Tools Word, Excel for creating
Scheduler, Calculating GPA, basic Power Point utilities and tools which
help to create basic Power Point Presentation as well as interactive
Presentation using Hyperlinks, Inserting Images, Clip Art, Audio,
Video, Objects, Tables and Charts.
IV Revision of the Experiments and Internal Viva 1
Total 12
ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY (ASTU)
Course Structure
Computer Science & Engineering
Semester III:
Sl No Sub- Code Subject Credits
Hrs
L T P C
Theory
1 4
MA131301 Mathematics III 3 2 0
2 4
MA131302 Discrete Mathematics 3 2 0
3 4
CS131303 Object Oriented Programming in C++ 3 2 0
4 4
ET131304 Digital Systems 3 2 0
5 4
CS131305 Data Structure and Algorithms 3 2 0
6 2
HS131306 Sociology 2 0 0
Practical
7 1
CS131313 Object Oriented Programming in C++ 0 0 2
8 1
ET131314 Digital Systems Lab 0 0 2
9 1
CS131315 Data Structure and Algorithms lab 0 0 2
Total 17 10 6 25
Total Working Hours = 33
Total Credits = 25
Course Title: MATHEMATICS III

Course Code: MA131301
L-T-:: C 3-2=4
Abstract:
This course of Mathematics is important for almost all the engineering disciplines. It deals
with the partial differential equations of first order and 2nd order.
Prerequisites: Concept of solution of ODE, Elementary complex numbers and properties,

Elementary probability and statistics measures of central tendency, dispersions. Basic
differentiation and integration [ HS / diploma level]
Course Outcomes:
The students will
Be able to apply the fundamental concepts of Partial differential Equations.

Get familiarised with the applications of Ordinary Differential Equations and Partial
Differential Equations.
Be able to apply different techniques of integration, including partial fractions,
integration by parts and recurrence formulae, to solve problems.
Module Topic No of Marks

hours
First order Partial differential equation: Partial
differential equation of first order, Linear partial
differential equation, Non-linear partial differential
equation, Homogenous and non-homogeneous
partial differential equation with constant co-
efficient, Cauchy type, Monges method.
1
15 30
Second order Partial differential equation: Second
order partial differential equation The vibrating
string, the wave equation and its solution, the heat
equation and its solution, Two dimensional wave
equation and its solution, Laplace equation in polar,
cylindrical and spherical coordinates, potential.
Complex Analysis: Analytic function, Cauchy-

Riemann equations, Laplace equation, Conformal
mapping, Complex integration: Line integral in the
complex plane, Cauchys integral theorem, Cauchys
2 integral formula, Derivatives of analytic functions. 15 30
Mathematical Series: Power Series, Taylors series,

Laurents series, Singularities and zeros, Residue
integration method.
Probability and statistics:
(i)Definition of probability, Laws of probability,

Bays theorem, random variables, probability
distributions and characteristics, binomial
distribution, poissons distributions and Normal
3 10 25
distribution.
(ii) elementary sampling theory, tests of hypothesis

(statistical inference), Standard error, Fudicial (
Confidence) limits, Tests of significance- Students
T-tests, Chi square tests and Z tests.
Laplace Transform
Definition of Laplace transform, Laplace transform of

elementary functions, inverse of Laplace transforms.
Properties of Laplace Transform- Linearity,
4 multiplication by tn and division by t. Laplace 15
8
Transform of derivatives and integrals. Shifting
theorems, Laplace transform of (i) periodic function
(ii) unit step function, (iii) Dirac-delta function.
Covolution theorem, Application of Laplace
transform to initial value problems.
Reference books:
1. E. Kreyszig, Advanced Engineering Mathematics:, Eighth Edition, Wiley India.

2. B.V. Ramana, Higher Engineering Mathematics, McGraw Hil Education.
3. N.P.Bali and Manish Goel, A text book of Engineering mathematics, Laxmi
Publication.
4. B. S. Grewal , Higher Engineering Mathematics, Khanna Publication, Delhi.
5. Babu Ram, Engineering Mathematics, Pearson.
SUBJECT: Discrete Mathematics

CODE: MA131302
L-T-C: 3-2--4
CLASS HOURS: 5 hrs./ Week
EXPECTED NO OF WEEKS: 9 (APPROX)
TOTAL NO OF CLASSES: 41 (APPROX)
L-Lectures, T-Tutorials, P-Practicals, C-Credits
COURSE CONTENTS:
Hours
1. MODULE I : 4
Sets, countable/uncountable sets, integers, induction
2. MODULE II: 4
Functions, relations, equivalence classes, partitions.
3. MODULE III : 9
Propositional logic, Boolean algebra
4. MODULE IV : 9
Abstract Algebra Basics of groups, rings, finite fields, vector spaces.
5. MODULE V : 6
Combinatorics Counting principles, recurrence equations, generating
functions.
6. MODULE VI :
Probability Theory Sample space, events, expectations, variance, distribution, 9
random variables, binomial, poisson and geometric random variables
TEXT BOOKS:
1. Discrete Mathematical Structures with Applications to Computer Science, by J.P. Tremblay and R.
Monohar.
2. Discrete Mathematics and Its Applications, by Kenneth H. Rosen, Tata McGraw Hill, 6th
edition, ISBN: 0072880082 2007
3. Elements of Discrete Mathematics, by C. L. Liu, Tata McGraw Hill Education Private
Limited, 3rd edition,2008
SUBJECT: Object Oriented Computer Programming in C++

CODE: CS131303
L-T-C: 3-2-4
L-Lectures, T-Tutorials, C-Credits
OBJECTIVES:
1. Acquire an understanding of basic object-oriented concepts and the

issues involved in effective class design.
2. Write C++ programs that use: object-oriented concepts such as
information hiding, constructors, destructors, inheritance
PREREQUISITE:
1. Introduction to Computer Programming (CS131105)
FOR TEACHERS: Hours
COURSE CONTENTS:
7. MODULE I : INTRODUCTION
(a) What is Object Oriented Programming? Why we need Object Oriented 2
Programming? Programming characteristics of OOP. Difference between
OOP and procedure oriented programming;
(b) Basic Concepts of OOPs, feature of OOPs, Application of OOPs, and 5
.Review of Data Types (user define and derived data types), Keywords,
Tokens, Identifies, Constants, Reference variables, different Operators and
Control statements
8. MODULE II: CLASSES AND OBJECTS

(a) Introduction to Objects and classes, Difference between Class and 2
Structure, Class definition and syntax, Defining member functions, Access
control to other functions(Private, Public, Protected)
(b) Objects-Dynamic Creation and initialization, Passing and Returning objects, 2
Object assignment and array of objects,;
(c) Constructors-Types, Destructors, Nesting member function, Private member 2
function , Inline functions,
(d) Static class members, Function prototyping, Call by reference, Return by 2
reference, Default Argument, Friend functions, this pointer.
9. MODULE III : INHERITANCE

(a) Types of Inheritance; Base and Derived classes Syntax of derived classes, 2
access to the base class; Types of Inheritance,
(b) Multiple inheritance Virtual Base classes, Constructors and Destructors in 3
Inheritance,
(c) Container classes, Abstract Classes. 1
10. MODULE IV : POLYMORPHISM

a) Compile time(Early/Static binding)-Overloading functions and operators, 2
Overloading new and delete operators;
b) Run time polymorphism(Late/Dynamic Binding) Virtual functions, Pure 3
Virtual functions, Virtual Destructors,
c) Review of Virtual base classes, 1
11. MODULE V : TEMPLATES

Templates Uses, Generic classes, Class templates, Function templates, Advance 2
templates. Examples
12. MODULE VI : EXCEPTION HANDLING AND MANIPULATORS
(a) Exception handling Advantages, Try catch and throw clauses, Examples, 2
(b) Manipulators, different examples of manipulators; 2
13. MODULE VII: POINTERS AND FILES

a) Pointer types- uses; Dynamic memory allocation techniques - garbage 3
collection, Linked list, generic pointers;
b) Files- Open, Close, Read and Write; File attributes, File management 3
TEXT/ REFERENCE BOOKS:
1. E. BALAGURUSWAMY: OBJECT ORIENTED PROGRAMMING WITH C++ , Tata

McGraw Hill.
2. HERBERT SCHILDT: C++, THE COMPLETE REFERENCE
3. BARKATAKI : OBJECT ORIENTED PROGRAMMING, PHI
REFERENCES:
1. DEITAL AND DEITAL : C++ HOW TO PROGRAM
2. OREILY: Head First C#:
3. R. LAFORE : OBJECT ORIENTED PROGRAMMING IN TURBO C++,
GALGOTIA, NEW DELHI
4. P.B. MAHAPATRA : THINKING IN C- INCLUDING OBJECT ORIENTED
PROGRAMMING WITH C++ , WHEELER PUBLISHING
SUBJECT: DIGITAL SYSTEMS

CODE: ET131304
L-T--C: 3-2-4
CLASS HOURS 5 hrs./ Week
PREREQUISITES:
I. Basic Electrical & Electronics Engineering-I(EE131104)
II. Basic Electrical & Electronics Engineering-II(ET131204)
OBJECTIVES:
Understanding of Simplification of boolean
expression and how to implement with various
gates.
Concepts of Combinational and Sequential
Circuits design.
Knowledge on digital logic families.
FOR TEACHERS:
COURSE CONTENTS:
Hours Max
Marks
14. MODULE I : Fundamental Of Digital Electronics 8 20
Review of number system; Position number system decimal,

binary, octal and hexadecimal, number base conversion
.Representation of negative binary numbers. Codes BCD Gray ,
Excess -3
Digital signal , logic gates : AND, OR, NOT, NOR, EX-OR, EX-NOR
15. MODULE II : Boolean algebra and its simplification 12 20
Axioms and basic theorem of Boolean algebra. Truth table , logic

function and their realization , standard representation (canonical
forms) of logic gates.-SOP and POS forms, MIN terms and MAX
terms
Simplification of logic function: K-map of 2, 3, 4 and 5 variables.

Simplification of algebra and by map method. Dont care condition.
Quine Mcluskey methods of simplification.
Synthesis using AND, OR and INVERT and then to convert to NAND

or NOR implementation
16. MODULE III : Combinational logic circuit design 8 20

Combinational logic circuit and buildings blocks. Binary adders and
subs tractors. Carry look ahead addrer. Encoders, Decoders ,
Multiplexers , Demultiplexers , Comparators, parity generators,
etc. Realization of logic gates functions through decoders and
multiplexers.
17. MODULE IV: Sequential circuits 12 30

Flip flops: truth table and state table SR, JK, TD, race around
condition, master slave conversion of flip-flops.
Sequential shift register, sequence generator.
Counter s: asynchronous and d Synchronous generators. Ring

counter s and Johnson counter, up. Down counter modulo N
counter. Design of Synchronous sequential circuit.
18. MODULE V: Digital logic families and programmable logic 8 10

devices.
Switching mode operation of PN junction , Bipolar and MOD
device Bipolar families: RTL,DTL,DCTL,HTL,TTL,ECL,MOS, and CMOS
logic families, Tristate logic.
Gate properties fan in, fan out, propagation delay and power delay
product.
RAM and ROM their uses, SSI, MSI LSI and V LSI devices.
Introduction to PLA, PAL TO FPGA and CPLDS, Some commonly
used digital ICs
M. Morris Mano Digital Design. Prentice Hall of India
P. Malvino an4 D. K. Leach Digital Principles and Applications. TataMcGraw-Hill.
M. Morris Mano Digital Logic and Computer Design. Prentice Hall of India.
SUBJECT: Data Structure and Algorithm

CODE: CS131305
L-T-C: 3-2-4
PREREQUISITES:
I. Introduction to Computing(CS131105),
II. Mathematics-I(MA131101), Mathematics-II(MA131201),
OBJECTIVES:
Understanding the data structures, their advantages and
drawbacks, how to implement them in C & how they can be
overcome.
Understanding their applications and their uses.
Students will learn about the data structure methods or
algorithms mentioned in the course so as to make use of
them in a program to enhance their efficiency (i.e. reduce
the run-time) or for better memory utilization.
FOR TEACHERS:
COURSE CONTENTS:
Hours Max
Marks
19. MODULE I : LINEAR DATA STRUCTURE- I
a. Introduction: 8 30
Why we need data structure?
Concepts of data structures: Data and data structure, Abstract

Data Type and Data Type.
Algorithms and programs, basic idea of pseudo-code.
Algorithm efficiency and analysis, time and space analysis of

algorithms order notations.
b. Array: 2 20
Different representations row major, column major.
Sparse matrix - its implementation and usage. Array

representation of polynomials.
c) Linked List: 4 20
Singly linked list, circular linked list, doubly linked list, linked list
representation of polynomial and applications.
20. MODULE II : LINEAR DATA STRUCTURE- II

a) Stack and Queue: 5 20
Stack and its implementations (using array, using linked list),
applications.
Queue, circular queue, dequeue. Implementation of queue- both

linear and circular (using array, using linked list), applications.
b) Recursion: 2 10
Principles of recursion use of stack, differences between
recursion and iteration, tail recursion.
Applications - The Tower of Hanoi, Eight Queens Puzzle.
21. MODULE III : NONLINEAR DATA STRUCTURES

a) Trees: 9 30
Basic terminologies, forest, tree representation (using array, using
linked list).
Binary trees - binary tree traversal (pre-, in-, post- order), threaded
binary tree (left, right, full) - non-recursive traversal algorithms
using threaded binary tree, expression tree.
Binary search tree- operations (creation, insertion, deletion,

searching).
Height balanced binary tree AVL tree (insertion, deletion with

examples only).
B- Trees operations (insertion, deletion with examples only).
b) Graphs: 6 20
Graph definitions and concepts (directed/undirected graph,
weighted/un-weighted edges, sub-graph, degree, cut-
vertex/articulation point, pendant node, clique, complete graph,
connected components strongly connected component, weakly
connected component, path, shortest path, isomorphism).
Graph representations/storage implementations adjacency

matrix, adjacency list, adjacency multi-list.
Graph traversal and connectivity Depth-first search (DFS),

Breadth-first search (BFS) concepts of edges used in DFS and BFS
(tree-edge, back-edge, cross-edge, forward-edge), applications.
Minimal spanning tree Prims algorithm (basic idea of greedy

methods).
22. MODULE IV: SEARCHING, SORTING

a) Sorting Algorithms: 6 10
Bubble sort and its optimizations, insertion sort, shell sort,
selection sort, merge sort, quick sort, heap sort (concept of max
heap, application priority queue), radix sort.
b) Searching: 4 10
Sequential search, binary search, interpolation search.
1. Data Structures And Program Design In C, 2/E by Robert L. Kruse, Bruce P. Leung.
2. Fundamentals of Data Structures of C by Ellis Horowitz, Sartaj Sahni, Susan
Anderson-freed.
3. Data Structures in C by Aaron M. Tenenbaum.
4. Data Structures by S. Lipschutz.
5. Data Structures Using C by Reema Thareja.
6. Data Structure Using C, 2/e by A.K. Rath, A. K. Jagadev.
7. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L.
Rivest, Clifford Stein.
L=2
HS131306 SOCIOLOGY T=0
C=2
Sociology in the Industrial Perspective: Concept of sociology/ Sociology as a
Module-I science?/ Sociology of work and industry/ Perspectives for sociological 12 Hours
analysis of work/ Class conflict in industry/ Social impact of industrialization
Work and Social Change: Nature of modern societies/ Emergence of industrial
capitalism/ Technology and social change/ The information society after the
Module-II 12 Hours
industrial society/ Postmodernity/ Globalization and convergence/ Significance
of the service sector today/ Work restructuring and corporate management
Work Experiences in Industry: The concept of alienation/ Work satisfaction/
Technology and work experience/ Social background of workers/ Work
Module-III 12 Hours
orientations/ Stress and anxiety of the worker/ Work and leisure/
Unemployment/ Conflicts in the workplace
Total 36 Hours
Reference Books
1. Miller and Form, Industrial Sociology (London: Harper & Row, 1968)
2. N. R. Sheth, Social Framework of Indian Factory (Bombay: Oxford University Press, 1968)
3. Gisbert, Fundamentals of Industrial Sociology (New Delhi: Oxford University Press, 1971)
4. P. Gisbert, Fundamentals of Industrial Sociology (New Delhi: Oxford University Press, 1971)
5. Tony J. Watson, Sociology, Work and Industry (New York: Routledge, 2004 reprint)
SUBJECT: Object Oriented Computer Programming in C++ Lab

CODE: CS131313
L-T-P-C: 0-0-2-1
OBJECTIVES:
1. To make the student to learn C++ programming language.
2. To teach the student the implementation of object oriented programming features.
3. To teach the student to write programs in C++ to solve the problems
PREREQUISITE:
1. Introduction to Computer Programming (CS131105)
2. Object Oriented computer Programming in C++ (CS131303)
LIST OF PROGRAMS:
Topics should include but not limited to:

23. MODULE I : INTRODUCTION
[1] Write a C++ program to display HELLO WORLD.
[2] Write a C++ program that will ask the temperature in Fahrenheit and
display in Celsius
[3] Write a C++ program to print the following output using for loop.
[8 programs
1 form this
module]
22
333
4444
[4] Write a C++ program to reverse a number using do-while loop
[5] Write a C++ program to find out the factorial of a number using while
loop
[6] Write a C++ program to read an integer array and display it.
[7] Write a C++ program to read a character array and display it.
[8] Write a C++ program to find out the maximum of three number using if-
else statement
24. MODULE II: CLASSES AND OBJECTS

(e) Write a C++ program to implement the concept of static data member [8 programs
form this
in class.
module]
(f) Write a C++ program to implement the concept of static function in
class.
(g) Write a C++ program using function with default argument.
(h) Write a C++ program to illustrate the use of objects as function
arguments (which performs the addition of time in the hour and minutes
format)
(i) Write a C++ program to illustrate the use of friend function.
(j) Write a C++ program to illustrate how an object can be created (within
a function) and returned to another function
(k) Write a C++ program to illustrate the use of constructors and
destructors.
(l) Write a C++ program to illustrate the use of copy constructor.
25. MODULE III : INHERITANCE

[1] Write a C++ program to implement single inheritance (private/public)
[2] Write a C++ program to implement multilevel inheritance
[3] Write a C++ program to implement multiple inheritances. [4 programs
form this
[4] Write a C++ program to illustrate the use of virtual base class.
module]
26. MODULE IV : POLYMORPHISM

[1] Write a C++ program to overload unary minus operator
[2] Write a C++ program to overload binary + operator [4 programs
[3] Write a C++ program to illustrate how an operator can be overloaded form this
using friend function. module]
[4] Write a C++ program to illustrate the use of run time polymorphism.
27. MODULE V : TEMPLATES

[1 programs
form this
[1] Write a C++ program to swap two variable using function template
module]
28. MODULE VI : EXCEPTION HANDLING AND MANIPULATORS

[1 programs
[1] Write a C++ program to implement try(), catch(), throw() function. form this
module]
29. MODULE VII: POINTERS AND FILES

[2] Write a C++ program to implement this pointer
[6 programs
[3] Write a C++ program to illustrate the use of pointers to derived objects
form this
[4] Write a C++ program to illustrate the use of virtual function module]
[5] Write a C++ program to open and close a file using open(), close()
function
[6] Write a C++ program to illustrate the use of read(), write() function
4. E. BALAGURUSWAMY: OBJECT ORIENTED PROGRAMMING WITH C++ , Tata

McGraw Hill.
5. HERBERT SCHILDT: C++, THE COMPLETE REFERENCE
6. BARKATAKI : OBJECT ORIENTED PROGRAMMING, PHI
REFERENCES:
5. DEITAL AND DEITAL : C++ HOW TO PROGRAM
6. R. LAFORE : OBJECT ORIENTED PROGRAMMING IN TURBO C++,
GALGOTIA, NEW DELHI
7. P.B. MAHAPATRA : THINKING IN C- INCLUDING OBJECT ORIENTED
PROGRAMMING WITH C++ , WHEELER PUBLISHING
SUBJECT: Digital Systems Lab

CODE: ET131314
L-T-P-C: 0-0-2-1
EXPECTED NO OF WEEKS: 12(APPROX)
PREREQUISITES:
OBJECTIVES:
FOR TEACHERS:
COURSE CONTENTS:
Experiments should include but not limited to :
1. To study the TTL and CMOS families of Digital Integrated

Circuits.
2. To implement a simple Boolean expression on TTL/CMOS Small
Scale Integrated Circuit (SSI) Devices.
3. To implement Half adder & Full adder.
4. To study Parallel Binary adder.
5. To study a BCD to 7 Segment LED display decoder as an
example of a multiple input and multiple output
combinational digital circuit.
6. To study the IC 741 & implement a function using IC 74151
7. To study the J-K,D and T flip flops.
8. To study a simple two-bit ripple counter.
SUBJECT: Data Structure and Algorithm Lab

CODE: CS131315
L-T-P-C: 0-0-2-1
EXPECTED NO OF WEEKS: 12(APPROX)
PREREQUISITES:
III. Introduction to Computing(CS131105),

IV. Mathematics-I(MA131101), Mathematics-II(MA131201),
OBJECTIVES:
Understanding the data structures, their advantages and
drawbacks, how to implement them in C & how they can be
overcome.
Understanding their applications and their uses.
Students will learn about the data structure methods or
algorithms mentioned in the course so as to make use of
them in a program to enhance their efficiency (i.e. reduce
the run-time) or for better memory utilization.
FOR TEACHERS:
COURSE CONTENTS:
Experiments should include but not limited to :
9. Implementation of array operations.

10. Stacks and Queues: adding, deleting elements Circular Queue:
Adding & deleting elements Merging Problem.
11. Evaluation of expressions operations on Multiple stacks &
queues.
12. Implementation of linked lists: inserting, deleting, and
inverting a linked list. Implementation of stacks & queues using
linked lists
13. Polynomial addition, Polynomial multiplication.
14. Sparse Matrices : Multiplication, addition.
15. Recursive and Nonrecursive traversal of Trees.
16. Threaded binary tree traversal. AVL tree implementation.
17. Application of Trees. Application of sorting and searching
algorithms.
8. Data Structures And Program Design In C, 2/E by Robert L. Kruse, Bruce P. Leung.
9. Fundamentals of Data Structures of C by Ellis Horowitz, Sartaj Sahni, Susan
Anderson-freed.
10. Data Structures in C by Aaron M. Tenenbaum.
11. Data Structures by S. Lipschutz.
12. Data Structures Using C by Reema Thareja.
13. Data Structure Using C, 2/e by A.K. Rath, A. K. Jagadev.
14. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L.
Rivest, Clifford Stein.
*********
Guwahati

COMPUTER SCIENCE AND ENGINEERING (CSE)
Semester IV / CSE / B.TECH
Subject Hrs/week Credit

Sl.
Subject
No.
Code L T P C
Theory
1 MA131401 Numerical Methods and Computation 3 2 0 4
2 3
CS131402 Basic Graph theory 3 0 0
3 3
CS131403 Operating Systems 3 0 0
4 CS131404 Computer Organization and 3 2 0 4
Architecture
5 CS131405 Principles of Programming Language 3 2 0 4
6 4
HS131406 Economics and Accountancy 4 0 0
Practical
7 MA131411 Numerical Methods and Computation 0 0 2 1
Lab
8 CS131413 Operating Systems Lab 0 0 2 1

9 CS131415 Principles of Programming Language 0 0 2 1
Lab
TOTAL 19 6 6 25
Total Contact Hours : 31
Total Credits : 25
Course Title : NUMERICAL METHODS AND COMPUTATION
Course Code: MA131401 ClassHours/week 4
L-T:: C 3-2 =4 Expected weeks 12
Total hrs. of 36+12
classes =48
MODULE TOPIC COURSE CONTENT HOURS
1 Approximation in Truncation and rounding errors, fixed and 4

numerical computation floating point arithmetic, Propagation of
errors.
2 Interpolation Newton forward/backward interpolation, 12
Lagranges and Newtons divided
difference Interpolation
3 Numerical Integration Trapezoidal rule, Simpsons 1/3 rule, 8

Simpsons 3/8 rule. Expression for
corresponding error terms.
4 Numerical solution of Gauss elimination method, matrix 7

linear equations inversion, LU factorization method,
Gauss-Seidel iterative method.
5 Numerical solution of Bisection method, Regula-Falsi method, 7

Algebraic and Newton-Raphson method.
transcendental
equation
6 Numerical solution of Eulers method, Runge-Kutta methods, 10
Ordinary differential Predictor-Corrector methods and Finite
equation Difference method.
TOTAL 48
REFERENCE BOOKS:
1. Numerical Methods, SukhenduDey, Shishir Gupta, McGraw Hill Education (India) private
Limited
2. Numerical Algorithms. E. V. Krishnamurthy, S. K. Sen. Affilated East-West Press
3. Computer Programming & Numerical Analysis by N Dutta, University Press.
4. Numerical Methods. E. Balagurusamy, Tata McGraw - Hill Education (1999)
5. Numerical & Statistical Methods With Programming in c by SujathaSinha
6. Numerical Methods In Eng. & Science, Dr. B. S. Grewal, Khpub publication
7. Numerical Methods for Scientific and Engineering Computation by R. K. Iyengar,
New Age International
8. Numerical Mathematical Analysis by J. B. Scarborough, Oxford
Course Title : BASIC GRAPH THEORY ClassHours/week 3
Course Code: CS131402 Expected weeks 12
L-T:: C 3-0 =3 Total hrs. of 36
classes

1 Graph incidence and (a) Definition of Graph, Application of 2
degree Graphs Finite and Infinite graphs
(b) Incidence and degree of a graph,
Isolated Vertex, Pendent Vertex, Null
Graph.
2 Paths and circuits (a) Isomorphism; Sub graphs and Union 7
of Graphs, walks, Paths and Circuits,
(b) Connected Graphs, disconnected
graphs and components,
(c) Eulerian graph, Chinese postman
problem, Konigsberg Bridge Problem,
(d) Operations on Graphs, Arbitrarily
traceable graphs, Fleurys algorithms,
(e) Hamilton graph-necessary and
sufficient conditions, Complete
Graph, Traveling salesman, bipartite
graph.
3 Tree (a) Definition of tree, Properties of tree, 5
Pedant vertices in a tree; Center of a
tree
(b) Rooted binary trees, On counting
trees, Fundamental circuits;
(c) Spanning trees, Spanning algorithms
Spanning trees of a weighted graph,
algorithms for shortest Spanning tree.
4 Cut-sets and cut- (a) Cut-sets and cut-vertices; Some 4
vertices properties of Cut-Set, Fundamental
Circuits and cut-sets
(b) Connectivity and separativity and
different theorems;
(c) Network flow, max-flow min-cut
theorem, 1-isomorphism and 2-
isomorphism.
5 Planner graph (a) Combinatorial and geometric graphs, 4
planar graphs, Geometric and
Combinatorial dual;
(b) Kuratowski graph; detection of
planarity; Thickness and crossings.
6 Matrix representation Incidence; Adjacency; Circuit, Cut- 2

of graph Set, Path matrices and their properties.
7 Coloring, covering and (a) Chromatic number; Chromatic 4
partitioning Partitioning, Chromatic polynomial,
Coverings, minimization of Switching
Functions.
(b) Four Color theorem, five color
theorems
8 Directed graph (a) Digraphs, different types of digraphs, 4
Binary relations,
(b) Directed graphs and connectedness,
Euler Digraph,
(c) Tree with directed graph,
Arborescence an Polish method
9 Enumeration of (a) Types of Enumerations, Counting 4
graphs labeled an Unlabelled trees
(b) Counting Methods, Polay Counting
Theory.
TOTAL 36
1. Narasingh Deo: Graph Theory with applications to Engineering and Computer Science,
Phi Publications.
2. Franck Harary: Graph Theory, Phi (EEE).
ClassHours/week 3
Course Title : OPERATING SYSTEMS
Expected weeks 12
Course Code: CS131403 Total hrs. of 36
L-T:: C 3-0 =3 classes

1 Introduction to OS Operating system functions, evaluation of 3
O.S., Different types of O.S.: batch,
multi-programmed, time-sharing, real-
time, distributed, parallel. Operating
system structure (simple, layered, virtual
machine), O/S services, system calls.
2 Processes & Threads Concept of processes, process scheduling, 3

operations on processes, co-operating
processes, inter-process communication.
Overview of threads, benefits of threads,
user and kernel threads.
3 CPU scheduling Scheduling criteria, preemptive & non- 4
preemptive scheduling, scheduling
algorithms (FCFS, SJF, RR, and priority),
algorithm evaluation, multi-level queue
scheduling and multilevel feedback queue
scheduling.
4 Process Data Access and control synchronization, 4
Synchronization critical section problem, critical region,
Race conditions in process
synchronization , classical problems of
synchronization,semaphores, Interprocess
communication through message passing
mechanism.
5 Deadlocks System model, deadlock characterization, 3
methods for handling deadlocks, deadlock
prevention, deadlock avoidance, deadlock
detection, recovery from deadlock.
6 Memory Management Background, logical vs. physical address 3
space, swapping, contiguous memory
allocation, paging, segmentation,
segmentation with paging
7 Virtual Memory Background, demand paging, 3
performance, page replacement, page
replacement algorithms (FCFS, LRU),
allocation of frames, thrashing.
8 File Systems File concept, access methods, directory 4
Management structure, file system structure, allocation
methods (contiguous, linked, indexed),
free-space management (bit vector, linked
list, grouping), directory implementation
(linear list, hash table), efficiency &
performance.
9 I/O Management I/O hardware, polling, interrupts, DMA, 3
application I/O interface (block and
character devices, network devices,
clocks and timers, blocking and
nonblocking I/O), kernel I/O subsystem
(scheduling, buffering, caching, spooling
and device reservation, error handling),
performance.
10 Disk Management Disk structure, disk scheduling (FCFS, 3
SSTF, SCAN, C-SCAN), disk reliability,
disk formatting, boot block, bad blocks.
11 Protection & Security Goals of protection, domain of protection, 3
security problem, authentication, one time
password, program threats, system
threats, threat monitoring, encryption.
TOTAL 36
1. Milenkovie M., Operating System: Concept & Design, McGraw Hill.

2. Tanenbaum A.S., Operating System Design & Implementation, Practice Hall NJ.
3. Silbersehatz A. and Peterson J. L., Operating System Concepts, Wiley.
4. Dhamdhere: Operating System TMH
5. Stalling, William, Operating Systems, Maxwell McMillan International Editions, 1992.
6. Dietel H. N., An Introduction to Operating Systems, Addison Wesley.
7. M. J. Bach - The Design of the UNIX Operating System, Prentice Hall of India, 1994.
Course Title : COMPUTER ORGANIZATION AND ARCHITECTURE
Course Code: CS131404 ClassHours/week 4
Total hrs. of 36+12
classes =48

1 Basic organization of Block level description of the functional 7
computers units as related to the execution of a
program; Fetch, decode and execute
cycle.
2 Machine instructions Instruction set architectures, Assembly 9
language programming, addressing
modes, instruction cycles, registers and
storage, addressing modes; discussions
about RISC versus CISC architectures;
Inside a CPU.
3 Information Floating point representation (IEEE 754), 10
representation computer arithmetic and their
implementation; Fixed-Point Arithmetic:
Addition, Subtraction, Multiplication and
Division, Arithmetic Logic Units control
and data path, data path components,
design of ALU and data path, controller
design; Hardwired and Microprogrammed
Control.
4 Memory Technology Static and dynamic memory, Random 8
Access and Serial Access Memories,
Cache memory and Memory Hierarchy,
Address Mapping, Cache updation
schemes, Virtual memory and memory
management unit.
5 I/O subsystems Input-Output devices such as Disk, CD- 8
ROM, Printer etc.; Interfacing with IO
devices, keyboard and display interfaces;
Basic concepts Bus Control, Read Write
operations, Programmed IO, Concept of
handshaking, Polled and Interrupt-driven
I/O, DMA data transfer.
6 Pipeline Processing Instruction and Arithmetic Pipeline, 6
Pipeline hazards and their resolution,
Parallel Processing.
TOTAL 48
1. John P Hayes - Computer Architecture & Organization, Mc Graw Hill Book Company.
2. M. Mano - Computer System Architecture, Prentice-Hall of lndia.

Course Title : PRINCIPLES OF PROGRAMMING LANGUAGE
Course Code: CS131405 ClassHours/week 4
Total hrs. of 36+12
classes =48

1 Introduction Introduction to various programming 8
paradigms and their implementation issues.
Characteristics of programming Languages,
Factors influencing the evolution of
programming language, Development in
programming methodologies, desirable
features and design issues. Introduction to
mathematical foundations and semantics of
programming languages.
2 Programming Structure and operations of translators, 6

language software simulated computer, syntax,
processors semantics, structure, virtual computers,
binding and binding time.
3 Data types and Properties of types and objects elementary 6

abstraction data types structured data types, Abstract
data types encapsulation by subprograms
type definition storage management.
4 Sequence control Implicit and explicit sequence control 6

sequencing with arithmetic and non-
arithmetic expressions sequence control
between statements, Subprogram sequence
control attributes of data control shared
data in.
5 Imperative Block structure, scoping rules, parameter 4

programming passing etc. in languages like C, PASCAL
and FORTRAN.
6 Object oriented Abstraction, hiding, objects, classes, 6

programming inheritance etc. in languages like C++ and
Modular JAVA.
7 Functional Functions, Recursion, types, polymorphism, 4

programming storage allocation in languages like LISP, ML
Scheme.
8 Logic Horn clauses, SLD resolution etc. in 4
programming languages like PROLOG.
9 Concurrent Expressing parallelism, communication, 4
programming synchronization etc. in languages like Ada,
CSP and Linda.
TOTAL 48
TEXT BOOKS:
1. Terrance W. Pratt, And Marvin V. Zelkowitz, Programming Languages, Design

And Implementation, Prentice-Hall Of India.
REFERENCES:
1. Ravi Sethi, Programming Languages Concepts And Constructs, Addison-
Wesley.
2. Allen B. Tucker, Robert Noonan, Programming Languages: Principles And
Paradigms, Tata Mcgraw-Hill.
3. E. Horowitz, Fundamentals Of Programming Languages, Galgotia Publishers.
4. A.B. Tucker, Robert, Noonan, Programming Languages, Mcgraw-Hill.
Robert W. Sebesta, Concepts Of Programming Languages, Addison Wesley.
Course Title : ECONOMICS AND ACCOUNTANCY ClassHours/week 4
Course Code: HS131406 Expected weeks 12
L-T ::C 4-0 = 4 Total hrs. of 48
classes
1 Introduction to i) Nature and Scope of Economics 4

Economics
ii) Concepts of micro and macro
economics, economic good and free
good.
2 Demand and Supply i) Law of Demand and determinants of

Analysis demand.
ii) Categories and Types of Elasticity

of Demand- price elasticity, income
elasticity, cross elasticity. 8
iii) The determinants of elasticity,
Demand elasticity and Revenue.
iv) Law of Supply and Elasticity of

Supply.
3 The Theory of i) Iso-quant and Iso-cost line. 8

Production and Cost
ii) Law of Return to Scale and Law of
Variable Proportion.
iii) Types of Cost total, average and

marginal cost, fixed cost & variable
cost, long run and short run cost,
private & social cost, economists cost
& accountants cost, opportunity cost.
4 Market i) Features of perfect competition and

monopoly.
5
ii)Price-Output determination under--
perfect competition, simple problems
of perfect competition.
5 Concepts of Accountancy Various concepts like Journal, ledger 8

and preparation of trial balance.
6 Preparation of Final Trading Account, Profit and Loss
Account account, Balance Sheet.
8
7 Depreciation Depreciation Policy, Causes of 4

Depreciation, straight line method.
8 Cash Book Single, Double and Triple Column.

3
TOTAL 48
REFERENCE BOOKS:
1. Managerial Economics by Yogesh Maheswary, PHI Learning.
2. Mankiw Gregory N.(2002), Principles of Economics, Thompson Asia.
3. Misra, S.K. and Puri (2009), Indian Economy, Himalaya.
4. Engineering Economics by Dr. Afajuddin Ahmed, G Begum, Chandra Prakash.
5. Book Keeping and Accountancy, K.R. Das, Lawyers Books Stall.

PRACTICALS
NUMERICAL METHODS AND COMPUTATION LAB
SUBJECT NUMERICAL METHODS AND COMPUTATION LAB

CODE MA131411
L-T-P-C 0-0-2-1
CLASS HOUR 3hrs/week
TOTAL NO. OF CLASS 5 (APPROX)
EXPECTED NO. OF 5 (APPROX)
WEEKS
EXPERIMENT TITLE OF THE EXPERIMENT HOURS

NO.
1 Write a C program to solve algebraic equations by using 3
Method of Bisection.

Method of False position.

Newton Raphson Method.
4 Write a C program to solve linear system of equations by 3

using Gauss Jordan Method.
5 Write a C program to solve linear system of equations by 3

using Gauss Seidal Method.
TOTAL 15
Course Title: OPERATING SYSTEMS LAB
Course Code: CS131413
L-T-P:: C 0-0-2:: 1

NO.
1 Shell programming: creating a script, making a script 3
executable, shell syntax (variables, conditions, control
structures, functions, commands).
2 Process: starting new process, replacing a process image, 3

duplicating a process image, waiting for a process, zombie
process.
3 Signal: signal handling, sending signals, signal interface, 3
signal sets.
4 Semaphore : programming with semaphores (use functions 3

semctl, semget, semop, set_semvalue, del_semvalue,
semaphore_p, semaphore_v).
5 POSIX Threads: programming with pthread functions(viz. 3

pthread_create, pthread_join, pthread_exit, pthread_attr_init,
pthread_cancel)
6 Inter-process communication : pipes (use functions pipe, 3

popen, pclose), named pipes(FIFOs, accessing FIFO)
TOTAL 18
Course Title: PRINCIPLES OF PROGRAMMING LANGUAGE LAB
L-T-P:: C 0-0-2:: 1

NO.
1 Write a C program to read and integer array and display the 1
maximum element.
2 Write a C program to reverse the content of an array data 1

structure.
3 Write a C program to swap two elements using function 1
4 Write a C program to add two matrices using function 1
5 Write a C program to illustrate the type conversion function. 1
6 Write a C program to demonstrate the use of structure data 1

type.
7 Write a C++ program to illustrate the use of function 1
overloading
8 Write a C++ program to illustrate the use of operator 1

Overloading
9 Write a C++ program to illustrate the use inline function 1
10 Write a C++ program to illustrate the use of virtual base 1

class.
11 Write a C++ program to illustrate the use of single 1

inheritance (Public/Private)
12 Write a C++ program to illustrate the use of file open() and 1

close() operation
13 Write a Java Program to add two numbers and display the 1

result
14 Write a Java program to reverse a number. 1
15 Write a Java program to find out whether a number is 1

Fibonacci or not.
16 Write a Java program to find out the factorial of a number. 1

17 Write a program to display a list using functional 1
programming (LISP/ML)
18 Write a program to calculate the factorial of a given number 1

using functional programming
19 Write a program to print hello world using functional 1

programming.
20 Write a program to add two numbers and display the sum 1

and average using functional programming.
21 Write a program to illustrate the use of make date() data 1

structure using PROLOG
22 Write a program to illustrate the use of list() data structure 1

using PROLOG
23 Write a program to illustrate the use of PROLOG logical 1

statement.
TOTAL 23
*******
Guwahati
Computer Science and Engineering (CSE)
Semester V/ CSE/ B.TECH
Sl. Subject Hrs/week Credits

Subject
No. Code
L T P C
Theory
1 MA131501 Probability and Random process 3 2 0 4
2 CS131502 Formal Language and Automata Theory 3 2 0 4
3 CS131503 Computer Graphics 3 2 0 4
4 CS131504 Database Management Systems 3 2 0 4
5 EE131505 Microprocessor and Microcontroller 3 2 0 4
6 HS131506 Principles of Management 2 0 0 2
Practical
7 CS131513 Computer Graphics Lab 0 0 2 1
8 CS131514 Database Management Systems Lab 0 0 2 1
9 EE131515 Microprocessor and Microcontroller Lab 0 0 2 1
Total 17 10 6 25
Total Contact Hours: 33
Total Credits : 25
ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY Page 1

Course Title : PROBABILITY AND RANDOM PROCESS Class Hours/week 4
Course Code: MA131501 Expected weeks 12
Total hrs. of 36+12
L-T-P-C: 3-2-0-4
classes = 48
Sets and set operations; Probability space;

1 INTRODUCTION 8
Conditional probability and Bayes theorem.
Probability mass function, probability distribution
function, example random variables and
DISCRETE
distributions; Continuous random variables,
2 RANDOM 10
VARIABLES
probability density function, probability distribution
function, example distributions.
Functions of one and two random variables, moments

of random variables; Conditional distribution,
JOINT densities and moments; Characteristic functions of a
3 10
DISTRIBUTIONS random variable; Markov, Chebyshev and Chernoff
bounds.
RANDOM
SEQUENCES AND Limit theorems; Strong and weak laws of large
4 10
MODES OF numbers, central limit theorem.
CONVERGENCE
RANDOM Mean and covariance functions. Ergodicity.
PROCESS AND Transmission of random process through LTI. Power
5 STATIONARY spectral density. 10
PROCESSES
TOTAL 48
1. H. Stark and J. Woods, ``Probability and Random Processes with Applications to Signal
Processing,'' Third Edition, Pearson Education
2. A. Papoulis and S. Unnikrishnan Pillai, ``Probability, Random Variables and Stochastic Processes,''
Fourth Edition, McGraw Hill.
3. K. L. Chung, Introduction to Probability Theory with Stochastic Processes, Springer International,
4. P. G. Hoel, S. C. Port and C. J. Stone, Introduction to Probability, UBS Publishers,
5. P. G. Hoel, S. C. Port and C. J. Stone, Introduction to Stochastic Processes, UBS Publishers
6. S. Ross, Introduction to Stochastic Models, Harcourt Asia, Academic Press.

Course Title : FORMAL LANGUAGE AND AUTOMATA
Class Hours/week 4
THEORY
Expected weeks 12
Course Code: CS131502 Total hrs. of 36+12
L-T-P-C: 3-2-0-4 classes = 48

STRINGS AND
1 ALPHABETS
Basics of Strings and Alphabets 6
DFA, transition graphs, regular languages, non-
FINITE
2 AUTOMATA
deterministic FA, equivalence of DFA and 8
NDFA
Regular grammars, regular expressions,
GRAMMAR AND
3 LANGUAGES
equivalence between regular languages, 8
properties of regular languages, pumping lemma.
Leftmost and rightmost derivation, parsing and
CONTEXT FREE
4 LANGUAGES
ambiguity, ambiguity in grammar and languages, 8
normal forms
NDPDA, DPDA, context free languages and
PUSHDOWN PDA, comparison of deterministic and non-
5 AUTOMATA
10
deterministic versions, closure properties,
pumping lemma for CFL
TURING Turing Machines, variations, halting problem,
6 MACHINES
4
PCP
CHOMSKY
7 HIERARCHY
Chomsky Hierarchy 4
TOTAL 48
TEXTBOOKS / REFERENCES:
1. An Introduction to Formal Languages and Automata, by Peter Linz, Third Edition, Narosa
Publishers
2. Introduction to Automata Theory, Languages & Computation J. E. Hopercroft and J. D.
Ullman, Published by Narosa
3. Introduction to Languages and The Theory of Computation J. C. Martin, McGraw Hill
International Edition.

Class Hours/week 4
Course Title : COMPUTER GRAPHICS Expected weeks 12
Course Code: CS131503 Total hrs. of 36+12
L-T-P-C: 3-2-0-4 classes = 48

History of computer graphics, applications,
graphics pipeline, physical and synthetic
images, synthetic camera, modeling,
1 INTRODUCTION animation, rendering, relation to computer 8
vision and image processing, review of basic
mathematical objects (points, vectors, matrix
methods)
OpenGL architecture, primitives and
attributes, simple modeling and rendering of
INTRODUCTION TO two- and three-dimensional geometric
2 OPENGL
10
objects, indexed and RGB color models,
frame buffer, double buffering, GLUT,
interaction, events and callbacks, picking.
Homogeneous coordinates, affine
transformations (translation, rotation, scaling,
GEOMETRIC
3 TRANSFORMATIONS
shear), concatenation, matrix stacks and use 8
of model view matrix in OpenGL for these
operations.
Classical three dimensional viewing,
computer viewing, specifying views, parallel
4 VIEWING and perspective projective transformations; 9
Visibility- z-Buffer, BSP trees, Open-GL
culling, hidden-surface algorithms.
Light sources, illumination model, Gouraud
and Phong shading for polygons.
SHADING AND
5 RASTERIZATION
Rasterization- Line segment and polygon 9
clipping, 3D clipping, scan conversion,
polygonal fill, Bresenham's algorithm.
Texture mapping, compositing, textures in
DISCRETE
6 TECHNIQUES
OpenGL; Ray Tracing- Recursive ray tracer, 4
ray-sphere intersection.
TOTAL 48
Text Books:
1. Edward Angel, Interactive Computer Graphics. A Top-Down Approach Using OpenGL
(fifth Edition), Pearson Education
2. Donald Hearn and Pauline Baker, Computer Graphics with OpenGL (third edition),
Prentice Hall
3. F. S. Hill Jr. and S. M. Kelley, Computer Graphics using OpenGL (third edition), Prentice
Hall
4. Peter Shirley and Steve Marschner, Computer Graphics (first edition), A. K. Peters
Web Resources:
http://www.graphicsforum.in

Course Title : DATABASE MANAGEMENT SYSTEMS
Course Code: CS131504 Class Hours/week 4
Expected weeks 12
L-T-P-C: 3-2-0-4 Total hrs. of 36+12
classes = 48

Purpose of database systems-
Components of DBMS DBMS
Architecture and Data Independence-
BASIC CONCEPTS Data modeling - Entity Relationship
1 10
Model, Relational Network-
Hierarchical and object oriented models-
Data Modeling using the Entity
Relationship Model.
Relational databases relational
algebra- tuple relational calculus. Data
STRUCTURE OF
2 RELATIONAL DATABASES
definition with SQL, insert, delete and 8
update statements in SQL views data
manipulation with SQL
Transaction and System Concepts-
Desirable properties of Transactions-
Schedules and Recoverability-
Serializability of Schedules-Query
processing and Optimization-
INTRODUCTION TO
Concurrency Control- -assertions
3 TRANSACTION 12
PROCESSING triggers.
Oracle case study: The basic structure of
the oracle system database structure
and its manipulation in oracle- storage
organization in oracle - Programming in
PL/SQL- Cursor in PL/SQL
Design guidelines Relational database
design Integrity Constraints Domain
Constraints- Referential integrity
Functional Dependency- Normalization
using Functional Dependencies, Normal
forms based on primary keys- general
4 DATABASE DESIGN 12
definitions of Second and Third Normal
Forms. Boyce Codd Normal Form
Multivalued Dependencies and Forth
Normal Form Join Dependencies and
Fifth Normal Form Pitfalls in
Relational Database Design.

Distributed Database Concepts- Data
Fragmentation,
Replication and Allocation Techniques-
5 DISTRIBUTED DATABASES
Different Types- Query Processing 6
semijoin - Concurrency Control and
Recovery.
TOTAL 48
TEXT BOOKS:
1. Fundamentals of Database System Elmasri and Navathe (4rd Edition), Pearson Education
Asia
2. Database System Concepts - Henry F Korth, Abraham Silbershatz, Mc Graw Hill 2nd
edition.
3. Atul Kahate , Introduction to Database Management System, Pearson Educations

4. Paneerselvam,DataBase Management System, PHI Learning
REFERENCE BOOKS:
1. An Introduction to Database Systems - C.J.Date (7th Edition) Pearson Education Asia

2. An Introduction to Database Systems Bibin C. Desai, Galgotia Publications

Course Title : MICROPROCESSOR AND MICROCONTROLLER
Course Code: EE131505
L-T-P-C: 3-2-0-4 Class Hours/week 4
Expected weeks 12
Total hrs. of 36+12
classes = 48

Introduction to the microprocessor, The
ALU, Up registers, Basic concepts of
programmable device Bus organization,
MICROPROCESSOR
1 system components etc., The interface 8
ARCHITECTURE
section, The timing and control section,
State transition sequence, Block diagram.
Data representation, instruction formats,

addressing modes, Instruction set, software
PROGRAMMING
2
MICROPROCESSORS
design, assembly language programming, 8
program looping, subroutine linkage,
position independency, recursion.
Memory structure and its requirements,
basic concepts and address decoding,
MEMORY
3
INTERFACING
interfacing circuit, address decoding and 8
memory addresses, basics of 8155,
interfacing of 8155 memory section.
Serial and parallel data transfer schemes,
DATA TRANSFER interrupts and interrupt service procedure.
4 8
SCHEMES 8085 interrupts and vector locations, SIM
and RIM instructions, RST instructions.
OPAMPS, Opto-couples, DAC, ADC,
sample& hold amplifiers, multiplexers,
5 I/O DEVICES 8
buffers, Timer counter, Data acquisition
systems.
INTRODUCTION TO
6
MICROCONTROLLER
Architecture, RISC and CISC processors. 4
INSTRUCTION SET Instruction set and programming

7 4
AND PROGRAMMING 8051micro controllers.
TOTAL 48
REFERENCES:
1.Ramesh S.Gaonkar - Microprocessor Architecture, Programming and Applications

(3e), Penram Pub
2.Mazidi M. A. & J. G. Mazidi - The 8051 Microcontroller and embedded systems,
Pearson
3.Microprocessors and Interfacing: Nikhil Marriwala, Katson

Class Hours/week 2
Course Title : PRINCIPLES OF MANAGEMENT Expected weeks 12
Course Code: HS131506 Total hrs. of 24
L-T-P-C: 2-0-0-2 classes

Definition, nature, importance, evolution of
management thoughts pre & post scientific
era, contributions made by Taylor, Fayol,
Gilbreth,Elton Mayo, McGregor, Maslow
1 MANAGEMENT covering Time & Motion Study, Hawthrone 4
Experiments; Is management a science or art?
Functions of manager, ethics in managing and
social responsibility of managers.
Why Management process starts with

planning, steps in planning, planning premises,
types of planning, barriers to effective
planning, operational plan, strategic planning,
PLANNING & Mckinseys 7s Approach, SWOT analysis,
2 CONTROL
4
Controlling- concept, Planning- control
relationship, process of control, human
response to control, dimension of control,
MBO.
Nature, process of decision making, decision

making under Certainty and Uncertainty,
decision-tree, group-aided decision, brain-
storming. Organizing concept, nature and
DECISION MAKING &
3 ORGANIZING
process of organizing, authority and 4
responsibility, delegation and empowerment,
centralization and decentralization, concept of
departmentation.
Concept, Manpower planning, Job design,

recruitment & selection, training and
development, performance appraisal,
STAFFING &
4 MOTIVATION
motivation, motivators and satisfaction, 3
motivating towards organizing objectives,
morale building.
Defining leadership and its role, should

managers lead, leadership style, leadership
development, Leadership behaviour.
LEADERSHIP &
5 COMMUNICATION
Communication- Process, Bridging gap-using 3
tools of communication, electronic media in
Communication

Financial functions of management, Financial
FINANCIAL
6 MANAGEMENT
Planning, Management of Working Capital, 3
Sources of Finance.
Functions of Marketing, Product Planning &
Development, Marketing Organization, Sales
MARKETING
7 MANAGEMENT
Organization, Sales Promotion, Consumer 3
Behaviour, Marketing Research and
Information
TOTAL 24
TEXTBOOKS/REFERENCE BOOKS:
1. Robbins & Caulter, Management, Prentice Hall of India.

2. John R.Schermerhorn, Introduction to Management, Wiley-India Edition.
3. Koontz, Principles of Management, Tata-McGrew Hill.
4. Richard L. Daft, New Era of Management, Cengage Learning.
5. Stoner, Freeman and Gilbert. Jr., Management, Prentice Hall of India.
6. Koontz, Weihrich, Essentials of Management, Tata-McGrew Hill.
7. D.C. Bose, Principles of Management and Administration, Prentice Hall of India.

PRACTICALS
Course Title : COMPUTER GRAPHICS LAB
L-T-P-C: 0-0-2-1
Expected No. of weeks : 12 (approx)
EXPERIMENT
AIM OF THE EXPERIMENT HOURS
NO.
1. WAP to draw following figure using inbuilt function:-
a. c.
d.
b.
1 3
e. f.
Write a program to draw a cube using inbuilt function.

Write a program to write your name.
Write a program to draw your name and department.
Write a program to draw a football moving on x-axis.
Write a program to draw a concentration circle.
Write a program to draw a line using DDA algorithms.
Write a program to draw a line using Bresenhams algorithms.
Write a program draw a moving car.
2 27
Write a program to draw a rectangle using boundary fill algorithms.
Write a program to Draw a circle and fill color with flood fill
algorithm.
Write a program to draw a rectangle is using flood-fill algorithms and
inside that draw a circle using boundary-fill algorithms.
Write a program to draw a circle using midpoint circle drawing
algorithms.
Write a program to draw two circles which is moving from

both side of the screen and join it on the middle of the screen.
Write a program to draw an Indian flag and fill color.
Write a program to Rotate, Translate and scaling a line
Write a program to draw a moving man.
Write a program to draw a chess board.
Write a program to draw a clock.
Write a program to draw a poster for your college.
TOTAL 30

Course Title : DATABASE MANAGEMENT SYSTEMS LAB
L-T-P-C: 0-0-2-1
EXPERIMENT
AIM OF EXPERIMENT HOURS
NO.
Consider the following relational schema
Employee (Emp_no, Name, Salary, design, dept_id, DOJ)
Department (Dept_id, DName, loc, DOE)
1 (a) Display the name of the employees working in marketing dept. 3

(b) Display the details of the employee joined in the month of July.
(c) Display the details of the employee who gets maximum salary.
(d) Count the no of employees in each dept.
Student (Rollno, Name, Address, DOB, C_id)
2 Course ( C_id, Cname, Dur, Fees) 3

(a) Display rollno,name,cname,fees of each student
(b) Count the no of students in each course
Books(book_id,b_name,author,purchase_date,cost)
Members(member_id,m_name,address,phone,birthdate)
Issue_return(book_id,member_id,issue_date,return_date)
(a) Find the author of the books that have not been issued.
(b) Display the member_id and no of books issued to that (Assume

3 that if a book in Issue_Return relation does not have a return_date 3
then it is issued)
(c) Find the book that has been issued the minimum no of times.
(d) Display the names and author of the books that have been issued at
any time to a member whose name begins with "Ra".
(e) Display the name and Cost of those books that have been issued to
any member whose date of birth is less than 01-01-1989 but not
been issued to any member having the birth date equal to or

greater than 01-01-1989.
Student(name,phone,dob,s_id)
Course(c_id,cname,credit,teacher_id)
Result(s_id,c_id,mark)
(a) Find the name of the students whose results are not declared in any
course
(b) Find the teachers who are teaching more than one course
(c) Display the name and marks of those students who were born
4 before 1-1-1989 and score more than 80 marks in any course 3
(d) Find the details of students securing pass marks in more than 3
course
(e) Find the total no of credits earned by a students whose id is 10.
(f) Find name of the students who got maximum overall marks.
(g) Display the name and marks of those students who scored more
than 80 marks in any subject.
(h) Find the details of the students securing less than 30 marks in more
than 3 subjects.
Customer( C_id, Name , Address )
Item(i_code , Name , Price )
Purchase (P_id ,C_id , I_code, qty , pdate )

5 3
(a) Find the name of the customer who has done maximum purchase.
(b) Display the name of the item that has been purchased maximum no
of times in the month of Feb.
(c) Display the name of the customer who didnt purchase any item.
Create three triggers (insert, delete and update) on emp table so that:
i) Whenever a new record is inserted then the emp_id and date of

6 insertion is stored in another table called new_rec. 3
ii) whenever a record is deleted the emp_id and date of deletion is
stored in another table called old_rec.

iii) whenever employee's salary is updated the emp_id , old salary and
updated salary is stored in another table called update_info.
7 Write a procedure to accept a emp_id and display the employee details. 3
8 Write a procedure to accept a emp_id and return the employee salary. 3

Emp(emp_no,name,salary,supervisor_no,dept_code)
Dept(dept_code, dept_name)
i) employees who get more salary than their supervisor
9 ii) Department name and total number of employees in each 3

Department.
iii) Name and department of employee(s) who earn maximum
salary.
TOTAL 27

Course Title : MICROPROCESSOR AND MICROCONTROLLER LAB
Course Code: EE131515
L-T-P-C: 0-0-2-1
EXPERIMENT
NO.
1 Addition of immediate 8 bit numbers 3
2 3
Subtraction of immediate 8 bit numbers
3 3
Addition of 8 bit numbers stored in memory location
4 3
Block transfer of data in memory segments far apart
5 Block transfer of data in memory segments overlapping each other 3
6 Addition of an array of bytes stored in consecutive memory 3
7 Addition of unknown number of bytes stored in consecutive memory 3
8 3
Addition of two 16 bit numbers stored in memory
9 Subtraction of two 16 bit numbers stored in memory 3
10 Multiplication of two 8 bit unsigned numbers stored in memory 3
Division of one 8 bit unsigned number by another 8 bit unsigned number

11 3
stored in memory
TOTAL 33
************

Guwahati
Semester VI / CSE/ B.TECH

Sl Subject Hrs Credits
Subject
No Code
C
L T P
Theory
1 EC131601 Signals and Systems 3 0 0 3
2 MA131602 Fuzzy Mathematics 3 0 0 3
3 CS131603 Data Mining 3 2 0 4
4 CS131604 Design and Analysis of Algorithms 3 2 0 4
5 CS131605 Computer Networks 3 2 0 4
6 CS131606 Modelling & Simulation 3 2 0 4
Practical
7 EC131611 Signals and Systems Lab 0 0 2 1
8 CS131613 Data Mining Lab 0 0 2 1
9 CS131615 Computer Networks Lab 0 0 2 1
Total 18 8 6 25
Total Credits : 25
Course Title: SIGNALS AND SYSTEMS Class Hours/week 3
Course Code: EC131601 Expected weeks 12
L-T-P-C: 3-0-0-3 Total hrs. of 36
classes
1. AN Signals and systems as seen in everyday life, and in 5
INTRODUCTION various branches of engineering and science
TO SIGNALS
AND SYSTEMS
electrical, mechanical, hydraulic, thermal, biomedical
signals and systems as examples. Extracting the
common essence and requirements of signal and
system analysis from these examples.
2. FORMALIZING Energy and power signals, signal properties: 6
SIGNALS periodicity, absolute integrability, determinism and
stochastic character. Some special signals of
importance: the unit step, the unit impulse, the
sinusoid, the complex exponential, some special
time-limited signals; continuous and discrete time
signals, continuous and discrete amplitude signals.
Formalizing systems- system properties: linearity:
additivity and homogeneity, shift-invariance,
causality, stability, realizability. Examples.
3. CONTINUOUS Detail the impulse response and step response, 5
TIME AND convolution, input-output behaviour with a periodic
DISCRETE TIME
LINEAR SHIFT-
convergent inputs, cascade interconnections.
INVARIANT Characterization of causality and stability of
(LSI) SYSTEMS linear shift-invariant systems. System representation
IN DETAIL through differential equations and difference
equations.
4. PERIODIC AND The notion of a frequency response and its relation to 5
SEMI-PERIODIC the impulse response, Fourier series representation,
INPUTS TO AN
LSI SYSTEM
the Fourier Transform, convolution/multiplication
and their effect in the frequency domain, magnitude
and phase response, Fourier domain duality. The
Discrete-Time Fourier Transform (DTFT) and the
Discrete Fourier Transform (DFT). Parseval's
Theorem.The idea of signal space and orthogonal
bases of signals.
5. THE LAPLACE The notion of eigen functions of LSI systems, a basis 7
TRANSFORM of eigen functions, region of convergence, system
FOR
CONTINUOUS
functions, poles and zeros of system functions and
TIME SIGNALS signals, Laplace domain analysis, solution to
AND SYSTEMS differential equations and system behavior.
Generalization of Parseval's Theorem. The z-
Transform for discrete time signals and systems-
eigen functions, region of convergence, system
functions, poles and zeros of systems and sequences,
z-domain analysis. Generalization of Parseval's
Theorem.
6. SYSTEM System interconnection. State-space analysis and 4
REALIZATION multi-input, multi-output representation. The state
THROUGH
BLOCK-
transition matrix and its role. The Sampling Theorem
DIAGRAM and its implications- Spectra of sampled signals.
REPRESENTATI Reconstruction: ideal interpolator, zero-order hold,
ON first-order hold, and so on. Aliasing and its effects.
Relation between continuous and discrete time
systems.
7. APPLICATIONS Modulation for communication, filtering and so on. 4
OF SIGNAL AND Advanced topics: time-frequency representation and
SYSTEM
THEORY
the uncertainty principle, Short-time Fourier
Transforms and wavelet transforms.
Text/Reference books:
1. A.V. Oppenheim, A.S. Willsky and I.T. Young, "Signals and Systems", Prentice Hall
2. R.F. Ziemer, W.H. Tranter and D.R. Fannin, "Signals and Systems - Continuous and
Discrete", 4th edition, Prentice Hall
3. A. Papoulis, "Circuits and Systems: A Modern Approach", HRW
4. B.P. Lathi, "Signal Processing and Linear Systems", Oxford University Press.
5. Douglas K. Lindner, "Introduction to Signals and Systems", Mc-Graw Hill International
Edition
6. Simon Haykin, Barry van Veen, "Signals and Systems", John Wiley and Sons (Asia)
Private Limited
7. Robert A. Gabel, Richard A. Roberts, "Signals and Linear Systems", John Wiley and Sons
8. M. J. Roberts, "Signals and Systems - Analysis using Transform methods and MATLAB",
TMH
9. I. J. Nagrath, S. N. Sharan, R. Ranjan, S. Kumar, "Signals and Systems", TMH New Delhi
10. Ashok Ambardar,"Analog and Digital Signal Processing", 2nd Edition, Brooks/ Cole
Publishing Company
Class Hours/week 3
Course Title: FUZZY MATHEMATICS Expected weeks 12
Total hrs. of 36
Course Code: MA131602 classes
L-T-P-C: 3-0-0-3

1. DEFINITION OF A Elements of Fuzzy logic, Relations 18
FUZZY SET including Operations, reflexivity, symmetry
and transitivity; Pattern Classification based
on fuzzy relations; Fuzzy analysis including
metric spaces, distances between fuzzy sets,
area, perimeter, height, width of fuzzy
subsets, continuity and integrals;
Applications
2. PATHS AND Clusters including cluster analysis and 18
CONNECTEDNESS modelling information systems,
applications; Connectivity in fuzzy graphs,
application in database theory; Applications
to neural networks; Fuzzy algebra including
Fuzzy substructures of algebraic structures,
Fuzzy subgroups, pattern recognition and
coding theory.
Textbooks / References :
1. Fuzzy Mathematics- An Introduction for Engineers and Scientists, John N. Mordeson,

Premchand S. Nair, Springer Books
2. Fuzzy Mathematics- Approximation Theory, Anastassiou George A., Springer
Class Hours/week 4
Course Title: DATA MINING Expected weeks 12
Course Code: CS131603 Total hrs. of classes 36+12
= 48
L-T-P-C: 3-2-0-4

1. INTRODUCTION Basic concepts of data mining, including 6
motivation and definition; different types of data
repositories; data mining functionalities; concept
of interesting patterns; data mining tasks; current
trends, major issues and ethics in data mining
2. DATA Types of data and data quality; Data 8
Preprocessing: data cleaning, data integration
and transformation, data reduction, discretization
and concept hierarchy generation; Exploring
Data: summary statistics, visualization,
multidimensional data analysis
3. ASSOCIATION AND Basic concepts: frequent patterns, association 10
CORRELATION rules - support and confidence; Frequent item set
ANALYSIS
generation - Apriori algorithm, FP-Growth
algorithm; Rule generation, Applications of
Association rules; Correlation analysis.
4. CLUSTERING Concept of clustering, measures of similarity, 12
ALGORITHMS AND Clustering algorithms: Partitioning methods - k-
CLUSTER
ANALYSIS
means and k-medoids, CLARANS, Hierarchical
methods - agglomerative and divisive clustering,
BIRCH, Density based methods - Subspace
clustering, DBSCAN; Graph-based clustering -
MST clustering; Cluster evaluation; Outlier
detection and analysis.
5. CLASSIFICATION Binary Classification - Basic concepts, Bayes 8
theorem and Naive Bayes classifier, Association
based classification, Rule based classifiers,
Nearest neighbour classifiers, Decision Trees,
Random Forest; Perceptrons; Multi-category
classification; Model overfitting, Evaluation of
classifier performance - cross validation, ROC
curves.
6. APPLICATIONS Text mining, Web data analysis, Recommender 4
systems. Prerequisites: Familiarity with basic
Linear Algebra and Probability will be assumed.
Text Books:
1. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, Introduction to Data Mining. Pearson (2005),
India.
2. Jiawei Han and Micheline Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann,
3rd edition
3. Ian H. Witten and Eibe Frank, Data Mining: Practical Machine Learning Tools and Techniques,
Morgan Kaufmann, 3rd edition (January 2011).
Reference Books:
1. T. Hastie, R. Tibshirani and J. H. Friedman, The Elements of Statistical Learning, Data Mining,
Inference, and Prediction. Springer, 2nd Edition, 2009.
2. C. M. Bishop, Pattern Recognition and Machine Learning. Springer.
Course Title: DESIGN AND ANALYSIS OF ALGORITHMS Class Hours/week 4
L-T-P-C: 3-2-0-4 Total hrs. of 36+12
classes = 48

1. INTRODUCTIONFundamental characteristics of an algorithm. 12
Basic algorithm analysis Asymptotic analysis of
complexity bounds best, average and worst-case
behaviour, standard notations for expressing
algorithmic complexity. Empirical measurements
of performance, time and space trade-offs in
algorithms. Using recurrence relations to analyze
recursive algorithms illustrations using recursive
algorithms.
2. FUNDAMENTAL Brute-Force, Greedy, Branch-and-Bound, 14
ALGORITHMIC Backtracking and Dynamic Programming
STRATEGIES
methodologies as techniques for design of
algorithms Illustrations of these techniques for
Problem-Solving. Heuristics characteristics and
their domains of applicability. Design of
algorithms for String/ Texmatching problems,
Huffman Code and Data compression problems,
Subset-sum and Knapsack problems.
3. GRAPH AND Depth- and Breadth- First traversals. Shortest path 8
TREE algorithms, Transitive closure, Minimum
ALGORITHMS
Spanning Tree, Topological sort, Network Flow
problems.
4. TRACTABLE AND Computability. The Halting problem. 8
INTRACTABLE Computability classes P, NP, NP-complete and
PROBLEMS
NP-hard. Cooks theorem. Standard NPcomplete
Problems Reduction techniques.
5. ADVANCED Approximation algorithms, Randomized 6
TOPICS algorithms, Class of problems beyond NP
PSPACE.
Text Books:
1. Algorithm Design Jon Kleinberg and Eva Tardos
2. Introduction to Algorithms T.H. Corman et. al.
Reference Books:
1. Fundamentals of Algorithms E. Horowitz et al.
2. Combinatorial Optimization: Algorithms and Complexity C.H. Papadimitriou et al.
Course Title: COMPUTER NETWORKS Class Hours/week 4
L-T-P-C: 3-2-0-4 Total hrs. of 36+12
classes = 48
1. INTRODUCTION Hardware and software, Data communication, 5

Networking, Protocols and Protocol architecture,
standards. Data transmission concepts.Analog and
digital transmission. Transmission impairments.
Layered Architecture of Computer Networks, OSI
and TCP/IP architectures
2. PHYSICAL Guided transmission media and wireless 7
LAYER transmission, Data encoding - Digital and analog
data and signals, spread spectrum. Data
communication interface - asynchronous and
synchronous transmission, line configuration and
interfacing.
Data link control - Flow control. Error detection
and error control. HDLC and other data link
protocols. Multiplexing Frequency-division,
synchronous time-division, and statistical
time-division multiplexing
3. LINK LAYER Link Layer Addressing and Forwarding; Spanning 8
:MEDIUM Trees; The Channel Allocation Problem, Multiple
ACCESS
CONTROL:
Access Protocols, Ethernet, Wireless LANs,
CDMA, ALOHA, Broadband Wireless, Bluetooth, Data Link Layer
AND ETHERNET Switching, Switched networks. Circuit-switched
networks. Switching concepts. Routing in circuit-
switched networks. Control signaling. Packet
switching principles. Routing and congestion
control, x.25 protocol standard. LAN Technology -
LAN architecture. Bus/tree, ring, star, and wireless
LANs. LAN Systems - Ethernet and Fast Ethernet
(CSMA/CD) Token ring and FDDI, ATM LANs,
Fiber channel, wireless LANs. Bridges - Bridge
operation and routing with bridges.
4. NETWORK Network layer design issues. Routing algorithms , 7
LAYER Flooding, Shortest path routing, Link Sate routing,
Hierarchical routing, Broadcast and multicast
routings, Routing in the Internet, Path Vector
routing, OSPF routing. The network layer in the
Internet: IP protocol,ARP and RARP, BOOTP,
ICMP, DHCP, Network Address Translation(NAT)
Internetworking
5. TRANSPORT TCP introduction, Reliable/Un- Reliable Transport 4
LAYER ,TCP , UDP, Congestion Control,Intra-Domain
Routing: Distance-Vector, Intra-Domain Routing:
Link- State, Wireless Networks: 802.11 MAC,
Efficiency considerations
6. APPLICATION DNS-The Domain Name System,Electronic Mail, 6

LAYER HTTP, FTP, Simple network management protocol
(SNMP),The World Wide Web
7. WEB AND The World Wide Web client and server side of 6
MULTIMEDIA www, HTML and webpages, JAVA language,
Locating on the web. Multimedia- Audio & Video,
Data compression, Video on demand, Multicast
backbone.
8. SECURITY Introduction, Cryptography and Cryptanalysis, 5
Public Key Cryptography Algorithms, RSA
Algorithm, DES, Authentication and Authorization.
Text Books:
1 .Computer Networks, by Andrew S Tanenbaum, PHI. (2010)
2. Data and Computer Communications, by Walliam Stallings, PHI
Reference Books:
1. Data Communications, Computer networking on OSI , by Fred Halsall, Addison Wesley
Publishing Co.
2. Computer Networking -A Top-Down Approach Featuring the Internet, James F. Kurose
and Keith W. Ross, Addison Wesley Publishing Co.
3. Computer Networks: Protocols standards and interfaces, by Uyless Black, Prentice Hall.
4. Data communication & Networks, by Behrou A. Forouzan, Tata McGraw Hill.
Course Title: MODELLNG AND SIMULATION Class Hours/week 4
L-T-P-C: 3-2-0-4 Total hrs. of 36+12
classes = 48

1. INTRODUCTION When simulation is appropriate and when not, 5
advantages and disadvantages of simulation,
application areas in communication, computer
and software design, systems and systems
environment, components of a system, discrete
and continuous systems, model of a system, types
of models, discrete-event simulation, steps in a
simulation study. Simulation Examples-
Simulation of queueing systems, on-demand and
inventory systems, simulation for reliability
analysis etc
2. GENERAL Concepts in discrete event simulation: event 3
PRINCIPLES scheduling/time advance algorithms, world views.
List Processing: properties and operations, data
structures and dynamic allocation, techniques
3. SIMULATION Integrated environments. Examples and review of 4
SOFTWARE some existing software popular and useful in the
industry, e.g., Arena, AutoMod, Extend, Flexsim,
Micro Saint, ProModel, Quest, SIMUL8,
WITNESS etc. Simulation using languages and
environments like C++/Java/GPSS/SSF etc.
Experimentation and Statistical-Analysis Tools:
common features and relevant current products
4. STATISTICAL Terms and concepts. Statistical Models. Review 8
MODELS IN of discrete and continuous distributions. Review
SIMULATION
of Poisson (stationary and non-stationary)
processes. Empirical Distributions; Elementary
Queueing Theory- Basic Structure of Queueing
Models. Input Source (Calling Population).
Queue, Queue Discipline, Service Mechanisms.
Notations and relationships between L, W, Lq, and
Wq. Little's Formula. Role of Exponential
Distribution and Properties. Birth and Death
Processes. M/M/s queues. Finite queue variation
in M/M/s/K models with different s values. Finite
Calling Population cases.
Queueing Models involving Non-Exponential
Distributions: M/G/1, M/D/s, M/Ek/s
(involving Erlang distribution), Models without a
Poisson Input, Models involving
hyperexponential
distributions, Priority Discipline Queueing
Models: Preemptive and Non-Preemptive with
results, properties and server number variations,
Queueing Networks:
Equivalence Property. Infinite Queues in Series
and Product Form Solutions. Jackson
Networks
5. APPLICATION OF Review of Characteristics (calling population 4
QUEUING MODELS system capacity, arrival processes, behaviour and
disciplines, service times and mechanisms etc)
and notations, Application of Long-Run Measures
of Performance: Time average in system, average
time spent per customer, Little's Formula and
server utilization, costs. Steady State behaviour of
Infinite (M/G/1, M/M/c/infinity,
M/M/c/N/infinity) and finite (M/M/c/K/K)
Calling Population Models, Use of Network of
Queues.
6. RANDOM NUMBER Properties. Generation of Pseudo-Random 7
GENERATION Numbers, Techniques for Generation of Pseudo-
Random Numbers: Linear Congruential,
Combined Linear Congruential, Random Number
Streams. Tests for Random Numbers: Frequency
Tests and Tests for Autocorrelation. Random
Variate Generation- Inverse Transform
Techniques for Exponential, Uniform, Weibull,
Triangular and for Empirical Continuous
Distributions. Acceptance-Rejection Techniques
for Poisson (Stationary and Non-Stationary)
Distribution and Gamma Distribution. Special
Properties like the Direct Transformation for the
Normal and Lognormal Distributions,Convolution
Method and others.
7. INPUT Data collection, Identifying the Distribution with 7
MODELLING Data: Histograms, Selection of the Appropriate
Family of Distributions, Quantile-Quantile Plots.
Parameter Estimation: Sample Mean and Sample
Variance and various biased and unbiased
Estimators. Goodness of Fit Tests applied to
Simulation inputs: Chi-Square and Chi-Square
with Equal Probabilities, Kolmogorov-Smirnov
Tests, p-Values and Best Fits.Verification and
Validation of Simulation Models- Verification
and Validation of Simulation Models. Calibration
and Validation: Face Validity, Validation of
Assumptions, Input-Out Transformation
Validation
8. OUTPUT ANALYSIS Output analysis and types of simulation. 3
OF A SINGLE Stochastic Nature of the Output Data. Measures
MODEL
of Performance and Estimation: Point Estimation
and Confidence-Interval Estimation. Output
Analysis for Terminating Simulations and
Estimation of Probabilities. Output Analysis of
Steady State Simulations: Initialization
Bias, Error Estimation, Replications, Sample Size
and Batch Means for Interval Estimation.
9. COMPARISON AND Comparison of Two System Designs.; Sampling 4
EVALUATION OF with Equal and Unequal Variances. Common
ALTERNATIVE
SYSTEM DESIGNS
Random Numbers. Confidence Intervals with
Specified Precision. Comparison of Several
System Designs: Bonferroni Approaches to
Multiple Comparisons and to Screening and to
Selection of the Best. Metamodeling L Sample
Linear Regression, Testing for Significance,
Multiple Linear Regression. Random Number
Assignment for Regression. Optimization via
Simulation: Robust Heuristics.
10 SIMULATION OF Simulation Tools: Process Orientation and 3
COMPUTER Event Orientation. Model Input: Modulated
SYSTEMS
Poisson Process and Virtual-Memory
Referencing. High-Level Simulation. CPU and
Memory Simulations. Simulation of
Computer Networks- Traffic Modelling, Media
Access Control: Token-Passing Protocols and
Ethernet, Data Link Layer, TCP, Model
Construction.
Text Books:
1. Jerry Banks, John S. Carson II, Barry L. Nelson and David M. Nicol, Discrete-Event System and
Simulation, Prentice Hall of India, New Delhi
2. Averill M. Law, Simulation modelling and analysis (SIE), Tata McGraw Hill India
3. David Cloud, Larry Rainey, Applied Modelling and Simulation, Tata McGraw Hill, India.
Reference Books:
1. Gabriel A. Wainer, Discrete-event modeling and simulation: a practitioner's approach, CRC Press
2. Bernard P. Zeigler, Herbert Praehofer, Tag Gon Kim, Theory of modeling and simulation:
integrating discrete event and continuous complex dynamic systems, Academic Press.
3. Averill M. Law, W. David Kelton, Simulation modeling and analysis, McGraw Hill
4. Walter J. Karplus, George A. Bekey, Boris Yakob Kogan, Modeling and simulation: theory and
practice, Springer
5. Stanislaw Raczynski, Modeling and simulation: the computer science of illusion, Wiley
6. Mohammad Salameh Obaidat, Georgios I. Papadimitriou, Applied system simulation:
methodologies and application, Springer
7 .van Dijk, Nico M.; Boucherie, Richard J. (Eds.) 2011. Queueing Networks: A Fundemental
Approach. 798 p.148 illus. Springer.
8. Bhat, U. Narayan, An Introduction to Queueing Theory: Modeling and Analysis in Applications,
Springer
PRACTICALS
Course Title: SIGNALS AND SYSTEMS LAB
Course Code: EC131611
L-T-P-C: 0-0-2-1
EXPERIMENT
NO
Define and Sketch the following discrete time signals:
a) unit step function u(n)
1 b) unit impulse signal (n) 2
c) unit ramp signal r(n)
d) rectangular pulse signal of width 10
Use Subplot to plot the graphs in the same window.
Sketch the following shifted unit step signals using subplot to plot on the
2 same figure window. a) u(n+2) b) u(n-3) c) u(n+2) u(n-3) 1
Generate the signal x(n)= u(n) - u(n-10). Decompose x(n) into odd and
3 even components. Plot x(n) and the odd and even components using 1
subplot.
Define and Sketch the following continuous time signals:
a) unit step function u(t)
b) unit impulse function (t)
4 c) unit ramp r(t) 2
d) rectangular pulse signal of width 2
using sign function in MATLAB. Use Subplot to plot the graphs in the
same window.
WAP to generate the following
a) A 50 Hz sinusoidal signal sin(2ft) samples at 600 Hz.
5 2
b) A sinc function
c) A square wave.
Plot signals cos (2t), cos(2t+ /2) and cos(2t-/2) on the same figure
6 window on the same axis. Make use of proper markers, colour and legends 2
to distinguish between the graphs.
Consider a continuous time signal x(t)=2sin t for an interval 0t2.
7 Sample the continuous time signal with a sampling period of T=0.2s. 2
Sketch the continuous time signal and discrete time signal using subplot.
8 1
Plot the exponentially varying sinusoid x(t)=4e-2t sin(6t-60) , 0<t<4
Define the following piecewise continuous functions in MATLAB and
plot them:
a) x(t)= 1, -1 t < 0
-1, 0 t < 2
9 2
b) x(t) = et , -5 t 0
e-t , 0 < t 5
c) x(t)= sin(t), t < 0
t2, 0 t 1
1/t , t>1
Plot the signal x(t)=cos(t) , -5t5. On the same plot, same axis,
10 also show x(2t) and x(t/2) 2
11 Plot signal x(t)= et/2, -5t1. using subplot, plot x(-t). 2
Plot the continuous time signals x(t) and h(t) given below using
MATLAB commands. Find the convolution of the two signals and plot
the convolution result. Use subplot to show all the three signals.
12
2
Determine the convolution of two sequences x(n)={1,4,3,2} and

13 h(n)={1,3,2,1} and then plot it. 2
Given unit impulse response h(n)=sin(0.5n) for n0 and input

14 x(n)=sin(0.2n) for n0. Compute the output response y(n). Plot x(n), h(n) 2
and y(n) using subplot.
Write a function to plot the unit step function and using that function plot
a) u(n), -7<n<7
15 b) u(n-3), -10<n<10 2
c) u(n+2), -6<n<6
WAP to find the Laplace transform of the following signals

16 2
a) t b) te-at c) tn-1/(n-1)! d) 3 sin(2t) + 3 cos(2t)
WAP to find the inverse Laplace transform of the following s-domain
signals
17 2
a) 2/s(s+1)(s+2) b) 1/(s2+s+1)(s+2)
WAP to find the convolution of signals x(t)=t2-3t and h(t)=t using Laplace
transform.
WAP to find the Z transform of the following signals
18 2
a)n b)an c) e-anT d) 1+n(0.4)n-1
WAP to find the inverse Z transform of the following signals
1/(1-1.5z-1 + 0.5 z-2) b) 1/(1+z-1)(1-z-1)2
19 2
WAP to perform the convolution of the following signals x(n)=(0.4) n u(n)
and h(n)=(0.5)nu(n) using z transform.
TOTAL 35
Course Title: DATA MINING LAB
L-T-P-C: 0-0-2-1
EXPERIMENT
NO
1 To install open source data mining software such as Weka, XL 1
Miner etc.
2 To do experiments with respect to 8
a) Data preprocessing, attribute oriented analysis and
visualization
b) Mining association rules
c) Classifier design: Naive Bayes Classifier, Rule based
classifiers, Decision Trees and Perceptions (both for binary and
multiclass Classification), Random Forests
d) Evaluation of classifiers
e) Clustering algorithms: k-means and k-medoids, hierarchical,
CLARANS, BIRCH and DBSCAN
f) Cluster evaluation
3 To extend the data mining algorithms implemented in open 6
source data mining software
4 To propose, implement and test new data mining algorithms 4
5 To apply the new algorithms to some sample data sets such as 8
KDD CUP data sets and compare them with some existing
algorithms.
TOTAL 27
Course Title: COMPUTER NETWORKS LAB
L-T-P-C: 0-0-2-1
EXPERIMENT
NO
Study of different network cables and devices.
1 3
2 Study of college LAN with references to network IP and design 3

a LAN for it.
3 Study of basic network command and network configuration 3
command
4 Study of LAN transmission medias, topologies, interconnection 3
devices & LAN standards.
Write a program in C for PC to PC communication using RS-
5 232 port. 3
Implement Dijkstras algorithm to compute the Shortest path in
a graph.
Study of Different network simulators for simulations
6 3
Token bus and token ring protocol To create scenario and study
the performance of token bus and token ring protocols through
7 simulation. 3
Implement Transfer of files from PC to PC using Windows /
Unix socket programming
Case study of client/server scenario. Observing the difference
between UDP and TCP servers.
8 To observe the working of TCP threewayhandshaking 3
procedure. Locating different packets like, SYN, SYNACK and
ACK. Comparing different fields of these packets
Write a program for Hamming Code generation for error
detection and correction
9 Using TCP/IP sockets, write a client-server program to make 3
client sending the file name and the server to send back the
contents of the requested file if present.
Study & Simulation of Routing Protocols using Standard
10 3
Network Simulator
TOTAL 30
Guwahati

Semester VII/ CSE/ B.TECH
Sub Subject Hrs Credits
Sl
Code C
No L T P
Theory
1 CS131701 Cryptography & Information Security 3 0 0 3
2 CS131702 Software Engineering 3 0 0 3
3 CS131703 Web Technology 3 2 0 4
4 CS131704 Mobile Computing 3 0 0 3
5 **1317E01 Elective I (Departmental) 3 0 0 3
6 HS1317E02 Elective II (Humanities) 2 0 0 2
Practicals
7 CS131712 Software Engineering Lab 0 0 2 1
8 CS131713 Web Technology Lab 0 0 2 1
9 CS131715 Project 0 0 8 4
10 CS131721 Seminar on Summer Training 0 0 0 1
Total 17 2 12 25
Total Credit : 25
Elective-I Subjects
Sl No Subject Code Subject
1 EE1317E01(IV) Optimization Techniques
2 **1317E01(V) Any other subject offered from time to time
with the approval of the university
Elective-II Subjects
1 HS1317E02(I) Value Education, Human Rights and
Legislative Procedure
2 HS1317E02(II) Any other subject offered from time to time
with the approval of the university
Course Title: CRYPTOGRAPHY & INFORMATION
SECURITY Class Hours/week 3
classes

1. SYMMETRIC Overview: Services, Mechanisms and Attacks, The 10
CIPHERS OSI Security Architecture, A Model of Network
Security. Classical Encryption Techniques:
Symmetric Cipher Model, Substitution
Techniques, Transposition Techniques, Rotor
Machines, Steganography. Block Cipher and the
Data Encryption Standard: Simplified DES, Block
Cipher Principles, The DES, The Strength of DES,
Differential and Linear Cryptanalysis. Symmetric
Ciphers: Triple DES, Blowfish. Confidentiality
using
Conventional Encryption: Placement of Encryption
Function, Traffic Confidentiality, Key
Distribution, Random Number Generation.
2. PUBLIC KEY Number Theory, Prime Numbers Formats and 6
ENCRYPTION, Eulers Theorems, Testing for Primality. Public
DIGITAL Key Cryptography and RSA: Principles of Public
SIGNATURES Key Cryptosystems, The RSA Algorithms, Key
Management, Diffie Hellman Key Exchange.
3. AUTHENTICATION Message Authentication: Authentication 6
PROTOCOLS Requirements, Authentication Functions, Message
Authentication Codes, MD5 Message Digest
Algorithms, Digital Signatures and Authentication
Protocols: Digital Signatures, Authentication
Protocols, Digital Signature Standards.
4. NETWORK Authentication Applications: Kerberos, X.509 10
SECURITY Directory Authentication Service. Electronic Mail
Security: Pretty Good Privacy. IP Security:
Overview, IP Security Architecture, Authentication
Header, Encapsulation Security Payload. Web
Security: Web Security Requirements, Secure
Sockts Layer and Transport Layer Security, Secure
Electronic Transaction.
5. SYSTEM SECURITY Intruders, Malicious Software, Viruses and Related 4
Threats, Counter Measures, Firewalls and its
Design Principles.
Text Books:
1. William Stallings, Cryptography and Network Security, 4th Edition, Pearson
Education/PHI.
ReferenceBooks:
1. Charlie Kaufman, Radia Perlman, Mike Speciner, Network Security: Private
Communication in Publ World, 2nd Edition, 2011, Pearson Education.
Course Title: SOFTWARE ENGINEERING Class Hours/week 3
classes

1. EVOLUTION AND Software life cycle models: Waterfall, 9
IMPACT OF prototyping, Evolutionary, and Spiral models.
SOFTWARE
ENGINEERING
Feasibility study, Functional and Non-
functional requirements, Requirements
gathering, Requirements analysis and
specification.
2. BASIC ISSUES IN Modularity, cohesion, coupling and layering, 9
SOFTWARE DESIGN function-oriented software design: DFD and
Structure chart, object modeling using UML,
Object-oriented software development, user
interface design. Coding standards and Code
review techniques.
3. FUNDAMENTALS OF White-box, and black-box testing, Test 9
TESTING coverage analysis and test case design
techniques, mutation testing, Static and
dynamic analysis, Software reliability metrics,
reliability growth modeling.
4. SOFTWARE Project planning and control, cost estimation, 9
PROJECT project scheduling using PERT and GANTT
MANAGEMENT
charts, cost-time relations: Rayleigh-Norden
results, quality management, ISO and SEI
CMMI, PSP and Six Sigma. Computer aided
software engineering, software maintenance,
software reuse, Component-based software
development.
Text Books:
1. Fundamentals of Software Engineering by Rajib Mall, PHI-3rd Edition, 2009.
Reference Books:
1 .Software Engineering, by Ian Sommerville, Pearson Education Inc., New Delhi, (2009).
2. Software Engineering: A Practitioners Approach, by Roger S. Pressman, McGraw-Hill.
Course Title: WEB TECHNOLOGY Class Hours/week 4
L-T-P-C: 3-2-0-4 Total hrs. of 36+12
classes = 48

1. AN INTRODUCTION History of web Development, Time line, 8
TO WEB Motivation, Categories of Web Applications,
TECHNOLOGY
Characteristics of Web Applications.
Evolution and Need for Web Engineering,
Web Engineering Models, Software
Engineering v/s Web Engineering . World
Wide Web: Introduction to TCP/IP and WAP,
DNS, Email, TelNet, HTTP and FTP.
Introduction to Browser and search engines,
Search fundamentals, Search strategies,
Directories search engines and Meta search
engines, Working of the search engines ,
Miscellaneous Web Browser details,
Introduction to Web Servers: Features of web
servers, caching, case study-IIS, Apache,
Configuring web servers.
2. INFORMATION The role of the Information Architect, 12
ARCHITECTURE Collaboration and Communication,
Organizing Information, Organizational
Challenges, Organizing Web sites parameters
and Intranets Creating Cohesive Websites:
Conceptual Overview Website Development,
Website Design issues, Conceptual Design,
High-Level Design, Indexing the Right Stuff,
Grouping Content. Architectural Page
Mockups, Design Sketches, Navigation
Systems. Searching Systems Good & bad web
design, Process of Web Publishing. Phases of
Web Site development, enhancing your web-
site, submission of website to search engines
Web security issues, security audit of
websites, Web effort estimation, Productivity,
Measurement, Quality usability and
reliability. Requirements Engineering for
Web Applications: Introduction,
Fundamentals, Requirement Source, Type,
Notations Tools. Principles Requirements
Engineering Activities , Adapting RE
Methods to Web Application.
3. TECHNOLOGIES FOR HTML and DHTML, HTML Basic Concepts, 8
WEB APPLICATIONS Static and dynamic HTML, Structure of
HTML documents, HTML Elements, Linking
in HTML, Anchor Attributes, Image Maps,
Meta Information, Image Preliminaries,
Layouts, Backgrounds, Colors and Text,
Fonts, Tables, Frames and layers, Audio and
Video Support with HTML Database
integration, CSS, Positioning with Style
sheets, Forms Control, Form. Elements.
Introduction to CGI PERL, JAVA SCRIPT,
PHP, ASP , Cookies Creating and Reading
Cookies
4. TECHNOLOGIES FOR Introduction of XML, Validation of XML 8
WEB APPLICATIONS documents, DTD, Ways to use XML, XML
for data files, HTML Vs XML, Embedding
XML into HTML documents, Converting
XML to HTML for Display, Displaying XML
using CSS and XSL, Rewriting HTML as
XML,Relationship between HTML, SGML
and XML, web personalization, Semantic
web, Semantic Web Services, Ontology.
5. E- COMMERCE E-commerce Business Models, The Internet 12
and World Wide Web: E-commerce
Infrastructure, Building an E-commerce Web
Site , Electronic Commerce environment and
opportunities. Modes of Electronic
Commerce, Approaches to safe Electronic
Commerce, Electronic Cash and Electronic
Payment Schemes ,Online Security and
Payment Systems, Ecommerce Marketing
Concepts, Advertising on the Internet: issues
an Technologies, Ecommerce Marketing
Concepts Electronic Publishing issues,
approaches, legalities and technologies,
Privacy and Security Topics: Introduction,
Web Security , Encryption schemes, Secure
Web document, Digital Signatures and
Firewalls, Cyber crime and laws, IT Act.
Recommended Books:
1. Roger S.Pressman, David Lowe, Web Engineering, Tata Mcgraw Hill Publication, 2007
2. Achyut S Godbole and Atul Kahate, Web Technologies, Tata McGraw Hill
3. Gopalan N P, Akilandeswari Web Technology: A Developer s Perspective, PHI
4. NEIL GRAY Web server Programming WIley
5. CHRIS BATES Web Programming: Building Internet applications Wiley
6. Moller, An Introduction to XML and Web Technologies , Pearson Education New Delhi
7. Beginning XML 4th Edition Hnter, Refter, Fawset Wiley India
8. Internet & World Wide Web How to Program, Pearson education, 3rd edition, by: H.M.
Deitel, P.J. Deitel, A.B. Goldberg.
9. C. Xavier, Web Technology & Design, Tata McGraw Hill.
10 Ivan Bay Ross, HTML,DHTML,Java script,Perl CGI , BPB
Class Hours/week 3
Course Title: MOBILE COMPUTING Expected weeks 12
Course Code: CS131704 Total hrs. of 36
L-T-P-C: 3-0-0-3 classes

1. TECHNICAL Transmission Fundamentals , Communication 4
BACKGROUND Networks , Protocols and the TCP/IP Suite
2. WIRELESS Cellular Wireless Networks , Antennas and 6
COMMUNICATION Wave Propagation, Modulation Techniques,
TECHNOLOGY
Multiple Access in Wireless System
3. MOBILE ADAPTIVE Mobility Management , Data Dissemination 5
COMPUTING and Management
4. CONTEXT-AWARE Context-Aware Computing 4
COMPUTING
5. INTRODUCTION TO Middleware for Application Development: 5
MOBILE Adaptation and Agents , Service Discovery
MIDDLEWARE
Middleware: Finding Needed Services
6. INTRODUCTION TO Challenges , Protocols 4
AD HOC AND
SENSOR NETWORKS
7. WIRELESS Approaches to Security , Security in Wireless 8
SECURITY Personal Area Networks , Security in Wireless
Local Area Networks ,Security in Wireless
Metropolitan Area Networks (802.16), Security
in Wide Area Networks.
Text Books:
1. Wireless Communications and Networking, Willam Stallings, Pearson Education. (2002)
2. Fundamentals of Mobile & Pervasive Computing by Frank Adelstein, Sandeep Ks
Gupta, ISBN: 9780070603646, TMH (2005)
Reference Books:
1. Jochen Schiller, "Mobile Communications," Addison-Wesley (2009)
2. R. Dayem, "Mobile Data & Wireless Lan Technologies," Prentice-Hall (2005)
Course Title: ELECTIVE I (Departmental) Class Hours/week 3
Course Code: EE1317E01(IV) Expected weeks 12
classes
OPTIMIZATION TECHNIQUES

1. INTRODUCTION Introduction, Historical development, Engineering 8
TO Application of Optimization, Statement of an
OPTIMIZATION
Optimization problem-Design Vector, Design
Constraints, Constraint Surface, Objective Function
Surfaces.
Classification of Optimization Problems,
Optimization techniques, Engineering Optimization
Literature. Problems
2. CLASSICAL Introduction, single variable Optimization, multi- 7
OPTIMIZATION variable Optimization with no constraints,
TECHNIQUES
multivariable Optimization with equality
constraints, multivariable Optimization with
inequality constraints, convex programming
problems.
3. LINEAR Introduction, Application of Linear Programming, 7
PROGRAMMING Standard form of a Linear Programming Problem,
I: SIMPLEX
METHOD
Geometry of a Linear Programming Problems,
Definitions and Theorem, Solution of a system of
Linear simultaneous equation, Pivotal reduction of
a general system of equation, motivation of the
simplex method, Simplex algorithm, two phases of
the simplex method
4. LINEAR Revised simplex method, duality in linear 7
PROGRAMMING programming, decomposition principle, sensitivity
II: ADDITIONAL
TOPICS AND
or postoptimality analysis, Transportation problem,
EXTENSIONS Karmarkars Method, quadratic programming.
5. NON-LINEAR Introduction, unimodal function, Unrestricted 7
PROGRAMMING: search, exhaustive search, dichotomous search,
ONE
DIMENSIONAL
Interval Halving method, Fibonacci method,
MINIMIZATION
METHODS
Textbooks/References:
1. Optimization Theory and Application SS Rao, Wiley Eastern Ltd, 3rd edition
2. Optimization Techniques-Chander Mohan, Kusum Deep, New Age Science.
3. Optimization Techniques-Paban Kumar Oberoi, Global Vision Publishing House
4. Computer based Optimization Techniques-Tanweer Alam- A.B.Publications
5. Operation Research-An Introduction-TAHA H A,Prentice Hall
Course Title: ELECTIVE II (Humanities) Class Hours/week 2
Course Code: HS1317E02(I) Expected weeks 12
classes
VALUE EDUCATION, HUMAN RIGHTS AND
LEGISLATIVE PROCEDURE
1 VALUES AND Social values and individual attitudes, Work ethics, 5

SELF Indian vision of humanism, Moral and non moral
DEVELOPMENT valuation, Standards and principles, Value judgments.
Importance of cultivation of values, Sense of duty,
Confidence, National unity, Patriotism, Love for nature,
Discipline. Devotion, Self reliance.
2 PERSONALITY Soul and scientific attitude, Positive thinking, Integrity 4

AND and discipline, Punctuality, Love and kindness,
BEHAVIOUR Avoiding fault finding, Free from anger, Dignity of
DEVELOPMENT labor, Universal brotherhood and religious tolerance,
Happiness vs. suffering love for truth, Aware of self
destructive habits, Association and cooperation
3 CHARACTER Science vs. God, Holy books vs. blind faith, Self 4
AND management and good health, Science of reincarnation,
COMPETENCE Equality, Nonviolence, Humility, Role of women, All
religions and same message, Mind your mind, Self
control
4 HUMAN Jurisprudence of human rights nature and definition, 5

RIGHTS Universal protection of human rights, Regional
protection of human rights, National level protection of
human rights, Human rights and vulnerable groups.
5 LEGISLATIVE Indian constitution, Philosophy, fundamental rights and 6

PROCEDURES duties, Legislature, Executive and Judiciary,
Constitution and function of parliament, Composition of
council of states and house of people, Speaker, Passing
of bills, Vigilance, Lokpal and functionaries.
Textbooks:
1. Chakraborty, S.K., Values and Ethics for Organizations Theory and Practice, Oxford
University Press, New Delhi
2. Kapoor, S.K., Human rights under International Law and Indian Law, Prentice Hall of
India, New Delhi
3. Basu, D.D., Indian Constitution, Oxford University Press, New Delhi
Reference Books:
1. Frankena, W.K., Ethics, Prentice Hall of India, New Delhi,

2. Meron Theodor, Human Rights and International Law Legal Policy Issues, Vol. 1 and 2,
Oxford University Press, New Delhi
PRACTICALS
Course Title: SOFTWARE ENGINEERING LAB
L-T-P-C: 0-0-2-1
EXPERIMENT AIM OF EXPERIMENT HOURS

NO
1 Design an experiment to fine out the LOC count for any source 1
code
2 Design a test plan suite document for any application (e.g. ATM 1
system)
3 Design a Network Activity Diagram for any application 1
4 Design a Pert Chart for any application 1
5 Design a Grant Chart Diagram for any application 1
6 Design a CFG ( Control flow graph) for any Source Code 1
7 Design SRS for any application using Software Architect 1
8 Design a Use Case Diagram for any Application (e.g. Library 1

Management System) using Software Architect
9 Design a Class Diagram for any Application (e.g. Library 1

10 Design a Sequence Diagram for any Application (e.g. Library 1

11 Design a Activity Diagram for any Application (e.g. Library 1

12 Design a State Chart Diagram for any Application (e.g. Library 1

13 Design a Collaboration Diagram for any Application (e.g. Library 1

14 Implement any Application (e.g. Inventory Management System) 3

system using any programming language ( e.g. Java, VB.Net etc.)
15 Case Studies: Manual Testing and Automatic Testing exercises 3

using Rational Software Testing tool.
TOTAL 19
Course Title: WEB TECHNOLOGY LAB
L-T-P-C: 0-0-2-1
EXPERIMENT
NO
Write an HTML program to make a list of Nested Unordered and
Nested Ordered list for the following items:
Asia
o India
Assam
Maharashtra
1 Karnataka 3
o China
o Pakistan
Europe
Africa
Write the HTML code for a page containing two frames. One of the
frames may contain 2 or 3 links and on clicking one of the links, a
different page is loaded on the other frame.
Write a program in JavaScript to calculate compound interest for

ten years where principal and rate is inputted by the user. Then
generate a table of 10 rows and 2 columns and fill the cells of the
2 table by the amount for each year. 3
Write a program in JavaScript to find the sum and average of n
different numbers (n is inputted by the user).
Write a program in JavaScript to generate random numbers from 1

to 10 and fill the cells of a table having 5 rows and 5 columns.
3 Write a program in JavaScript to generate an array of random 3
numbers and perform linear search on it.
Write a program in JavaScript to generate a two-dimensional array,

where the row, column and values for the array will be given by
the user.
4 3
Write a program in JavaScript to enter a sentence and then split
the sentence into words using split () and join () methods.
Write a program in JavaScript to open and close a child window by

5 using window.open() and window.close() functions. 3
Write a program in JavaScript to show the usage of focus () and
select () methods.
Write a program in JavaScript to validate the E-Mail address
inputted by the user.
Write a program in JavaScript to restrict the user from entering

any values inside a text box other than a number.
Write a program in HTML and Java Script to check whether a
substring is present inside a string or not.
6 3
Write a program in Java Script for creating and storing cookies.
Write a program in Java Script that shows the number of seconds
that a user has spent viewing a particular web page.
Write a program in Java Script that the color of a web page on

clicking of a button.
Write a program in Java Script that depicts use of the events
onMouseOver and onMouseOut on an image.
Write a JSP/PHP program to convert ten different temperature
7 3
values from Fahrenheit to Celsius and show the result in tabular
format.
Write a JSP/PHP program to show how session management can
be performed.
Write a JSP/PHP program to calculate the Simple Interest, where

amount, rate and year are inputted by the user.
Write a program in JSP/PHP to see the current date and time.
Write a simple JSP/PHP program to performing the following:
o Addition
8 3
o Deletion
o Updation
Write a JSP/PHP program to implement a simple phone directory
service.
Create a Simple JSP/PHP page where a user can post his

suggestions.
Convert the following into an XML page:
<html>
<head>
<title>Book</title>
</head>
9 3
<body>
o <h1>Web Technology</h1>
o <b>Authors:</b>
o <ul>
<li>Richardson</li>
<li>Alex</li>
<li>Richardson</li>
<li>Alex</li>
o </ul>
o <p>Rs.300</p>
o <p>Wrox Publication</p>
</body>
</html>
Following is an XML document:
<?xml-stylesheet type="text/xsl" href="employee1.xsl"?>

<PAYROLL>
<EMPLOYEE>
<ID>1010</ID>
o <NAME>John Smith</NAME>
o <DEPARTMENT>Projects</DEPARTMENT>
o <BASICPAY>30000</BASICPAY>
o <MANAGER>Ron Martin</MANAGER>
</EMPLOYEE>
</PAYROLL>
o Write an XSL document to display the data in a browser in

a tabular format.
o Write an XSL document to display only those employees
whose DEPARTMENT is Projects.
TOTAL 27
L=0
T=0
CS131715 PROJECT P=8
C=4
GUIDELINES WILL BE UPLOADED BY THE UNIVERSITY FROM TIME TO TIME
L=0
T=0
CS131721 SEMINAR ON SUMMER TRAINING P=0
C=1

Guwahati
Semester VIII/ CSE/ B.TECH
Sl Sub-Code Subject Hrs Credits

No L T P C
Theory
1 CS131801 Artificial Intelligence 3 0 0 3
2 CS131802 Compiler Design 3 0 0 3
3 CS1318E03 Elective III(Departmental) 3 0 0 3
4 CS1318E04 Elective IV(Departmental) 3 0 0 3
5 **1318E05 Elective V( Open) 3 0 0 3
Practical
6 CS131812 Compiler Design Lab 0 0 2 1
7 CS131816 Project 0 0 10 5
8 CS131821 Comprehensive Viva 0 0 0 4
Total 15 0 12 25
Total Contact Hours: 27
Total Credits : 25
Elective-III Subjects
1 CS1318E03(I) Multimedia Computing
2 CS1318E03(II) Game Theory
3 CS1318E03(III) Any other subject offered from time
to time with the approval of the
university
Elective-IV Subjects
1 CS1318E04(I) Cloud Computing
2 CS1318E04(II) Web Service and Service Oriented
Architecture
3 CS1318E04(III) Any other subject offered from time
university
Elective-V Subjects
1 **1318E05(I) Engineering System Analysis and
Design
2 **1318E05(II) Planning for Sustainable
Development
3 **1318E05(III) Disaster Management
4 **1318E05(IV) Any other subject offered from time
university
Course Title: ARTIFICIAL INTELLIGENCE
L-T-P-C: 3-0-0-3 Expected weeks 12
Total hrs. of 36
classes
1. INTRODUCTION What is intelligence? Foundations of artificial 6
intelligence (AI). History of AI; Problem
Solving- Formulating problems, problem types,
states and operators, state space, search
strategies.
2. INFORMED Best first search, A* algorithm, heuristic 7
SEARCH functions, Iterative deepening A*(IDA), small
STRATEGIES
memory A*(SMA); Game playing - Perfect
decision game, imperfect decision game,
evaluation function, alpha-beta pruning
3. REASONING Representation, Inference, Propositional Logic, 5
predicate logic (first order logic), logical
reasoning, forward chaining, backward
chaining; AI languages and tools - Lisp, Prolog,
CLIPS
4. PLANNING Basic representation of plans, partial order 4
planning, planning in the blocks world,
hierarchical planning, conditional planning,
representation of resource constraints,
measures, temporal constraints
5. UNCERTAINTY Basic probability, Bayes rule, Belief networks, 4
Default reasoning, Fuzzy sets and fuzzy logic;
Decision making- Utility theory, utility
functions, Decision theoretic expert systems.
6. INDUCTIVE Decision trees, rule based learning, current- 7
LEARNING best-hypothesis search, least-commitment
search , neural networks, reinforcement
learning, genetic
algorithms; Other learning methods - neural
networks, reinforcement learning, genetic
algorithms.
7. COMMUNICATION Commiunication among agents, natural 3
language processing, formal grammar, parsing,
grammar
Text Books:
1 .Stuart Russell and Peter Norvig. Artificial Intelligence A Modern Approach, Pearson Education
Press
2 .Kevin Knight, Elaine Rich, B. Nair, Artificial Intelligence, McGraw Hill
Reference Books:
1. George F. Luger, Artificial Intelligence, Pearson Education
2 .Nils J. Nilsson, Artificial Intelligence: A New Synthesis, Morgan Kauffman
Course Title: COMPILER DESIGN
Total hrs. of 36
classes

1. OVERVIEW OF The structure of a compiler and applications of 4
COMPILATION compiler technology; Lexical analysis - The role
of a lexical analyzer, specification of tokens,
recognition of tokens, hand-written lexical
analyzers, LEX, examples of LEX programs.
2. INTRODUCTION Role of a parser, use of context-free grammars 4
TO SYNTAX (CFG) in the specification of the syntax of
ANALYSIS
programming languages, techniques for writing
grammars for programming languages (removal
left recursion, etc.), non- context-free constructs
in programming languages, parse trees and
ambiguity, examples of programming language
grammars.
3. TOP-DOWN FIRST & FOLLOW sets, LL(1) conditions, 4
PARSING predictive parsing, recursive descent parsing,
error recovery. LR-parsing - Handle pruning,
shift-reduce parsing, viable prefixes, valid items,
LR(0) automaton, LR-parsing algorithm, SLR(1),
LR(1), and LALR(1) parsing. YACC, error
recovery with YACC and examples of YACC
specifications.
4. SYNTAX- Synthesized and inherited attributes, examples of 4
DIRECTED SDDs, evaluation orders for attributes of an SDD,
DEFINITIONS
(ATTRIBUTE
dependency graphs. S-ttributed and L-attributed
GRAMMARS) SDDs and their implementation using LR-parsers
and recursive descent parsers respectively.
5. SEMANTIC Symbol tables and their data structures. 7
ANALYSIS Representation of scope. Semantic analysis of
expressions, assignment, and control-flow
statements, declarations of variables and
functions, function calls, etc., using S- and L-
attributed SDDs (treatment of arrays and
structures included). Semantic error recovery.
6. INTERMEDIATE Different intermediate representations 7
CODE quadruples, triples, trees, flow graphs, SSA
GENERATION
forms, and their uses. Translation of expressions
(including array references with subscripts) and
assignment statements. Translation of control-
flow
statements it- then-else, while-do, and switch.
Short-circuit code and control-flow translation of
Boolean expressions. Back patching. Examples to
illustrate intermediate code generation for all
constructs.
7. RUN-TIME Stack allocation of space and activation records. 3
ENVIRONMENTS Access to non-local data on the stack in the case
of procedures with and without nesting of
procedures.
8. INTRODUCTION Simple machine code generation, examples of 3
TO MACHINE machine-independent code optimizations.
CODE
GENERATION
AND
OPTIMIZATION
Text Books:
1. Compilers: Principles, Techniques, and Tools, by A.V. Aho, Monica Lam, Ravi Sethi, and J.D.
Ullman
2. K.D. Cooper, and Linda Torczon, Engineering a Compiler, Morgan Kaufmann
Reference Books:
1. K.C. Louden, Compiler Construction: Principles and Practice, Cengage Learning
2. D. Brown, J. Levine, and T. Mason, LEX and YACC, OReilly Media
Course Title: ELECTIVE III (Departmental)
Course Code: CS1318E03(I) Class Hours/week 3
Total hrs. of 36
MULTIMEDIA COMPUTING classes

1. INTRODUCTION Media and Data Streams; Sound/Audio, Images 6
TO and Graphics, Video and Animation
MULTIMEDIA
2. DATA Optical Storage Media; Computer Technology, 8
COMPRESSION Multimedia Operating Systems
3. NETWORKING Multimedia Communication Systems; Database 6
SYSTEMS Systems
4. MULTIMEDIA Multimedia Documents, Hypertext and MHEG 4
ARCHITECTURE
5. USER Synchronization, Abstractions for Programming; 8
INTERFACES Multimedia Application Development
6. VIRTUAL Future Directions 4
REALITY
Text Books:
1.Multimedia Computing Communications & Applications by Ralf Steinmetz, Klara Nahrstedt , ,
Pearson
2. Principles of Multimedia by Parekh Ranjan,Tata McGraw-Hill
Reference Books:
1. Multimedia Systems, By John E Koegal, Buford, IIBK
2. Virtual Reality Systems, John Vince, ACM Press
3. Computer Networks, A S Tanenbaum, Fourth Edition.
4. http://pet.ece.iisc.ernet.in/course/E0262/
Course Title: ELECTIVE III (Departmental)
Course Code: CS1318E03(II) Class Hours/week 3
Total hrs. of 36
GAME THEORY classes

1. INTRODUCTION What is Game Theory? Definition of Games. 5
Actions, Strategies, Preferences, Payoffs.
Examples; Strategic Form Games - Strategic
form games and examples: Prisoner's Dilemma,
Bach or Stravinsky, Matching Pennies, Tragedy
of Commons, Braess Paradox.
2. DOMINANT Strongly dominant strategies, weakly dominant 4
STRATEGY strategies, dominant strategy equilibrium;
EQUILIBRIUM
Examples of Prisoners Dilemma and Vickrey
Auction.
3. PURE STRATEGY Best response strategies; Notion of pure 8
NASH Strategy Nash equilibrium. Examples of Nash
EQUILIBRIUM
Equilibrium. Examples of Nash Equilibrium in
popular games. Symmetric Games and
Symmetric Equilibria; Mixed Strategy Nash
Equilibrium- Randomization of Actions, Mixed
strategy Nash equilibrium, Necessary and
sufficient conditions for a Nash equilibrium.
Examples of mixed strategy Nash equilibrium.
Computing mixed strategy Nash equilibria.
Related algorithmic issues.
4. TWO PLAYER Max-minimization and Minmaximization. 8
ZEROSUM GAMES Saddle points. Nash equilibrium in matrix
(MATRIX GAMES)
games. Mini-max theorem. Solution via linear
programming. Examples; Extensive games with
Perfect Information- Extensive games,
Strategies and outcomes, Nash equilibrium,
Subgame perfect equilibrium, finding subgame
perfect equilibria using backward induction.
Allowing for simultaneous moves. Examples.
5. BAYESIAN GAMES Motivational Examples. Definition of a 3
Bayesian Game and Bayesian Nash Equilibrium
and examples.
6. MECHANISM Social choice functions. Direct and indirect 4
DESIGN mechanisms. Notion of incentive compatibility.
Revelation theorem. Properties of social choice
functions, Gibbard Satterthwaite theorem.
Quasi-linear utilities. Vickrey auction. Clarke
mechanisms. Groves mechanisms. Examples of
VCG (Vickrey-Clarke-Groves) mechanisms.
Different types of auctions. Revenue
equivalence theorem.
7. COOPERATIVE Correlated strategies and correlated equilibrium. 4
GAME THEORY The two person Nash bargaining problem and
its solution with examples. Games in
characteristic
form and examples.The Core of a characteristic
form game. Shapley value and its implications.
Examples.
Text Books:
1. Martin Osborne. An Introduction to Game Theory. Oxford University Press
2. Y. Narahari. Essentials of Game Theory and Mechanism Design. IISc Press
Reference Books:
1 .Phiip D. Straffin, Jr. Game Theory and Strategy. The Mathematical Association of America
2 .Ken Binmore, Fun and Games: A Text On Game Theory, D. C. Heath & Company
Course Title: ELECTIVE IV (Departmental)
Course Code: CS1318E04 (I) Class Hours/week 3
Total hrs. of 36
CLOUD COMPUTING classes

1. INTRODUCTION Shift from distributed computing to cloud 6
computing; principles and characteristics of
cloud computing- IaaS, PaaS, SaaS; service
oriented computing and cloud environment
2. CLOUD Client systems, Networks, server systems and 8
COMPUTING security from services perspectives; Accessing
TECHNOLOGY
the cloud with platforms and applications;
cloud storage
3. WORKING WITH Infrastructure as a Service conceptual model 8
CLOUD and working Platform as a Service
conceptual model and functionalities Software
as a Service conceptual model and working
Technologies and Trends in Service
provisioning with clouds
4. USING CLOUD Cloud collaborative applications and services 8
SERVICES technology, applications and case studies
with calendars, schedulers and event
management; cloud applications in project
management.
5. CASE STUDIES Microsoft Azure, Google App Engine and 6
Open source clouds- Open-Nebula and
Eucalyptus , Current trends and research
Text Books:
1. Anthony T.Velte, Toby J.Velte and Robert E, Cloud Computing A Practical Approach, TMH
2 .Michael Miller, Cloud Computing Web based Applications, Pearson Publishing
Course Title: ELECTIVE IV (Departmental)
Course Code: CS1318E04 (II) Class Hours/week 3
Total hrs. of 36
classes
WEB SERVICE AND SERVICE ORIENTED
ARCHITECTURE

1. INTRODUCTION Service Oriented Enterprise Service 8
Oriented Architecture (SOA) SOA and
Web Services Multi-Channel Access
Business Process management Extended
Web Services Specifications Overview of
SOA Concepts Key Service
Characteristics Technical Benefits
Business Benefits
2. SOA AND WEB Web Services Platform Service Contracts 12
SERVICES Service- Level Data Model Service
Discovery Service-Level Security
Service-Level Interaction patterns Atomic
Services and Composite Services Proxies
and Skeletons Communication
Integration Overview XML and Web
Services - .NET and J2EE Interoperability
Service-Enabling Legacy Systems
Enterprise Service Bus Pattern
3. MULTI-CHANNEL Business Benefits SOA for Multi Channel 8
ACCESS Access Tiers Business Process
Management Concepts BPM, SOA and
Web Services WSBPEL Web Services
Composition
4. JAVA WEB SERVICES JAX APIs JAXP JAX-RPC JAXM 4
JAXR JAXB
5. METADATA Web Services Security Advanced 4
MANAGEMENT Messaging Transaction Management
Text Books:
1. Eric Newcomer, Greg Lomow, Understanding SOA with Web Services, Pearson Education
2. James McGovern, Sameer Tyagi, Michael E Stevens, Sunil Mathew, Java Web Services
Architecture
Reference Books:
1. Thomas Erl, Service Oriented Architecture, Pearson Education
2. Frank Cohen, FastSOA, Elsevier
Course Title: ELECTIVE V (Open)
Course Code: **1318E05 (I) Class Hours/week 3
Total hrs. of 36
ENGINEERING SYSTEM ANALYSIS AND DESIGN classes

1. INTRODUCTION Systems, Elements of a system, Types of 9
systems, Subsystems, Super systems, Need for
system analysis and design, CASE tools for
analysis and its limitations.
2. SYSTEM ANALYSIS Methods of system analysis, system 9
development life cycle, structured approach,
development tools, data base and networking
techniques.
3. SYSTEM DESIGN Design technologies, Design principles, Design 9
tools and methodologies, feasibility survey,
conversion and testing tools, design
management and maintenance tools .
4. OBJECT ORIENTED Introduction, Object modeling, Dynamic 9
ANALYSIS AND modeling, functional modelling, UML
DESIGN
diagrams and tools.
Text Books:
1. Perry Edwards, System analysis and design, McGraw Hill international edition
2. Len Fertuck, System analysis and design with CASE tools, Wm C. Brown Publishers
Reference Books:
1. Er. V.K. Jain, System analysis and design , Dreamtech Press.
2. Kenneth E.Kendall and Julie E.Kendall, System analysis and design, Prentice Hall, India
Course Code: **1318E05 (II) Class Hours/week 3
Total hrs. of 36
PLANNING FOR SUSTAINABLE DEVELOPMENT classes

1. SUSTAINABLE Explains and critically evaluates the 12
DEVELOPMENT concept of sustainable development,
Environmental degradation and poverty
Sustainable development: its main
principles, the evolution of ideas about
sustainability, strategies for promoting
sustainable development, resistances to the
concept, and some alternative approaches.
Examine some important current issues
and areas of debate in relation to
sustainable development.
2. INNOVATION FOR Environmental management and 6
SUSTAINABLE innovation strategies.
DEVELOPMENT
3. SOCIETAL Institutional theory. 6
TRANSFORMATIONS
4. GOVERNANCE FOR Policy responses to environmental 6
SUSTAINABLE degradation.
DEVELOPMENT
5. CAPACITY Research methods 6
DEVELOPMENT FOR
INNOVATION
1. Harris, J.M. (2204) Basic Principles for Sustainable Development, Global Development and
Environment Institute, working paper 00-04. Available at:
http://ase.tufts.edu/gdae/publications/Working_Papers/Sustainable%20Development.PDF
2. Robinson, J. (2004) Squaring the circle? Some thoughts on the idea of sustainable development
Ecological Economics 48(4): 369-384.
3. Hjorth, P. and A. Bagheri Navigating towards Sustainable Development: A System Dynamics
Approach, Futures 38: 74-92.
4. Mog, J.M. Struggling with Sustainability A Comparative Framework for Evaluating Sustainable
Development Programs, World Development 32(12): 21392160. IISD Commentary on the OECD's
Draft Principles for International Investor Participation in Infrastructure (PDF 68 kb)
5. Arundel, A., R. Kemp, and S. Parto Indicators for Environmental Innovation: What and How to
Measure, forthcoming in International Handbook on Environment and Technology Management
(ETM), edited by D. Annandale, J. Phillimore and D. Marinova, Cheltenham, Edward Elgar.
6. Douthwaite, B. Enabling Innovation. A practical guide to understanding and fostering innovation,
London, Zed Books.
Additional References:
http://www.sustainability.com/developing-value/definitions.asp
Course Code: **1318E05 (III) Class Hours/week 3
Total hrs. of 36
DISASTER MANAGEMENT classes

1. INTRODUCTION Concepts and definitions: disaster, hazard, 4
vulnerability, risk, capacity, impact,
prevention, mitigation).
2. DISASTERS Disasters classification; natural disasters 10
(floods, draught, cyclones, volcanoes,
earthquakes, tsunami, landslides, coastal
erosion, soil erosion, forest fires etc.);
manmade disasters (industrial pollution,
artificial flooding in urban areas, nuclear
radiation, chemical spills etc); hazard and
vulnerability profile of India, mountain and
coastal areas, ecological fragility.
3. DISASTER IMPACTS Disaster impacts (environmental, physical, 6
social, ecological, economical, political, etc.);
health, psycho-social issues; demographic
aspects (gender, age, special needs); hazard
locations; global and national disaster trends;
climate change and urban disasters.
4. DISASTER RISK Disaster management cycle its phases; 12
REDUCTION (DRR) prevention, mitigation, preparedness, relief
and recovery; structural and non structural
measures; risk analysis, vulnerability and
capacity assessment; early warning systems,
Post-disaster environmental response (water,
sanitation, food safety, waste management,
disease control); Roles and responsibilities of
government, community, local institutions,
NGOs and other stakeholders; Policies and
legislation for disaster risk reduction, DRR
programmes in India and the activities of
National Disaster Management Authority.
5. DISASTERS, Factors affecting vulnerability such as impact 4
ENVIRONMENT of developmental projects and environmental
AND
DEVELOPMENT
modifications (including of dams, land-use
changes, urbanization etc.), sustainable and
environmental friendly recovery;
reconstruction and development methods.
1. http://ndma.gov.in/ (Home page of National Disaster Management Authority).
2. http://www.ndmindia.nic.in/ (National Disaster management in India, Ministry of Home Affairs).
3. Pradeep Sahni, Disaster Risk Reduction in South Asia, Prentice Hall.
4. Singh B.K., Handbook of Disaster Management: techniques & Guidelines, Rajat Publication.
PRACTICALS
Course Title: COMPILER DESIGN LAB
L-T-P-C: 0-0-2-1
EXPERIMENT
NO
1 Familiarization with LEX by writing simple specifications for 4
tokens such as, identifiers, numbers, comments in C/C++, etc.
All LEX specifications must be compiled and executed with
appropriate inputs.
2 LEX specification for tokens of the small language 2
3 Complete the specifications in Experiment No. 2 above to make 2
a complete lexical analyzer.
4 Familiarization with YACC by writing simple specifications for 4
desk calculator, variable declarations in C (only numbers and
array). All YACC specifications must be compiled and executed
with appropriate inputs. Note that this exercise also requires
LEX specifications of the tokens involved.
5 YACC specifications for the syntax of the small language 2
6 Adding error recovery to Experiment No. 5 above to make a 2
complete parser.
7 S-attributed specification of the semantics of the small language 6
to be incorporated into YACC specifications produced in
Experiment No. 6 above.
8 Adding semantic error recovery to the semantic analyzer in 2
Experiment No. 7 above to make a complete
semantic analyzer.
9 Intermediate code generation for the constructs of the small 6
language to be incorporated into the semantic analyzer of
Experiment No. 8 above.
Total 30
L=0
T=0
CS131816 PROJECT P = 10
C=5
L=0
T=0
CS131821 COMPREHENSIVE VIVA P=0
C=4

BTech CSE

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

BTech CSE

Uploaded by

Copyright:

Available Formats

ASSAM SCIENCE AND TECHNOLOGY UNIVERSITY

Course Structure and Syllabus

(For All Branches)

Sub Hrs/week Credits

Subject Code : MA131101

Multi variable calculus:

Maxima and Minima:

II INTEGRAL Single variable calculus: 20

sin cos sin

Areas under Plane curves (Cartesian & Polar),

Multi variable calculus:

Solution Of Simultaneous Equations.

1. Advanced Engineering Mathematics by Erwin Kreyszig (Wiley Eastern Ltd.).

L-T-P: 2-2-0 Credit 3

Text Books and Reference Books:

Modules Topics Course Content Hours

Modules Topics Course Content Hours

V INSTRUMENTS: Classification of instruments; essentials of indicating type 8

VI ELECTRONICS: Diode as a rectifier- half wave and full wave rectifier 8

L-T-P: 2-0-0 Credit 2

Modules Topics Course Content Hours

VI FUNCTIONS: Type Of Functions, Function Definition ,Function 4

VII INFORMATION Elements of Information Technology. 2

Subject: English Communication And Technical Report Writing

Modules Topics Course Content Hours

Module Topic Hours

1 Introduction: Drawing Instruments, Handling & Use 2

Scales: Representative fraction, Types of scales-Plain scales, Diagonal scales, Comparative

Experiment Experiment Title Hours

IV Determination of ratio of E.M.F of two cells using Potentiometer. 1

V Determination of Youngs Modulus using Searles Apparatus 1

VI Determination of Powers of Given lenses using an Optical Bench 2

Subject Code : CY131113

Experiment Experiment Title Hours

Experiment Experiment Title Hours

Experiment Experiment Title Hours

II (a) Write a program to find area of : 1

V (a) Write a program to add the digits of a 4 digit number. 1

VI (a) Write a program to display an array of elements. 1

VII (a) Write a program to find the greatest among 10 numbers. 1

IX (a) Write a program to find the smallest among 10 numbers. 1

SYLLABUS FOR SECOND SEMESTER BTech

4 ET131204 Basic Electrical & Electronics Engineering - II 2 2 0 3

5 ME131205 Basic Mechanical Engineering 3 0 0 3

6 CE131206 Basic Civil Engineering 3 0 0 3

II ACOUSTICS AND Weber Fechner law, Units of Loudness- Decibel, Phone, 9

Properties of ultrasonic waves, Ultrasonic production

Optical fibre- Principles and Structure, Propagation of light in

IV QUANTUM De-Broglie hypothesis (concept of group velocity and phase 6

Physical Properties of Conventional Superconductors

VI POINT DEFECTS IN Point defects in metals and ionic crystals (vacancy, 4

Speciality polymers: silicones, conducting polymers and

VIII NANOMATERIAL Introduction, differences from other materials, Properties 2

XI LUBRICANTS Mechanism of lubrication, liquid lubricants and their 2

ii) Working principle of DC motor, back emf, speed 3

ii) Losses and efficiency of a transformer, 2

iii) Condition for maximum efficiency, all - day efficiency, 3

III HEAT TRANSFER Definition of heat transfer, modes of heat transfer,

IV FLUID MECHANICS Properties of Fluids: Pressure or intensity of Pressure, 3

VI SIMPLE MACHINES Definition of machine, Velocity ratio, Mechanical 6

POWER Simple systems of belt drives and gear drives.

VII MANUFACTURING Description of Die casting, forging and welding 4

Text Book/ Reference Books: