Syllabus PDF

Dept.
of Computer Science and Engineering

Jahangirnagar University
Syllabus for B.Sc. (Hons.) in Computer Science and Engineering
(Effective from 2014-15 Academic Session)
Department of Computer Science and Engineering (CSE), Jahangirnagar University has commenced its
academic activities from the session 1991-1992. From the beginning it has introduced a four-year B.Sc. (Hons.)
degree. As the field of Computer Science and Engineering is rapidly changing all over the world, syllabus and
academic system of CSE need to be updated. In this context, Department of Computer Science and Engineering
has decided to modernize the existing syllabus from the session 2014-2015 on.
The courses for Bachelor of Science (Hons.) degree in Computer Science and Engineering shall extended over a
period of four academic year and shall be divided into eight semesters: First year first semester, first year second
semester, second year first semester, second year second semester etc. One semester will extend for a period of
15 weeks. For the purpose of assessment, 100 marks will be assigned to a 3-credit theoretical course and 50
marks will be assigned to a 2-credit theoretical course. 3 credits means 3 contact hours/week in a semester. In
the same way 2 credits means 2 contact hours/week in a semester. However, all laboratory courses are of 1-
credit which means each laboratory course is of 3 contact hours/week in a semester. For the purpose of
assessment, 100 marks will be assigned to a 1-credit laboratory course.
To obtain the degree of BSc (Hons.) in Computer Science and Engineering a student shall have to complete 159
credit hours. A student’s final evaluation result in a course will be determined using the letter grades and grade
points as follows:
Marks Range Letter Grade Grade Point

80% or above A+ 4.00
75% to <80% A 3.75
70% to <75% A- 3.50
65% to <70% B+ 3.25
60% to <65% B 3.00
55% to <60% B- 2.75
50% to <55% C+ 2.50
45% to <50% C 2.25
40% to <45% D 2.00
<40% F 0.00
Grade Point Average (GPA) is the weighted average of the grade points obtained in the courses passed by a
student in a semester and the Cumulative Grade Point Average (CGPA) is calculated considering all the grade
points earned by a student in different semesters.
1
Summary of Courses Credits
Interdisciplinary Courses:
Mathematics (3 Courses) 9
Statistics (2 Courses) 4
English (1 Course) 3
Economics (1 Course) 2
Business (1 Course) 3
Physics (1 Course) 3
URP (LAB: 1 Course) 1
Total Interdisciplinary Courses (9 courses) 25
Core Courses:
Computer Science and Engineering (Theory: 36 Courses) 95
Computer Science and Engineering (LAB: 28 Courses) 28
Viva-Voce (8 Courses) 8
Project Work (1 Course) 3
Total CSE Courses (73 Courses) 134
Total Courses (82 Courses) 159
First Year First Semester
Course Code Course Title Credit

CSE 101 Mathematics I (Calculus and Coordinate Geometry) 3
CSE 103 Physics (Electricity, Magnetism and Optics) 3
CSE 105 Computer Systems and Applications 3
CSE 107 Electrical Circuits 3
CSE 108 Electrical Circuits Laboratory 1
CSE 109 Communicative English 3
CSE 111 Economics 2
CSE 114 Engineering Drawing Laboratory 1
CSE 100 Viva-Voce 1
Total Credits 20
First Year Second Semester

Mathematics II (Matrix, Ordinary and Partial Differential Equations and Series
CSE 151 3
Solutions)
CSE 153 Electronic Devices and Circuits 3
CSE 154 Electronic Devices and Circuits Laboratory 1
CSE 155 Discrete Mathematics 3
CSE 157 Structured Programming Language 3
CSE 158 Structured Programming Language Laboratory 1
CSE 159 Numerical Methods 2
CSE 160 Numerical Methods Laboratory 1
CSE 161 Management and Accounting 3
CSE 150 Viva-Voce 1
Total Credits 21
2
Second Year First Semester

Mathematics III ( Vector, Complex Variable, Fourier Analysis and Laplace
CSE 201 3
Transformation )
CSE 203 Statistics I 2
CSE 205 Digital Logic Design 3
CSE 206 Digital Logic Design Laboratory 1
CSE 207 Data Structures 3
CSE 208 Data Structures Laboratory 1
CSE 209 Object Oriented Programming 3
CSE 210 Object Oriented Programming Laboratory (C++) 1
CSE 211 Graph Theory and Computational Geometry 2
CSE 200 Viva-Voce 1
Total Credits 20
Second Year Second Semester

CSE 251 Statistics II 2
CSE 253 Algorithm Analysis and Design 3
CSE 254 Algorithm Analysis and Design Laboratory 1
CSE 255 Database Systems 3
CSE 256 Database Systems Laboratory 1
CSE 257 Data Communication 3
CSE 258 Data Communication Laboratory 1
CSE 259 Computer Architecture and Organization 3
CSE 262 Object Oriented Programming Laboratory (JAVA) 1
CSE 250 Viva-Voce 1
Total Credits 19
Third Year First Semester

CSE 301 Operating Systems 3
CSE 302 Operating Systems Laboratory 1
CSE 303 Microprocessors and Microcontrollers 3
CSE 304 Microprocessors and Microcontrollers Laboratory 1
CSE 305 Web Design and Programming 3
CSE 306 Web Design and Programming Laboratory 1
CSE 307 System Analysis and Design 2
CSE 308 System Analysis and Design Laboratory 1
CSE 309 Theory of Computation 2
CSE 311 Technical Writing and Presentation 2
CSE 300 Viva-Voce 1
Total Credits 20
3
Third Year Second Semester
CSE 351 Computer Graphics and Visualization 3
CSE 352 Computer Graphics and Visualization Laboratory 1
CSE 353 Compiler Design 2
CSE 354 Compiler Design Laboratory 1
CSE 355 Digital Signal Processing 3
CSE 356 Digital Signal Processing Laboratory 1
CSE 357 Software Engineering 3
CSE 359 Computer Peripherals and Interfacing 2
CSE 360 Computer Peripherals and Interfacing Laboratory 1
CSE 362 Mobile Application Development Laboratory 1
CSE 350 Viva-Voce 1
Total Credits 19
Fourth Year First Semester

CSE 401 Computer Networks 3
CSE 402 Computer Networks Laboratory 1
CSE 403 Artificial Intelligence 3
CSE 404 Artificial Intelligence Laboratory 1
CSE 405 VLSI Circuits Design 2
CSE 406 VLSI Circuits Design Laboratory 1
CSE 407 Digital Image Processing 3
CSE 408 Digital Image Processing Laboratory 1
CSE 409 Simulation and Modeling 3
CSE 411 Software Testing and Quality Assurance 2
CSE 400 Viva-Voce 1
Total Credits 21
Fourth Year Second Semester

CSE 451 Pattern Recognition and Machine Learning 3
CSE 452 Pattern Recognition and Machine Learning Laboratory 1
CSE 453 Wireless Networks 2
CSE 454 Wireless Networks Laboratory 1
CSE 455 Multimedia and Animation Techniques 2
CSE 456 Multimedia and Animation Techniques Laboratory 1
CSE 457 Computer Ethics and Cyber Law 2
CSE 459 Data Mining 2
CSE 460 Data Mining Laboratory 1
CSE 450 Viva-Voce 1
CSE 480 Project Work 3
Total Credits 19
4
Dept. of Computer Science and Engineering
Jahangirnagar University
Syllabus for B.Sc. (Hons.) in Computer Science and Engineering
(Effective from 2014-15)
Detailed Syllabus
First Year First Semester
CSE 101: Mathematics I (Calculus and Coordinate Geometry) Credit: 3
Integral Calculus: Definitions of integration; Integration by the method of substitutions; Integration

by parts; Standard integrals; Integration by the method of successive reduction; Definite integrals and
its properties and use in summing series; Walli’s formula, Improper integrals, Beta function and
Gamma function; Area under a plane curve in cartesian and polar co-ordinates; Area of the region
enclosed by two curves in cartesian and polar co-ordinates; Trapezoidal rule, Simpson,s rule. Arc
lengths of curves in cartesian and polar co-ordinates, parametric and pedal equations; Intrinsic
equation; Volume of solids of revolution; Volume of hollow solids of revolution by shell method.
Area of surface of revolution; Jacobian, multiple integrals and their application.
Differential Calculus: Limits, continuity and differentiability; Successive differentiation of various
types of functions; Leibniz’s Theorem; Rolle’s Theorem; Mean value Theorem in finite and infinite
forms; Lagrange’s form of remainders; Cauchy’s form of remainder; Expansion of functions;
Evaluation of indeterminate forms by L’Hospital’s rule; Partial differentiation; Euler’s Theorem;
Tangent and Normal, Subtangent and subnormal in cartesian and polar co-ordinates; Maximum and
minimum values of functions of single variable; Points of inflexion; Curvature, radius of curvature,
center of curvature; Asymptotes, curve tracing.
Co-ordinate Geometry: Transformation of co-ordinates axes and its uses; Equation of conics and its
reduction to standard forms; Pair of straight lines; Homogeneous equations of second degree; Angle
between a pair of straight lines; Pair of lines joining the origin to the point of intersection of two given
curves, circles; System of circles; Orthogonal circles; Radical axis, radical center, properties of radical
axes; Coaxial circles and limiting points; Equations of parabola, ellipse and hyperbola in cartesian and
polar co-ordinates; Tangents and normals, pair of tangents; Chord of contact; Chord in terms of its
middle points; Pole and polar parametric co-ordinates; Diameters; Conjugate diameters and their
properties; Director circles and asymptotes.
Books:
1. Howard Anton, Irl C. Bivens, Stephen Davis, Calculus, Wiley, 10th edition, 2012.
2. Michael Spivak, Calculus, Publish or Perish, 4th edition, 2008.
3. Daniel Kleppner, Norman Ramsey, Quick Calculus: A Self-Teaching Guide, John Wiley &
Sons, 2nd edition, 1985.
4. Henry B. Fine, Coordinate Geometry, Forgotten Books, 2012.
5. Chandramouli Mahadevan, Coordinate Geometry, CreateSpace Independent Publishing
Platform, 2011.
CSE 103: Physics (Electricity, Magnetism and Optics) Credit: 3
Charge, Electric field & Gauss’s Law: Simple phenomena in electrostatics; Electrostatic induction
and charge density; Coulomb’s law; Electric field & field strength; Point charge in an electric field;
1
Dipole in an electric field; Electric flux; Gauss’s law and some applications; Electric potential;
Potential due to a point charge; Equipotential surfaces; Potential energy; Potential gradient;
Capacitance and its calculation; Parallel plate capacitor with dielectric; Dielectric & Gauss’s law;
Electric vectors; Energy stored in an electric field
Electric current, Simple circuits and Electrical Measurements: Current and Ohm’s law; E.M.F.
and potential difference; Kirchhoff’s laws; Whetstone bridge; Single loop & multi loop circuits;
Simple RC and RL circuits, Kirchhoff''s laws, The potentiometer; Moving coil Galvanometer;
Ammeter; Voltmeter; Multimeter; Wattmeter & Energy meter; Measurements of Voltage, Current,
Resistance, Inductance, Capacitance, Power and Energy.
Magnetic Field & Force on Current: Coulomb’s law; Magnetic field and field strength; Magnetic
force on current; Ampere’s law; Directions of current and field; Maxwell’s cork screw rule; Fleming’s
left hand rule; Magnetic field near long wire; Magnetic field for solenoid; Biot-savart law. Faraday’s
law of electromagnetic induction; Fleming’s right hand rule; Lenz’s law.
Magnetic properties of matter: Poles and dipoles; Coulomb’s law for magnets & Gauss’s theorem
of magnetism; Dia-magnetism, Para-magnetism and Ferro-magnetism; Magnetomotive force and field
intensity; Concept of self and mutual inductance; Coefficient of magnetic coupling; Rise of current
and decay of current in Inductive circuit; Energy in magnetic field; Inductance in series and parallel;
Hysteresis and eddy current losses.
Optics: Refraction and total internal reflection; Group velocity and Phase velocity of light;
Dispersion; Interference; Holography; Fresnel and Fraunhofer diffraction; Polarization of light wave.
Books:
1. David Halliday, Robert Resnick, Physics Part-II, Wiley Eastern Limited, 1992.
2. Edward M. Purcell, David J. Morin, Electricity and Magnetism, Cambridge University
Press, 3rd edition, 2013.
3. Grant R. Fowles , Introduction to Modern Optics, Dover Publications, 2nd edition, 1989.
4. D. N. Vasudeva, Fundamentals of Magnetism and Electricity, S. Chand and Company
Limited, 1998.
5. Wayne M. Saslow, Electricity, Magnetism, and Light, Academic Press, 1st edition, 2002.
CSE 105: Computer Systems and Applications Credit: 3
Introduction: Basic organization of computer; Types of computers; Number systems; Types of

memory; Types of software; Operating system; Databases; Application packages.
Peripherals Devices: Input Device, Output Device, Storage, Display, Bus.
Computer Networks: Computer networks, www, network card and accessories; Brief idea on
network operating systems and popular NOS like Windows NT, UNIX, Linux.
Application Packages: Different application packages like Word-processing, Spreadsheet analysis
and Data base handling;
Number System: Binary, octal & hexadecimal; Addition, subtraction, multiplication and division;
Codes: BCD, excess three & gray codes; error detecting codes and error correcting codes.
Programming Concept: Problem analysis, Algorithm build-up, Flowcharts and pseudo-coding, Data
Types, Expressions, Control Flow.
Books:
1. Anita Goel, Computer Fundamentals, Pearson, 2010.
2. Timothy O'Leary, Linda O'Leary, Computing Essentials 2014 Complete Edition, McGraw-
2
Hill/Irwi, 2013.
3. K. L. James, Computer Hardware: Installation, Interfacing, Troubleshooting and
Maintenance, Prentice-Hall of India Pvt.Ltd, 2013.
4. Peter Norton, Introduction to computers, 6th edition, 2006.
5. Michael Price, Computer Basics in Easy Steps, In Easy Steps Limited, 2011.
CSE 107: Electrical Circuits Credit: 3
Network sources and Analysis: Voltage sources; Voltage sources in parallel; Open and short
circuits; Current sources in series and parallel; Mesh analysis; Nodal analysis; Star-delta and delta-star
conversion.
Network Theorems: Superposition theorem; Thevenin’s theorem; Norton’s theorem; Maximum
power transfer theorem; Millman’s theorem; Substitution theorem; Reciprocity theorem.
Basic Passive Elements: Resistors, inductors and capacitors in series and parallel; Transient response
in capacitive networks; Charging and discharging phases; R-L transients; Storage cycle, Decay phase.
Fundamentals of AC and the Basic elements and Phasors: Generation of alternating voltage &
currents; Sine wave; General format of sinusoidal voltage and currents; Phase & algebraic
representations of sinusoids; Average & RMS (effective) values; Response of basic R,L,C elements to
a sinusoidal voltage & currents; frequency response of basic elements; Resonance; Average power &
power factor; Complex numbers: Rectangular & polar form: Active & reactive power; Series &
parallel resonance circuit; Qualify factor, Selectivity.
Transformer: Construction and features of transformer; Transformer on no- load and on load; emf-
equation; Phasor diagram; Equivalent circuits; Losses and efficiency.
Books:
1. R. L. Boylestad, Introductory Circuit Analysis, Prentice Hall, 2010.
2. R. M. Kerchner, G. F. Corcoran, Alternating Current Circuits, Wiley Eastern Limited,
1994.
3. K. C. A. Smith, R. E. Alley, Electrical Circuits: An Introduction, Cambridge University
Press, 1992.
4. J. Nagarath and D. P. Kothari, Electric Machines, Tata McGraw-Hill, 1999.
5. F. Puschstein, T. C. Lloyd, A. G. Conrad, Alternating Current Machines, Asia Publishing
House, 1996.
CSE 108: Electrical Circuits Laboratory Credit: 1
Laboratory work based on CSE 107.
CSE 109: Communicative English Credit: 3
Speaking: How to ask questions, make requests and give instructions; How to respond to queries,
invitations and statements; How to introduce and thank, express gratitude, regret or appreciation; How
to communicate in particular everyday situations; How to express different concepts: ability,
possibility, futurity, necessity, obligation, assumption, regularity, continuity, arrangement,
comparison, etc.
Reading: For skimming; For comprehension; For interpretation.
Writing: Spelling, punctuation, indenting, brackets, abbreviation, numbers and fractions,
3
capitalization, underlining, hyphenation, etc, Organization of writing- of sentences in paragraph, and
of paragraphs, in essays and letters. Practical Writing: personal & official correspondence, job
application, CV.
Vocabulary: Clues to the meaning of a word: Position in the clause, prefixes, suffixes, roots, revising
and expanding vocabulary.
Grammar: Clause: structure, function, variation and expansion, The noun in the clause: number,
determiners, The Pronoun in the clause: number, case, agreement and reference. The verb in the
clause: form, tense, voice, mood, subject-verb agreement. The modifiers in the clause: adjective,
adverb, infinitive, participles, The conjunctions and prepositions to suggest different relationships:
time, space, cause, result, purpose, condition, exception, etc., Remedial grammar: Identifying and
correcting errors and weaknesses.
Listening Comprehension / Movie show: Introducing audio visual materials and/or movies to
develop listening skills.
Books:
1. Fiona Aish, Jo Tomlinson, Lectures: Learn Academic Listening and Note-Taking Skills,
HarperCollins UK, Pap/Cdr Wk edition, 2013.
2. Joseph Devlin, How to Speak and Write Correctly, CreateSpace Independent Publishing
Platform, 2013.
3. John Langan , Zoe Albright, English Skills with Readings, McGraw-Hill Humanities/Social
Sciences/Languages, 9 edition, 2014.
4. Susan Thurman, Larry Shea, The Only Grammar Book You'll Ever Need: A One-Stop
Source for Every Writing Assignmen, Adams Media; 2nd Edition, 2003.
5. Matthew M Monippally, The Craft of Business Letter Writing, 1ed, Tata McGraw-Hill
Publishing Company Limited, NEW DELHI, 1997.
CSE 111: Economics Credit: 2
Introduction: The Scope and Method of Economics.

The Economic Problem: Scarcity and Choice Demand, Supply and Market Equilibrium; Demand
and Supply Applications and Elasticity; Household Behavior and Consumer Choice.
The Production Process: The Behavior of Profit-Maximizing Firms; Short-run Costs and Output
Decisions; Long-run Costs and Output Decisions; Monopoly and Antitrust Policy; Monopolistic;
Competition and Oligopoly; Introduction to Macroeconomics; Measuring National Output and
National Income;
Long-run and Short-run Concerns: Growth, Productivity, Unemployment and Inflation; Aggregate
Expenditure and Equilibrium Output; The Government and Fiscal Policy; Money Demand, the
Equilibrium Interest Rate and Monetary Policy.
Books:
1. Paul Krugman, Robin Wells, Economics, Worth Publishers, 3rd edition, 2012.
2. Paul Samuelson, William Nordhaus, Economics, McGraw-Hill/Irwin, 19th edition, 2009.
3. Karl E. Case, Ray C Fair, Sharon Oster, Principles of Economics, Pearson – Prentice Hall,
11th edition, 2013
4. Thomas Sowell, Basic Economics: A Common Sense Guide to the Economy, Basic Books,
4th edition, 2010.
5. Henry Hazlitt, Economics in One Lesson: The Shortest and Surest Way to Understand Basic
4
Economics, Three Rivers Press; Later Reprint edition, 1988.
CSE 114: Engineering Drawing Laboratory Credit: 1
CSE 100: Viva-Voce Credit: 1
First Year Second Semester
CSE 151: Mathematics II Credit: 3

(Matrix, Ordinary and Partial Differential Equations and Series Solutions)
Matrices: Definition of matrix; Different types of matrices; Algebra of matrices; Adjoint and inverse
of a matrix; Elementary transformations of matrices; Matrix polynomials; Calay-Hamilton theory with
uses of rank and nullity; Normal and canonical forms; Solution of linear equations; Eigenvalues and
eigenvectors.
Ordinary Differential Equation (ODE): Degree and order of ordinary differential equations;
Formation of differential equations; Solution of first order differential equations by various methods;
Solution of first order but higher degree ordinary differential equations; Solution of general linear
equations of second and higher orders with constant coefficients; Solution of homogeneous linear
equations and its applications; Solution of differential equations of higher order when dependent and
independent variables are absent; Solution of differential equation by the method based on
factorization of operators.
Partial Differential Equations (PDE): Four rules for solving simultaneous equations of the form;
Lagrange’s method of solving PDE of order one; Integral surfaces passing through a given curve;
Nonlinear PDE of order one (complete, particular, singular and general integrals): standard forms
f(p,q) = 0, z = px + qy + f(p,q), f(p,q,z) = 0, fÂ1(x,p) = f2(y, q); Charpit’s method; Second order PDE:
its nomenclature and classifications to canonical (standard)- parabolic, elliptic, hyperbolic; Solution
by separation of variables. Linear PDE with constant coefficients
Series Solution: Solution of differential equations in series by the method of Frobenius; Bessel,s
functions, Legendre’s polynomials and their properties.
Books:
1. Hans Schneider, George Phillip Barker, Mathematics, Matrices and Linear Algebra,
Dover Publications, 2nd edition, 1989.
2. Morris Tenenbaum, Harry Pollard, Ordinary Differential Equations, Dover Publications,
1985.
3. Peter Olver, Introduction to Partial Differential Equations, Springer, 2014 edition.
4. Dennis G. Zill, Warren S Wright, Differential Equations with Boundary-Value Problems,
Cengage Learning, 8 edition, 2012.
5. Denis Serre, Matrices: Theory and Applications, Springer Science and Business Media,
2012.
5
CSE 153: Electronic Devices and Circuits Credit: 3
Diode Circuits: The diode as a circuit element; Load line; Piece wise linear model; Half wave, full
wave & bridge rectifiers; Voltage regulators and voltage doublers.
Wave shaping Circuit: Clipping, clamping and switching circuits.
Junction Transistor: Construction, operation and characteristics; Operating point and load lines;
Three basic configurations of transistor biasing; biasing stability and thermal runway.
Transistor Equivalent Circuits: Hybrid model; h and  parameters; Low and high frequency
models; Pass band and mid range response, high frequency response, the Miller effect & GBW
products of an amplifier.
Field Effect Transistors: Construction, operation & characteristics, common-source, common-drain
and common-gate configuration.
Amplifiers: Class A, Class B & Class C amplifiers, R-C coupled, Direct coupled and Transformer
coupled amplifier, push-pull, complementary symmetry amplifier, simple tuned, inductively tuned
and double tuned amplifier, power amplifier, wide band amplifier.
Operational Amplifier: Basic operational amplifier; Inverting & non-inverting amplifier;
Differential amplifier; Emitter-coupled differential amplifier; Transfer characteristics of a differential
amplifier; Study of operational amplifier parameters; Frequency response of operational amplifiers.
Basic operational amplifier applications; Instrumentational amplifier; Differential amplifier; Stable ac
coupled amplifier; Analogue integrator & differentiator; Logarithmic and anti-logarithmic amplifiers;
Multipliers; Dividers; Squarer & square rooters; Electronic analogue computation.
Multivibrators: Concepts, Monostable, Astable and Bistable multivibrators using transistor & OP-
AMPs; Schimitt trigger circuits; The 555 timer.
Oscillators: Concept; Circuit requirement for oscillation; Nyquist criterion; Sinusoidal oscillators;
Barkhausen criterion; Phase shift oscillator; Resonant circuit oscillator; A general form of oscillator
circuit; Hartley & Colpitts oscillator; Wein bridge oscillator; Crystal oscillator.
Books:
1. R. L. Boylestad, L. Nashelsky, Electronic Devices and Circuit Theory, PHI, 1999.
2. S. Sedra, K. C. Smith, Microelectronic Circuits, Oxford University Press, 2005.
3. R. K. Mozumder, Principles of Electronic Circuits, Systech Publications, 2006.
4. David A. Bell, Fundamentals of Electronic Devices and Circuits, Oxford University Press,
5th edition, 2009.
5. D. L. Schilling and C. Belove, Electronic Circuits, McGraw-Hill Book Company, 1989.
CSE 154: Electronic Devices and Circuits Laboratory Credit: 1
CSE 155: Discrete Mathematics Credit: 3
Introduction to Discrete Mathematical Structure: Set theory, Mathematical reasoning and proof
techniques; Prepositional calculus and predicate calculus;
Elementary Number Theory: Relations; Functions; Algebraic structures; Graph theory; Paths and
trees; Generating Functions; Permutation groups; Growth of functions;
Discrete Probability: Induction, contradiction and recursion, counting, Principles of inclusion &
exclusion, recurrence relations, rings and groups.
6
Books:
1. Kenneth Rosen, Discrete Mathematics and Its Applications, McGraw-Hill
Science/Engineering/Math, 7th edition , 2011.
2. Seymour Lipschutz, Marc Lipson, Schaum's Outline of Discrete Mathematics, McGraw-Hill,
3rd edition, 2009.
3. Gary Chartrand, Ping Zhang, Discrete Mathematics, Waveland Pr Inc, 1st edition, 2011.
4. David J. Hunter, Essentials Of Discrete Mathematics, Jones & Bartlett Learning, 2nd
edition, 2010.
5. Ronald L. Graham , Donald E. Knuth, Oren Patashnik, Concrete Mathematics: A
Foundation for Computer Science, Addison-Wesley Professional, 2nd edition, 1994.
CSE 157: Structured Programming Language Credit: 3
Understanding the Components of a C program: Compile a program, declaring variables and

assigning values, input from keyboard, Calculation of expression, add comments; variables, constants,
operators & expression; Program control statements: if-else, for loop, while loop, nested if, do while
loop, nested loop; Functions: function prototype, recursion, parameters, arguments; Arrays: one and
multi-dimensional arrays, strings; Pointers: Basics, pointer expression, pointer arrays; Structures;
Memory manipulation.
Books:
1. Mike McGrath, C Programming in Easy Steps, In Easy Steps Limited, 4th edition, 2012.
2. Harry. H. Chaudhary, Absolute Beginner's Guide to C Programming: With 2000+ C Codes
And 23+ Complete Chapter's, CreateSpace Independent Publishing Platform, 2014.
3. Stephen G. Kochan, Programming in C, Addison-Wesley Professional, 4th edition, 2014.
4. B. W. Kernighan and D. M. Ritchie, The C Programming Language – 2nd Edition, Prentice
Hall, 1988.
5. Herbert Schildt, Teach Yourself C, McGraw-Hill Osborne Media, 3 edition, 1997.
CSE 158: Structured Programming Language Laboratory Credit: 1
CSE 159: Numerical Methods Credit: 2
Introduction: Numerical Computing, Errors in Computation, stability and convergences.

Roots of Nonlinear Equations: Bisection, false position and Newton-Raphson method.
Solution of Linear Equations: Gaussian Elimination, Gauss-Jordan Method, Jacobi’s Method,
Gauss-Seidal Method.
Regression: Linear and exponential.
Interpolation: Lagrange and Newton polynomials.
Numerical Differentiation and Integration: Differentiating continuos functions, tabulated
functions, difference tables, Richardson extrapolation; Trapezoidal and Simpson’s 1/3 and 3/8 rules.
Numerical Solution of Ordinary Differential Equation: Taylor series, Picard, Runge-Kutta, Euler’s
method.
Solution of Partial Differential Equations: Determination of characteristics equation of a matrix
7
using Fadeev-Leverrier method; Eigen value and Eigen vector and matrix inversion.
Books:
1. E Balagurusamy, Numerical Method, Tata McGraw-Hill, 2000.
2. Robert J. Schilling and Sandra L Harries, Applied Numerical Method for Engineers,
Thomson Books, 2002.
3. Steven C. Chapra and Raymond P. Canale, Numerical Method for Engineers, McGraw-
Hill, 2002.
4. Amos Gilat, Vish Subramaniam, Numerical Methods with MATLAB, Wiley, 2nd edition,
2010.
5. S. Balachandra Rao & C. K. Shantha, Numerical Methods, 2000.
CSE 160: Numerical Methods Laboratory Credit: 1
CSE 161: Management and Accounting Credit: 3
The Basis of Organization and Management: Historical development of organization and

management; Organization & environment; Management responsibility & ethics; Employee
Personality; Perception; Attitude, Job satisfaction & Commitment.
Project and Risk Management: Defining the phases of a project; creating a project team; risk
management; creating and maintaining project plans, schedules, status reports, and budgets; closing a
project out.
Managerial Decision Making and Organization Planning: Managerial Decision Making-
Relational Vs Group decision; The organizational planning process and MBO; Strategic planning
concept.
Organizing Process of the Organization: Organizing process & informal organization; Delegation
of power, authority & responsibility, management accountability & transparency; Departmentalization
in the organization; Line & staff authority and decengtralization; organization culture; HRM-Human
Resource Management.
Motivating and Leading the Organization: Employee Motivation Techniques and Principles;
Leading the organization; organization communication; Power & Policies in the organization; Group
building and conflict management.
Organizational Control: Principles of organizational control.
Accounting and its Concepts: Recording transitions, adjusting the accounts and preparing the
statements, the worksheet and closing the accounts.
Accounting for a Merchandising Concern: Accounting systems, accounting for cash, notes and
accounts receivable, inventories and cost for goods sold.
Accounting for Plant and Equipment: Current and long term liabilities, corporate accounting,
statement of cash flow, financial statement analysis.
Books:
1. C.M. Kornberger, T. Pitsis, Managing and Organization: An introduction to theory &
Practice, 2004.
2. Y, Gabriel S. Fireman, Organizing & Organizations: An Introduction.
3. Mantel, Meredith, Shafer, and Sutton, Core Concepts: Project Management in Practice,
8
2nd edition, Wiley and Sons, Inc., 2005.
4. J. J. Weygandt, D. E. Kieso, Principles of Accounting 8th ed. 2006.
5. R.E. Ross Claudia, B Gilbertson, Mark W. Lehman, O.D. Manson, Fundamentals of
Accounting of Course 7th Ed.
Second Year First Semester
CSE 201: Mathematics III Credit: 3

( Vector, Complex Variable, Fourier Analysis and Laplace Transformation )
Vector Spaces: Definition and properties, subspaces, basis and dimension, change of basis; Linear
Transformation (LT): definition and properties, linear operator matrix, geometry of LT, standard
plane LT.
Vector Calculus: Differentiation and integration of vectors together with elementary applications;
Definition of line, surface and volume integrals; Gradient, divergence and curl of point functions,
various formulae, Gauss’s theorem, Stoke’s theorem, Green’s theorem.
Complex Variable: Complex number system; General functions of a complex variable; Limits and
continuity of a function of complex variable and related theorems; Complex differentiation and the
Cauchy-Riemann Equations; Mapping by elementaryfunctions; Line integral of a complex function;
Cauchy’s Integral Theorem; Cauchy’s Integral Formula; Liouville’sTheorem; Taylor’s Theorem and
Laurent’s Theorem. Singular points; Residue; Cauchy’s Residue Theorem.Evaluation of residues;
Contour integration; Conformal mapping.
Fourier Analysis: Real and complex form of Fourier series; Finite transform; Fourier Integral;
Fourier transforms and their uses in solving boundary value problems of wave equations.
Laplace Transforms: Definition; Laplace transforms of some elementary functions; Sufficient
conditions for existence of Laplace transforms; Inverse Laplace transforms; Laplace transforms of
derivatives. The unit step function; Periodic function; Some special theorems on Laplace transforms;
Partial fraction; Solutions of differential equations by Laplace transforms; Evaluation of improper
integrals.
Books:
1. George E. Hay, Vector and Tensor Analysis, Dover Publications, 2012.
2. Murray Spiegel, Seymour Lipschutz, John Schiller, Dennis Spellman, Schaum's Outline
of Complex Variables, McGraw-Hill, 2nd edition, 2009.
3. Gerald B. Folland, Fourier Analysis and Its Applications, American Mathematical Society ,
2009.
4. Phil Dyke , An Introduction to Laplace Transforms and Fourier Series, Springer; 2nd edition,
2014.
5. Wilbur R. LePage, Complex Variables and Laplace Transform for Engineers, Dover
Publications, 2010.
9
CSE 203: Statistics I Credit: 3
Introduction to Statistics and Data Description: Field of Statistics, Data, Graphical Presentation of
Data, Numerical Description of Data: Measures of Central Tendency, Measures of Variation,
Correlation and Regression Analysis.
Introduction to Probability: Review of set, Experiments and Sample Spaces, Events, Probability
Definition and Assignment, Tree Diagram, Multiplication Principe, Conditional probability, total
probability, and Bayes’ Theorem and its Application to Engineering problems. One-Dimensional
Random Variable and its Function. Distribution function, Discrete Random Variable, Continuous
Random Variables, Chebyshev’s Inequality.
Joint Probability Distributions: Joint Distribution for Two-Dimensional Random Variables,
Marginal Distributions, Conditional Distributions, Conditional Expectation, Regression of the Mean,
Independence of Random Variables, Covariance and Correlation, the Distribution Function of Two-
Dimensional Random Variables, Functions of two Random Variables.
Discrete Distribution: Bernoulli Trials and the Bernoulli Distribution, Binomial Distribution, Mean
and Variance of the Binomial Distribution, Application of the Binomial Distribution, the Geometric
Distribution, Development from a Poisson, process, Mean and Variance of the Poisson Distribution.
Continuous Distributions: Uniform Distribution, Mean and Variance of the Uniform Distribution,
Distribution, Mean and variance of the Uniform Distribution, Distribution, Mean and Variance of the
Exponential Distribution , The Gamma Distribution, The Weibull, Relay.
Test of Hypothesis: Tests of Hypotheses on a Single Sample, Tests of Hypotheses on two Samples,
Testing for Goodness of Fit, Contingency Table Test.
Books:
1. William W. Hines, Douglas C. Montgomery, David M. Goldsman, Connie M. Borror,
Probability and Statistics in Engineering, Wiley; 4th edition, 2003.
2. Sheldon M. Ross, Introductory Statistics, Academic Press, 3rd edition, 2010.
3. Sheldon M. Ross, Introduction to Probability and Statistics for Engineers and Scientists,
Academic Press, 5th edition, 2014.
4. K.C. Bhuyan, Methods of Statistics, Sahitya Prokashani Dhaka, 2nd revised ed., 2011.
5. M. Nurul Islam, Introduction to Statistics and Probability, Mullick & Brothers, 4th edition,
2011.
CSE 205: Digital Logic Design Credit: 3
Logic Circuits: Gates; Boolean Algebra; De Morgan’s theorem; Half and full adders, Subtractor;
Sum of products and product of sums; Mapping technique; Karnaugh map; Minimization of logic
circuits.
Combinational Circuits: Encoders & decoders; Comparators; Parity generator; Multiplexers;
Demultiplexers.
Sequential Circuits: S-R, M/S, JK, D and T Flip-flops and Latches; Register; Asynchronous and
synchronous counter, Counter applications, Memory.
Converters: Analog to Digital (A/D) and Digital to Analog (D/A) conversion techniques.
ALU: Data Path Design, Controller Design, Memory, Shifter.
Books:
1. Thomas L. Floyd, Digital Fundamentals, PHI, 11th edition, 2014.
10
2. Ronald J. Tocci, Neal Widmer, Greg Moss, Digital Systems: Principles and Applications,
Prentice Hall; 11th edition, 2010.
3. William J. Dally, R. Curtis Harting, Digital Design: A Systems Approach, Cambridge
University Press, 2012.
4. M. Morris Mano, Michael D. Ciletti, Digita Design: With an Introduction to the Verilog
HDL, PHI, 5 edition, 2012
5. Dr. Hafiz Faruque Ahmed Sharif, Computer Hardware and Digital Electronics, M. R. S.
Sharif Publishing, 2007.
CSE 206: Digital Logic Design Laboratory Credit: 1
CSE 207: Data Structures Credit: 3
Introduction: Basic terminology of elementary data organization, data structures, data structures
operations, algorithms, mathematical notation and functions, algorithmic notation, control structures,
complexity of algorithms, asymptotic notations, sub algorithms, variables, data types, etc.
Linear Data Structures: Arrays, records, and pointers; Linked lists; Stacks; Queues; Recursion.
Non-linear Data Structures: Trees, graphs and their applications in details.
String Processing: Basic terminology, storing strings, character data type, string operations, word
processing, pattern matching algorithms, etc.
Sorting and Searching: Introduction, sorting: Insertion sort, selection sort, Merging, Merge-sort,
Radix sort, Searching and Data Modification, Hashing, etc., in detail.
Data Structure with C/C++/Java: Implementing data structures and their operations with C, C++
using STL, and Java.
Books:
1. Seymour Lipchutz, Data Structures with C (Indian Adapted Edition), Tata McGraw-Hill
Education Private Limited, 2011.
2. Narasimha Karumanchi, Data Structures and Algorithms Made Easy: Data Structure and
Algorithmic Puzzles, CreateSpace Independent Publishing Platform, 2nd edition, 2011.
3. Noel Kalicharan, Data Structures In C, CreateSpace Independent Publishing Platform, 1st
edition, 2008.
4. Ford, Topp. Data Structures with C++ using STL, 2nd ed, Prentice Hall, 2002.
5. Ford, Topp. Data Structures with Java, 1st ed, Prentice Hall, 2005.
CSE 208: Data Structures Laboratory Credit: 1
CSE 209: Object Oriented Programming Credit: 3
Introduction to object oriented programming (OOP); Advantages of OOP over structured

programming; Declaration and constants, expression and statements, data types, operator, Functions;
Classes: Base, Derived virtual class; Encapsulation, objects, access specifiers, static and non-static
members; Constructors, destructors and copy constructors; Array of objects, object pointers, and
11
object references; Inheritance: single and multiple inheritance; Polymorphism: overloading, abstract
classes, virtual functions and overriding; Exceptions; Object Oriented I/O; Template functions and
classes; Streams, titles, binary functions, exception handling, Multi-threaded Programming.
Books:
1. Dimitrios Kalemis, The Fundamental Concepts of Object-Oriented Programming,
CreateSpace Independent Publishing Platform, 1st edition, 2013.
2. James Keogh, Mario Giannini, OOP Demystified, McGraw-Hill Osborne Media, 1st
edition, 2004.
3. Matt Weisfeld, The Object-Oriented Thought Process, Addison-Wesley Professional, 4th
edition, 2013.
4. Tony Gaddis, Judy Walters, Godfrey Muganda, Starting Out with C++: Early Objects,
Addison-Wesley; 8th edition, 2013.
5. Tony Gaddis, Starting Out with Java: From Control Structures through Objects, Addison-
Wesley, 5 edition, 2012.
CSE 210: Object Oriented Programming Laboratory (C++) Credit: 1
CSE 211: Graph Theory and Computational Geometry Credit: 2
Graph Theory: Introduction, definitions and examples, paths and cycles, trees and distance,
planarity, coloring graphs, digraphs, matching and factors, marriage, and Menger’s theorem, etc.
Computational Geometry: Introduction, analysis of algorithms, data structures, geometric data
structures, incremental insertion, incremental selection, plane-sweep algorithms, divide-and-conquer
algorithms, spatial subdivision methods, etc.
Books:
1. Douglas B. Brent West, Introduction to Graph Theory, Prentice Hall, 2 ed, 2000.
2. Gary Chartrand, Ping Zhang, Introduction to Graph Theory, 1 ed, The McGraw-Hill
Companies, 2004.
3. Mark de Berg, Mark Overmars, Otfried Schwarzkopf, M. van Kreveld, Computational
Geometry: Algorithms and Applications, Springer-Verlag New York, 2/e, LLC, 2005.
4. Joseph O'Rourke, Computational Geometry in C (Cambridge Tracts in Theoretical
Computer Science), Cambridge University Press, 2/e, 2000.
5. Robin J. Wilson, Introduction to Graph Theory, Pearson Education, Ltd., 4ed, 1996.
Second Year Second Semester
CSE 251: Statistics II Credit: 2
Estimation Theory: Statistical inference, point estimation, interval estimation, Bayesian estimation.
Stochastic Processes and Queueing: Discrete-Time Markov Chains, Classification of States and
12
Chains Continuous-Time Markov Chains, The Birth-Death Process in Queueing. Considerations in
Queueing Models, Basic Single-Server Model with Constant Rates, Single Server with Limited Queue
Length, Multiple Servers with an Unlimited Queue, Other Queueing Models.
Computer Simulation: Motivational Example, Generation of Random Variables, Output Analysis,
Comparison of Systems, Common Random Numbers, Antithetic Random Number, Selecting the Best
system.
Multivariate Statistical Analysis: aspects of multivariate analysis, matrix algebra and random
vectors, sample geometry and random sampling, the multivariate normal distribution, inferences about
a mean vector, comparisons of several multivariate means, multivariate linear regression models,
principal components, factor analysis and inference for structured covariance matrices, canonical
correlation analysis, discrimination and classification, clustering, distance methods, and ordination.
Books:
1. E. Rukmangadachari, Probability and Statistics, Dorling Kindersley (PEARSON), 1st
edition, 2012.
2. Trivedi, K.S., Probability & Statistics with reliability, Queuing, and Computer Science
Application, 2003.
3. Ross, S.M., Simulation, second edition, 1997.
4. Bank, J., Carson, J.S., and Nelson, B.L. (12001), Discrete-Event System Simulation, 2nd
edition.
5. Richard A. Johnson, Dean W. Wichern, Applied Multivariate Statistical Analysis, Pearson,
6th edition, 2007.
6. Arthur Gelb, Applied Optimal Estimation, The MIT Press, 1st edition,1974.
CSE 253: Algorithm Analysis and Design Credit: 3
Introduction to Algorithm and Mathematical Induction: Introductory concepts and definitions

related to algorithms, notation for describing algorithms, introduction to mathematical induction,
examples, counting regions in the plane, simple coloring problem, simple inequality, Euler’s formula,
Finding edge-disjoint paths in a graph, Arithmetic versus geometric means, loop invariant etc.
Analysis of Algorithms’ Complexity and Design of Algorithms by Induction: The O notation,
time and space complexity, recurrence relations: intelligent guesses, divide and conquer relations,
recurrence relation with full history, design by induction: evaluation polynomials, maximal induced
subgraph. finding one-to-one mappings, the Celebrity Problem, The skyline problem, computing
balance factors in binary trees, finding the maximum consecutive subsequence, strengthening the
induction hypothesis etc.
Algorithms Involving Sequences and Sets: introduction, Binary search and variations, Interpolation
search, sorting: Bucket sort, Radix sort, Insertion sort, Selection sort, Mergesort, Quicksort, Heapsort,
order statistics, data compression, string matching, sequence comparisons, probabilistic algorithms,
finding a majority, etc.
Graph and Geometric Algorithms: introduction, Eulerian graphs, graph traversals: Depth-First
Search, Breadth-First Search, Topological Sorting, minimum-cost Spanning trees, ,network flows,
Hamiltonian tours, decomposition of graphs, construction polynomials, convex hulls, closest pair,
intersection of horizontal and vertical line segments, etc.
Dynamic Programming: LIS, LCS, Knapsack problem, Coin change problem etc.
Reductions and NP-Completeness: introduction, examples of reductions, reductions involving linear
programming, reductions for lower bounds, polynomial-time reductions, nondeterminism and Cook’s
13
Theorem, examples of NP-completeness Proofs, techniques for dealing with NP-complete problems,
etc.
Parallel Algorithms: introduction, models of parallel computation, algorithms for shared-memory
machines, algorithms for interconnected networks, systolic computation, etc.
Books:
1. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, 2nd
edition, McGraw-Hill, New York, 2001.
2. Leendert Ammeraal, Algorithms and Data Structures in C++, Wiley.
3. Udi Manber, Introduction to Algorithms: A Creative Approach (Hardcover), Addison
Wesley (January 1, 1989).
4. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-
Completeness, W.H. Freeman, San Francisco, CA, 1979.
5. Anany V. Levitin, Introduction to the Design and Analysis of Algorithms (Paperback),
Addison Wesley; 1st edition (October 30, 2002).
CSE 254: Algorithm Analysis and Design Laboratory Credit: 1
CSE 255: Database Systems Credit: 3
Introduction: Database system concept; Purpose of database system; View of data; Data models;
Conventional file processing; Transaction management; Storage management; Database
administrator.
Database Model: Entity-relationship model; Relational model, Network model; Hierarchical model,
Database languages, SQL, Relational algebra, Integrity constraint, Some applications of SQL.
Database Design: Functional dependencies and normal forms; Object-oriented databases; Distributed
database; multimedia database, object-relational database, Intelligent database.
File System Structure: File organization and retrieval; File indexing; Hashing.
Database Components: Data dictionary, security, transaction and recovery; Concurrency control.
Books:
1. A. Silberschatz, Henry F. Korth, S. Sudarshan, Database System Concepts, McGraw-Hill,
2010.
2. Nenad Jukic, Susan Vrbsky, Svetlozar Nestorov, Database Systems: Introduction to
Databases and Data Warehouses, Prentice Hall, 1st edition, 2013.
3. Ignatius Fernandez, Beginning Oracle Database 12c: From Novice to Professional, Apress,
2nd edition, 2015.
4. Ben Forta, MySQL Crash Course, Sams Publishing, 2005.
5. David Kroenke, David J. Auer, Database Processing: Fundamentals, Design, and
Implementation, Prentice Hall, 13th edition, 2013.
CSE 256: Database Systems Laboratory Credit: 1
14
CSE 257: Data Communication Credit: 3
Introduction: Basic concept of information; Overview on data communication, Entropy; Information

rate; Channel and channel capacity, Transmission modes, Transmission impairments, Guided and
unguided media, Fiber optics communication, Satellite communications: frequency bands and
characteristics.
Data Encoding & Multiplexing: Sampling principal; Nyquist sampling rate; PAM, PWM, PPM,
PCM, DPCM; Delta modulation; A-law & µ -law commanding; ASK, FSK, PSK & QPSK; NRZ,
Bipolar AMI, Manchester, B8ZS, HDB3 coding, constellation, bit error rate (BER); Concepts of
multiplexing, FDM; TDM.
Data Link Control: Flow control; Error detection; Error control; HDLC; Other data link control
protocols.
Circuit Switching & Packet Switching: Switching network; Circuit switching network; Circuit
switching concepts; Routing in CS; Control signaling; Packet switching principles; Routing in PS;
X.25.
ATM and Frame Relay: Protocol architecture; ATM logical connection; ATM cells; Transmission
of ATM cells; ATM service categories; ATM adaptation Layer; Frame Relay.
ISDN: Overview; ISDN channels; ISDN protocols; Broadband ISDN.
Books:
1. Behrouz Forouzan, Data Communications and Networking, McGraw-Hill
Science/Engineering/Math, 5th edition, 2012.
2. William Stallings, Data and Computer Communications, Prentice Hall, 10th edition, 2013.
3. Fred Halsall, Data Communications, Computer Networks and Open Systems, Pearson
Education, 2005.
4. S. Haykin, Communication Systems, LPE, 2006.
5. Prakas C. Gupta, Data Communications, Prentice Hall of India, 1998.
CSE 258: Data Communication Laboratory Credit: 1
CSE 259: Computer Architecture and Organization Credit: 3
Introduction: Instruction codes, formats, cycle, timing etc; Addressing modes; Types of instruction;
RISC characteristics; CISC characteristics.
Computer Arithmetic: Different types of data representation; Addition and subtraction;
Multiplication algorithms; Division algorithms.
Memory Organization: Main memory; Auxiliary memory; Associative memory; Cache memory;
Virtual memory; Memory management requirements and hardware.
Input-Output Organization: Input-Output Interfaces; Data transfer, Interrupts; Direct Memory
Access (DMA); Input-output channel.
Fundamentals of parallel processing: Parallel processing; Pipelining; Vector processing;
Multiprocessors; Array processor, Bit-slice processor Interconnection structures.
Books:
1. David A. Patterson, John L. Hennessy, Computer Organization and Design: The
15
Hardware/Software Interface, Morgan Kaufmann, 5th edition, 2013.
2. John L. Hennessy, David A. Patterson, Computer Architecture: A Quantitative Approach,
Morgan Kaufmann, 5th edition, 2011.
3. William Stallings, Computer Organization and Architecture, Prentice Hall, 9th edition, 2012.
4. Douglas E. Comer, Essentials of Computer Architecture, Addison-Wesley, 1st edition, 2004.
5. John P. Hayes, Computer Architecture, McGraw Hill International Educations, 1998.
CSE 262: Object Oriented Programming Laboratory (JAVA) Credit: 1
Third Year First Semester
CSE 301: Operating Systems Credit: 3
System Concept: Introduction to operating system structure; Types of operating system, Operating
System Components.
Process Management: Introduction to processes; Process synchronization; Concurrent process;
Cooperating process; Communicating processes; Process control; Process scheduling; deadlocks.
Input-Output Management: Management of I/O hardware; Principles of I/O software;
Memory Management: Swapping; Paging; Segmentation; Paging algorithms; Page replacement;
Virtual memory.
File Systems: File structure; Directories; File system structures, implementation, security and
protection techniques; Shared file and file server.
Storage Management: Disk structure, Disk scheduling, RAID.
Design and Implementation: Methodology; Performance evaluation; Case studies include UNIX,
LINUX, WINDOWS etc.
Books:
1. William Stallings, Operating Systems: Internals and Design Principles, Prentice Hall, 8th
edition, 2014.
2. Abraham Silberschatz, Peter B. Galvin, Greg Gagne, Operating System Concepts, Wiley,
9th edition , 2012.
3. Andrew S. Tanenbaum, Modern Operating Systems, Prentice Hall, 4th edition, 2014.
4. Ann McHoes, Ida M. Flynn, Understanding Operating Systems, Cengage Learning, 5th
edition, 2007.
5. Brian Stuart, Principles of Operating Systems: Design and Applications, Cengage Learning,
1st edition, 2008.
CSE 302: Operating Systems Laboratory Credit: 1
16
CSE 303: Microprocessors and Microcontrollers Credit: 3
Microprocessors: Microprocessor architecture; Instruction sets and data representation; Assembly

and machine language programming using 8/16 bit microprocessors with examples; Microprocessor
timings; Keyboard/display, parallel/serial, interrupt controller and DMA interfacing ICs; Interrupt
types; System timings; Bus standards; Memory organization; Types of memory; Timing and control
credit; Input/output circuitry; Systems timing examples for memory and I/O read and write; Use of
polling and interrupts;
Advanced Microprocessors: Intel 80286 architecture, 80286-memory management, Protection; Intel
80386 functional diagram; 386 programming model; 80386 modes; Multi programming; Pentium
microprocessors.
Books:
1. Mohamed Rafiquzzaman, Ph. D., Microprocessors and Microcomputer-Based System
Design, 1995.
2. Douglas V. Hall, Microprocessors and Interfacing: Programming and Hardware, 1994.
3. Ramesh S. Gaonkar, Microprocessor Architecture Programming and Applications with the
8085/8080A, 1995.
4. Driscoll, F. F.; Couglin, R. F. and Villanucci, R. S., Data Acquisition and Process Control
with the M68HCII Micro controller, McMillan, 1994.
5. Mazidi, Muhammad A. and Gillispie Mazidi, Janice Catherine, 80X86 IBM PC and
Compatible Computers: Assembly Language, Design and Interfacing, Vols.1 and 2, 4th Ed.,
Prentice Hall, 2002.
CSE 304: Microprocessors and Microcontrollers Laboratory Credit: 1
CSE 305: Web Design and Programming Credit: 3
Web Engineering : Introduction to web engineering, requirements engineering for web applications,
modeling web applications, web application architectures, technology-aware web application design,
technologies for web applications, testing web applications, operation and maintenance of web
applications, web project management, the web application development process, usability of web
applications, performance of web applications, security for web applications, the semantic web - the
of meanings in the network of documents, etc.
Web Programming: Introduction to the Internet, the web, web 2.0 and Ajax, browser basics ,
XHTML, cascading style sheets (CSS), JavaScript, Dynamic HTML, XML, RSS, building Ajax-
enabled web application, Macromedia Flash, Adobe ® FlexTM ,Macromedia ® Dreamweaver ®, web
servers (IIS and Apache), databases: SQL, MySQL, DBI and ADO.NET 2.0, web services, PHP,
Ruby and Ruby on Rails, ASP.NET, web forms and web controls, Java Server Pages web
applications, Perl and CGI (Common Gateway Interface), etc.
Books:
1. Gustavo Rossi (Editor), Oscar Pastor (Editor), Daniel Schwabe (Editor), Luis Olsina
(Editor), Web Engineering: Modelling and Implementing Web Applications, Springer; 2008
edition.
17
2. Jason Beaird, James George, The Principles of Beautiful Web Design, SitePoint, 3rd
edition, 2014.
3. Jessica Miller, Victoria Kirst, Marty Stepp, Web Programming Step by Step, Step by Step
Publishing; 2nd edition , 2012.
4. Jon Duckett , HTML and CSS: Design and Build Websites, Wiley, 1st edition, 2011.
5. Tris Hussey, WordPress Absolute Beginner's Guide, Que Publishing, 1st edition ,April 26,
2014.
CSE 306: Web Design and Programming Laboratory Credit: 1
CSE 307: System Analysis and Design Credit: 2
Introduction, Project management, requirement determination, business process and functional

modeling, structural modeling, behavirol modeling, moving to design, class and method design, data
management layer design, human-computer interaction layer design, physical architecture layer design,
construction, installation, and operations.
Books:
1. Grady Booch, Object-Oriented Analysis and Design with Applications (3rd Edition),
Addison-Wesley Professional, 2007.
2. Jeffrey Whitten and Lonnie Bentley , Systems Analysis and Design Methods, Irwin
Professional Publishing, 2005.
3. Mahesh P. Matha, Object-Oriented Analysis and Design Using UML – An Introduction to
Unified Process and Design Patterns, Prentice-Hall of India Private Limited, 2008.
4. Alan Dennis, Barbara Haley Wixom, Roberta M. Roth , Systems Analysis and Design,
Wiley, 4th edition, 2008.
5. Howard Podeswa, UML For The IT Business Analyst, Course Technology PTR (2nd
Edition), 2009.
CSE 308: System Analysis and Design Laboratory Credit: 1
CSE 309: Theory of Computation Credit: 2
Introduction: Basic concepts, automata theory, computability theory, etc; Mathematical notions and
terminology: sets, sequences and tuples, functions and relations, graphs, strings and languages,
Boolean logic, etc; Proofs: concepts of definition, theorem, and proofs, finding proofs, types of
proofs- proof by construction, proof by contradiction, proof by induction.
Automata and Languages: Regular Languages, finite automata, nondeterminism, regular
expressions, non-regular languages, etc; Context-free languages: context-free grammars, pushdown
18
automata, non-context-free languages, etc.
Computability Theory: The Church-Turing thesis, Turing machines, variants of Turing machines,
the definition of algorithm- Hilbert’s problems, etc.; Decidability: decidable languages, the Halting
problem, etc.; Reducibility: undecidable problems from language theory, Post Correspondence
Problem (PCP), mapping reducibility, etc.; Advanced topics in computability theory: the recursion
theorem, decidability of logical theories, Turing reducibility, a definition of information, etc.
Complexity Theory: Time complexity: measuring complexity, the class P, the class NP, NP-
completeness, additional NP-complete problems, etc.; Space complexity: Savitch’s theorem, the class
PSPACE, PSPACE-completeness, the classes L and NL, NL-completeness, NL equals coNL, etc.;
Intractability: hierarchy theorems, relativization, circuit complexity, etc.; Advanced topics in
complexity theory: approximation algorithms, probabilistic algorithms, alternation, interactive proof
systems, parallel computation, cryptography, etc.
Books:
1. Michael Sipser, Introduction to the Theory of Computation, Cengage Learning; 3r edition,
2012.
2. J. Glenn Brookshear, Theory of Computation: Formal Languages, Automata, and
Complexity, Prentice Hall, 1st edition, 1989.
3. Peter Linz, An Introduction to Formal Languages and Automata (4th Edition), Jones &
Bartlett Publishers, Inc., 2006.
4. Martin Davis, Ron Sigal, Elaine J. Weyuker, Computability, Complexity, and Languages:
Fundamentals of Theoretical Computer Science, Morgan Kaufmann; 2 edition, 1994.
5. Harry R. Lewis and Christos H. Papadimitriou, Elements of The Theory of Computation
(2nd ed.), Pearson Education, 1998.
CSE 311: Technical Writing and Presentation Credit: 2
Issues of technical writing and effective oral presentation in Computer Science and Engineering;
Writing styles of definitions, propositions, theorems and proofs; Preparation of reports, research
papers, theses and books: abstract, preface, contents, bibliography and index; Writing of book reviews
and referee reports; Writing tools: LATEX; Diagram drawing software; Presentation tools.
Books:
1. Gerald J. Alred, Charles T. Brusaw, Walter E. Oliu, Handbook of Technical Writing, St.
Martin's Press, 10th edition, 2011.
2. Angelika H. Hofmann, Scientific Writing and Communication: Papers, Proposals, and
Presentations, Oxford University Press, 1st edition, 2009.
3. Richard L. Sullivan, Jerry L. Wircenski, Technical Presentation Workbook, ASME Press,
3rd edition, 2010.
4. Leo Finkestain, Pocket book of Technical writing for Engineers & Scientists, McGraw. Hill,
2004.
5. Heather Silyn-Roberts, Writing for Science and Engineering : Papers, Presentations and
Reports, Elsevier, 2nd edition, 2012.
19
Third Year Second Semester
CSE 351: Computer Graphics and Visualization Credit: 3
Introduction, Graphic I/O Devices, and Scan-conversion: Concepts of computer graphics, object
space, image space, image representation, RGB and CMYK color model, direct coding, lookup tables,
image files, etc.; Graphic I-O Devices: random scan displays, raster refresh graphics displays,
interactive devices, logical functioning of graphic I-O devices, output devices, etc.; Scan Conversion:
scan-conversion of a point, a line, a circle, an ellipse, arcs and sectors, a polygon, a character, region
fillings, aliasing effects, anti-aliasing, image compression, recursively defined drawings, etc.
Graphics Programming: Overview of tools and techniques of graphics programming using
OpenGL, MATLAB, C/C++, JAVA, etc.
Transformations (2D and 3D), Projections, and Ray Tracing: 2D and 3D Transformations:
geometric transformations, coordinate transformations, composite transformations, instance
transformations, shearing transformations, etc.; Projections: taxonomy of projection, perspective
projection, parallel projection, etc.; Ray Tracing: the pinhole camera, recursive ray-tracer, parametric
vector representation of a ray, ray-surface intersection, execution efficiency, anti-aliasing, additional
visual effects, etc.
Curves, Surfaces, and hidden Surfaces: simple geometric forms, wireframe models, curved
surfaces, curve design, polynomial basis functions, the problem of interpolation and approximation,
curved surface design, transforming curves and surfaces, quadratic surfaces, terrain generation, fractal
geometry methods, etc.; Hidden Surfaces: depth comparisons, Z-buffer algorithm, back-face removal,
the Painter’s algorithm, scan-line algorithm, subdivision algorithm, hidden-line elimination, rendering
of mathematical surfaces, Warnock’s algorithm, Weiler-Atherton algorithm, etc.
Color Models, and Shading Models, Computer Animation: Light and color, the Phong model,
interpolative shading methods, texture, etc.; Computer Animation: overview of design of animation
sequences, basic rules of animation, problems in animation, techniques of animation, morphing, etc.
Books:
1. T. Theoharis, G. Papaioannou, N. Platis, N. M. Patrikalakis, Graphics and Visualization:
Principles & Algorithms, A K Peters/CRC Press, 2007.
2. Zhigang Xian, Roy A. Plastock, Schaum's, Outline of Computer Graphics (2nd Edition),
The McGraw-Hill Companies, 2000.
3. Angel, Interactive Computer Graphics: A Top-Down Approach Using OpenGL (4th ed.),
Addison-Wesley, 2005.
4. Francis S. Hill Jr., Stephen M. Kelley, Computer Graphics Using Open GL (3rd Edition),
PEARSON Education, 2006.
5. James D. Foley, Andries van Dam, Steven K. Feiner, John F. Hughes, Computer
Graphics: Principles and Practice in C (2nd Edition), Addison-Wesley Professional, 1995.
CSE 352: Computer Graphics and Visualization Laboratory Credit: 1
20
CSE 353: Compiler Design Credit: 2
Design Principles and Techniques: Introduction; A simple syntax-directed translator; Lexical

analysis; Syntax analysis; Syntax-directed translation; Intermediate-code generation; Run-time
environments; Code generation; Machine-independent optimizations; Instruction-level parallelism;
Optimizing for parallelism and locality; Interprocedural analysis, etc.
Tools for Programming, Parser Generation, Debugging and Testing in Linux: Programming
tools: the GNU compiler tool chain, building software with GNU make, building and using libraries,
coverage testing with GNU gcov, profiling with GNU gprof, building packages with
automake/autoconf, etc.; parser generation with flex and bison; Debugging and Testing: software unit
testing frameworks, debugging with GDB, code hardening, etc.
Books:
1. Parag H. Dave, Himanshu B. Dave, Compilers: Principles and Practice, Dorling
Kindersley(India) Pvt. Ltd. (Pearson education),1st edition,2012
2. Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman, Compilers: Principles,
Techniques, and Tools (2nd Edition), PEARSON Education, 2006.
3. Allen I. Holub, Compiler Design In C, Prentice-Hall of India (PHI) Private Limited, 1990.
4. M. TIM JONES, GNU/LINUX Application Programmong, Charles River Media, Inc, 2005.
5. Henk Alblas and Albert Nymeyer, Practice and Principles of Compiler Building with C,
Prentice-Hall of India (PHI) Private Limited, 1996.
CSE 354: Compiler Design Laboratory Credit: 1
CSE 355: Digital Signal Processing Credit: 3
Concept of discrete time signals and digital signals; Some special sequences like unit step, impulse,
exponential, sinusoidal periodic and non-periodic etc.; Linear, causal, time invariant, moving average
and LTI systems; Convolution and correlation of sequences, DFT, IDFT, FFT, IFFT and Z-
transformation; Concept of digital filter, Pros and cons of IIR and FIR filter, Design of low pass, high
pass, band pass, stop band and notch filters; Adaptive filter, Winner filter theory, LMS and RLS
algorithm for detection of filter coefficients; Biomedical and telecommunications signal processing;
Special purpose hardware for DSP.
Books:
1. John G. Proakis and Dimitris G. Manolakis, Digital Signal Processing, Principles,
Algorithm and Applications, Prentice-Hall of India, 2002.
2. Richard G. Lyons, D. Lee Fugal, The Essential Guide to Digital Signal Processing, Prentice
Hall, 1st edition, 2014.
3. Emmanuel C. Ifeachor and Barrie W. Jervis, Digital Signal Processing, A Practical
Approach, Addison-Wesley, 2002.
4. Sanjit K. Mitra, Digital Signal Processing A computer based approach, McGraw-Hill, 2004.
5. Simon Haykin, Adaptive Filter Theory, Pearson Education, 2003.
21
CSE 356: Digital Signal Processing Laboratory Credit: 1
CSE 357: Software Engineering Credit: 3
Software Engineering Paradigms: Definition of S/W Engineering; The classical life cycle;
Prototyping fourth generation technique; The product and the process, measurement, matrices.
Requirements Analysis Fundamentals: Analysis principle; Software prototyping specification;
Requirement analysis methodologies; Structured and object oriented analysis; Data flow-oriented
analysis methods.
Software Design Fundamentals: Design process; Design fundamentals: S/W architecture program
structure; data structure, S/W procedure, modularity, abstraction; Effective modular design;
Procedural design; Data flow-oriented Design; Top-down and bottom-up design; Design process
considerations; Transform analysis; Transaction analysis; Data structure-oriented design: Logical
construction of programs and systems, Data structured systems development; object-oriented design;
Design concepts; Methods; Strategy; Real-time Design; Coding style: Code documentation, Data
declaration, Statement construction, Input/output.
Software Testing Techniques and Strategies: Testing fundamentals; White box testing; Basis path
testing; Loop testing; Black Box testing; Verification and validation; Organization for software
testing; Credit testing; Integration testing; Validation testing; System testing; The art of debugging.
Formal Methods and Specification Language: Formal specification rationale; Introduction to
predicate calculus; Formal specification techniques; Pre/post conditions, Algebraic specification;
Format (Signature, axioms); Steps in definition; Structured algebraic specification; Introduction to
specification language Z; Steps in Z; Logic.
Books:
1. Ian Sommerville, Software Engineering, Addison-Wesley; 9th edition, 2010.
2. Roger S. Pressman, Software Engineering, McGrawHill International Edition, 2001.
3. David Alex Lamb, Software Engineering, Prentice-Hall International Editions, 1998.
4. David Kung, Object-Oriented Software Engineering: An Agile Unified Methodology,
McGraw-Hill Science/Engineering/Math, 1st edition, 2013.
5. Capers Jones, Software Engineering Best Practices: Lessons from Successful Projects in the
Top Companies, McGraw-Hill Osborne Media, 1st edition, 2009.
CSE 359: Computer Peripherals and Interfacing Credit: 2
Introduction to I/O organization of a typical computer; Computer peripheral interfacing input and
output devices; Micro computer ports: Serial, Parallel, Mouse; I/O multi processing interfacing; Inter
processor communication schemes; Human computer interface; Virtual reality: Interface for real
application, wireless interfacing; Optical computing devices; Intelligent interface machines.
Books:
1. Jyoti Snehi, Computer Peripherals and Interfacing, Laxmi Publications, 2006.
2. Prof K M Bhurchandi, Prof A K Ray, Advanced Microprocessors and Peripherals: With
ARM and an Introduction to Microcontrollers and Interfacing, Tata McGraw Hill Education
22
Private Limited, 3rd edition, 2012.
3. K. L. James, Computer Hardware: Installation, Interfacing, Troubleshooting and
Maintenance, Prentice-Hall of India Pvt.Ltd, 2013.
4. Driscoll, F. F.; Couglin, R. F. and Villanucci, R. S., Data Acquisition and Process Control
with the M68HCII Micro controller, McMillan, 1994.
5. Hall, Douglas V., Microprocessors and Interfacing/Programming and Hardware, 3rd Ed.,
McGraw Hill, 1998.
CSE 360: Computer Peripherals and Interfacing Laboratory Credit: 1
CSE 362: Mobile Application Development Laboratory Credit: 1
Resource-sensitive development-Mobile devices vs. desktop devices, ARM and intel architectures,
Screen resolution, Touch interfaces, Application deployment, Development environments, Native vs.
web applications;
Small device user interfaces -Quick recap of technologies, Mobile-specific enhancements;
Gestures and multi-touch interfaces- Browser-detection, Touch interfaces, Geolocation, Screen
orientation, Mobile browser interpretations;
Mobile OS Architectures - Comparing and Contrasting architectures of all three – Android, iOS and
Windows, Hardware sensors- Underlying OS (Darwin vs. Linux vs. Win 8), Kernel structure and
native level programming and Runtime approach;
GPS and location-aware computing-App-structure, built-in Controls, file access, basic graphics, DB
access, network access; Underneath the frameworks- low level APIs ; Battery and power
management, Mobile device security.
Books:
1. Valentino Lee, Heather Schneider, Robbie Schell, Mobile Applications: Architecture,
Design, and Development: Architecture, Design, and Development, Prentice Hall, 1st edition,
2004.
2. Reto Meier, Professional Android 4 Application Development, Wrox professional press,
2012.
3. Jeff McWherter and Scott Gowell, Professional Mobile Application Development, John
Wiley and Sons Inc., 2012.
4. Brian Hardy and Bill Phillips, Android Programming: The Big Nerd Ranch Guide, Big
Nerd Ranch Guides, 2013.
5. Deitel, Deitel, Deitel, Kern and Morgano, iPhone for Programmers, Prentice Hall.
23
Fourth Year First Semester
CSE 401: Computer Networks Credit: 3
Introduction: Basic computer network concept; Network structure; Network software; Reference
model; Example networks.
Physical layer: Transmission media; PSTN; Mobile telephone system; ADSL.
Data Link Layer: Data link layer design issues; Error detection and correction; Elementary data link
protocols; Sliding window protocols; HDLC; The data link layer in the Internet.
Medium Access Sub-layer: Multiple Access Protocols: ALOHA; CSMA/CD Protocol; Collision-free
protocols; Wireless LAN protocols; Ethernet; Bluetooth; Data link layer switching.
Network Layer: Network layer design issues; Routing algorithms; Congestion control algorithms;
Internetworking; Network layer in the internet; Network layer in ATM networks.
Transport Layer: The transport service; Elements of transport protocols; The internet transport
protocols;
Application Layer: DNS-Domain Name System; Electronic Mail; The World Wide Web;
Multimedia.
Network Security: Secrecy; Authentication; Digital signature.
Books:
1. Andrew S. Tanenbaum , David J. Wetherall, Computer Networks, Prentice Hall,5 edition,
2010.
2. Nader F. Mir, Computer and Communication Networks, Prentice Hall, 1st edition, 2006.
3. Jr. Kenneth C. Mansfield, James L. Antonakos, Computer Networking from LANs to
WANs: Hardware, Software and Security, Cengage Learning, 1st edition, 2009.
4. Darril Gibson, Microsoft Windows Networking Essentials, Sybex, 1st edition, 2011.
5. Troy McMillan, Cisco Networking Essentials, Sybex, 1st edition, 2011.
CSE 402: Computer Networks Laboratory Credit: 1
CSE 403: Artificial Intelligence Credit: 3
Introduction to AI, Knowledge: General concepts; Intelligent agents; Problem solving by searching:
blind (uninformed) and heuristic (informed) search techniques.
The Foundations of Logic: First Order Predicate Logic (FOPL), propositional logic.
Structured Knowledge: Semantic nets; Frames; Conceptual dependencies.
Searching in AI: DFS, BFS, Hill climbing, best-first search, game playing strategies and algorithms.
Natural Language Processing: Overview of linguistics, grammars, parsing techniques, RTN.
AI Languages: PROLOG/LISP.
Fuzzy logic: Fuzzy and Crisp logic; membership functions, Fuzzy sets, hedges.
Books:
1. Stuart J. Russel and Peter Norvig, Artificial Intelligence – A Modern Approach, Prentice-
Hall of India (PHI), New Delhi, 2003.
24
2. Dan W. Patterson, Introduction to Artificial Intelligence and Expert Systems, Prentice-Hall
of India (PHI), New Delhi, 2003.
3. S. Rajasekaran, G.A. Vijayalakshmi Pai, Neural networks, Fuzzy logic, and Genetic
Algorithm ,Prentice-Hall of India, New Delhi, 2004.
4. Ivan Bratko, PROLOG: Programming for Artificial Intelligence, Pearson Education, 2001.
5. Patrick Henry Winston, Berthold Klaus Paul, LISP, Pearson Education, 1989.
CSE 404: Artificial Intelligence Laboratory Credit: 1
CSE 405: VLSI Circuits Design Credit: 2
Basic concepts of epitaxy, oxidation, lithography, masking and etching, diffusion, ion implantation
and metallization; enhancement and depletion mode of MOS; nMOS, CMOS, BiMOS and their DC
characteristics; pull-up to pull-down ratio; switching characteristics, power dissipation, pass-transistor
and transmission gates, Design and analysis techniques for VLSI circuits; CMOS standard cell, gate
array layout, Sea-of-Gates layout, Design of reliable VLSI circuits; Noise consideration; Design and
operation of large fan out and fan in circuits, clocking methodologies; techniques for data path and
data control design, adders, multiplier and memory system, arithmetic logic unit, programmable logic
arrays. I/O systems. Simulation techniques; parallel processing, Special purpose architectures in VLSI
layout partitioning and placement routing and wiring in VLSI;
Books:
1. Neil H. E. Weste & Kamran Eshraghian, Principle of CMOS VLSI Design, A Sysytem
Perspective, Pearson Education, 2004.
2. Neil H. E. Weste, David Harris, Ayan Banerjee, CMOS VLSI Design, Pearson Education,
2006.
3. R. Jacob Baker, CMOS Circuit Design, Layout, and Simulation, Wiley-IEEE Press, 3rd
edition, 2010.
4. Doughlas A. Puckneill & Kamran Eshraghian, Basic VLSI Design, Prentice Hall of India,
2003.
5. Linda E. M. Brackendury, Design of VLSI Systems, A pactical Introductions, M.
Macmillan, 1987.
CSE 406: VLSI Circuits Design Laboratory Credit: 1
CSE 407: Digital Image Processing Credit: 3
Image processing applications, image function, image representation, sampling and quantization,
binary, gray scale and color images, histograms, noise in images.
Image enhancement and filtering: Point processing, histogram equalization, modeling, and
specification, spatial filtering – image smoothing, median filtering, edge detections – Sobel, Prewit,
Laplacian and Canny edge detectors.
Image segmentation: Thresholding and adaptive thresholding, region merging and splitting;
25
Image restoration: Convolution, restoration model, Inverse filtering, blind deconvolution and
Wiener filtering.
Object recognition: image moments, central moments, moment invariants, template matching, area
correlation, texture description, Hough transformation for line and curve detections.
Image morphology: Basic morphological concepts, structuring elements, erosion, dilation, thinning,
thickening, opening, and closing operations.
Image transformations: DFT/FFT, Cosine Transformation
Image compression: Run-length encoding, Huffman Coding.
Books:
1. A. K. Jain, Fundamentals of Digital Image Processing, Prentice Hall, 1990.
2. Rafael C. Gonzalez, Richard E. Woods, Digital Image Processing, Prentice Hall, 3rd
edition, 2007.
3. Rafael C. Gonzalez, Richard E. Woods, Steven L. Eddins, Digital Image Processing Using
MATLAB, Gatesmark Publishing, 2nd edition 2009.
4. Oge Marques, Practical Image and Video Processing Using MATLAB, Wiley-IEEE Press,
1st edition, 2011.
5. Mark Nixon, Feature Extraction & Image Processing for Computer Vision, Academic Press,
3rd edition, 2012.
CSE 408: Digital Image Processing Laboratory Credit: 1
CSE 409: Simulation and Modeling Credit: 3
Simulation modeling basics; Systems, models, and simulation; Classification of simulation models;
Steps in simulation study; Concepts in discrete event simulation; The event-scheduling/time-advance
algorithm; World views; Monte-Carlo simulation; Simulation of queuing system; Statistical models in
simulation; Input modeling; Verification and validation of simulation models; Output analysis,
Simulation of computer systems; Introduction to simulation packages.
Books:
1. Jerry Banks, John S. Carson, Barry L. Nelson, David M. Nicol, Discrete-Event System
Simulation, Pearson Education, 2001.
2. Geoffrey Gordon, System Simulation, Prentice-Hall, 1978.
3. Averill M. Law, W. Dabid Kelton, Simulation Modeling and Analysis, McGraw-Hill, 1982.
4. Narsingh Deo, System Simulation with Digital Computer, Prentice-Hall, 1983.
5. Reuven Y. Rubinstein, Alexander Shapiro, Benjamin Melamed, Modern Simulation and
Modeling, Wiley, John and Sons, 1998.
CSE 411: Software Testing and Quality Assurance Credit: 2
Definition and concept of software quality assurance (SQA); quality models; specification of quality
requirements; product development & delivery issues; software development processes & maturity;
software quality management process: total quality management, improvement cycle, SQA planning
& management, organizing the SQA effort; software verification & validation; typical software
26
development errors; Fagan inspections; software audit; software testing: testing objectives & testing
fundamentals, testing theory, coverage criteria, equivalence class testing, value-based testing, decision
table, syntax & state transition testing, statement & path testing, branch & condition testing, data flow
testing, thread-based testing, integration & integration testing, system testing; testing in object-
oriented systems; test tools & test automation; test management; problem reporting & corrective
action.
Books:
1. Robert Furtell, Donald Shafer, and Linda Shafer, Quality Software Project Management,
Prentice Hall, 2001.
2. Robert Binder, Addison Wesley, Testing Object–Oriented Systems: Models, Patterns, and
Tools, 1999.
3. G. Schulmeyer, Handbook of Software Quality Assurance, et al (2007)
4. Paul Ammann and Jeff Offut. Introduction to Software Testing. Cambridge University
Press, 2008.
5. Andreas Zeller. Why Programs Fail: a Guide to Systematic Debugging. Morgan Kaufmann,
2005.
6. Murali Chemuturi, Mastering Software Quality Assurance: Best Practices, Tools and
Techniques for Software Developers, J. Ross Publishing, 1st edition, 2010.
Fourth Year Second Semester
CSE 451: Pattern Recognition and Machine Learning Credit: 3
Introduction: Introduction to machine learning; Learning using decision trees; Neural networks;
Fuzzy sets and systems; Evolutionary algorithms; Hybrid intelligent methods; Inductive logic
programming; Ensemble methods; Evaluating models and algorithms; Computational learning theory;
Linear threshold classifiers; Linear discriminant analysis; Off-the-shelf learning algorithms; Decision
trees; Nearest neighbor; Neural networks; Support vector machines; Naïve Bayes
Learning Theory: PAC learning theory; Bayesian learning theory; Bias/variance theory.
Sequential Supervised learning: Hidden Markov models; Conditional random fields; Discriminative
methods;
Books:
1. Christopher M. Bishop, Pattern Recognition and Machine Learning, Springer , 2007.
2. Sergios Theodoridis, Konstantinos Koutroumbas, Pattern Recognition, Academic Press,
4th edition, 2008.
3. Sergios Theodoridis, Aggelos Pikrakis, Konstantinos Koutroumbas, Dionisis Cavouras,
Introduction to Pattern Recognition: A Matlab Approach, Academic Press, 1st edition, 2006.
4. Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar, Foundations of Machine
Learning, he MIT Press, 2012.
5. Ethem Alpaydin, Introduction to Machine Learning, The MIT Press; 3rd edition edition,
27
2014.
CSE 452: Pattern Recognition and Machine Learning Laboratory Credit: 1
Credit: 2
CSE 453: Wireless Networks
Course overview and history, radio access, modulation, physical layer rudiments, error control,
multiple access, TDMA, CDMA. Network layer, protocol, switching, signaling, mobility
management, traffic engineering and management. First generation cellular AMPS, network design,
Second generation voice systems, speech coding, TDNA/IS-136, CDMA/IS-95, GSM, mobile data
systems, GPRS, EDGE, mobile IP, wireless LAN, CSMA/CD, IEEE 802.11, wireless residential
networks, satellite telephony. Cellular digital packet data, architecture, MAC protocol, wireless ATM.
The 3G and 4G mobles, UMTS services, architecture and infrastructure. Network operations and
traffic control. Security cryptography, authentication, key management.
Books:
1. Clint Smith, Daniel Collins, Wireless Networks, McGraw-Hill Professional, 3rd edition ,
2014.
2. Vijay. K. Garg, Wireless Communication and Networking, Morgan Kaufmann Publishers,
2007.
3. Andreas F. Molisch, Wireless Communications, Wiley, 2nd edition, 2010.
4. Jack L. Burbank, Julia Andrusenko, Jared S. Everett, William T.M. Kasch, Wireless
Networking: Understanding Internetworking Challenges, Wiley-IEEE Press, 1st edition,
2013.
5. K. Daniel Wong, Fundamentals of Wireless Communication Engineering Technologies,
Wiley; 1st edition, 2012.
CSE 454: Wireless Networks Laboratory Credit: 1
CSE 455: Multimedia and Animation Techniques Credit: 2
Multimedia: Introduction; Coding and compression standards; Architecture issues in multimedia;

Operating systems issues in multimedia - real-time OS issues, synchronization, interrupt handling;
Database issues in multimedia - indexing and storing multimedia data, disk placement, disk
scheduling, searching for a multimedia document; Networking issues in multimedia - Quality-of-
service guarantees, resource reservation, traffic specification, haping, and monitoring, admission
control; Multicasting issues; Session directories; Protocols for controlling sessions; Security issues in
multimedia, digital water-marking, partial encryption schemes for video streams; Multimedia
applications – audio and video conferencing, video on demand, voice over IP.
Introduction to Animation-Classic and nontraditional animation techniques: stop motion, cut-paper,
direct-on-film and drawing techniques;Interactive Media, Sound Design: scoring; mixing; and sound-
image synchronization; Computer Animation: study of modeling, motion, transformation, lighting and
texturing; Expression in Time and Motion, 3D Animation Techniques; Special Effects and Motion
28
Graphics.
Books:
1. T.M. Savage, K.E. Vogel, An Introduction to Digital Multimedia, Jones & Bartlett Learning,
2nd edition, 2013.
2. Tay Vaughan, Multimedia: Making It Work, McGraw-Hill Osborne Media, 9th edition,
2014.
3. Sugata Mitra, Gaurav Bhatnagar, Introduction to Multimedia Systems, Academic Press,
1st edition, 2001.
4. Richard Williams, The Animator's Survival Kit: A Manual of Methods, Principles, and
Formulas for Classical, Computer, Games, Stop Motion and Internet Animators, Faber &
Faber; Second Edition, Revised Edition, 2012.
5. Mary Murphy, Beginner's Guide to Animation: Everything you Need to Know to get
Started, Watson-Guptill, 2008.
CSE 456: Multimedia and Animation Techniques Laboratory Credit: 1
CSE 457: Computer Ethics and Cyber Law Credit: 2
Privacy: introduction, threats, issues, technical methods of protection, philosophy, policies.

Communications issues and cryptography: Computer errors and failures, accountability, liability,
Risks, comparisons with other technologies, importance of professionalism. Freedom of speech:
attempts to censor the Internet, library filters, international issues. Anonymity, spam. Intellectual
property: copyright and fair use. Copyright versus patent versus trade secret. ``Piracy'' of software,
music, movies, etc. Copy protection techniques and controversies. DMCA controversies. Free
software, free-speech issues.
Computer Crime: hacking, online scams, fraud, civil liberties online, security, viruses. Computers in
the workplace: effects on employment, telecommuting. Employee monitoring. Email privacy. Societal
issues: community, access to computing, gender and race issues. Bad technologies. Ethical issues for
computer professionals; professional code of practice
Books:
1. Brian Craig, Cyberlaw: The Law of the Internet and Information Technology, Prentice Hall;
1st edition, 2012.
2. Terrell Ward Bynum, Simon Rogerson, Computer Ethics and Professional Responsibility,
Weily Blackwel, 1st Edition, 2003.
3. W. Stallings, Cryptography and Network Security Principles and Practice, Prentice Hall,
New Jersey, 1999.
4. Deborah G. Johnson, Computer Ethics, Pearson, 4th Edition, 2009.
5. Jonathan Rosenoer, CyberLaw: The Law of the Internet, Springer, 1996 Edition.
CSE 459: Data Mining Credit: 2
Basic concepts of data mining, statistics and machine learning. Acquiring, parsing,
filtering, mining, representing, refining and interacting with data
29
Frequent pattern algorithms: Association Rule Mining, Sequential Pattern Mining, Mining frequent
structures.
Classification algorithms: Decision Tree Classification, Naive Bayesian Classification; K-means
clustering. Data visualization. Scalable Data Mining algorithms and systems support, Parallel
algorithms. Database integration, Data Locality Issues.
Data Preprocessing: Transformation, Reduction, etc.
Data Warehousing: Architecture, Operations, Applications, Data Mining Query Language (DMQL)
Applications: Genomic Microarray Data Analysis.
Books:
1. J. Han and M. Kamber, Data Mining: Concepts and Principles.
2. Tan, Steinbach and Kumar, Introduction to Data Mining, Addison Wesley, 2006.
3. Max Bramer, Principles of Data Mining (Undergraduate Topics in Computer Science),
Springer, 2007.
4. Ian H. Witten, Eibe Frank, Data Mining: Practical Machine Learning Tools and
Techniques, Morgan Kaufmann, 2005.
5. J. Han and Michiline Kamber Simon Fraser University, Canada. Data Mining: Concepts
and Techniques.
CSE 460: Data Mining Laboratory Credit: 1
CSE 480: Project Work Credit: 3
30

Syllabus PDF

Uploaded by

Copyright:

Available Formats

Syllabus PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Syllabus PDF

Uploaded by

Copyright:

Available Formats

Dept.

of Computer Science and Engineering

Marks Range Letter Grade Grade Point

First Year First Semester

Course Code Course Title Credit

First Year Second Semester

Course Code Course Title Credit

Course Code Course Title Credit

Second Year Second Semester

Third Year First Semester

Course Code Course Title Credit

Fourth Year First Semester

Fourth Year Second Semester

First Year First Semester

CSE 101: Mathematics I (Calculus and Coordinate Geometry) Credit: 3

Integral Calculus: Definitions of integration; Integration by the method of substitutions; Integration

CSE 103: Physics (Electricity, Magnetism and Optics) Credit: 3

CSE 105: Computer Systems and Applications Credit: 3

Introduction: Basic organization of computer; Types of computers; Number systems; Types of

CSE 107: Electrical Circuits Credit: 3

CSE 108: Electrical Circuits Laboratory Credit: 1

Laboratory work based on CSE 107.

CSE 109: Communicative English Credit: 3

CSE 111: Economics Credit: 2

Introduction: The Scope and Method of Economics.

CSE 114: Engineering Drawing Laboratory Credit: 1

CSE 100: Viva-Voce Credit: 1

First Year Second Semester

CSE 151: Mathematics II Credit: 3

CSE 154: Electronic Devices and Circuits Laboratory Credit: 1

Laboratory work based on CSE 153.

CSE 155: Discrete Mathematics Credit: 3

CSE 157: Structured Programming Language Credit: 3

Understanding the Components of a C program: Compile a program, declaring variables and

CSE 158: Structured Programming Language Laboratory Credit: 1

Laboratory work based on CSE 157.

CSE 159: Numerical Methods Credit: 2

Introduction: Numerical Computing, Errors in Computation, stability and convergences.

CSE 160: Numerical Methods Laboratory Credit: 1

Laboratory work based on CSE 159.

CSE 161: Management and Accounting Credit: 3

The Basis of Organization and Management: Historical development of organization and

CSE 150: Viva-Voce Credit: 1

Second Year First Semester

CSE 201: Mathematics III Credit: 3

CSE 205: Digital Logic Design Credit: 3

CSE 206: Digital Logic Design Laboratory Credit: 1

Laboratory work based on CSE 205.

CSE 207: Data Structures Credit: 3

CSE 208: Data Structures Laboratory Credit: 1

Laboratory work based on CSE 207.

CSE 209: Object Oriented Programming Credit: 3

Introduction to object oriented programming (OOP); Advantages of OOP over structured

CSE 210: Object Oriented Programming Laboratory (C++) Credit: 1

Laboratory work based on CSE 209.

CSE 211: Graph Theory and Computational Geometry Credit: 2

CSE 200: Viva-Voce Credit: 1

Second Year Second Semester

CSE 251: Statistics II Credit: 2