B.Tech - Software Engg. (Syllabus) 2015 PDF

Amity School of Engineering & Technology
Bachelor of Technology Software Engineering

(Total Credits 210)
FLEXILEARN
-Freedom to design your degree
Programme Structure
Curriculum & Scheme of Examination
2015
AMITY UNIVERSITY HARYANA

GURGAON
B.Tech. Software Engineering (Total Credits 210)

Programme Structure
FIRST SEMESTER
S.No
Course
Code
Course Title
Lecture
(L) Hours
Per week
Basic Sciences Courses

1
SFE2101
Applied Mathematics-I
2
SFE2102
Applied Physics-I Fields & Waves
Engineering Sciences Courses
3
SFE2103
Engineering Mechanics
4
SFE2104
Introduction to Computers &
Programming in C
5
SFE2105
Electrical Science
Laboratory Courses
6
SFE2106
Applied Physics-I Lab
7
SFE2107
Programming in C Lab
8
SFE2108
Electrical Science Lab
9
SFE2109
Engineering Mechanics Lab
Value Added Courses
10
CSS2152
English-I
11
BEH2151 Understanding Self for Effectiveness
12
ENV2152 Environmental Studies
13
Foreign Language Course I (Any One)
LAN2151 French - I
LAN2152 German - I
LAN2153 Spanish - I
LAN2154 Russian - I
LAN2155 Chinese - I
LAN2156 Portuguese - I
LAN2157 Korean-I
LAN2158 Japanese-I
TOTAL
Tutorial
(T) Hours
Per week
Practical
(P) Hours
Per week
3
2
1
1
2
2
1
1
2
2
2
2
1
1
4
3
Total
Credits
7
4
3
9
3
3
3
4
1
1
1
1
9
1
1
4
3
29
SECOND SEMESTER
S.No
Course
Code
Course Title
Basic Sciences Courses

1
SFE2201
Applied Mathematics-II
2
SFE2202
Applied Physics-II Modern Physics
3
SFE2203
Applied Chemistry
4
SFE2204
Object Oriented Programming using
C++
5
SFE2205
Elements of Mechanical Engineering
Laboratory Courses
6
SFE2206
Applied Physics-II Lab
7
SFE2207
Applied Chemistry Lab
8
SFE2208
Object Oriented Programming using
C++ Lab
9
SFE2209
Elements of Mechanical Engineering
Lab
10
SFE2210
Engineering Graphics Lab
Value Added Courses
10
CSS2252
English-II
11
BEH2251 Problem Solving and Creative
Thinking
13
Foreign Language Course I (As opted in Ist
Semester)
LAN2251 French - II
LAN2252 German II
LAN2253 Spanish II
LAN2254 Russian II
LAN2255 Chinese II
LAN2256 Portuguese - II
LAN2257 Korean-II
LAN2258 Japanese-II
TOTAL
Lecture
(L) Hours
Per week
Tutorial
(T) Hours
Per week
Practical
(P) Hours
Per week
Total
Credits
3
2
2
1
1
1
2
2
2
2
5
1
1
1
1
1
1
5
1
1
10
4
3
3
5
3
25
THIRD SEMESTER
S.No
Course
Code
Course Title

1
SFE2301
Data Communication & Computer
Networks
2
SFE2302
Data Base Management Systems
3
SFE2303
Operating Systems
4
SFE2304
Data Structures using C
Laboratory Courses
5
SFE2305
Data Structures Using C Lab
6
SFE2306
Data Communication & Computer
Networks Lab
7
SFE2307
Data Base Management System Lab
8
SFE2308
UNIX Programming Lab
Concentration Electives (Any one set / subject)
9
SFE2309
Independent Study
SFE2333
Workshop / Certification Discipline
Specific
SFE2331
Term Paper (Evaluation)
SFE2332
Project (With Presentation &
Evaluation)
SFE2334
Study Abroad (8 Days)
Value Added Courses
10
CSS2151
Effective Listening
11
BEH2351 Group Dynamics and Team Building
12
Foreign Language Course (As opted in Ist
Semester)
LAN2351 French - III
LAN2352 German III
LAN2353 Spanish III
LAN2354 Russian III
LAN2355 Chinese III
LAN2356 Portuguese - III
LAN2357 Korean-III
LAN2358 Japanese-III
13
Open Elective Course (Flexi Learn Programme)
TOTAL
Lecture
(L) Hours
Per week
Tutorial
(T) Hours
Per week
Practical
(P) Hours
Per week
Total
Credits
3
3
3
1
1
1
2
2
2
2
1
-
1
1
2
1
1
2
2
1
1
2
2
4
1
1
2
16
4
4
4
4
4
1
1
3
29
FOURTH SEMESTER
S.No
Course
Code
Course Title
Lecture
(L) Hours
Per week

1
SFE2401
Theory of Automata & Computation
2
SFE2402
Digital Electronics
3
SFE2403
Discrete Mathematics
4
SFE2404
Computer Graphics
Laboratory Courses
5
SFE2405
Digital Electronics Lab
6
SFE2406
Computer Graphics Lab
7
SFE2407
Analog Electronics-I
SFE2408
Analog Electronics-I Lab
SFE2409
Internet Fundamentals
SFE2410
Artificial Neural Network
SFE2411
Artificial Neural Network Lab
Value Added Courses
8
CSS2251
Presentation Skills
9
BEH2451 Stress and Coping Strategies
10
Semester)
LAN2451 French - IV
LAN2452 German IV
LAN2453 Spanish IV
LAN2454 Russian IV
LAN2455 Chinese IV
LAN2456 Portuguese IV
LAN2457 Korean-IV
LAN2458 Japanese-IV
11
TOTAL
Summer Internship-I (6-8 weeks)
Tutorial
(T) Hours
Per week
Practical
(P) Hours
Per week
3
2
3
3
1
1
1
1
2
2
2
2
2
-
1
-
2
2
1
1
2
Total
Credits
15
4
3
4
4
2
1
1
3
2
1
3
2
1
4
1
1
2
3
27
FIFTH SEMESTER
S.No
Course
Code
Course Title
Lecture
(L) Hours
Per week

1
SFE2501
Software Engineering
2
SFE2502
Software Architecture
3
SFE2503
Software Project Management
Laboratory Courses
4
SFE2504
Software Engineering Lab
5
SFE2505
Software Project Management Lab
Summer Internship
6
SFE2535
Summer Internship Evaluation-I
7
SFE2551
Fuzzy Logic
SFE2506
Java Programming
SFE2507
Java Programming Lab
SFE2508
Communication Systems
SFE2509
Communication Systems Lab
Value Added Courses
8
CSS2351
Reading & Comprehension
9
BEH2552 Personality, Nationalism and Human
Values
10
Semester)
LAN2551 French - V
LAN2552 German V
LAN2553 Spanish V
LAN2554 Russian V
LAN2555 Chinese V
LAN2556 Portuguese V
LAN2557 Korean-V
LAN2558 Japanese-V
11
TOTAL
Tutorial
(T) Hours
Per week
Practical
(P) Hours
Per week
Total
Credits
3
3
3
1
1
2
2
3
2
2
-
2
2
1
1
11
3
4
4
2
1
1
3
3
3
3
2
1
2
1
4
1
1
3
26
Summer Internship-II (6-8 weeks)
SIXTH SEMESTER
S.No
Course
Code
Course Title

1
SFE2601
Software Design
2
SFE2602
Software Testing
3
SFE2603
Software Measurement and metrics
4
SFE2604
Object Oriented Software Engineering
6
Lecture
(L) Hours
Per week
Tutorial
(T) Hours
Per week
Practical
(P) Hours
Per week
3
3
2
3
1
1
1
-
Total
Credits
14
4
4
3
3
Laboratory Courses
5
SFE2605
Software Design Lab
6
SFE2606
Software Testing Lab
7
SFE2607
Object Oriented Software Engineering
Lab
8
SFE2608
Introduction of Genetic Algorithm
SFE2609
Software Process Maturity Model
SFE2610
Advance Java Programming
SFE2611
Advance Java Programming Lab
Value Added Courses
9
CSS2451
Corporate Communication
10
BEH2652 Interpersonal Communication
11
Semester)
LAN2651 French - VI
LAN2652 German VI
LAN2653 Spanish VI
LAN2654 Russian VI
LAN2655 Chinese VI
LAN2656 Portuguese VI
LAN2657 Korean-VI
LAN2658 Japanese-VI
12
TOTAL
2
2
2
3
2
2
-
1
-
1
1
2
3
1
1
1
3
3
3
2
1
4
1
1
2
3
27
SEVENTH SEMESTER
S.No
Course
Code
Course Title
Lecture
(L) Hours
Per week

1
SFE2701
Analysis of Software Artefacts
2
SFE2702
Software Quality Management
3
SFE2703
Software Maintenance &
Administration
Laboratory Courses
4
SFE2704
Analysis of Software Artefacts Lab
5
SFE2705
Software Quality Management Lab
(Test Link Tool)
6
SFE2706
Software Maintenance &
Administration Lab (bugzilla)
Summer Internship
7
SFE2735
Summer Internship Evaluation-II
8
SFE2707
Soft Computing
SFE2708
Mobile Computing
SFE2709
Service Oriented Architecture
SFE2710
Grid Computing
SFE2732
Project (With Presentation &
7
3
3
3
Tutorial
(T) Hours
Per week
1
1
-
Practical
(P) Hours
Per week
Total
Credits
11
4
4
3
2
2
3
1
1
3
3
3
3
-
3
3
3
3
3
3
3
3
Evaluation)
Value Added Courses
9
CSS2551
Employability Skills
10
BEH2751 Relationship Management
11
Semester)
LAN2751 French - VII
LAN2752 German VII
LAN2753 Spanish VII
LAN2754 Russian VII
LAN2755 Chinese VII
LAN2756 Portuguese VII
LAN2757 Korean-VII
LAN2758 Japanese-VII
12
TOTAL
1
1
2
4
1
1
2
3
27
EIGHTH SEMESTER
S.No
Course
Code
Course Title
Lecture
(L) Hours
Per week

1
SFE2801
Agile Software Processes
Technical Project
2
SFE2837
Project (Dissertation)
3
SFE2802
Web Programming
SFE2803
Web Programming Lab
SFE2804
Dot Net Programming
SFE2805
Dot Net Programming Lab
SFE2806
Simulation & Modelling
SFE2807
Distributed Operating System
SFE2808
E-Commerce and ERP
Value Added Courses
4
CSS2651
Workplace Communication
5
BEH2851 Personal & Professional Excellence
6
TOTAL
Tutorial
(T) Hours
Per week
Practical
(P) Hours
Per week
3
3
3
3
3
1
1
1
2
2
-
1
1
Total
Credits
3
3
8
8
4
3
1
3
1
4
4
4
2
1
1
3
20
Syllabus First Semester

APPLIED MATHEMATICS - I
Course Code: SFE2101
Credit Units: 04
Course Objective:
The knowledge of Mathematics is necessary for a better understanding of almost all the Engineering
and Science subjects. Here our intention is to make the students acquainted with the concept of basic
topics from Mathematics, which they need to pursue their Engineering degree in different disciplines.
Course Contents:
Module I: Differential Calculus
Successive differentiation, Leibnitzs theorem (without proof), Mean value theorem, Taylors theorem
(proof), Remainder terms, Asymptote & Curvature, Partial derivatives, Chain rule, Differentiation of
Implicit functions, Exact differentials, Tangents and Normals, Maxima, Approximations,
Differentiation under integral sign, Jacobians and transformations of coordinates.
Module II: Integral Calculus
Fundamental theorems, Reduction formulae, Properties of definite integrals, Applications to length,
area, volume, surface of revolution, improper integrals, Multiple Integrals-Double integrals,
Applications to areas, volumes.
Module III: Ordinary Differential Equations
Formation of ODEs, Definition of order, degree & solutions, ODE of first order: Method of separation
of variables, homogeneous and non homogeneous equations, Exactness & integrating factors, Linear
equations & Bernoulli equations, General linear ODE of nth order, Solution of homogeneous
equations, Operator method, Method of undetermined coefficients, Solution of simple simultaneous
ODE.
Module IV: Vector Calculus
Scalar and Vector Field, Derivative of a Vector, Gradient, Directional Derivative, Divergence and
Curl and their Physical Significance, Arc Length, Tangent, Directional Derivative, Evaluation of Line
Integral, Greens Theorem in Plane (without proof), Representation of Surfaces, Tangent Plane and
Surface Normal, Surface Integral, Stokes Theorem (without proof), Gauss Divergence Theorem
(without proof).
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
CT: Class Test, HA: Home Assignment, S/V/Q: Seminar/Viva/Quiz, EE: End Semester Examination;
Att: Attendance
Text & References:
Text:
Differential Calculus by Shanti Narain
Integral Calculus by Shanti Narain
References:
Differential Equation by A.R. Forsyth
Higher Engineering Mathematics by H.K. Dass
APPLIED PHYSICS - I - FIELDS AND WAVES

Credit Units: 03
Course Objective:
Aim of this course is to introduce the students to fundamentals of graduate level physics, which form
the basis of all applied science and engineering
Course Contents:
Module I: Oscillations & Waves
Oscillations: Introduction to S.H.M. Damped Oscillations: Differential Equation and its solution,
logarithmic decrement, Quality Factor, Different conditions of damping of harmonic oscillations.
Forced oscillations: Amplitude and Frequency Response, Resonance, Sharpness of Resonance
Plane Progressive Waves: Differential Equation and Solution, Superposition of Progressive Waves
stationary waves.
Ultrasonics: Generation and application of ultrasonicwaves.
Module II: Wave Nature of Light
Interference: Coherent Sources, Conditions of interference, Interference due to division of wavefront,
Fresnels biprism Interference due to division of amplitude, Newtons rings, Interference due to thin
films, .
Diffraction: Fresnel and Fraunhofer diffraction, Fraunhofer diffraction at a single slit, double slit, N
Slits, Transmission grating, Rayleigh criterion and Resolving power of grating.
Polarization: Birefringence, Nicol prism, Production and analysis of plane, circularly and elliptically
polarized light, Half and quarter wave plates, Optical rotation, Polarimeter.
Module III: Electromagnetics
Scalar and vector fields, gradient of a scalar field, physical significance of gradient, equipotential
surface. Line, surface and volume integrals, Divergence and curl of vector field and mathematical
analysis physical significance, Electric flux, Gauss law, Proof and Applications, Gauss divergence
and Stokes theorems.
Differential form of Gauss Law, Amperes Law, Displacement current, Faradays Law, Maxwell
equations in free space & isotropic media (Integral form & differential form), EM wave propagation
in free space, Poynting vector.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Waves & oscillation, A. P. French
Physics of waves, W. C. Elmore & M. A. Heald
Introduction to Electrodynamics, D. J. Griffith
Electrodynamics, Gupta, Kumar & Singh
Optics, A. K. Ghatak
Engineering Physics, Satya Prakash
10
ENGINEERING MECHANICS
Credit Units: 03
Course Objective:
Objective of this course is to provide fundamental knowledge of force system and its effect on the
behaviour of the bodies that may be in dynamic or in static state. It includes the equilibrium of
different structures like beams, frames, truss etc and the force transfer mechanism in the different
components of a body under given loading condition.
Course Contents:
Module I: Force system & Structure
Free body diagram, Equilibrium equations and applications. Plane truss, perfect and imperfect truss,
assumption in the truss analysis, analysis of perfect plane trusses by the method of joints, method of
section.
Module II: Friction
Static and Kinetic friction, laws of dry friction, co-efficient of friction, angle of friction, angle of
repose, cone of friction, friction lock, efficiency of screw jack, transmission of power through belt
Module III: Distributed Force
Determination of center of gravity, center of mass and centroid by direct integration and by the
method of composite bodies, mass moment of inertia and area moment of inertia by direct integration
and composite bodies method, radius of gyration, parallel axis theorem, Pappus theorems and its
application, polar moment of inertia.
Module IV: Work -Energy
Work energy equation, conservation of energy, Virtual work, impulse, momentum conservation,
impact of bodies, co-efficient of restitution, loss of energy during impact, Dalembert principle
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
S.S. Bhavikatti, Engineering Mechanics, New Age International Ltd
Timoshenko, Engineering Mechanics, McGraw Hill
R. S. Khurmi, Engineering Mechanics, S. Chand Publication
H. Shames & G. K. M. Rao, Engineering Mechanics, Pearson Education, 2006
11
INTRODUCTION TO COMPUTERS AND PROGRAMMING IN C

Credit Units: 03
Course Objective:
The objective of this course module is to acquaint the students with the basics of computers system,
its components, data representation inside computer and to get them familiar with various important
features of procedure oriented programming language i.e. C.
Course Contents:
Module I: Introduction
Introduction to computer, history, von-Neumann architecture, memory system (hierarchy,
characteristics and types), H/W concepts (I/O Devices), S/W concepts (System S/W & Application
S/W, utilities). Data Representation: Number systems, character representation codes, Binary, octal,
hexadecimal and their interconversions. Binary arithmetic, floating point arithmetic, signed and
unsigned numbers, Memory storage unit.
Module II: Programming in C
History of C, Introduction of C, Basic structure of C program, Concept of variables, constants and
data types in C, Operators and expressions: Introduction, arithmetic, relational, Logical, Assignment,
Increment and decrement operator, Conditional, bitwise operators, Expressions, Operator precedence
and associativity. Managing Input and output Operation, formatting I/O.
Module III: Fundamental Features in C
C Statements, conditional executing using if, else, nesting of if, switch and break Concepts of loops,
example of loops in C using for, while and do-while, continue and break. Storage types (automatic,
register etc.), predefined processor, Command Line Argument.
Module IV: Arrays and Functions
One dimensional arrays and example of iterative programs using arrays, 2-D arrays Use in matrix
computations.
Concept of Sub-programming, functions Example of user defined functions. Function prototype,
Return values and their types, calling function, function argument, function with variable number of
argument, recursion.
Module V: Advanced features in C
Pointers, relationship between arrays and pointers Argument passing using pointers, Array of pointers.
Passing arrays as arguments.
Strings and C string library.
Structure and Union. Defining C structures, Giving values to members, Array of structure, Nested
structure, passing strings as arguments.
File Handling.
Examination Scheme:
Components
Weightage (%)
A
5
CT
10
S/V/Q
8
HA
7
EE
70
Att: Attendance
12
Text & References:

Text:
ANSI C by E Balagurusamy
Yashwant Kanetkar, Let us C, BPB Publications, 2nd Edition, 2001.
Herbert Schildt, C: The complete reference, Osbourne Mcgraw Hill, 4th Edition, 2002.
V. Raja Raman, Computer Programming in C, Prentice Hall of India, 1995.
References:
Kernighan & Ritchie, C Programming Language, The (Ansi C Version), PHI, 2nd Edition.
J. B Dixit, Fundamentals of Computers and Programming in C.
P.K. Sinha and Priti Sinha, Computer Fundamentals, BPB publication.
13
ELECTRICAL SCIENCE
Credit Units: 03
Course Objective:
The objective of the course is to provide a brief knowledge of Electrical Engineering to students of all
disciplines. This Course includes some theorems related to electrical, some laws related to flow of
current, voltages, basic knowledge of Transformer, basic knowledge of electromagnetism, basic
knowledge of electrical network.
Course Contents:
Module I: Basic Electrical Quantities
Basic Electrical definitions-Energy, Power, Charge, Current, Voltage, Electric Field Strength,
Magnetic Flux Density, etc., Resistance, Inductance and Capacitance. Ideal Source, Independent
Source and Controlled Source
Module II: Network Analysis Techniques & Theorems
Circuit Principles: Ohms Law, Kirchoffs Current Law, Kirchoffs Voltage Law Network Reduction:
StarDelta Transformation, Source Transformation, Nodal Analysis, Loop analysis. Superposition
theorem, Thevenins Theorem, Nortons theorem and Reciprocity theorem.
Module III: Alternating Current Circuits
Peak, Average and RMS values for alternating currents, Power calculation:
reactive power, active power, Complex power, power factor, impedance, reactance, conductance,
susceptance Resonance: series Resonance, parallel resonance, basic definition of Q factor & Bandwidth.
Module IV: Transformers
Basic Transformer Operation principle, Construction, Voltage relations, current relations, Linear
circuit models, open circuit test, short circuit test, Transformer Efficiency.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
R.J. Smith, R.C. Dorf: Circuits, devices and Systems
B.L. Thareja: Electrical Technology: Part -1 & 2
V. Deltoro: Electrical Engineering fundamentals
Schaums Series: Electrical Circuits
14
APPLIED PHYSICS I LAB

Credit Units: 01
List of Experiments:
1.
To determine the wavelength of sodium light by Newtons rings method.
2.
To determine the dispersive power of the material of prism with the help of a
spectrometer.
3.
To determine the specific rotation of sugar by Bi-quartz or Laurent half shade polarimeter.
4.
To determine the speed of ultrasonic waves in liquid by diffraction method.
5.
To determine the width of a narrow slit using diffraction phenomena.
6.
To determine the temperature coefficient of platinum wire, using a platinum resistance

thermometer and a Callender & Griffths bridge.
7.
To determine the value of specific charge (ratio of e/m) of an electron by Thomson

method.
8.
9.
To determine the internal resistance of Leclanche cell with the help of Potentiometer.
To determine the resistance per unit length of a Carey Fosters bridge wire and also to find
out the specific resistance of a given wire.
10.
To plot graph showing the variation of magnetic field with distance along the aixs of a
circular coil carrying current, and hence estimate the radius of the coil.
11.
To determine the value of acceleration due to gravity (g) in the laboratory using bar
pendulum.
12.
To determine the moment of inertia of a flywheel about its own axis of rotation.
13.
To determine the density of material of the given wire with the help of sonometer.
Examination Scheme:
IA
A
5
PR
10
EE
LR
10
V
5
PR
35
V
35
Note: IA Internal Assessment, EE- External Exam, PR- Performance, LR Lab Record, V Viva.
15
PROGRAMMING IN C LAB
Credit Units: 01
Software Required: Turbo C

Course Contents:
C program involving problems like finding the nth value of cosine series, Fibonacci series. Etc.
C programs including user defined function calls
C programs involving pointers, and solving various problems with the help of those.
File handling
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
16
ELECTRICAL SCIENCE LAB

Credit Units: 01
1. To verify KVL & KCL in the given network.
2. To verify Superposition Theorem.
3. To verify Maximum Power Transfer Theorem.
4. To verify Reciprocity Theorem.
5. To determine and verify RTh, VTh, RN, IN in a given network.
6. To perform open circuit & short circuit test on a single-phase transformer.
7. To study transient response of a given RLC Circuit.
8. To perform regulation, ratio & polarity test on a single-phase transformer.
9. To measure power & power factor in a three phase circuit by two wattmeter method.
10. To measure power & power factor in a three phase load using three ammeter & three
voltmeter method.
Examination Scheme:
IA
A
5
PR
10
EE
LR
10
V
5
PR
35
V
35
17
ENGINEERING MECHANICS LAB

Credit Units: 01
Engineering Mechanics:
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
To verify the law of Force Polygon

To verify the law of Moments using Parallel Force apparatus. (Simply supported type)
To determine the co-efficient of friction between wood and various surface (like
Leather, Wood, Aluminum) on an inclined plane.
To find the forces in the members of Jib Crane.
To determine the mechanical advantage, Velocity ratio and efficiency of a screw jack.
To determine the mechanical advantage, Velocity ratio and Mechanical efficiency of the
Wheel and Axle
To determine the MA, VR, of Worm Wheel (2-start)
Verification of force transmitted by members of given truss.
To verify the law of moments using Bell crank lever
To find CG and moment of Inertia of an irregular body using Computation method
Examination Scheme:
IA
A
5
PR
10
EE
LR
10
V
5
PR
35
V
35
18
Syllabus Second Semester

APPLIED MATHEMATICS - II
Credit Units: 04
Course Objective:
The knowledge of Mathematics is necessary for a better understanding of almost all the Engineering
and Science subjects. Here our intention is to make the students acquainted with the concept of basic
topics from Mathematics, which they need to pursue their Engineering degree in different disciplines.
Course Contents:
Module I: Linear Algebra
Hermitian and Skew Hermitian Matrix, Unitary Matrix, Orthogonal Matrix, Elementary Row
Transformation, Reduction of a Matrix to Row Echelon Form, Rank of a Matrix, Consistency of
Linear Simultaneous Equations, Gauss Elimination Method, Gauss-Jordan Method, Eigen Values and
Eigen Vectors of a Matrix, Caley-Hamilton Theorem, Diagonalization of a Matrix, Vector Space,
Linear Independence and Dependence of Vectors, Linear Transformations.
Module II: Infinite Series
Definition of Sequence, Bounded Sequence, Limit of a Sequence, Series, Finite and Infinite Series,
Convergence and Divergence of Infinite series, Cauchys Principle of Convergence, Positive Term
Infinite Series, Comparison test, DAlemberts Ratio test. Raabes Test, Cauchys nth root Test.
Logarithmic Test, Alternating Series, Leibnitzs Test, Absolute and conditioinal convergence,
Uniform Convergence, Power Series and its Interval of Convergence.
Module III: Complex Analysis
De Moivres Theorem and Roots of Complex Numbers, Logarithmic Functions, Circular, Hyperbolic
Functions and their Inverses.
Functions of a Complex Variables, Limits, Continuity and Derivatives, Analytic Function, CauchyRiemann Equations (without proof), Harmonic Function, Harmonic Conjugates, Conformal Mapping,
Bilinear Transformations, Complex Line Integral, Cauchy Integral Theorem, Cauchy Integral
Formula, Derivative of Analytic Function, Power Series, Taylor Series, Laurent Series, Zeroes and
Singularities, Residues, Residue Theorem, Evaluation of Real Integrals of the Form and
f ( x)
dx
F ( x)
.
Module IV: Statistics and Probability
Moments, Skewness, Kurtosis, Random Variables and Probability Distribution, Mean and Variance of
a Probability Distribution, Binomial Distribution, Poisson Distribution and Normal Distribution.
Examination Scheme:
Components
CT1
20
Weightage (%)
C Project + Presentation
I Interaction/Conversation Practice
CT2
15
C
20
Text & References:

Engineering Mathematics by Erwin Kreyszig.
Engineering Mathematics by R.K. Jain and S.R.K. Iyengar.
Higher Engineering Mathematics by H.K. Dass.
Engineering Mathematics by B.S. Grewal.
Differential Calculus by Shanti Narain.
Integral Calculus by Shanti Narain.
Linear Algebra- Schaum Outline Series.
19
I
20
V
20
A
5
APPLIED PHYSICS - II - MODERN PHYSICS

Credit Units: 03
Course Objective:
Aim of this course is to introduce the students to fundamentals of graduate level physics which form
the basis of all applied science and engineering
Course Contents:
Module I: Special Theory of Relativity
Michelson-Morley experiment, Importance of negative result, Inertial & non-inertial frames of
reference, Einsteins postulates of Special theory of Relativity, Space-time coordinate system,
Relativistic Space Time transformation (Lorentz transformation equation), Transformation of
velocity, Addition of velocities, Length contraction and Time dilation, Mass-energy equivalence
(Einsteins energy mass relation) & Derivation of Variation of mass with velocity,
Module II: Wave Mechanics
Wave particle duality, De-Broglie matter waves, phase and group velocity, Heisenberg uncertainty
principle, wave function and its physical interpretation, Operators, expectation values. Time
dependent & time independent Schrdinger wave equation for free & bound states, square well
potential (rigid wall), Step potential.
Module III: Atomic Physics
Vector atom model, LS and j-j coupling, Zeceman effect (normal & anomalous), Paschen-Bach effect,
X-ray spectra and energy level diagram, Moseleys Law, Lasers Einstein coefficients, conditions for
light amplification, population inversion, optical pumping, three level and four level lasers, He-Ne
and Ruby laser, Properties and applications of lasers.
Module IV: Solid State Physics
Sommerfields free electron theory of metals, Fermi energy, Introduction to periodic potential &
Kronig-Penny model (Qualitative) Band Theory of Solids, Semi-conductors: Intrinsics and Extrinsic
Semiconductors, photoconductivity and photovotaics, Basic aspects of Superconductivity, Meissner
effect.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Concept of Modern Physics, A. Beiser
Applied Physics II, Agarawal & Goel
Solid State Physics, S. O. Pallai
Physics of Atom, Wehr & Richards
20
APPLIED CHEMISTRY
Credit Units: 03
Course Objective:
Four basic sciences, Physics, Chemistry, Mathematics and Biology are the building blocks in
engineering and technology. Chemistry is essential to develop analytical capabilities of students, so
that they can characterize, transform and use materials in engineering and apply knowledge in their
field. All engineering fields have unique bonds with chemistry whether it is Aerospace, Mechanical,
Environmental and other fields the makeup of substances is always a key factor, which must be
known. For electronics and computer science engineering, apart from the material, computer
modeling and simulation knowledge can be inherited from the molecule designing. The upcoming
field of technology like Nanotechnology and Biotechnology depends fully on the knowledge of basic
chemistry. With this versatile need in view, course has been designed in such a way so that the
student should get an overview of the whole subject.
Course Contents:
Module I: Water Technology
Introduction and specifications of water,
Hardness and its determination (EDTA method only), Alkalinity,
Boiler feed water, boiler problems scale, sludge, priming & foaming: causes & prevention, Boiler
problems caustic embrittlement & corrosion: causes & prevention,
Carbonate & phosphate conditioning, colloidal conditioning & calgon treatment
Water softening processes: Lime soda process, Ion exchange method, Water for domestic use.
Module II: Fuels
Classification, calorific value of fuel, (gross and net), Determination of calorific value of fuels, bomb
calorimeter, Solid fuels - Proximate and ultimate analysis, Octane & Cetane No. and its significance.
Numericals on combustion
Module III: Instrumental Methods of analysis
Introduction; Principles of spectroscopy; Laws of absorbance
IR: Principle, Instrumentation, Application
UV: Principle, Instrumentation, Application
NMR: Principle, Instrumentation, Application
Module III: Lubricants
Introduction; Mechanism of Lubrication; Types of Lubricants; Chemical structure related to
Lubrication;
Properties of lubricants; Viscosity and Viscosity Index; Iodine Value; Aniline Point; Emulsion
number; Flash Point; Fire Point; Drop Point; Cloud Point; Pour Point.
Selection of Lubricants.
Module VI: Corrosion
Introduction, Mechanism of dry and wet corrosion,
Types of corrosion-Galvanic, Concentration cell, soil, pitting, intergranular, waterline. Passivity.
Factors influencing corrosion. Corrosion control.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
21
Text & References:

Text:
Engineering Chemistry- Jain and Jain
Engineering Chemistry- Sunita Rattan
Engineering Chemistry-Shashi Chawla
References:
Engineering Chemistry Dara and Dara
Spectroscopy- Y.R Sharma
Corrosion Engineering Fontenna and Greene
22
OBJECT ORIENTED PROGRAMMING USING C++

Credit Units: 03
Course Objective:
The objective of this module is to introduce object oriented programming. To explore and implement
the various features of OOP such as inheritance, polymorphism, Exceptional handling using
programming language C++. After completing this course student can easily identify the basic
difference between the programming approaches like procedural and object oriented.
Course Contents:
Review of C, Difference between C and C++, Procedure Oriented and Object Oriented Approach.
Basic Concepts: Objects, classes, Principals like Abstraction, Encapsulation, Inheritance and
Polymorphism. Dynamic Binding, Message Passing. Characteristics of Object-Oriented Languages.
Introduction to Object-Oriented Modeling techniques (Object, Functional and Dynamic Modeling).
Module II: Classes and Objects
Abstract data types, Object & classes, attributes, methods, C++ class declaration, Local Class and
Global Class, State identity and behaviour of an object, Local Object and Global Object, Scope
resolution operator, Friend Functions, Inline functions, Constructors and destructors, instantiation of
objects, Types of Constructors, Static Class Data, Array of Objects, Constant member functions and
Objects, Memory management Operators.
Module III: Inheritance
Inheritance, Types of Inheritance, access modes public, private & protected, Abstract Classes,
Ambiguity resolution using scope resolution operator and Virtual base class, Aggregation,
composition vs classification hirarchies, Overriding inheritance methods, Constructors in derived
classes, Nesting of Classes.
Module IV: Polymorphism
Polymorphism, Type of Polymorphism Compile time and runtime, Function Overloading, Operator
Overloading (Unary and Binary) Polymorphism by parameter, Pointer to objects, this pointer, Virtual
Functions, pure virtual functions.
Module V: Strings, Files and Exception Handling
Manipulating strings, Streams and files handling, formatted and Unformatted Input output. Exception
handling, Generic Programming function template, class Template Standard Template Library:
Standard Template Library, Overview of Standard Template Library, Containers, Algorithms,
Iterators, Other STL Elements, The Container Classes, General Theory of Operation, Vectors.
Examination Scheme:
Components
Weightage (%)
A
5
CT
10
S/V/Q
8
HA
7
EE
70
Text & References:

Text:
A.R. Venugopal, Rajkumar, T. Ravishanker Mastering C++, TMH, 1997
R. Lafore, Object Oriented Programming using C++, BPB Publications, 2004.
Object Oriented Programming with C++ By E. Balagurusamy.
Schildt Herbert, C++: The Complete Reference, Wiley DreamTech, 2005.
References:
Parasons, Object Oriented Programming with C++, BPB Publication, 1999.
Steven C. Lawlor, The Art of Programming Computer Science with C++, Vikas Publication,
2002.
Yashwant Kanethkar, Object Oriented Programming using C++, BPB, 2004
23
ELEMENTS OF MECHANICAL ENGINEERING

Credit Units: 02
Course Objective:
The objective of this course is to impart the basic knowledge of thermodynamics, stress- strain,
materials & their properties and various manufacturing processes to the students of all engineering
discipline.
Course Contents:
Module I: Fundamental Concepts
Definition of thermodynamics, system, surrounding and universe, phase, concept of continuum,
macroscopic & microscopic point of view, Thermodynamic equilibrium, property, state, path, process,
cyclic process, Zeroth, first and second law of thermodynamics, Carnot Cycle, Introduction to I.C.
Engines-two & four stoke S.I. and C.I. engines. Otto cycle. Diesel cycle.
Module II: Stress And Strain Analysis
Simple stress and strain: introduction, normal shear, and stresses-strain diagrams for ductile and
brittle materials. Elastic constants, one-dimensional loadings of members of varying cross-section,
Strain Energy, Properties of material-strength, elasticity, stiffness, malleability, ductility, brittleness,
hardness and plasticity etc; Concept of stress and strain stress strain diagram, tensile test, impact test
and hardness test.
Module III: Casting & Forging
Introduction of casting, pattern, mould making procedures, sand mould casting, casting defects,
allowances of pattern. Forging-introduction, upsetting & drawing out, drop forging, press forging &
m/c forging
Module IV: Welding & Sheet metal working:
Introduction of welding processes, classification, gas welding, arc welding, resistance welding.
Introduction to sheet metal shop, Shearing, trimming, blanking, piercing, shaving, notching, stretch
forming, nibbling coining, embossing and drawing.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Engineering thermodynamics, by P.K. Nag, Tata McGraw Hill.
Thermal Engineering, by D.S. Kumar. S.K. Kataria and Sons.
Thermal Engineering by PL Ballaney; Khanna Publishers, Delhi.
Engineering Thermodynamics: Work and Heat Transfer, by Rogers and Mayhew, ELBS
Publications
Heine, R.W. C.R. Loper and P.C. Rosenthal, Principles of metal casting McGraw Hill
Welding Technology by R.S. Parmar, Khanna Publishers.
Thermodynamics and Heat Engines Volume-I, by R. Yadav: Central Publications.
Ganesan, V. Internal Combustion Engine, Tata McGraw-Hill.
24
APPLIED PHYSICS II LAB

Credit Units: 01
1.
To determine the wavelength of sodium light by Newtons rings method.
2.
To determine the dispersive power of the material of prism with the help of a
spectrometer.
3.
To determine the specific rotation of sugar by Bi-quartz or Laurent half shade polarimeter.
4.
To determine the speed of ultrasonic waves in liquid by diffraction method.
5.
To determine the width of a narrow slit using diffraction phenomena.
6.
To determine the temperature coefficient of platinum wire, using a platinum resistance

thermometer and a Callender & Griffths bridge.
7.
To determine the value of specific charge (ratio of e/m) of an electron by Thomson

method.
8.
9.
To determine the internal resistance of Leclanche cell with the help of Potentiometer.
To determine the resistance per unit length of a Carey Fosters bridge wire and also to find
out the specific resistance of a given wire.
10.
To plot graph showing the variation of magnetic field with distance along the aixs of a
circular coil carrying current, and hence estimate the radius of the coil.
11.
To determine the value of acceleration due to gravity (g) in the laboratory using bar
pendulum.
12.
To determine the moment of inertia of a flywheel about its own axis of rotation.
13.
To determine the density of material of the given wire with the help of sonometer.
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
25
APPLIED CHEMISTRY LAB

Credit Units: 01
Course Contents:
(Any 10 Experiments)
1. To determine the ion exchange capacity of a given cation exchanger.
2. To determine the temporary, permanent and total hardness of a sample of water by
complexometric titration method.
3. To determine the type and extent of alkalinity of given water sample.
4. To determine the number of water molecules of crystallization in Mohrs salt (ferrous ammonium
sulphate) provided standard potassium dichromate solution (0.1N) using diphenylamine as
internal indicator.
5. To determine the ferrous content in the supplied sample of iron ore by titrimetric analysis against
standard K2Cr2O7 solution using potassium ferricyanide [K3Fe(CN)6] as external indicator.
6.
(a) To determine the surface tension of a given liquid by drop number method.
(b) To determine the composition of a liquid mixture A and B (acetic acid and water) by surface
tension method.
7. To prepare and describe a titration curve for phosphoric acid sodium hydroxide titration using
pH-meter.
8. (a) To find the cell constant of conductivity cell.
(b) Determine the strength of hydrochloric acid solution by titrating it against standard sodium
hydroxide solution conductometrically
9. Determination of Dissolved oxygen in the given water sample.
10 To determine the total residual chlorine in water.
11 Determination of amount of oxalic acid and H2SO4 in 1 L of solution using N/10 NaOH and N/10
KMnO4 solution.
12 Determination of viscosity of given oil by means of Redwood viscometer I.
13 To determine flash point and fire point of an oil by Pensky Martins Apparatus
14 To determine the Iodine value of the oil.
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
26
OBJECT ORIENTED PROGRAMMING USING C++ LAB

Credit Units: 01
Software Required: Turbo C++

Course Contents:
Creation of objects in programs and solving problems through them.
Different use of private, public member variables and functions and friend functions.
Use of constructors and destructors.
Operator overloading
Use of inheritance in and accessing objects of different derived classes.
Polymorphism and virtual functions (using pointers).
File handling.
Examination Scheme:
IA
A
5
EE
PR
LR
V
PR
V
10
10
5
35
35
Note: IA Internal Assessment, EE- External Exam, PR- Performance, LR Lab
27
ELEMENTS OF MECHANICAL ENGINEERING - LAB

Credit Units: 01
Course Contents:
1.
Welding
(a)
Arc Welding
(b)
Gas Welding
2.
Foundry
3.
Sheet Metal
4.
-
Butt Joint
Lap Joint
T Joint
Butt Joint
Lap Joint
Brazing of Broken pieces
Sand mould casting by single piece pattern&
Split pattern bracket with cores
Dust Bin
Mug
Funnel
Cylindrical Mug with handle-Rectangular
Fitting Shop
Male Female Joint
Rectangular piece
Filing the job
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
28
ENGINEERING GRAPHICS LAB

Credit Units: 01
Course Objective:
This course will provide students concepts on the drawings of different curves like straight line,
parabola, ellipse etc. After completion of this course, students will be able to draw different figures
manually and will be capable of using various instruments involved in drawings.
Course Contents:
Module I: General
Importance, Significance and scope of engineering drawing, Lettering, Dimensioning, Scales, Sense
of proportioning, Different types of projections, Orthographic Projection, B.I.S. Specifications.
Module II: Projections of Point and Lines
Introduction of planes of projection, Reference and auxiliary planes, projections of points and Lines in
different quadrants, traces, inclinations, and true lengths of the lines, projections on Auxiliary planes,
shortest distance, intersecting and non-intersecting lines.
Module III: Planes other than the Reference Planes
Introduction of other planes (perpendicular and oblique), their traces, inclinations etc., Projections of
points and lines lying in the planes, conversion of oblique plane into auxiliary Plane and solution of
related problems.
Module IV: Projections of Plane Figures
Different cases of plane figures (of different shapes) making different angles with one or both
reference planes and lines lying in the plane figures making different given angles (with one of both
reference planes). Obtaining true shape of the plane figure by projection.
Module V: Projection of Solids
Simple cases when solid is placed in different positions, Axis faces and lines lying in the faces of the
solid making given angles.
Module VI: Development of Surface
Development of simple objects with and without sectioning. Isometric Projection
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
Text & References:
M.B. Shah & B.C. Rana, Engineering Drawing, Pearson Education, 2007
PS Gill, Engineering Drawing, Kataria Publication
ND Bhatt, Engineering Drawing, Charotar publications
N Sidheshwar, Engineering Drawing, Tata McGraw Hill
CL Tanta, Mechanical Drawing, Dhanpat Rai
29
Syllabus Third Semester

DATA COMMUNICATION AND COMPUTER NETWORKS
Credit Units: 04
Course Objective:
The objective is to acquaint the students with the basics of data communication and networking. A
structured approach to explain how networks work from the inside out is being covered. The physical
layer of networking, computer hardware and transmission systems have been explained. In-depth
application coverage includes email, the domain name system; the World Wide Web (both client- and
server-side); and multimedia (including voice over IP.
Course Contents:
Introduction to computer networks, evolution of computer networks and its uses, reference models,
example networks
The physical layer: Theoretical basis for data communication, transmission media, wireless
transmission, telecom infrastructure, PSTN, communication satellites, mobile telephone system
Module II: The data link layer
Data link layer design issues, error detection and correction, data link protocols, sliding window
protocols, example of data link protocols- HDLC, PPP Access
Module III: Medium access layer
Channel allocation problem, multiple access protocols, ALOHA, CSMA/CD, CSMA/CA, IEEE
Standard 802 for LAN and MAN, Bridges, Wireless LANs. Introduction to wireless WANs: Cellular
Telephone and Satellite Networks, SONETISDH, Virtual-Circuit Networks: Frame Relay and ATM.
Module IV: The network layer
Network layer concepts, design issues, static and dynamic routing algorithms, shortest path routing,
flooding, distance vector routing, link state routing, distance vector routing, multicast routing,
congestion control and quality of service, internetworking, Ipv4
Module V: The transport layer
The transport services, elements of transport protocols, TCP and UDP
The application layer: Brief introduction to presentation and session layer, DNS, E-mail, WWW
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
Computer networks: Tanenbaum, Andrew S, Prentice Hall
Data communication & neworking: Forouzan, B. A.
References:
Computer network protocol standard and interface: Uyless, Black
Data and Computer Communications, Seventh Edition (7th.) William Stallings Publisher:
Prentice Hall
Computer Networking: A Top-Down Approach Featuring the Internet (3rd Edition) by James F.
Kurose
30
DATABASE MANAGEMENT SYSTEMS

Credit Units: 04
Course Objective:
The objective of this course is to get students familiar with Databases and their use. They can identify
different types of available database model, concurrency techniques and new applications of the
DBMS.
Course Contents:
Concept and goals of DBMS, DBMS Architecture, Database Languages, Database Users, Database
Abstraction.
Basic Concepts of ER Model: Entity Type, Entity Set, Relationship type, Relationship sets,
Constraints: Cardinality Ratio and Participation Constarint, Keys, Mapping, Design of ER Model
Module II: Hierarchical model & Network Model
Concepts, Data definition, Data manipulation and implementation.
Network Data Model, DBTG Set Constructs, and Implementation
Module III: Relational Model
Relational database, Relational Algebra, Relational Calculus, Tuple Calculus.
Module IV: Relational Database Design and Query Language
SQL, QUEL, QBE, Normalization using Functional Dependency, 1NF, 2NF, 3NF, BCNF,
Multivalued dependency and Join dependency.
Module V: Concurrency Control and New Applications
Transaction basics: ACID property, Lifecycle of Transcation, Why Concurrency Control, Schedule,
Serializability, Lock Based Protocols, Time Stamped Based Protocols, Deadlock Handling, Crash
Recovery. Distributed Database, Objective Oriented Database, Multimedia Database, Data Mining,
Digital Libraries.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
Korth, Silberschatz, Database System Concepts, 4th Ed., TMH, 2000.
Steve Bobrowski, Oracle & Architecture, TMH, 2000
References:
Date C. J., An Introduction to Database Systems, 7th Ed., Narosa Publishing, 2004
Elmsari and Navathe, Fundamentals of Database Systems, 4th Ed., A. Wesley, 2004
Ullman J. D., Principles of Database Systems, 2nd Ed., Galgotia Publications, 1999.
31
OPERATING SYSTEMS
Credit Units: 04
Course Objective:
Operating Systems serve as one of the most important courses for undergraduate students, since it
provides the students with a new sight to envision every computerized systems especially general
purpose computers. Therefore, the students are supposed to study, practice and discuss on the major
fields discussed in the course to ensure the success of the education process. The outcome of this
course implicitly and explicitly affects the abilities the students to understand, analyze and overcome
the challenges they face with in the other courses and the real world.
Course Contents:
Module I: Introduction to operating system
Operating system and function, Evolution of operating system, Batch, Interactive, multiprogramming,
Time Sharing and Real Time System, multiprocessor system, Distributed system, System
protection. Operating System structure, Operating System Services, System Program and calls.
Module II: Process Management
Process concept, State model, process scheduling, job and process synchronization, structure of
process management, Threads
Interprocess Communication and Synchronization:
Principle of Concurrency, Producer Consumer Problem, Critical Section problem, Semaphores,
Hardware Synchronization, Critical Regions, Conditional critical region, Monitor, Inter Process
Communication.
CPU Scheduling:
Job scheduling functions, Process scheduling, Scheduling Algorithms, Non Preemptive and
preemptive Strategies, Algorithm Evaluation, Multiprocessor Scheduling.
Deadlock:
System Deadlock Model, Deadlock Characterization, Methods for handling deadlock, Prevention
strategies, Avoidance and Detection, Recovery from deadlock combined approach.
Module III: Memory Management
Single Contiguous Allocation: H/W support, S/W support, Advantages and disadvantages,
Fragmentation, Paging, Segmentation, Virtual memory concept, Demand paging, Performance, Paged
replaced algorithm, Allocation of frames, Thrashing, Cache memory, Swapping, Overlays
Module IV: Device management
Principles of I/O hardware, Device controller, Device Drivers, Memory mapped I/O, Direct Access
Memory, Interrupts, Interrupt Handlers, Application I/O interface, I/O Scheduling, Buffering,
Caching, Spooling,
Disk organization, Disk space management, Disk allocation Method, Disk Scheduling, Disk storage.
Module V: File System and Protection and security
File Concept, File Organization and Access Mechanism, File Directories, Basic file system, File
Sharing, Allocation method, Free space management.
Policy Mechanism, Authentication, Internal excess Authorization.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
32
Text & References:

Text:
Milenekovic, Operating System Concepts, McGraw Hill
A. Silberschatz, P.B. Galvin Operating System Concepts, John Willey & son
References:
Dietel, An introduction to operating system, Addision Wesley
Tannenbaum, Operating system design and implementation, PHI
Operating System, A Modern Perspection, Gary Nutt, Pearson Edu. 2000
A. S Tanenbaum, Modern Operating System, 2nd Edition, PHI.
Willam Stalling Operating system Pearson Education
B. W. Kernighan & R. Pike, The UNIX Programming Environment Prentice Hall of India, 2000
Sumitabha Das Your UNIX The ultimate guide Tata Mcgraw Hill
Design of UNIX Operating System The Bach Prentice Hall of India
33
DATA STRUCTURES USING C

Credit Units: 04
Course Objective:
Data structure deals with organizing large amount of data in order to reduce space complexity and
time requirement. This course gives knowledge of algorithms, different types of data structures and
the estimation space and time complexity.
Course Contents:
Module I: Introduction to Data structures
Data structures: Definition, Types. Algorithm design, Complexity, Time-Space Trade offs. Use of
pointers in data structures.
Array Definition and Analysis, Representation of Linear Arrays in Memory, Traversing of Linear
Arrays, Insertion And Deletion, Single Dimensional Arrays, Two Dimensional Arrays,
Multidimensional Arrays, Function Associated with Arrays, Character String in C, Character String
Operations, Arrays as parameters, Implementing One Dimensional Array, Sparse matrix.
Module II: Introduction to Stacks and queue
Stack: Definition, Array representation of stacks, Operations Associated with Stacks- Push & Pop,
Polish expressions, Conversion of infix to postfix, infix to prefix (and vice versa),Application of
stacks recursion, polish expression and their compilation, conversion of infix expression to prefix and
postfix expression, Tower of Hanoi problem.
Queue: Definition, Representation of Queues, Operations of queues- QInsert, QDelete, Priority
Queues, Circular Queue, Deque.
Module III: Dynamic Data Structure
Linked list: Introduction to Singly linked lists: Representation of linked lists in memory, Traversing,
Searching, Insertion into, Deletion from linked list, doubly linked list, circular linked list, generalized
list. Applications of Linked List-Polynomial representation using linked list and basic operation.
Stack and queue implementation using linked list.
Module IV: Trees and Graphs
Trees: Basic Terminology, Binary Trees and their representation, expression evaluation, Complete
Binary trees, extended binary trees, Traversing binary trees, Searching, Insertion and Deletion in
binary search trees, General trees, AVL trees, Threaded trees, B trees.
Graphs: Terminology and Representations, Graphs & Multigraphs, Directed Graphs, Sequential
representation of graphs, Adjacency matrices, Transversal Connected Component and Spanning trees.
Module V: Sorting and Searching and file structures
Sorting: Insertion Sort, Bubble sort, Selection sort, Quick sort, two-way Merge sort, Heap sort,
Partition exchange sort, Shell sort, Sorting on different keys, External sorting.
Searching: Linear search, Binary search
File structures: Physical storage media, File Organization, Linked organization of file, Inverted file,
Organization records into blocks, Sequential blocks, Hash function, Indexing & Hashing, Multilevel
indexing, Tree Index, Random file, Primary Indices, Secondary Indices, B tree index files.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
Horowitz and Sahani, Fundamentals of Data structures, Galgotia publications
Tannenbaum, Data Structures, PHI
R.L. Kruse, B.P. Leary, C.L. Tondo, Data structure and program design in C PHI
Data structures and algorithms Schaum Series.
34
DATA STRUCTURES USING C LAB

Credit Units: 01

Assignment will be provided for following:
Practical application of sorting and searching algorithm.
Practical application of various data structure like linked list, queue, stack, tree
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
35
DATA COMMUNICATION AND COMPUTER NETWORKS LAB

Credit Units: 01
Equipments Required:
Switch Network Cables, Patch Chord- Fiber optical and twisted pair cable, LAN cards, RJ-45
connectors etc.
Platforms required: Linux Server
Course Contents:
Introduction and Installation of Linux
Administrating Linux
Setting up a Local Area Network
Connecting to the Internet
Setting up Print Server
Setting up File Server
Setting up Mail Server
Setting up FTP Server
Setting up Web Server
Setting up MySQL Database Server
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
36
DATABASE MANAGEMENT SYSTEMS LAB

Credit Units: 01
Software Required: Oracle 9i

Topics covered in lab will include:
Database Design
Data Definition (SQL)
Data Retrieval (SQL)
Data Modification (SQL)
Views
Triggers and Procedures
PL\SQL
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
37
UNIX PROGRAMMING LAB

Credit Units: 01
Software Required: UNIX SCO

Assignments will be provided for the following
Introduction to UNIX Commands
Introduction to vi editor
Programming in shell script
Introduction to programming in C Shell
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
Text & References:
Unix Programming Environment The Kernighan and Pike Prentice Hall of India
Unix Shell Programming Kochar
Unix Concepts and application Das Sumitabha Tata Mcgraw Hill
38
Syllabus Fourth Semester

THEORY OF AUTOMATA AND COMPUTATION
Credit Units: 04
Course Objective:
The course begins with the basic mathematical preliminaries and goes on to discuss the general theory
of automata, properties of regular sets and regular expressions, and the basics of formal languages.
Besides, sufficient attention is devoted to such topics as pushdown automata and its relation with
context free languages, Turing machines and linear bounded automata, the basic concepts of
computability such as primitive recursive functions and partial recursive functions.
Course Contents:
Module I: Introduction to Languages and Automata
Formal Grammars and Chomsky Hierarchy, Regular Expression Deterministic and Nondeterministic
Finite Automata, Regular Expression, Two way Finite Automata, Finite Automata with output,
Properties of regular sets, pumping lemma for regular sets, My-Hill-Nerode Theorem.
Module II: Context Free Grammars and Pushdown Automata
CFG: Formal Definition, Derivation and Syntax trees, E-removal, Ambiguous Grammar, Properties of
CFL, Normal Forms (CNF and GNF)
Pushdown Automata: Definitions, Relationship between PDA and context free language, Decision
Algorithms
Module III: Turing Machine
The Turing Machine Model, Language acceptability of Turing Machine, Design of TM, Universal
TM, Churchs Machine.
Recursive and recursively enumerable language, unrestricted grammars, Context Sensitive Language,
Linear Bounded Automata (LBA).
Module IV: Undecidability
Turing machine halting Problem, undecidable problems for recursive enumerable language, Post
correspondence problems (PCP) and Modified Post correspondence problems, Undecidable problems
for CFL.
Module V: Computability
Partial and Total Functions, Primitive Recursive functions, Recursive functions.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
Hopcroft and Ullman, Introduction to Automata Theory, languages and computation, Addision
Wesley.
An introduction to formal languages and Automata (2nd ed) by Peter Linz, D. C. Health and
Company.
References:
Introduction to theory of computation (2nd Ed) by Michael sipser.
Mishra & Chandrashekharan, Theory of Computer Sciences, PHI.
Zavi Kohavi, Switching and finite Automata Theory
Kohan, Theory of Computer Sciences.
Korral, Theory of Computer Sciences.
39
DIGITAL ELECTRONICS
Credit Units: 03
Course Objective:
This course is an introduction to the basic principles of digital electronics. At the conclusion of this
course, the student will be able to quantitatively identify the fundamentals of computers, including
number systems, logic gates, logic and arithmetic subsystems, and integrated circuits. They will gain
the practical skills necessary to work with digital circuits through problem solving and hands on
laboratory experience with logic gates, encoders, flip-flops, counters, shift registers, adders, etc. The
student will be able to analyze and design simple logic circuits using tools such as Boolean Algebra
and Karnaugh Mapping, and will be able to draw logic diagrams.
Course Contents:
Module I: Boolean Functions
Analog & digital signals, AND, OR, NOT, NAND, NOR & XOR gates, Boolean algebra, Standard
representation of logical functions, K-map representation and simplification of logical function, dont
care conditions, XOR & XNOR simplifications of K-maps, Tabulation method.
Module II: Combinational Circuits
Adders, Subtractors, Multiplexer, de-multiplexer, decoder & encoder, code converters, Comparators,
decoder / driver for display devices, Implementation of logic functions using multiplexer / demultiplexer,.
Module III: Sequential Circuits
Flip-flops: SR, JK, D & T flip flops Truth table, Excitation table, Conversion of flip-flops, race
around condition, Master Slave flip flop, Shift registers: SIPO, PISO, PIPO, SIPO, Bi-directional;
Counters: ripple & synchronous counters up / down; Synchronous Sequential circuit: design
procedure.
Module IV: Logic families
Logic families: RTL, DTL, TTL, ECL
Module V: Data Converters
Data converters: ADC successive approximation, linear ramp, dual slope; DAC Binary Weighted,
R-2R ladder type
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Moris Mano: Digital Circuits Systems
R. P. Jain: Digital Logic & Circuits
Thomas L. Floyd: Digital Fundamentals
Malvino and Leech: Digital Principles & Applications
40
DISCRETE MATHEMATICS
Credit Units: 04
Course Objective:
This subject provides students with an in-depth education in the conceptual foundations of computer
science and in engineering complex software and hardware systems. It allows them to explore the
connections between computer science and a variety of other disciplines in engineering and outside.
Combined with a strong education in mathematics, sciences, and the liberal arts it prepares students to
be leaders in computer science practice, applications to other disciplines, and research.
Course Contents:
Module I: Formal Logic
Statement, Symbolic Representation and Tautologies, Quantifiers, Predicator and validity, Normal
form. Propositional Logic, Predicate Logic, First Order Logic.
Module II: Proof & Relation
Techniques for theorem proving: Direct Proof, Proof by Contra position, Proof by exhausting cares
and proof by contradiction, principle of mathematical induction, principle of complete induction.
Recursive definitions, solution methods for linear, first-order recurrence relations with constant
coefficients.
Module III: Sets and Combinations
Sets, Subtracts, power sets, binary and unary operations on a set, set operations/set identities,
fundamental country principles, principle of inclusion, exclusion and pigeonhole principle,
permutation and combination, Pascals triangles, Comparing rates of growth: big theta, little oh, big
oh and big omega.
Module IV: Relation/function and matrices
Relation/function and matrices: Relation, properties of binary relation, operation on binary relation,
closures, partial ordering, equivalence relation, Function, properties of function, composition of
function, inverse, binary and n-ary operations,
characteristic function, Permutation function, composition of cycles, Boolean matrices, Boolean
matrices multiplication.
Module V: Lattices & Boolean Algebra
Lattices: definition, sub lattices, direct product, homomorphism Boolean algebra: definition,
properties, isomorphic structures (in particulars, structures with binary operations) sub algebra, direct
product and homo-morphism, Boolean function, Boolean expression, representation & minimization
of Boolean function.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
J.P. Tremblay & R. Mamohan, Discrete Mathematical Structure with Application to Computer
Science, TMH, New Delhi (2000).
Kolman, Busby & Ross Discrete Mathematical Structures, PHI.
Iyengar, Chandrasekaran and Venkatesh, Discrete Mathematics, Vikas Publication.
Peter Linz, An Introduction to Formal Languages and Automata, Narosa Publishing House.
41
References:
J. Truss, Discrete Mathematics, Addison Wesley.
C.L. Liu, Elements of Discrete Mathematics, McGraw Hill Book Company.
M. Lipson & Lipshutz, Discrete Mathematics, Schaums Outline series.
J. E. Hopcroft & J. D. Ullman, Introduction to Automata Theory, Languages and Computation,
Addison Weliy.
42
COMPUTER GRAPHICS
Credit Units: 04
Course Objective:
The objective of the course is to provide the understanding of the fundamental graphical operations
and the implementation on computer, the mathematics behind computer graphics, including the use of
spline curves and surfaces. It gives the glimpse of recent advances in computer graphics, user
interface issues that make the computer easy, for the novice to use.
Course Contents:
Module I: Introduction to Graphics and Graphics Hardware System
Application of computer graphics, Video Display Devices, Raster Scan Display, Random Scan
Display, Input Devices, Graphic Software and graphics standards, Numerical based on Raster and
Random scan display, Frame buffer, Display processor.
Module II: Output Primitives and Clipping operations
Algorithms for drawing 2D Primitives lines (DDA and Bresenhams line algorithm), circles
(Bresenhams and midpoint circle algorithm), Antialiasing and filtering techniques. Line clipping
(cohen-sutherland algorithm), Curve clipping algorithm, and polygon clipping with Sutherland
Hodgeman algorithm, Area fill algorithms for various graphics primitives: Scanline fill algorithm,
boundary fill algorithm, flood fill algorithm, Polygon representation, various method of Polygon
Inside test: Even-Odd method, winding number method, Character generation techniques.
Module III: 2D Geometric transformation
2D Transformation: Basic transformat ion, Translation, Rotation, Rotation relative to an arbitrary
point, scaling, Matrix Representations and Homogeneous coordinates, window to viewport
transformation.
Module IV: 3D Geometric transformation
3D Concepts: Parallel projection and Perspective projection, 3D Transformations, composite 3D
transformation, co-ordinate transformation, Inverse transformation
Module V: object modeling and Visible Surface detection
fractal geometry methods, fractal dimensions, Geometric construction of deterministic self-similar
fractals, Iterated function system to generate fractals. Bezier curves and Bezier surfaces, Bspline
curves and surfaces, Visible surface detection method: Basic illumination, diffuse reflection, specular
reflection, shadows. Ray tracing method, Depth-buffer method, A-buffer method, Depth-sorting
method (painters algorithm), Binary search partition method, Scan line method,
Module VI: Introduction to multimedia
Design of animation sequences, Computer Animation languages, Elementary filtering techniques and
elementary Image Processing techniques, graphics library functions used in animation design
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
Foley et. al., Computer Graphics Principles & practice, 2nd ed. AWL, 2000.
D. Hearn and P. Baker, Computer Graphics, Prentice Hall, 1986.
R. Plastock and G. Kalley, Theory and Problems of Computer Graphics, Schaums Series,
McGraw Hill, 1986
43
References:
R.H. Bartels, J.C. Beatty and B.A. Barsky, An Introduction to Splines for use in Computer
Graphics and Geometric Modeling, Morgan Kaufmann Publishers Inc., 1987.
C.E. Leiserson, T.H. Cormen and R.L. Rivest, Introduction to Algorithms, McGraw-Hill Book
Company, 1990.
W. Newman and R. Sproul, Principles of Interactive Computer Graphics, McGraw-Hill, 1973.
F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction, Springer-Verlag
New York Inc., 1985.
D. Rogers and J. Adams, Mathematical Elements for Computer Graphics, MacGraw-Hill
International Edition, 1989
David F. Rogers, Procedural Elements for Computer Graphics, McGraw Hill Book Company,
1985.
Alan Watt and Mark Watt, Advanced Animation and Rendering Techniques, Addison-Wesley,
1992
44
DIGITAL ELECTRONICS LAB

Credit Units: 01
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
To verify the truth tables of OR, AND, NOR, NAND, EX-OR, EX-NOR gates.
To obtain half adder, full adder and subtractor using gates and verify their truth tables.
To verify the truth tables of RS, JK and D flip- flops.
To design and study a binary counter.
To design and study synchronous counter.
To design and study ripple counter.
To convert BCD number into excess 3 form
To design and study a decade counter.
To design and study a sequence detector.
To implement control circuit using multiplexer.
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
45
COMPUTER GRAPHICS LAB

Credit Units: 01

Course Contents:
Assignments will be provided for the following:
Geometrical shapes based on graphics algorithms
2D Geometric transformation translation, rotation, scaling, reflection.
Clipping
Animation
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
46
ANALOG ELECTRONICS - I
Credit Units: 02
Course Objective:
This course builds from basic knowledge of Semiconductor Physics to an understanding of basic devices and
their models. This course builds a foundation for courses on VLSI design and analog CMOS IC Design.
Course Contents:
Module I: Semeconductor physics: Mobility & conductivity, Charge densities in a semiconductor,
Fermi dirac distribution, carrier concentration and Fermi levels in semiconductor, generation and
recombination of charges, diffuse and continuity equations, Hall effect.
Module II: Semiconductor Diode and Diode Circuits
Junction diode, Diode as circuit element, Different types of diodes: Zener, Schottky, LED. Zener as
voltage regulator, Diffusion capacitance, Drift capacitance, the load line concept, half wave, full wave
rectifiers, clipping and clamping circuits.
Module III: Bipolar Junction Transistor
Bipolar junction transistor: Introduction, Transistor, construction, transistor operations, BJT
characteristics, load line, operating point, leakage currents, saturation and cut off mode of operations.
Bias stabilization: Need for stabilization, fixed Bias, emitter bias, self bias, bias stability with respect
to variations in Ico, VBE & , Stabilization factors, thermal stability.
Module IV: Small signal Analysis of transistor and Multistage Amplifier
Hybrid model for transistors at low frequencies, Analysis of transistor amplifier using h parameters,
emitter follower, Millers theorem, THE CE amplifier with an emitter resistance, Hybrid model,
Hybrid Conducatnces and Capacitances, CE short circuit current gain, CE short circuit current gain
with RL Multistage amplifier: Cascading of Amplifiers, Coupling schemes(RC coupling and
Transformer coupling)
Module V: Field Effect Transistors
Field effect transistor (JFET, MOSFET): volt-ampere characteristics, small signal model common
drain, common source, common gate, operating point, MOSFET, enhancement and -depletion mode,
Common source amplifier, Source follower
Module VI: Feedback Amplifiers
Feedback concept, Classification of Feedback amplifiers, Properties of negative Feedback amplifiers,
Impedance considerations in different Configurations, Examples of analysis of feedback Amplifiers.
Module VII: Power Amplifiers
Power dissipation in transistors, difference with voltage amplifiers, Amplifier classification (Class A,
Class B, Class C, Class AB) class AB push pull amplifier, collector efficiency of each, cross over
distortion.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Robert F. Pierret: Semiconductor Device Fundamentals, Pearson Education.
Millman and Halkias: Electronic Devices and circuits, Tata McGraw.
Boylestad: Electronic Devices and Circuits, Pearson Education.
47
ANALOG ELECTRONICS LAB I

Credit Units: 01
Course Contents:
1. To study and plot the characteristics of a junction diode.
2. To study Zener diode as a voltage regulator.
3. To study diode based clipping and clamping circuits.
4. To study half wave, full wave and bridge rectifier with filters.
5. To study the input and output characteristics of a transistor in its various configurations.
6. To study and plot the characteristics of a JFET in its various configurations.
7. To study and plot the characteristics of a MOSFET in its various configurations.
8. To study various types of Bias Stabilization for a transistor.
9. To study the gain and plot the frequency response of a single stage transistor amplifier.
10. To measure gain and plot the frequency response of double stage RC coupled amplifier.
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
48
INTERNET FUNDAMENTALS
Credit Units: 03
Course Objective:
Aim of this course is to introduce the students fundamentals concepts of internet and its application.
Course Contents:
Module-I: Electronic Mail and Internet:
Introduction, advantages and disadvantages, Userids, Pass words, e-mail addresses, message
components, message composition, mailer features, E-mail inner workings, E-mail management,
Mime types, Newsgroups, mailing lists, chat rooms. Introduction to networks and internet, history,
Working of Internet, Internet Congestion, internet culture, business culture on internet. Collaborative
computing & the internet. Modes of Connecting to Internet, Internet Service Providers(ISPs), Internet
address, standard address, domain name, DNS, IP.v6.Modems and time continuum, communications
software; internet tools.
Module-II: World Wide Web:
Introduction, Miscellaneous Web Browser details, searching the www: Directories search engines and
meta search engines, search fundamentals, search strategies, working of the search engines, Telnet
and FTP. Introduction to Browser, Coast-to-coast surfing, hypertext markup language, Web page
installation, Web page setup, Basics of HTML & formatting and hyperlink creation. Using FrontPage
Express, Plug-ins.
Module-III: Languages:
Basic and advanced HTML, java script language, Client and Server Side Programming in java script.
Forms and data in java script, XML basics, cascading style sheets.
Module-IV: Introduction to Web Servers: PWS, IIS, Apache; Microsoft Personal Web Server.
Accessing & using these servers,
Module-V: Privacy and security topics:
Introduction, Software Complexity, Encryption schemes, Secure Web document, Digital Signatures,
Firewalls.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text Book:
Fundamentals of the Internet and the World Wide Web, Raymond Greenlaw and Ellen Hepp 2001,
TMH
Internet & World Wide Programming, Deitel,Deitel & Nieto, 2000, Pearson Education
Reference Books:
Complete idiots guide to java script,. Aron Weiss, QUE, 1997
Network firewalls, Kironjeet syan -New Rider Pub.
www. secinf.com
49
ARTIFICIAL NEURAL NETWORKS

Credit Units: 02
Course Objective:
Aim of this course is to introduce the students fundamentals concepts of Nural network and its various
application in computer science.
Module I:Artificial Neural Networks (ANN) and biological neural networks, supervised and unsupervised
learning rules, neural network applications.
Module II:Unsupervised learning:- Hebbian learning and competitive learning. Supervised learning:- Back
propagation algorithms,
Learning rule:Delta learning rule, Widrow-Hoff learning rule, Winner-Take-All learning rule.
Module III:Feed forward neural network, feed backward neural network, Perceptron and its learning law, singlelayer perceptron, multi-layer perceptron.
Module IV:Self organizing networks: Kohonen algorithm, Hopfield Networks: Hopfield network algorithm,
Adaptive resonance theory: Network and learning rules.
Module V:Associative memory, auto-associative memory, bi-directional associative memory.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text Book:
1. Kenji Suzuki (ed.) - InTech , 2013
2. Todd Troyer - University of Texas at San Antonio , 2005
50
ARTIFICIAL NEURAL NETWORKS LAB

Credit Units: 01
Course Objective
The aim of this lab to gain the practical knowledge of basic neuron models and learning algorithms.
Lab Assignment
To study some basic neuron models and learning algorithms by using Matlabs neural network
toolbox
Examination Scheme
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
51
Syllabus Fifth Semester

SOFTWARE ENGINEERING
Credit Units: 03
Course Objective:
The basic objective of Software Engineering is to develop methods and procedures for software
development that can scale up for large systems and that can be used to consistently produce highquality software at low cost and with a small cycle time. Software Engineering is the systematic
approach to the development, operation, maintenance, and retirement of software.
The course provides a thorough introduction to the fundamentals principles of software engineering.
The organization broadly be based on the classical analysis-design-implementation framework.
Course Contents:
Software life cycle models: Waterfall, Prototype, Evolutionary and Spiral models, Overview of
Quality Standards like ISO 9001, SEI-CMM
Module II: Software Metrics and Project Planning
Size Metrics like LOC, Token Count, Function Count, Design Metrics, Data Structure Metrics,
Information Flow Metrics. Cost estimation, static, Single and multivariate models, COCOMO model,
Putnam Resource Allocation Model, Risk management.
Module III: Software Requirement Analysis, design and coding
Problem Analysis, Software Requirement and Specifications, Behavioural and non-behavioural
requirements, Software Prototyping Cohesion & Coupling, Classification of Cohesiveness &
Coupling, Function Oriented Design, Object Oriented Design, User Interface Design Top-down and
bottom-up Structured programming, Information hiding,
Module IV: Software Reliability, Testing and Maintenance
Failure and Faults, Reliability Models: Basic Model, Logarithmic Poisson Model, Software process,
Functional testing: Boundary value analysis, Equivalence class testing,Structural testing: path testing,
Data flow and mutation testing, unit testing, integration and system testing, Debugging, Testing
Tools, & Standards. Management of maintenance, Maintenance Process, Maintenance Models,
Reverse Engineering, Software RE-engineering
Module V: UML
Introduction to UML,Use Case Diagrams, Class Diagram: State Diagram in UML Activity Diagram
in UML Sequence Diagram in UML Collaboration Diagram in UML, Domain,Component Diagram
and Deployement Diagram
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
K. K. Aggarwal & Yogesh Singh, Software Engineering, 2nd Ed, New Age International, 2005.
R. S. Pressman, Software Engineering A practitioners approach, 5th Ed., McGraw Hill Int.
Ed., 2001.
52
References:
R. Fairley, Software Engineering Concepts, Tata McGraw Hill, 1997.
P. Jalote, An Integrated approach to Software Engineering, Narosa, 1991.
Stephen R. Schach, Classical & Object Oriented Software Engineering, IRWIN, 1996.
James Peter, W. Pedrycz, Software Engineering, John Wiley & Sons.
Sommerville, Software Engineering, Addison Wesley, 1999.
53
SOFTWARE ARCHITECTURE
Credit Units: 04
Course Objective:
To analyze and design large scale software and apply different architecture styles to software design
and to provide practical knowledge in software architecture and to Understand the role of the
Software Architect with a development project and Use methods for constructing and evaluating
architectures.
Course Contents:
Module I - INTRODUCTION
Software Architecture ,Architecture Structures and Views , Importance of Software Architecture ,
Predicting System Quality , Influencing Organizational Structure , Improving Cost and Schedule
estimates , Context of Software architecture.
Module II-QUALITY ATTRIBUTES
Understanding quality attributes , availability ,,interoperability , modifiability , performance and
security , testability , usability , quality attribute modeling and analysis.
Module III-ARCHITECTURE IN THE LIFE CYCLE
Architecture in the agile projects , Architecture and requirements , Designing and documentation
,Implementation and testing , Architecture reconstruction and conformance.
Module IV-ARCHITECTURE AND BUSINESS
Economic analysis of Architecture , Architecture competence ,Architecture and Software product
lines , Case Studies.
Module V-ARCHITECTURE IN ADVANCE
Architecture in Cloud , Cloud Definition , Service Model , Economic Justification , Base Mechanism
,Architecture for the Edge , Edge Document system ,SDLC , Metropolis Model.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
TEXT BOOKS
1. Len Bass, Paul Clements, Rick Kazman, Software Architecture in Practice, 3rd edition Pearson,
2013.
2. Mary Shaw, David Garlan, Software Architecture: Perspectives on an Emerging Discipline,
Prentice Hall, 1996.
REFERENCES
1. Taylor R. N, Medvidovic N, Dashofy E. M, Software Architecture: Foundations, Theory, and
Practice, Wiley, 2009.
2. Booch G, Rumbaugh J, Jacobson I, The Unified Modeling Language User Guide, AddisonWesley, 1999
54
SOFTWARE PROJECT MANAGEMENT

Credit Units: 04
Course Objective:
This course on Software Project Management highlights Software Project planing and management,
Software Proces and Metrics , Project Planing and Risk Management.
MODULE I - BASIC CONCEPTS

Product Proces and project, Definiton,Product life Cycle: Prototype Development Phase, Alpha Phase,
Beta Phase, Production &Maintenance Phase,Project Life Cycle Models:Water fall Model, Prototype
Model, RAD & Spiral Model,Process Models.
MODULE II UMBRELA ACTIVITIES
Metrics,Software Configuration Management: Proces and activites ,Configuration audit, Metrics in
SCM, Tols & automation Software Quality,Asurance:Quality Control & Quality Asurance, Tols,
Measure of SQA Suces Risk Management:Risk Management Cycle, Risk Identifcation,
Quantifcation,Monitoring, Mitgation, Metrics in Risk Management.
MODULE III - PROJECT MANAGEMENT PROCES AND ACTIVITIES

In-Stream activites , Project initation: activites, Outputs, Quality Records,completion criteria ,Project
Planing and Tracking: Components, activites specifc to Project tracking,Project Closure: Efective
closure Proces isues,
Metrics for Project Closure.
MODULE IVENGINERING ACTIVITIES IN PROJECT LIFE CYCLE
Software requirement Gathering: Inputs and start criteria, Dimentions, steps ,Output & Quality
records, Skilsets, Chalenges, Metrics for Requirement Phase ,Estimation : Phases of Estimation,
Methodology, Models for size estimation, Chalenges, Metrics for Estimation Proces ,Design and
Development Phases- Project Management in Testing & Maintenance Phase.
.
MODULE V-EMERGING TRENDS IN PROJECT MANAGEMENT
Globalization Isues in Project management : Evolution, Chalenges, Models ,Impact of the internet on
Project Management:Efect of internet on Project management, managing project for internet, Project
management activites , People Focused Proces Models:People centric models, P-CMM, other
peoplefocused
Models.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
TEXT BOOKS
1. Ramesh Gopalaswamy, Managing and global Software Projects, Tata Mc Graw Hil.Tenth
Reprint 201.(Revised)
REFERENCES
1. Roger S.Presman, Software Enginering - A Practioners Aproach, 7th Editon McGraw Hil,
2010.(Revised).
2. Humphery Wats, Managing the Software Proces, Adision Wesley, 1989.(Revised).
55
SOFTWARE ENGINEERING LAB

Credit Units: 01
Software Required: Rational Rose

Use of Rational Rose for visual modeling.
Creating various UML diagrams such as use case, sequence, collaboration, activity, state diagram,
and class diagrams.
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
56
SOFTWARE PROJECT MANAGEMENT LAB

Credit Units: 01
Software Required: MS Project

Minimum 10 assignment will be done using MS Project
Examination Scheme:
IA
A
5
PR
10
EE
LR
10
V
5
PR
35
V
35
57
FUZZY LOGIC
Credit Units: 03
Course Objective:
This course introduces the student to intelligent control theory,introduce Machine Intelligence and to
understand Fuzzy Logic Theory and Neural Network Theory. It will help students design Intelligent
Controllers using Fuzzy and Neural Systems.
Course Contents:
Module I:Introduction
Crisp sets: Overview, Fuzzy sets : Basic types and concepts,Characterstics and significance of
paradigm shift, Fuzzy sets vs Crisp sets, Representation of fuzzy sets
Module II: Fuzzy operations and Fuzzy airthmetic
Types of operations, Fuzzy complements, Fuzzy intersection:t-norms, Fuzzy union:tconorms,Combination of operations, Aggregation operation, Fuzzy numbers , Linguistic
variables,Airthmetic operations on intervals, Airthmetic operations on Fuzzy numbers, Lattice of
Fuzzy numbers, Fuzzy equation.
Module III: Fuzzy systems
General discussion, Fuzzy controller: Overview and example, Fuzzy systems and neural networks,
Fuzzy neural network, Fuzzy automata.
Module IV : Applications
Pattern recognition in fuzzy logic, Database and information retrieval in fuzzy logic, decision making
in fuzzy logic, engineering applications and fuzzy logic, Fuzzy logic in Medicine and Economics.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
Fuzzy sets and fuzzy logic theory and application by George. j. klir , Bo Yuan
References:
A First Course in Fuzzy and Neural Control by Nguyen, Prasad, Walker, and Walker. CRC 2003
Artificial Intelligence by Negnevisky. Addison-Wesley
Automatic Control Systems by Colnaraghi and Kuo. 9th
edition. Wiley Publisher. 2010
58
JAVA PROGRAMMING
Credit Units: 02
Course Objective:
The objective is to impart programming skills used in this object oriented language java.
The course explores all the basic concepts of core java programming. The students are expected to
learn it enough so that they can develop the web solutions like creating applets etc.
Course Contents:
Module I:Java Basics
Concepts of OOP, Features of Java, How Java is different from C++, Environmental setup, Basic
syntax, Objects and classes, Basic Data Types, Variable Types, Modifier Types, Basic operators,
Loop Control, Decision Making, Strings and Arrays, Methods, I/O.
Module II: Java Object Oriented
Inheritance, Overriding, Polymorphism, Abstraction, Encapsulation, Interfaces, Packages, Exploring
java.util package.
Module III: Exception Handling and Threading
Exception Hierarchy, Exception Methods, Catching Exceptions, Multiple catch Clauses, Uncaught
Exceptions Javas Built-in Exception. Creating, Implementing and Extending thread, thread priorities,
synchronization suspending, resuming and stopping Threads, Multi-threading.
Module IV : Event Handling And AWT
Event handling Mechanism, Event Model, Event Classes, Sources of Events, Event Listener
Interfaces
AWT: Working with Windows, AWT Controls, Layout Managers
Module V: Java Advanced
Applet Class, Architecture, Skeleton, Display Methods. Swings: Japplet, Icons, labels, Text Fields,
Buttons, Combo Boxes. Socket Programming: Socket methods, Server Socket methods, Socket Client
and Socket Server examples.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
JAVA The Complete Reference by Patrick Naughton & Herbert Schild, TMH
Introduction to JAVA Programming a primar, Balaguruswamy.
References:
Introduction to JAVA Programming Daniel/Young PHI
Jeff Frentzen and Sobotka, Java Script, Tata McGraw Hill,1999
59
JAVA PROGRAMMING LAB

Credit Units: 01
Software Required: JDK1.3

Java programs using classes & objects and various control constructs such as loops etc, and data
structures such as arrays, structures and functions
Java programs for creating Applets for display of images and texts.
Programs related to Interfaces & Packages.
Input/Output and random files programs in Java.
Java programs using Event driven concept.
Programs related to network programming.
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
60
COMMUNICATION SYSTEMS
Credit Units: 02
Course Objective:
The purpose of this course is to provide a thorough introduction to analog and digital communications
with an in depth study of various modulation techniques, Random processes are discussed, and
information theory is introduced.
Course Contents:
Communication Process, Source of Information, Communication channels, base-band and pass-band
signals, Review of Fourier transforms, Random variables, different types of PDF, need of modulation
process, primary communication resources, analog versus digital communications
Module II: Amplitude modulation
Amplitude modulation with full carrier, suppressed carrier systems, single side band transmission,
switching modulators, synchronous detection, envelope detection, effect of frequency and phase
errors in synchronous detection, comparison of various AM systems, vestigial side band transmission.
Module III: Angle Modulation
Narrow and wide band FM, BW calculations using Carlson rule, Direct & Indirect FM generations,
phase modulation, Demodulation of FM signals, noise reduction using pre & de-emphasis.
Module IV: Pulse Modulation
Pulse amplitude, width & position modulation, generation & detection of PAM, PWM & PPM,
Comparison of frequency division and time division multiplexed systems,
Basics of digital communications: ASK, PSK, FSK, QPSK basics & wavform with brief mathematical
introduction
Module V: Noise
Different types of noise, noise calculations, equivalent noise band width, noise figures, effective noise
temperature, noise figure.
Module VI: Introduction to Information Theory
Measurement of Information, mutual, Shannons theorem, Source coding, channel coding and channel
capacity theorem, Huffman code
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
B. P. Lathi: Modern analog & digital communication, OXFORD Publications
Wayne Tomasi: Electronic Communication systems, Pearson Education, 5th edition
References:
Simon Haykin, Communication Systems, John Wiley & Sons, 1999, Third Edition.
Taub and schilling, Principles of Communication Systems TMH
61
COMMUNICATION SYSTEMS LAB

Credit Units: 01
1.
2.
3.
4.
5.
6.
7.
8.
To study the sampling and reconstruction of a given signal.

To study amplitude modulation and demodulation.
To study frequency modulation and demodulation.
To study time division multiplexing.
To study pulse amplitude modulation.
To study delta and adaptive delta modulation and demodulation.
To study carrier modulation techniques using amplitude shift keying and Frequency shift keying.
To study carrier modulation techniques using binary phase shift keying and differential shift
keying.
9. To study pulse code modulation & differential pulse code modulation as well as relevant
demodulations.
10. To study quadrature phase shift keying & quadrature amplitude modulation.
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
62
Syllabus Sixth Semester

SOFTWARE DESIGN
Credit Units: 04
Course Objective:
The purpose of this course is to impart knowledge on the basic concepts of the design principles of
software Understand software modeling and Architectural Concepts and to Gain knowledge about
Static and Dynamic modeling and Understand the importance of Software Quality attributes in
Software Design and Solving various Case studies using the concepts learnt and understood in this
course
Course Contents:
MODULE IINTRODUCTION
Software Modeling , Object oriented Methods and UML,Software Architectural design , Method and
Notation ,Evolution of Software Modeling and Design Methods , Overview of UML Notations ,
Software Life cycles and UML Processes , Software Life cycle and Models , Design Verification and
Validation , Software Design and Architectural Concepts , OO Concepts , Information Hiding ,
Inheritance and Generalization, Concurrent Processing , Design Patterns , Requirements analysis and
Design Modeling , Designing Software Architectures.
MODULE IISOFTWARE MODELING
Use case Modeling , Static Modeling , Association between classes, Composition and Classification
Hierarchies ,Constraints , Static Modeling and the UML , Categorization of classes using UML
stereotypes , Modeling External Classes , Static Modeling of Entity Classes , Object and class
Structuring
MODULE IIIDETAILED DESIGN
Dynamic Interaction Modeling , Object Interaction Modeling , Message Sequence Numbering on
Interaction Diagram , Dynamic Interaction Modeling ,Stateless Dynamic Interaction Modeling, Finite
State Machines and State Transitions ,Events, Guard Conditions and Actions , Hierarchical State
charts , Guidelines for designing State Charts , Steps in State Dependent Dynamic Interaction
Modeling , Modeling Interaction Scenarios using Interaction and State Chart Diagrams
MODULE IVARCHITECTURAL DESIGN
Software Architecture and Component Based Software Architecture , Multiple views of Software
Architecture and Patterns , Documenting Software Architecture , Interface Design , Designing
Software Architecture , Software Sub system Architectural Design , Designing Object oriented
Software Architecture , Designing Component Based Software Architecture
MODULE VCASE STUDIES
Designing Concurrent and Real time Software Architectures , Designing Software Product Line
Architectures , Software Quality Attributes , Case Studies , Client , Server Software Architecture Case
Study , Component Based Software Architecture Case Study , Real Time Software Architecture
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
63
Text & References:

TEXT BOOKS
1. Hassan Gomma, Software Modeling and design with UML, Cambridge University Press, 1
edition, 2011.
2. Michael Bigrigg, Software Design Specification with UML, Addison- Wesley, 2007.
REFERENCES
1. David Budgen, Software Design, Addison-Wesley, 2007.
2. Christopher Fox, Introduction to Software Engineering Design: Processes, Principles and Patterns
with UML2, Pearson, 2007.
64
SOFTWARE TESTING
Credit Units: 04
Course Objective:
The purpose of this course is to provide an understanding of concepts and techniques for testing
software and assuring its quality.
Course Contents:
MODULE I - INTRODUCTION
Activities of a Test Engineer , Testing Levels Based on Software Activity , Beizer's Testing Levels
Based on Test-Process Maturity , Automation of Test Activities , Software Testing Limitations and
Terminology , Coverage Criteria for Testing , Infeasibility and Subsumption , Characteristics of a
Good Coverage Criterion , Older Software Testing Terminology
MODULE II-GRAPH TESTING
Graph Coverage Criteria , Structural Coverage Criteria , Graph Coverage for Source Code , Graph
Coverage for Design Elements , Graph Coverage for Specifications - Graph Coverage for Use Cases Representing Graphs Algebraically
MODULE III-LOGIC TESTING & INPUT SPACE PARTITIONING
Logic Predicates and Clauses - Logic Expression Coverage Criteria Structural Logic Coverage of
Programs -Specification-Based Logic Coverage Logic Coverage of Finite State Machines Disjunctive Normal Form Criteria. Input Domain Modeling - Combination Strategies Criteria Constraints among Partitions
MODULE IV-SYNTAX TESTING
Syntax- Based Coverage Criteria - Program-Based Grammars - Integration and Object-Oriented
Testing - Specification-Based Grammars - Input Space Grammars. Regression Testing - Integration
and Testing - Test Process Test Plans
MODULE V-ENGINEERING CRITERIA
Testing Object-Oriented Software - Unique Issues with Testing OO Software - Types of ObjectOriented Faults Testing Web Applications and Web Services - Testing Static Hyper Text Web Sites
- Testing Dynamic Web Applications Testing Web Services - Testing Graphical User Interfaces Testing GUIs - Real-Time Software and Embedded Software.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
TEXT BOOKS
1. Paul Ammann, Jeff Offutt, Introduction to Software Testing, Cambridge University Press, 2008.
2. Srinivasan Desikan, Gopalaswamy Ramesh, Software Testing: Principles and Practices, Pearson,
2012.
REFERENCES
1. Aditya P. Mathur, Foundations of Software Testing, Pearson, 2008.
2. Paul C. Jorgensen, Software Testing: A Craftsman's Approach, Auerbach Publications, 2008.
65
SOFTWARE MEASUREMENTS AND METRICS

Credit Units: 03
Course Objective:
The purpose of this course is to provide the knowledge about Software Metrics, Essentials of software
metrics and practical knowledge to assess software.To provide a solid background knowledge about
software Metrics.
Course Contents:
MODULE I - THE HISTORY AND EVOLUTION OF SOFTWARE METRICS
Evolution of the software industry and evolution of software measurements The cost of counting
function point metrics The paradox of reversed productivity for high-Level languages- The Varieties
of functional metrics Variations in application size and productivity rates Future Technical
Developments in Functional Metrics- Software measures and metrics not based on function points.
MODULE II-MEASURING SOFTWARE QUALITY
Quality control and international competition Defining quality for measurement and estimation
Five steps to software quality control- Measuring software defect removal- Measuring Defect removal
efficiency Measuring the costs of defect removal Evaluating defect prevention methods
Measuring customer reported defects- Measuring invalid defects, Duplicate defects and special casesReliability Models - The Rayleigh Model- Reliability Growth Models.
MODULE III-PROCESS METRICS
In-Process Metrics for Software Testing - Test Progress S Curve - Testing Defect Arrivals Over Time
- Product Size Over Time - CPU Utilization - Effort/Outcome Model. Complexity Metrics and
Models - Lines of Code - Halstead's Software Science - Cyclomatic Complexity. - Syntactic
Constructs - Structure Metrics. Metrics for Object-Oriented Projects - Concepts and Constructs Design and Complexity Metrics - Lorenz Metrics and Rules of Thumb - CK OO Metrics Suite Productivity Metrics.
MODULE IV-MECHANICS OF MEASUREMENT
Software Assessments Software Baselines Software Benchmarks- What a Baseline analysis covers
Developing or Acquiring a baseline data collection Instrument Administering the data collection
questionnaire Analysis and aggregation of the Baseline data. Measuring and Analyzing Customer
Satisfaction - Surveys - Data Collection - Sampling Methods - Analyzing Satisfaction Data.
Conducting In-Process Quality Assessments - Preparation - Evaluation - Quantitative Data Qualitative Data - Evaluation Criteria - Overall Assessment.
MODULE V-MEASUREMENTS, METRICS AND INDUSTRY LEADERSHIP
Measures and metrics of industry leaders Measures, metrics and innovation Measurements,
metrics and outsource litigation Measurements, metrics and behavioral changes Commercial
software measurement tools. Measuring Process Maturity - Process Capability - Value of Process
Improvement Process Adoption Process Compliance. Function Point Metrics to Measure Software
Process Improvement - Software Process Improvement Sequences.
Examination Scheme:
Components
Weightage (%)
A
5
CT
10
S/V/Q
8
HA
7
EE
70
Att: Attendance
66
Text & References:

TEXT BOOKS
1. Caper Jones, Applied Software Measurement: Global Analysis of Productivity and Quality, Third
Edition, McGraw Hill Companies, 2008.
2. Stephen H. Kan, Metrics and Models in Software Quality Engineering, Addison Wesley, 2011.
REFERENCES
1. Mark Lorenz, Jeff Kidd, Object-Oriented Software Metrics, Prentice Hall,2000.
2. Naresh Chauhan, Software Testing Principles and Practices, Oxford University Press, 2010.
3. Ravindranath Pandian C, Software Metrics A Guide to planning, Analysis, and Application,
Auerbach, First Indian Reprint, 2011.
67
OBJECT ORIENTED SOFTWARE ENGINEERING

Credit Units: 03
Course Objective:
Object-oriented software engineering (OOAD) is a software engineering approach that models a
system as a group of interacting objects. Each object represents some entity of interest in the system
being modeled, and is characterized by its class, its state (data elements), and its behaviour. The
course aims to discuss the static structure, dynamic behaviour, and run-time deployment of these
collaborating objects.
Course Contents:
Module I: Object Oriented Design Fundamentals
The Object Model: Overview of Object Oriented system Development Object Basic Object
Oriented Systems Development Life Cycle.
Object Oriented Analysis: Methodologies Shaler / Meller, Coad / Yourdon, Rumbaugh et al.s
Object Modeling Technique; The Booch Methodology; The Jacobson et al.Methodologies; Patterns;
Frameworks; The Unified Approach.
Module II: Unified Modeling Language
Introduction Static and Dynamic Models; Why Modeling? ; Introduction to the Unified Modeling
Language; UML Diagrams; Static Diagram:
UML Class Diagram: Class, interface, package, Relationships between classes, UML Use Case
Diagram; UML Dynamic Modeling (Behavioural Diagram); Implementation Diagrams;
Module III: Object Oriented Analysis Process
Identifying use cases: Introduction; Use Case Driven Object Oriented Analysis: The Unified
Approach; Business Process Modeling; Use Case Model; Developing Effective Documentation
Object Analysis: Classification: Introduction; classifications Theory; Approaches for Identifying
Classes; Noun Phrase Approach; Common Class Patterns Approach; Use Case Driven Approach:
Identifying Classes and Their Behaviours through Sequence/Collaboration Modeling; Classes,
Responsibilities, and Collaborators.
Module IV: Identifying Object Relationships, Attributes, and Methods
Introduction; Associations; Super-Sub Class Relationships; A Part of Relationships Aggregation
;Class responsibility: Identifying Attributes and Methods; Class Responsibility: Defining Attributes
by Analyzing Use Cases and Other UML Diagrams; Object Responsibility: Methods and Messages
The Object oriented Design Process And Design Axioms: Introduction;
The ObjectOriented Design Process; ObjectOriented Design Axioms; Corollaries.
Module V: Designing Classes
Introduction; The ObjectOriented Design Philosophy; UML Object Constraint Language; Designing
Classes: The Process; Class Visibility: Designing WellDefined Public, Private, and Protected
Protocols; Designing Classes: Refining Attributes; Designing Methods and Protocols; Packages and
Managing Classes.
View Layer: Designing Interface Objects: Introduction; User Interface Design as a Creative
Process; Designing View Layer Classes.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
68
Text & References:

Text:
Object Oriented Systems Development Using the Unified Modeling Language, Ali Bahrami,
Tata McGraw Hill International Editions, Computer Science Series.
Object Oriented Analysis & Design with Applications, Grady Booch, 2nd Edition Pearson
Education 1999.
References:
Unified Modeling Language Reference Manual, James Rumbaugh, Jacobson, Booch, PHI.
The Unified Software Development Process, Jacobson et al., AW, 1999.
Object Oriented Analysis and Design, Atul Kahate, Tata McGraw Hill Co Edition 2004.
Object Oriented Software Engineering: Practical Software Development Using UML and JAVA
Timothy C. Lethbridge and Robert Langaniere, Tata McGraw Hill Co
69
SOFTWARE DESIGN LAB

Credit Units: 01
Course Contents:
To develop a problem statement
2. a. Develop an IEEE standard SRS document
b. Also develop risk management and project plan using Gantt Chart
3. Identify use cases and develop the Use Case Model. Also give Use Case Descriptions.
4. Identify the business activities and develop the UML Activity Diagram
5 Identify the conceptual Classes and develop the Domain Model by using the Class Diagrams.
6. Using the identifies scenarios, find the interaction between the objects and represent them by using
the UML Interaction Diagram.
7. Develop the State chart Diagrams, depicting the various states and transitions in the objects.
8. Identify the user interface, domain objects, and Technical services. Draw the partial layered and
logical architecture diagram using the UML Package Diagram.
9. Identify the various components in your project and develop the Component Diagrams
10. Develop the Deployment Diagrams.
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
70
SOFTWARE TESTING LAB

Credit Units: 01
Software Required: Rational Robo

Using Testing Tool, do the following Experiments
1. Test Principles and Concepts
2. 2. Test Management
3. 3. Build the Test Environment
4. 4. Test Planning Process
5. 5. Test Design
6. 6. Performing Tests
7. 7. Defect Tracking and Correction
8. 8. Acceptance Testing
9. 9. Status of Testing
10. 10. Test Reporting.
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
71
OBJECT ORIENTED SOFTWARE ENGINEERING LAB

Credit Units: 01
Programming Language: Java

1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
WAP to display label on a frame with the help of JFrame

WAP to display six buttons on a panel using JFrame.
WAP. To display an image and a string in a label on the JFrame.
WAP that implement a JApplet that display a simple label
WAP that implement a JApplet and display the following frame
a. Customer name
b. Customer number
c. Age
d. Address
WAP to access a table Product Master from MS-Access using Java code.
WAP that implement a simple servlet program.
WAP for authentication, which validate the login-id and password by the servlet code.
WAP to connecting a database using user-id and password.
WAP to insert data into the database using the prepared statement.
WAP to read data from the database using the Resulset.
WAP to read data send by the client (HTML page) using servlet.
WAP to include a HTML page into a JSP page.
WAP to handle the JSPException.
WAP to read data send by a client (HTML page) using JSP.
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
72
INTRODUCTION OF GENETIC ALGORITHM

Credit Units: 03
Course Objective:-Genetic Algorithms is a sub-field of Artificial Intelligence. GA use Nature as a

metaphor and are inspired in the principles of natural selection and genetics. These algorithms have
been applied successfully for solving difficult problems across a broad spectrum of fields, including
engineering, economics and finance, architecture, design, automatic programming, art generation, and
many others
Course Contents:
Module- I: Introduction
Fundamentals of genetic algorithm: A brief history of evolutionary computation, biological
terminology, search space encoding, reproduction elements of genetic algorithmgenetic modeling,
comparison of GA and traditional search methods. The Fundamental Theorem, Schema Processing at
work, Two-armed and k-armed Bandit problem, The Building block hypothesis.
Module-II: Genetic
Technology
Genetic technology:- steady state algorithm, fitness scaling, inversion.Geneticprogramming:- Genetic
Algorithm in problem solving, Implementing a Genetic Algorithm:- computer implementation,
operator (reproduction, crossover and Mutation, Fitness Scaling, Coding, Discretization). Knowledge
based techniques in Genetic Algorithm.Advanced operators and techniques in genetic search:Dominance, Diploidy and Abeyance. Inversion and other reordering operators, Niche and speciation.
Module- III: Genetic Algorithm
Genetic Algorithm in engineering and optimization-natural evolution Simulated annealing and Tabu
search -Genetic Algorithm in scientific models and theoretical foundations.
Module- IV: Introduction to genetics-based machine learning
Introduction to genetics - based machine learning: Classifier system, Rule and Message system,
Apportionment of credit, Knowledge based Techniques, Genetic Algorithms and parallel. processors.
Module- V: Applications of Genetic based machine learning
Applications of Genetic based machine learning-Genetic Algorithm and parallel
processors- composite laminates- constraint optimization- multilevel optimization- real
life problem.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text Book:David E. Goldberg, "Genetic Algorithms in search, Optimization & Machine Learning"
Reference Books:1. William B. Langdon, Riccardo Poli,"Foundations of Genetic Programming"
2. P. J. Fleming, A. M. S. Zalzala "Genetic Algorithms in Engineering Systems
3. David A. Coley, "An Introduction to Genetic Algorithms for Scientists and Engineers ".
4. Melanie Mitchell- An introduction to Genetic Algorithm- Prentice-Hall of India
73
SOFTWARE PROCESS MATURITY MODEL

Credit Units: 03
Course Objective:
To know about the software process and Software Process Maturity Models and To study about how
to assess software process and to study about software improvement sequences.
Course Contents:
Software Process - Software Maturity Framework Software process Improvement Process
Maturity levels Principles of Software process Change Software Process Assessment.
MODULE IICMM
CMM Introduction CMM Maturity Levels - Initial process- Repeatable Process Defined Process
Managed Process Optimizing Process.
MODULE IIICMMI
Evolution of CMMI CMMI Framework CMMI for Development Capability level Maturity
levels Case Study.
MODULE IV TMM
Introduction to TMM , Structure of the TMM , Components of TMMi , Generic Goals and Generic
Practices , Process areas for Generic practices , TMMi Maturity Levels , Initial , Managed , Defined ,
Management and Measurement , Optimization.
MODULE VAGILE MATURITY MODEL
Agile Software Development , Process Improvement framework for Agile Software Development
,Intial Level , Explored Level , Defined level , Improved Level , Sustained Level , Software Process
Improvement for Agile Software Development Practices.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
TEXT BOOKS
1. Watts S. Humphrey, Managing the Software process, Pearson education, 2008.
2. Marry Beth Chrissis, Mike Konnard, Sandy Shrum, CMMI : guidelines for Process Integration
and Product Improvement, Addison Wesley, 3rd Edition, 2011.
REFERENCES
Mark. C. Paulk, CMM:Guidelines for Improving the Software Process, 2011.
74
ADVANCE JAVA PROGRAMMING

Credit Units: 02
Course Objective:
The objective is to equip the students with the advanced feature of contemporary java which would
enable them to handle complex programs relating to managing data and processes over the network.
The major objective of this course is to provide a sound foundation to the students on the concepts,
precepts and practices, in a field that is of immense concern to the industry and business.
Course Contents:
Module I: Distributed Computing
Introduction to Java RMI, RMI services, RMI client, Running client and server, Introduction of
Swing, Swing Components, Look and Feel for Swing Components, Introduction to Multimedia
Programming.
Module II: Database Connectivity
ODBC and JDBC Drivers, Connecting to Database with the java.sql Package, Using JDBC
Terminology, JDBC with mysql, postgresql.
Module III: Servlet Programming
Introduction to Servlets, Servlet Life Cycle, Servlet based Applications, Servlet and HTML.Filters,
jdbc with servelets, session Management techniques in detail.
Module IV: JSP Programming
JSP: Introduction to JSP, JSP implicit objects, JSP based Applications, Java. Net. Login & Logout
Example, jdbc with jsp.
Module V: JEE Web Appliaction
The Model-View-Controller Architecture What is Struts, Struts Tags, Creating Beans, Other Bean
Tags, Bean Output, Creating HTML Forms, The Action Form class The Action class, Simple Struts: a
simple Struts application; Introduction to EJB.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
Java 2 Unleashed (Techmedia SAMS), Jamie Jaworski
Professional Java Server Programming (a Press), Allamaraju
Developing Java Servlets (Techmedia SAMS), James Goodwill sing Java 1.2 Special Edition
(PHI), Webber
References:
David Flanagan,Jim Parley, William Crawford & Kris Magnusson, Java Enterprise in a nutshell A desktop Quick reference - O'REILLY, 2003
Stephen Ausbury and Scott R. Weiner, Developing Java Enterprise Applications, Wiley-2001
Jaison Hunder & William Crawford, Java Servlet Programming, O'REILLY, 2002
Dietal and Deital, JAVA 2 PEARSON publication
75
ADVANCE JAVA PROGRAMMING LAB

Credit Units: 01
Course Contents:
Programming Language: Java
1WAP to display label on a frame with the help of JFrame
2WAP to display six buttons on a panel using JFrame.
3WAP. To display an image and a string in a label on the JFrame.
4WAP that implement a JApplet that display a simple label
5WAP that implement a JApplet and display the following frame
e. Customer name
f. Customer number
g. Age
h. Address
6. WAP to access a table Product Master from MS-Access using Java code.
7. WAP that implement a simple servlet program.
8. WAP for authentication, which validate the login-id and password by the servlet code.
9. WAP to connecting a database using user-id and password.
10. WAP to insert data into the database using the prepared statement.
11. WAP to read data from the database using the Resulset.
12. WAP to read data send by the client (HTML page) using servlet.
13. WAP to include a HTML page into a JSP page.
14. WAP to handle the JSPException.
15. WAP to read data send by a client (HTML page) using JSP.
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
76
Syllabus Seventh Semester

ANALYSIS OF SOFTWARE ARTIFACTS
Coure code : SFE2701
Credit Units: 04
Course Objective:
To enhance students software testing and analysis skills. And to Understand the concepts of quality
models, frame work and testing and to Gain knowledge in analysis of software under various
dimensions
Course Contents:
MODULE I - QUALITY MODELS
Introduction-views on quality-cost of quality-quality models-Statistics and measurements-Statistics
and measurements-Analysis of given source code using SQALE and Sonar models.
MODULE II-QUALITY FRAMEWORK and TESTING
Quality framework characteristics verification- Measuring test adequacy- overview of black box
testing techniques-decision tables-combinatorial testing- classification tree method- white box testingRandom and exploratory.
MODULE III-SOFTWARE ANALYSIS
Introduction to Static analysis- Static analyzer for finding dynamic programming errors-dataflow
testing procedure to apply data flow testing- examples- performance analysis and verificationSecurity analysis and verification Software vulnerabilities and exploitation.
MODULE IV-QUASAR METHOD
Applying the Design structure matrix to system decomposition and integration problems- achieving
Agility through Architecture visibility-Recovering and verifying architecture through design structure
matrices.
MODULE V-QUALITY MANAGEMENT
Project quality management- Essential Testing-Test driven development guidance for software
verification and validation plans-Master test planning.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
TEXT BOOKS:
1. Edited by Kshirasagar Naik and Priyadarshi Tripathy, Software testing and Quality Assurance:
theory and practice, John wiley & sons Inc, copyright, 2008.
2. Daniel Galin, Software Quality Assurance from Theory to Implementation, Pearson Education
Ltd., 2004.
REFERENCES
1. Quality models to engineering quality requirements published in journal of object technology,
chair of Software engineering, Vol.2, No. 5 Sep. October 2003. Online at http://www.jot.sm.
2. Tyson R. Browning, A review and new directions, Applying the design structure matrix to system
decomposition and integration problems, IEEE transactions on Engineering management, Vol. 48,
No.3, August 2001.
3. Neeraj sangal and frank waldman in the journal of Defense software engineering Dependency
models to manage software Architecutre, Online at www.stsc.hill.af.mil., November 2005.
77
SOFTWARE QUALITY MANAGEMENT

Credit Units: 04
Course Objective:
This course covers the principles of software development emphasizing processes and activities of
quality assurance and Define quality assurance plans , Apply quality assurance tools & techniques,
To learn about standards and certifications.
Course Contents:
MODULE I - INTRODUCTION
Software Quality Chalenge - Software Quality Factors - Components of the Software Quality
Asurance System. Pre-Project Software Quality Components - Contract Review - Development and
Quality Plans
MODULE I I-SQA COMPONENTS IN THE PROJECT LIFE CYCLE
Integrating Quality Activites in the Project Life Cycle Reviews - Software Testing Strategies Software Testing Implementation - Asuring the Quality of Software Maintenance - Asuring The
Quality of External Participants' Parts Case Tols and their Afect on Software Quality.
MODULE III -SOFTWARE QUALITY INFRASTRUCTURE COMPONENTS
Procedures and Work Instructions - Supporting Quality Devices - Staff Training Instructing and
Certification - Preventive and Corrective Actions Configuration Management - Documentation and
Quality Records Controls.
MODULE IV-SOFTWARE QUALITY MANAGEMENT COMPONENTS
Project Progres Control - components of project progres control- Progres control of internal projects
and external participants- Implementation of project progres control. Software Quality Metrics Objectives of Quality measurement- Proces metrics- Product metrics .Software Quality Costs Objectives of cost of software quality metrics- clasic model of cost of software quality.
MODULE V-STANDARDS- CERTIFICATION AND ASESMENT
SQA Standards - ISO 901 Certifcation - Software Proces Asesment.Organizing for Quality Asurance Management and its Role in Quality Asurance - The Software Quality Asurance Unit - SQA Trustes
and Commites
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
1. Daniel Galin - Software Quality Assurance: From Theory to Implementation - Pearson AddisonWesley, 2012.
2. Allen Gilles, Software quality: Theory and management International Thomson - Computer
press, 1997.
REFERENCES
1. Stephen H.Kan - Metrics and models in software quality Engineering - Addison Wesley, 1955.
2. Roger S. Pressman - Software Engineering-A Practitioners Approach - McGraw Hill pub, 2001.
3. Humphrey Watts - Managing the Software process, Addison Wesley, 1986.
78
SOFTWARE MAINTENANCE AND ADMINISTRATION

Credit Units: 03
Course Objective:
To study how to maintain and administrate the software, To study about reverse Engineering,
Configuration management , Software maintenance tools and software administration and
performance
Course Contents:
MODULE IFUNDAMENTALS OF SOFTWARE MAINTENANCE
Meaning of software maintenance, software change, ongoing support, economic implications of
modifying software, the nomenclature and image problem, software maintenance framework,
potential solutions to maintenance problem. Maintenance process models: Definition of critical
appraisal of traditional process models, maintenance process models. Program understanding: Aims of
program comprehension, maintainers and their information needs comprehension process models,
mental models, program comprehension strategies, factors that affect understanding, implications of
comprehension theories and studies.
MODULE II-REVERSE ENGINEERING
Definition, purposes and objectives, levels of reverse Engineering, supports techniques, benefits.
Reuse and reusability: Definitions, objective and benefit of reuse, approach to reuse, domain Analysis,
COMPONENTS engineering, reuse process model, factors that impact upon reuse. Maintenance
measures, Definitions, objectives of software measurement, example measures, guidelines for
selecting maintenance measures.
MODULE III-CONFIGURATION MANAGEMENT
Definition for configuration management, change control, documentation. Management and
organizational issues, Management responsibilities, enhancing maintenance productivity, maintenance
teams, personnel Education and Training, organization modes.
MODULE IV-BUILDING AND SUSTAINING MAINTAINABILITY
Quality Assurance, fourth generation languages, object oriented paradigms. Maintenance tools:
Criteria for selecting tools, taxonomy of tools, program understanding and reverse engineering testing,
configuration management, and other tasks. Past, present and future of software maintenance.
MODULE V-SOFTWARE ADMINISTRATION
Analyzing system logs, operating system updates, patches, and configuration changes, Performing
backups. Installing and configuring new hardware and software. Adding, removing, or updating user
account information, resetting passwords, System performance tuning. Performing routine audits of
systems and software.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
Armstrong A Takang and Penny A.Grubb, Software Maintenance: concepts and Practice,
International Thomson Computer press, London.
REFERENCES
Roger S Pressman, Software Engineering, 6th edition, Tata McGraw-Hill, 2004.
79
ANALYSIS OF SOFTWARE ARTIFACTS LAB

Credit Units: 01
List of Programs:
1 Lab experiments in the following Topics (15 hours)
1. Data Flow Testing and analysis
2. Static Analysis
3. Model Checking Theory
4. Performance and Queuing Theory
5. Design Structure Matrices
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
80
SOFTWARE QUALITY MANAGEMENT LAB (Test link tool)

Credit Units: 01
Course Contents:
Test Link tool
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
81
SOFTWARE MAINTENANCE AND ADMINISTRATION LAB

Credit Units: 01
Lab assignment will be based on the following:

Bugzilla / IBM rational quality manager
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
82
SOFT COMPUTING
Credit Units: 03
Course Objective:
To develop semantic-based and context-aware systems to acquire, organise, process, share and use the
knowledge embedded in multimedia content. Research will aim to maximise automation of the
complete knowledge lifecycle and achieve semantic interoperability between Web resources and
services.
Course Contents:
Module I: Soft Computing
Introduction of soft computing, soft computing vs. hard computing, various types of soft computing
techniques, applications of soft computing.
Module II: Neural Network
Structure and Function of a single neuron: Biological neuron, artificial neuron, definition of ANN,
Taxonomy of neural net, Difference between ANN and human brain, characteristics and applications
of ANN, single layer network, Perceptron training algorithm, Linear separability, Widrow & Hebb;s
learning rule/Delta rule, ADALINE, MADALINE, AI v/s ANN. Introduction of MLP, different
activation functions, Error back propagation algorithm, derivation of BBPA, momentum, limitation,
characteristics and application of EBPA
Module III
Counter propagation network, architecture, functioning & characteristics of counter Propagation
network, Hopfield/ Recurrent network, configuration, stability constraints, associative memory, and
characteristics, limitations and applications. Hopfield v/s Boltzman machine. Adaptive Resonance
Theory: Architecture, classifications, Implementation and training. Associative Memory.
Module IV: Fuzzy Logic
Fuzzy set theory, Fuzzy set versus crisp set, Crisp relation & fuzzy relations, Fuzzy systems: crisp
logic, fuzzy logic, introduction & features of membership functions, Fuzzy rule base system : fuzzy
propositions, formation, decomposition & aggregation of fuzzy rules, fuzzy reasoning, fuzzy
inference systems, fuzzy decision making & Applications of fuzzy logic.
Module V: Genetic algorithm
Fundamentals, basic concepts, working principle, encoding, fitness function, reproduction, Genetic
modeling: Inheritance operator, cross over, inversion & deletion, mutation operator, Bitwise operator,
Generational Cycle, Convergence of GA, Applications & advances in GA, Differences & similarities
between GA & other traditional methods.
Examination Scheme:
Components
Weightage (%)
CT
10
H
8
V/S/Q
7
83
AT
5
EE
70
Text & References:

S, Rajasekaran & G.A. Vijayalakshmi Pai, Neural Networks, Fuzzy Logic & Genetic Algorithms,
Synthesis & Applications, PHI Publication.
S.N. Sivanandam & S.N. Deepa, Principles of Soft Computing, Wiley Publications
Rich E and Knight K, Artificial Intelligence, TMH, New Delhi.
Bose, Neural Network fundamental with Graph , Algo.& Appl, TMH
Kosko: Neural Network & Fuzzy System, PHI Publication
Klir & Yuan, Fuzzy sets & Fuzzy Logic: Theory & Appli.,PHI Pub.
Hagen, Neural Network Design, Cengage Learning
84
MOBILE COMPUTING
Credit Units: 03
Course Objective:
The objective of this consortium is to shape and expand a full-scale and sound mobile computing
system market. To achieve this, cooperation is required of interests related to communication
(network), computer hardware/software, system integrators (including service providers), and the
media.
Course Contents:
Module I: Introduction to Personal Communications Services (PCS)
PCS Architecture, Mobility management, Networks signaling.
Global System for Mobile Communication (GSM) system overview: GSM Architecture, Mobility
management, Network signaling.
Module II: General Packet Radio Services (GPRS) & Wireless Application Protocol (WAP)
GPRS Architecture, GPRS Network Nodes.
Mobile Data Communication: WLANs (Wireless LANs) IEEE 802.11 standard, Mobile IP.
Wireless Application Protocol (WAP): The Mobile Internet standard, WAP Gateway and Protocols,
wireless mark up Languages (WML).
Module III: Third Generation (3G) Mobile Services
Introduction to International Mobile Telecommunications 2000 (IMT 2000) vision, Wideband Code
Division Multiple Access (W-CDMA), and CDMA 2000, Quality of services in 3G.
Wireless Local Loop(WLL): Introduction to WLL Architecture, wireless Local Loop Technologies.
Module IV: Global Mobile Satellite Systems
Global Mobile Satellite Systems; case studies of the IRIDIUM and GLOBALSTAR systems.
Module V: Enterprise Networks
Introduction to Virtual Networks, Blue tooth technology, Blue tooth Protocols. Advanced techniques
in mobile computing.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
Wireless and Mobile Networks Architectures, by Yi-Bing Lin & Imrich Chlamtac, John Wiley
& Sons, 2001.
Mobile and Personal Communication systems and services, by Raj Pandya, Prentice Hall of
India, 2001.
References:
Guide to Designing and Implementing wireless LANs, by Mark Ciampa, Thomson learning,
Vikas Publishing House, 2001.
85
Wireless Web Development, Ray Rischpater, Springer Publishing, 2000.

The Wireless Application Protocol, by Sandeep Singhal, Pearson Education Asia, 2000.
Third Generation Mobile Telecommunication systems, by P.Stavronlakis, Springer Publishers,
2001.
86
SERVICE ORIENTED ARCHITECTURE

Credit Units: 03
Course Objective:
To gain the basic principles of service orientated architecture and To learn service oriented analysis
techniques,underlying the service design , advanced concepts such as service composition,
orchestration and Choreographyand To know about various WS specification standards
Course Contents:
MODULE I-INTRODUCTION
Roots of SOA Characteristics of SOA - Comparing SOA to client-server and distributed internet
architectures Anatomy of SOA- How components in an SOA interrelate -Principles of service
orientation.
MODULE II-WEB SERVICE AND SOA
Web services Service descriptions Messaging with SOAP Message exchange Patterns
Coordination Atomic Transactions Business activities Orchestration Choreography - Service
layer abstraction Application Service Layer Business Service Layer Orchestration Service
Layer.
MODULE III-BUILDING SOA
Service oriented analysis Business-centric SOA Deriving business services- service modeling Service Oriented Design WSDL basics SOAP basics SOA composition guidelines Entitycentric business service design Application service design Task centric business service design.
MODULE IV-SOA Platforms
SOA platform basics SOA support in J2EE Java API for XML-based web services (JAX-WS) Java architecture for XML binding (JAXB) Java API for XML Registries (JAXR) - Java API for
XML based RPC (JAX-RPC)- Web Services Interoperability Technologies (WSIT) - SOA support in
.NET Common Language Runtime - ASP.NET web forms ASP.NET web services Web
Services Enhancements (WSE).
MODULE V-SERVICE ORIENTED DESIGN
WS-BPEL basics WS-Coordination overview - WS-Choreography, WS-Policy, WS Security
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
1. Thomas Erl, Service-Oriented Architecture: Concepts, Technology, and Design, Pearson
Education, 2009.
2. Thomas Erl, SOA Principles of Service Design (The Prentice Hall Service- Oriented Computing
Series from Thomas Erl), 2005.
REFERENCES
1. Newcomer, Lomow, Understanding SOA with Web Services, Pearson Education, 2005.
2. Sandeep Chatterjee, James Webber, Developing Enterprise Web Services, An Architects Guide,
Pearson Education, 2005.
87
GRID COMPUTING
Course Code:
SFE2710
Credit Units: 03
Course Objective:
Grid computing (or the use of a computational grid) is applying the resources of many computers in a
network to a single problem at the same time - usually to a scientific or technical problem that
requires a great number of computer processing cycles or access to large amounts of data. The major
objective of this course is to provide a sound foundation to the students on the concepts, percepts and
practices in a field that is of immense concern to the industry and business.
Course Contents:
Module I: Introduction-Cluster to grid computing
Cluster computing models, Grid models, Mobile grid models, Applications.
Parset: System independent parallel programming on distributed systems: Motivation and
introduction, Semantics of the parset construct, Expressing parallelism through parsets, Implementing
parsets on a loosely coupled distributed system.
Anonymous remote computing model: Introduction, Issues in parallel computing on interconnected
workstations, Existing distributed programming approaches, The arc model of computation, The two
tired arc language constructs, Implementation
Module II: Integrating task parallelism with data parallelism
Introduction and motivation, A model for integrating task parallelism into data parallel programming
platforms, Integration of the model into ARC, Design and implementation applications, performance
analysis, guidelines for composing user programs, related work
Anonymous remote computing and communication model: Introduction, Location in dependent
inter task communication with DP, DP model of iterative grid computations, Design and
implementation of distributed pipes, Case study, and Performance analysis.
Module III: Parallel programming model on CORBA
Introduction, Existing works, notion of concurrency, system support implementation performance,
sitability of CORBA: introspection.
Grid computing model: Introduction, a parallel computing model over grids, Design and
implementation of the model, Performance studies, Related work.
Module IV: Introducing mobility into anonymous remote computing and communication model
Introduction, issues in mobile clusters and parallel computing on mobile clusters, moset overview,
moset computation model, implementation, performance.
Module V: Parallel Simulated Annealing algorithms
Introduction, Simulated annealing (SA) Technique, Clustering algorithm for simulated annealing
(SA), Combination of genetic algorithm and simulated annealing (SA) algorithm
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
Grid Computing a Research Monograph by D. Janakiram, Tata McGraw hill publications, 2005
88
References:
Grid Computing: A Practical Guide to technology and Applications by Ahmar Abbas, Charles
River media 2003.
Grid Computing Joshy Joseph & Craig Fellenstein, Pearson Education
89
Syllabus Eighth Semester

AGILE SOFTWARE PROCESS
Credit Units: 03
Course Objective:
This course impart knowledge to students in the basic concepts of Agile Software Process,
methodology and its development and To understand the basic concepts of Agile Software Process.
Course Contents:
Software is new product development Iterative development Risk-Driven and Client-Driven
iterative planning Time boxed iterative development During the iteration, No changes from
external stakeholders Evolutionary and adaptive development - Evolutionary requirements analysis
Early Top Ten high-level requirements and skilful analysis Evolutionary and adaptive planning
Incremental delivery Evolutionary delivery The most common mistake Specific iterative and
Evolutionary methods.
MODULE IIAGILE AND ITS SIGNIFICANCE
Agile development Classification of methods The agile manifesto and principles Agile project
management Embrace communication and feedback Simple practices and project tools
Empirical Vs defined and prescriptive process Principle-based versus Rule-Based Sustainable
discipline: The human touch Team as a complex adaptive system Agile hype Specific agile
methods. The facts of change on software projects Key motivations for iterative development
Meeting the requirements challenge iteratively Problems with the waterfall. Research evidence
Early historical project evidence Standards-Body evidence Expert and thought leader evidence
A Business case for iterative development The historical accident of waterfall validity.
MODULE IIIAGILE METHODOLOGY
Method overview Lifecycle Work products, Roles and Practices values Common mistakes and
misunderstandings Sample projects Process mixtures Adoption strategies Fact versus fantasy
Strengths versus Other history.
MODULE IVCASE STUDY
Agile Motivation Evidence Scrum Extreme Programming Unified Process Evo Practice
Tips.
MODULE VAGILE PRACTICING AND TESTING
Project management Environment Requirements Test The agile alliances The manifesto
Supporting the values Agile testing Nine principles and six concrete practices for testing on agile
teams
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
90
Text & References:

Craig Larman, Agile and Iterative Development A Managers Guide, Pearson Education 2004.
2. Elisabeth Hendrickson Quality Tree Software Inc, Agile Testing 2008.
REFERENCES
1. Agile Software Development Wikipedia.
2. Alistair Agile Software Development series Cockburn - 2001.
91
WEB PROGRAMMING
Credit Units: 03
Course Objective:
To explain internet Programming concepts and related programming with scripting languages and to
provide practical knowledge in web programming.
Course Contents:
MODULE I - BASIC NETWORK AND WEB CONCEPTS
Internet standards TCP and UDP protocols URLs MIME CGI Introduction to SGML Java
basics I/O streaming files Socket programming client/server programs E-mail client SMTP
- POP3 programs web page retrieval protocol handlers content handlers - applets image
handling - Remote Method Invocation.
MODULE II-SCRIPTING LANGUAGES & SERVER SIDE SCRIPTING
HTML5 introduction Introduction to JavaScript and DOM Event Handler Java script functions
objects simple web applications Talking to the Web Web Storage and Workers - HTTP GET
and POST requests session tracking cookies JDBC simple web applications multi-tier
applications.
MODULE IIIAJAX AND SILVERLIGHT
Introduction to AJAX on ASP.NET DHTML JavaScript and DOM Data Communication: XML,
XSLT, and JSON Introduction to Silver light Silver light User interface control Content
integration in silver light application Network Communication Working with data-Introduction to
Flash working with object editor Publishing flash files.
MODULE IV-CORBA TECHNOLOGIES
Java and CORBA Interface Definition Language Object Request Broker (ORB) System Object
Model Portable Object Adapter CORBA services CORBA component model Containers
Application server Model driven architecture.
MODULE V-COMPONENT FRAMEWORK AND DEVELOPMENT
COM + contexts EJB containers CLR contexts and channels Black box component framework
Directory objects Cross development environment Component Oriented programming
Component design and Implementation tools Testing tools Assembly tools.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
92
Text & References:

Deitel, Deitel and Nieto, Internet and World Wide Web How to program, 4 th Edition,
Pearson Education Publishers, 2009.
Elliotte Rusty Harold, Java Network Programming, OReilly Publishers, 2009.
REFERENCES
Krishnamoorthy R. & Prabhu S, Internet and Java Programming, New Age International
Publishers, 2004.
Eric Freeman, Elisabeth Robson, HTML5 Programming, first edition, OReilly Publishers,
2011.
Ashish Ghoda, Introducing Silverlight 4, APRESS, 2010.
93
WEB PROGRAMMING LAB

Credit Units: 01
LIST OF EXPERIMENTS
1. Create a web page with the following using HTML5
i) To embed an image map in a web page
ii) To fix the hot spots
iii)Show all the related information when the hot spots are clicked.
2. Create a web page with all types of Cascading style sheets.
3. Client Side Scripts for Validating Web Form Controls using DHTML
4. Write programs in Java to create applets
5. Programs using Flash
6. Programs using AJAX
7. Programs using JDBC
8. Programs using XML Schema XSLT/XSL
9. Develop a middleware component for retrieving Weather Forecast information
using CORBA
10. Develop a web service application
Examination Scheme:
IA
EE
A
PR
LR
V
PR
V
5
10
10
5
35
35
94
DOT NET PROGRAMMING

Credit Units: 03
Course Objective:
To create web based applications using ASP.NET.
Course Contents:
Module I: Introduction to .NET technologies
Features of .NET, .NET Framework, CLR, What is ASP.NET? Difference between ASP and
ASP.NET.
Design View, HTML View, Default Files used in ASP.NET. Concept of Master pages, Intrinsic
Objects of ASP.Net, Structure of ASP.NET page, Cascading Style Sheet: Embeded, Inline, External.
Module II: Controls in ASP.NET
Overview of Dynamic Web page, Understanding ASP.NET Controls, Applications, Web servers,
Installation of IIS. Web forms, web form controls -server controls, client controls. Adding controls to
a web form, Buttons, Text Box, Labels, Checkbox, Radio Buttons, List Box. Adding controls at
runtime. Running a web Application, creating a multiform web project. Form Validation: Client side
validation, server Side validation, validation Controls: Required Field Comparison Range.
Calendarcontrol, Ad rotator Control, Internet Explorer Control.
Module III: Overview of ADO.NET and XML
What is ADO.NET, from ADO to ADO.NET. ADO.NET architecture, Accessing Data using Data
Adapters and Datasets, using Command & Data Reader, binding data to data bind Controls,
displaying data in data grid, XML basics, attributes, fundamental XML classes: Document, text
writer, text reader. XML validations, XML in ADO.NET, The XML Data Document, Data Binding
and its yypes.
Module IV: ASP.NET Applications
Creating, tracking, caching, error handling, Securing ASP.NET applications- form based applications,
window based application.
Module V: Web services
Introduction, State management- View state, Session state, Application state, Building ASP.NET web
services, working with ASP.NET applications, creating custom controls, Invoking COM/COM+,
Activ X Components
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
ASP.NET Unleashed by Stephen Walther, SAMS publications
References:
ASP.NET, Wrox Publications
ASP.NET and VB.NET, Wrox Publication
ASP.NET and C#.NET, Wrox publication.
95
DOT NET PROGRAMMING LAB

Credit Units: 01
Course Contents:
Use of Controls in creating web pages
Creating sessions
Creating Custom controls
Implementing security
Examination Scheme:
IA
A
5
PR
10
EE
LR
10
V
5
PR
35
V
35
96
SIMULATION & MODELING

Credit Units: 04
Course Objective:
The goal is to introduce students to basic simulation methods and tools for modelling and simulation
of continuous, discrete and combined systems. The objective is to impart knowledge of simulation
principles. The ability to create simulation models of various types.
Course Contents:
Module I :Linear Programming
Linear Programming: Formulation, Graphical solution, standard and matrix form of linear
programming problems, Simplex method and its Algorithm, Two-phase Simplex method.
Module II: Integer Programming
Integer Programming: Importance, Need and importance of Integer Programming, Gomorys All
Integer Programming Problem technique and its algorithm.
Module III:Modeling & Simulation Concepts and Random Numbers
Modeling & Simulation Concepts: System Concepts, What is a Model?, Type of Models, Modeling
& Simulation, Continuous vs. Discrete System Simulation, Numerical Integration vs. Continuous
Simulation, Analog vs. Digital Simulation, Simulation vs. Monte- Carlo Simulation, Nature of
Computer Modeling and Simulation, When to Use Simulation?, Limitations of Simulation,
Validation, and Simulation Languages.
Random Numbers: Pseudo-random generators, Testing of Pseudo-random number generators,
Generation of non-uniformly distributed random numbers.
Module IV: Simulation Experiments and Design of Application Simulators
Simulation Experiments: Run length of Static and Dynamic Stochastic Simulation Experiments,
Minimizing variability in simulators without increasing Number of simulation Runs.
Module V: Design of Application Simulators Design of Application Simulators for Multi-server
Queuing System, PERT, Optimizing Inventory Policy and Cost in Business environment.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Sharma, S.D., Operations Research, Kedar Nath and Ram Nath, Meerut.
Nar Singh Deo, System Simulation with Digital computer, PHI, New Delhi.
Taha, H.A., Operation Research An Introduction, McMillan Publishing Co, New York.
Gupta P.K., Hira and D.S., Operation Research, Sultan Chand & Sons, New Delhi.
Kanti Swarup, Gupta P.K. & Man Mohan, Operation Research, Sultan Chand & sons, New
Delhi.
Rao S.S., Optimization Theory and Applications, Wiley Eastern Ltd. New Delhi.
Gordon G., System Simulation, PHI, New Delhi.
Payne James A. , Introduction to Simulation : Programming Techniques and Methods of
Analysis, McGraw Hill International Editions, Computer Science services, New York.
Jerry Banks, John S Carson II, Barry L Nelson and David M Nicol, Discrete Event Simulation,
Pearson Education Asia, New Delhi.
Francis Neelamkavil, Computer Modeling and Simulation, John Wiley & Sons, New York.
97
DISTRIBUTED OPERATING SYSTEM

Credit Units: 04
Course Objective:
This Subject provides students with an in-depth knowledge about the operating system. The former
treats the standard principles of single processor system, including processes, synchronization, I/O ,
deadlocks, Memory Management, File Management systems, security and so on. This subject covers
distributed operating system in detail, including communication process, file system and memory
management synchronization and so on but this time in the context of distributed systems
Course Contents:
Modes of communication in O.S., System Process, Interrupt Handling, Handlinf Systems calls,
Protection of resources &Resources Management. Micro-Kernal Operating System.
Module II: Client Server Model
Introduction to Network Operating System and Distributed Operating System, Issue in the design of
Distributed Operating System, Overview of Computer Networks.
Inter process communication, Linux, IPC Mechanism, Remote Procedure calls, RPC exception
handling, security issues, RPC in Heterogeneous Environment (case study Linux RPC)
Module III: Synchronization in Distributed System
Clock Synchronization: Logical clocks, Physical clocks, clock synchronization algorithms, Mutual
Exclusion, Election Algorithms, Deadlocks in Distributed Systems. Thrashing, Heterogeneous DSM,
Resource Management(Load Balancing approach, Load Sharing approach ), Process Management:
process Migration, Thread.
Module IV: Distributed Shared Memory
Introduction to shared memory, consistency model, Page based Distributed Shared Memory, Shared
variable Distributed Memory, Object -based Distributed Memory.
Module V: Distributed File System
File models, File access, File sharing, file-caching, File Replication, fault Tolerance, Network File
System, (case study, 8NFS on Linux Directory Services, Security in Distributed File system.
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
M. Beck et al Linux Kernal, Internal Addition Wesley, 1997.
B. W. Kernighan and R Pide, The Unix Programming Environment Prentice Hall of India - 2000.
A. Silberschatz P.B Galvin Operating System Concept, John Wiley & Sons (Asia) 2000.
Cox K, Red Hat Linux Administrators Guide. PHI (200).
98
E- COMMERCE AND ERP

Credit Units: 04
Course Objective:
This course examines the evolution of enterprise resource planning (ERP) systems - from internally
focused client/server systems to externally focused e-business. This class studies the types of issues
that managers will need to consider in implementing cross-functional integrated ERP systems. The
objective of this course is to make students aware of the potential and limitations of ERP systems.
This objective will be reached through hands-on experience, case studies, lectures, guest speakers and
a group project. The course would equip students with the basics of E-Commerce, technologies
involved with it and various issues associated with.
Course Contents:
Module I: Introduction and Concepts
Networks and commercial transactions - Internet and other novelties; Networks and electronic
transactions today, Model for commercial transactions; Internet environment - internet advantage,
world wide web and other internet sales venues; Online commerce solutions.
Security Technologies: Why is internet insecure? A brief introduction to Cryptography; Public key
solution. Digital payment systems; First virtual internet payment system; cyber cash model
Operational process of Digicash, Ecash Trail; Using Ecash; Smart cards; Electronic Data Interchange:
Its basics; EDI versus Internet and EDI over Internet.
Module II: Introduction ERP
An Overview, Enterprise-An Overview, Benefits of ERP, ERP and Related Technologies, Business
Process Reengineering (BPR), Data Warehousing, Data Mining, On-line Analytical Processing
(OLAP), Supply Chain Management, Management Information systems (MIS), Decision support
system (DSS), Executive Information systems (EIS). ERP A Manufacturing Perspective Materials
Requirement Planning (MRP), Bill of Material (Bom), Distribution Requirements Planning (DRP),
JIT & Kanban, CAD/CAM, Product Data Management (PDM), Benefits of PDM, MTO, MTS, ATO,
ETO, CTO.
Module III: ERP Implementation
To be or not to be, ERP Implementation Lifecycle, Implementation Methodology, Not all Packages
are Created Equal!, ERP Implementation-The Hidden Costs, Organizing the Implementation,
Vendors, Consultants and Users, Contracts with Vendors, Consultants and Employees, Project
Management and Monitoring, After ERP Implementation.
Module IV: The Business Modules
Business Modules in an ERP Package, Finance, Manufacturing (Production), Human Resources, Plant
Maintenance, Materials Management, Quality Management, Sales and Distribution
Module V: The ERP Market
ERP Market Place, SAP AG, PeopleSoft, Baan Company, JD Edwards World Solutions Company,
Oracle Corporation, QAD, System Software Associates, Inc. (SSA)
ERP-Present and Future
Turbo Charge the ERP System, Enterprise Integration Applications (EIA), ERP and E-Commerce,
ERP and Internet, Future Directions in ERP, Appendices"
Module VI: Benefits of ERP
Time Reduction, Resource Utilization, Performance, Customer Satisfaction, Flexibility, Quality,
Accuracy.
99
Examination Scheme:
Components
A
CT
S/V/Q
HA
EE
5
10
8
7
70
Weightage (%)
Att: Attendance
Text & References:
Text:
S. Sadagopan, Enterprise Resource Planning, Tata McGraw Hill 2000
Bajaj, Kamlesh K. and Nag, Debjani, E-Commerce: The Cutting Edge of Business, Tata
McGraw-Hill Publishing Company
References:
Alexis Leon, Enterprise Resource Planning, Tata McGraw Hill 2001
Loshin, Pete and Murphy, Paul, Electronic Commerce, Second edition, 1990, Jaico Publishing
House, Mumbai.
100

B.Tech - Software Engg. (Syllabus) 2015 PDF

Încărcat de

Informații document

Descriere originală:

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

B.Tech - Software Engg. (Syllabus) 2015 PDF

Încărcat de

Drepturi de autor:

Formate disponibile

Amity School of Engineering & Technology

Bachelor of Technology Software Engineering

AMITY UNIVERSITY HARYANA

B.Tech. Software Engineering (Total Credits 210)

Basic Sciences Courses

Basic Sciences Courses

Engineering Sciences Courses

Engineering Sciences Courses

Engineering Sciences Courses

Summer Internship-II (6-8 weeks)

Engineering Sciences Courses

Engineering Sciences Courses

Engineering Sciences Courses

Syllabus First Semester

APPLIED PHYSICS - I - FIELDS AND WAVES

INTRODUCTION TO COMPUTERS AND PROGRAMMING IN C

Text & References:

APPLIED PHYSICS I LAB

To determine the wavelength of sodium light by Newtons rings method.

To determine the speed of ultrasonic waves in liquid by diffraction method.

To determine the width of a narrow slit using diffraction phenomena.

To determine the temperature coefficient of platinum wire, using a platinum resistance

To determine the value of specific charge (ratio of e/m) of an electron by Thomson

Software Required: Turbo C

ELECTRICAL SCIENCE LAB

ENGINEERING MECHANICS LAB

To verify the law of Force Polygon

Syllabus Second Semester

Text & References:

APPLIED PHYSICS - II - MODERN PHYSICS

Text & References:

OBJECT ORIENTED PROGRAMMING USING C++

Text & References:

ELEMENTS OF MECHANICAL ENGINEERING

APPLIED PHYSICS II LAB

To determine the wavelength of sodium light by Newtons rings method.

To determine the speed of ultrasonic waves in liquid by diffraction method.

To determine the width of a narrow slit using diffraction phenomena.

To determine the temperature coefficient of platinum wire, using a platinum resistance

To determine the value of specific charge (ratio of e/m) of an electron by Thomson

APPLIED CHEMISTRY LAB

OBJECT ORIENTED PROGRAMMING USING C++ LAB

Software Required: Turbo C++

ELEMENTS OF MECHANICAL ENGINEERING - LAB

ENGINEERING GRAPHICS LAB

Syllabus Third Semester

DATABASE MANAGEMENT SYSTEMS

Text & References:

DATA STRUCTURES USING C

DATA STRUCTURES USING C LAB

Software Required: Turbo C++

DATA COMMUNICATION AND COMPUTER NETWORKS LAB

DATABASE MANAGEMENT SYSTEMS LAB

Software Required: Oracle 9i

UNIX PROGRAMMING LAB

Software Required: UNIX SCO

Syllabus Fourth Semester

DIGITAL ELECTRONICS LAB

COMPUTER GRAPHICS LAB

Software Required: Turbo C++

ANALOG ELECTRONICS LAB I

ARTIFICIAL NEURAL NETWORKS