1

DISTRIBUTION OF CREDIT POINTS (CP)

a) Course Title and Credit Points

(i) Every course shall have a short representative course title and a number including the total credit points
as well as reference to prerequisite course, if any.
(ii) There shall be at least 15 credit points in each Semester
b) Contact Hours
(i) Theoretical Courses: There shall be at least one (1) lecture-hour for each credit point in a week for
each theoretical course; and there shall be two academic task hours for each credit point (for open
academic discussion) in the whole Semester. Therefore, in total, there shall be at least 15 (fifteen)
contact hours for each theoretical credit point throughout the Semester.
(ii) Practical Course: In case of practical/lab course, there shall be at least two (02) contact hours for each
credit point in a week. As a result, there shall be at least 30 contact hours for each credit point
practical/lab course throughout the Semester.
c) Viva-voce: Students shall appear in viva-voce examination (oral examination) having specified number
of credit points at the end of 2nd Semester, final examination in each academic year (i.e. at the end of
2nd, 4th, 6th, and 8th Semester).

EVALUATION SYSTEM
a) Theoretical Course: Each theoretical course offered should be composed of either 50 or 100 marks.
The proportion of the total marks of a particular course shall be distributed as follows:
Continuous Assessment 50%
Semester-final Examinations 50%
Total = 100%
b) Continuous Assessment: Marks allocated for continuous assessment shall be distributed as follows:
(i) Internal Evaluation:
Mid-Semester examination 50%
In-course/Class test/Quiz (minimum two) 20%
Assignment and Presentation/Class Performance 20%
(ii) Class Attendance 10%
-------------------
Total=100%
For example, total marks of the ‘Continuous Assessment’ of a three credit course carrying 100 marks (50%
= 50) shall be distributed as follows:
(i) Internal Evaluation:
Mid-Semester examination 25 marks
In-course/Class test/Quiz (minimum two) 10 mark
Assignment and Presentation/Class Performance 10 marks
(ii) Class Attendance 05 marks
Total= 50 marks.

c) Class Attendance: The marks allocated for class attendance shall be given as following proportions:
Attendance Marks Example
90% and above 100% 5 out of 5
 2

>= 85% but < 90% 80% 4 out of 5

>= 80% but < 85% 60% 3 out of 5
>= 75% but < 80% 40% 2 out of 5
>= 60% but < 75% 20% 1 out of 5

d) Class-Attendance Requirements to Appear in the Semester Final Examination: A Student shall be

allowed to appear at the Semester final examination as a regular student if her/his class attendance is at
least 75% on an average and a student shall not be allowed to appear at the examination if her/his class
attendance is below 60% of the total classes held in a Semester. The Chairman of the Department may
recommend the students having percentage of attendance between 60% to less then 75%. However, in
such case a student shall have to pay fees as determined by the University authority for not fulfilling the
above conditions.
Letter Grade and Grade Point
Total marks obtained in each teaching course, oral (viva-voce) examination and practical
courses shall be converted into LG (Letter Grade) and GP (Grade Point) as follows:

Numerical Grade Letter Grade Grade Interpretation

Point
80% and above A+ (A plus) 4.00 Outstanding
75% to less than A (A regular) 3.75 Excellent
80%
70% to less than A- (A minus) 3.50 Very Good
75%
65% to less than B+ (B plus) 3.25 Good
70%
60% to less than B (B regular) 3.00 Satisfactory
65%
55% to less than B- (B minus) 2.75 Below Satisfactory
60%
50% to less than C+ (C plus) 2.50 Average
55%
45% to less than C (C regular) 2.25 Pass
50%
40% to less than D ---- 2.00 Poor
45%
Less than 40% F ---- 0.00 Fail
I Incomplete - Didn’t complete the degreee
W Withdrawn - Withdrawn

DISTRIBUTION OF COURSES

First Year : Semester I

Course Code Course Title Hours/Week Theory+Lab Credits Prerequisite(s)

CSE 1101 Computer Fundamentals 3+0 3.00

CSE 1102 Computer Fundamentals Lab 0+3 1.50
EEE 1121 Electrical Circuit Analysis 3+0 3.00
EEE 1122 Electrical Circuit Analysis Lab 0+3 1.50
 3

ENG 1123 Professional English 3+0 3.00

MAT 1124 Linear Algebra & Geometry 3+0 3.00
PHY 1125 Physics 3+0 3.00
PHY 1126 Physics Lab 0+3 1.50
Total 15 + 9 = 24 19.50

First Year: Semester II

Hours/week
Course Code Course Title Credits Prerequisite(s)
Theory+lab
Structured Programming
CSE 1201 3+0 3.00
Language
Structured Programming
CSE 1202 0+3 1.50
Language Lab
EEE 1221 Basic Electronics 3+0 3.00 Electrical Circuit Analysis
Electrical Circuit Analysis
EEE 1222 Basic Electronics Lab 0+3 1.50
Lab
Differential and Integral
MAT 1223 3+0 3.00
Calculus
CHM 1224 Chemistry 3+0 3.00
CHM 1225 Chemistry Lab 0+3 1.50
EGD 1226 Engineering Drawing Lab 0+3 1.50
CSE 1203 Viva-Voce 1.00
Total 12 + 12 = 24 19.00

Second Year: Semester I

Hours/Week
Course Code Course Title Credits Prerequisite(s)
Theory+Lab
CSE 2101 Discrete Mathematics 3+0 3.00

CSE 2102 Digital Logic Design 3+0 3.00 Basic Electronics

Digital Logic Design and
CSE 2103 0+3 1.50 Basic Electronics Lab
VHDL Lab
Object Oriented Structured Programming
CSE 2104 3+0 3.00
Programming Language Language
Object Oriented Structured Programming
CSE 2105 0+3 1.50
Programming Language Lab Language Lab
Ordinary Differential
MAT 2121 3+0 3.00 Calculus
Equations
Basic Statistics &
STA 2122 3+0 3.00
Probability
BUS 2123 Introduction to Business 2+0 2.00
Total 17 + 6 = 23 20.00
 4

Second Year : Semester II

Hours/Week
Course Code Course Title Credits Prerequisite(s)
Theory+Lab
Structured Programming
CSE 2201 Data Structures 3+0 3.00
Language
Structured Programming
CSE 2202 Data Structures Lab 0+3 1.50
Language Lab
Database Management
CSE 2203 3+0 3.00
Systems
Database Management
CSE 2204 0+3 1.50
Systems Lab
Microprocessor &
CSE 2205 3+0 3.00
Assembly Language
Microprocessor &
CSE 2206 0+3 1.50
Assembly Language Lab
Complex Variable, Laplace
MAT 2221 Transformation & Fourier 3+0 3.00
Analysis
ECO 2222 Economics 2+0 2.00
SOC 2223 Sociology 2+0 2.00
CSE 2207 Viva-Voce 1.00
Total 16 + 9 = 25 21.50

Third Year : Semester I

Hours/Week
Course Code Course Title Credits Prerequisite(s)
Theory+Lab
Operating System and
CSE 3101 3+0 3.00
Systems Programming
Operating System and
CSE 3102 0+3 1.50
Systems Programming Lab
Data and
CSE 3103 3+0 3.00
Telecommunications
Data and
CSE 3104 0+3 1.50
Telecommunications Lab
Microprocessor &
CSE 3105 Computer Architecture 3+0 3.00
Assembly Language
Microprocessor &
CSE 3106 Computer Architecture Lab 0+3 1.50
Assembly Language Lab
Computer Peripherals and Microprocessor &
CSE 3107 3+0 3.00
Interfacing Assembly Language
Computer Peripherals and Microprocessor &
CSE 3108 0+3 1.50
Interfacing Lab Assembly Language Lab
MAT 3121 Numerical Analysis 3+0 3.00
Total 15 + 12 = 27 21.00
 5

Third Year : Semester II

Hours/Week
Course Code Course Title Credits Prerequisite(s)
Theory+Lab
CSE 3201 Distributed Systems 3+0 3.00
CSE 3202 Distributed Systems Lab 0+3 1.50
CSE 3203 Software Engineering 3+0 3.00
Data and
CSE 3204 Computer Networking 3+0 3.00
Telecommunications

Data and
CSE 3205 Computer Networking Lab 0+ 3 1.50
Telecommunications Lab

Algorithm Design &

CSE 3206 3+0 3.00 Data Structures
Analysis
Algorithm Design &
CSE 3207 0+3 1.50 Data Structures Lab
Analysis Lab
Theory of Computation &
CSE 3208 3+0 3.00
Automata

GEN 3221 Bangladesh Studies 2+0 2.00

CSE 3209 Viva-Voce 1.00

Total 17 + 9 = 26 22.50

Fourth Year : Semester I

Hours/Week
Course Code Course Title Credits Prerequisite(s)
Theory+Lab
Project/Thesis/Industry
CSE 4101 2.00
Attachment (Part I)
CSE 4102 Artificial Intelligence 3+0 3.00
CSE 4103 Artificial Intelligence Lab 0+3 1.50
Theory of Computation &
CSE 4104 Compiler Design 3+0 3.00
Automata
CSE 4105 Compiler Design Lab 0+3 1.50
CSE 4106 Project Management 3+0 3.00
Computer Graphics &
CSE 4107 3+0 3.00
Multimedia
Computer Graphics &
CSE 4108 0+3 1.50
Multimedia Lab
CSE 4109 Option I 3+0 3.00
CSE 4110 Option I Lab 0+3 1.50
Total 15 + 12 = 27 23.00

N.B. The topic selected in the course CSE 4101 is to be continued in the course CSE 4201
 6

Fourth Year : Semester II

Hours/Week
Course Code Course Title Credits Prerequisite(s)
Theory+Lab
Project/Thesis/Industry
CSE 4201 3.00
Attachment (Part II)*
E-Commerce and Web
CSE 4202 3+0 3.00
Engineering

E-Commerce and Web

CSE 4203 0+3 1.50
Engineering Lab

Linear Algebra & Geometry

+ Complex Variable,
CSE 4204 Digital Image Processing 3+0 3.00
Laplace Transformation &
Fourier Series

CSE 4205 Digital Image Processing Lab 0+3 1.50

CSE 4206 Simulation and Modeling 3+0 3.00

CSE 4207 Simulation and Modeling Lab 0+3 1.50

CSE 4208 Option II 3+0 3.00

CSE 4209 Option II Lab 0+3 1.50
CSE 4210 Viva Voce 1.00
Total 12 + 12 = 24 22.00

N.B. This is the continuation of the course CSE 4101.

Optional : Option I
Hours/Week
Course Code Course Title Credits Prerequisite(s)
Theory+Lab
CSE 4109 Wireless Networks 3+0 3.00
CSE 4110 Wireless Networks Lab 0+3 1.50
Calculus + Ordinary
Differential Equations +
CSE 4109 Digital Signal Processing 3+0 3.00 Complex Variable,
Laplace Transformation
& Fourier Series
CSE 4110 Digital Signal Processing Lab 0+3 1.50
Contemporary Course on
CSE 4109 3+0 3.00
Computer Science
Contemporary Course on
CSE 4110 0+3 1.50
Computer Science Lab
CSE 4109 Parallel Processing 3+0 3.00
CSE 4110 Parallel Processing Lab 0+3 1.50
Database Management
CSE 4109 Advanced Database System 3+0 3.00
Systems
Advanced Database System Database Management
CSE 4110 0+3 1.50 Systems Lab
Lab
 7

Optional : Option II

Hours/Week
Course Code Course Title Credits Prerequisite(s)
Theory+Lab

Electromagnetism, Optics &

CSE 4208 Fiber Optics 3+0 3.00
Modern Physics
CSE 4209 Fiber Optics Lab 0+3 1.50
CSE 4208 Pattern Recognition 3+0 3.00
CSE 4209 Pattern Recognition Lab 0+3 1.50

CSE 4208 Neural Network 3+0 3.00 Artificial Intelligence

CSE 4209 Neural Network Lab 0+3 1.50 Artificial Intelligence Lab

Contemporary Course on
CSE 4208 3+0 3.00
Computer Science
Contemporary Course on
CSE 4209 0+3 1.50
Computer Science Lab

CSE 4208 VLSI Design 3+0 3.00 Digital Logic Design

CSE 4209 VLSI Design Lab 0+3 1.50


DETAIL DESCRIPTION OF THE COURSES

Course Code: CSE 1101

Course Title: Computer Fundamentals
3 Hours/Week, 3.0 Credits
Computer Basis: History and development of Computer, Computer types. Scope of computer, Impact of
computers on society and technology. Specification of Computers: CPU types, Speed variation, Memory,
type size Cache, Storage Media, Hard disk, Floppy disk, CD ROM , DVD. Printer: Dot matrix Laser, ink
jet. Computer Hardware: Digital electronics, CPU. Memory: RAM, ROM, Mass storage devices, I/O
Devices : Different Peripherals Idea of System Software and Application Software: Function of
Operating System, Discussion on different types of Operating System : DOS/Windows, Mac
UNIX/XENIX etc. Concept of formal Language: Different type of Computer Languages: Assembly,
FORTRAN, Pascal C and C++, Artificial Language etc. Purpose and Scope of Application Packages:
Essential General purpose packages : Word Processing, Spreadsheet analysis, Database etc. Networking:
Different types of networks, network topologies, communication media. Internet: Internet services, e-mail,
e-commerce. Multimedia: Basics of audio, video & graphics. Maintenance and Troubleshooting: Virus,
Power Surge Protection, Disk maintenance. Future Trends: Super Computer, Distributed Computer,
Parallel Processing, Information Super Highway, Multi-media and virtual reality.
Books Recommended:

1. P. Norton : Introduction to Computer

2. Subramanian : Introduction to Computers
3. Warford : Computer Science
4. L. Rosch : Hardware Bible, Braddy Publishing, Indianapolis
5. P. Norton : Inside the PC
8

Course Code: CSE 1102

Course Title: Computer Fundamentals Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 1101
Course Code: EEE 1121
Course Title: Electrical Circuit Analysis
3 Hours/Week, 3.0 Credits
Circuit Models: Characteristics & applications of linear circuit elements, Ideal and non-ideal sources :
Voltage and Current. Series, Parallel and Compound circuit analysis. Loading effects: Ammeter and
Voltmeter. Circuit Theorem and DC analysis: Voltage and current divider rule, Kirchhoff’s Laws.
Superposition Theorem. Thevenin’s Theorem. Norton’s Theorem. Maximum Power Transfer Theorem.
Reciprocity Theorem. Mesh and Nodal analysis. Matrix form of Mesh and Nodal equations. Use of
Cramer’s rule. Bridge networks. T-Pie and Pie-T Conversions. AC Theory and Frequency domain
analysis: Properties of Sinusoidal and square wave forms. Phasor diagram. The j operator. Resonance
phenomena. Fourier method of Wave form analysis. Laplace Transformation and its application to Linear
circuit. Networks: Two port network and its parameters. Equivalent circuits. Analog filter design:
Elementary filter theory, Characteristics impedance. Low pass filter, High pass filter, Band-pass filter,
Band-elimination filter. Transients and Time Domain analysis: Transient in RC, RL, and RLC circuits.
Pulse repetition rate and duty cycle. Average value. RC response to a square wave inputs. Coupled
Circuits and Transformers: Self and mutual inductance, Analysis of coupled circuits. Coefficient of
coupling, Linear transformer, Ideal Transformer.
Books Recommended:

1. A. Mottershead : Electronic Devices and Circuits

2. M. Nahvi and J. Edminister : Electrical Circuits (Schaum’s Outlines)
3. Milman and Helkias : Integrated Electronics
4. B. L. Theraja : Basic Electronics

Course Code: EEE 1122

Course Title: Electrical Circuit Analysis Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 1103

Course Code: ENG 1123

Course Title: Professional English
3 Hours/Week, 3.0 credits
Grammar: Verbs: Kinds and usage, Nouns: Formation, Usage, Countable and Uncountable Nouns.
Tenses. Use of Articles, Use of Prepositions, Verb-Ing, Inifintive, Passive Structure, Subject-Verb
Agreement, Phrases and Clauses
Reading Skills: Strategies of Reading – Skilling, Skanning, Predicting, Inferring. Understanding
Denotative and Connotative Meanings of Words, Comprehension and Summary. Writing Skills:
Paragraph: Paragraph Structure, Topic Sentence, Paragraph Unity and Coherence, Cohesive Devices;
Amplification, Precise Writing, Essay: Essay Structure, Thesis Sentence, Organizing and Developing an
Essay. Essay Forms: Expository, Argumentative. Letters: Informal and Formal Letters; Memo Writing.
Speaking Skills: Notions and Functions: Speaking with Correct Pronunciation, Intonation and accent.
Coherence and Fluency: Making Presentation

Course Code: CSE 1124

Course Title: Linear Algebra & Geometry
3 Hours/Week, 3.0 Credits

Linear Algebra: Vector spaces, linear transformations, change of basis. Inner products, orthogonalization,
reflections and QR factorizations. Eigenvalues and eigenvectors, diagonalization. Jordan forms and
functions of matrices. Applications to linear systems of differential equations, quadratics, rotations.
9

Geometry: Change of axes. Transformation of Co-ordinates, Pair of straight lines,The general equation of
second degree (reduction to standard forms, identifications, properties and tracing of conics.), Circle,
System of circles,Parabola,ellipse and hyperbola.
Books Recommended:

1. Askwith,R.E.H. : Analytic Geometry with Conic Sections

2. Loney, S.L. : Analytic Coordinate geometry
3. Rahman Abd Bhattacharjee : Two and Three dimensional geometry

Course Code: PHY 1125

Course Title: physics
3 Hours/week, 3.0 credits

Modern Physics: Michelson Morley’s experiment, Galilean transformation, special theory of relativity,
Lorentz transformation, relative velocity, length contraction, time dilation, mass-energy relation, Photo-
electric effect, Compton effect, de-Broglie wave, Bohr’s atom model, radioactive decay, half-life, mean-
life, isotopes, nuclear binding energy, alpha beta & gamma decay.

Structure of Matter: Crystalline & non-crystalline solids, single crystal and polycrystal solids, unit cell,
crystal systems, co-ordinations number, crystal planes and directions, sodium chloride and CsCl structure,
packing factor, Miller indices, relation between interplanar spacing and Miller indices, Braggs Law,
methods of determination of interplanar spacing from diffraction patterns; Defects in solids: point defects,
line defects; Bonds in solids, interatomic distances, calculation of cohesive & bonding energy; Introduction
to band theory: distinction between metal, semiconductor and insulator.

Electricity and Magnetism: Electric charge, Coulomb’s law, electric field: calculation of the electric field
strength, E, a dipole in an electric field, electric flux and Gauss’s law, electric potential V, relation between
E and V, electric potential energy; Capacitors: capacitance, dielectric-en atomic view, Ampere’s law,
Faraday’s law, Lenz’s law, self inductance and mutual inductance; Magnetic properties of matter: magneto
motive force, magnetic field intensity, permeability, susceptibility, classification of magnetic materials,
magnetization curve.

Heat & Thermodynamics: Principle of temperature measurements: platinum resistance thermometer,

thermo-electric thermometer, pyrometer; Kinetic theory of gases: Maxwells distribution of molecular
speeds, mean free path, equipartition of energy, Brownian motion, Van-der-Waals equation of state, review
of the First Law of thermodynamics and its application, reversible and irreversible processes, Second Law
of thermodynamics, Carnot cycle; Efficiency of heat engines, Carnots Theorem, entropy and disorder,
thermodynamic functions, Maxwell relations, Clausius-Clapeyron Equation, Gibbs Phase Rule, Third Law
of thermodynamics.

Waves & Oscillations: Differential equation of a simple harmonic oscillator, total energy and average
energy, combination of simple harmonic oscillations, Lissajous figures, spring-mass system, calculation of
time period of torsional pendulum, damped oscillation, determination of damping co-efficient, forced
oscillation, resonance, two-body oscillations, Reduced mass, differential equation of a progressive wave,
power and intensity of wave motion, stationary wave, group velocity and phase velocity, architectural
acoustics, reverberation and Sabines formula.

Physical Optics: Theories of light; Interference of light, Youngs double slit experiment; Fresnel Bi-prism,
interference at wedge shaped films, Diffraction of light: Fresnel and Fraunhoffer diffraction, diffraction by
single slit, diffraction from a circular aperture, resolving power of optical instruments, diffraction at double
10

slit & N-slits-diffraction grating; Polarization: production and analysis of polarized light, Brewsters law,
Malus law, Polarization by double refraction, retardation plates, Nicol prism, optical activity, polarimeters,
polaroid.

Course Code: PHY 1126

Course Title: Physics Lab
3 Hours/week, 1.50 credits
Laboratory work base on PHY 1125

Course Code: CSE 1201

Course Title: Structured Programming Language
3 Hours/Week, 3.0 credits

Programming Language : Basic concepts, Overview of programming languages, Problem Solving

Techniques and Data Flow Diagram. C-Language: Overview, mid-level language, compiled vs interpreted
language, variables, constants, data types, storage class specifiers, arithmetic expressions, assignment
statements, and operators.. Program Control Statements: conditional statements, loops and nested loops,
break, continue, label and goto, Array, Pointers: Pointer basics, pointer variables, operators, expressions,
pointer and arrays, pointer and dynamic memory allocation; Functions: argument, formal parameters,
function calling, call-by-value, call-by-reference, recursion and recursive functions, pointer to function,
Structures: arrays of structures, structure pointer, structure as function arguments, structure within
structure, Bit-field, Union, Enumeration; Files and I/O: streams and files, file access methods, ANSI-C
file system, UNIX file routines; Advanced features: Standard and Library
Reference Language : C
Books Recommended:

1. H. Schieldt T : The Completer Reference C

2. Dietel & Dietels : C – How to Program

3. E. Balagurusami : ANSI C
4. Dennis M. Ritchie : C Programming Language
5. Herbert Schildt : Teach Yourself C

Course Code: CSE 1202

Course Title: Structured Programming Language Lab
3Hours/Week, 1.5 Credits
Laboratory works based on CSE 1201

Course Code: EEE 1221

Course Title: Basic Electronics
3 Hours/Week, 3.0 Credits

Theory of Semiconductors: Electronic structure of the elements. Energy levels. Energy band theory of
crystals. Energy band diagram of Insulator, semiconductor & metal. Free electron theory. Band structure of
Si & Ge. Intrinsic & extrinsic semiconductor. Fermi level. Concept of hole. Carrier densities. generation &
11

recombination of excess carriers. carrier lifetime. carrier movement by diffusion and drift. Continuity
equation.
Semiconductor Diodes: The pn junction. Junction biasing conditions. Effect of asymmetric doping. I-V
characteristics. Dynamic and static resistance of diode, Types of diode. Half wave and Full wave
rectification & filtering. Clipping and clamping circuits. Voltage regulators. voltage doubler and voltage
multiplier.
Bipolar Transistors: Junction transistors. npn & pnp transistors. Principle of transistor action. Potential
distribution through a transistor, Transistor current components, emitter efficiency, transport factor, large
signal current gain. Transistor as an amplifier. Transistor characteristics in CB, CE & CC configurations.
Transistor hybrid model. Large signal, dc and small signal CE values of current gain. Concept of load lines.
Dynamic transfer curves of Ge & Si transistor. Transistor switching times.
BJT Biasing and Basic amplifier circuit: The operating point. Capacitive coupling. The static and
dynamic load lines. Bias stability. Thermal instability. Stability factor S. Analysis of different types of
biasing circuits. Stabilization against variations in VBE and beta for the self bias ckt. Bias-compensation and
Thermal runaway. Classification of amplifier.
Field Effect Transistors: JFET: construction, operation, static characteristics, small signal model and
parameters. MOSFET: different types, operation, characteristics curves. DC biasing of depletion and
enhancement type MOSFET. Different biasing conditions of JFET.
Oscillators: Feedback and circuit requirements for oscillation. Nyquist's criterion. Sinusoidal oscillators.
Barkhausen criterion. Phase-shift oscillators, resonant circuit oscillators, Colpitt's and Hartley's Oscillator,
Wein bridge oscillator, crystal oscillator. Frequency stability.
Operational Amplifier: Linear applications of OPAMPs, gain, input and output impedances, active filters,
frequency response and noise.

Books Recommended:

1. A. Mottershead : Electronic Devices and Circuits

2. Milman and Helkias : Integrated Electronics
3. B. L. Theraja : Basic Electronics
4. B. Grob : Basic Electronics
5. V. K. Mehta : Principles of Electronics
6. Illiot : Microelectronics Fabrication Technology
7. J. D. Rider : Network Lines and Fields
8. B. L. Theraja : Basic Electricity and Magnetism

Course Code: EEE 1222

Course Title: Basic Electronics Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 1203
Course Code: MAT 1223
Course Title: Differential and Integral Calculus
3 Hours/week, 3.0 credits
Differential Calculus:
Functions: Domain, Range, Inverse Functions and Graphs of Functions. Limits: Definitions, Basic Limit
Theorem (without proof), Limits at infinity, Infinity Limits. Continuity: Definition and Properties.
Differentiation: Definition, Techniques of Differentiation, Higher Order Derivatives. Expansions of
12

Functions: Rolle’s Theorem, Mean Value Theorem, Tailor’s Theorem, Maxima-Minima: Maxima and
Minima of Functions, Problems involving Maxima and Minima.
Integral Calculus:
Definitions and Fundamental Properties, Anti-derivatives. Indefinite Integrals: Techniques of
Integrations, Integration of Rational, Trigonometric, Hyperbolic and Transactional Functions, Definite
Integrals: Integrations as the Limit of a Sum, Fundamental Theorems of Integral Calculus, Evaluation of
the Definite Integrals, Double and Triple Integrals, Evaluation of Surface, Area and volumes.
Books Recommended:

1. F. Ayres : Calculus
2. Das and Mukherjee : Differential Calculus

3. Das and Mukherjee : Integral Calculus

4. Edwards : Differential Calculus

Course Code: CHM 1224

Course Title: Chemistry
3 Hours/Week, 3.0 credits

Atomic structure, quantum numbers, electronic configuration, periodic table; Properties and uses of noble
gases; Different types of chemical bonds and their properties; Molecular structure of compounds;
Thermodynamics of Chemical Processes: Concept of entropy, Chemical potential, Equilibrium
conditions for closed systems, Phase and reaction equilibria, Maxwell relations, Real gas and real solution.
Electrochemical Systems: Electrochemical cells and EMF, Applications of EMF measurements:
Thermodynamic data, activity coefficients, solubility product and pH, corrosion.
Kinetics of Chemical Reactions: Reversible, consecutive and parallel reactions, Steady state
approximation, Chain reactions, Photochemical kinetics.
Bonding Models in Inorganic Chemistry: Molecular orbital theory, Valence-bond theory, Crystal field
theory. Fundamentals of Microwave, IR and UV-VIS Spectroscopy: Basic concepts of spectroscopy,
Selection rule, Determination of molecular structure.
Coordination Chemistry: Coordination numbers, Chelate effect, Coordination complexes and application,
Bio-inorganic chemistry: Metal ions in Biological systems, environmental aspects of Metals, NOx, CO,
CO2.
Organic Reaction Mechanism: Mechanisms of selected organic, bio-organic, polymerization and catalytic
reactions. Stereochemistry of Carbon Compounds: Selected Organic Compounds: Natural products and
Biomolecules (Amino acids/nucleic acids/proteins).
Course Code: 1225
Course Title: Chemistry Lab
3 Hours/week, 1.5 credits
Laboratory work based on Course CHM 1225
Course Code: EGD 1226
Course Title: Engineering Drawing Lab
3 Hours/week, 1.50 credits
Drawing Equipment & Use of Instruments, Drafting Techniques & Standards, Types of Lines and Usage,
Tolerances (linear, angular, bilateral, unilateral) ,Symbols, border, title block ,revision block,
Dimensioning, Lettering, Sheet Planning, Orthographic Projections, 1st Angle & 3rd Angle Projections,
Projection of Points, Projection of Lines, Solids of Revolution, Isometric, Auxiliary, Development &
Sectional Views, Introduction of Computer Aided Drawing Tools, Use of AutoCAD as Drafting Tool,
13

Drafting Techniques & Standards, Co-ordinate Systems, Basic Commands, Orthographic Drawings,
Dimensioning Drawing, Sectional Drawing, Isometric Projection, Assembly Drawing.
Course Code: CSE 1203
Course Title: Viva Voce
1.0 Credit

Course Code: CSE 2101

Course Title: Discrete Mathematics
3 Hours/Week, 3.0 CreditsS

Propositional and Predicate Calculus: Statements and Compound statements, conjunction, disjunction,
negation propositions and truth-tables, tautologies and contradictions logical equivalence, algebra of
propositions, conditionals, and bi-conditionals, logical implications, theory of inference of prepositional
calculus, predicates, statement functions, variables and quantifiers predicate formulas, free and bound
variables, theory of inference for the predicate calculus. Theory of Sets: Basic concepts sets and elements,
Venn diagram set operations algebra of sets duality classes of sets, power set. Introduction to Principles of
mathematical induction. Functions: Basic concept, graph of functions, one to one, onto functions.
Relations: Basic concepts, pictorial representation of relations inverse relations, compositor relations,
partitions properties of relations. Counting: Functions and counting, permutations and combinations, sum
rule principle, product rule principle, permutation, combination, pigeonhole principle, inclusion-exclusion
principle, Pascal triangle, ordered and unordered partitions. Posets and Lattice: Partial ordered sets,
lattices, bounded lattices distributed lattices.Integers. Definition and proof by induction. Functions on finite
sets. Divisibility. Eucildean algorithm. Exclusion inclusion principle. Euler's Function. Binomial
coefficients. Designs, t-designs. Permutation. Modular arithmetic and Euler's theorem. Examples and use of
recurrence relations and generating functions in counting problems. Graphs, Trees, Digraphs, Networks
and flows: graphs and their isomorphism. Valencey. Paths and cycles. Trees. Colouring the vertices of a
graph. Counting the leaves on a rooted tree. Spanning trees and the MST Problems. Bipartite graphs and
matching problems. Transversals for families of finite sets. Diagraphs, Networks and flows. The max -flow
and min-cut theorem. Finite Geometries: Cryptology and coding theory, Review of the theory of the finite
fields.
Books Recommended:

1. K.H. Rosen : Discrete Mathematics and its Applicationsl

2. Lipschutz : Theory and Problems of Discrete Mathematics,

Schaum's outline series.
3. C.L. Liu : Elements of Discrete Mathematics, 2nd Ed, McGraw-
Hill, 1985.
4. Sharon Ross : Discrete Mathematical Structure.

Course Code: CSE 2102

Course Title: Digital Logic Design
3 Hours/Week, 3.0 Credits

Boolean Algebra and Logic Gates: Introductory concepts, number systems and codes, Boolean constants
and variables, truth tables. Basic logic functions, Different types of logic gates Boolean expressions;
implementing circuits from Boolean expressions. Boolean theorems, DeMorgan's theorem, Universal gates;
Logic Minimization: Sum-of-product and product-of-sum forms. Simplifying logic circuits, algebraic
simplification, the Karnaugh map method, Quine-McCluskey design method. Combinational Logic.
Circuit design using NAND or NOR gates only. Alternate logic-gate representations. Designing
combinatorial logic circuits. Exclusive OR and NOR circuits. Logic circuits with multiple outputs.
Designing without a truth table. Flip-flop and Latch: NOR and NAND latch, SR, JK, D and T flip-flops.
The D latch. Master-slave FF. Flipflop applications. FF synchronization. Data storage and transfer.
Frequency division and counting, Schmit trigger. Arithmetic circuits: Adder circuits. Carry propagation,
carry look-ahead adder. IC parallel adder. The 2's complement addition and subtraction system. The BCD
adder. Binary multiplier. Counters and Registers: Asynchronous cuonter: Ripple counters, counters with
mod numbers<2n, IC asynchronous counters, asynchronous down counter, propagation delay in ripple
counters. Synchronous down and up/down counters. Decoding a counter. Decoding glitches. Cascading
14

BCD counters. Shift-registers. Counter applications: frequency counter, digital clock. IC registers. MSI
Logic Circuits: Decoders, BCD-to-decimal decoders, BCD-to-7-segment decoder/drivers. Encoders.
Multiplexers and multiplexer applications. Demultiplexers. Integrated-Circuit Logic Families: Digital IC
terminologies, TTL logic family, TTL series characteristics, open-collector TTL, tristate TTL, ECL family,
MOS digital ICs, MOSFET, CMOS characteristics, CMOS tristate logic, TTL-CMOS-TTL interfacing.
Memory Devices: Memory terminology, general memory operation, semiconductor memory technologies,
different types of ROMs, semiconductor RAMs, static and dynamic RAMs, Magnetic bubble memory,
CCD memory, FPGA Concept.

Books Recommended:

1. R.J. Tocci : Digital Systems, 5th edition, PHI

2. D.V. Hall : Digital Circuits and Systems, McGraw-Hill, 1989
3. F.P. Prosser and D.E. Einkel : The Art of Digital Design, Prentice-Hall
4. V. K. Jain : Switching Theory and Digital Electronics
5. Moris Manno : Digital Logic and Computer Design

Course Code: CSE 2103

Course Title: Digital Logic Design Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 2101

Course Code: CSE 2104

Course Title: Object Oriented Programming Language
3 Hours/Week, 3.0 Credits

Object Oriented programming overview: Definitions of Object Oriented programming, Object Oriented
vs. procedural programming, An Introduction to Java: The Java programming environment, JDK
overview, Fundamental programming structures in Java: primitive data types, control structure,
methods, method abstraction and arrays, Objects and Classes: Fields, methods, and constructors, Access
control, initialization and clean up, garbage collection, Inheritance: extending classes, subclass, super
class, inheritance hierarchy, Overriding methods, dynamic method binding, abstract class, final method,
final class, Packages, Interfaces & Inner classes, Java Collection Classes, Exception and exception
handling: Exception handling fundamentals, Exception types, chained exception, creating own exception
subclasses. I/O: I/O stream hierarchy, binary streams and character streams, GUI and Event Driven
Programming: Introduction to Swing and AWT, Component and Container and Layout, Multithreading:
Thread basics, Creating a thread, Thread priorities, synchronization, Inter-thread communication,
suspending, resuming and stopping threads, string class, Run time type identification, Java applets:
interaction between the Web browser and applets, and conversion between applications and applets,
Object-oriented Design Principles and examples: Introduction to object-oriented design Principles and
examples Introduction to object-oriented design; Introduction to C++, Object Oriented Features in C++
Reference Languages: Java and C++

Books Recommended:

1. H. Schildt : Java 2 Complete Reference, Jessey

2. H. M. Deitel P. J. Deitel : Java How To Program
3. Sun Press : Core Java(Vol-1&2)
4. Ivor Horton : Beginning Java 2, Wrox
5. N. Barkakati : Object Oriented Programming with C++
15

6. Herbert Schildt : Teach Yourself C ++

Course Code: CSE 2105
Course Title: Object Oriented Programming Language Lab
3 Hours/Week 1.5 Credits
Laboratory works based on CSE 2103
Course Code: MAT 2121
Course Title: Ordinary Differential Equation
3 Hours/Week, 3.0 Credits
Definition and classifications of differential equations, problems and solutions. Formation of differential
equation. Existence and uniqueness theorem. Separable and homogeneous equations. Exact equation.
Inegreting factor. Equations made exact by integrating factor. First order linear equation. Bernoulli
equation. Homogeneous differential equations of the 2nd and higher order with constant coefficient.
Reduction of order. Linear non-homogeneous differential equations, with constant coefficients- Method of
undetermined coefficients. Method of variation of parameters, Operator method. Linear equation with
variable coefficients: Cauchy-Euler equation, Legendre equation, Operational factoring, and exact
equation. Series solutions of linear differential equations. Taylor series method, Frobenius method.
Books Recommended:

1. D.L.Ross : Differential Equations

2. Frank Ayres : Differential Equations

3. B.D Sharma : Differential Equations

Course Code: STA 2122

Course Title: Basic Statistics and Probability
3 Hours/Week, 3.0 Credits
Introduction to Statistics: Variables and Constants, Data Collection & Presentation, Central Tendency
and its measurement, Measurement of Distribution, Mean, Median, Mode, Variance, Skewness, Curtosis,
Correlation, Regression.
Probability: Definition of probability, Scope of probability, classical, axiomatic, empirical and subjective
probability, Difference between probability and possibility. Laws of Bayes theorem and its uses and
importance in statistics. Random variables, Discrete and continuous random variables, discrete and
continuous random possibility, Density function, Probability density function, Function of random variable
and its distribution, Joint distribution, Marginal and conditional distributions independent of random
variables, Mathematical expectations of sum and product of random variables, Moment and Comulant.
Binomial, Poisson and Normal distributions.
Books Recommended:

1. A. J. B. Anderson : Interpreting Data. Chapman and Hall, London

2. H. Cramer : The Elements of Probability Theory. Wiley, N. Y
3. P. Hoel, : Introductory Statistics, Wiley and Sons, N. Y.
4. D. V. Lindley : Introduction to Probability and Statistics. Vol-1 C. U. P
5. S. Lipschutz : Probability, McGraw-Hill, N. Y.
6. Mosteller, Rourke and Thomas : Probability With Statistical Applications. 2nd Ed. Add
7. F. L. Wolf : Elements of Probability, and Statistics McGraw-Hill, N
8. T. H. Wonnacot and R. J. Wonnacot : Introductory Statistics, 3rd Ed. Wiley and Sons. N. Y.
16

9. G. U. Yule, and M. G. Kendall : An Introduction to the Theory of Statistics. Fourteenth

London

Course Code: BUS 2123=(CSE 1205 /CSE 2208)

Course Title: Introduction to Business
2 Hours/Week, 2.0 Credits
Introduction to Accounting: Meaning , Functions and Sub fields of Accounting. Accounting Cycle.
Accounting Principles- Concepts & Conventions. Accounting Equation. Types of Accounts . Rules of
Debit & Credit. Accounting Process: Analyzing transactions. Recording transactions . Posting to ledger.
Balancing the accounts. Preparing Trial Balance. Finalization of Accounts: Rectifying the erroneous
entries. Journalizing adjustment entries. Preparing Adjusted Trial Balance. Passing the closing or transfer
entries. Preparing financial statements. Financial Statement Analysis-I: Categorization of ratios. Various
types of ratios including Liquidity Ratios, Solvency Ratios, Structure Ratios, Leverage Ratios, and
Coverage Ratios. Significance of these ratios. Financial Statement Analysis-II: Various other types of
ratios including Profitability Ratios, Expense Ratios, Turnover Ratios, and Market Sensitivity Ratios.
Decomposition of ROA and ROE with Dupont Analysis. Limitations of ratio analysis. Reconciliation of
Books: What actually is Bank Reconciliation? Reasons for reconciling the books. Procedure or steps for
reconciliation. Petty Cash Accounting: Petty cash and its purpose. Writing petty cash book. Types of petty
cash book. Control over petty cash. Inventory Accounting: The basics of inventory. Inventory accounting
systems. Inventory valuation methods. Accounting for inventory. Inventory and its impact on financial
statements. Depreciation Accounting: The basic concepts of depreciation. The methods of depreciation.
Accounting for depreciation. Depreciation and its impact on cash flow and income tax.
JOB AIDS: Disclosures. Measurement Tools. Case Study.
Calculators in Financial Accounting: Cash Flow Calculator. Corporate Performance – Dashboard. Ratio
Calculator. Petty Cash Calculator. Bank Reconciliation Calculator.
Books Recommended:
1. Jerry J. Weygandt, Donald E. Kieso, : Accounting Principles
paul D. Kimmel
2. K. R. Subramanyam and John Wild : Financial Statement
Analysis
3. Aileen Ormiston and Lyn M. Fraser : Understanding Financial Statement.

CSE 2208 / Management

Management basics: What is management, the histry of management, types of manager, manager
qualities. Management responsibilities, mamagement tasks and functons. The business environment –
defining the organization, organization structure, the quality organization, organizational changes,
Centralization and Decentralization, managing changes. Management obligations, social and professional
responsibilities, government regulations.
Strategy formulation: The elements of sreategy, the strategy formulation process, alliances and
acquisitions, strategy formulation tools and techniques, plan implementation. Decision making – the nature
of management decision, the decision making process, decision making techniques. Information
presentation and reporting – Principle, Type of Reports, Presentation on Modes, Function repoting system,
Information and its uses, Characteristics of information, flow of information. Management information
system (MIS) and its uses, Computer based MIS: Advantages & Disadvantages. Brief introduction to
project planning and management and its tools/techniques-Gantt chart, PERT/CPM. Human Resources
management: Concepts & functions, job analysis and role description. Management skills, Leadership
and motivation: The nature of leadership, leadership theories, delegation, motivation and motivation
theories, need of motivation, motivation techniques. Team building – Defining and effective team, selecting
team members, building teams, training and development. Effective communication – The communication
17

process, presentation skills. Tools and techniques. Time management: The importance of time,
characteristics of management tasks, determining time elements, time management techniques.
Books Recommended:
1. Harold Koontz and Heinz Weihrich : Management
2. prof. Dr. Moinul and Abdul : Fundamental of
Qwal Khan Management
3. Ricky W Griffin : Management
4. Samuel C Certo : Modern Management

Management basics:
Course Code: CSE 2201
Course Title: Data Structures
3 Hours/Week, 3.0 Credits

Array: Insertion, Deletion, Matrix representation of arrays, Multidimensional arrays, Pointers arrays,
Record structures, Representation of records in memory; parallel arrays. Sparse matrices. Usefulness of
sparse matrices. Stack: Push and Pop operations. Arithmetic expression: polish notation implementation
using stack Queue: Insert and Delete operations. Double ended queue, Priority queue. Recursion: Direct
and indirect recursion, Simulation of recursion, Depth of recursion, Removal of recursion. Towers of Hanoi
using recursion. Linked lists: One way and two way linked lists. Traversing, Searching, Insertion and
Deletion operations. Concept of algorithm analysis. Sorting: Bubble sort, Quick sort Merge sort, Selection
sort, Inserting sort, Radix sort, Shell sort. Searching: Linear searching, Binary searching. Binary Trees.
Binary Search Trees: Traversing (inorder, preorder, postorder). Insertion and deletion operations in
Binary search trees. Threaded Binary Tree, Application of trees. Set representation, decision trees, game
trees and counting binary trees. B-tree and basic operations on B-tree. Binomial tree and binomial heap,
operation on binomial heaps. Fibonacci heaps and operations. Heap: Max Heap, Min Heap, Heap sort,
Heap applications. Huffman codes and compression algorithm. Disjoint set and operations and disjoint set
forests forests. Red black tree and operations. General trees. Graphs: Graph representation, Adjacency
matrix, Path matrix, Linked representation. Shortest paths: Warshall 's algorithm. Operations on graphs:
Insertion of an edge or a node. Deletion of an edge or a node. Traversing a graph: Breadth first, Depth first.
Posets: Topological sorting. Spanning trees and connected component. Finding minimum cost spanning
tree using Prim's algorithm. Critical paths, enumerating all paths. Symbol tables: Static and dynamic tree
tables. Hashing: Hash function and overflow handling, Open hashing ( Separate chaining) Close hashing
(Open addressing), Linear probing, Quadratic probing, Double hashing. Files: File queries sequential
organization. Indexing Technique: Cylinder + surface indexing, Hash indexes trees, Indexing-Btrees, Tree
indexing.

Books Recommended:

1. E. Horowitz and S. Sahni : Fundamentals of Data Structures, Galgotia, 1985.

2. Lipschutz : Data Structures, Schaum's Outline Series, 1987.
3. Robert L. Kruse : Data Structures and Program Design, 3rd Edition.

4. Niklaus Wirth : Algorithms-Data Structures-Programs, Prentice Hall of India, 1992.

Course Code: CSE 2202

Course Title: Data Structures Lab
3 Hours/Week, 1.50 Credits

Laboratory work based on course CSE 2201

Course Code: CSE 2203
Course Title: Data Base Management System
3 Hours/Week, 3.0 Credits
18

Introduction to database system: Overview, File system VS database system, Advantage of a DBMS,
Describing and storing in a DBMS, Queries in a DBMS, Transaction management, Structure of a DBMS,
Applications. The Entity-Relationship model: Basic concept, Design issue, Mapping constraints, Keys,
E-R diagram, Weak entity sets, Extended E-R features, Design of an E-R database schema, Reduction of a
E-R schema to tables. Relational model: Structure of relational databases, The relational algebra, The
tuple relational calculus, the domain relational calculus, relational algebra operations, modification of the
database, introduction to views. Structured Query Language: The form of a basic SQL query, UNION,
INTERSECTION and EXCEPT, nested queries, aggregate operations, null values, embedded SQL, cursors,
dynamic SQL, ODBC and JDBC, triggers and active database. Relational database design: Pitfalls in
relational database design, Decomposition, normalization using functional dependencies, normalization
using multivalued dependencies, normalization using join dependencies, domain-key normal form. Object
oriented and object relational databases: The object oriented data model, nested relations, complex types
and object orientation, querying with complex types, creation of complex values and objects. Indexing and
Hashing: Index definition, Benefits of using index, Various type Index, Index Structure, B-tree structure of
index, Clustered index, Non clustered index, Index design, Index in sql, Hash file organization, Hash
function, Hash indices, Dynamic hashing, hashing queries,
Storage and file structure: Overview physical storage media, file organization, organization of records in
files, data-dictionary storage. Query processing: Catalog information for cost estimation, measuring of
query cost, different operations, evaluation of expressions, choice of evaluation plans. Transactions:
Transaction concept; Transaction atomicity, consistency, isolation, durability; Transaction state,
Implementation of atomicity and durability, Concurrent Execution, Serializability, Recoverability,
Recoverable schedules, Implementation of isolation, Transaction definition in SQL.
Concurrency control: Lock based protocols, timestamp based protocols, validation based protocols,
multiple granularity, multiversion schemes, deadlock handling, insert and delete operations. Recovery
system: Failure classification, storage structure, recovery and atomicity, log-based recovery, shadow
paging, recovery with concurrent transactions, buffer management, advanced recovery techniques.
Database system architecture: Centralized systems, client-server systems, parallel systems, distributed
systems, network types. An introduction to parallel and distributed database: Oracle: introduction to
SQL plus, PL/SQL, triggers, forms, reports, query, procedures, and project builder.Case study: MS SQL
server, My SQL server.

Books Recommended:

1. A. Silberschatz : Database System Concepts.

2. R. Ramakrishnan : Database Management System
3. James Martin : Principles of Database Management.
4. Uillman : Database Management systems.

Course Code: CSE 2204

Course Title: Data Base Management System Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 2201

Course Code: CSE 2205

Course Title: Microprocessor & Assembly Language
3 Hours/Week, 3.0 Credits

Microprocessors: Concept of microprocessor; Evolution of microprocessors; Internal architecture of Intel

8086/8088 microprocessors: Instruction set and Instruction format, System connections, timing, bus
activities, address decoding, Interrupt structure, interrupt types, interrupt applications, DMA, minimum
mode, maximum mode operations, I/O operation, Microprocessor interface ICs, Microprocessor based
system design, cache memories, Coprocessor, Multiprocessor system; Intel 80286, 80386, 80486
processors: memory management scheme, Protection mechanism, modes; Advanced microprocessors.
19

Programming in assembly language: Assembly Language syntax, Program Data, Variables, Named
constants, program structure, memory models, Input/Output instruction, Running program, Program
Segment Prefix. The processor status and the Flag register, Overflow condition, Debugging a program.
Flow control instructions, Conditional jumps, signed versus unsigned jumps, High-level language
structures, branching and looping structures. Logic, Shift and Rotate Instruction, some common
applications of Shift and Rotate operations. The Stack and Introduction to Procedures, Basic stack
operations, Procedures Declaration, Communication between procedures, calling a procedures.
Multiplication and Division Instructions, signed versus unsigned multiplications, Divide overflow, Signed
Extension of Dividend. Arrays and related addressing modes, DUP operator, Register indirect modes,
Based and Indexed Addressing modes, PTR operator, Based-indexed addressing modes, XLAt instruction.
The string instructions, director flag, Moving a string, storing a string, Loading a string, scanning a string,
comparing strings, substring operation. Text display and keyboard programming, the monitor, Video
adapter and display modes, text mode programming, keyboard buffer and operation, scan codes.

Books Recommended:

1. D. V. Hall : Microprocessors and Interfacing, McGraw-Hill, 1987.

2. Rafiquzzaman : Microprocessor and Microcomputer based system design
3. Ytha, Marut : Assembly language programming and organization of the IBM PC
4. Y. Liu and G. A. Gibson : Microcomputer Systems: 8086/8088 Family, Prentice-Hall, 1991.
5. Artwick : Microcomputer Interfacing
6. Ramesh Goanker : Microcomputer Interfacing
7. James E. Powell : Designing User Interfaces

Course Code: CSE 2206

Course Title: Microprocessor & Assembly Language Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 2203

Course Code: MAT 2221

Course Title: Complex Variable, Laplace Transformation & Fourier Analysis
3 Hours/Week, 3.0 Credits

Complex Variable: Basic Theorems of Complex Analysis, Infinite series, Winding Numbers of Closed
Paths in the Complex Plane, Path Integrals in the Complex Plane, Holomorphic Functions, Cauchy's
Theorem, Basic Properties of Holomorphic Functions, Applications of Cauchy's Residue Theorem, Elliptic
Functions. Laplace Transformation: Formal definition, Probability theory, Bilateral Laplace transform,
Inverse Laplace transform, Region of convergence, Properties and theorems ,Proof of the Laplace
transform of a function's derivative, Relationship to other transforms , Laplace–Stieltjes transform, Fourier
transform, Mellin transform, Z-transform, Borel transform, Fundamental relationships, s-Domain
equivalent circuits and impedances, Application of the Laplace transformation: Solving a differential
equation, Deriving the complex impedance for a capacitor, Method of partial fraction expansion, Mixing
sines, cosines, and exponentials, Phase delay. Fourier Transformation: Definition, Properties of the
Fourier transform, Basic properties, Uniform continuity and the Riemann–Lebesgue lemma, The Plancherel
theorem and Parseval's theorem, Poisson summation formula, Convolution theorem, Cross-correlation
theorem, Eigenfunctions, Fourier transform on Euclidean space , Uncertainty principle, Spherical
harmonics, Restriction problems, Generalizations :Fourier transform on other function spaces, Fourier–
Stieltjes transform, Tempered distributions, Locally compact abelian groups, Locally compact Hausdorff
20

space, Non-abelian groups, Alternatives, Applications: Analysis of differential equations, NMR, FT-IR and
MRI, Domain and range of the Fourier transform.

Books Recommended:

1. Murray Spiegel, Seymour Lipschutz, John Schiller : Complex Variables

2. James Ward Brown : Complex Variables & Applications
3. Wilbur R. LePage : Complex Variables and the Laplace Transfor
4. David V. Widder : The Laplace Transform
5. M. W. McLachlan : Complex Variable Theory and Transform Ca
Applications
Course Code: ECO 2222
Course Title: Economics
2 Hours/Week 2.0 Credits
Introductory concepts: Definition of Economics; Economics and engineering; Principles of economics.
Micro-Economics: Introduction to various economic system capitalist, command and mixed economy;
Fundamental economic problems and the mechanism through which these problems are solved; Theory of
demand and supply and their elasticiies; Theory of consumer behavior; Cardinal and ordinal approaches of
utility analysis; Price determination; Nature of an economic theory; Applicability of economic theories to
the problems of developing countries; Indifference curve techniques; Theory of production, production
function, types of productivity; Rational region of production of an engineering firm; Concepts of market
and structure; Cost analysis and cost function; Small scale production and large scale production;
Optimization; Theory of distribution; Use of derivative in economics: maximization and minimization of
economic function, relationship among total, marginal and average concepts. Macro-economics: Savings;
investment, employment; National income analysis; Monetary policy; Fiscal policy and trade policy with
reference to Bangladesh; Economics of development and planning.

Books Recommended:

1. K. K. Dewett : Modern Economic Theory

2. H.L Ahuja : Advanced Economic Theory
3. Asimakopulas : Introduction to Economic Theory
4. Koutsoyannis : A Modern Microeconomics

Course Code: SOC 2223

Course Title: Sociology
2 Hours/Week 2.0 Credits
Sociology: Definition, nature and scope of Sociology - Sociology and other Social Sciences –Sociological
Perspectives and explanation of Social issues.
Social evolution: stages in the evolution of human civilization;
Culture: definition, characteristics, culture contents (material and non-material), cultural lag, culture and
civilization;
Industrial revolution: the growth of capitalism, features and social consequences, socialism;
Social stratification: main types of social stratification slavery-caste and social class and status, social
stratification and social mobility;
Work: Meaning and experience of work: Postindustrial society- Post-Fordism and the Flexible Firm.
21

Development - Conceptions of and approaches to development - The Roles of State and the Market in the
Development
Globalization: The concept of globalization - globalization and the nation state - Development and
globalization in post colonial times.
Technology Transfer: The Concept and Types of Technology Transfer-Dynamics of Technology
Transfer.
Technology Assessment: The Concept - Steps involved in Technology Assessment.
Environment: Sociological Perspectives on Environment - Environmental Tradition and values in ancient
Bangladesh.
Technological Problems and the Modern Society: Selected Case Studies - Electric Power Crisis,
Industrial and/or Environmental Disaster, or Nuclear Accident.
Some current social problem: crime, deviance, juvenile delinquency, youth unrest;
Society and Technology: Impact of Technology on the Society - A case study

Course Code: CSE 2207

Course Title: Viva Voce
3 Hours/Week 1.0 Credits

Course Code: CSE 3101

Course Title: Operating System and System Programming
3 Hours/Week, 3.0 Credits
Introduction: Evolution, goals and components of and OS. Process: Process management, process states
and state transition, process control blocks, Scheduling: job and process scheduling, scheduling levels,
objective and criteria, CPU scheduling algorithms, process co-ordination: critical section problems,
semaphores, language constructs, classical problems of process co-ordination, interprocess communication,
message and mailbox etc. I/O programming. Device management techniques. Interrupt processing. Parallel
processing. Deadlock: deadlock prevention, avoidance, detection and recovery. Memory management:
memory allocation schemes, paging and segmentation, virtual memory, page replacement strategies,
working sets, demand paging, thrashing. Secondary storage management: disk scheduling, RAID.File
management: file system functions, file organization, logical and physical file maps, tree structured file
systems, space allocation, file catalogues, file access control mechanisms, Distributed Systems: network
types, communication protocols, distributed file system, distributed coordination, operating systems
security. Time sharing and virtual machines. Main Features of MS-DOS, Windows-NT, VMS and VSE.
Distributed System. Unix O/S overview: system structure, user perspective, O/S services, Introduction to the
kernel and buffer cache, internal representation of files. Assembler-general Design procedure, Table
processing, Macro language and Microprocessor, Compiler, Loader, Linker, Translator Design, System call,
Remote procedure call, Interprocess communication , Unix socket, Multithreading.

Books Recommended:

1. Silberchaltz and Gagne : Operating Systems Concepts.

2. Tanenbaum : Operating Systems, Prentice-Hall, 1987.
22

3. Madnick and J. Donovon : Operating systems, McGraw-Hill, 1986.

4. M. MilenKovic : Operating System Concept and Design.
5. Donovan : Systems Programming, McGraw-Hill, 1987.
6. Maurice. J. Bach : The design of the Unix operating system
7. Y.P. Kanetkar : Unix Shell Programming
8. Terrence : Unix System Programming in C++

Course Code: CSE 3102

Course Title: Operating System and System Programming Lab
3 Hours/Week, 1.50 Credits
Laboratory work based on course CSE 3101
Course Code: CSE 3103
Course Title: Data and Telecommunications
3 Hours/Week, 3.0 Credits
Overview: Introduction to Data communications, OSI and TCP / IP layers, Addressing; Physical Layer:
Data and Signal Fundamentals, Analog and Digital Signals, Transmission Impairments, Data Rate Limits,
Performance; Data Transmission: Digital Encoding Techniques, Scrambling Techniques, Pulse Code
Modulation (PCM), Modulation, Transmission Modes (Parallel, Serial) Multiplexing: FDM, WDM, Time
Division Multiplexing; Transmission Media and Switching: Guided and Unguided Media Circuit-
Switched, Datagram and Virtual Circuit Networks, Switch Structure; Telephone and Cable Networks:
Dial-Up Modems, xDSL, Cable Networks (TV and Data), Satellite Networks; Error Detection and
Correction: Hamming Distance, CRC, CheckSum, Framing, Flow and Error Control; Data Link
Protocols: HDLC, PPP Ethernet and LAN Connecting Devices; Digital Integrated Services Networks:
X.25, Frame Relay, ISDN, ATM, SONET/SDH; Multiple Access: CSMA / CA, CSMA / CD Controlled
Access, Channelization; Security: Cryptography, Security; Special Topics: IPV 6, IPV4
Books Recommended:

1. Behrouz A. Forouzan : Data Communications and Networking

2. William Stallings : Data and Computer Communications
3. Wayne Tomasi : Introduction to Data Communications and Networkin
4. Gilbert Held : Understanding Data Communications
5. William J. Beyda : Data Communications: From Basics to Broadband
Richard D. Gitlin,Jeremiah F. Hayes and Stephen
6. : Data Communications Principles
B.einstein

Course Code: CSE 3104

Course Title: Data and Telecommunications Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 3101

Course Code: CSE 3105

Course Title: Computer Architecture
3 Hours/Week, 3.0 Credits

Introduction: Types of Computers, Processors, Primary and Secondary Memory, I/O Devices, Computer
Performance Measurement; Digital Logic Circuits and Components: The numbering systems, basic logic
gates, Combinational logic and the basic common digital circuits; decoders, multiplexers and the three-state
23

gates, The basic components of sequential digital circuits; the flip-flop. Register Transfer and
Microoperations: Register transfer and register transfer language, Bus and memory transfers, Arithmetic
microoperations, Logic microoperations, Shift microoperations, Arithmetic logic shift unit; Basic
Computer Organization and Design: Instruction codes and stored program organization, Direct and
indirect addresses, Computer registers and common bus system, Computer instruction set architecture and
instruction set completeness, Timing and control, Instruction execution and instruction cycle, Memory
reference instructions, Input / Output and I/O interrupts, Programming a computer: Machine language,
forming the rules of assembly language, translating to binary program, assembler, first pass, second pass,
program loops, programming arithmetic and logic operations, subroutines, I/O programming; coherence
Designing Microprogrammed Control Unit: Control memory, Address sequencing, conditional
branching, instruction mapping, microinstruction format, symbolic microinstructions, microprogram
sequencer; Designing Central Processing Unit: general register organization, stack organization,
instruction formats: three/two/one/zero–address instructions, RISC instructions, addressing modes, data
transfer and manipulation, program control, RISC & CISC computers, Computer Arithmetic: Addition
and subtraction, multiplication algorithms, Division algorithms, floating-point arithmetic, decimal
arithmetic unit and decimal arithmetic operations; Input-Output Organization: Peripheral devices,
Input/Output interface: I/O bus and interface modules, I/O vs. memory bus, Isolated vs. memory-mapped
I/O, Asynchronous data transfer, Modes of transfer, Priority interrupt, Direct Memory Access (DMA), I/O
Processor (IOP), Serial communication, Memory Organization: memory hierarchy, main memory
organization, auxiliary memory, associative memory, cache memory, virtual memory, memory
management hardware; Pipeline and Vector Processing: parallel processing, pipelining, arithmetic
pipeline, instruction pipeline, RISC pipeline, Vector processing, array processors; Multiprocessors:
characteristics of multiprocessors, multiprocessor interconnection structures, interprocessor arbitration,
interprocessor communication, cache

Books Recommended:

1. M. Mano : Computer System Architecture

2. J.P. Hayes : Computer Architecture and Organization, 2nd ed., McGraw-H
3. W. Stallings : Computer Organization and Architecture.
4. K. Hwang and F.A. Briggs : Computer Architecture and Parallel Processing, McGraw-Hill
5. V. Hamacher, Z. Vraesic and S Zakv : Computer Organization. 3rd ed., McGraw-Hill, 1988.

Course Code: CSE 3106

Course Title: Computer Architecture Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 3103

Course Code: 3107

Course Title: Computer Peripherals and Interfacing
3 Hours/Week 3.0 Credits
Fundamentals of Interfacing: I/O operations: Programmed 1/0, Interrupts and Direct memory access,
ports and peripheral adapters. Interrupts and Priority Interrupt Controller(8259A): organization, modes of
operation, DMA Controller( 8237): organization and operation, DRAM interfacing: Handshaking protocols
and Programmable Parallel I/O Prot (8255): organization and modes of operation, Keyboard and
Alphanumeric display interfacing, Keyboard and Display Controller (8279), Printer Interfacing and
Centronics. Analog Interfacing basics: D/A converter ckts, R-2R ladder; A/D converters: Parallel
Comparator A/D converter, Successive Approximation Converter, Dual Slope converters, Interfacing A/D
converters. Light and Temperature Sensors, Force and Pressure Transducers, Instrumentation amplifiers
using transducer bridge; Stepper motor interfacing. Computer buses and Interfacing standards: PCI and PCI
express, AGP, USB, SCSI and IEEE 488; Standard Communication Ports: Serial and Parallel ports.
Peripherals: Keyboards and Key switches, LCD monitors, Laser and Inkjet printers, Optical mouse,
Scanners, Other I/O devices: Bar Code, Magnetic Character and Optical Mark Readers; Sound card and
MIDI standard.
Books Recommended:
24

1. Rafiquzzaman : Microprocessor and Microcomputer based system design

2. D. V. Hall : Microprocessors and Interfacing, McGraw-Hill, 1987.
3. Y. Liu and G. A. Gibson : Microcomputer Systems: 8086/8088 Family, Prentice-Hall, 1991.
4. Artwick : Microcomputer Interfacing
5. Ramesh Goanker : Microcomputer Interfacing
6. James E. Powell : Designing User Interfaces

Course Code: 3108

Course Title: Computer Interfacing Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 3105

Course Code: MAT 3121

Course Title: NUMERICAL ANALYSIS
3 Hours/Week, 3.0 Credits

Numerical analysis: Errors in numerical calculations. Error : Definitions, sources, examples. Propagation
of Error. A general error formula. Root finding : The bisection method and the iteration method, the
method of false position. Newton-raphson method. Methods of approximation theory : Polynomial
interpolation: Lagrange form, divided formula for interpolation. Solution of systems of Linear equations:
Gaussian elimination. The pivoting strategy, Iteration method solution of tridiagonal systems. Numerical
solution of ordinary differential equations: Euler's method (including modified form), Rnge-Kutta
method. Numerical Integration : Trapezoidal method. Simpson's method. Weddle's method; Eigen value
problems for matrices, Use of computer to implement projects in numerical methods.
Books Recommended:

1. Cheny & Kinkaid : Numerical Mathematical Analysis.

2. Jain & Iyenger : Numerical Method.
3. Sastry, S. S. : Introductory Methods of Numerical Analysis.
4. Scarborough, J. B. : Numerical Mathematical Analysis.
5. Rajaraman, V. : Numerical Method.

Course Code: CSE 3201

Course Title: Distributed Systems
3 Hours/Week, 3.0 Credits

Introduction: Introduction to Distributed systems-examples of distributed systems, challenges-

architectural models- fundamental models - Introduction to interprocess communications-external data
representation and marshalling- client server communication-group communication – Case study: IPC in
UNIX; Distributed Objects and File System: Introduction - Communication between distributed objects -
Remote procedure call - Events and notifications - Java RMI case Study - Introduction to DFS - File
service architecture - Sun network file system - Introduction to Name Services- Name services and DNS -
Directory and directory services; Distributed Operating System Support: The operating system layer –
Protection - Process and threads - Communication and invocation - Operating system architecture -
Introduction to time and global states - Clocks, Events and Process states - Synchronizing physical clocks -
Logical time and logical clocks - Global states - Distributed debugging – Distributed mutual exclusion.
25

Transaction and concurrency control: Transactions – Nested transaction – Locks - Optimistic

concurrency control - Timestamp ordering - Comparison of methods for concurrency control - Introduction
to distributed transactions - Flat and nested distributed transactions - Atomic commit protocols -
Concurrency control in distributed transactions - Distributed deadlocks - Transaction recovery; Security
and Replication: Overview of security techniques - Cryptographic algorithms – Digital signatures -
Cryptography pragmatics – Replication - System model and group communications – Fault tolerant
services – Highly available services – Transactions with replicated data

Books Recommended:

1. G. Coulouris, J. Dollimore, T. Kindberg : Distributed Systems Concepts and Design

2. Sape Mullender : Distributed Systems
3. Andrew S. Tanenbaum and Maarten Van Steen : Distributed Systems: Principles and Paradigms

Course Code: CSE 3202

Course Title: Distributed Systems Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 3201

Course Code: CSE 3203

Course Title: Software Engineering
3 Hours/Week, 3.0 Credits

The product, the process, managing software projects, project management concepts, software myths,
software process models. Software process and project metrics. size-oriented metrics and function oriented
metrics. Software project estimation. Risk management, software risk vs problem. Risk assessment
RMMM. Scheduling, Degree of rigor. Software quality assurance, cost of quality. Formal technical
reviews. Statistical quality assurance. Analysis modeling, requirement analysis, FAST. Data modeling,
DFD, Behavioral modeling, Data dictionary. Software architecture. Design concepts and principle. Design
methods. Software testing, write-box testing, black-box testing, basic-path testing, control-structure testing,
alpha-testing, beta-testing. Object oriented concepts, operation, methods, and services, messages
encapsulation, inheritance, and polymorphism, OOP metrics and estimation, object-oriented analysis, OO
design and testing. Formal method. CASE STUDY: Rational rose, Visual modeler (UML) etc.

Books Recommended:

1. Roger S. Pressman : Software Engineering, A practitioner's Approach, Second Edition

2. Richard Fairley : Software Engineering Concepts.
3. Robert N. Charette : Software Engineering Environments

Course Code: CSE 3204

Course Title: Computer Networking
3 Hours/Week, 3.0 Credits

Introduction: Introduction to Computer Networks, Network Goals and Applications, Network

Architectures, OSI reference model, TCP/IP model and terminology, Connectionless and Connection
Oriented services, Network Topologies, Service primitives, Public Networks, The ARPANET, SNA.
26

Physical Layer: Circuit switching and Packet switching, X-25 protocol, ISDN, BISDN, Frame relay and
Cell relay. Medium Access Sublayer: Static and Dynamic channel allocation in LAN and MAN, LAN
Cables, Pure and slotted ALOHA, Persistent and Non persistent CSMA, CSMA with collision detection
and collision free protocols, IEEE standard 802.3 and Ethernet, Token Bus and Token Ring, FDDI,
Fibernet II, DATAKIT. Data Link Layer: Service provided to the network layer, Framing, Flow control,
Error detecting and Correcting Codes, Stop-and-Wait protocol, Sliding Window protocol, Go Back n
protocol, Selective Repeat protocol, Performance of Stop-and Wait and Sliding Window protocol, Data
Link layer in Public network and ARPANET. Network Layer: Service provided to the Transport layer,
Internal organization of Network layer, Routing algorithms, Internetworking, Router, Bridge, Gateway,
Network layer in Public network and ARPANET. Transport Layer: Services provided to the Session
layer, Quality of service, Transmission Controls protocols, Connection management, Addressing,
Establishing and Releasing Connection, Flow control and Buffering, Multiplexing, Transport layer in
Public network and ARPANET. Session Layer: Services provided to the Presentation layer, Data
exchange, Synchronization, Dialog and Activity management, OSI session service primitives. Presentation
Layer: Data Compression techniques, Frequency Dependent Coding, Context Dependent Encoding,
Cryptography, Traditional Cryptography, Data Encryption Standard, Public key cryptography, MIT
algorithm. Application Layer: File transfer Access and management, Electronic Mail, Virtual Terminal,
Client Server, Other applications, OSI service elements. Internet: Introduction to internet and intranets,
internet protocols, Internet services and goals, Domain Name System (DNS) and Addresses, FTP, Gopher
and Telnet, World Wide Web (WWW), Internet Relay Chat (IRC), USENET, DHCP and BOOTP.

Books Recommended:

1. A.S. Tanenbaum : Computer Networks

2. G.H.Cady,PatMcGregor : Mastering The Internet
3. Barry Nance : Introduction to Networking
4. W. Stallings, Macmillan : Data and Computer Communications
5. F. Halsall : Data Communications, Computer Networks and Open Systems
6. Sydni Feit : TCP/IP

Course Code: CSE 3205

Course Title: Computer Networking Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 3204

Course Code: CSE 3206

Course Title: Algorithm Design & Analysis
3 Hours/Week, 3.0 Credits
Introduction: Basic strategies of Algorithm design, Time and space analysis of algorithms, Average, best
and worst case analysis and analysis techniques, different notations.
Divide and conquer: Linear/Binary search, sorting methods strassen’s matrix multiplication method.
Greedy method: Activity selection, Huffman coding, Knapsack problem, job scheduling with deadlines,
spanning trees, prim and kruskal’s algorithms, single-source shortest paths.
Dynamic programming: multistage graphs, travelling salesman problem, All pairs shortest paths. Matrix
chain multiplication, longest common subsequences and optional polygon triangulation problems.
Backtracking: 8 queens problem, sum of subsets, graph colouring problem, Hamilton cycles. Graph
algorithms: depth first search, breadth first search, strongly connected, cut-set algorithms. Network flow
algorithms: Max flow, min cut algorithms, sink-source.
27

Branch and bound: Lest cost search, 15-puzzle problem, Knapsack problem, Travelling salesman
problem.
NP vs. P: The spaces P and NP, the NP-complete problems, Cook’s theorem, NP-Hard problems.
Books Recommended:

1. H Cormen, E. Leiserson and L. Rives : Introduction to Algorithms

2. E. Horowitz and S. Sahni : Fundamentals of Computer Algorithms.
3. Goodman : Introduction to Design and Analysis of Algorithms.
4. Robert Sedgewick : Algorithms.

Course Code: CSE 3207

Course Title: Algorithm Design & Analysis Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 3107

Course Code: CSE 3208

Course Title: Theory of Computation & Automata
3 Hours/Week, 3.0 Credits

Deterministic and nondeterministic finite automata and their equivalence. Equivalence with regular
expressions. Notation and concepts for languages and Grammars, sets and string, Discussion and classification
of Grammars, Scanner regular expression, regular definition, finite automata, LL and LR Grammars,
ambiguous grammar. Basic parsing technique, parsers, shift reduce parsing, operator-procedure parsing, top-
down parsing, bottom up parsing, predictive parsing. Syntax directed translation, intermediate code generation,
polish notation, parse tree and syntax trees, quadruples, triples, Boolean expression. Perspective and
motivation of symbol table. Symbol table content, operation on symbol table, organization of symbol table.
Code optimization, sources of optimization, basic blocks, folding, loop optimization, flowgraph, induction
variable elimination, reduction in strength, code motion. Compile time error handling, error detection, error
recovery, error repair. Code generation, object programs, problems in code generation, a machine model, a
simple code generator, register allocation and assignment peephole optimization.

Books Recommended:

1. Aho and D. Ullman : Compiler Design.

2. A.J. Holub : Compiler design in C, Prentice-Hall of India, 1993.
3. Trembly and Sorensen : Theory and Practices of Compiler Writing
4. Hopcroft and Ulman : Introduction to Automata Theory, Languages and Computation
5. Adamek : Automata and Algebra

Course Code: CSE 3221

Course Title: Bangladesh Studies
2 Hour/week, 2.0 Credits
Introduction, Historical Background of Bangladesh, Political Condition of Bangladesh, Bangladesh
Liberation War, Art and Literature in Bangladesh, Social and culture history Bangladesh, Economical
Development Of Bangladesh, Educational Development, Rural Development, The Constitution of
Bangladesh, Government of Bangladesh, Foreign policy & International Relationship, Globalization &
28

Bangladesh, Role of political parties in Bangladesh, Administrative set up: Central and local government,
Empowerment of women in Bangladesh, Information Technology & Bangladesh, Digital Bangladesh

Course Code: CSE 3209

Course Title: Viva voice
1.0 Credits

Course Code: CSE 4101

Course Title: Project/ Thesis/ Industry Attachment (Part I )
2.0 Credits

Course Code: CSE 4102

Course Title: Artificial Intelligence
3 Hours/Week, 3.0 Credits

Problems and Search: Overview of AI; AI techniques; Underlying Assumption; Problems, Problem
spaces and Search, Different Heuristic Search techniques.
Knowledge representation: Knowledge Representation Issues, Knowledge Representation using Predicate
logic, Knowledge Representation using Rules, Symbolic Reasoning under Uncertainties, probabilistic
reasoning, structured knowledge, object oriented representation. Knowledge representation using semantic
nets, conceptual graph, frames etc.
Introduction to selected topics in AI: Game Playing, Planning, Understanding, Natural language
processing, Expert system, Genetic algorithm, robotics and Fuzzy logic.
An Overview on Artificial Intelligence Programming Languages: Prolog, Visual Prolog, LISP etc.
Neural Networks: Basic concept and structure of neural networks, Learning rules, Back propagation rule,
Hopfield network, neural network as an object classifier.

Books Recommended:

1. Dan W. Patterson : Introduction to Artificial Intelligence and Expert Systems.

2. E. Rich and K. Knight : Artificial Intelligence, Tata-McGraw-Hill Publication Co. Ltd,
3. H. Schildt : Artificial Intelligence Using C, Osborne-Mc-Graw-Hill, 1987.
4. C.F. Chabris and T. Jackson : An Introduction to Neural Computing, Adam Hilger Pub, 1990

Course Code: CSE 4103

Course Title: Artificial Intelligence Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 4102

Course Code: CSE 4104

Course Title: Compiler Design
3 Hours/Week, 3.0 Credits

Introductions to Compiler: Introductory concepts, types of compilers, applications, phases of a compiler.

Lexical analysis: Role of the lexical analyzer, input buffering, token specification, recognition of tokens,
symbol tables. Parsing: Parser and its role, context free grammars, top-down parsing. Syntax-directed
29

translation: Syntax-directed definitions, construction of syntax trees, top-down translation. Type checking:
Type systems, type expressions, static and dynamic checking of types, error recovery. Run-time
organization: Run-time storage organization, storage strategies. Intermediate code generation: Intermediate
language, declarations, assignment statements. Code optimization: Basic concepts of code optimization,
principal sources of optimization. Code generation: Features of some common compilers: Characteristic
features of C, Pascal and Fortran compiler.
Books Recommended:
1. Keith Cooper, Linda Torczon : Engineering a Compiler
2. Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman; : Compilers: Principles, Techniques, and T
3. Kenneth C. Louden : Compiler Construction: Principles and Pr

Course Code: CSE 4105

Course Title: Compiler Design Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 4104

Course Code: CSE 4106

Course Title: Project Management
3 Hours/Week, 3.0 Credits
Project Management Growth: Concepts and Definitions, Organizational Structures, Organizing and
Staffing the Project Office and Team, Management Functions, Time Management and Stress, Conflicts,
Special Topics, The Variable for Success, Working with Executives, Planning, Networking Scheduling.
Project Graphics, Pricing and Estimating, Cost Control, Trade-off Analysis in a Project Environment, Risk
Management, Learning Curves, Modern Developments in Project Management, Quality Management,
Contracts and Procurement, Critical Chain Project Management.

Books Recommended:

1. Andrew Stellman and Jennifer Greene : Applied Software Project Management

2. Teresa Luckey an d Joseph Phillips : Software Project Management For Dummies
3. Steve McConnell : Software Project Survival Guide

Course Code: CSE 4107

Course Title: Computer Graphics and Multimedia
3 Hours/Week, 3.0 Credits

Computer Graphics Programming: OpenGL. Camera Analogy: Viewing, Windowing, Clipping.

Projective Transformation(Ray-tracing): Orthogonal Projection, Perspective Projection, Vector: Normal
Vector, View Vector, Matrix: 2D and 3D Rotation and Translation Matrix, Raster Graphics: Line
Drawing, Anti-aliasing, Polygon Filling Algorithms, Hidden Surface Removal: z-buffering, Lighting and
Surface Property: Diffused Light, Ambient Light, Specular Light, Lighting Models for reflection,
refraction and transparency, Shading: Flat Shading, Lambert Shading, Phong Shading, Texture Mapping:
Texture Fundamentals, Texture Blending, Curves and Surfaces: Types of Curves, Cubic-Spline, Beta-
Spline, NURBS, Animation: Real time animation, Hardware for real-time animation, Character
Animation, Computer Games, Movies, Image Formats: PPM, BMP, Image Based Rendering, Morphing:
View-morphing, Volume Metamorphosis.
Multimedia:Introduction to Multimedia:- General Concept of Audio, Video, Sound, Text and Graphics;
Basic Concept of Computer-Based Multimedia Production; Multimedia Application, Structures and
Organization; Multimedia presentation, Building Blocks for Text, Graphics, Video and Sound Capturing.
30

Books Recommended:

1. Steven Haringtron : Computer Graphics a Programming Approach, Seco

2. Hearn and Baker : Computer Graphics.
3. F. S. Hill : Fundamentals of Computer Graphics.
4. Plastock and Kalley : Computer Graphics.
5. Zhigang Xiang & Roy Plastock : Computer Graphics.
6. John Villamil-Casanova, Louis Molina : Multimedia. An Introduction
7. John Villamil-Casanova, Leony Fernandez-Elias : Multimedia. Graphics
8. John Villamil-Casanova, Louis Molina : Multimedia Sound & Video

Course Code: CSE 4108

Course Title: Computer Graphics and Multimedia Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 4106

Course Code: CSE 4109

Course Title: Option 1
3 Hours/Week, 3.0 Credits

Course Code: CSE 4110

Course Title: Option 1 LAB
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 4109

Course Code: CSE 4201

Course Title: Project / Thesis/ Industrial Attachment ( Part II )
3 Credits

Course Code: CSE 4202

Course Title : E-Commerce Web Engineering
3 Hours/Week, 3.0 Credits

An Introduction to Web Engineering :Categories of Web Applications, Characteristics of Web

Applications, Product-related Characteristics, Usage-related Characteristics, Development-related
Characteristics; Requirements Engineering for Web Applications: Where Do Requirements Come
From? Requirements Engineering Activities RE Specifics in Web Engineering, Principles for RE of Web
Applications, Adapting RE Methods to Web Application Development, Requirement Types, Notations,
Tools; Web Application Architectures:What is an Architecture? Developing Architectures, Categorizing
Architectures ,Specifics of Web Application Architectures, Components of a Generic Web Application
Architecture, Layered Architectures 2-Layer Architectures , N-Layer Architectures , Data-aspect
Architectures , Database-centric Architectures ,Architectures for Web Document Management
Architectures for Multimedia Data; Modeling Web Applications: Modeling Specifics in Web
Engineering, Levels 3.3.2 Aspects, Phases, Customization, Modeling Requirements ,Content Modeling (
Objectives , Concepts) Hypertext Modeling ( Objectives , Hypertext Structure Modeling Concepts, Access
Modeling Concepts, Relation to Content Modeling ) Presentation Modeling( Objectives, Concepts,
31

Relation to Hypertext Modeling), Customization Modeling (Objectives, Concepts, Relation to Content,

Hypertext, and Presentation Modeling ) Methods and Tools (Modeling Methods: An Overview ,Model-
Driven Development, Tool Support) Technologies for Web Applications: Markup, Hypertext and
Hypermedia ,Client/Server Communication on the Web ( SMTP – Simple Mail Transfer Protocol , RTSP –
Real Time Streaming Protocol , HTTP – HyperText Transfer Protocol, Session Tracking ) Client-side
Technologies ( Helpers and Plug-ins ,Java Applets ,ActiveX Controls ) Document-specific Technologies (
HTML – Hypertext Markup Language, SVG – Scalable Vector Graphics ,SMIL – Synchronized
Multimedia Integration Language, XML – eXtensible Markup Language , XSL – eXtensible Stylesheet
Language), Server-side Technologies ( URI Handlers , Web Services ,Middleware Technologies ) Testing
Web Applications: Terminology( Quality Characteristics , Test Objectives , Test Levels) Role of the
Tester ,Test Specifics in Web Engineering, Test Approaches( Conventional Approaches , Agile Approaches
) Test Scheme (Three Test Dimensions (Applying the Scheme to Web Applications Examples of Using the
Test Scheme) Test Methods and Techniques (Link Testing, Browser Testing , Usability Testing, Load,
Stress, and Continuous Testing ,Testing Security, Test-driven Development) Test Automation( Benefits and
Drawbacks of Automated Tests, Test Tools , Selecting Test Tools )

ASP.NET programming model, Web development in Microsoft Visual Studio .NET, Anatomy of an
ASP.NET page, ASP.NET core server controls, ADO.NET data providers, ADO.NET data containers, The
data-binding model, report design using crystal report.

E-Commerce: E-Commerce Definition, Internet History and E-Commerce Development, Business-to-

Business E-Commerce, Business-to-Consumer E-Commerce, E-Commerce Stages and Processes, E-
Commerce Challenges, E-Commerce Opportunities. Online and Offline Market Research, Data Collection,
Domain Names, Advertising Options, E-Mail Marketing, Search Engines, Web Site Monitoring, Incentives.
Electronic Payment Issues, E-Cash, Credit Card Issues, Merchant Accounts, Online Payment Services,
Transaction Processing, Taxation Issues, Mobile Commerce (M-Commerce). Customer Service Issues, E-
Mail Support , Telephone Support , Live Help Services, Customer Discussion Forums, Value-Added
Options.

Books Recommended

1. Kappel, G., Proll, B. Reich, S. and Retschitzegger, W. : Web Engineering, Wiley and Sons.

2. Roger Pressman and David Lowe : Web Engineering: A Practioner’s Approach

3. Jeffrey F., Rayport, Bernard J. Jaworsk : E-Commerce, Mc Graw-Hill, ISBN-0072465
4. David Kosiur : Understanding Electronic Commerce, Micros
5. Jeffrey F. Rayport, et al. : Introduction to E-Commerce, Mc Graw-Hill,
6. Debra Cameron : E-Commerce Security Strategies: Protection
Technology Research Corp. Aug-1998.
7. Charles Trepper : E-Commerce Strategies
8. SAMS Publisher : Web programming A desktop Reference
9. Elias M. Awad : Electronic Commerce

Course Code: CSE 4203

Course Title: E-Commerce and Web Engineering Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 4202
32

Course Code: CSE 4204

Course Title: Digital Image Processing
3 Hours/Week, 3.0 Credits

Digital Image Fundamentals: Digital Image Fundamentals, A Simple Image Model, Sampling and
Quantization, Basic Relationship between Pixels, Image Geometry.
Image Enhancement:
Image enhancement is special domain: Image negative, log transformations, power-law transformations,
Piecewise-linear transformation functions, contrast stretching, gray-level slicing, bi-plan slicing, Histogram
processing, Histogram equalization, Histogram specification, Image subtraction, Image averaging, Basics
of spatial filtering, Smoothing special filters, Sharpening Special filters, Combining special enhancement
methods.
Image enhancement in frequency domain: Introduction to the Fourier transform and the frequency
domain, the two-dimensional DFT and its inverse, Filtering in the frequency domain: some basic properties
of frequency domain, some basic filters and their properties, Correspondence between filtering in special
and frequency domains, Smoothing frequency domain filters: ideal low-pass filter Butterworth low-pass
filters, Gaussian low-pass filters, Sharpening frequency domain filters: ideal high pass filter, Butterworth
high-pass filters, Gaussian high-pass filters, the laplacian in the frequency domain, Implementation.
Image Restoration: Degradation Model, Diagonalization of Circulant and Block-Circulant Matrices,
Algebraic Approach to Restoration, Inverse Filtering, Geometric Transformation.
Morphological Image and Signal Processing: The principle of Mathematical Morphology, Erosion and
Dilation in the Euclidean Space, Closings and Openings, Grayscale Morphology, Links between Links and
Sets, Grayscale Morphological Transformations.
Image segmentation: detection of discontinuous, point detection, line detection, Edge Linking and
Boundary Detection, thresholding, region based segmentation, The use of Motion in Segmentation.
Matlab: Introduction, Interactive computing, Programming in MATLAB; Script and functions,
Applications. Matlab toolboxes (User of); Digital Signal Processing and Image Processing.

Books Recommended:

1. Rafeal C. Gonzalez & Richard E. Woods : Digital Image Processing

2. Gordon E. Carlson : Signal and Linear System Analysis

Course Code: CSE 4205

Course Title: Digital Image Processing Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 4204

Course Code: CSE 4206

Course Title: Simulation & Modeling
3 Hours/Week, 3.0 Credits

Simulation methods: Introduction to Simulation, Random number generator, analogue simulation of

continuous system, Discrete system simulation, Simulation of a pert network, Statistical analysis of result,
Validation and verification techniques, Application of simulation to problems e.g. business, operation
research, operating system, Computer design, Introduction to simulation packages, Computer animation.
Modeling: Introduction to modeling techniques, Problems, models and systems, Modeling concepts, Logic
for (conceptual) modeling, Logic programming for conceptual modeling, Concepts of relational modeling
33

and its practice. Some practical modeling e.g. Relational Database modeling, Different methods for Curves
and surface modeling, Fractals, Polyhedral modeling with Euler’s formula, Advanced modeling, Procedural
models. Case Study: Simulation and Modeling software: SimScript.

Books Recommended:

1. J. A. Spriet : Computer Aided Modeling & Simulation.

2. R. S. Lehman : Computer Simulation and Modeling
3. G. Cordon : System Simulation.
4. James D. Foley Andries van Dam : Computer Graphics.

Course Code: CSE 4207

Course Title: Simulation & Modeling Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 4206

Course Code: CSE 4208

Course Title: Option 2
3 Hours/Week, 1.5 Credits

Course Code: CSE 4209

Course Title: Option 2 Lab
3 Hours/Week, 1.5 Credits
Laboratory works based on CSE 4208

Course Code: CSE 4210

Course Title: Viva Voce
1.0 Credits

Optional : Option I
Course Title: Wireless Networks
3 Hours/Week, 3.0 Credits

Cellular concepts: Frequency reuse, handoff strategies, interference and system capacity, grade of service,
improving capacity and coverage, call blocking probability; Propagation effects: outdoor propagation
models, indoor propagation models, power control, Dopplera^Etms effect, small and large scale fades;
Wireless LAN Technology; IEEE 802.11: standard, protocol architecture, physical layer and media access
control; Mobile IP; Wireless Application Protocol; IEEE 802.16 Broadband Wireless Access; Brief review
of 2nd and 3rd generation wireless: GSM, GPRS, CDMA; Cordless system; Wireless local loop; Bluetooth:
overview and baseband specifications.

Books Recommended:

1. William Stallings : Wireless Communications & Networks

2. Yi-Bing Lin , Imrich Chlamtac : Wireless and Mobile Network Architectures

3. Gary J. Mullett : Wireless Telecommunications Systems and Networks

34

Course Title: Wireless Networks Lab

3 Hours/Week, 1.5 Credits
Laboratory works based on Wireless Networks

Course Title: Digital Signal Processing

3 Hours/Week, 3.0 Credits
Signals and Systems : Discrete-Time Signals, Complex Sequences, Some Fundamental Sequences, Signal
Duration, Periodic and Aperiodic Sequences, Symmetric Sequences, Signal Manipulations, Signal
Decomposition, Discrete-Time Systems, Systems Properties, Convolution, Convolution Properties,
Performing Convolutions, Difference Equations.
Fourier analysis: Frequency Response, Filters, Interconnection of Systems, The Discrete-Time Fourier
Transform, DTFT Properties, Applications, LSI Systems and LCCDEs, Performing Convolutions, Solving
Difference Equations, Inverse Systems.
Sampling: Analog-to-Digital Conversion, Periodic Sampling, Quantization and Encoding Digital-to-
Analog Conversion, Discrete-Time Processing of Analog Signals, Sample Rate Conversion, Sample Rate
Reduction by an Integer Factor, Sample Rate Increase by an Integer Factor, Sample Rate Conversion by a
Rational Factor.
The Z-Transform: Definition of the z-Transform, Properties, The Inverse z-Transform, Partial Fraction
Expansion, Power Series, Contour Integration, The One-Sided z-Transform. Transform Analysis of
Systems: System Function, Stability and Causality, Inverse Systems Unit Sample Response for Rational
System Functions, Frequency Response for Rational System Functions, Systems with Linear Phase, Allpass
Filters, Minimum Phase Systems, Feedback Systems.
The DFT: Discrete Fourier Series, Discrete Fourier Transform, DFT Properties, Sampling the DTFT,
Linear Convolution Using the DFT. The Fast Fourier Transform: Radix-2 FFT Algorithms, Decimation-in-
Time FFT 2, Decimation-in-Frequency FFT, FFT Algorithms for Composite N , Prime Factor FFT.
Implementation of Discrete-Time Systems: Digital Networks , Structures for FIR Systems, Direct Form,
Cascade Form, Linear Phase Filters, Frequency Sampling, Structures for IIR Systems, Direct Form,
Cascade Form, Parallel Structure, Transposed Structures, Allpass Filters Lattice Filters, FIR Lattice Filters,
All-Pole Lattice Filters, IIR Lattice Filters, Finite Word-Length Effects, Binary Representation of
Numbers, Quantization of Filter Coefficients, Round-Off Noise, Pairing and Ordering, Overflow.
Filter Design: Filter Specifications, FIR Filter Design, Linear Phase FIR Design Using Windows ,
Frequency Sampling Filter Design, Equiripple Linear Phase Filters, IIR Filter Design Analog Low-Pass
Filter Prototypes, Design of IIR Filters from Analog Filters, Frequency Transformations, Filter Design
Based on a Least Squares Approach, Pade Approximation, Prony's Method, FIR Least-Squares Inverse.

Books Recommended:

1. J. G. Prokis : Digital signal processing

2. Defatta : Digital signal processing
3. R. G. Lyons : Understanding DSP
4. P. R. Babu. : Digital signal processing

Course Title: Digital Signal Processing Lab

3 Hours/Week, 1.5 Credits
Laboratory works based on Digital Signal Processing

Course Title: Parallel Processing

3 Hours/Week, 3.0 Credit

Introduction to Modern Computer Architectures : Structure and Organization of a Typical

Uniprocessor Architecture, Major Limitations of Uniprocessor System, Need for Parallel Processing,
Parallel Computer Structures, Parallel Classification Schemes, Performance Metrics for Parallel
Computers. Memory Subsystem : Memory Hierarchy for Parallel System, Virtual Memory Organization,
35

Cache Memories for Parallel Processing, Cache Coherence Schemes (snooping, directory based, and
hybrids), Shared-memory Organization, Shared-memory vs. Private-memory for Parallel Processing.
Processor Design : Pipelining and Super pipelining, Super pipelining Superscalar Design, Multithreading,
Multi-core Design. Communication System : Basic Communication Performance Criteria, Bus-based
Communications, Static Natworks topologies and routing, Dynamic Networks topologies and routing,
Reconfigurable Networks, Multistage Interconnection Networks, Design Trade-offs in Communication
Networks, Network-on-chips, Optical Interconnects. Multiprocessor Bus-based SMPs : Snoop-based
multiprocessor design, snoopy cache coherence design, Interconnects for SMPs, Case Study.
Microprocessor Directory-based Multiprocessor : Principles of MIMD Processing using distributed
shared memory, Interconnects for DSMs, Scalability issues, Case Study. Multicomputers Distributed-
memory systems : Principles and Design issues, Clusters of Workstations (COWs), clusters of PCs.
Parallel Program Design and Parallel Programming : Parallel Program Design Principles, Parallel
Programming Language : MPI and OpenMP. Emerging Technologies : The Role of Optics for Parallel
Computing, The Role of Wireless Communication for Parallel Computing, Future Directors in Computer
Architecture.
Books Recommended:

1. Kai Hwang, McGraw Hill 1993 : Advanced Computer Architecture: Parallelism, Scalability, P
David Culler J. P. Singh, Morgan Kaufmann,
2. : Parallel Computer Architecture: A Hardware/Softwa
1999
3. Kai Hwang and Zhiwei Xu, McGraw Hill 1998 : Scalable Parallel Computing: Technology, Architecture,
William J. Dally and Brian Towles, Morgan
4. : Principles and Practices of Interconnection Networks
Kaufmann
Ananth Grama Gupta, Karypis, Kumar, Person,
5. : Introduction to Parallel Computing, Second edition
Adison Wesley, 2003

Course Title: Parallel Processing Lab

3 Hours/Week, 1.5 Credits
Laboratory works based on Parallel Processing

Course Title: Management Information Systems

3 Hours/Week, 3.0 Credits

Introduction to MIS: Management Information System Concept, Definitions, Role of MIS, Approaches of
MIS development. MIS and Computer: Computer Hardware for Information System, Computer Software
for Information System, Data Communication System, Database Management Technology, Client- Server
Technology. Decision Support System: Introduction, Evolution of DSS, Functions of a DSS,
Development of DSS, Group Decisions of DSS, Relationship between MIS and DSS, Future Development
of DSS, Application of MIS: Applications of Manufacturing Sector, Applications in Service Sector, Case
Studies.
Course Title: Advanced Database System
3 Hours/Week, 3.0 Credits

Object oriented Database, Data Model, Design, Language; Object Relational Database: Complex data
types, Querying with complex data types, Design; Distributed Database: Levels of distribution
transparency, Translation of global queries to fragment queries, Optimization of access strategies,
36

Management of distributed Memory, Stochastic Networks, Correlated Patterns. OLAP, Optimization

Problem: Weighting Matching Problem, Traveling Salesman Problem.

Books Recommended:

1. Carlo Zaniolo, Stefano Ceri, Christos Faloutsos and Richard T. Snodgrass : Advanced Database Systems
2. Charu C. Aggarwal and Haixun Wang : Managing and Mining Graph D
Systems)

Course Title: Advanced Database System Lab

3 Hours/Week, 1.5 Credits
Laboratory works based on Advance Database System

Optional : Option 2
Course Title: Fiber Optics
3 Hours/Week, 3.0 Credits

Optical fiber: Nature of list, Optics low, Optical fiber mode, Single mode fiber, Graded index structure.
Signal degradation in optical fibers: Attenuation, Signal distortion, Pulse Broadening mode coupling.
Optical sources: LED, Laser diodes, Light source linearity modal partition and reflection noise. Power
launching and Coupling: Source to fiber power launching, lansing scheme, fiber to fiber joints, Splicing
fiber connectors. Photodetectors: Basic principle, photodelectors noise, response time, Avalauch
multiplication noise. Optical receiver operation: Receiver configuration, digital receiver performance
preamplifiers. Digital transmission system: Point to point link, line coding, Eye pattern, system
performance. Advanced systems and techniques: WDM, Local area networks, Optical amplifier, Photonic
switching.

Books Recommended:

1. John Crisp and Barry Elliott : Introduction to Fiber Optics

2. Joseph C. Palais : Fiber Optic Communications
3. John M. Senior : Optical Fiber Communications: Principles and Practice

Course Title: Fiber Optics Lab

3 Hours/Week, 1.5 Credits
Laboratory works based on FIBER OPTICS

Course Title: Pattern Recognition

3 Hours/Week, 3.0 Credits

Introduction: Pattern and feature, Problems in pattern recognition, Design concepts and methodologies,
Classification techniques, Minimum distance pattern classifier, Training and learning in Pattern recognition
approaches-Neural pattern recognition, Pattern recognition tasks by feed forward neural networks.
Statistical Pattern Recognition: Gaussian model-Supervised learning-Parametric and non-Parametric
estimation-Maximum likelihood estimation-Bayesian parameters estimation-Perception algorithm-LMSE
algorithm-Problems with Bayes approach-Pattern classification by distance functions.
37

Cluster Analysis: Unsupervised learning-Clustering for Unsupervised learning and classification-K-means

algorithm-Hierarchical procedures-Graph theoretic approach to pattern clustering-Validity of clustering
solutions.
Syntactic Pattern Recognition: Elements of formal grammar-String generation as pattern description-
Recognition of syntactic description-Parsing-Stochastic grammar and applications-Graph based structural
representation.
Feature Extension and Recent Advances: Entropy minimization - Karhunen-Loeve transformation-
Neural Network structures for pattern recognition-Unsupervised learning -self organizing networks-Fuzzy
pattern classifiers-Genetic algorithms-Application to pattern recognition. Hidden Markov Model (HMM).
Biometrics system: Biometric behavioral features and physical features, person identification system.

Books Recommended:

1. E.G. Richard, Johnsonbaugh and S. Jost : Pattern Recognition and Image Analysis
2. R.O. Duda and P.E. Hart : Pattern classification and Scene analysis
3. Morton Nadler and P. Eric smith : Pattern Recognition Engineering
4. Tou and R. Gonzaler : Pattern Recognition Principles
5. Robert J. Schalkoff : Pattern Recognition: Statistical and Neural Approaches
6. Melanie Mitchell : An Introduction to Genetic Algorithms

Course Title: Pattern Recognition Lab

3 Hours/Week, 1.5 Credits
Lab works based on Pattern Recognition

Course Title: Neural Network

3 Hours/Week, 3.0 Credits
Introduction: Neuroscience, History and Issues, Neural network: Basic concepts of Neural Networks,
Characteristics of Neural Networks, Feed-Forward Network, Multi-Layer Network, Back propagation
Network. Unsupervised Learning: Hebbian Learning, Competitive learning. Hopfield Model: Associative.

Books Recommended:
1. Simon Haykin : Neural Networks and Learning Machines
2. Christopher M. Bishop : Neural Networks for Pattern Recognition
3. Kevin Gurney : An Introduction to Neural Networks
4. Laurene V. Fausett : Fundamentals of Neural Networks: Architectures, Algorithms
And Applications

Course Title: Neural Network Lab

3 Hours/Week, 1.5 Credits
Lab works based on Neural Network
Course Title: VLSI Design
3 Hours/Week, 3.0 Credits

VLSI design methodology: top-down design approach, technology trends, introduction to MOS
technology, operation of MOS transistor as a switch and amplifier, MOS, NMOS, CMOS inverters, pass
transistor and pass gates: DC and transient characteristics.
38

Brief overview of fabrication process: NMOS, CMOS, Bi-CMOS process. NMOS and CMOS layout,
stick diagram, and design rules. CMOS circuit characteristics and performance estimation: resistance and
capacitance, rise and fall time, power estimation. Buffer circuit design. Introduction to Bi-CMOS circuits.
Shifter, adder, counter, multipliers. Data Path and memory structures. Design style: FPGA and PLDs.

Books Recommended:

1. K. Eshraghian & D. A. Pucknell : Basic VLSI design: System & Circuit

2. R. K. Brayton : Logic Minimization Algorithms for VLSI Synthesis.
3. F. Lombardi : Testing and diagnosable Design of VLSI and ULSI.
4. C. A. Mead and L. A. Conway : Introduction to VLSI Systems.

Course Title: VLSI Design Lab

3 Hours/Week, 1.5 Credits
Lab works based on VLSI Design