01 B.Tech CSE Syllabus Final

B. Tech.
Computer Science and Engineering

Course Structure:
Semester I
Code
Course Title
Credits
Mathematics-I
Physics-I
Electronics-I
Computer Programming in C Language
English
Computer Programming Language Lab.
Electronics Lab - I
Total Credit: 23
Semester II
Code
Course Title
Credits
Mathematics-II
Physics-II
Electronics-II
Computer Organization and Architecture
Physics Lab
Electronics Lab II
IT Workshop
Total Credit: 23
Semester III
Code
Course Title
Credits
Mathematics-III
Data and File Structure
Object Oriented Programming
Digital Circuit and System
HSS Elective I
Data structure Lab
Object Oriented Programming Lab
Total Credit: 23
Semester IV
Code
Course Title
Credits
Linear Algebra and Graph Theory

Algorithms
Operating System
Database Management System
Principles of Communication
DBMS Lab
Microprocessor Lab
4
4
4
4
4
2
2
Total Credit:
24
Semester V
Code
Course Title
Theory of Computation
Credits
4
Computer Networks and DP

Program Elective I
Open Elective I
HSS Elective II
Computer Networks Lab.
Digital Signal Processing Lab.
4
4
4
3
2
2
Total Credit:
23
Semester VI
Code
Course Title
Credits
Optimization Technique
Artificial Intelligence
Program Elective II
Program Elective III
Open Elective II
Core Lab I
Core lab II
4
4
4
4
4
2
2
Total Credit:
24
Semester VII
Code
Course Title
Credits
Compiler Design
Computer Graphics
Program Elective IV
Program Elective V
HSS Elective III
Minor Project
4
4
4
4
3
4
Total Credit:
23
Semester VIII
Code
Course Title
Credits
Program Elective VI
Program Elective VII
HSS Elective IV
Project
4
4
3
8
Total Credit:
19
Code
Course Title
LIST OF ELECTIVES (Open Electives)
Machine Learning
Digital Image Processing
Digital Signal Processing
Mobile Computing
Storage Area Network
Advance Database Concepts
Embedded Systems
Advance Operating System
Advance Computer Architecture
Wireless Communication
Information Theory and Coding
Wireless Sensor Networks
LIST OF ELECTIVES (Program Electives)

Data Mining and Data Warehousing
Soft Computing
Simulation and Modeling
Parallel Computing
Pattern Recognition
Computer and Information Security
Information System Design
Principles of Programming Languages
Information Retrieval and Web Search
LIST OF ELECTIVES (HSS Electives)

Environment and Ecology
Introduction to Logic
Life and Psychology
Organization Behavior
Engineering Economics
Entrepreneurial Management
LIST OF ELECTIVES (Industrial Electives)

Business intelligencedata warehousing and analytics
Data Mining and Business Analytics
SEMESTER - I
MATHEMATICS-I (CODE: )
Pre Requisites:None
L-P-T:Cr.
4-0-0:4
Objecti
ve:
UNIT I:SEQUENCES-SERIES(Hours)
Basic definitions of Sequences and series Convergence and divergence Ratio test
Comparison test Integral test- Cauchys root test- Raabes test Absolute and Conditional
Convergence.
UNIT II:FUNCTIONS AND APPLICATION OF SINGLE
VARIABLE( Hours)
Rolles Theorem Lagranges Mean Value Theorem Cauchys mean value TheoremGeneralized Mean value theorem ( all theorems with proof) Functions of several variables
Functional dependence - Jacobian Maxima and Minima of functions of two variables with
constraints and without constraints. Radius, center and Circle of Curvature - Evolutes and
Envelops - Curve tracing Cartesian, polar and parametric curves.
UNIT III:INTEGRATION & ITS APPLICATIONS, NUMERICAL
TECHNIQUES( Hours)
Riemann Sums, Integral Representation for lengths, Areas, Volumes and Surface area in
Cartesian and polar co ordinates. Multiple integrals double and triple integrals change of
order of integration change of variable. Interpolation, Numerical Integration, Approximation
of roots.
UNIT IV:VECTOR CALCULUS( Hours)
Vector calculus: Gradient Divergence Curl and their related properties Potential function
Laplacian and second order operators. Line integral - - work done Surface integrals Flux of
a vector valued Function. Vector integrals theorems : Greens stockes and Gausss
Divergence Theorems ( Statement and their Verifications).
TEXT BOOKS:
1. Advance Engineering Mathematics by Jain and S.R.K. Iyengar, Narosa Publications.
REFERENCE BOOKS:
1. Advanced Engineering Mathematics, EriwinKreyszigs 8th Edition. Wiley Indian
Publisher.
2. Higher Engineering Mathematics by B.V. Ramana(Tata McGraw-Hill)
3. Higher Engineering Mathematics - B.S. Grewal, Khanna Publications.
PHYSICS-I (CODE: )
Pre Requisites:Basic Physics and Mathematics
Objecti
ve:
L-P-T:Cr. 3-0-1:4
This course provides basic information about measuring
systems, physical behavior of waves, electromagnetism which
are foundation of Information Technology.
UNIT I:MEASUREMENTS AND ERRORS, SPECIAL THEORY OF

RELATIVITY(12 Hours)
Measurand, precision, accuracy, certainty, resolution, types and sources of errors (definitions
and examples), systematic error, random error, Ambiguity error, dynamic error, drift, noise,
elements of statistics including precision and variance, specifications including measurand,
utility of measurand.
Galilean transformation equations, concept of ether, Michelson-Morley Experiment, Einstein's
postulates, Lorentz transformation equations, length contraction, time dilation, simultaneity in
relativity, addition of velocity, variation of mass with velocity, mass- energy relation, energymomentum relation.
UNIT II: WAVES AND VIBRATIONS AND ULTRASONIC WAVES (12 Hours)
Simple harmonic motion (SHM), superposition of two linear SHM's (with same frequency)
Lissajous' figures, damped vibrations (differential equation and its solution), critical damping,
forced vibration, amplitude and velocity resonance, sharpness of resonance and quality factor.
Production of ultrasonic waves by piezo-electric effect and magnetostriction, Detection and
engineering applications of ultrasonic waves (Non-destructive testing, cavitation, measurement
of gauge).
UNIT III: WAVE OPTICS (10 Hours)
Interference, intensity distributions in interference, Fringe position and fringe width, thin film
interference (uniform thickness), Newton's ring, Fraunhoffer Diffraction (single slit and
grating), Polarization, double refraction, wave plates, Production of plane, elliptical and
circular polarized light, Optical rotation, Polarizer.
UNIT IV: ELECTRICITY AND MAGNETISM (10Hours)
Coloumbs law, electric field and potential due to continuous charge distribution, Gausss law
of electrostatics and its application, Faradays law, dipole, polar and non-polar molecules,
Polarization vector, polarizability, dielectrics and dielectric constant, electric susceptibility,
Lorentz local field, Claussius-Mossotti equation.
Lorentz force, Biot-Savart law and its application, Amperes law and its applications,
Divergence and Curl of magnetic field.
TOTAL: 44 Hours
TEXT BOOKS
1. M.R. Bottaccini, C.E. Merill, Instruments and measurements
2. R. Murughessan, Modern Physics
3. Subramanyam&BrijLal, optics
4. Subramanyam&BrijLal, R.N. Choudhary, waves & vibrations
5. K.K. Tiwari, Electricity & Magnetism
ELECTRONICS-I (CODE: )
(BASIC ELECTRONICS)
Pre Requisites:None
L-P-T:Cr.
4-0-0:4
Objecti
ve:
UNIT I: INTRODUCTION TO ELECTRONICS (10 Hours)
Electronic devices and their applications , signals, analog & digital signals, amplifiers. Linear
wave shaping circuits: RC LPF, Integrator, RC HPF, Differentiator. Properties of
semiconductor classification of solid, energy band in si, intrinsic & extrinsic semiconductors,
current flow in semiconductors, Hall effect, diffusion current, drift current, mobility &
resistivity.
UNIT II: SEMICONDUCTOR DIODES ( 10 Hours)
p-n junction theory, VI characteristics, load line analysis, equivalent circuit of diode, analysis
of diode circuit, transition capacitance & diffusion capacitance. Application of diode circuit ;
Rectifiers, clippers, clampers. Filter circuits, Special purpose diodes : zener diode, LED, Photo
diode, tunnel diode, varactor diode, Shockley diode. Basics of LASER.
UNIT III: BJTs AND FETs (10 Hours)
BJT : structure & operation , different transistor configurations & their characteristics, DC
analysis of BJT, quiescent point and load line analysis, transistor as a switch, single stage and
multistage transistor amplifiers, BJT RC coupled amplifier. Field effect transistors (FETs) :
Types, structure & operation of JFET and MOSFET, Depletion mode & enhancement mode
MOSFET, FET as an amplifier. JFET characteristics and applications
UNIT IV : FEEDBACK AMPLIFIERS & OSCILLATORS (10 Hours)
General principles of feedback amplifier, topologies, properties of negative feedback.
Oscillators : principles of oscillations, Bark hausen criteria for oscillation, types of oscillator
circuits and their operations. Operational amplifiers (OP-AMPs) : Ideal op-amp, inverting &
non inverting amplifier, adder, integrator & differentiator. Device technology : IC fabrication
process, oxidation, diffusion, ion implantation, photo lithography. Introduction to power
amplifiers : classifications, class A, class B, class C power amplifiers. Conversion efficiency of
series fed class A power amplifier, class B push pull power amplifier.
TEXT BOOKS:
1. Electronic Devices & Circuit Theory, R.L Boylestad and L. Nashelsky, Pearson Education
2. Electronics Fundamentals and Applications, D Chattopadhyay and P. C Rakshit, New Age
International Publications.
REFERENCE BOOKS:
1. Integrated Electronics, Millman and Halkias, Mc. Graw Hill Publications.
2. Electronics Devices and Circuits, Sanjeev Gupta, DhanpatRai, Publications.
3. Digital Logic and Computer Design, Morris Mano, PHI, EEE
COMPUTER PROGRAMMING IN C LANGUAGE (CODE: CS

401 )
Pre Requisites:None
L-P-T:Cr.
3-0-1: 4
Objecti
ve:
UNIT I:
COMPUTER FUNDAMENTALS AND INTRODUCTION TO C
(10 Hours)
Computer Fundamentals, Structure of C program, A Simple C program, identifiers, basic data
types and sizes, Constants, variables, arithmetic, relational and logical operators, increment and
decrement operators, conditional operator, bit-wise operators, assignment operators,
expressions, type conversions, conditional expressions, precedence and order of evaluation.
Input-output statements, statements and blocks, if and switch statements, loops- while, dowhile and for statements, break, continue, C program examples.
UNIT II: ARRAYS AND POINTERS
(11Hours)
Arrays- concepts, declaration, definition, accessing elements, storing elements, arrays and
functions, two-dimensional and multi-dimensional arrays, applications of arrays. pointersconcepts, initialization of pointer variables, pointers and function arguments, address
arithmetic, Character pointers and functions, pointers to pointers, pointers and
multidimensional arrays, dynamic memory managements functions, command line arguments,
C program examples.
UNIT III: FUNCTIONS AND DERIVED DATA TYPES
(11 Hours)
Designing structured programs, Functions, basics, parameter passing, storage classes- extern,
auto, register, static, scope rules, block structure, user defined functions, standard library
functions, recursive functions, header files, C preprocessor, example C programs.
Derived types- structures- declaration, definition and initialization of structures, accessing
structures, nested structures, arrays of structures, structures and functions, pointers to
structures, self referential structures, unions, typedef, bitfields, C program examples.
UNIT IV: FILE, SEARCHING AND SORTING
(11 Hours)
Input and output - concept of a file, text files and binary files, streams, standard I/o, Formatted
I/o, file I/o operations, error handling, C program examples.
Searching - Linear and binary search methods, sorting - Bubble sort, selection sort, Insertion
sort.
TOTAL: 43 CLASSES
TEXT BOOKS
1. E. Balaguruswami, The C Programming Language, TMH.
2. P.K. Sinha, Computer Fundamentals.
REFERENCE BOOKS:
3. B.W. Kernighan, Dennis M.Ritchie, The C Programming Language,
PHI/Pearson Education
ENGLISH (CODE: )
Pre Requisites:None
L-P-T:Cr.
3
3-0-0:3
Objecti
ve:
UNIT I:( Hours)
Features of Indian English Correction of sentences- Structures-Tenses-ambiguity-Idiomatic
distortions.
Informal conversation Vs Formal expression Verbal and non-verbal communication, barriers to
effective communicationkinesics
UNIT II:( Hours)
Types of Communication - Oral, aural, Writing and reading - Word-Power -Vocabulary-Jargonrate of speech, pitch, tone - Clarity of voice Technical presentations-types of presentation
video conferencing--participation in
meetings- chairing sessions.
UNIT III:( Hours)
Formal and informal interviewsambiance and polemics-interviewing indifferent settings and
for different purposes e.g., eliciting and giving information, recruiting, performance appraisal.
Written communication - differences between spoken and written communication features of
effective writing such as clarity, brevity, appropriate tone clarity, balance etc.-GRE.TOEFL
models.
UNIT IV:( Hours)
Letter-writing-business letters proforma culture format style effectiveness, promptnessAnalysis of sample letters collected from industry-email, fax.
TechnicalReportwriting-BusinessandTechnicalReportsTypesofreports-progressreports, outline
reports Annual reports format analysis of sample reports from industry -Synopsis and
thesis writing
TEXT OR REFERENCE BOOKS:
1. Essentials of Business Communication, Rajendra Pal, J S KorlahaHi : Sultan Chand
& Sons, New Delhi.
2. Basic Communication Skills for Technology, Andrea J. Rutherford : Pearson
Education Asia.
3. Advanced Communication Skills, V. Prasad, Atma Ram Publications, New Delhi.
4. Raymond V. Lesikav; John D. Pettit Jr., Business Communication, Theory& Application, All
India Traveler Bookseller.
5. Business Communication, RK Madhukar, Vikas Publishing House Pvt Ltd
6. Edmond H Weiss: Writing Remedies: Practical Exercises for Technical Writing, Universities
Press, Hyderabad.
7. Cliffs Test Preparation for GRE and TOEFL: Computer Based Test, IDG Books. India(P) Ltd..
8. GRE and TOEFL; Kaplan and Baron's English in Mind, Herbert Puchta and Jeff Stranks,
Cambridge.
COMPUTER PROGRAMMING LANGUAGE LAB.(CODE: )

Pre Requisites:Programming in C, Basic knowledge about Linux OS, few commands
related to compilation and running of C-programs in Linux environment.
L-P-T:Cr. 0-0-0:2
2
Objecti To make the student learn C programming language, to teach the student to write
programs to solve the problems using concepts of C-programming language. Also to
ve:
learn the use of different library function supported by C-compilers.
Recommended Systems/Software Requirements:

Intel based desktop PC with Linux OS, GNU C Compiler.
Instruction to Instructors:
At the beginning of the session instructors should give a brief idea about the working platform
(both OS and compilers). During different Lab. session he/she should introduce different
required in-built library functions.
List of topics for writing C-programs:
1. Print statements, variables and simple arithmetic operations, mathematical seriesetc.
2. Conditional statements (if, ifelse, ifelse ifelse, switch case statement)
3. Loops : (while(){}, do{}while(), for(,,){}). Some other experiments
related to like printing a pattern on the screenetc.
4. Arrays : One dimensional, multi directional.
5. Strings
6. Pointers
7. User defined Functions
8. Structures and Unions
9. Files : Various operations on Text, Binary Files
10. Command Line Arguments
11. Sorting and Searching algorithms : Basic searching and sorting techniques on linear
array.
The above Lab. exercises to be carried out in 60 Hours (20 Lab. Classes).
ELECTRONICS LAB I (CODE: )

Pre Requisites:
L-P-T:Cr.
Objecti
ve:
0-6-0:2
List of Experiments:
1. Functional Study of Cathode Ray Oscilloscope, Function Generator and Power
supplies.
2. Functional Study of resistors, capacitors, transistors. Digital Multi-meter, Diodes, FET,
LED, Breadboard.
3. Measurement of resistances of different resistors using Digital Multi-meter and
comparison with the theoretical value using Color Code.
4. Functional Study of Series and Parallel connections on breadboard using resistors,
capacitors
and LEDs.
5. Measurement of amplitude, frequency and time period of a signal using analog CRO.
Verifythe values from theoretical value and calculate the percentage error.
6. P-N Diode
a. To plot Volt-Ampere Characteristics of silicon P-N Diode
b. Find Cut in voltage.
c. Calculate static and dynamic resistances
7. Zener Diode
a. To plot Volt-ampere characteristics of Zener Diode.
b. To find Zener breakdown voltage .
8. Plot input and output characteristics of a BJT in Common Emitter configuration.
9. Plot input and output characteristics of a BJT in Common Base configuration.
10. Plot input and output characteristics of a BJT in Common Collector configuration.
11. Plot the Drain Characteristics of a FET.
12. Plot the Transfer Characteristic of a FET.
13. Study the BJT Amplifier in Common Emitter Configuration. Measure Voltage gain and
plotgain v/s frequency response. Calculate its Bandwidth.
14. Study the following Oscillators and Compute the oscillator frequency.-Hartley, Colpitts,
RCPhase Shift.
Consists of 14 labs exercises to be carried out in 60 Hours (20 Lab.Classes).
SEMESTER - II
MATHEMATICS-II (CODE: )
Pre Requisites:None
L-P-T:Cr.
4
4-0-0:4
Objecti
ve:
UNIT I: 1ST ORDER DEs AND HIGHER ORDER LINEAR DEs( Hours)
Overview of Differential equations - homogeneous, exact, linear and Bernoulli.Applicationto
Newton's Law of cooling.Law of natural growth and decay.Orthogonal trajectories
andGeometrical Applications.Linear differential equation of second order and higher order
withconstant coefficients. RHS term of the type f(x) = e ax, sinax, cosax,eaxV(x), XnV(x),
methodof variation of parameters. Applications to bending of beams, Electrical circuits,
Simpleharmonic motion.
UNIT II: LAPLACE TRANSFORM AND APPLICATION TO ODE( Hours)
Laplace transform of standard functions - Inverse transform - first Shifting Theorem,
Transforms of derivatives and integrals - Unit step function - Second Shifting theorem -Dirac's
delta function - Convolution theorem - Periodic function - Differentiation and integration of
transforms- Application of Laplace transforms to ordinary differential equations.
UNIT III:DIFFERENCE EQUATION & Z TRANSFORM( Hours)
Introduction to difference equation and its applications in Engineering. Z - Transform -inverse
Z -transform - properties - Damping rule - Shifting rule (left, right) IntitalandFinal value
theorems. Convolution theorem - solution of difference equation by z transforms
UNIT IV:FOURIER SERIES AND FOURIER TRANSFORM( Hours)
Fourier Series: determination of Fourier coefficients Fourier series - even an oddfunctions.
Fourier integral theorem (only statement) - Fourier sine and cosine integrals.Fourier transform
- Fourier sine and cosine transforms - properties - inverse transform -Finite Fourier transforms.
TEXT BOOKS:
1. Advance Engineering Mathematics by jainandS.R.K. Iyengar, Narosa Publications.
REFERENCE BOOKS:
1. Advanced Engineering Mathematics, EriwinKrcyszig's, Wiley Indian Publisher.
2. Higher Engineering Mathematics by B.V. Ramana (Tata McGraw-Hill)
PHYSICS-II (CODE: )
Pre Requisites:None
Objecti
ve:
L-P-T:Cr. 4-0-0:4
4
This course provides basic information about mechanics
involved in higher Physics, Lesser and Optical Fiber which are
foundation of Information Technology.
UNIT I:VECTOR CALCULUS & ELECTROMAGNETIC FIELD THEORY(10

Hours)
Del operator, gradient of a scalar field, divergence and curl of a vector fields, significance of
gradient, divergence and curl, line integral, surface integral, volume integral, Gauss divergence
and Stokes theorems.
Integral and differential forms of Gausss laws for electrostatics and magnetostatics, Faradays
law of electromagnetic inductions, Amperes circuital law, equation of continuity, modified
Amperes law (Maxwell-Amperes law), concept of displacement current, Maxwells equations
(general form and in charge free space), Electromagnetic wave in charge free space and its
solutions, wave impedance.
UNIT II: QUANTUM MECHANICS (10Hours)
Plancks hypothesis, de Broglie matter waves, derivation of wavelength of matter wave in
different forms, Heisenberg's uncertainty principle and its applications, Phase velocity and
group velocity, Schrdinger wave equation (time independent and dependent) and its
applications (particle in one dimensional box, tunneling effect etc.), Born's interpretation of
wave equation, normalization of wave equation.
UNIT III:THERMODYNAMICS AND STATISTICAL MECHANICS(12
Hours)
Thermodynamic systems, work done, several processes, laws of thermodynamics, concept of
temperature, entropy, reversible and irreversible process, thermodynamic potentials and
Maxwell relations, latent heat equation.
Macro and microstates, phase space, Maxwell-Boltzmann distribution, Bose-Einstein and
Fermi-Dirac distributions, Partition function, statistical entropy and temperature, relation
between thermodynamics and statistical parameters.
UNIT IV: LASER AND FIBER OPTICS (14 Hours)
Absorption, spontaneous and stimulated emission of light, Einstein A and B coefficients,
pumping, metastable state, population inversion, resonant cavity, lasing action, three and four
level lasers, types of lasers (Ruby, He-Ne, Nd-YAG, semiconductor), properties and
applications of laser.
Introduction, total internal reflection, numerical aperture and various fiber parameters, step
index and graded index fibers, mode of propagation, single mode and multimode fibers,
application and losses of optical fiber.
TOTAL: 46 Hours
TEXT BOOKS:
1.
2.
3.
4.
D.J. Griffith, Mathew N O Sadiku, Principles of electromagnetic

K.R. Nambier, B.B. Laud, Laser and non-linear optics
D.J. Griffith, SatyaPrakash, Quantum Mechanics
S.K. Roy, Thermal Physics & Statistical Mechanics
ELECTRONICS-II (CODE: )
Pre Requisites:None
L-P-T:Cr.
3-0-1:4
Objecti
ve:
UNITI: DC ANALYSIS OF BJT (12 Hours)
DC Analysis of BJT : Load line, Operating Point; Bias configurations: Fixed bias, Emitter
stabilized bias, Voltage divider bias. DC bias with voltage feedback, bias stabilization.
DC biasing of FET : DCload line analysis, Static characteristics of JFET & MOSFET, Transfer
characteristics of JFET & MOSFET. Bias configurations: Fixed bias, Self bias,& Voltage
divider bias. JFET applications.
UNIT II: SMALL SIGNAL ANALYSIS OF BJT AND JFET (8 Hours)
Small signal modeling and analysis of BJT : The transistor re model, hybrid model, low
frequency small signal analysis of CE, CB, CC configurations without feedback. CE fixed bias
configuration, CE Emitter stabilized configuration with bypassed RE and un bypassed RE. CE
voltage divider bias with bypassed RE and un bypassed RE. Emitter Follower configuration
(CC), CB configuration.
Small signal modeling and analysis of JFET : C-S &C-D configuration.
UNIT III: SYSTEM APPROACH AND COMPOUND CONFIGURATIONS
(12 Hours)
System approach (Effects of RS and RL) :Two port system, individual and combined effects
of RS and RL on CE, analysis of amplifiers using two port approach with RS and RL, CE fixed
bias with RS and RL , CE Emitter stabilized bias with effect of RS and RL, Voltage divider
bias using RS and RL. BJT frequency response : General frequency considerations, low
frequency analysis of RC combinations in single stage BJT, low frequency response of BJT
amplifier, high frequency modeling & high frequency analysis of BJT, Miller effect
capacitance.
Compound configurations :cascade, cascode, and darlington connection, CMOS circuit, BJT
constant current source, current mirror circuit.
UNIT IV: MULTIVIBRATORS AND VOLTAGE REGULATOR CIRCUITS
(12 Hours)
Multivibrator: classification, IC 555 timer, 555 timer as multivibrator. Voltage regulator
circuits : introduction to voltage regulators, types of voltage regulator, zener as a voltage
regulator, transistor shunt voltage regulator, three terminal IC voltage regulator, three terminal
IC fixed voltage regulator, IC 723 general purpose regulator, introduction to SMPS,
uninterruptable power supplies (UPS).
TEST BOOKS :
1. Electronic Devices & Circuit Theory, R.L Boylestad and L. Nashelsky, Pearson
Education.
2. Electronics Fundamentals and Applications, D Chattopadhyay and P. C Rakshit, New
Age International Publications.
3. Microelectronics circuits, theory and applications by ADEL S. SEDRA and KENNETH
C. SMITH, fifth edition. OXFORD INTERNATIONAL STUDENT EDITION
REFERENCE BOOKS :
1. Integrated Electronics, Millman and Halkias, Mc. Graw Hill Publications.
2. Electronics Devices and Circuits, Sanjeev Gupta, Dhanpat Rai, Publications.
COMPUTER ORGANIZATION AND ARCHITECTURE (CODE: )

Pre Requisites:Digital Electronics, Logic Gates
L-P-T:Cr.
3-0-1: 4
Objecti
ve:
UNIT I: INTRODUCTION( Hours)
ComputingandComputers, EvolutionofComputers, VLSI Era, SystemDesign-Register Level,
Processor Level, CPU Organization, Data Representation, Fixed Point Numbers,
FloatingPointNumbers,InstructionFormats, InstructionTypes. Addressing modes.
UNIT II: DATAPATHDESIGN( Hours)
Fixed Point Arithmetic, Addition, Subtraction, Multiplication and Division, Combinational and
Sequential ALUs, Carry look ahead adder, Robertson algorithm, booths algorithm, nonrestoring division algorithm, Floating Point Arithmetic, Coprocessor, Pipeline Processing,
Pipeline Design, Modified booths Algorithm
UNIT III: CONTROLDESIGNAND MEMORYORGANIZATION( Hours)
HardwiredControl,Micro
programmedControl,Multiplier
ControlUnit,CPUControlUnit,
PipelineControl,InstructionPipelines,PipelinePerformance,Superscalar
Processing,
NanoProgramming.
Random Access Memories, Serial - Access Memories, RAM Interfaces, Magnetic
Surface Recording, Optical Memories, multilevel memories, Cache & Virtual Memory,
Memory Allocation, Associative Memory.
UNIT IV:SYSTEMORGANIZATION( Hours)
Communication methods, Buses, Bus Control, Bus Interfacing, Bus arbitration, IO and system
control, IO interface circuits, Handshaking, DMA and interrupts, vectored interrupts, PCI
interrupts, pipelineinterrupts, IOP organization, operation systems, multiprocessors, fault
tolerance, RISC and CISC processors, Superscalar and vector processor.
TEXT BOOKS
1. Computer Organization, Carl Hamacher, ZvonkoVranesic and SafwatZaky, Tata
McGraw Hill.
2. Computer System Architecture, M. Morris Mano, Pearson Prentice Hall
REFERENCE BOOKS:
1. Computer Organization and Design: The Hardware/Software interface, David A.
Patterson and John L. Hennessy, Elsevier.
2. Computer Organization and Architecture Designing for Performance, William

Stallings, Pearson Education.
3. Computer Architecture and Organization, John P. Hayes, Tata McGraw Hill.
4. Computer Systems Design and Architecture, V.P. Heuring, H.F. Jordan, Pearson
Education.
PHYSICS LAB. (CODE: )

Pre Requisites:Basic calculations, and plotting of graphs
Objecti
ve:
L-P-T:Cr. 0-6-0:2
2
To understand and realize the various physical laws using physical equipments.
List of Physics Practical:

1. To measure the acceleration due to gravity using compound pendulum.
2. To study the electromagnetic induction and verify Faradays Law.
3. To study the variation of magnetic field along the axis of a coil and verify Biot-Savart
Law.
4. To measure frequency of A.C. mains using sonometer.
5. To study the resonance of LCR circuit in series and parallel configurations.
6. To measure the intensity distribution due to single slit and double slits and to measure
the slit width and slit separation.
7. To measure the refractive index of material of prism.
8. To measure wavelength of sodium light using Newtons ring.
9. To measure optical rotation of cane sugar using Polarimeter.
10. To measure Plancks constants using photo cell.
11. He-Ne laser experiment.
12. To measure band gap of a given semiconductor.
Total 24 labs : 2lab. classes each of 3hours per week, Total 72 Hours
REFERENCE BOOKS:
1. R.K. Shukla (New Age Publication), Practical Physics
2. C.L. Arora (S. Chand Publication)
ELECTRONICS LAB. - II(CODE: )

Pre Requisites:
L-P-T:Cr.
2
Objecti
ve:
0-6-0:2
Study of analysis of different circuits and their
Circuit theory Lab using PSPICE Simulation:

1)
2)
3)
4)
5)
6)
7)
Functional study of Digital Storage oscilloscope.

Study of PSPICE for Circuit Analysis Lab.
Study of Kirchofs Voltage Law and Kirchoff s Current law.
Study of Mesh and Nodal Analysis.
Study of Thevenin Theorem.
Study of Superposition theorem.
7. Study of Clippers: (1) Biased (2) Unbiased using P-N diode and Zener
Diode.
8) Study of Clampers: (1) Biased (2) Unbiased
9) Study of Half wave and Full wave rectifier.
10)
Study of Norton Theorem .
11)
Study of Transient Analysis of RLC Circuit.
IT WORKSHOP(CODE: )
Pre Requisites:
L-P-T:Cr. 2-6-0:3
The IT Workshop for engineers is a 6 training lab course spread over 90 hours.
The modules include training on PC Hardware, Internet & World Wide Web and
Productivity tools including Word, Excel, Power Point and Publisher.
PC Hardware introduces the students to a personal computer and its basic peripherals, the
process of assembling a personal computer, installation of system software like MS Windows,
Linux and the required device drivers. In addition hardware and software level troubleshooting
process, tips and tricks would be covered.
Objecti
ve:
Internet & World Wide Web module introduces the different ways of hooking the PC on to
the internet from home and workplace and effectively usage of the internet. Usage of web
browsers, email, newsgroups and discussion forums would be covered. In addition, awareness
of cyber hygiene, i.e., protecting the personal computer from getting infected with the viruses,
worms and other cyber attacks would be introduced.
Productivity tools module would enable the students in crafting professional word
documents, excel spread sheets, power point presentations and personal web sites using the
Microsoft suite of office tools and LaTeX.
SEMESTER - III
MATHEMATICS-III(CODE: )
(Probability& Statistics, Complex variables)
Pre Requisites:None
L-P-T:Cr. 4-0-0:4
Objecti
ve:
UNIT I: PROBABILITY( Hours)
Probability ; Sample space and events - The axioms of probability - some elementary theorems
- conditional probability - Baye's theorem. Random variables - discrete and continuous
distribution - distribution functions- Binomial , poison and Normal distribution-sampling
distribution - population and samples - proportions, sums and differences.
UNIT II: STATISTICS( Hours)
Estimations: Point estimation - interval estimation - Bayesian estimation. Testing of
hypothesis: means - hypothesis concerning one or two means - Type I and Type II errors. One
tail , tow-tail tests. Test of significance - student's t- test. F-test, test .estimation of proportion.
UNIT III:COMPLEX FUNCTIONS( Hours)
Functions of complex variable - Continuity - Differentiability - Analysticity - Properties
-Cauchy- Riemann equations in Cartesian and polar coordinates.Harmonic and conjugate
harmonic functions - Milne - Thompson Method.
UNIT IV:COMPLEX INTEGRATION( Hours)
Line integral evaluation along path and by definite integration - Cauchy's integral theorem Cauchy's integral formula - Taylor's series expansion- singularities (isolated, pole, essential) Residues - evaluation of residue by Laurent series. Residue theorems .Evaluation of integrals
of different type
TEXT BOOKS:
1. Introduction to Probability and Statistics by William MendcnhaU ,Cengage learning.
2. Higher Engineering Mathematics by B.V Ramana( Tata McGraw-Hill)
REFERENCE BOOKS:
1. Advanced Engineering Mathematics, EriwinKreyszig's 8thEdition Wiley Indian
Publisher.
2. Advance Engineering Mathematics by Jain and S.R.K. Iyengar, Narosa Publications
3. Higher Engineering Mathematics by B.V Ramana( Tata McGraw-Hill)
DATA AND FILE STRUCTURE(CODE: CS 402)

Pre Requisites:Concept of C programming, Basics of Computer
Architecture (Primary and Secondary storage structure)
L-P-T:Cr. 4-0-0:4
Objecti To get clear understanding about the basic data structures and their operations,
the concepts of algorithms, basic search and sort algorithms. Student will also
ve:
gain adequate knowledge to choose appropriate data structure and algorithm to
solve a problem.
UNIT I:INTRODUCTION, SORTING, AND SEARCHING
TECHNIQUES(10 Hours)
Introduction:Basic Terminology, Elementary Data Organization, Structure operations,
Algorithm Complexity and Time-Space trade-off.
Arrays:Array Definition, Representation and Analysis, Single and Multidimensional Arrays,
address calculation, application of arrays, Character String in C, Character string operation,
Array as Parameters, Ordered List, Sparse Matrices and Vectors.
Searching: Sequential search, binary search, comparison and analysis.
Sorting: Insertion Sort, Bubble Sort, Quick Sort, Merge Sort, Heap Sort, Sorting on Different
Keys, Practical consideration for Internal Sorting.
UNIT II:LINEAR DATA STRUCTURES (10 Hours)
Stacks: Array Representation and Implementation of stack, Operations on Stacks: Push& Pop,
Linked Representation of Stack, Operations Associated with Stacks, Application of stack:
Conversion of Infix to Prefix and Postfix Expressions, Evaluation of postfix expression using
stack, Applications of recursion in problems like 'Tower of Hanoi',
Queues: Array and linked representation and implementation of queues, Operations on Queue:
Create, Add, Delete, Full and Empty, Circular queues, D-queues and Priority Queues.
Linked list: Representation and Implementation of Singly Linked Lists, Two-way Header List,
Traversing and Searching of Linked List, Overflow and Underflow, Insertion and deletion
to/from Linked Lists, Insertion and deletion Algorithms, Doubly linked list, Polynomial
representation and addition, Generalized linked list.
UNIT III:NON-LINEAR DATA STRUCTURES (13 Hours)
Trees: Basic terminology, Binary Trees, Binary tree representation, algebraic Expressions,
Complete Binary Tree, Extended Binary Trees, Array and Linked Representation of Binary
trees, Traversing Binary trees, Threaded Binary trees, Traversing Threaded Binary trees,
Huffman algorithm.
Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion in BST, Complexity of
Search Algorithm, Path Length, AVL Trees, B-trees.
Graphs: Terminology & Representations, Graphs & Multi-graphs, Directed Graphs,Sequential
representations of Graphs, Adjacency Matrices, Traversal, ConnectedComponent and Spanning
Trees, Minimum Cost Spanning Trees.
UNIT IV:HASHING AND FILE STRUCTURES(10 Hours)

Hashing: Hash Table, Hash Functions, Collision Resolution Strategies, Hash Table
Implementation
File Structures: Physical Storage Media File Organization, Organization of records into
Blocks, Sequential Files, Indexing and Hashing, Primary indices, Secondary indices, B + Tree
index Files, B Tree index Files, Indexing and Hashing Comparisons.
TOTAL : 43 Hours
TEXT BOOKS:
1. Horowitz and Sahani, "Fundamentals of data Structures", Galgotia.
2. Data Management and File Structures, Mary E.S. Loomis, PHI
REFERENCE BOOKS:
1. A. M. Tenenbaum, "Data Structures using C & C++", PHI
2. Adam Drozdek, "Data Structures and Algorithms in C++", Thomson Asia Pvt.Ltd.
(Singapore)
OBJECT ORIENTED PROGRAMMING (CODE: CS403 )

Pre Requisites:Basic procedural programming Language (like C-Programming)
L-P-T:Cr. 3-0-1: 4
Objecti
ve:
UNIT I:
( Hours)
INTRODUCTION
Introduction to object oriented programming concepts-Encapsulation, Data Abstraction, Data Hiding,

Inheritance, Polymorphism etc. difference in approach from procedural programming. Introduction to
Linux and Java Programming Environment- Java compiler and virtual machine, Structure of a Java
program, standalone programs and applets, concepts of portability.
UNIT II: BASIC PROGRAMMING ELEMENTS

( Hours)
Basic Programming Elements in Java; Data types; variables and array operators, assignment and
selection statements iterative structures, nested loops.-Class and Object in Java: General form of a class,
creating objects; access control in classes;-Constructors, methods, finalization, parameters, method
overloading, recursive methods, static members, final qualifier, string handling in Java, I/O mechanism,
command line arguments.
UNIT III: INHERITANCE, PACKAGES AND INTERFACES

( Hours)
Inheritance: Basics super classes and subclasses, tlid`keyword extends, multilevel hierarchy, method
overriding; run time polymorphism, abstract classes, final in inheritance, the Object class.
Packages and Interfaces: Defining package, access protection, importing classes and packages, defining
and implementing interfaces, nested interfaces, use of interfaces, variables in interfaces.
UNIT IV: EXCEPTION HANDLING, APPLETS, AND AWT( Hours)

Exception Handling: fundamentals, types of exceptions catching exceptions, multiple catching,
nested try statements, uncaught exceptions, throw and throws, finally mechanism, built-in-exceptions,
creating exception subclasses, using exceptions.
Applets/AWT: Applet fundamentals, the applet class, applet display method, requesting repainting, a
banner applet, passing parameters to applets, uses .of applets.
TEXT BOOKS
1. Programming with Java A Primer by E. Balaguruswami, The McGraw-Hill.
2. Complete reference The Java -Herbert Shildt, 7U' Ed., The McGraw-Hill.
REFERENCE BOOKS:
1. Dietel and Associates, "Java How to Program", Prentice-Hall.
2. David Flanagan, "Java in a Nutshell" O'Reilly Media,
3. Bruce Eckel, "Thinking in Java", Prentice-Hall.
4. James Gosling, Bill Joy, Guy Steele and GiladBracha, The JavaLanguage
Specification", Prentice-Hall.
DIGITAL CIRCUIT AND SYSTEM (CODE: )

Pre Requisites:None
L-P-T:Cr.
4-0-0:4
Objecti
ve:
UNIT I:COMBINATIONAL LOGIC DESIGN(14 Hours)
Standard representations for logic functions, k map representation of logic functions (SOP m POS
forms), minimization of logical functions for minterms and maxterms (upto 4 variables), dont care
conditions, Design Examples: Arithmetic Circuits, BCD - to 7 segment decoder, Code converters.
QuineMc-Cluskey methods. Adders and their use as subtractors, look ahead carry, ALU, Digital
Comparator, Parity generators/checkers, Static and dynamic hazards for combinational logic.
Multiplexers and their use in combinational logic designs, multiplexer trees, Demultiplexers and their
use in combinational logic designs, Decoders ,demultiplexer trees. Programmable logic devices: Detail
architecture, Study of PROM, PAL, PLA, Designing combinational circuits using PLDs.
Semiconductor memories: memory organization and operation, expanding memory size, Classification
and characteristics of memories, RAM, ROM, EPROM, EEPROM, NVRAM, SRAM, DRAM,
expanding memory size, Synchronous DRAM (SDRAM), Double Data Rate SDRAM, Synchronous
SRAM, DDR and QDR SRAM, Content Addressable Memory.
UNIT II: SEQUENTIAL LOGIC DESIGN,STATE MACHINES(15 Hours)

1 Bit Memory Cell, Clocked SR, JK, MS J-K flip flop ,D and T flip-flops. Use of preset and clear
terminals, Excitation Table for flip flops.Conversion of flip flops. Application of Flip flops: Registers,
Shift registers, Counters (ring counters, twisted ring counters), Sequence Generators, ripple counters,
up/down counters, synchronous counters, lock out, Clock Skew, Clock jitter. Effect on synchronous
designs.
Basic design steps- State diagram, State table, State reduction, State assignment, Mealy and Moore
machines representation, Implementation, finite state machine implementation, Sequence
detector. Introduction to algorithmic state machine.
UNIT III:DIGITAL LOGIC FAMILIES(7 Hours)

Classification of logic families , Characteristics of digital ICs-Speed of operation , power dissipation,
figure of merit, fan in, fan out, current and voltage parameters, noise immunity, operating
temperatures and power supply requirements.
TTL-operation of TTL NAND gate, active pull up, wired AND, open collector output, unconnected
inputs. Tri-State logic.
CMOS logic CMOS inverter, NAND,NOR gates, unconnected inputs, wired logic , open drain
output. Interfacing CMOS and TTL.
Comparison table of Characteristics of TTL, CMOS, ECL, RTL, I2L, DCTL.
UNIT IV:INTRODUCTION TO HDLs(7 Hours)

Library, Entity, Architecture, Modeling styles, Data objects, Concurrent and sequential
statements,Design examples, using VHDL for basic combinational and sequential circuits, Attributes
(requiredfor practical) (Test benches and FSM excluded).
TOTAL : 43 Hours
TEXT BOOKS:
1. M. Morris Mano Digital Design
2. R.P. Jain , Modern digital electronics , 3Rd edition , 12th reprint TMH Publication, 2007.
REFERENCE BOOKS:
1. Stephen Brown, Fundamentals of digital logic design with VHDL 1st edition, TMH
Publication, 2002.
DATA STRUCTURE LAB. (CODE: )

Pre Requisites:Programming in C/C++/Java, Basic knowledge about Linux OS, few
commands related to compilation and running of C/C++/Java -programs in Linux environment.
L-P-T:Cr. 0-6-0:2
Objecti
ve:
Desktop PC with Linux OS, GNU C/C++ Compiler/ JDK.
(both OS and compilers). Students must use either C, or C++, or Java language to prepare their
programs.
List of topics:
1. Implementation of Stack, Queue using Array, Linked List.
2. Arithmetic expressions and its evaluation using stack. Other problems using stack and
queues.
3. Implementation of different sorting and searching techniques in an array: Bubble
sorting, Selection sorting, Insertion sorting, Quick sorting.
4. Implementation of Tree data structure, Tree traversal algorithms ( Inorder, Preorder,
Postorder, and Level order) both recursive and non-recursive.
5. Implementation Binary search tree (Perform insertion, deletion, search operation on the
tree)
6. Implementation of BFS and DFS on a graph.
7. Implementation of AVL Tree: Insertion, deletion, and searching operations
8. Implementation of B-Tree : insertion, deletion and search operations
9. Implementation of all functions of a dictionary (ADT) using Hashing
10. Implementation of Priority queues
The above Lab. exercises to be carried out in 72 Hours (24 Lab. Classes / 12 weeks).
REFERENCES:
1. Horowitz and Sahani, "Fundamentals of data Structures", Galgotia.
2. DATA structures a pseudo code approach with c++ , Indian edition, R.F.Gilberg and
B.A.ForouzanCengage Learning.
3. Programming Prinicples and Practice using C++, B.Stroustrup, Addition-Wiesly
(Pearson Education)
4. Data Structures and Algorithms in C++, Third Edition, Adam Drozdek, Thomson.
OBJECT ORIENTED PROGRAMMING LAB(CODE: )

Pre Requisites:
L-P-T:Cr. 0-6-0: 2
Objecti .
ve:
(both OS and compilers).
List of topics:
1. Data types & variables.
2. Decision control structures: if, nested if etc.
3. Program with loop control structures: do, while, for etc.
4. Inheritance, polymorphism, packages, generics.
5. Program with modern features of java.
6. Interfaces and Inner classes
7. Implementing wrapper classes
8. Implementing generics.
9. Working with files.
10. Java GUI programming like programming with AWT etc.
Project work:
Implementation of Lexical Analyzer, parser, code generator.
SEMESTER - IV
MATHMATICS-IV(CODE: )
(Linear Algebra and Graph Theory)
Pre Requisites: None
L-P-T:Cr.
4-0-0:4
Objecti
ve:
UNIT I:MATRICES & SYSTEM OF LINEAR EQUATIONS(10 Hours)
Elementary row transformations rank Echelon form- normal form gauss elimination
Direct method LU decomposition solution of tridiagonal system- Eigen value Eigen
vectors Cayley-Hamilton theorem- Model and Spectral matrices Hermitian- orthogonalquadratic form - semi definite unitary .
UNIT II: VECTOR SPACE(10 Hours)
Space coordinates vectors( addition and Scalar multiplication) dot product Application to
Geometry- vector Space Subspaces span of a set More about sub space Linear
Dependence , Independence dimension and Basis
UNIT III:GRAPHS(10 Hours)
Basic concept of graph theory - directed and undirected graph-Matrix representation different
types of graphs ( cycle , wheel , path , null , complete) .Isomorphism , sub graph and tree,
connected and disconnected graph , spanning tree. BFS , DFS , KurskalAlgorithims.
UNIT IV:PLANARITY(10 Hours)
Planar graph Eulers formula Eulerian graph Hamiltonial Graph Chromatic Number .
Graph color theorems ( Four color and five color) dual graph and its construction, greens
berg theorem.
TOTAL : 40 Hours
TEXT BOOKS:
1. Linear Algebra and Its Application by Gilbert starng , Thomson Books
2. Graph theory With Application To Engineering And Computer Science by NarsinghDeo
REFERENCE BOOKS:
1. Higher Engineering Mathematics by B.V. Ramana ( Tata McGraw-Hill)
3. Discrete Mathematics for computer Scientists & Mathematicians, By Mott, PHI
ALGORITHMS (CODE: )
Pre Requisites:None
L-P-T:Cr.
3-0-1:4
Objecti
ve:
UNIT I:INTRODUCTION AND DISJOINT SETS (10 Hours)
Introduction: Algorithm, Psuedo code for expressing algorithms, Performance Analysis-Space
complexity, Time complexity, Asymptotic Notation- Big oh notation, Omega notation, Theta
notation and Little oh notation, Probabilistic analysis, Amortized analysis.
Disjoint Sets- disjoint set operations, union and find algorithms, spanning trees, connected
components and biconnected components.
UNIT II:DIVIDE & CONQUER AND GREEDY METHODS (12 Hours)
Divide and conquer: General method, applications-Binary search, Quick sort, Merge sort,
Strassens matrix multiplication.
Greedy method: General method, applications-Job sequencing with deadlines, 0/1 knapsack
problem, Minimum cost spanning trees, Single source shortest path problem.
UNIT III:DYNAMIC PROGRAMMING AND BACKTRACKING (12 Hours)
Dynamic Programming: General method, applications-Matrix chain multiplication, Optimal
binary search trees, 0/1 knapsack problem, All pairs shortest path problem, Travelling sales
person problem, Reliability design.
Backtracking: General method, applications-n-queen problem, sum of subsets problem, graph
coloring, Hamiltonian cycles.
UNIT IV:BRANCH & BOUND AND NP-CLASS PROBLEMS(10 Hours)
Branch and Bound: General method, applications - Travelling sales person problem, 0/1
knapsack problem- LC Branch and Bound solution, FIFO Branch and Bound solution.
NP-Hard and NP-Complete problems: Basic concepts, non deterministic algorithms, NP - Hard
and NPComplete classes, Cooks theorem.
TOTAL : 44 Hours
TEXT BOOKS:
1. Introduction to Algorithms, 2nd edition, T.H. Cormen, C.E. Leiserson, R.L. Rivest, and
C. Stein, PHI Pvt. Ltd./ Pearson Education
2. Algorithm Design: Foundations, Analysis and Internet examples, M.T. Goodrich and
R.Tomassia, John wiley and sons.
REFERENCE BOOKS:
1. Design and Analysis of algorithms, Aho, Ullman and Hopcroft,Pearson Education.
Algorithms Richard Johnson baugh and Marcus Schaefer, Pearson Education.
2. Fundamentals of Computer Algorithms, Ellis Horowitz, SatrajSahni and Rajasekharam,
Galgotia publications Pvt. Ltd.
3. Introduction to Design and Analysis of Algorithms A strategic approach, R.C.T.Lee,
S.S.Tseng, R.C.Chang and T.Tsai, McGraw Hill.
4. Data structures and Algorithm Analysis in C++, Allen Weiss, 2nd edition, Pearson
Education.
OPERATING SYSTEM (CODE: )

Pre Requisites:None
L-P-T:Cr.
3-0-1: 4
Objecti
ve:
UNIT I: INTRODUCTION AND PROCESS MANAGEMENT (10 Hours)
Computer System and Operating System Overview: Overview of computer operating systems
operating systems functions protection and security distributed systems special purpose
systems operating systems structures and systems calls operating systems generation.
Process Management Process concepts threads, scheduling-criteria algorithms, their
evaluation,
Thread scheduling, case studies UNIX, Linux, Windows
UNIT II: CONCURRENCY CONTROL AND MEMORY MANAGEMENT
(12 Hours)
Concurrency:Process synchronization, the critical- section problem, Petersons Solution,
synchronization Hardware, semaphores, classic problems of synchronization, monitors,
Synchronization examples, atomic transactions. Case studies UNIX, Linux, Windows.
Memory Management: Swapping, contiguous memory allocation, paging, structure of the page
table, segmentation, virtual memory, demand paging, page-Replacement, algorithms, case
studies UNIX, Linux, Windows
UNIT III: DEAD LOCK, FILE SYSTEMS (10 Hours)
Principles of deadlock: system model, deadlock characterization, deadlock prevention,
detection and avoidance, recovery form deadlock, I/O systems, Hardware, application
interface, kernel I/O subsystem, Transforming I/O requests Hardware operation, STREAMS,
performance.
File system Interface: Concept of a file, Access Methods, Directory structure, File system
mounting, file sharing, protection.
File System implementation: File system structure, file system implementation, directory
implementation, directory implementation, allocation methods, free-space management,
efficiency and performance, case studies. UNIX, Linux, Windows.
UNIT IV: MASS STORAGE, PROTECTION, SECURITY (12 Hours)
Mass-storage structure: overview of Mass-storage structure, Disk structure, disk attachment
disk scheduling, swap-space management, RAID structure, stable-storage implementation,
Tertiary storage structure.
Protection: Protection, Goals of Protection, Principles of Protection, Domain of protection
Access Matrix, Implementation of Access Matrix, Access control, Revocation of Access
Rights, Capability- Based systems, Language Based Protection.
Security: The Security problem, program threats, system and network threats cryptography as a
security tool, user authentication, implementing security defenses, firewalling to protect
systems and networks, computer security classifications, case studies UNIX, Linux,
Windows.
TOTAL: 44 Hours
TEXT BOOKS:
1. Operating System Concepts- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th
Edition, JohnWiley.
2. Operating systems- A Concept based Approach, D.M.Dhamdhere, 2nd Edition, TMH.
REFERENCE BOOKS:
3. Operating Systems Internal and Design Principles Stallings, Fifth Edition2005,
Pearson education.
4. Operating System A Design Approach-Crowley, TMH.
5. Modern Operating Systems, Andrew S Tanenbaum 2nd edition Pearson/PHI.
DATABASE MANAGEMENT SYSTEM(CODE: )

Pre Requisites:None
L-P-T:Cr.
3-0-1: 4
Objecti
ve:
UNIT I: (10 Hours)
Overview, File system vs DBMS, Advantages of DBMS ,Database System Architecture - Data
Abstraction, Data Independence, Data Definitions and Data Manipulation Languages. Data
models - Entity Relationship(ER), Mapping ER Model to Relational Model, ER/EER to
Relational Mapping, Network.Relational and Object Oriented Data Models, Integrity
Constraints and Data Manipulation Operations.
UNIT II: (12 Hours)
Relation Query Languages, Relational Algebra, Tuple and Domain Relational Calculus, SQL
and QBE. Relational Database Design: Domain and Data dependency, Functional Dependency,
Armstrongs Axioms, Normal Forms,Dependency Preservation, Lossless design.
UNIT III: (10 Hours)
Query Processing and Optimization: Query Tree, Evaluation of Relational Algebra
Expressions, Query Equivalence, Join strategies, Query Optimization Algorithms.
Storage Strategies: Indices, B-Trees, Hashing, Indexing.
UNIT IV:(12 Hours)
Transaction processing: Recovery and Concurrency Control, Locking and Timestamp based
Schedulers, Multiversion and Optimistic Concurrency ControlSchemes.
Advanced topics: Object-Oriented and Object Relational databases. Logical Databases, Web
Databases, Distributed Databases, Data Warehouse and Data Mining.
TOTAL : 44 Hours
TEXT BOOKS:
1. Elmaski&Navathe -Fundamentals of Database Systems, 4th Edition, Pearson Education
REFERENCE BOOKS:
2. Database Systems, Thomas Connolly, Carolyn Begg
3. C.J.Date - An introduction to Database Systems, Pearson Education
4. Database System Concepts, AviSilberschatz, Henry F. Korth , S. Sudarshan
5. Bipin Desai -An introduction to Database System, Galgotia Publication.
PRINCIPLES OF COMMUNICATIONS (CODE: )

Pre Requisites:None
L-P-T:Cr.
4
Objecti
ve:
UNIT I:AMPLITUDE AND ANGLE MODULATION( Hours)
Amplitude modulation: Block diagram of Electrical communication system, Radio
communication, Need for modulation, Types of Amplitude modulation, AM, DSB SC, SSB
SC,VSB, Power and BW requirements, Generation of AM, DSB SC, SSB SC, Demodulation
of AM : Diode detector, Product demodulation for DSB SC & SSB SC.
Angle Modulation: Frequency & Phase modulations, advantages of FM over AM, Bandwidth
consideration, Narrow band and Wide band FM, Comparison of FM & PM, FM modulators
and FM demodulators, Armstrong method of generation, necessity of pre-emphasis and deemphasis .
UNIT II:( Hours)
Pulse Modulations : Sampling, Nyquist rate of sampling, Sampling theorem for Band limited
signals, PAM, regeneration of base band signal, PWM and PPM, Time Divison Multiplexing,
Frequency Divison Multiplexing, Asynchronous Multiplexing.
Digital Communication: Advantages, Block diagram of PCM, Quantization, effect of
quantization, quantization error, Base band digital signal, DM, ADM, ADPCM and
comparison.
UNIT III:( Hours)
Digital Modulation: ASK, FSK, PSK, and DPSK, QPSK demodulation, coherent and
incoherent reception, Comparison of binary and quaternary modulation schemes, M-ary
modulation techniques.
Information Theory and Coding: Discrete messages and information content, source coding,
Shanon s theorem, channel capacity, Block codes- coding and decoding, burst error
correction(BRC), Convolutional coding, decoding convolutional code, comparison of error
rates in coded and uncoded transmission, turbo codes.
UNIT IV:( Hours)
Spread Spectrum Modulation: Use of spread spectrum, direct sequence spread spectrum,
spread spectrum and CDMA, ranging using DS spread spectrum, frequency hopping spread
spectrum, Pseudo random sequences generation and characteristics, synchronization in
spread spectrum systems.
Advanced Communication Systems: Telephone switching, Computer communication,
Optical communications, Mobile telephone communication- the Cellular concept, Satellite
communications, RADAR systems.
TEXT BOOKS:
1. Communication Systems Simon Haykin, John Wiley, 3rd edition.
2. Principles of Communications H. Taub and D. Schilling, Gouthamsaha, TMH, Third

edition,2nd reprint,2008.
REFERENCE BOOKS:
1. Communication Systems Analog and Digital R.P. Singh and S D Sapre, TMH, 2nd
Edition, 2008.
2. Digital and Analog Communication Systems K Sam Shanmugam,WSE,2006.
3. Electronic &Communication Systems Kennedy and Davis, TMH, 4th edition, 2004.
4. Modern Digital and Analog communication Systems B.P Lathi, Oxford 3rd edition
DATABASE MANAGEMENT SYSTEM LAB. (CODE: )

Pre Requisites:None
Objecti
ve:
L-P-T:Cr.
The studentwill learn database design,SQL and PL/SQL.
0-6-0: 2
Recommended Systems/Software Requirements: MySql /Oracle latest version.

LIST OF TOPICS FOR EXPERIMENTS:
PART A : SQL :
1. DDL Statements (Create, Alter, Drop)
2. DML Statements (Insert, Update, Delete)
3. SELECT Statement : Information retrieval
4. Use of In-built functions (e.g. aggregate functions like Min, Max, Average etc,
time date functions)
5. TCL statements (COMMIT, ROLL BACK, CHECK POINT)
6. Views, Sequence, Types (ORDBMS)
7. Security Management Commands (like GRANT and REVOKE)
PART B : PL/ SQL:
1. Un-named block
2. Named Blocks (FUNCTIONS, PROCEDURES)
3. Active Database Concepts (TRIGGERS )
4. PACKAGES
REFERENCEBOOKS:
1. ORACLE PL/SQL by example. Benjamin Rosenzweig, Elena Silvestrova, Pearson
Education 3rd Edition
2. ORACLE DATA BASE LOG PL/SQL Programming SCOTT URMAN, Tata Mc- Graw
Hill.
3. SQL & PL/SQL for Oracle 10g, Black Book, Dr.P.S. Deshpande.
MICROPROCESSOR LAB. (CODE: )

Pre Requisites:
L-P-T:Cr. 0-6-0: 2
To learn architecture and working principle of 8085 Microprocessor, its
peripheral units, assembly languages, and how to write and execute an assembly
programs using kits and assemblers / emulators.
At the beginning of the session instructors should give a brief introduction on followings:
Objecti
ve:
1. Computer Architecture: Harvard architecture/Van Neumann Architecture,

CISC/RISC Architecture,
2. Introduction of 8085 Microprocessor Instruction set, Addressing modes,
Instruction groups
TOPICS OF EXPERIMENTS
1. Lab Practice using 8085 Simulator and Assembly Language Program
Examples
2. Real world interface design: LED, SWITCH, keyboard, LCD, ADC, DAC, UART,
RTC, PWM, Memory
REFERENCE BOOK:
1. Ramesh Gaonkar, The 8085 Microprocessor
SEMESTER - V
THEORY OF COMPUTATION (CODE: )
Pre Requisites:Discrete Mathematics, Introductory Algorithms course.
L-P-T:Cr. 3-0-1: 4
Objecti To have an understanding of finite state and pushdown automata,
regular languages and context free languages, to know relation
ve:
between regular language, context free language and corresponding

recognizers; to gain knowledge about Pushdown Automata, Turing
machines, and Intractability.
UNIT I:(9 Hours)

Introduction to formal proof Additional forms of proof Inductive proofs Finite Automata
(FA) Deterministic Finite Automata (DFA) Non-deterministic Finite Automata (NFA)
Finite Automata with Epsilon transitions.
UNIT II: REGULAR EXPRESSIONS AND LANGUAGES(10 Hours)
Regular Expression FA and Regular Expressions Proving languages not to be regular
Closure properties of regular languages Equivalence and minimization of Automata.
UNIT III: CONTEXT-FREE GRAMMAR, ANDPROPERTIES (16 Hours)
Context-Free Grammar (CFG) Parse Trees Ambiguity in grammars and languages
Definition of the Pushdown automata Languages of a Pushdown Automata Equivalence of
Pushdown automata and CFG, Deterministic Pushdown Automata.
Normal forms for CFG Pumping Lemma for CFL - Closure Properties of CFL Turing
Machines Programming Techniques for TM.
UNIT IV:UNDECIDABILITY (10 Hours)
A language that is not Recursively Enumerable (RE) An undecidable problem that is RE
Undecidable problems about Turing Machine Posts Correspondence Problem - The classes P
and NP.
TOTAL: 45 Hours
TEXT BOOKS:
1. John E. Hopcroft, Rajeev Motwani and Jeffery D. Ullman, Automata Theory,
Languages, and Computation (3rd. Edition), Pearson Education, 2008.
REFERENCE BOOKS:
1. H.R.Lewis and C.H.Papadimitriou, Elements of The theory of Computation, Second
Edition, Pearson Education/PHI, 2003
2. Michael Sipser, Introduction to the Theory of Computation, Books/ColeThomson
Learning, 2001.
3. J.E.Hopcroft and JD Ullman, Introduction to Automata Theory, Languages,and
Computation, Addison-Wesley, 1979.
COMPUTER NETWORKS AND DISTRIBUTED PROCESSING (CODE: CS

601)
Pre Requisites:
L-P-T:Cr. 3-0-1: 4
Objecti To introduce the concepts, terminologies and technologies used in modern days
computer networks and distributed processing.
ve:
UNIT I: ( Hours)
Introduction: Data Communications, Networks, The Internet, Protocols and Standards,
Network Models, Layered Tasks, The OSI Model, Layers in the OSI Model, TCP/IP Protocol
Suite, Addressing, Physical Layer and Media, Data and Signals, Analog and Digital, Periodic
Analog Signals, Digital Signals, Transmission impairment, Data Rate Limits, Performance.
Switching, Circuit-Switched Networks, Datagram Networks, Virtual-Circuit Networks.
UNIT II: ( Hours)
Error Detection and Correction, Introduction, Block Coding, Liner Block Codes, Cyclic Codes,
Checksum, Data Link Control, Framing, Flow and Error Control, Protocols (ARQ), HDLC,
Point-to-Point Protocol (PPP), Multiple Access, Random Access, Aloha, Controlled Access,
Channelization, IEEE Standards, Standard Ethernet, Fast Ethernet, Gigabit Ethernet, IEEE
802.11, Bluetooth. Virtual-Circuit Networks: Frame Relay and ATM, Frame Relay.
UNIT III: ( Hours)
Network Layer: Logical Addressing, IPv4 Addresses, IPv6 Addresses, Network Layer: Internet
Protocol, Internetworking, IPv4, IPv6, Transition from IPv4 to IPv6, Network Layer: Adress
Mapping, Error Reporting and Multicasting, Address Mapping, ICMP, IGMP,
Network Layer: Delivery, Forwarding and Routing, Delivery, Forwarding, Unicast Routing
Protocols (RIP, OSPF), Multicast Routing Protocols (BGP). Transport Layer: Process-Process
Delivery: UDP, TCP and SCTP, Process-to-Process Delivery, User Datagram Protocol (UDP),
TCP, SCTP.
UNIT IV:( Hours)
Congestion Control and Quality of Service, Congestion, Congestion Control, Quality Service,
Techniques to improve QoS, Integrated Services, Differentiated Services, QoS in Switched
Networks. Application Layer: Domain Name Systems (DNS), Remote Logging, Electronic
Mail and File Transfer, Telnet.WWW and HTTP: Architecture, Web Documents, HTTP,
Network Management: SNMP, RTP, RTCP, Voice over IP Introduction to Network Security and
Cryptography.
TEXT BOOKS
1. Data Communications and Networking, Fourth Edition by Behrouza A.Forouzan,TMH.
REFERENCE BOOKS:
1. Computer Networks : A system Approach, Larry L. Peterson, Bruce S Davie
2. Computer Networks, A.S.Tanenbaum,4thedition,Pearson education.
3. Data and Computer Communication, W. Stallings, Prentice- Hall
4. Kurose, J.F. and Ross, K.W., "Computer Networking: A Top-Down Approach Featuring
the Internet", Addison Wesley.
COMPUTER NETWORKS LAB.(CODE: )

Pre Requisites:None
L-P-T:Cr.
0-6-0: 2
Objecti
ve:
Desktop PC with Linux OS, Window OS. GNU C Compiler, Router, Network cables and other
network setup equipments.
LIST OF TOPICS FOR EXPERIMENTS
1. Few interactive experiments related to router, cabling, H/W and software configuration
for computer communication.
2. Some Network protocols simulation using NetSim, NS2, or any other protocol
simulators for:
A. Analysing number of transmitting nodes vs. collision count, mean delay for
Ethernet LAN .
B. Analysing bus vs. star-switch wit h respect to number of collisions (for a fixed
number of transmitting nodes) for Ethernet LAN
C. Analysing performance of token ring with number of nodes vs. response time, mean
delay.
D. Comparing the throughput and normalized throughput for token ring and token bus
for different transmitting nodes.
E. Comparing the CSMA/CD vs. CSMA/CA protocols (for a fixed number of
transmitting nodes).
F. Analysing the difference between unicast and broadcast transmission (for a fixed
number of transmitting nodes).
G. Verification of stop-and-wait protocol, Go-back-N protocol, Selective repeat
protocol, distance vector routing algorithm, state routing algorithm.
3. Some programming techniques in socket programming.
DIGITAL SIGNAL PROCESSING LAB.(CODE: )

Pre Requisites:Digital Signal Processing
L-P-T:Cr.
2
0-6-0:2
Objecti
ve:
1. Generation of various waveforms( sine, cosine , square, triangular) using MATLAB
2. Linear convolution of two given sequences without using the inbuilt function conv. In
MATLAB
3. Circular convolution of two sequences and comparison of the result with the result
obtained from linear convolution.
4. Convolutions of long duration sequences using overlap add and overlap save method.
5. Computation of auto-correlation and cross correlation of two sequences using

MATLAB
6. Implementation of FFT algorithm using decimation in time and decimation in
frequency.
7. Design and implementation of IIR filters (Butterworth and Chebyshev) in MATLAB
8. Design and implementation of FIR filters using windowing techniques.
9. Computation of power spectral density of a sequence using MATLAB.
10. Familiarization with the architecture of standard DSP kit.
SEMESTER - VI
OPTIMIZATION TECHNIQUES (CODE: )
Pre Requisites:None
L-P-T:Cr.
4
Objecti
ve:
UNIT I: OPTIMIZATION & SIMPLEX METHOD(10 Hours)
Introduction to Optimization, Classification of Optimization Problem, Classical Optimization
Technique, Single Variable Optimization, Multivariable optimization, Direct Solution,
Constrained variation, Lagrange multiplier, linear programming, Standard form of linear
programming, Simplex Algorithm, Two Phage of simplex Method, Big M-Method.
UNIT II: DUALITY, ASSIGNMENT & TRANSPIRATION (10 Hours)
Formation of dual problems, Important Result in Duality, Dual simplex Method, Mathematical
formulation of Assignment problem, Hungarian Method, The travelling Salesman Problem,
Transportation Problem, North West Corner Rule, Optimality Test, Difference of Assignment
and Transportation problem.
UNIT III:INTEGER PROGRAMMING & GEOMETRIC PROGRAMMING
(10 Hours)
Introduction, Importance of Integer Programming Problems, Application, Methods of Integer
Programming Problem, Cutting, Search, Cutting Plane, Mixed Integer Programming,
Unconstrained Geometric programming, Constrained Minimization, Mixed inequality.
UNIT IV: NETWORK SCHEDULING & GAME THEORY (10 Hours)
Introduction, Rules of Network Construction, Time Analysis, Critical Path Method (CPM),
Programme Evaluation and Review Techniques(PERT), Cost Consideration in PERT/CPM,
Payoff, Types of Game, The Maxmin Minimax Principle
TEXT BOOKS:
1. Engineering Optimization- by Singiresu S. Rao, New Age International
Publisher.
2. Operation Research- by KantiSwarup , S Chand & Sons Publisher
REFERENCE BOOKS:
1. Operations Research by Dr. S.D.Sharma.
2. Operations Research : An Introduction by H.A. Taha, PHI Pvt. Ltd., 6th edition
3. Linear Programming by G. Hadley
ARTIFICIAL INTELLIGENCE (CODE: )

Pre Requisites:
L-P-T:Cr.
Objecti
ve:
3-0-1: 4
To provide a strong foundation of fundamental concepts in Artificial Intelligence. To

provide a basic exposition to the goals and methods of Artificial Intelligence. To enable
the student to apply these techniques in applications which involve perception,
reasoning and learning.
UNIT I: INTRODUCTION
Hours)
(8
Intelligent Agents: Agents and environments, Good behavior, The nature of

environments, structure of agents, Problem Solving: problem solving agents,
example problems, searching for solutions, uniformed search strategies - avoiding
repeated states searching with partial information.
UNIT II: SEARCHING TECHNIQUES

Hours)
( 10
Informed search and exploration: Informed search strategies, heuristic function,

local search algorithms and optimistic problems, local search in continuous
spaces, online search agents and unknown environments, Constraint satisfaction
problems (CSP): Backtracking search and Local search for CSP, Structure of
problems, Adversarial Search: Games, Optimal decisions in games, Alpha, Beta
Pruning, imperfect real-time decision, games that include an element of chance.
UNIT III: KNOWLEDGE REPRESENTATION
(10Hours)
First order logic: representation revisited, Syntax and semantics for first order
logic, Using first order logic, Knowledge engineering in first order logic, Inference
in First order logic, prepositional versus first order logic, unification and lifting,
forward chaining, backward chaining, Resolution Knowledge representation :
Ontological Engineering, Categories and objects, Actions, Simulation and events:
Mental events and mental objects.
UNIT III: LEARNING AND APPLICATIONS
(17Hours)
Learning from observations: forms of learning, Inductive learning, Learning

decision trees, Ensemble learning - Knowledge in learning Logical formulation of
learning Explanation based learning Learning using relevant information
Inductive logic programming - Statistical learning methods - Learning with
complete data - Learning with hidden variable - EM algorithm - Instance based
learning - Neural networks - Reinforcement learning Passive reinforcement
learning - Active reinforcement learning - Generalization in reinforcement learning.
Communication Communication as action Formal grammar for a fragment of
English Syntactic analysis Augmented grammars Semantic interpretation
Ambiguity and disambiguation Discourse understanding Grammar induction Probabilistic language processing - Probabilistic language models Information
retrieval Information Extraction Machine translation.
TOTAL: 45 Hour
TEXT BOOKS:
1. Stuart Russell, Peter Norvig, Artificial Intelligence A Modern Approach,
Pearson Education/ Prentice Hall of India, 2004.
REFERENCES BOOKS:
2. Nils J. Nilsson, Artificial Intelligence: A new Synthesis, Harcourt Asia Pvt.
Ltd., 2000.
3. Elaine Rich and Kevin Knight, Artificial Intelligence, 2nd Edition, Tata
McGraw-Hill, 2003.
4. George F. Luger, Artificial Intelligence-Structures And Strategies For
Complex Problem Solving, Pearson Education / PHI, 2002.
WEB TECHNOLOGY LAB.(CODE: )

Pre Requisites:Web Technology
L-P-T:Cr.
0-6-0:2
Application of various web technologies for applications

Objecti
ve:
List of Topics:
1. Creation of HTML pages with links, tables, layouts
2. internal and external CSS along with HTML pages
3. Client Side scripting Javascript/ Javascript Frameworks (jQuery)
4. PHP based server side scripting
5. XML based document creation for specific domains
6. creation of DTDs/ XML schema for sepecific domains
7. XML document parsing
8. Project work based on various web technologies
ALGORITHM LAB.(CODE: )
Pre Requisites:
L-P-T:Cr.
2
0-6-0:2
Objecti .
ve:
(both OS and compilers).
LIST OF TOPICS FOR EXPERIMENTS:
1. Apply the divide and Conquer technique to arrange a set of numbers using merge sort
method.
2. Perform Strassens matrix multiplication using divide and conquer method.
3. Solve the knapsack problems using greedy method.
4. Construct a minimum spanning tree using greedy method.
5. Construct optimal binary search trees using dynamic programming method of problem
solving.
6. Find the solution for traveling sales person problem using dynamic programming
approach.
7. Perform graph traversals.
8. Implement the 8-Queens Problem using backtracking.
9. Implement knapsack problem using backtracking.
10. Find the solution of traveling salesperson problem using branch and bound technique.
SEMESTER -VII
COMPILER DESIGN (CODE: )
Pre Requisites:None
L-P-T:Cr.
4
Objecti To learn various stages of compilation, design phases of a compiler construction
process. This course will also introduce open source tool Lex and Yaac.
ve:
UNIT I:( Hours)
Overview of Compilation: Phases of Compilation Lexical Analysis, Regular Grammar and regular
expression for common programming language features, pass and Phases of translation, interpretation,
bootstrapping, data structures in compilation LEX lexical analyzer generator.
UNIT II:( Hours)

Bottom up parsing : Shift Reduce parsing, LR and LALR parsing, Error recovery in parsing , handling
ambiguous grammar, YACC automatic parser generator.
Top down Parsing : Context free grammars, Top down parsing Backtracking, LL (1), recursive
descent parsing, Predictive parsing, Preprocessing steps required for predictive parsing.
UNIT III:( Hours)

Semantic analysis : Intermediate forms of source Programs abstract syntax tree, polish notation and
three address codes. Attributed grammars, Syntax directed translation, Conversion of popular
Programming languages language Constructs into Intermediate code forms, Type checker.
Symbol Tables : Symbol table format, organization for block structures languages, hashing, tree
structures representation of scope information. Block structures and non block structure storage
allocation: static, Runtime stack and heap storage allocation, storage allocation for arrays, strings and
records.
UNIT IV:( Hours)

Code optimization: Consideration for Optimization, Scope of Optimization, local optimization, loop
optimization, frequency reduction, folding, DAG representation.
Data flow analysis : Flow graph, data flow equation, global optimization, redundant sub expression
elimination, Induction variable elements, Live variable analysis, Copy propagation.
Object code generation : Object code forms, machine dependent code optimization, register allocation
and assignment generic code generation algorithms, DAG for register allocation.
TEXT BOOKS:
3. Principles of Compiler Design, A.V. Aho .J.D.Ullman; Pearson Education.
4. Modern Compiler Implementation in C- Andrew N. Appel, Cambridge
University Press.
REFERENCE BOOKS:
4.
5.
6.
7.
Lex&Yacc, John R. Levine, Tony Mason, Doug Brown, Oreilly

Modern Compiler Design, Dick Grune, Henry E. Bal, Cariel T. H. Jacobs, Wiley dreamtech.
Engineering a Compiler, Cooper & Linda, Elsevier.
Compiler Construction, Louden, Thomson
COMPUTER GRAPHICS (CODE: CS409)

Pre Requisites:None
L-P-T:Cr.
3-0-1: 4
Objecti
ve:
UNIT I: ( Hours)
Graphics Hardware: Display devices, input devices, Raster Graphics.
Line and Circle drawing algorithms: DDA, Bresenham's line drawing algorithm, midpoint
circle
drawing algorithm.
UNIT II: ( Hours)
Windowing and Clipping: Viewing and Window coordinate System, Viewport, Window,
Zoom-in
Zoom-out, Cohen Sutherland, Cyrus beck line clipping algorithms
2D and 3D Geometrical Transformations: Homogeneous Coordinate system, Basic
transformations: Translation, Scaling, Rotation and Reflection.
UNIT III: ( Hours)
Viewing Transformation: Parallel Projection: Orthographic, Axonometric, Cavalier and
Cabinet.
Perspective Projection: one point, two point, three point perspective projection, vanishing
point.
Curve and Surfaces: Properties of curves, Blending functions: Cubic Bezier and B-Spline
curves.
UNIT IV:( Hours)
Parametric Surfaces: Surface of revolution Sweep surfaces, Fractal curves and surfaces,
Hidden line/surface removal: Object space and Image space methods, Inside- outside test, Back
Face detection, Z-buffer, A-Buffer Methods.
TEXT BOOKS
1. Hearn D. and P. Baker, Computer Graphics C version, Prentice-Hall. (Major Reading)
REFERENCE BOOKS:
2. David F. Rozers, Procedural Elements for Computer Grapihics, TMH.
3. David F. Rozers, Mathematical Elements for Computer graphics, TMH.
4. Foley, J.D. A. Van Dam, Computer Graphics: Principles and Practice, Addison- Wesley.
SEMESTER VIII
PROJECT WORK (CODE: )
L-P-T:Cr.
Objecti
ve:
- - :8
LIST OF ELECTIVES:
(OPEN ELECTIVES)
MOBILE COMPUTING (CODE: )

Pre Requisites:
L-P-T:Cr.
4-0-0:4
Objecti
ve:
UNIT I: INTRODUCTION, GSM, WIRELESS MAC (10 Hours)
Introduction to Mobile Communications and Computing: Mobile Computing (MC):
Introduction to MC, novel applications, limitations, and architecture.
GSM: Mobile services, System architecture, Radio interface, Protocols, Localization and
calling, Handover, Security, and New data services.
Wireless Medium Access Control : Motivation for a specialized MAC (Hidden and exposed
terminals, Near and far terminals), SDMA, FDMA, TDMA, CDMA.
UNIT II: MOBILE NETWORK AND TRANSPORT LAYER (10Hours)
Mobile Network Layer: Mobile IP (Goals, assumptions, entities and terminology, IP packet
delivery, agent advertisement and discovery, registration, tunneling and encapsulation,
Optimizations), Dynamic Host Configuration Protocol (DHCP).
Mobile Transport Layer : Traditional TCP, Indirect TCP, Snooping TCP, Mobile TCP, Fast
retransmit/fast recovery, Transmission /time-out freezing, Selective retransmission, Transaction
oriented TCP.
UNIT III: MOBILE DATABASE AND DATA DISSEMINATION (10 Hours)
Database Issues: Hoarding techniques, caching invalidation mechanisms, client server
computing with adaptation, power-aware and context-aware computing, transactional models,
query processing, recovery, and quality of service issues.
Data Dissemination: Communications asymmetry, classification of new data delivery
mechanisms, push-based mechanisms, pull-based mechanisms, hybrid mechanisms, selective
tuning (indexing) techniques.
UNIT IV: MANAT, PROTOCOLS (10 Hours)
Mobile Ad hoc Networks (MANETs): Overview, Properties of a MANET, spectrum of
MANET applications, routing and various routing algorithms, security in MANETs.
Protocols and Tools: Wireless Application Protocol-WAP. (Introduction, protocol architecture,
and treatment of protocols of all layers), Bluetooth (User scenarios, physical layer, MAC layer,
networking, security, link management) and J2ME.
TEXT BOOKS :
1. Jochen Schiller,Mobile Communications, Addison-Wesley.
2. Stojmenovic and Cacute, Handbook of Wireless Networks and Mobile Computing
REFERENCES:
1. Reza Behravanfar, Mobile Computing Principles: Designing and Developing Mobile
Applications with UML and XML, ISBN: 0521817331, Cambridge University Press.
2. Adelstein, Frank, Gupta, Sandeep KS, Richard III, Golden, Schwiebert, Loren,
Fundamentals of Mobile and Pervasive Computing, McGraw-Hill Professional.
3. Hansmann, Merk, Nicklous, Stober, Principles of Mobile Computing, Springer.
4. Martyn Mallick, Mobile and Wireless Design Essentials, Wiley Dream Tech.
MACHINE LEARNING (CODE: )

Pre Requisites: Basic computer science background
L-P-T:Cr.
Objecti
ve:
3-0-1: 4
UNIT I: ( Hours)
General Introduction:Learning Problems, Choosing Training experience/Target Function,
Representation of the target function, issues in machine learning.
Concept Learning: Concept learning task-Inductive Learning, Concept Learning as search,
FIND-S algorithm, version spaces, The List then Eliminate algorithm, Representation of
version spaces, The Candidate Elimination algorithm, Inductive bias.
UNIT II: ( Hours)
Decision Tree Learning: Decision tree representation, ID3 Learning algorithm, Entropy,
Information gain, over fitting, reduced error pruning, Rule-post pruning.
Bayesian Learning: Bayes Theorem and concept Learning, Bayes optimal classifier,
Bayesian Belief Network.
UNIT III: ( Hours)
Instance based Learning: Introduction, k-Nearest Neighbour Learning algorithm, distance
weighted nearest neighbour learning algorithm, case based reasoning, lazy learner and eager
learner.
Learning Set of Rules: Sequential covering algorithm, First Order Inductive Learning (FOIL),
Induction as inverted deduction, Inverting resolution (First order resolution), Generalisation,
theta-subsumption and entailment, PROGOL.
UNIT IV: ( Hours)
Analytical Learning: Inductive vs Analytical Learning, Prolog-EBG, Combining inductive
and analytical learning.
TEXT BOOKS
1. Tom M. Mitchell, Machine Learning, Mac Graw Hill
REFERENCE BOOKS:
2. Christopher M. Bishop, Machine Learning and Pattern Recognition, Springer
DIGITAL SIGNAL PROCESSING (CODE: )

Pre Requisites:
L-P-T:Cr.
4
4-0-0
Objecti
ve:
UNIT I:DISCRETE-TIME SIGNALS AND SYSTEMS( Hours)
Discrete-Time Signals: Some Elementary Discrete-Time signals, Classification of Discrete-Time
Signals, Simple Manipulation; Discrete-Time Systems: Input-Output Description, Block Diagram
Representation,Classification, Interconnection; Analysis of Discrete-Time LTI Systems: Techniques,
Response of LTISystems, Discrete-Time Systems Described by Difference Equations; Implementation
of Discrete-TimeSystems; Correlation of Discrete-Time Signals: Cross correlation and Autocorrelation
Sequences.
The Z-Transform and Its Application to the Analysis of LTI Systems: The Z-Transform: The Direct ZTransform, The Inverse Z-Transform; Properties of the Z-Transform; Inversion of the Z-Transforms:
TheInversion of the Z-Transform by Power Series Expansion, The Inversion of the Z-Transform by
Partial-Fraction Expansion; Analysis of Linear Time-Invariant Systems in the z-Domain.
UNIT II: THE DISCRETE FOURIER TRANSFORM( Hours)

Properties and Applications: Frequency Domain Sampling: Frequency-Domain Sampling and
Reconstruction of Discrete-Time Signals, The Discrete Fourier transform, The DFT as a Linear
transformation, Relationship of the DFT to other Transforms;
Properties of the DFT: Periodicity, Linearity, and Symmetry Properties, Multiplication of Two DFTs
and Circular Convolution, Additional DFT Properties; Linear Filtering Methods Based on the DFT:
Use of the DFT in Linear Filtering, Filtering of Long Data Sequences; Frequency Analysis of Signals
using the DFT
Implementation of Discrete-Time Systems: Structure for the Realization of Discrete-Time Systems,
Structure for FIR Systems: Direct-Form Structure, Cascade-Form Structures, Frequency-Sampling
Structures; Structure for IIR Systems: Direct-Form Structures.
UNIT III:FILTERS( Hours)

General Considerations: Causality and Its Implications, Characteristics of Practical Frequency-Selective
Filters; Design of FIR Filters: Symmetric and Antisymmetric FIR Filters, Design of Linear-Phase FIR
Filters by using Windows, Design of Linear-Phase FIR Filters by the Frequency-Sampling Method;
Design of MR Filters from Analog Filters: IIR Filter Design by Impulse Invariance.
UNIT IV:FAST FOURIER TRANSFORM ALGORITHMS( Hours)

Efficient Computation of the DFT: FFT Algorithms: Direct Computation of the DFT, Radix-2 FFT
Algorithms: Decimation-In-Time (DIT), Decimation-In-Time (DIF); Applications of FFT Algorithms:
Efficient Computation of the DFT of two Real Sequences, Efficient Computation of the DFT a 2NPoint, Real Sequence, Use of the FFT Algorithm in Linear Filtering and Correlation.
TEXT BOOKS
1. Digital Signal Processing - Principles, Algorithms and Applications by J. G. Proakis and D.
G.Manolakis, 4th Edition, Pearson.
REFERENCE BOOKS:
1. Alan V Oppenheim, Ronald W Schafer and John R Buck, Discrete Time Signal Processing,
PHI/Pearson Education, 2000, 2nd Edition.
2. JohnyR.Johnson, Introduction to Digital Signal Processing, Prentice Hall of India/Pearson
Education, 2002.
3. SanjitK.Mitra, Digital Signal Processing: A Computer Based Approach, Tata McGraw-Hill,

2001, Second Edition.
DIGITAL IMAGE PROCESSING (CODE: )

Pre Requisites:High school mathematics, C/C++ programming skills.
L-P-T:Cr. 4-0-0: 4
Objecti Students will learn the image fundamentals and mathematical transforms necessary for image
processing, image enhancement techniques, image restoration procedures, image compression
ve:
procedures, image segmentation and representation techniques.
UNIT I: DIGITAL IMAGE FUNDAMENTALS AND TRANSFORMS (9 Hours)

Elements of visual perception: Light, Brightness adaption and discrimination, Pixels, coordinate conventions,
Imaging Geometry, Image sampling and quantization Basic relationship between pixels: Basic geometric
transformations-Introduction to Fourier Transform and DFT : Properties of 2D Fourier Transform , FFT,
Separable Image Transforms ,Walsh Hadamard Discrete Cosine Transform, Haar, Slant Karhunen Loeve
transforms.Perspective Projection, Spatial Domain Filtering, sampling and quantization.
UNIT II: IMAGE ENHANCEMENT TECHNIQUES(8 Hours)

Spatial Domain methods: Basic grey level transformation, Histogram equalization, Image subtraction, Image
averaging, Spatial filtering: Smoothing, sharpening filters,Laplacian filters, Frequency domain filters : Smoothing,
Sharpening filters,Homomorphic filtering.
UNIT III: IMAGE RESTORATIONAND IMAGE COMPRESSION(16Hours)

Model of Image Degradation/restoration process: Noise models, Inverse filtering, Least mean square filtering,
Constrained least mean square filtering, Blind image restoration, Pseudo inverse, Singular value decomposition.
Lossless compression: Variable length coding: LZW coding, Bit plane coding- predictive coding, DPCM.
Lossy Compression: Transform coding Wavelet coding Basics of Image compression standards: JPEG,
MPEG, Basics of Vector quantization
UNIT IV: IMAGE SEGMENTATION AND REPRESENTATION (8 Hours)

Edge detection: Thresholding, Region Based segmentation, Boundary representation: chair codes, Polygonal
approximation, Boundary segments: boundary descriptors: Simple descriptors, Fourier descriptors, Regional
descriptors, Simple descriptors, Texture
TOTAL: 41 Hours
TEXT BOOKS:
1.
Digital Image Processing, 3rd Edition, by Rafael C Gonzalez and Richard E Woods. Publisher: Pearson
Education.
REFERENCE BOOKS:
1.
2.
3.
4.
Fundamentals of Digital Image Processing, By Anil K Jain

Digital Image Processing, By William K Pratt, John Willey (2001)
Image Processing Analysis and Machine Vision, By MillmanSonka, Vaclav hlavac, Roger Boyle,
Broos/colic, Thompson Learniy (1999).
Digital Image Processing and Applications, By, B. Chanda, D. DuttaMagundar, Prentice Hall of India,
2000
STORAGE AREA NETWORKS (CODE: )

Pre Requisites:Knowledge of Computer Networks and DBMS
L-P-T:Cr.
Objecti
ve:
4-0-0: 4
To learn H/W and S/W architecture, various features of Storage area Network (SAN) as
well as its applications.
UNIT I: INTRODUCTION AND INTELLIGENT DISK SUBSYSTEMS (10 Hours)
Introduction: Server Centric IT Architecture and its Limitations; Storage Centric IT Architecture and
its advantages. Case study: Replacing a server with Storage Networks .The Data Storage and Data
Access problem; The Battle for size and Access
Intelligent Disk Subsystems: Architecture of Intelligent Disk Subsystems; Hard disks and Internal I/O
Channels; JBOD, Storage virtualization using RAID and different RAID levels; Caching: Acceleration
of Hard Disk Access; Intelligent disk subsystems, Availability of disk subsystems
UNIT II: I/O TECHNIQUES, NETWORK ATTACHED STORAGE AND FILE SYSTEM
AND NAS (10 Hours)
I/O Techniques : The Physical I/O path from the CPU to the Storage System; SCSI; Fibre Channel
Protocol Stack; Fibre Channel SAN; IP Storage
Network Attached Storage: The NAS Architecture, The NAS hardware Architecture, The NAS Software
Architecture, Network connectivity, NAS as a storage system.
File System and NAS: File System and NAS:Local File Systems; Network file Systems and file servers;
Shared Disk file systems; Comparison of fibre Channel and NAS.
UNIT III: STORAGE VIRTUALIZATION AND SAN ARCHITECTURE & HARDWARE
DEVICES (10 Hours)
Storage Virtualization: Definition of Storage virtualization; Implementation Considerations; Storage

virtualization on Block or file level; Storage virtualization on various levels of the storage Network;
Symmetric and Asymmetric
Storage virtualization in the Network
SAN Architecture and Hardware devices : Overview, Creating a Network for storage; SAN Hardware
devices; The fibre channel switch; Host Bus Adaptors; Putting the storage in SAN; Fabric operation
from a Hardware perspective.
UNIT IV: SOFTWARE COMPONENTS OF SAN AND MANAGEMENT (10
Hours)
Software Components of SAN: The switchs Operating system; Device Drivers; Supporting the switchs
components; Configuration options for SANs.
Management: Planning Business Continuity; Managing availability; Managing Serviceability; Capacity
planning; Security considerations
TEXT BOOKS:
1. Ulf Troppens, Rainer Erkens and Wolfgang Muller: Storage Networks, Wiley India, 2007
2.
Robert Spalding: Storage Networks The Complete Reference, Tata McGraw-Hill, 2003.
REFERENCE BOOKS:
1.
Richard Barker and Paul Massiglia: Storage Area Network Essentials A Complete Guide to
understanding and Implementing SANs, John Wiley India, 2002
INFORMATION THEORY AND CODING (CODE: )

Pre Requisites:
L-P-T:Cr.
4
Objecti
ve:
UNIT I:INFORMATION THEORY AND SOURCE CODING( Hours)
Introduction to Information Theory, Uncertainty and Information, Mutual Information and
Entropy,Source Coding, Huffman Coding, Shannon-Fano-Elias Coding, Arithmetic Coding, LempelZivAlgorithm, Run Length Encoding, Channel Capacity, Channel Coding, Information Capacity
Theorem,The Shannon Limit.
UNIT II:ERROR CONTROL CODING (CHANNEL CODING)( Hours)

Error Correcting Codes, Matrix Description of Linear Block Codes, Equivalent Codes, Parity
CheckMatrix, Syndrome Decoding, Perfect codes, Hamming Codes, Cyclic Codes, Brust Error
Correction,Fire Codes, Golay Codes
UNIT III:BCH, CONVOLUTION AND TRELLIS( Hours)

Bose-ChaudhriHocquenghem (BCH) codes, Decoding of BCH codes, Reed-Solomon
Codes,Convolution Codes, Polynomial description , Turbo Codes , Turbo Decoding, Introduction to
TCM,Performance Evaluation forAEGN Channel.
UNIT IV:COMPRESSION TECHNIQUES, AUDIO AND VIDEO

CODING( Hours)
Principle of Data Compression, Text Compression, Image Compression (GIF, TIFF,JPEG), Image
AudioCoders, Videp Compression, MPEG Video Standards ( MPEG 1,2,3 and MP-3 Standrad Sounds.
TEXT BOOKS
1. Information Theory, Coding and Cryptography, Ranjan Bose 2 nd Edition, The
McGraw-Hill.
REFERENCE BOOKS:
1. Information theory and Coding, Norman Abramson, McGraw-Hill electronic
Seriesr.
2. Information Coding Techniques, Dr. J. S. Chitode, Technical Publication.
WIRELESS COMMUNICATIONS (CODE: )

Pre Requisites:
L-P-T:Cr.
4
Objecti
ve:
UNIT I:(8Hours)
Evolution of mobile radio communication, mobile radio telephony in entire world,
examples of
wireless communication system, 2G cellular networks, 3G wireless networks, WLL,
LMDS, WLAN,
PAN
UNIT II:(12 Hours)

Frequency reuse, channel assignment strategies, hand off strategy, interference &
system capacity,
trunking& grade of service, improving coverage & capacity in cellular system,
introduction to radio
wave propagation, three basic propagation mechanisms, reflection, ground
reflection model (two
ray), Okumura model, Hata model.
UNIT III:(10 Hours)

Small scale multipath propagation, Types of small scale fading, Rayleigh &Rician
Distribution, AM,
FM, PM, linear modulation techniques, constant envelope modulation, hybrid
modulation, spread
spectrum modulation.
UNIT IV:(10Hours)
Equalization, training an adaptive equalizer, diversity technique, Rake receiver,
multiple
access,
FDMA, TDMA, CDMA, capacity of cellular system.
TEXT BOOKS:
1. Wireless Communication, T. S. Rappaport, PHI
REFERENCE BOOKS:
WIRELESS SENSOR NETWORKS (CODE: )

Pre Requisites:
L-P-T:Cr.
3-0-1: 4
Objecti
ve:
UNIT I: ( Hours)
Networked wireless sensor devices, Applications, Key design challenges.
Network deployment: Structured versus randomized deployment, Network topology,
Connectivity, Connectivity using power control, Coverage metrics, Mobile deployment.
UNIT II: ( Hours)
Localization: issues & approaches, Coarse-grained & Fine-grained node localization,
Network-wide localization, Theoretical analysis of localization techniques.
Synchronization: Issues & Traditional approaches, Fine-grained clock synchronization, and
Coarse-grained data synchronization.
UNIT III: ( Hours)
Wireless characteristics: Basics, Wireless link quality, Radio energy considerations, SINR
capture model for interference.
Medium-access and sleep scheduling: Traditional MAC protocols, Energy efficiency in MAC
protocols, Asynchronous sleep techniques, Sleep-scheduled techniques, and Contention-free
protocols.
Sleep-based topology control: Constructing topologies for connectivity, constructing
topologies for coverage
UNIT IV: ( Hours)
Routing: Metric-based approaches, Routing with diversity, Multi-path routing, Lifetimemaximizing energy-aware routing techniques, Geographic routing, Routing to mobile sinks.
Data-centric networking: Data-centric routing, Data-gathering with compression, Querying,
Data-centric storage and retrieval, The database perspective on sensor networks.
Introduction to Tiny OS, NesC, Sensor Simulator,
REFERENCE BOOKS:
1. Wireless Sensor Networks: Technology, Protocols, and Applications: KazemSohraby,
Daniel Minoli, TaiebZnati , Wiley Inter Science.
2. Wireless Sensor Networks: Architectures and Protocols: Edgar H. Callaway, Jr. Auerbach
Publications, CRC Press.
3. Wireless Sensor Networks: Edited by C.S Raghavendra, Krishna M, Sivalingam,
TaiebZnati , Springer.
4. Networking Wireless Sensors: BhaskarKrismachari, Cambridge University Press
5. Distributed Sensor Networks: A Multiagent Perspective, Victor Lesser, Charles L. Ortiz,
and MilindTambe , Kluwer Publications.
6. Wireless Sensor Networks: An Information Processing Approach- by Feng Zhao, Leonidas
Guibas , Morgan Kaufmann Series in Networking 2004.
ADVANCED COMPUTER ARCHITECTURE (CODE: )

Pre Requisites:Digital Electronics, Computer Architecture
L-P-T:Cr. 3-0-1: 4
Objecti Objective of the course is to study advanced computer system
ve:
architectures.
UNIT I: ( Hours)
Fundamentals of computer design, measuring and reporting performance.
Principles of linear pipelining; Instruction level parallelism and instruction pipelines, speedup,
data dependency hazards, remedial measures, branch handling; Arithmetic pipelines; Pipeline
control methods; Job sequencing, collision prevention and pipeline chaining; Case study of
pipelined systems.
UNIT II: ( Hours)
Loop unrolling, software pipelining and trace scheduling techniques for exposing instruction
level parallelism.
Dynamic scheduling algorithms, exploiting ILP using static scheduling and dynamic
scheduling, hardware based speculation, multiple issues, and speculation.
UNIT III: ( Hours)
Vector processing characteristics and requirements, pipelined vector processing, vectorization
methods, examples of vector processing.
Array processing, SIMD array processors, communication between PEs, SIMD interconnection
networks, algorithms for array processing.
Data and control parallelism, concurrency, scalability, speedup and Amdahls law, PRAM
model of parallel computation, parallel algorithms.
UNIT IV: ( Hours)
Multiprocessors and multi-computers; Processor organizations: mesh, binary tree, hypercube;
Interconnection Structures; Shared memory and message passing systems; Mapping and
Scheduling: Embedding of task graphs in processor graphs, dilation and loading, load
balancing, models for static and dynamic scheduling.
Overview of parallel programming using MPI and Open MP.
TEXT BOOKS
1. Hwang, K., Advanced Computer Architecture, Tata McGraw-Hill.
2. Hennessy, J. L. and Patterson, D. A., Computer Architecture, Morgan Kaufmann.
REFERENCE BOOKS:
3. Sima, D., Fountain, T. and Kacsuk, P., Advanced Computer Architecture: A Design
Space Approach, Pearson Education.
4. Michael, J.Q., Parallel Computing: Theory and Practice, TataMcGraw-Hill.
ADVANCE OPERATING SYSTEMS (CODE: )

Pre Requisites:
Objecti
ve:
L-P-T:Cr. 3-0-1: 4
The main objective of studying this course is to understand concept distributed
systems; clock synchronization issues, mutual exclusion, deadlock, resource
management, system failure and fault tolerance, system protection model in
distributed system.
UNIT I: INTRODUCTION, THEORITICAL FOUNDATION

(9Hours)
Overview:Concepts, architecture, issues in distributed OS, communication model: message
passing, RPC, Theoretical Foundations: Physical clocks, Logical clock, vector clock, happened
before relation, major property of the clocks. Applications of clock synchronization: causal
ordering of messages (Birman-Schiper-Stephenson, and Schiper-Eggli-Sandoz protocols)
Global state: consistent global state, (chandy-lamports global state recording algorithm), Cuts
in distributed computation, Huang's termination detection algorithm.
UNIT II: MUTUAL EXCLUSION, DEAD LOCK, AND AGREEMENT
PROTOCOLS (14 Hours)
Distributed Mutual Exclusion: What is it? Mutual Exclusion in uniprocess system/shared
memory systemvs Distributed systems.System Model, requirements, performance metrics.
Algorithms: Lamport's algorithm,Ricart-Agrawala algorithm,Maekawas Quorum based
algorithm, Suzuki-Kasami Broadcast Algorithm,Raymond's Tree-Based Algorithm, Singhals
heuristic algorithm.
Distributed Deadlock Detection: Preliminaries, handling strategies, control organizations,
Algorithms : Centralized control (Completely centralized control, Ho-Ramamurthy
algorithms), Distributed deadlock detection (Path pushing, Edge-chasing algorithms, diffusion
computation based algorithms), Hierarchal deadlock detection (Ho-Ramamurthy algorithms).
Agreement Protocols : Introduction, System model, classifications (Byzantine, consensus, and
interactive agreement protocols), Lamport's algorithm, Dolev et alia Algorithm. Applications of
agreement protocols.
UNIT III: DISTRIBUTED RESOURCE MANAGEMENT
(10 Hours)
Distributed File Systems: Architecture, Mechanism for building Distributes file system, Design
issues, Case studies (SUN NFS, SPRITE).
Distributed Shared Memory: Architecture, advantages, Algorithms : Central server approach,
Migration algorithm, Read replication algorithm, Full replication algorithms, Memory
coherence (Introduction only).
Distributed Scheduling: Introduction, motivation, Issues in load distribution, components of
load distribution, Load distributing algorithms (Sender-initiated, Receiver-initiated algorithm),
Task Migration, issues in task migration
UNIT IV: FAILURE RECOVERY, FAULT TOLERENCE, AND RESOURCE

SECURITY AND PROTECTION (12Hours)
Failure Recovery: Types of failure, Backward and forward error recovery, Recovery in
concurrent systems (Orphan message and the Domino effect, Lost messages, Livelocks).
Checkpoints : consistent, and strongly consistent state of checkpoints.
Fault Tolerance : Introduction, issues, two-phase commit protocols, non-blocking commit
protocols, Voting protocols.
Access and Flow Control: Introduction, The access matrix model, Safety in the access matrix
model, Lattice model and information flow.
TOTAL: 46 Hours
TEXT BOOKS:
1. Singhal, Mukesh& N.G. Shivaratri, Advanced Concepts in Operating
Systems, TMH.
REFERENCE BOOKS:
2.
3.
4.
5.
P. K. Sinha, Distributed Operating Systems PHI, 1998.

A.S. Tanenbaum, Modern Operating Systems, PHI
G. Coluris, Distributed Systems-Concepts and Design.
Chow, Johnson, Distributed Operating Systems, Addison-Wesley
(PROGRAMME ELECTIVES)
WEB TECHNOLOGY (CODE: )

Pre Requisites:
L-P-T:Cr.
Objecti
ve:
3-0-1:4
To introduce various web technologies being used in World Wide Web.

Students should be able to
understand basics behind web servers and various HTTP Protocols

used in WWW
Design front-ends using HTML,CSS & XML
use client side scripting using Javascript and Javascript
Frameworks
use Server side scripting using PHP along with database supported
applications
UNIT I: WEB ESSENTIALS: CLIENTS, SERVERS AND

COMMUNICATION. ( Hours)
Introduction to Internet, TCP/IP, UDP, DNS, World Wide Web: HTTP
Request & Response message, Web Clients and servers
UNIT II: HTML, XML & CSS( Hours)

HTML tags headings, text formatting, images, Links, lists, tables,
forms, XHTML,introduction to CSS, syntax, Text properties, Layouts,
Style properties, XML Documents, XSLT
UNIT III: JAVASCRIPT & DOCUMENT OBJECT MODEL( Hours)

Introduction to JavaScript, syntax, operators, Literals, Functions,
Objects, Arrays, DOM, Document Tree, DOM Event Handling , AJAX
UNIT IV:SERVER SIDE SCRIPTING:PHP( Hours)

Introduction to PHP, Syntax, Integration to MySQL, OOP with PHP,
Cookies and Sessions
TEXT BOOKS:
1. Web Technologies: A Computer Science Perspective, Jeffrey C.
Jackson, Pearson Education
2. PHP6 and MySQL6 Bible, Steve Suehring, Tim Converse, Joyce Park
Wiley Publishing Inc.
REFERENCE BOOKS:
1. Web Standards Programmers Reference: HTML, CSS, JavaScript Perl, Python and
PHP, Steven M. Schafer, Wiley Publishing Inc.
PATTERN RECOGNITION (CODE: CS 6010 )

Pre Requisites:
L-P-T:Cr.
3-0-1: 4
Objecti
ve:
UNIT I: ( Hours)
Basics of pattern recognition: Model, System, System Design issues, learning and adaption
methods, Mathematical review.
Bayesian decision theory: Classifiers, Discriminant functions, Decision surfaces,
Normal density and discriminant functions, discrete features.
UNIT II: ( Hours)
Parameter estimation methods: Maximum-Likelihood estimation, Gaussian mixture models,
Expectation-maximization method, Bayesian parameter estimation.
Hidden Markov models for sequential pattern classification: Markov process, Markov chain,
First order HMM, Forward/Backward algorithm, Viterbi algorithm, Baum-Welch algorithm.
UNIT III: ( Hours)
Non-parametric techniques for density estimation: Parzen-window method, K-Nearest
Neighbor method, Probabilistic Neural Networks.
Dimension reduction methods:Fisher discriminant analysis,Principal component analysis.
Linear discriminant function based classifiers:Perception, Support vector machines
Artificial Neural Networks: Feed forward Multilayer neural networks, learning by
Backpropagation.
UNIT IV: ( Hours)
Non-metric methods for pattern classification:Non-numeric data or nominal data, Decision
trees (CART, ID3, C4.5).
Unsupervised learning and clustering :Criterion functions for clustering, Algorithms for
clustering: K-means, Hierarchical.
TEXT BOOKS
1. R.O.Duda, P.E.Hart and D.G. Stork, Pattern Classification, John Wiley.
REFERENCE BOOKS:
1. S. Theodoridis and K. Koutroumbas, Pattern Recognition, Academic Press

2. C.M. Bishop, Pattern Recognition and Machine Learning, Springer.
3. V Susheela Devi, M Narasimha Murty, Pattern Recognition An Introduction, University
Press
COMPUTER AND INFORMATION SECURITY (CODE: )

Pre Requisites:Operating system, Computer Networks, basics of web
computing, Coding Theory or basics of cryptography
L-P-T:Cr. 4-0-0:4
Objecti
ve:
UNIT I: SECURITY ATTACKS ( Hours)
Security Attacks (Interruption, Interception, Modification and Fabrication), Security Services
(Confidentiality, Authentication, Integrity, Non-repudiation, access Control and Availability)
and Mechanisms, A model for Internetwork security, Internet Standards and RFCs, Buffer
overflow &format string vulnerabilities, TCP session hijacking, ARP attacks, route table
modification, UDP hijacking, and man-in-the-middle attacks.
UNIT II: CRYPTOGRAPHY( Hours)
Conventional Encryption Principles, Conventional encryption algorithms, cipher block modes
of operation, location of encryption devices, key distribution Approaches of Message
Authentication, Secure Hash Functions and HMAC.
Public key cryptography principles, public key cryptography algorithms, digital signatures,
digital Certificates, Certificate Authority and key management Kerberos, X.509 Directory
Authentication Service.
UNIT III: EMAIL PRIVACY AND IP SECURITY( Hours)
Email privacy: Pretty Good Privacy (PGP) and S/MIME.
IP Security Overview, IP Security Architecture, Authentication Header, Encapsulating Security
Payload, Combining Security Associations and Key Management
UNIT IV:WEB SECURITY, FIREWALL, AND IDS ( Hours)
Web Security Requirements, Secure Socket Layer (SSL) and Transport Layer Security(TLS),
Secure Electronic Transaction (SET).
Basic concepts of SNMP, SNMPv1Community facility and SNMPv3, Intruders, Virusesand
related threats.
Firewall Design principles, Trusted Systems, Intrusion Detection Systems
TEXT BOOKS:
1. Michael E. Whitman and Herbert J. Mattord: Principles of Information Security, 2 nd
Edition, Thomson, 2005.
2. Security in Computing, Charles B. Pfleeger and Shari Lawrence Pfleeger, Pearson
Education.
REFERENCE BOOKS:
1. Network Security Essentials (Applications and Standards) by William Stallings Pearson
2.
3.
4.
5.
Education.
Cryptography and Network Security, Behrouz A. Forouzan, Tata McGraw Hill, 2007.
CryptographyandnetworkSecurity,Stallings,PHI/Pearson
NetworkSecurity:Thecompletereference,RobertBragg,MarkRhodes,TMH
Introduction to Cryptography, Buchmann, Springer.
SOFT COMPUTING (CODE: )

L-P-T:Cr.
Objecti
ve:
UNITI: (8 Hours)
Introduction to soft computing. Applications of Artificial Neural Networks, fuzzy logic,
genetic algorithms and other soft-computing techniques. Their strengths and weaknesses.
Synergy of soft computing techniques. Artificial neural networks : over view of history,
Mathematical Models of Neurons, ANN architecture.
UNIT-II: (8 Hours)
Introduction to artificial neural network
Neural Networks: Learning rules, Learning Paradigms-Supervised, Unsupervised and
reinforcement Learning, ANN training Algorithms-perceptions, Training rules, Delta, Back
Propagation Algorithm, Multilayer Perceptron Model, Competitive learning networks,
Kohonen self organizing networks, Hebbian learning; Hopfield Networks,
UNIT-III: (8 Hours)
Fuzzy Logic: Introduction to Fuzzy Logic, Classical and Fuzzy Sets: Overview of Classical
Sets, Membership Function, Fuzzy rule generation. Operations on Fuzzy Sets: Compliment,
Intersections, Unions, Combinations of Operations, Aggregation Operations. Fuzzy Arithmetic:
Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on Intervals & Numbers, Lattice
of Fuzzy Numbers, Fuzzy Equations.
UNIT-IV: (8 Hours)
Genetic algorithms(Gas), Evolution strategies(Ess), Evolutionary programming(EP), Genetic
Programming(GP),Selecting, crossover, mutation, schema analysis, analysis of selection
algorithms; convergence; Markov & other stochastic models.
UNIT-V: (8 Hours)
Other Softcomputing approaches Simulated Annealing, Tabu Search, Ant colony based
optimization.
TEXT BOOKS:
1. Jang, Neuro-Fuzzy and Soft computing, Sun, Mizutani, Pearson
2. Haykin, Neural networks: a comprehensive foundation,
3. Goldberg, Genetic Algorithms,
4. G.J. Klir & B. Yuan, FuzzySets & Fuzzy Logic, PHI.
REFERENCE:
1. Anderson J.A., An Introduction to Neural Networks, PHI, 1999
2. Hertz J. Krogh, R.G. Palmer, Introduction to the Theory of Neural Computation,
Addison-Wesley, California,
3. Melanie Mitchell, An Introduction to Genetic Algorithm, PHI, 1998.
4. Neural Networks-A Comprehensive Foundations, Prentice-Hall International, New
Jersey, 1999
5. Freeman J.A. & D.M. Skapura, Neural Networks: Algorithms, Applications and
Programming Techniques, Addison Wesley, Reading, Mass, (1992).
PARALLEL COMPUTING (CODE: )

Pre Requisites:None
L-P-T:Cr.
4-0-0:4
Objecti
ve:
UNIT I: INTRODUCTION (8Hours)
Introduction: What is parallel and distributed computing, Scope of parallel and distributed
computing, Scope of parallel computing. Parallel Programming Platforms: implicit parallelism,
Dichotomy of parallel computing platforms, Physical organization for parallel platforms,
communication cost in parallel machines, routing mechanism for interconnection networks
UNIT II: BASIC COMMUNICATION OPERATIONS (10 Hours)
Basic Communication Operation: One-to-all broadcast; All-to-all broadcast; Reduction and
prefix sums; One-to-all personalized communication; All-to-all personalized communication.
UNIT III: PERFORMANCE AND SCALABILITY (12 Hours)
Performance and Scalability of Parallel Systems: Performance matrices for Parallel systems.
Run time, Speed up, Efficiency and Cost; The effect of granularity on performance
Sorting: Sorting networks; Bubble sort and its variants; Quicksort and other sorting
Algorithms.
UNIT IV: DYNAMIC PROGRAMMING (10 Hours)
Dynamic Programming: Overview of dynamic programming, Serial monadic DP
Formulations: The shortest path Problem, the 0/1 Knapsack Problem, Serial Polyadic DP
Formulation : all pair shortest paths algorithm
TOTAL: 40 Hours
TEXT BOOKS:
1. Vipin Kumar, Ananth Grama, Anshul Gupta and George Karypis; Introduction to
Parallel Computing, The Benjamin/Cumming Publishing Company, Inc.,
Masschachusetts.
REFERENCE BOOKS:
2. George Coulouris, Jean Dollimore and Tim Kindberg; Distributed Systems Concepts
and Design, Addison-Wesley, Masschachusetts.
3. S G Akl; The Decision and analysis of parallel algorithms, PH Englewood Cliffs, New
Jersey.
4. Advanced Computer Architecture: Parallelism, Scalability, Programmability, TMH.
5. J Jaja; An Introduction to Parallel Algorithms, Addison Wesley, Masschachusetts
6. T G Lewis and H E Rewini; Introduction to Parallel Computing, Prentice-Hall,
7. Englewood Cliffs, New Jersey.
8. M J Quinn; Parallel Computing: Theory and Practice, McGraw-Hill, New York.
ADVANCED DATABASE CONCEPTS (CODE: )

Pre Requisites:None
L-P-T:Cr.
4-0-0:4
Objecti
ve:
UNIT I:(Hours)
Introduction; Distributed Data Processing, Distributed Database System, Promises of DDBSs,
Problem areas.
Overview of Relational DBMS: Relational Database Concepts, Normalization, Integrity rules,
Relational data languages.
Distributed DBMS Architecture: Architectural Models for Distributed DBMS, DDMBS
Architecture. Distributed Database Design: Alternative Design Strategies, Distribution Design
issues, Fragmentation, Allocation
UNIT II:( Hours)
Query Processing and decomposition: Query Processing Objectives, Characterization of query
processors, layers of query processing, query decomposition, Localization of distributed data.
Distributed query Optimization: Query optimization, centralized query optimization,
Distributed query optimization algorithms
UNIT III:( Hours)
Transaction Management: Definition, properties of transaction, types of transactions.
Distributed concurrency control: Serializability, concurrency control Mechanisms &
Algorithms, Time stamped & Optimistic concurrency control Algorithms, Deadlock
Management.
Distributed DBMS Reliability: Reliability concepts and Measures, fault-tolerance in
Distributed systems, failures in Distributed DBMS, local & Distributed Reliability Protocols,
site failures and Network partitioning. Parallel Database Systems: Database Series, Parallel
Architecture, Parallel DBMS Techniques, Parallel exception problems, Parallel Execution for
Hierarchical architecture.
UNIT IV: DISTRIBUTED ODBMS AND OO DATA MODEL ( Hours)
Distributed object Database Management Systems: Fundamental object concepts and Models,
Object Distributed Design, Architectural Issues, Object Management, Distributed Object
storage, Object query Processing
Object Oriented Data Model: Inheritance, Object identity, persistent programming languages,
persistence of objects, comparing OODBMS and ORDBMS
TEXT BOOKS:
1. M.Tamer OZSU and Patuck Valduriez: Principles of Distributed Database Systems,
Pearson Edn. Asia.
REFERENCE BOOKS:
1. Stefano Ceri and Willipse Pelagatti: Distributed Databases, McGraw Hill.
2. R. Elmasri, S.B. Novathe: Fundamentals of Database Systems, Pearson Edu.
3. T. Connolly, C. Begg, Databse Systems: A Practical Approach to design,
implementation and Management.
4. Henry F Korth, A Silberchatz and Sudershan : Database System Concepts, MGH
5. Raghuramakrishnan and Johhanes Gehrke: Database Management Systems,MGH
6. Addison-Wesley, California,
DATA MINING AND DATAWAREHOUSING (CODE: )

Pre Requisites:
L-P-T:Cr.
4
4-0-0
Objecti
ve:
UNIT I:( Hours)
Introduction: Fundamentals of data mining, Data Mining Functionalities, Classification of Data
Mining systems, Major issues in Data Mining, Data Warehouse and OLAP Technology for
Data Mining Data Warehouse, Multidimensional Data Model, Data Warehouse Architecture,
Data Warehouse Implementation, Further Development of Data Cube Technology, From Data
Warehousing to Data Mining.
Data Preprocessing: Needs Preprocessing the Data, Data Cleaning, Data Integration and
Transformation, Data Reduction, Discretization and Concept Hierarchy Generation, Online
Data Storage.
UNIT II:( Hours)
Data Mining Primitives, Languages, and System Architectures: Data Mining Primitives, Data
Mining Query Languages, Designing Graphical User Interfaces Based on a Data Mining Query
Language Architectures of Data Mining Systems.
Concepts Description: Characterization and Comparison: Data Generalization and
Summarization - Based
Characterization,
Analytical
Characterization:
Analysis
of Attribute Relevance, Mining Class
Comparisons: Discriminating between DifferentClasses, Mining Descriptive Statistical
Measures in Large Databases.
UNIT III:( Hours)
Mining Association Rules in Large Databases: Association Rule Mining, Mining SingleDimensional Boolean Association Rules from Transactional Databases, Mining Multilevel
Association Rules from Transaction Databases, Mining Multidimensional Association Rules
from Relational Databases and Data Warehouses, From Association Mining to Correlation
Analysis, Constraint-Based Association Mining.
Classification and
Prediction:
Issues Regarding
Classification and
Prediction,
Classification by Decision Tree Induction, Bayesian Classification, Classification by
Backpropagation, Classification Based on Concepts from Association Rule
Mining,OtherClassification Methods, Prediction, and Classifier Accuracy.
UNIT IV:( Hours)
Cluster Analysis Introduction: Types of Data in Cluster Analysis, A Categorization of Major
Clustering Methods, Partitioning Methods, Density-Based Methods, Grid-Based Methods,
Model-Based Clustering Methods, Outlier Analysis.
Mining Complex Types of Data: Multidimensional Analysis and Descriptive Mining of

Complex, Data Objects, Mining Spatial Databases, Mining Multimedia Databases, Mining
Time-Series and Sequence Data. Mining Text Databases, Mining the World Wide Web.
TEXT BOOKS:
1. Data MiningConcepts and Techniques, Jiawei Han & Micheline Kamber, Elsevier.
2. Building the Data Warehouse-W.H.Inmon,Wiley Dreamtech India Pvt. Ltd.
REFERENCE BOOKS:
1. Data Mining TechniquesArun K Pujari, University Press
SIMULATION AND MODELING (CODE: )

Pre Requisites:
L-P-T:Cr.
4
Objecti
ve:
UNIT I:( Hours)
System definition and components, stochastic activities, continuous and discrete systems,
system Modeling, types of models, static and dynamic physical models, static and dynamic
mathematical Models, full corporate model, types of system study.
UNIT II:( Hours)
System simulation, why & when to simulate, nature and techniques of simulation, comparison
of simulation and analytical methods, types of system simulation, real time simulation,
hybrid simulation, simulation of pure-pursuit problem, single-server queuing system and
an inventory problem, Monte-Carlo simulation, Distributed Lag models, Cobweb model.
UNIT III:( Hours)
Simulation of continuous systems, analog vs. digital Simulation, Simulation of water
reservoir system, Simulation of a servo system, simulation of an autopilot, Discrete system
simulation, fixed time-step vs. even to even model, generation of random numbers, test for
randomness, Monte-Carlo computation vs. stochastic simulation.
UNIT IV:( Hours)
System dynamics, exponential growth models, exponential decay models, modified
exponential growth models, logistic curves, generalization of growth models, system dynamic
diagrams Introduction to SIMSCRIPT: Program, system concepts, origination, and statements,
defining the telephone system model.
Simulation of PERT Networks, critical path computation, uncertainties in activity
duration, resource allocation and consideration. Simulation languages and software,
continuous and discrete simulation languages, expression based languages, object oriented
simulation, general purpose vs. application - oriented simulation packages, CSMP-III,
MODSIM-III.
TEXT BOOKS:
1. Geoftrey Gordon, System Simulation, PHI
REFERENCE BOOKS:
1. Jerry Banks, John S. C Barry L. Nelson David M. Nicol, Discrete Event
System Simulation, Pearson Education.
2. V P Singh, System Modeling and simulation, New Age International.
3. Averill M. Law, W. David Kelton, System Modeling and simulation and
Analysis, TMH
PRINCIPLES OF PROGRAMMING LANGUAGES (CODE: )

Pre Requisites:
L-P-T: Cr.
3-0-1:4
Objecti
ve:
UNIT I: (10 Hours)
Introduction: Characteristics of programming Languages, Factors influencing the evolution of
programming language, developments in programming methodologies, desirable features and design
issues. Programming language processors: Structure and operations of translators, software simulated
computer, syntax, semantics, structure, virtual computers, binding and binding time.
UNIT II: (10 Hours)

Elementary and Structured Data Types, Structured data type and objects, Sub Program and programmer
defined data types: Evolution of data types, abstractions, encapsulations, information hiding, sub
programmes, abstract data types. Sequence Control; Implicit and Explicit sequence control, sequence
control with within expression and statements, recursive sub programmes, exception handling, coroutines, Scheduled sub-programmes, concurrent
execution.

Data control referencing environments, static and dynamic scope, local data local data referencing
environment, shared data: Explicit common environment dynamic scope parameter passing
mechanism.Storage Management: Major run time requirements, storage management phases, static
storage management, stack based, heap based storage
management.
UNIT IV: (10 Hours)

Syntax and translation: General syntactic criteria, syntactic element of a language, stages in translation,
formal syntax and semantics.
Introduction to Functional Programming, Lambda calculus, Data flow language and ObjectOriented
language, Comparison in various general and special purpose programming languages e.g. Fortran, C,
Pascal, Lisp, etc.
TEXT BOOKS:
1. Sebesta, "Concept of Programming Language", Addison Wesley
REFERENCE BOOKS:
1. Terrance W Pratt, "Programming Languages: Design and Implementation" PHI
2. E Horowitz , "Programming Languages", Edition, Addison Wesley
3. "Fundamentals of Programming Languages", Galgotia.
INFORMATION SYSTEM DESIGN (CODE: )

L-P-T:Cr.
Objecti
ve:
To understand the design, development and management of information systems, basics

of managing the digital firm, the design, development and maintenance of information
systems, basic issues in knowledge management and information systems, ethical and
security issues in information systems.
UNIT I: MANAGING THE DIGITAL FIRM (8 Hours)

Why information systems contemporary approaches to information systems new role of information
systems- major types of systems in organizations systems from a functional perspective enterprise
applications organizations and information systems managers decision making and information
systems information systems and business strategy.
UNIT II: DESIGNING INFORMATION SYSTEMS (8 Hours)

Systems as planned organizational change business process re-engineering and process improvement
overview of systems development alternate system Building approaches Understanding the
business value of Information Systems - The importance of change management in information system
success and failure Managing Implementation.
UNIT III: DEVELOPMENT AND MAINTENANCE OF INFORMATION SYSTEMS

(8 Hours)
Systems analysis and design System development life cycle Limitation End User Development
Managing End Users off-the shelf software packages Outsourcing Comparison of different
methodologies.
UNIT IV: KNOWLEDGE MANAGEMENT, ETHICS AND SECURITY (8 Hours)

Knowledge Management in the organization Information and Knowledge base systems Decision
-support systems Understanding ethical and Social issues packed to systems Ethics in an
Information society The moral dimensions of Information Systems System vulnerability and abuse
Creating a control environment Ensuring System Quality.
UNIT V: INFORMATION ARCHITECTURE (8 Hours)

Defining Information Architecture why Information Architecture matters Practicing Information
Architecture in the Real world Information Ecologies User needs and Behavior The anatomy of
Information Architecture Organizing Systems Search Systems.
TEXT BOOKS:
1. Lauaon Kenneth & Landon Jane, "Management Information Systems: Managing the Digital
firm", , PHI.
2. Uma G. Gupta, "Management Information Systems A Management Prespective", Galgotia
publications Pvt., Ltd.
3. Louis Rosenfel and Peter Morville, "Information Architecture for the World wide Web",
O'Reilly Associates .
REFERENCES
1. Steven Alter, "Information Systems A Management Perspective", Pearson Education.
2. Uma Gupta, "Information Systems Success in 21st Century", Prentice Hall of India.
3. Robert G. Murdick, Joel E. Ross and James R. Claggett, "Information Systems for Modern
Management", PHI.
EMBEDDED SYSTEMS (Code: )

Pre Requisites:
L-P-T:Cr.
3-0-1: 4
Objecti
ve:
UNIT I : (10 Hours)
Overview of Embedded Systems: Embedded System, Categories and Requirements of
Embedded Systems, Challenges and Issues in Embedded System Development, Applications of
Embedded Systems in various domains.
UNIT II : (10 Hours)
Embedded Design cycle: Embedded Hardware & Software Design & Development Process &
Environment: Hardware Architecture, Interfacing Processor, Memories, I/O and
Communication Interface Standards, Embedded Operating systems, Types of Embedded
Operating systems.
UNIT III : (12 Hours)
Microcontroller: 8/16/32 Bit (8051/ AVR/PIC/ARM/MSP 430) Microcontrollers and an
overview of their Architecture, Instruction set, Interface & Applications. Programming
Concepts and Embedded Programming in C for Device Drivers for interfacing LCD, ADC,
sensors, stepper motor, key board, DAC, memory.
Embedded System-on Programmable Chip (SOPC): FPGA based soft & hard processor,
Embedded Software development on FPGA
UNIT IV: (12 Hours)
Embedded real time operating systems: Typical real time applications, Hard Vs Soft realtime systems, A reference model of Real Time Systems: Inter-process Communication and
Synchronization of Processes, Tasks and Threads- Multiple Process in an Application, Problem
of Sharing data by multiple tasks & routines, Scheduling, Commonly used Approaches to
Real Time Scheduling Clock Driven, Weighted Round Robin, Priority Driven, Dynamic Vs
State Systems, Effective release time and Deadlines, Offline Vs Online Scheduling.
Embedded systems case studies.
TEXT BOOKS:
1. Embedded Systems Architecture, Programming and Design, Second Edition, Raj
Kamal, Tata Mc-Graw Hill
2. The 8051 Microcontroller and Embedded Systems using Assembly and C, Mazidi,
Mazidi, McKinlay, Second Edition, Pearson Education.
3. PIC Microcontroller and Embedded Systems using assembly and C for PIC18, Mazidi,
MCKINLAY, CAUSEY, Pearson Education.
4. ARM Systems Developers Guides- Design & Optimizing System Software - Andrew
N. Sloss, Dominic Symes, Chris Wright, 2004, Elsevier.
5. Jean J. Labrosse, Embedded Systems Building Blocks: Complete and Ready-To-Use

Modules in C, The publisher, Paul Temme, 2003.
REFERENCE BOOKS:
1. Introduction to Embedded Systems, Shibu K V, Tata Mc-Graw Hill.
2. PIC Microcontroller by H.W Huang, Delmar CENGAGE Learning, 2007.
3. J B Peatman, Design with PIC Microcontrollers, Prentice Hall.
4. Dr.K.V.K.K.Prasad, 'Embedded/Real-Time Operating System',Dreamtech Press(for
Units I,II &III).
5. Daniel W. Lewis, Fundamentals of Embedded Software where C and Assembly meet,
PHI, 2002.
6. Steave Furber, ARM system on chip architecture Addison Wesley, 2000.
INFORMATION RETRIEVAL AND WEB SEARCH

(CODE: )
Pre Requisites:
Objecti
ve:
L-P-T:Cr. 4-0-0: 4
This course will cover traditional material, as well as recent advances in
Information Retrieval (IR), the study of indexing, processing, and querying
textual data. Basic retrieval models, algorithms, and IR system implementations
will be covered. It will also cover web search, link analysis.
UNIT I: INTRODUCTION (8 Hours)

Introduction to course: Discussion of issues in search, Introduction to Information Retrieval.
Inverted indices and Boolean queries. Query optimization. The nature of unstructured and
semi-structured text. Course administrivia.
The term vocabulary and postings lists. Text encoding: tokenization, stemming, lemmatization,
stop words, phrases. Optimizing indices with skip lists. Proximity and phrase queries.
Positional indices.
UNIT II: INDEX CONSTRUCTION AND SCORING (8 Hours)
Index construction. Postings size estimation, sort-based indexing, dynamic indexing, positional
indexes, n-gram indexes, distributed indexing, real-world issues.
Index compression: lexicon compression and postings lists compression. Gap encoding,
gamma codes, Zipf's Law, variable-byte encoding. Blocking. Extreme compression.
Dictionaries and tolerant retrieval. Dictionary data structures. Wild-card queries, permuterm
indices, n-gram indices. Spelling correction and synonyms: edit distance, soundex, language
detection.
Scoring, term weighting, and the vector space model. Parametric or fielded search. Document
zones. The vector space retrieval model. TF/IDF weighting. The cosine measure. Scoring
documents.
UNIT IV: COMPUTING SCORES AND RESULTS SUMMARIES (8 Hours)
Computing scores in a complete search system: Components of an IR system. Efficient vector
space scoring. Nearest neighbor techniques, reduced dimensionality approximations, random
projection.
Results summaries: static and dynamic. Evaluating search engines. User happiness, precision,
recall, F-measure. Creating test collections: kappa measure, inter judge agreement. Relevance,
approximate vector retrieval
Probabilistic IR. Binary Independence Model.

UNIT IV: CLASSIFICATION AND LEARNING (10 Hours)
CLASSIFICATION : Introduction to text classification. Naive Bayes models. Spam filtering.
Probabilistic IR. K Nearest Neighbors, Decision boundaries, Vector space classification using centroids.
Support vector machine classifiers. Kernel Function. Evaluation of classification. Micro- and
macro-averaging. Learning rankings.
CLUSTERING: Introduction to the problem. Partitioning methods: k-means clustering;
Hierarchical clustering. Learning to rank. Latent semantic indexing (LSI). Applications to
clustering and to information retrieval.
UNIT V: WEB SEARCH AND LINK ANALYSIS (8 Hours)
Web search overview, web structure, the user, paid placement, search engine optimization/spam. Web
size measurement.
Link analysis, Crawling and web indexes. Near-duplicate detection.

TOTAL: 42 Hours
TEXT BOOKS:
1 Introduction to Information Retrieval, Christopher D. Manning, Prabhakar Raghavan,
Hinrich Schtze, Cambridge University Press.
REFERENCE BOOKS:
1 Readings in Information Retrieval, K.Sparck Jones and P. Willet, Morgan Kaufmann.
2 Modern Information Retrieval, Ricardo BaezaYates and Berthier Ribeiro Neto, Ricardo
Baeza-Yates and Berthier Ribeiro-Neto Addison-Wesley.
(HSS ELECTIVES)
ENVIRONMENT & ECOLOGY (CODE: )

Pre Requisites:
Objecti
ve:
L-P-T:Cr. 3-0-0:3
To understand concepts concept on environment and ecology, concept of
population, community and biodiversity, concept on environmental problems
and management strategies.
UNIT-I: CONCEPT ON ENVIRONMENT AND ECOLOGY (10 Hours.)

a) Environment: Biotic and abiotic; lithosphere, pedosphere, hydrosphere,
atmosphere, biosphere and their interrelationship; Rock cycle, Biogeochemical
cycles and global climates;
b) Ecology: Concepts on Ecology, Ecosystem,
Ecological spectrum, Ecosystem structure and function, Classification of
Ecosystem, Natural vs. Manmade ecosystems, Ecotone and Edge effect; c) Food
Chain and Energy flow: Food chain, food web, energy flow, ecological pyramids
and types, ecosystem productivity (primary and secondary), food distribution.
UNIT-II: CONCEPT OF POPULATION, COMMUNITY AND BIODIVERSITY

(10 Hours.)
a) Population and Community: Concepts, growth modules, reproductive potential,
logistic equation, biotic potential, net reproduction rate, natality, mortality, life
table, survivorship curve, population age and structure; definition of community,
community characteristics, dynamics and succession b) Biodiversity: Concept,
definition; genetic, species, ecosystem and landscape diversity; latitudinal

gradient in biodiversity, biodiversity as resource bars; biodiversity and
environmental stability; biodiversity hot spot, mega-diversity country,
conservation strategy for biodiversity.
UNIT-III: CONCEPT ON ENVIRONMENTAL PROBLEMS AND MANAGEMENT
STRATEGIES (10 Hrs. )
Energy resource and its consumption; Global warming, climate change, carbon
sequestration, green house gases and their effects, ozone hole, acid rain; air,
water and soil pollution; population, its effect and management; sustainable
development, green technology; Models on pollution control and management,
Ecological modeling; Use of GIS and Remote sensing technology in Environmental
management.
REFERENCE BOOKS:
1. Dash, M.C. and Dash, S.P. (2009). Fundamentals of Ecology. Tata Mcgraw Hill
Education Pvt. Ltd., New Delhi, p.562.
2. Arthur N. Strahler and Alan H. Strahler (1973). Environmental Geoscience,
Hamilton Publishing Company, Santa Barbara, California.
3. Garg, S.K. (2010). Ecology and Environmental Studies for Environmental
Science and Engineering, Khanna Publishers, New Delhi, p.712
4. Trivedi, R.K. and Goel, P.K. (2012). An Introduction to Air pollution, B.S.
Publications, Hyderabad, p.284.
5. Rajagopalan R.(2009). Environment and Ecology, UPTU. P.232
6. Rajagopalan R.(2011). Environmental Studies: From Crisis to Cure
ENGINEERING ECONOMICS (CODE:)

Pre Requisites:
L-P-T:Cr.
3-0-0:3
Objecti
ve:
UNIT I: ( Hours)
Introduction :Nature and scope of Economics - role of wealth, welfare and optimization, Basic
concepts - choice, utility, cost, revenue, value, price, notion of equilibrium,demand and supply,
Market and its classifications.
Demand and Supply Analysis : Consumer preferences and indifference curve analysis substitution, income andpriceeffects, Demand and Supply curves, market equilibrium and their
shifts, Elasticity of demand and supply.
UNIT II:
( Hours)
Production and Cost: Short-run production function and returns to a factor-average marginal
relationship, Long- production function and laws of returns to scale - role of technology, Two
input one output model - isoquant analysis, Two input one output model - isoquant analysis,
One input two output model - Production possibility frontier, Cost function and the cost
structure of a firm in the short run, Long run cost function and cost structure - concepts of life
cycle cost.
Price Output Determination: Perfect competition including shut-down and break-even points,
Monopoly, Monopolistic competition and product differentiation, Duopoly and oligopoly, Price
discrimination
Capital Market and Investment Decisions: Financing investments - ploughback, issuing new
shares, bonds, convertibles, directloansetc., Cost of capital - the debt, equity and weighted cost,
Investment criteria: Pay back, NDPV, IRR and Profitability index., Risk management - finite
horizon method, discounting for risk, profitability approach,sensitivity analysis and decision
theory.
UNIT III:
( Hours)
Resource Accounting and Sustainability: National Income - concepts and estimation - value
added method, Alternative approaches to national income - factor payments expenditure
methods, Sustainable development - dwindling natural resources, environment and
sustainability.
Trade, Aid and Development: Balance of trade payments, external stability, Foreign Capital
and collaborations - financial and technological, towards a global economy - GATT, WTO,
etc., Patent laws and intellectual property rights.
TEXT BOOKS:
REFERENCE BOOKS:
ORGANIZATIONAL BEHAVIOUR (CODE: )

Pre Requisites:
L-P-T:Cr.
3-0-0:3
Objecti
ve:
UNIT I: FOCUS, PURPOSE AND INDIVIDUAL BEHAVIOUR (12 Hours)
Definition, need and importance of organizational behaviour Nature and scope Frame work
Organizational behaviour models.
Personality types Factors influencing personality Theories Learning Types of learners
The learning process Learning theories Organizational behaviour modification.
Misbehaviour Types Management Intervention. Emotions - Emotional Labour Emotional
Intelligence Theories. Attitudes Characteristics Components Formation
Measurement- Values. Perceptions Importance Factors influencing perception
Interpersonal perception- Impression Management. Motivation importance Types Effects
on work behavior.
UNIT II: GROUP BEHAVIOUR, LEADERSHIP AND POWER (12 Hours)
Organization structure Formation Groups in organizations Influence Group dynamics
Emergence of informal leaders and working norms Group decision making techniques
Team building - Interpersonal relations Communication Control.
Meaning Importance Leadership styles Theories Leaders Vs Managers Sources of
power Power centers Power and Politics.
UNIT II: DYNAMICS OF ORGANIZATIONAL BEHAVIOUR (8 Hours)
Organizational culture and climate Factors affecting organizational climate Importance. Job
satisfaction Determinants Measurements Influence on behavior. Organizational change
Importance Stability Vs Change Proactive Vs Reaction change the change process
Resistance to change Managing change. Stress Work Stressors Prevention and
Management of stress Balancing work and Life. Organizational development
Characteristics objectives . Organizational effectiveness
TOTAL: 32 Hours
TEXT BOOKS:
1. Stephen P. Robins, Organisational Behavior, PHI Learning / Pearson Education.
2. Fred Luthans, Organisational Behavior, McGraw Hill.
REFERENCE BOOKS:
1. Schermerhorn, Hunt and Osborn, Organisational behavior, John Wiley.
2. Udai Pareek, Understanding Organisational Behaviour, Oxford Higher Education.
3. Mc Shane & Von Glinov, Organisational Behaviour, Tata Mc Graw Hill.
4. Hellrigal, Slocum and Woodman, Organisational Behavior, Cengage Learning.
5. Ivancevich, Konopaske & Maheson, Oranisational Behaviour & Management Tata
McGraw Hill.
INTRODUCTION TO LOGIC
Pre Requisites: Basic set theory operations
L-P-T:Cr.
3-0-0:3
Objecti
ve:
UNIT I: MATHEMATICAL LOGIC (8 Hours)
Aristotelian Logic: Aristotle's Logical Works: The Organon, The Syllogistic.
Propositional Logic: Basic connectives, Truth tables, Logical equivalence, Laws of Logic,
Logical implications, Rules of inferences, normal forms, application to network problems.
Predicate Logic: Use of quantifiers, arguments, Quantified arguments, Quantified rules of
inferences, Predicate Calculus, First ordered predicate calculus
UNIT II: MODAL LOGIC, PHILOSOPHICAL LOGIC, INFORMAL
REASONING (10 Hours)
Introduction to Modal logic: Syntax, semantic and resolution with examples.
Introduction to Philosophical Logic.
Informal Reasoning: Inductive Arguments, Analogical Reasoning, Causal Reasoning.
UNIT III: BOOLEAN LOGIC (8 Hours)
Boolean formulae, WFF and its Properties, Inductive definitions and Theorems, Proofs of
theorems, Hilbert style proofs, Equation style proofs, Deduction theorems, Soundness, Posts
Theorem, Resolution in Boolean Logic.
UNIT IV: COMPUTAIONAL LOGIC(8 Hours)
Computational Logic: Induction, Recursion, Tableau deduction, Natural deduction, Decision
procedures, Completeness, compactness, decidability, expressivity, BDD-based algorithms.
TOTAL : 34 Hours
TEXT /REFERENCE BOOKS:
1. Mathematical logic by george tourlakis, a john wiley & sons, inc., publication.
2. Discrete mathematical structures with applications to computer science by j.p.tremblay
and r. Manohar (tata mcgraw-hill).
3. Mathematical foundation of computer science by y.n. Singh (new age international (p)
limited).
4. A course in mathematical logic by j. L. Bell and m. Machover, north-holland publishing
company
5. Handbook of Modal Logic, Patrick Blackburn, Johan F.A.K. van Benthem, Frank
Wolter, Elsevier, 2006
6. Modal Logic: An Introduction, Brian F. Chellas, Cambridge University Press
LIFE AND PSYCHOLOGY
L-P-T:Cr. 3-0-0:3
Objecti
ve:
UNIT I: (10 Hours)
An Introduction to the course, The Biological basis of the behaviors, senses and perceptions,
consciousness, Learning, Memory
UNIT II: (10 Hours)
Cognition and Intelligence, topics in development in Psychology, Emotions and motivations,
Sex and gender, Personality.
Stress and Coping, Mental disorders, Psychological counseling and Psychotherapy, Topics in
Social Psychology.
TEXT /REFERENCE BOOKS:
ENTREPRENEURIAL MANAGEMENT (CODE: )

Pre Requisites:None
L-P-T:Cr.
4-0-0:4
Objecti
ve:
UNIT I:(Hours)
Entrepreneur: Definition. Growth of small scale industries in developing countries and their
positions vis-a-vislarge industries; role of small scale industries in the national economy;
characteristics and types of small scale industries; demand based and resources based
ancillaries and sub-control type. Government policy for small scale industry; stages in starting
a small scale industry
UNIT II:( Hours)
Project identification: Assessment of viability, formulation, Evaluation, financing, field-study
and collection of information, preparation of project report, demand analysis, material balance
and output methods, benefit cost analysis, discounted cash flow, internal rate of return and net
present value methods.
UNIT III:( Hours)
Accountancy: Preparation of balance sheets and assessment of economic viability, decision
making, expected costs, planning and production control. Quality control. marketing,
industrial relations. Sales and purchases, advertisement, wages and incentive, inventory
control, preparation of financial reports, accounts and stores studies.
UNIT IV:( Hours)

Project Planning and control: The financial functions, cost of capital approach in project
planning and control. Economic evaluation, risk analysis, capital expenditures, policies and
practices in public enterprises. Profit planning and programming, planning cash flow, capital
expenditure and operations, control of financial flows, control and communication.
Laws concerning entrepreneur: Partnership laws, business ownership, sales and income taxes
and workman compensation act. Role of various national and state agencies which render
assistance to small scale industries.
TEXT BOOKS:
1. Joseph, L. Massod, " Essential of Management", Prentice Hall of India
(INDUSTRIAL ELECTIVES)
BUSINESS INTELLIGENCEDATA WAREHOUSING AND ANALYTICS
(CODE: )
Number of Weeks
12 14 Weeks
Total Lecture hours*

40
Total Tutorial hours

8
Total Credit
3
Pre Requisites: Basic knowledge of RDBMS (relational database management system)

concepts with hands-on exposure (includes design & implementation of table structures).
Learning outcomes
At the end of this elective, student will be able to:
1. Differentiate between Transaction Processing and Analytical applications and describe the need
for Business Intelligence
2. Demonstrate understanding of technology and processes associated with Business Intelligence
framework
3. Demonstrate understanding of Data Warehouse implementation methodology and project life
cycle
4. Given a business scenario, identify the metrics, indicators and make recommendations to
achieve the business goal
5. Design an enterprise dashboard that depicts the key performance indicators which helps in
decision making
6. Demonstrate application of concepts using open source/MS Office
UNIT I: INTRODUCTION TO BUSINESS INTELLIGENCE (8 Hours)
Introduction to digital data and its types structured, semi-structured and unstructured, Introduction to
OLTP and OLAP (MOLAP, ROLAP, HOLAP), BI Definitions & Concepts, BI Framework, Data
Warehousing concepts and its role in BI, BI Infrastructure Components BI Process, BI Technology, BI
Roles & Responsibilities, Business Applications of BI, BI best practices
UNIT II: BASICS OF DATA INTEGRATION (EXTRACTION TRANSFORMATION
LOADING) (8 Hours)
Concepts of data integration, needs and advantages of using data integration, introduction to common
data integration approaches, Meta data - types and sources, Introduction to data quality, data profiling
concepts and applications, introduction to ETL using Pentaho data Integration (formerly Kettle)
UNIT III: INTRODUCTION TO MULTI-DIMENSIONAL DATA MODELING (8
Hours)
Introduction to data and dimension modeling, multidimensional data model, ER Modeling vs. multi
dimensional modeling, concepts of dimensions, facts, cubes, attribute, hierarchies, star and snowflake
schema, introduction to business metrics and KPIs, creating cubes using Microsoft Excel
UNIT IV: BASICS OF ENTERPRISE REPORTING (8 Hours)
A typical enterprise, Malcolm Baldrige - quality performance framework, balanced scorecard,
enterprise dashboard, balanced scorecard vs. enterprise dashboard, enterprise reporting using MS
Access / MS Excel, best practices in the design of enterprise dashboards
PRACTICAL EXPOSURE:
Software Required: Kettle (Open source), MS Office MS Access + MS Excel (Office 2007/2010)
With intent to get some exposure in the business intelligence space, the colleges can arrange for
A project that allows the students to apply Technical, Behavioral, Process
concepts learnt in the elective course by:
o
Executing near real-life project (with large data)
o
Working in teams ( project teams will ideally comprise of 4 members)
o
Experiencing expectations from different roles
There will be 3 projects (one at the end of chapter 2 and the second one at the end of
chapter 4, the third one after the completion of the course)
Project 1: Data in disparate data sources such as Excel, text file, databases
etc. will be provided to the students. They will be expected to extract, cleanse,
integrate and load it into the data-warehouse.
Project 2: Design reports according to given business scenarios. The data for
the report s is to be pulled from the data-warehouse built in the earlier project.
Integrated Project: Extract data from various data sources, perform
transformations, load into target database/spreadsheet, create a cube and pull
reports on the data.
REFERENCES:
1.
2.
3.
4.
5.
6.
Business Intelligence by David Loshin

Business intelligence for the enterprise by Mike Biere
Business intelligence roadmap by Larissa Terpeluk Moss, Shaku Atre
An introduction to Building the Data Warehouse IBM
Business Intelligence For Dummies Swain Scheps
Successful Business Intelligence: Secrets to making Killer BI Applications by Cindi
Howson
7. Information dashboard design by Stephen Few
DATA MINING AND BUSINESS ANALYTICS (CODE: )

Number of Weeks
12 14 Weeks
Total Lecture hours*

34
Total Tutorial hours

6
Total Credit
3
Pre Requisites: Basic knowledge of RDBMS (relational database management system)

concepts with hands-on exposure (includes design & implementation of table structures). Knowledge of
Data warehousing
Learning outcomes
At the end of this elective, student will be able to:
1. Differentiate between Transaction Processing and Analytical applications and describe the need
for Business Intelligence
2. Demonstrate understanding of technology and processes associated with data mining
3. Demonstrate understanding of Data Mining implementation methodology and project life cycle
4. Design an enterprise dashboard that depicts the key performance indicators which helps in
decision making
5. Demonstrate application of concepts using open source tools
6. Research Area :
I. Text Mining
II.
III.
IV.
Mining the World Wide Web

Multimedia Data Mining
Spatial Data Mining
UNIT I: INTRODUCTION TO DATA MINING

What is Data Mining? Integration of Data Mining system with a Database or a Data Warehouse System,
Major issues in Data Mining, Applications and Trends in Data Mining.
UNIT II: ALGORITHMS OF DATA MINING

Mining Frequent Patterns, Associations: Basic Concepts, Efficient and Scalable Frequent Itemset
Mining methods (Apriori Algoithm, improving efficiency of Apriori, Mining frequent Itemsets without
Candidate generation, using vertical data formats, closed frequent itemsets). Mining various kinds of
association rules, from association analysis to Correlation analysis, constraint-based association mining.
What is classification? What is Prediction? Classification by Decision tree Induction, Bayesian
classification, Rule based classification, Prediction: Linear Regression, non-linear regression
UNIT III: CLUSTER ANALYSIS AND VISUAL DATA ANALYSIS

Types of data in cluster analysis, classical Partitioning methods : k-Means and k-Medoids.
Introduction to Interactive Visual Data Analysis: Challenges faced by everyday data analysts; A brief
history of interactive visual data analysis; Differences between statics graphics and interactive graphics
UNIT IV: UNIVARIATE AND TIME SERIES DATA ANALYSIS

Sensing and Analyzing Univariate Data :Sensing and Analyzing Univariate Data, Distribution analysis
of categorical data, Distribution analysis of continuous data, Deviation analysis, Part-to whole and
ranking analysis, Univariate data analysis best practices.
Sensing and Analyzing Time Series Data :Characteristics of time-series data, Visual analysis techniques
for time-series data, Interactive graphics aided time-series analysis, Visual time-series analysis best
practices.
Seminars from the topics related to Business Intelligence space
Relevant lab exercises to get exposure to BI concepts & tool
REFERENCE BOOKS:
The courseware including PowerPoint and notes are available for the Elective. In
addition, following reference books can also be used:
1. Jiawei Han and Micheline Kamber, Data Mining: Concepts and Techniques,
Second Edition, Elsevier
2. Michael Berry and Gordon Linoff, Data Mining Techniques, Wiley Publishing,
2004.
3. Kimball and Ross, The Data Warehouse Toolkit, Second Edition, John Wiley &
Sons, 2002.
4. T. Davenport, Competing on Analytics, Harvard Business Review (Decision
Making), January 2006.
PRACTICAL EXPOSURE
With intent to get some exposure in the business intelligence space, the colleges
can arrange for
A project that allows the students to apply Technical, Behavioral, Process concepts
learnt in the elective course by:
Executing near real-life project (with large data)
Working in teams ( project teams will ideally comprise of 4 members)

Experiencing expectations from different roles
There will be 2 projects (one at the end of chapter 3 and the second one at the
end of chapter 6)
Project 1:
Project 2:
SOFTWARE REQUIREMENTS
Any RDBMS and open source tools for Data Analysis and Visualization,
Recommended open source tools: For analysis: Weka, For Data Visualization:
Actuate

01 B.Tech CSE Syllabus Final

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

01 B.Tech CSE Syllabus Final

Uploaded by

Copyright:

Available Formats

B. Tech.

Computer Science and Engineering

Computer Programming in C Language

Computer Programming Language Lab.

Computer Organization and Architecture

Data and File Structure

Object Oriented Programming

Digital Circuit and System

Data structure Lab

Object Oriented Programming Lab

Linear Algebra and Graph Theory

Computer Networks and DP

LIST OF ELECTIVES (Program Electives)

LIST OF ELECTIVES (HSS Electives)

LIST OF ELECTIVES (Industrial Electives)

UNIT I:MEASUREMENTS AND ERRORS, SPECIAL THEORY OF

COMPUTER PROGRAMMING IN C LANGUAGE (CODE: CS

COMPUTER PROGRAMMING LANGUAGE LAB.(CODE: )

Recommended Systems/Software Requirements:

ELECTRONICS LAB I (CODE: )

UNIT I:VECTOR CALCULUS & ELECTROMAGNETIC FIELD THEORY(10

D.J. Griffith, Mathew N O Sadiku, Principles of electromagnetic

COMPUTER ORGANIZATION AND ARCHITECTURE (CODE: )

2. Computer Organization and Architecture Designing for Performance, William

PHYSICS LAB. (CODE: )

List of Physics Practical:

ELECTRONICS LAB. - II(CODE: )

Study of analysis of different circuits and their

Circuit theory Lab using PSPICE Simulation:

Functional study of Digital Storage oscilloscope.

Study of Transient Analysis of RLC Circuit.

DATA AND FILE STRUCTURE(CODE: CS 402)

UNIT IV:HASHING AND FILE STRUCTURES(10 Hours)

OBJECT ORIENTED PROGRAMMING (CODE: CS403 )

Introduction to object oriented programming concepts-Encapsulation, Data Abstraction, Data Hiding,

UNIT II: BASIC PROGRAMMING ELEMENTS

UNIT III: INHERITANCE, PACKAGES AND INTERFACES

UNIT IV: EXCEPTION HANDLING, APPLETS, AND AWT( Hours)

DIGITAL CIRCUIT AND SYSTEM (CODE: )

UNIT II: SEQUENTIAL LOGIC DESIGN,STATE MACHINES(15 Hours)

UNIT III:DIGITAL LOGIC FAMILIES(7 Hours)

UNIT IV:INTRODUCTION TO HDLs(7 Hours)

DATA STRUCTURE LAB. (CODE: )

OBJECT ORIENTED PROGRAMMING LAB(CODE: )

OPERATING SYSTEM (CODE: )

DATABASE MANAGEMENT SYSTEM(CODE: )

PRINCIPLES OF COMMUNICATIONS (CODE: )

2. Principles of Communications H. Taub and D. Schilling, Gouthamsaha, TMH, Third

DATABASE MANAGEMENT SYSTEM LAB. (CODE: )

Recommended Systems/Software Requirements: MySql /Oracle latest version.

MICROPROCESSOR LAB. (CODE: )

1. Computer Architecture: Harvard architecture/Van Neumann Architecture,

between regular language, context free language and corresponding

UNIT I:(9 Hours)

COMPUTER NETWORKS AND DISTRIBUTED PROCESSING (CODE: CS

COMPUTER NETWORKS LAB.(CODE: )

DIGITAL SIGNAL PROCESSING LAB.(CODE: )

5. Computation of auto-correlation and cross correlation of two sequences using

ARTIFICIAL INTELLIGENCE (CODE: )

To provide a strong foundation of fundamental concepts in Artificial Intelligence. To

Intelligent Agents: Agents and environments, Good behavior, The nature of

UNIT II: SEARCHING TECHNIQUES

Informed search and exploration: Informed search strategies, heuristic function,