B.Tech. Degree in Computer Science and Engineering

B.Tech.
Degree
in
COMPUTER SCIENCE AND ENGINEERING
SYLLABUS FOR CREDIT BASED CURRICULUM

(With effect from 2019-2020 onwards)
DEPARTMENT OF COMPUTER SCIENCE AND

ENGINEERING
NATIONAL INSTITUTE OF TECHNOLOGY PUDUCHERRY

KARAIKAL – 609 609
FIRST SEMESTER
CODE COURSE TITLE L T P C
HM111 Business English 2 0 2 3
MA111 Algebra and Calculus 3 0 0 3
Basics of Electrical and

EE111 3 0 0 3
Electronics Engineering
CH111 Engineering Chemistry 3 0 0 3
CS101 Programming Fundamentals 3 0 0 3
CH113 Chemistry Laboratory 0 0 3 2
CS103 Programming in C Laboratory 0 0 3 2
EE113 Workshop Practice 0 0 2 2
NSS/NSO/NCC (C) 0 0 0 0
Total Credits 21
SECOND SEMESTER
Vectors and Ordinary

MA112 3 0 0 3
Differential Equations
PH112 Engineering Physics 2 0 2 3
ME112 Environmental Engineering 3 0 0 3
ME114 Engineering Graphics 0 0 3 3
CS102 Data Structures 3 0 0 3
CS104 Digital Computer Fundamentals 3 0 0 3
PH114 Engineering Physics Laboratory 0 0 3 2
CS106 Data Structures Laboratory 0 0 3 2
NSS/NSO/NCC (C) 0 0 0 0
Total Credits 22
THIRD SEMESTER
MA211 Discrete Mathematics 3 0 0 3
Design and Analysis of

CS201 3 0 0 3
Algorithm
CS203 Programming Paradigms 3 0 0 3
CS205 Automata and Formal Languages 3 0 0 3
Computer Organization and

CS207 3 0 0 3
Architecture
CS209 Data Communication 3 0 0 3
Programming Paradigms
CS211 0 0 3 2
Laboratory
Design and Analysis of Algorithm

CS213 0 0 3 2
Laboratory
Total Credits 22
FOURTH SEMESTER
CODE COURSE OF STUDY L T P C
MA212 Probability and Statistics 3 0 0 3
CS202 Computer Networks 3 0 0 3
CS204 Software Engineering 3 0 0 3
CS206 Python Programming 3 0 0 3
Microprocessor and
EC212 3 0 0 3
Microcontrollers
CS208 Computer Networks Laboratory 0 0 3 2
CS210 Python Programming Laboratory 0 0 3 2
Microprocessor and
EC214 Microcontrollers Laboratory 0 0 3 2
Total Credits 21
FIFTH SEMESTER
CS301 Database Management System 3 0 0 3
CS303 Operating Systems 3 0 0 3
CS305 UNIX Programming 3 1 0 4
Artificial Intelligence and Expert

CS307 3 0 0 3
Systems
CS3XX Elective 1 3 0 0 3
Global Elective 1 3 0 0 3
Database Management System

CS309 0 0 3 2
Laboratory
CS311 Operating Systems Laboratory 0 0 3 2
Total Credits 23
SIXTH SEMESTER
HM312 Corporate Communication 3 0 0 3
CS302 Principles of Compiler Design 3 0 0 3
CS304 Web Technology 3 0 0 3
Engineering Ethics and Precepts

HM312 3 0 0 0
of Constitution of India
CS306 Compiler Design Laboratory 0 0 3 2
CS308 Web Technology Laboratory 0 0 3 2
Total Credits 19
SEVENTH SEMESTER
Industrial Economics &

HM411 3 0 0 3
Management
CS401 Computer Graphics 3 0 0 3
CS403 Machine Learning 3 0 0 3
CS491 Project Work Phase – I 0 0 0 3
Total Credits 21
EIGHTH SEMESTER
CS492 Project Work Phase–II 0 0 0 6
Total Credits 15
Summary
Semester I II III IV V VI VII VIII Total

Credits 21 22 22 21 23 19 21 15 164
LIST OF DEPARTMENT ELECTIVES
LIST OF ELECTIVES FOR FIFTH SEMESTER (ANY ONE)
1. CS321 GRAPH THEORY

2. CS323 WIRELESS AD HOC NETWORKS
3. CS325 JAVA PROGRAMMING
4. CS327 INFORMATION THEORY AND CODING
5. CS329 COMPUTATIONAL COMPLEXITY
6. CS331 OBJECT ORIENTED ANALYSIS AND DESIGN
7. CS333 DISTRIBUTED SYSTEMS
LIST OF ELECTIVES FOR SIXTH SEMESTER (ANY ONE)
1. CS322 SOFTWARE TESTING

2. CS324 ADVANCED COMPUTER ARCHITECTURE
3. CS326 MOBILE COMMUNICATION
4. CS328 RANDOMIZED ALGORITHM
5. CS330 NETWORK PROTOCOLS
6. CS332 PATTERN RECOGNITION
7. CS334 GAME THEORY
LIST OF ELECTIVES FOR SEVENTH SEMESTER (ANY THREE)
1. CS421 INTERNET OF THINGS

2. CS423 MOBILE APPLICATION DEVELOPMENT
3. CS425 DESIGN AND ANALYSIS OF PARALLEL ALGORITHMS
4. CS427 FUNCTIONAL PROGRAMMING LANGUAGES
5. CS429 NETWORK SECURITY
6. CS431 KNOWLEDGE ENGINEERING
7. CS433 DATA WAREHOUSING AND DATA MINING
8. CS435 CYBER SECURITY
9. CS437 FAULT TOLERANT SYSTEM
10. CS439 DEEP LEARNING
LIST OF ELECTIVES FOR EIGHTH SEMESTER (ANY TWO)
1. CS422 ADVANCED DATABASE MANAGEMENT SYSTEMS

2. CS424 SOFT COMPUTING
3. CS426 BIG DATA ANALYTICS
4. CS428 MANAGEMENT INFORMATION SYSTEMS
5. CS430 REAL TIME SYSTEMS
6. CS432 NATURAL LANGUAGE PROCESSING
7. CS434 NUMBER THEORY AND CRYPTOGRAPHY
8. CS436 MULTIMEDIA ANALYSIS
9. CS438 CLOUD COMPUTING
LIST OF GLOBAL ELECTIVES (OFFERED FOR STUDENTS OTHER THAN CSE)
1. CS451 INTRODUCTION TO CLOUD COMPUTING

2. CS452 INFORMATION SECURITY
3. CS453 DATA STRUCTURES AND ALGORITHMS
4. CS454 OPERATING SYSTEM CONCEPTS
5. CS455 OBJECT ORIENTED PROGRAMMING WITH C++
6. CS456 WEB OF THINGS
7. CS457 COMMUNICATION AND COMPUTER NETWORKS
8. CS458 INTRODUCTION TO JAVA PROGRAMMING
9. CS459 MACHINE LEARNING TECHNIQUES
10. CS460 PYTHON PROGRAMMING FUNDAMENTALS
11. CS461 R PROGRAMMING
LIST OF B.TECH PROGRAMME STRUCTURE
Category S. No. Subjects Credits
1. Business English 3
2. Corporate Communication 3
Humanities and Engineering Ethics and Precepts of
3. 0
Social Science Constitution of India
4. Industrial Economics & Management 3
Total 9
1. Engineering Physics 3
2. Engineering Physics Laboratory 2
3. Engineering Chemistry 3
4. Chemistry Laboratory 2
Basic Science 5. Algebra and Calculus 3
Courses Vectors and Ordinary Differential
6. 3
Equations
7. Discrete Mathematics 3
8. Probability and Statistics Theory 3
Total 22
Basics of Electrical and Electronics
1. 3
Engineering
2. Engineering Graphics 3
Engineering Science 3. Workshop Practice 2
Courses 4. Environmental Engineering 3
5. Programming Fundamentals 3
6. Programming in C Laboratory 2
Total 16
1. Data Structures 3
2. Design and Analysis of Algorithm 3
3. Programming Paradigms 3
4. Digital Computer Fundamentals 3
5. Computer Organization and Architecture 3
6. Data Communication 3
7. Computer Networks 3
8. Automata and Formal Languages 3
9. Python Programming 3
10. Microprocessor and Microcontrollers 3
Professional Core
11. Database Management System 3
Courses - Theory
12. Operating Systems 3
13. UNIX Programming 4
14. Software Engineering 3
15. Principles of Compiler Design 3
16. Web Technology 3
17. Artificial Intelligence and Expert Systems 3
18. Computer Graphics and Vision 3
19. Machine Learning 3
Total 58
Category S. No. Subjects Credits
1. Data Structures Laboratory 2
2. Programming Paradigms Laboratory 2
Design and Analysis of Algorithm
3. 2
Laboratory
4. Computer Networks Laboratory 2
5. Python Programming Laboratory 2
Professional Core
Microprocessor and Microcontrollers
Courses - Laboratory 6. 2
Laboratory
7. Database Management System Laboratory 2
8. Operating Systems Laboratory 2
9. Compiler Design Laboratory 2
10. Web Technology Laboratory 2
Total 20
1. Elective 1 (Fifth Semester) 3
2. Elective 2 (Sixth Semester) 3
3. Elective 3 (Seventh Semester) 3
Professional Elective 4. Elective 4 (Seventh Semester) 3
Courses 5. Elective 5 (Seventh Semester) 3
6. Elective 6 (Eighth Semester) 3
7. Elective 7 (Eighth Semester) 3
Total 21
1. Global Elective 1 (Fifth Semester) 3
Open Elective 2. Global Elective 2 (Sixth Semester) 3
Courses 3. Global Elective 3 (Eighth Semester) 3
Total 9
Project Work Phase – I (Seventh
1. 3
Semester)
Project Work
2. Project Work Phase–II (Eighth Semester) 6
Total 9
Total 164
FIRST SEMESTER
L T P C
HM111 BUSINESS ENGLISH
2 0 2 3
COURSE OBJECTIVES
 To enable students to learn and apply the basic sub-skills of English language in
their career and professional environment.
 To train the students in grasping the intricacies of communication and applying
the same in world outside.
 To equip students to interact with academic content: Reading, Writing, Listening
and Speaking.
Unit I - Fundamentals of Communication

Definition, Importance, Process of Communication, Factors of Communication - Sender,
Receiver, Channel, Code etc., Filters and Barriers, Verbal and Non-verbal Communication,
Networks and Channel.
Unit II - Reading Skills

Importance of Reading skills, Reading strategies, Reading for information, inference and
evaluation. (Newspapers, Scientific Research, Desired reading materials), Note Making,
Reading Practice- Technical and general texts including excerpts from prose and poetry.
Unit III - Writing and Listening Skills

Writing Skills: Paragraph Writing - Coherence, Cohesion, Linkers, Unity; Business
Correspondence: Enquiry, order, complaint letters, Precise writing, paraphrasing.
Listening Skills: Importance of Listening skills in Technical World, Types of Listening,
Listening for information, inference and evaluation, Note Taking, Barriers to listening -
Physical, Psychological, Linguistic, and Cultural; Methods to overcome the barriers.
Unit IV - Oral Communication

Speech Mechanics, Extempore Speech Practice, Group Discussions, Dialogue and
conversation practice.
Unit V - Language Project

A team-based survey and assessment report on real life language utility in different sectors
of society as per the teacher’s instruction.
TEXT BOOKS
1. Meenakshi Raman and Sangeeta Sharma, “Technical Communication: Principles
and Practice”, OUP Publication, 2014.
2. John Sealy, “The Oxford Guide to effective writing and Speaking”, OUP
publication, 2007.
3. K. Alex, “Soft Skills”, S Chand Publications, 2010.
REFERENCE BOOKS
1. David Lindsay, “A Guide to Scientific Writing”, Macmillan, 1995.
2. C. Bovee and C.A. Paul, “Business Communication Today”, Pearson, 2018.
3. Raymond V Lesikar and Marie E. Flatley, “Basic Business Communication”, Tata
Mc-Graw Hill, 2005.
4. Comfort, Jeremy, et al. “Speaking Effectively: Developing Speaking Skills for
Business English”, Cambridge University Press, Cambridge: Reprint 2011.
COURSE OUTCOMES
At the end of the course, the students will be able to
 Learn the basics of English communication with an emphasis on its application
in corporate and technical domains.
 Apply and incorporate the knowledge of English to facilitate effective
communication in their occupation and daily life.
 Integrate language with content specific subject knowledge through task-based
activities.
 Enable students for applying their theoretical input into the practical world
through a project.
 Demonstrate behaviour and attitudes appropriate to a global environment.
L T P C
MA111 ALGEBRA AND CALCULUS
3 0 0 3
COURSE OBJECTIVES
 To learn mathematical concepts and methods.
 To acquire fundamental knowledge and apply in engineering disciplines.
 To analyze improper integral.
Unit I - Matrix Theory

Elementary row and column operations on a matrix, Rank of matrix, Normal form, Inverse
of a matrix using elementary operations, Consistency and solutions of systems of linear
equations using elementary operations, linear dependence and independence of vectors.
Unit II - Matrix Applications

Characteristic equation of a matrix, Eigen values and Eigen vectors - Properties of Eigen
values, Diagonalization of matrix, Caley - Hamilton theorem (statement only) and its
applications, Canonical form by linear and orthogonal transformations.
Unit III - Sequences & Infinite series

Sequences of real numbers – Limit of a sequence – Convergent and divergent sequences–
sub sequence- Cauchy’s sequence – monotone convergence theorem (without proof)
Convergence Tests for positive term series – Comparison, Root, Ratio and Raabe’s tests-
Alternating series – Leibnitz’s rule – Absolute and Conditional Convergence.
Unit IV - Differential Calculus

Rolle’s theorem; Mean value theorem; Taylor’s and Maclaurin’s theorems (without proof)
with remainders, Functions of several variables, Partial Differentiation, Total
Differentiation, Euler’s theorem and generalization, Change of variables, Jacobians.
Unit V - Integral Calculus

Beta and Gamma integrals, Elementary properties, Double and triple integrals, surface areas
by double integrals. Volumes by double and triple integrals change of variables in double
and triple integrals.
TEXT BOOKS
1. Erwyn Kreyszig, “Advanced Engineering Mathematics”, John Wiley and Sons,
Eighth Edition, 2001.
2. T.M. Apostol, “Calculus Volume I & II”, Second Edition, John Wiley and Sons
(Asia), 2005.
REFERENCE BOOKS
1. B.S.Grewal, “Higher Engineering Mathematics”, Khanna Publications, 2002.
2. M.D. Greenberg, “Advanced Engineering Mathematics”, Second Edition, Pearson
Education Inc. (First Indian reprint), 2002.
COURSE OUTCOMES
 Solve the consistent system of linear equations.
 Determine the power series expansion of a given function.
 Analyze improper integrals.
 Convert line integrals into surface integrals and surface integrals into volume
integrals.
 Apply the concepts in solving physical problems arising in engineering.
EE111 BASICS OF ELECTRICAL AND ELECTRONICS L T P C
ENGINEERING 3 0 0 3
COURSE OBJECTIVES
 To enable the students to gain fundamental knowledge about concepts in
Electrical and Electronics engineering.
 To impart basic knowledge of magnetic circuits.
 To enhance their sanity about the basics of digital circuit.
Unit I - Basic Electric parameters

Definition of Voltage, Current, Power & Energy, circuit parameters, Ohm’s law, Kirchoff’s
law. Series and Parallel DC circuits. Concepts of AC Circuits- rms value, average value,
form and peak factors. Simple RL, RC and RLC circuits. Introduction to three phase systems.
Unit II - Electromagnetic
Definition of mmf, flux and reluctance, Faraday’s laws of electromagnetic induction. DC
Motor, Induction motor, Alternators and Transformers- construction, principle of operation.
Unit III – Household Wiring and Layouts

Types of wiring-staircase & corridor wiring, wiring accessories. Basic safety measures at
home and industry. Importance of energy saving. Simple layout of generation, transmission
& distribution of power.
Unit IV – Basic Electronic Devices

Semiconductor: Energy band diagram, Intrinsic and Extrinsic semiconductors, PN junction
diodes - characteristics. Transistors: PNP and NPN transistors - theory of operation -
Transistor configurations –characteristics.
Unit V – Logic Gates

Digital Fundamentals: Number systems - Boolean Theorems- Logic gates -Implementation
of Boolean Expression using Gates. Integrated circuits, Soldering, PCB.
TEXT BOOKS
1. Muthusubramanian.R, Salivahanan.S, Muraleedharan.K.A, "Basic Electrical,
Electronics and Computer Engineering", Tata McGraw - Hill, 1999.
2. Smarajit Ghosh, “Fundamentals of Electrical and Electronics Engineering”, PHI,
Second Edition, 2010.
REFERENCE BOOKS
1. Kothari D P and Nagrath I J, “Basic Electrical Engineering”, Tata McGraw
Hill,1991.
2. Mehta V K, “Principles of Electronics”, S Chand & Co,1980.
3. Mithal G K, “Electronic Devices and Circuits”, Khanna Publications, 1997.
4. Kalsi H S, "Electronics Instrumentation", ISTE publication, 1995.
5. Huges, “Electrical and Electronics Technology”, Pearson, Tenth Edition, 2011.
COURSE OUTCOMES
 Understanding basic electric terminologies, laws and parameters in DC and AC
circuits.
 Understanding basic electromagnetic principles.
 Understanding basic power system and its operation.
 Perform mathematical operation on binary numbers.
 Analyse the basic semi-conductor devices and their applications.
L T P C
CH111 ENGINEERING CHEMISTRY
3 0 0 3
COURSE OBJECTIVES
 To enable the students to refresh their basics of Chemistry and orient
themselves in implementation of concepts in engineering.
 To give and exposure on basics of Electrochemistry and Corrosion Science.
 To provide fundamentals of Organic Chemistry and Co-ordination
Chemistry.
 To understand the concept of Water treatment and Nanomaterials.
Unit I - Electrochemistry and Corrosion

Introduction to Electrochemistry, Electrolytic and galvanic cells - EMF, Reference
Electrode - Weston standard cell, hydrogen electrode, calomel electrode, glass electrode,
reversible and irreversible cells, concentration cell – Hydrogen-Oxygen fuel cells.
Corrosion: Dry and wet corrosion - General mechanism, Types of corrosion, Factors
affecting corrosion - Corrosion protection – Electro and Electroless Plating.
Unit II - Organic Chemistry

Carbon-carbon bond properties, homolytic and heterolytic cleavage of carbon-carbon
bonds, SN1 and SN2, E1and E2reactions, aromatic nucleophilic substitution, aromatic
electrophilic substitution, Baeyer-Villiger oxidation, MPV reduction.
Unit III - Coordination Chemistry

Formation and types of metal complexes, EAN rule, 16 and 18 electron rule, crystal field
theory, CFSE, color and magnetism of transition metal ions, metal carbonyls (Ni & Fe) -
bonding and structure, Organometallic compounds in catalysis -hydrogenation,
hydroformylation and polymerization of olefin, Chemistry of hemoglobin, Bohr effect.
Unit IV - Water Treatment

Sources, hard and soft water, estimation of hardness by EDTA method, softening of water
- zeolite process, demineralization by ion exchangers, boiler feed water, internal treatment
methods, specifications for drinking water, BIS and WHO standards, treatment of water
for domestic use, desalination, reverse osmosis, electro dialysis.
Unit V - Nanomaterials
Introduction - Properties at nanoscale (optical, mechanical, electronic and magnetic),
Classification based on dimensionality - Carbon - based nanomaterials (buckyballs,
nanotubes, graphene) – Metal based nanomaterials (nanogold, nanosilver and metal
oxides) – Nanocomposites – Nanopolymers – Nanoglasses – Nano ceramics - Biological
nanomaterials.
TEXT BOOKS
1. P.C. Jain and M. Jain, “Engineering Chemistry”, Dhanpat Rai Publishing
Company (P) Ltd., New Delhi, 2015.
2. J. March, “Advanced Organic Chemistry”, Wiley Eastern, New Delhi, 2012.
3. J. Girrad, “Principles of environmental chemistry”, Jones & Bartlett learning,
2014.
4. Alain Nouailhat, “An Introduction to Nanoscience and Nanotechnology”, John
Wiley, 2008.
REFERENCE BOOKS
1. R. Gopalan, D. Venkappayya and N. Sulochana, “Engineering Chemistry”, Vikas
Publishing House, New Delhi, 2017.
2. J.C. Kuriacose, J. Rajaram, “Chemistry in Engineering and Technology, Vol I &
II”, Tata McGraw Hill publishing Company Ltd, New Delhi, 1984.
3. P.W. Atkins, “Physical Chemistry”, Oxford University Press, 2006.
4. J.E. Huheey, E.A. Keiter and R.L. Keiter, “Inorganic Chemistry - Principles of
Structure and Reactivity”, Harper Collins College Publishers, New York, 2011.
COURSE OUTCOMES
 Understand the concept of Electro-chemistry.
 Students will get an exposure on fundamentals of Organic Chemistry and Co-
ordination Chemistry
 Understand the concept of Nanomaterials.
 Upon completion of this course, the students can able to understand the
engineering chemistry aspects of Corrosion Science.
 Understand the concept of Water Treatment.
L T P C
CS101 PROGRAMMING FUNDAMENTALS
3 0 0 3
COURSE OBJECTIVES
 To learn the fundamentals of computers.
 To learn the problem solving techniques in writing algorithms and procedures.
 To learn the syntax and semantics for C programming language.
 To understand the constructs of structured programming such as conditions,
iterations, arrays, functions and pointers.
 Analyze complex engineering problems to develop suitable solutions.
Unit I - Fundamentals of Computers, Algorithms and Structured Programming

Introduction to computers – Computer Organization – Characteristics – Hardware and
Software –Modes of operation – Types of programming languages – Developing a program,
Algorithms – Characteristics – Flowcharts - Principles of Structured programming –
Sequential, Selective structures - Repetitive structures –Bounded, Unbounded and Infinite
iterations.
Unit II - Overview of C and Branching

Introduction to C – C character set – Identifiers and Keywords – Data types – Constants –
Variables – Declarations – Expressions – Statements – Symbolic constants – Operators–
Library functions. Data input and output: Single character input and output – Entering input
data – Writing output data – gets and puts functions. Control statements: Conditional-
Branching- Looping- unconditional: Break- continue-goto.
Unit III - Functions and Arrays

Functions: Overview- Defining a Function- Accessing a Function- Function Prototypes-
Passing Argument to a Function- Recursion- Storage Classes: Automatic Variables- External
(Global) Variables-Static Variables- Register variables. Arrays: Defining an Array-
Processing an Array- Passing Array to function- Multidimensional Arrays.
Unit IV - Strings and Pointers

Strings: Defining a String- NULL Character- Initialization of Strings- Reading and Writing
a String- Processing Strings- Character Arithmetic- Library Functions for Strings. Pointers:
Pointer Declaration-Passing Pointers to a Function-Pointers and One-dimensional Array-
Dynamic Memory Allocation- Operations on Pointers- Pointers and Multidimensional
Arrays- Array of Pointers, Command line arguments.
Unit V - Structures, File Management and Preprocessors

Basic of Structures, structures and functions, array of structures, structure data types, type
definition, defining, opening and closing of files, input and output operations. Introduction
to preprocessors, compiler control directives.
TEXT BOOKS
1. Brian W Kerningan and Dennis M. Ritchie, “The C Programming Langauge”,
Second Edition, PHI, 2012.
2. Byron Gottfried, “Programming with C”, Third Edition, Tata McGraw Hill
Education, 2010.
3. R.G. Dromey, “How to Solve it By Computers?”, First edition, Prentice Hall, 2001.
REFERENCE BOOKS
1. J.R. Hanly and E.B. Koffman, “Problem Solving and Program Design in C”, Sixth
Edition, Pearson Education, 2009.
2. Paul Deital and Harvey Deital, “C How to Program”, Seventh Edition, Prentice Hall,
2012.
3. Yashavant Kanetkar, “Let Us C”, Twelfth Edition, BPB Publications, 2012.
COURSE OUTCOMES
 Learn the fundamentals of computers.
 Learn the problem solving techniques in writing algorithms and procedures.
 Learn the syntax and semantics for C programming language.
 Understand the constructs of structured programming such as conditions,
iterations, arrays, functions and pointers.
 Analyze complex engineering problems to develop suitable solutions.
L T P C
CH113 CHEMISTRY LABORATORY
0 0 3 2
COURSE OBJECTIVES
 To enable the students to refresh their basics of Chemistry laboratory and orient
themselves in implementation of concepts in engineering.
 To give and exposure on basics of estimation of water hardness and alkalinity and
metal salts.
 To provide fundamentals of Conductometry, Potentiometry and pH meter.
 To understand the concept of coal analysis and corrosion test.
LIST OF EXPERIMENTS
1. Percentage purity of bleaching powder.
2. pH metric titration.
3. Conductometric titration.
4. Potentiometric titration.
5. Determination of corrosion rate of mild steel in acid medium by weight loss
method.
6. Estimation of total alkalinity in the given water sample.
7. Estimation of carbonate, noncarbonated and total hardness in the given water
sample.
8. Estimation of dissolved oxygen in waste water.
9. Estimation of Fe2+ by external indicator.
10. Estimation of proximate analysis of Coal.
REFERENCE BOOK
1. Laboratory Manual, Department of Chemistry, NITT.
COURSE OUTCOMES
 Understand the concept of pH metry, Potentiometry and Conductometry.
 Get an exposure on fundamentals of engineering chemistry lab experiments.
 Understand the concept of estimations.
 Upon completion of this course, the students can able to understand the Corrosion
of mild steel.
 Understand the concept of coal analysis.
L T P C
CS103 PROGRAMMING IN C LABORATORY
0 0 3 2
COURSE OBJECTIVES
 Design algorithms for simple problems.
 Sharpen programming skill in C Language.
 To learn problem solving techniques.
LIST OF EXERCISES
1. Programs using sequence construct.

2. Programs using selection construct.
3. Programs using Iterative construct.
4. Programs using nested for loops.
5. Programs using functions with Pass by value.
6. Programs using functions with Pass by reference.
7. Programs using recursive functions.
8. Programs using one dimensional Array.
9. Programs using two dimensional Arrays.
10. Programs using Pointers and functions.
11. Programs using Pointers and Arrays.
12. Programs using Pointers and structures.
13. Programs using structures and arrays.
14. Programs to perform I/O operations on files.
15. Programs to perform error handling during I/O operations on files.
16. Programs to perform random access to files.
COURSE OUTCOMES
 Write diversified solutions using C language.
 Read, understand and trace the execution of programs written in C language.
 Test and debug the programs for critical errors.
 Analyze and optimize programs.
 Write programs that perform operations using derived data types.
L T P C
EE113 WORKSHOP PRACTICE
0 0 2 2
COURSE OBJECTIVES
 To train students to carryout electrical wirings.
 To introduce electrical and electronic components.
 To illustrate circuits laws and working of logic gates.
LIST OF EXPERIMENTS
1. Residential house wiring using switches, fuse, indicator, lamp and energy meter.
2. Fluorescent lamp wiring.
3. Stair case wiring.
4. Measurement of electrical quantities – voltage, current, power & power factor in
RLC circuit.
5. Verification of KCL and KVL.
6. Study of electronic components and equipments – Resistor, colour coding.
7. Measurement of AC signal parameter (peak-peak, rms period, frequency) using
CRO.
8. Study of logic gates AND, OR, and NOT.
9. Soldering practice – Components Devices and Circuits – Using general purpose
PCB.
10. VI characteristics of diode.
COURSE OUTCOMES
 Carry out basic home electrical wiring works.
 Measure electrical quantities.
 Explain working different electronic components and diode.
 Use logic gates.
 Solder circuits in PCB.
SECOND SEMESTER
MA112 VECTORS AND ORDINARY DIFFERENTIAL L T P C
EQUATIONS 3 0 0 3
COURSE OBJECTIVES
 To learn mathematical concepts and methods.
 To acquire fundamental knowledge and apply in engineering disciplines.
 To solve the linear differential equations with constant coefficients.
Unit I - Vector Calculus

Vector Differentiation; Level surfaces directional derivative, Gradient of scalar field,
Divergence and Curl of a vector field, Laplacian, Line and surface integrals, Green’s
theorem in plane, Gauss Divergence theorem, Stokes’ theorem (Without Proof).
Unit II - Ordinary differential equations

Linear first order equations, Bernoulli’s equation, Orthogonal trajectories, Newton’s law of
cooling, Law of Natural growth and Decay, Higher order linear equations with constant
coefficients. Euler and Cauchy’s equations, method of variation of parameters, system of
linear Differential equations with constant coefficients.
Unit III - Introduction to Laplace Transformations

Laplace transform, Inverse Laplace transform, properties of Laplace transforms, Laplace
transforms of unit step function, impulse function and periodic function, convolution
theorem.
Unit IV - Application of Laplace Transformations

Solution of ordinary differential equations with constant coefficients and system of linear
differential equations with constant coefficients using Laplace transform.
Unit V - Non-linear Optimization

Maxima and minima of functions of several variables. General nonlinear programming
problem - Lagrange’s method of Multipliers, Multi variable optimization with/without
constraints, Multi variable optimization with inequality constraints, Kuhn-Tucker
conditions.
TEXT BOOKS
1. Erwyn Kreyszig, “Advanced Engineering Mathematics”, John Wiley and Sons,
Tenth Edition, 2010.
2. B.S. Grewal, “Higher Engineering Mathematics, Khanna Publications”,
Fourtysecond Edition, 2012.
REFERENCE BOOKS
1. M.D. Greenberg, “Advanced Engineering Mathematics”, Second Edition, Pearson
Education Inc. (First Indian reprint), 2002.
2. J.K. Sharma, “Operations Research, theory and applications”, Fifth Edition,
Macmillan Publishers Ltd, 2013.
COURSE OUTCOMES
 Apply the concepts of gradient, divergence and curl to formulate engineering

problems.
 Evaluate multiple integrals in various coordinate systems.
 Apply Laplace transforms to solve physical problems arising in engineering.
 Solve the linear differential equations with constant coefficients.
 Find the maxima and minima of multivariable functions.
 Solve industrially applicable problems.
L T P C
PH112 ENGINEERING PHYSICS
2 0 2 3
COURSE OBJECTIVES
 To enable the students to refresh their basics of Physics and orient themselves in
implementation of concepts in engineering.
 To give an exposure to modern physics.
 To provide qualitative knowledge of solid state physics.
 To give an explorer to advanced materials.
 To provide qualitative knowledge on laser and fiber optics.
Unit I - Waves and Oscillations

Wave motion- Wave equation examples-Superposition of waves and standing waves-Simple
harmonic motion -energy of SHM damped oscillations-forced oscillations and resonance
conditions; Theory of interference of light- Newton’s rings, Diffraction- Grating -
Polarization-Applications.
Unit II - Quantum mechanics
Inadequacy of classical mechanics-Wave and particle duality of radiation-de Broglie concept
of matter waves-Heisenberg’s uncertainty principle-Schrödinger wave equation-
Interpretation of wave function- Eigen values and Eigen functions-Superposition principle-
Particle confined in one dimensional infinite square well potential - fundamentals of
quantum computing.
Unit III - Solid state Physics
Drude theory of electrical conductivity, Free electron theory (classical and quantum), Band
theory of solids, semiconductors and semiconductor devices, superconductivity-types,
Meissner effect, applications; Magnetism-types and properties- Hard and soft magnetic
materials, applications; Dielectrics-types of polarization.
Unit IV - Advanced materials
Liquid crystals-types-application as display devices-photonic crystals-nano materials (one,
two and three dimensional)-physical properties and applications. Composites-Shape
memory allows, piezoelectric materials, thermo electric materials, Ferro-electric materials,
Thin film synthesis and characterization.
Unit V - Lasers and fiber optics
Spontaneous and stimulated emissions-Einstein’s coefficients-Population inversion and
lasing action, Coherence-Properties and types of lasers-Applications; Optical fiber-
Numerical aperture-Types of fibers- Fiber optics communication principle-Fiber optic
sensors.
TEXT BOOKS
1. M.N. Avadhanulu and P.G. Kshirsagar, “A text book of Engineering Physics”, S.
Chand and Company, New Delhi, 2014.
2. R.K. Gaur and S.L. Gupta, “Engineering Physics”, DhanpatRai Publications (P)
Ltd., Eighth Edition, New Delhi, 2001.
3. V. Rajendran, “Materials Science”, Tata McGraw-Hill, 2011.
4. R. A.Serway and J.W.Jewett, “Physics for Scientists and Engineers”, Ninth Edition,
Cengage Learning, 2014.
5. Anthony R. West, “Solid State Chemistry and its Applications”, John Wiley and
sons, Second Edition. 2014.
6. Arthur Beiser, “Concepts of Modern Physics”, Tata McGraw-Hill, NewDelhi,
2010.
REFERENCE BOOKS
1. Halliday, Resnic and Walker, “Fundamentals of Physics”, Ninth Edition, John
Wiley & sons, 2011.
2. Walter Greiner, Ludwig Neise, Horst StöckerandD. Rischke, “Thermodynamics
and Statistical Mechanics”, Springer 1997.
3. Richard P. Feynman , “The Feynman Lectures on Physics - Vol. I,II and III”, The
New Millennium Edition, 2012.
4. Rolf. E. Hummel, “Electronic Properties of Materials”, Springer 2001.
COURSE OUTCOMES
At the end of the course, the students will be
 Able to strengthen their fundamental knowledge of physics.
 Able to demonstrate and apply to analyse variety of physical phenomes.
 Acquainted to modern physical concepts qualitatively.
 Acquainted to physical concepts related to solid state materials.
 Acquainted to fundamental knowledge of modern communication.
L T P C
ME112 ENVIRONMENTAL ENGINEERING
3 0 0 3
COURSE OBJECTIVES
 To expose the students on various sources, effects and control measures of air
pollution, water pollution and pollution due to industries and transport.
 To understand the various sources of energy and their effect on environment.
 To know the various types of crops and irrigation methods.
Unit I - Pollution
Air pollution - Sources, effects, control, air quality standards -Air pollution act, air pollution
measurement. Water pollution-Sources, impacts, control, and measure –Quality of water for
various purposes-Noise pollution - Sources, impacts, control, measure.
Unit II - Waste Management

Pollution aspects of various industries- Impacts of fossil fuels and transport emissions –
impacts - Municipal solid waste generation and management - Swachh Bharat Mission – E-
waste management - Challenges and activities - Environment and forest conservation –
Greenhouse gases and global warming- climate change.
Unit III - Solar and Thermal Energy

Present energy resources in India and its sustainability - Different types of conventional
power plants-Energy demand scenario in India - Advantage and disadvantage of
conventional Power Plants – Conventional vs. non-conventional power generation - Basics
of Solar Energy, Solar thermal and Solar photovoltaic systems.
Unit IV - Wind and Geo Thermal Energy

Power and energy from wind turbines-Types of wind turbines-Biomass resources Biomass
conversion technologies- Feedstock pre-processing and treatment methods Introduction to
geothermal energy and tidal energy.
Unit V - Agriculture Engineering

Introduction to agriculture engineering -Major crops of India–Types and categories of crops-
Types of farming and cultivation procedures-Different monsoon seasons-Types of irrigation
systems-Major draughts-Agricultural machinery-Dairy farming and its economic
importance.
TEXT BOOKS
1. B. H. Khan, “Non-Conventional Energy Resources”, The McGraw –Hill Second
Edition, 2009.
2. Gilbert M. Masters, “Introduction to Environmental Engineering and Science”,
Prentice Hall, Second Edition, 2003.
3. G.L. Asawa, “Elementary Irrigation Engineering”, New Age International, First
Edition, 2014.
4. Sukhpal Singh, “Agricultural Machinery Industry in India”, Allied Publishers, New
Delhi, 2010.
5. Dilip R. Shah, “Co-Operativization Liberalization and Dairy Industry in India”,
A.B.D. Publishers, 2000.
REFERENCE BOOKS
1. Unleashing the Potential of Renewable Energy in India –World Bank report.
2. G. Boyle, “Renewable energy: Power for a sustainable future”, Oxford University
press, 2004.
COURSE OUTCOMES
At the end of the course, the students will be able
 To understand the important and impact of effort of pollution.
 To know how to manage the municipal solid waste.
 To know the demand of energy and their sustainability.
 To learn the alternative energy resources that reduces pollution.
 To have the basic idea about agriculture and irrigation.
L T P C
ME114 ENGINEERING GRAPHICS
0 0 3 3
COURSE OBJECTIVES
 To provide neat structure of industrial drawing.
 Enables the knowledge about position of the component and its forms.
 Interpretation of technical graphics assemblies.
 Preparation of machine components and related parts.
Unit I - Fundamentals Drawing Standard

Introduction - BIS, dimensioning, lettering, type of lines, scaling- conventions. Geometrical
constructions: Dividing a given straight line into any number of equal parts, bisecting a given
angle, drawing a regular polygon given one side, special methods of constructing a pentagon
and hexagon – conic sections – ellipse – parabola – hyperbola - cycloid – trochoid.
Unit II - Orthographic Projection

Introduction to orthographic projection, drawing orthographic views of objects from their
isometric views - Orthographic projections of points lying in four quadrants, Orthographic
projection of lines parallel and inclined to one or both planes Orthographic projection of
planes inclined to one or both planes. Projections of simple solids - axis perpendicular to
HP, axis perpendicular to VP and axis inclined to one or both planes.
Unit III - Sectioning of Solids

Section planes perpendicular to one plane and parallel or inclined to other plane. Intersection
of surfaces: Intersection of cylinder & cylinder, intersection of cylinder & cone, and
intersection of prisms.
Unit IV - Development of Surfaces

Development of prisms, pyramids and cylindrical & conical surfaces. Isometric and
perspective projection: Isometric projection and isometric views of different planes and
simple solids, introduction to perspective projection, perspective projection of simple solids
prisms, pyramids and cylinders by visual ray method and vanishing point method.
Unit V - Computer Aided Drafting

Introduction to computer aided drafting package to make 2-D drawings. 2D drafting
commands (Auto CAD) for simple shapes – Dimensioning (Based on the assignment,
student will be evaluated for this unit).
TEXT BOOKS
1. Natarajan, K. V., “A text book of Engineering Graphics”, Publication:
Dhanalakshmi Publishers, Chennai, 2006.
2. Venugopal, K. and Prabhu Raja, V., “Engineering Drawing and Graphics +
AutoCAD”, New Age International, 2009.
REFERENCE BOOKS
1. Jolhe, D. A, “Engineering drawing”, Publication: Tata McGraw Hill, 2008.
2. Shah, M. B. and Rana, B. C, “Engineering Drawing”, Pearson Education, 2009.
3. Basant Agarwal and Agarwal C.M, “Engineering Drawing”, Tata McGraw Hill
Publishing Company Limited, New Delhi, 2008.
4. Luzzader, Warren.J. and Duffjohn M, “Fundamentals of Engineering Drawing with
an introduction to Interactive Computer Graphics for Design and Production”,
Eastern Economy Edition, Prentice Hall of India Pvt. Ltd, New Delhi, 2005.
5. Bhatt N. D and Panchal V, “Engineering Drawing”, Publication: Charotar
Publishing House, 2010.
COURSE OUTCOMES
 Perform free hand sketching of basic geometrical constructions and multiple
views of objects.
 Do orthographic projection of lines and plane surfaces.
 Draw projections and solids and development of surfaces.
 Prepare isometric and perspective sections of simple solids.
 Demonstrate computer aided drafting.
\
L T P C
CS102 DATA STRUCTURES
3 0 0 3
COURSE OBJECTIVES
 To introduce basic data structures.
 To analyze applications for the data structures.
 To analyze suitability of searching and sorting techniques for different
applications.
Unit I - Stacks and Queues

Storage structures for arrays - Sparse matrices - Stacks and Queues: Representations and
applications. Recursion, Tower of Hanoi, Double Ended Queue, Priority Queue, Infix to
Postfix, postfix to infix, expression evaluation.
Unit II - Linked Lists
Linked Lists - Linked stacks and queues - Operations on polynomials - Doubly linked lists -
Circularly linked lists - Dynamic storage management - Garbage collection and compaction.
Unit III - Trees

Binary Trees - Binary search trees - Tree traversal - Expression manipulation - Symbol table
construction - Height balanced trees - Minimum spanning trees, B-Trees, B+ Trees,
Applications.
Unit IV - Graphs
Graphs - Representation of graphs - BFS, DFS - Topological sort - Shortest path problems.
String representation and manipulations - Pattern matching, Applications.
Unit V - Sorting and Searching

Sorting Techniques - Selection, Bubble, Insertion, Merge, Heap, Quick, Radix sort and
Address calculation. Linear search - Binary search - Hash table methods.
TEXT BOOK
1. Jean Paul Tremblay and Paul G. Sorenson, “An Introduction to Data Structures with
Applications”, Second Edition, Tata McGraw Hill,26th Reprint 2004.
REFERENCE BOOKS
1. Alfred V. Aho, John E. Hopcroft, Jeffrey D.Ullman, “Data Structure and
Algorithms”, Second Edition, Pearson Education, 2009.
2. Sara Baase and Allen Van Gelder, “Computer Algorithms - Introduction to Design
and Analysis”, Third Edition, Pearson Education, 2008.
COURSE OUTCOMES
 Apply sorting and searching algorithms to the small and large data sets.
 Design and implement abstract data types such as linked list, stack, queue,
graphs and trees using static or dynamic implementations.
 Analyse algorithms and correctness.
 Have knowledge of tree and graphs concepts.
 Choose appropriate data structure as applied to specified problem definition.
L T P C
CS104 DIGITAL COMPUTER FUNDAMENTALS
3 0 0 3
COURSE OBJECTIVES
 To acquire the basic knowledge of digital logic levels and application of
knowledge to understand digital electronics circuits.
 To prepare students to perform the analysis and design of various digital
electronic circuits.
 To learn the fundamental components used in a digital computer which is
essential for the programme.
Unit I - Data and Information

Features of Digital Systems, Number Systems Decimal, Binary, Octal, Hexadecimal and their
inter conversions, Representation of Data: Signed Magnitude, one’s complement and two’s
complement, Binary Arithmetic, Fixed point representation and Floating point representation
of numbers. Codes: BCD, XS-3, Gray code, hamming code, alphanumeric codes (ASCII,
EBCDIC, UNICODE), Error detecting and error correcting codes.
Unit II - Boolean algebra

Basic gates (AND, OR, NOT gates), Universal gates (NAND and NOR gates), other gates
(XOR, XNOR gates). Boolean identities, De-Morgan Laws, Karnaugh maps: SOP and POS
forms, QuineMcClusky method.
Unit III - Combinational Circuits

Half adder, full adder, code converters, combinational circuit design, Multiplexers and de-
multiplexers, encoders, decoders, Combinational design using mux and demux.
Unit IV - Sequential Circuit Design

Flip flops (RS, Clocked RS, D, JK, JK Master Slave, T, Counters, Shift registers and their
types, Counters: Synchronous and Asynchronous counters.
Unit V - Registers and Memory units

Basic Organization, Memory: ROM, RAM, PROM, EPROM, EEPROM, Secondary Memory:
Hard Disk and optical Disk, Cache Memory, I/O devices.
TEXT BOOK
1. M.Morris Mano and Michael D.Ciletti, “Digital Design”, Sixth Edition, Pearson
Education, 2018.
REFERENCE BOOKS
1. R. P. Jain, “Modern Digital Electronics”, Fourth Edition, McGraw Hill
Education, 2009.
2. Malvino and Leach, “Digital Principles and Applications”, Eighth Edition,
McGrawHill, 2014.
3. Peter Norton, “Introduction to Computers”, Seventh Edition, McGraw Hill, 2017.
COURSE OUTCOMES
 Identify the logic gates and their functionality.
 Perform Number Conversions from one system to another system.
 Understand, analyze and design various combinational and sequential circuits.
 Identify and prevent various hazards and timing problems in a digital design.
 Understand the construction of memory.
L T P C
PH114 ENGINEERING PHYSICS LABORATORY
0 0 3 2
COURSE OBJECTIVES
 To enable the students to understand fundamentals of measurement, error
analysis and its impact on results.
 Exposure and to understand basic experiments in different areas of Physics.
 Fundamentals of measurements, error detection, error analysis and usage of
scientific calculator in engineering.
LIST OF EXPERIMENTS
1.Simple harmonic motion.
2. Sonometer- frequency of tuning fork/AC (Melde’s technique).
3. Determination of Young’s modulus- Searle’s dynamical method.
4. Modulus of rigidity using torsion pendulum.
5. Measurement of temperature using thermocouple.
6. Specific heat of liquids by Newton’s law of cooling.
7. B-H curve of ferromagnetic materials.
8. Determination of magnetic field along the axis of a circular coil.
9. (i) Conversion of Galvanometer into ammeter and voltmeter.
(ii) Calibration of voltmeter-Potentiometer.
10. Series LCR circuit-resonance phenomenon.
11. Newton’s rings- determination of radius of curvature of a lens.
12. Determination of wavelength, spot size and divergence of laser.
13. I-V Characteristics of a PN junction diode and Zener diode.
14. Determination of resistivity and band gap of a semiconductor.
15. Charge-discharge characteristics of RC circuit.
18. Introduction to CRO- Lissajous figures.
19. Determination of Planck’s constant.
20. Verification of Photo-electric effect.
REFERENCE BOOKS
1. C.L Arora, B.Sc., “Practical Physics”, S. Chand &Co., 2012.
2. Singh Harnam and Hemne P.S., B.Sc., “Practical Physics”, S. Chand &
Company, 2002.
3. J.D. Wilson and Cecilia A. Hernández-Hall, “Physics laboratory experiments”,
Seventh Edition, Cengage Learning, 2009.
4. R.A. Dunlap, “Experimental Physics: Modern Methods”, Oxford University
Press, 1997.
COURSE OUTCOMES
 Learn appropriate methods for specific characterization.
 Explain the data obtained, analysis and interpretation of the phenomena
exhibited.
 Demonstrate their understanding of physics theoretical concepts through
experiments.
 Develop a confidence in handling various measurement equipments.
 Learn safely and standard lab conduct.
L T P C
CS106 DATA STRUCTURES LABORATORY
0 0 3 2
COURSE OBJECTIVES
 To develop skills to design and analyze simple linear and nonlinear data
structures.
 To gain knowledge in practical applications of data structures.
 To strengthen the ability to identify and apply the suitable data structure for the
given real-world problem.
LIST OF EXERCISES
1. Operations on stacks, queues and linked lists.
2. Doubly Linked List and Circular Linked List Implementation.
3. Implementation of priority queue.
4. Implementation of Sorting
a. Bubble Sort
b. Selection Sort
c. Insertion Sort
d. Quick Sort
e. Merge Sort
f. Heap Sort
5. Implementation of Searching
a. Linear Search
b. Binary Search
6. Implementation of Tower of Hanoi.
7. Implementation of Binary Trees - Height and Depth of a Binary Tree.
8. Implementation of Binary Search Tree.
9. Conversion of infix expressions to postfix and evaluation of postfix expressions
10. Polynomial Evaluation.
11. Tree Traversal: Pre-Order, Post-Order, In-Order, and Level Order Traversals.
12. Graph Representation
a. Breadth First Search
b. Depth First Search
COURSE OUTCOMES
 Implement data structures such as stacks, queues, linked lists, trees and graphs.
 Have practical knowledge on the application of data structures.
 Design and analyse the time and space efficiency of the data structure.
 Identity the appropriate data structure for given problem.
 Discuss different data structures to represent real-world problems.
THIRD SEMESTER
L T P C
MA211 DISCRETE MATHEMATICS
3 0 0 3
COURSE OBJECTIVES
 To get familiar and understand the fundamental notions in discrete
mathematics.
 To introduce logic sets, relations, groups, combination and apply elsewhere in
computer science.
 Able to apply proof techniques of discrete mathematics, and should be able to
solve problems on sets, recurrence relations and groups.
Unit I - Fundamentals
Sets, relations and functions, fundamentals of logic, inference theory, first order logic,
quantified propositions, strong mathematical induction.
Unit II - Elementary Combinatorics

Combinations and permutations, Enumeration – with repetitions, with constrained
repetitions.
Unit III - Distribution

Distinct/non-distinct objects, Generating functions for combinations, Portion of integers;
Unit IV - Recurrence Relations

Generating functions, coefficients of generating functions, recurrence relations with constant
coefficients, inhomogeneous recurrence relations, Solution by the technique of generating
functions. Permutations with restrictions on relative positions.
Unit V - Algebraic Structures

Semi-groups, monoids, groups, subgroups and their properties, cyclic groups, cosets,
permutation groups, Lagrange's theorem, Cayley's theorem, normal subgroups,
homomorphism of groups, quotient groups, rings and fields;
TEXT BOOKS
1. J.L. Mott, A. Kandel, T.P. Baker, “Discrete Mathematics for Computer Scientists”,
Second Edition, Reston, 1986.
2. J.P. Tremblay, “Manohar, Discrete Mathematical Structures with Applications to
Computer Science”, TMH, New Delhi, 2004.
REFERENCE BOOK
1. K.D. Joshi, “Discrete Mathematics”, Wiley Eastern Ltd., 1989.
COURSE OUTCOMES
 Apply induction and other proof techniques towards problem solving.
 Students would be able to argue about limits by using Pigeonhole principle.
 Apply techniques for counting the occurrences of discrete events including
permutations, combinations with or without repetitions.
 Solve problems based on set theory, Permutations and Combinations, as well as
Discrete Probability.
 Students will be able to solve mathematical problems on sets theory and group
theory.
L T P C
CS201 DESIGN AND ANALYSIS OF ALGORITHM
3 0 0 3
COURSE OBJECTIVES
 Learn the algorithm analysis techniques.
 Become familiar with the different algorithm design techniques and the
limitations of Algorithm paradigms.
 To provide examples for various design paradigms.
 To identify the basic properties of graphs and traversals.
Unit I - Introduction
Notion of an Algorithm - Fundamentals of Algorithmic Problem Solving - Important
Problem Types - Fundamentals of the Analysis of Algorithm Efficiency - Analysis
Framework - Asymptotic Notations and its properties - Mathematical analysis for
Recursive and Non-recursive algorithms.
Unit II - Divide-and-Conquer and Greedy Algorithms

Divide and Conquer: General Method - Binary Search - Finding Maximum and Minimum
- Merge Sort - Greedy Algorithms: General Method - Container Loading - Knapsack
Problem.
Unit III - Dynamic Programming and Backtracking
Dynamic Programming: General Method - Warshall’s and Floyd algorithm - Dijikstra's
Algorithm - Optimal Binary Search Trees - Travelling Salesman Problem - Backtracking:
General Method - 8 Queens Problem - sum of subsets - graph coloring - Hamiltonian
problem - knapsack problem.
Unit IV - Graph Algorithms
Introduction - Representation of Graphs - Graph Traversals - Connected components - Bi-
connected components - Articulation point - Spanning trees - Prim’s Algorithm -
Kruskal’s Algorithm.
Unit V - Branch and Bound

Branch and Bound: General Methods (FIFO & LC) – 0/1 Knapsack problem - Introduction
to NP-Hard and NP - Completeness - Decision Trees - P, NP and NP - Complete Problems
- Assignment problem - Traveling Salesman Problem - Approximation Algorithms for NP
Hard Problems - Cook’s theorem.
TEXT BOOK
1. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and
Algorithms”, Pearson Education, Reprint 2006.
REFERENCE BOOKS
1. Thomas H. Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein,
“Introduction to Algorithms”, Third Edition, PHI Learning Private Limited, 2012.
2. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third
3. Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3 Pearson
Education, 2009.
4. Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer,
2008.
COURSE OUTCOMES
 Design algorithms for various computing problems and analyse the time and
space complexity of algorithms.
 Identify algorithm design methodology to solve problems.
 Comprehend the basics in algorithms and data structures.
 Solve problems that involve these concepts/similar problems.
 Distinguish between P and NP classes of problems.
L T P C
CS203 PROGRAMMING PARADIGMS
3 0 0 3
COURSE OBJECTIVES
 To understand fundamentals of OOPS and Logic Programming.
 To understand various functional languages.
 To learn logic programming.
Unit I -Object Oriented Paradigm

Object Oriented Programming Concepts – Classes – Objects – Methods and Messages –
Abstraction and Encapsulation – Inheritance – Abstract Classes – Polymorphism – C++
Fundamentals – I/O operations – Constructors – Destructors – Pointers – String handling
– Function Overloading – Operator Overloading.
Unit II - Inheritance and Polymorphism

Inheritance – Public, Private and Protected Derivations – Multiple Inheritance – Virtual
Base Class – Abstract Class – Virtual Functions – Pure Virtual Functions –Templates.
Unit III - Java Fundamentals

Java Virtual Machine – Reflection – I/O Streaming – Filter And Pipe Streams – Byte
Codes – Byte Code Interpretation – Dynamic Reflexive Classes – Threading – Java
Native Interfaces – GUI Applications.
Unit –IV Functional Languages

Functional Languages: Introduction to Haskell & Erlang, Definition of a function: domain
and range, total and partial functions, strict functions, Recursion, Referential transparency,
Side effects of functions, Higher-Order Functions.
Unit V – Logic Programming

PROLOG: Basic constructs, Facts: queries, existential queries, conjunctive queries and
rules, Definition and semantics of a logic program, Recursive programming:
Computational model of logic programming, Goal reduction, Negation in logic
programming.
TEXT BOOKS
1. Scott M L, “Programming Language Pragmatics”, Third Edition, Morgan
Kaufmann Publishers, 2009.
2. Bjarne Stroustrup, “The C++ Programming Language”, Third Edition, Pearson
Education, 2000.
3. Cay S. Horstmann, Gary Cornell, “Core JAVA Volume 1”, Eighth Edition,
Pearson Education, 2008.
4. P.J. Deitel and H.M. Deitel, “Internet & World Wide Web: How to Program”,
Fourth Edition, Pearson Education, 2009.
REFERENCE BOOKS
1. S. B. Lippman, Josee Lajoie, Barbara E. Moo, “C++ Premier”, Fourth Edition,
2. Robert Lafore, “Object Oriented Programming in C++”, Fourth Edition, Sams
Publishers, 2001.
3. K. Arnold and J. Gosling, “The JAVA programming language”, Third Edition,
4. Robert W. Sebesta, “Programming the World Wide Web”, Sixth Edition, Addison-
Wesley, 2010.
COURSE OUTCOMES
 Implement language features used in OOPS.
 Understand the building structure and elements of computer programs.
 Design user interface applications.
 Design and implement object-oriented software and functional languages to
solve moderately complex problems.
 Understand a logic programming language and code using PROLOG.
L T P C
CS205 AUTOMATA AND FORMAL LANGUAGES
3 0 0 3
COURSE OBJECTIVES
 To introduce concepts in automata theory and theory of computation.
 To identify different formal language classes and their relationships.
 To design grammars and recognizers for different formal languages.
Unit I - Finite Automata (FA)

Deterministic, non-deterministic and equivalence - Equivalence of regular expressions and
FA –Conversion from FA to regular expression- Moore and Mealy machines.
Unit II - Regular Languages

Pumping lemma of regular sets – Myhill Nerode theorem - Minimization of finite
automata - Chomsky hierarchy of languages.
Unit III - Context-Free Language (CFL)

Context-free grammar - Derivation trees - Ambiguity simplification - Normal forms –
Pumping lemma for Context Free Language - Applications.
Unit IV - Pushdown Automata (PDA)

Definitions - Context free languages - Construction of PDA for simple CFLs - Linear
bounded automata.
Unit V - Turing Machines

Universal Turing Machines - Types of Turing Machines - Techniques - Halting problem -
Stack automata - Definitions.
TEXT BOOKS
1. J.E.Hopcroft and J.D.Ullman, "Introduction to Automata Theory, Languages and
Computation”, Pearson Education, Third Edition, 2007.
2. Peter Linz, "An Introduction to Formal Language and Automata", Narosa
Publication House, Fifth Edition, 2011.
REFERENCE BOOKS
1. Harry R.Lewis and Christos H.Papadimitriou, “Elements of the Theory of
Computation”, Prentice-Hall, Second Edition, 1998.
2. Dexter C.Kozen, “Automata and Computability”, Springer Science, 1997.
COURSE OUTCOMES
 Understand the limitations of algorithm and design optimally.
 Relate practical problems to languages, automata, and computability.
 Demonstrate an increased level of mathematical sophistication.
 Apply mathematical and formal techniques for solving problems.
 Design Turing machine.
CS207 COMPUTER ORGANIZATION AND L T P C
ARCHITECTURE 3 0 0 3
COURSE OBJECTIVES
 To understand the basic components and its interaction in a computer system.
 To understand the representation of data at machine level.
 To understand fundamental in building a basic computer.
Unit I - Basic structure of Computers

Operational concepts - Bus structures - Arithmetic operations - Memory operations -
Addressing modes - Basic I/O operations – Performance-RISC – CISC.
Unit II - Arithmetic Unit

Addition & subtraction of signed numbers – Binary Multiplication: Booth‟s algorithm -
Bit pair recoding - Carry save addition - Unsigned Integer multiplication & division
algorithm - Floating point operations.
Unit III - Processing unit

Control unit - Pipelining - Multiple bus organization - Hardwired control - Micro
programmed control - Hazards - Data path - Embedded systems.
Unit IV - Memory System

Basic concepts - Semiconductor RAM memory - Cache memory - Performance
considerations - Virtual memory - Secondary storage.
Unit V - I/O Organization and Logic Circuits

Accessing I/O devices - Interrupts - DMA -Buses - Interface circuits - Serial
communication links – Logic Circuits – Practical Implementation of Logic Gates – Case
studies of various computer architectures.
TEXT BOOK
1. C. Hamacher, Z. Vranesic, S. Zaky, "Computer Organization", Fifth Edition,
McGraw Hill, 2011.
REFERENCE BOOKS
1. David A. Patterson and John L. Hennessy, “Computer Organization and
Design: The Hardware/Software Interface”, Fifth edition, Elsevier 2013.
2. W. Stallings, "Computer Organization and Architecture", Tenth Edition,
Pearson education, 2015.
COURSE OUTCOMES
 Understand digital computers and their fundamental architecture.
 Design Arithmetic Logic Unit.
 Understand functionalities and organization of processor units and their types.
 Identify memory hierarchy and performance.
 Interface I/O devices.
L T P C
CS209 DATA COMMUNICATION
3 0 0 3
COURSE OBJECTIVES
 To understand the fundamental concepts of computer networking.
 To familiarize with the basic taxonomy and terminology of the computer
networking area.
 To gain expertise in design and maintenance of individual networks.
Unit I - Introduction to Data Communication

Introduction: Data Communications, Networks, Network Types, Internet History,
Standards and Administration, Networks Models: Protocol Layering, TCP/IP Protocol
suite, The OSI model, Introduction to Physical Layer-1: Data and Signals, Digital Signals,
Transmission Impairment, Data Rate limits, Performance, Digital Transmission: Digital
to digital conversion (Only Line coding: Polar, Bipolar and Manchester coding).
Unit II - Physical Layer Concepts

Physical Layer-2: Analog to digital conversion (only PCM), Transmission Modes, Analog
Transmission: Digital to analog conversion, Bandwidth Utilization: Multiplexing and
Spread Spectrum, Switching: Introduction, Circuit Switched Networks and Packet
switching.
Unit III - Error Detection and Correction

Error Detection and Correction: Introduction, Block coding, Cyclic codes, Checksum,
Forward error correction, Data link control: DLC services, Data link layer protocols,
HDLC, and Point to Point protocol (Framing, Transition phases only).
Unit IV - Media Access Control

Media Access control: Random Access, Controlled Access and Channelization, Wired
LANs Ethernet: Ethernet Protocol, Standard Ethernet, Fast Ethernet, Gigabit Ethernet and
10 Gigabit Ethernet.
Unit V - Wireless Networks

WIMAX, Cellular Telephony, Satellite networks, Wireless LANs: Introduction, IEEE
802.11 Project and Bluetooth.
TEXT BOOK
1. Behrouz A. Forouzan, Sophia Chung Fegan, “Data Communications and
Networking”, Fifth Edition, Science Engineering & Math Publications, 2012.
REFERENCE BOOK
1. William Stallings, “Data and Computer Communications”, Eighth Edition,
Pearson Education India, 2007.
COURSE OUTCOMES
 Design and develop layers of the OSI model and TCP/IP.
 Gain insight about basic network theory and layered communication
architectures.
 Identify the different types of network topologies and protocols.
 Analyse MAC layer protocols and LAN technologies.
 Identify different types of network devices and their function.
L T P C
CS211 PROGRAMMING PARADIGMS LABORATORY
0 0 3 2
COURSE OBJECTIVES
 To understand the advanced concepts in C++ programming.
 To understand and use the Java SDK environment to create, debug and run
simple Java programs.
 To do logic programming using PROLOG.
LIST OF EXERCISES
I. PROGRAMS USING C++:

1. Structures
2. Arrays
3. Classes and objects
4. Functions
5. Operator Overloading
6. Pointers
7. Inheritance
8. Virtual Functions
9. Input-Output File handling
10. Templates
II. Programs using CORE JAVA
III. Haskell or Erlang commands, functions
IV. PROLOG programs related to facts, rules, queries, lists, recursion
COURSE OUTCOMES
 Write program in specific languages (C++, Java, Haskell/Erlang, PROLOG).
 Implement Object Oriented Concepts.
 Derive solutions using logical programming.
CS213 DESIGN AND ANALYSIS OF ALGORITHM L T P C
LABORATORY 0 0 3 2
COURSE OBJECTIVES
 To learn how to analyze the complexity of algorithms.
 Describe and use major algorithmic techniques divide-and-conquer, dynamic
programming, greedy paradigm and graph algorithms.
LIST OF EXERCISES
1. Implementation of Linear and binary search algorithms with complexity analysis.

2. Implementation of basic sorting methods with complexity analysis.
3. Implementation of Sorting Algorithms using Divide Conquer Technique.
i) Quick Sort
ii) Merge Sort
iii) Heap Sort
4. Implementation of Binary Search Tree Algorithm using Divide Conquer
Technique.
5. Implementation of Minimum Spanning Tree using Prim’s Algorithm.
6. Implementation of Minimum spanning Tree using Kruskal’s Algorithm.
7. Implementation of Knapsack Problem using Greedy method.
8. Implementation of Single source shortest path algorithm using greedy method.
9. Implementation of 8 Queen’s Problem using Backtracking Algorithm.
10. Implementation of All Pair Shortest Path Algorithm using Floyd’s Algorithm.
11. Implementation of Travelling Salesman Problem using Dynamic Programming.
12. Implementation of Multistage Graphs using Dynamic Programming.
13. Implementation of 0/1 Knapsack using dynamic programming.
COURSE OUTCOMES
 Implement and analyze internal and external sorting algorithms.
 Design, develop, and optimize algorithms in different paradigms.
 Implement graph algorithms.
 Understand varied programming methodologies such as Divide and conquer,
Dynamic programming, Greedy approach.
 Implement and empirically compare fundamental algorithms and data
structures to real-world problems.
FOURTH SEMESTER
L T P C
MA212 PROBABILITY AND STATISTICS
3 0 0 3
COURSE OBJECTIVES
 To introduce the fundamental concepts and theorems of probability theory.
 To apply elements of stochastic processes for problems in real life.
 To understand elementary queuing concepts and apply elsewhere in computer
science.
Unit I
Introduction to Probability, random variables (discrete and continuous), probability
functions, density and distribution functions, mean and variance, special distributions
(Binomial, Poisson, Uniform, exponential and normal).
Unit II
Chebyshev Inequality, Law of Large Numbers, Central Limit Theorem, Estimation, Point
Estimation, Bayesian Estimation.
Unit III
Testing of Hypothesis, Null and alternative hypothesis, level of significance, one-tailed and
two-tailed tests, tests for large samples (tests for single mean, difference of means, single
proportion, difference of proportions), tests for small samples (t-test for single mean and
difference of means, F-test for comparison of variances).
Unit IV
Chi-square test for goodness of fit, analysis of variance (one way classification with the
samples of equal and unequal sizes), Karl Pearson coefficient of correlation, lines of
regression.
Unit V
Queuing theory: Elements of Queuing model, Exponential distribution, Pure Birth and Pure
Death Models, M/M/1 model with finite capacity and infinite capacity.
TEXT BOOKS
1. S.C. Gupta, V.K. Kapoor, “Fundamentals of Mathematical Statistics”, Sultan Chand,
2000.
2. W. Feller, “An Introduction to Probability Theory and its Applications”, Volume 2,
Third edition, Wiley Eastern, New Delhi, 2008.
3. K. S. Trivedi, “Probability and Statistics with Reliability and Queuing and Computer
Science Applications”, Prentice Hall of India, 1988.
REFERENCE BOOKS
1. O. Allen, “Introduction to Probability, Statistics and Queueing Theory with
Computer Science Applications”, Academic Press, Reprint 2006.
2. A. Papoulis, “Probability Random Variables and Stochastic Processes”, McGraw
Hill, 2002.
COURSE OUTCOMES
 Conceptualize the necessity of randomness concept in practical situation.
 Approximate the real problems using stochastic process and deduce results.
 Understand the concepts of probability and statistics.
 Test the hypothesis for small and large samples.
 Deduce useful results and interpret them based on the analysis of queuing theory.
L T P C
CS202 COMPUTER NETWORKS
3 0 0 3
COURSE OBJECTIVES
 To understand the division of network functionalities into layers.
 To familiarize with the components required to build different types of networks.
 To be exposed to the required functionality at each layer.
Unit I - Fundamentals and Link Layer

Building a network – Requirements – Layering and protocols – Internet Architecture –
Network software – Performance; Link layer Services – Framing – Error Detection – Flow
control.
Unit II - Media Access & Internetworking

Media access control – Ethernet (802.3) – Wireless LANs – 802.11 – Bluetooth – Switching
and bridging – Basic Internetworking (IP, CIDR, ARP, DHCP, ICMP).
Unit III - Routing

Routing (RIP, OSPF, metrics) – Switch basics – Global Internet (Areas, BGP, IPv6),
Multicast – addresses – multicast routing (DVMRP, PIM).
Unit IV - Transport Layer

Overview of Transport layer – UDP – Reliable byte stream (TCP) – Connection management
– Flow control – Retransmission – TCP Congestion control – Congestion avoidance
(DECbit, RED) – QoS – Application requirements.
Unit V - Application Layer

Traditional applications -Electronic Mail (SMTP, POP3, IMAP, MIME) – HTTP – Web
Services – DNS – SNMP.
TEXT BOOK
1. Andrew S Tanenbaum and David J Wetherall, “Computer Networks” Fifth Edition,
Pearson, 2012.
REFERENCE BOOKS
1. William Stallings, “Data and Computer Communications”, Eighth Edition, Pearson
Education India, 2007.
2. Behrouz A. Forouzan and Sophia Chung Fegan, “Data Communications and
Networking”, Fifth Edition, Science Engineering & Math Publications, 2012.
COURSE OUTCOMES
 Identify the components required to build different types of networks.
 Provide solutions to various problems in network theory.
 Implement routing and congestion control algorithms.
 Identify the lacunae in the existing protocols of various layers of the protocol
stack and propose.
 Create communication between hosts.
L T P C
CS204 SOFTWARE ENGINEERING
3 0 0 3
COURSE OBJECTIVES
 To understand the importance of software engineering lifecycle models in
the development of software.
 To understand the various design principles in modelling a software.
 To develop a software which adheres to the standard benchmarks.
Unit I - Software Life Cycle Models

Software Process Introduction – S/W Engineering Paradigm – life cycle models: waterfall,
incremental, spiral, winwin spiral, Agile, evolutionary, prototyping – Object Oriented life
cycle models-system engineering – computer-based system – life cycle process –
development process.
Unit II - Requirements
Software Requirements: Functional & non-functional – user-system requirement
engineering process – feasibility studies – elicitation – validation & management – software
prototyping – S/W documentation – Analysis and modelling – Case Tools.
Unit III - Design

Design Concepts and Principles Modular design – design heuristic – Software architecture
– data design – architectural design – transform & transaction mapping –Introduction to
SCM process – Software Configuration Items.
Unit IV - Testing
Software Testing Taxonomy of Software testing – levels - black box testing – testing
boundary conditions – structural testing –– regression testing– Software testing strategies –
unit testing – integration testing – validation testing – system testing and debugging –
Traceability matrix.
Unit V - Software Project Management

Software cost estimation - Function point models – COCOMO model –Project Scheduling-
Delphi method – Software challenges – Software Maintenance-Reliability – Reliability and
availability models.
TEXT BOOK
1. R.S.Pressman, "Software Engineering - A practitioners approach", Eighth Edition,
McGraw Hill International editions, 2014.
REFERENCE BOOKS
1. Ian Somerville, “Software Engineering”, Tenth Edition, Pearson Education, 2015.
2. Hans van Vliet, “Software Engineering: Principles and Practice”, Third edition, John
Wiley & Sons, 2008.
3. Stephen R. Schach, "Object oriented and classical software Engineering", Fourth
Edition, McGraw Hill, 2002.
4. Rajib Mall, "Fundamentals of Software Engineering", Fourth Edition, Prentice-Hall
of India Pvt. Ltd., 2014.
COURSE OUTCOMES
 Identify the appropriate software technique to solve the issue.
 Design and develop a software product in accordance with Software Engineering
principles.
 Apply software design and development techniques.
 Implement testing methods at each phase of SDLC.
 Enhance the Software Project Management skills.
L T P C
CS206 PYTHON PROGRAMMING
3 0 0 3
COURSE OBJECTIVES
 To develop Python programs with conditionals, loops and functions.
 To use Python data structures – lists, tuples, dictionaries.
 To explore various file operations and OOPS and advanced concepts.
Unit I - Basics of Python Programming

The way of the program - Variables, expressions and statements - Functions - Case Study:
interface design - Conditionals and recursion - Fruitful functions - Iteration - Strings - Case
Study: word play.
Unit II - Lists, Strings

Lists, tuples, and dictionaries - basic list operators - replacing - inserting - removing an
element - searching and sorting lists - dictionary literals - adding and removing keys -
accessing and replacing values - traversing dictionaries - String manipulations: subscript
operator, indexing, slicing a string; strings and number system.
Unit III - Files and OOPS

Files: Reading and Writing, Format operator, Filenames and path, Databases, Pickling,
Pipes, Writing Modules - Classes and functions - Inheritance - Data encapsulation - data
modeling - persistent storage of objects polymorphism - operator overloading abstract
classes - exception handling.
Unit IV - GUI
Graphical user interfaces; event - driven programming paradigm; tkinter module, creating
simple GUI; buttons, labels, entry fields, dialogs; widget attributes - sizes, fonts, colours
layouts, nested frames - Plotting - Data Visualisation and Regular expression - Design
Patterns.
Unit V - Advanced Concepts

Role of Python in Hacking and cyber Forensics - Debugging – Hooking - Case studies.
TEXT BOOKS
1. Allen B. Downey, “Think Python: How to Think Like a Computer Scientist”, Second
Edition, Updated for Python 3, Shroff O‘Reilly Publishers, 2016.
2. Guido van Rossum and Fred L. Drake Jr, “An Introduction to Python –Revised and
updated for Python 3.2”, Network Theory Ltd., 2011.
REFERENCE BOOK
1. Martin C. Brown, “Python, the complete Reference”, Tata McGraw-Hill, 2001.
COURSE OUTCOMES
 Structure simple Python programs for solving problems.
 Represent compound data using Python lists, tuples and dictionaries.
 Read and write data from/to files in Python Programs.
 Develop GUI applications for various modules.
 Explore python’s role in different fields.
L T P C
EC212 MICROPROCESSOR AND MICROCONTROLLERS
3 0 0 3
COURSE OBJECTIVES
 To understand the concepts of Architecture of 8086 microprocessor.
 To understand the architecture and programming of 8051 microcontroller,
ARM processor.
 To understand the design aspects of I/O and Memory Interfacing circuits.
Unit I - 8086 Microprocessor

8086 Architecture – Basic configurations – Registers – Addressing Modes – Instruction Set
and assembler directives – Introduction to Multiprogramming – System Bus Structure
Multiprocessor configurations – Coprocessor.
Unit II - 8051 Microcontroller

Architecture of 8051 – Special Function Registers (SFRs) - I/O Pins Ports and Circuits –
Instruction set - Addressing modes - Programming 8051 Timers - Serial Port Programming
- Interrupts Programming
Unit III - Interfacing

Interfacing of Keyboard and Display Devices – Interfacing of Sensors, Transducers,
Actuators, A/D and D/A converters – Analog signal conditioning circuits – Data acquisition
systems – External Memory Interface - Stepper Motor, DC Motor - Standard interfaces:
RS232, USB.
Unit IV - Introduction to Embedded Systems

Complex systems and microprocessors– Embedded system design process – Instruction sets
preliminaries - ARM Processor – CPU: programming input and output supervisor mode,
exceptions and traps – Memory system mechanisms – CPU performance.
Unit V - Embedded Computing Platform Design and Optimization

The CPU Bus-Memory devices and systems–Designing with computing platforms –
platform level performance analysis - Components for embedded programs-Models of
programs Assembly, linking and loading – compilation techniques- Program level
performance analysis – Software performance optimization.
TEXT BOOKS
1. 1. Yu-Cheng Liu and Glenn A.Gibson, “Microcomputer Systems: The 8086 / 8088
Family Architecture, Programming and Design”, Second Edition, Prentice Hall of
India, 2007.
2. Mohamed Ali Mazidi and Janice GillispieMazidi, RolinMcKinlay, “The 8051
Microcontroller and Embedded Systems: Using Assembly and C”, Second Edition,
3. Marilyn Wolf, “Computers as Components - Principles of Embedded Computing
System Design”, Third Edition, Morgan Kaufmann Publisher (An imprint from
Elsevier), 2012.
REFERENCE BOOKS
1. Doughlas V. Hall, “Microprocessors and Interfacing Programming and Hardware”,
Tata McGraw-Hill, 2012.
2. Jonathan W.Valvano, “Embedded Microcomputer Systems Real Time Interfacing”,
Third Edition, Cengage Learning, 2012.
3. David. E. Simon, “An Embedded Software Primer”, First Edition, Fifth Impression,
Addison-Wesley Professional, 2007.
COURSE OUTCOMES
 Design and implement programs on 8086 microprocessor.
 Design using 8051 microcontroller.
 Design I/O circuits and Memory Interfacing circuits.
 Design and develop components of ARM processor.
 Optimize the platform design.
L T P C
CS208 COMPUTER NETWORKS LABORATORY
0 0 3 2
COURSE OBJECTIVES
 To understand the network topologies.
 To understand the socket communication and routing protocols.
 To study the behaviour of TCP and UDP.
LIST OF EXERCISES
1. Study of different types of Network cables and practically implement the cross-
wired cable and straight through cable using clamping tool.
2. Study of basic Network commands and Network configuration commands.
3. Learn the usage of TCP Dump and Wireshark utilities for packet inspection.
4. Client Server Program using TCP sockets
 Date and Time Server
 Chat application
5. Simulation of Sliding Window Protocol
6. Implementation of routing protocols
 OSPF, BGP
7. Client Server Program using UDP
 DNS Implementation
 Chat application
COURSE OUTCOMES
 Script the basic network commands.
 Understand about packet analyzers.
 Implement client server-based communication using TCP and UDP.
 Implement the routing protocols.
 Implement packet-based data transmission protocols.
L T P C
CS210 PYTHON PROGRAMMING LABORATORY
0 0 3 2
COURSE OBJECTIVES
 Design algorithms for specified engineering problems.
 Analyze complex engineering problems and develop solutions.
 To learn about File management concepts.
LIST OF EXERCISES
1. Programs using control statements.
2. Programs using Functions and recursive functions.
3. Programs using functions with Pass by value.
4. Programs using functions with Pass by reference.
5. Programs using Arrays.
6. Programs using lists, tuples, dictionaries.
7. Programs to perform I/O operations on files.
8. Programs to perform error handling during I/O operations on files.
9. Programs to perform random access to files.
10. Programs to implement inheritance and Polymorphism.
11. Develop GUI applications.
12. Mini Project.
COURSE OUTCOMES
 Write program in Python language.
 Manage file operations.
 Develop User Interfaces.
MICROPROCESSORS AND L T P C
EC214
MICROCONTROLLERS LABORATORY 0 0 3 2
COURSE OBJECTIVES
 To understand and learn the assembly language programming of various
microprocessor architectures.
 To obtain the practical training of interfacing the peripheral devices with the
processor.
 To impart a practical knowledge on assembling PC hardware, installation and
troubleshooting the Microprocessor and Microcontrollers.
LIST OF EXPERIMENTS
Simple Experiments using 8086 and 8051

1. Arithmetic Operations
- Addition, Subtraction, Multiplication, Division
2. Code Conversion
- Binary to Gray, Gray to Binary, Hexa to decimal, Decimal to Hexa
3. Bit manipulation
- Counting 0s/1s in a byte
- Multiplication by shift and add
4. Loop operation
- Finding smallest / largest number in an array of inputs
- Sorting an array as ascending / descending
5. Array Handling
- Moving an array
- Sum and Average of an array
Interfacing with 8086 and 8051
1. ADC & DAC Interfacing
2. Stepper Motor and DC Motor Interfacing
3. Push Button, SPDT switches and LED Interfacing
COURSE OUTCOMES
 Write programs in assembly language using trainer kits.
 Running/ testing assembled program on 8086/ 8051 Kit.
 Ability to interface development kits effectively for the real time applications of
various peripheral devices with the processor.
 Utilize development kits effectively for the real time applications of various
peripheral devices with the processor.
 Design interfacing devices with the microprocessor.
FIFTH SEMESTER
L T P C
CS301 DATABASE MANAGEMENT SYSTEM
3 0 0 3
COURSE OBJECTIVES
 To understand the different database models and language queries to access
databases.
 To understand the normalization forms in building effective database tables.
 To protect the data and the database from unauthorized access and
manipulation.
Unit I - Databases
Need - Concepts - Architecture - Data independence - Data modeling: Entity-relationship
model - Weak entity sets - Mapping ER model to Relational model.
Unit II - Relational Models
Integrity constraints - Relational algebra - Relational calculus - Tuple relational calculus –
Domain relational calculus - SQL Queries.
Unit III - Schema Refinement
Functional dependencies, Normalization, Decomposition – Armstrong’s axioms, 3NF-
BCNF - 4NF, Multi-valued dependencies.
Unit IV - Storage and Indexing
Disk Storage, Basic File Structures, Hashing, Indexing Structures for Files
Unit V - Transaction and Query Processing
Transaction Management, Concurrency Control, serializability, Locking Protocols, deadlock,
System recovery, Query Processing and optimization, Physical Database Design and Tuning
TEXT BOOKS
1. A.Silberchatz, F.Korth, S.Sudarshan, "Database System Concepts", Seventh Edition,
McGraw Hill, 2010.
2. R.Elmasri and S.B.Navathe, "Fundamentals of Database Systems", Seventh Edition,
REFERENCE BOOK
1. Raghu Ramakrishnan and Johannes Gehrke, ”Database Management Systems”,
Third Edition, McGraw-Hill, 2002.
COURSE OUTCOMES
 Have a broad understanding of database concepts.
 Write SQL commands to create tables and indexes, insert/update/delete data, and query
data in a relational DBMS.
 Use design principles for logical design of databases, including the E‐ R method and
normalization approach.
 Be familiar with basic database storage structures and access techniques.
 Be familiar with the basic issues of transaction processing and concurrency control,
know the basics of query evaluation techniques and query optimization.
L T P C
CS303 OPERATING SYSTEMS
3 0 0 3
COURSE OBJECTIVES
 To understand the basic concepts and functions of operating systems.
 To understand processes, threads, and scheduling algorithms.
 To understand the critical regions and deadlock problem.
 To understand virtual memory concept, thrashing problem and page replacement
algorithms.
 To understand the file tables, access algorithms, and disk scheduling algorithms.
Unit I - Basic OS Concepts

Overview of Operating Systems, functionalities and characteristics of OS, hardware
concepts related to OS, CPU states, CPU scheduling. I/O channels, Memory hierarchy,
microprogramming, process, threads, PCB.
Unit II - Synchronization
Signals, forks and pipes, interrupt processing, Peterson's solution - Bakery algorithm -
Hardware-based solutions - Semaphores - Critical regions - Problems of synchronization -
Deadlock prevention and recovery - Banker's algorithms.
Unit III - Memory Management

Swapping – Contiguous Memory Allocation – Paging – Segmentation – Segmentation with
Paging – Virtual Memory – Demand Paging – Process Creation – Page Replacement –
Allocation of Frames – Thrashing.
Unit IV - File Systems

File Concept – Access Methods – Directory Structure – File System Mounting – File Sharing
– Protection – File System Structure – File System Implementation – Directory
Implementation – Allocation Methods – Free Space Management.
Unit V - I/O Systems

Kernel I/O Subsystem – Disk Structure – Disk Scheduling – Disk Management – Swap
Space Management – RAID Structure – Case study on Linux System – Case study on
Windows XP.
TEXT BOOK
1. Silberchatz, P. B. Galvin, "Operating System Concepts", Addison Wesley, Tenth
Edition, 2018.
REFERENCE BOOKS
1. Tannenbaum, “Modern Operating Systems”, Third Edition, Prentice Hall, 2009.
2. W. Stallings, "Operating Systems", Prentice Hall, Fifth Edition, 2005.
3. S. Godbole, A. Kahate, “Operating Systems”, Mc Graw Hill Education, 2016.
COURSE OUTCOMES
 Describe the important computer system resources and the role of operating
system in their management policies and algorithms, understand the process
management policies and scheduling of processes by CPU.
 Evaluate the requirement for process synchronization and coordination handled
by operating system.
 Describe and analyze the memory management and its allocation policies.
 Identify use and evaluate the storage management policies with respect to
different storage management technologies.
 Implement Disk scheduling algorithms, describe the various Data Structures and
algorithms used by Different OS’s like Linux and Windows XP operating with
Process, File, I/O management.
L T P C
CS305 UNIX PROGRAMMING
3 1 0 4
COURSE OBJECTIVES
 To understand the fundamental design of the UNIX operating system.
 To become fluent with the Application Programming Interfaces (APIs) provided
in the Unix environment.
 To be able to design and build an application/service over the UNIX operating
system.
UNIX Architecture- UNIX system Overview- Unix Standardization- POSIX- BSD- Flavors
of UNIX- BSD- Linux- Mac OS- Solaris ISO C Limits- POSIX Limits- Primitive System
Data types – shell programming.
Unit II - UNIX File APIs

General File APIs- File and Record Locking- Directory File APIs- Device File APIs- FIFO
file APIs- Symbolic Kink File APIs- General File Class- regfile Class for Regular Files-
dirfile Class for Directory File- FIFO file Class- Device File Class- Symbolic Link File
Class- File Listing Program.
Unit III - UNIX Processes

The Environment of a UNIX Process- main function- Process termination- command-line
arguments- Environment List- Memory Layout of a C Program- Shared Libraries- Memory
Allocation- Environment Variables- setjmp and longjmp functions- getrlimit- setrlimit
functions- UNIX Kernel Support for Processes.
Unit IV - Process Control and Signals

Process Identifiers- fork- vfork- exit- wait- waitpid- race conditions- exec functions-
changing user ids- Interpreter files- systems function- Process Accounting- User
Identification- Process Times. Signals: The Unix Kernel Support for Signals- Signal Mask-
sigaction- the SIGCHLD signal and waitpid function- the sigsetjmp and siglongjmp
functions- Kill- Alarm- Interval Timers.
Unit V - Daemon Processes and Inter Process Communication

Daemon Processes- Daemon Characteristics- Daemon Conventions- client-servier Model.
Inter Process Communication- Pipes- popen- pclose- FIFOs- Message Queues- Semaphores
– case study.
TEXT BOOK
1. W. Richard Stevens, “Advanced Programming in the UNIX Environment”, Second
Edition, Pearson Education/PHI, 2005.
REFERENCE BOOKS
1. Terrance Chan, “Unix System Programming Using C++”, Prentice Hall India, 1999.
2. Marc J Rochkind, “Advanced Unix Programming”, Second Edition, Pearson
Education, 2005.
3. Maurice J Bach, “The design of the UNIX Operating System”, First Edition, Pearson
Education/PHI, 1987.
COURSE OUTCOMES
 Understand the basic functioning of UNIX operating systems and shell
programming, acquire knowledge of various standards that are applicable to
UNIX system programmers.
 Acquire knowledge of UNIX and POSIX file APIs which are used to create,
open, read, write and close all types of files in a system.
 Understand the environment of a C program in a UNIX systems environment and
the process control features of UNIX.
 Understand the relationships between groups of processes: sessions which are
made up of process groups, understand the signal handling methods in UNIX and
POSIX.1 systems.
 Acquire knowledge of numerous forms of interprocess communication various
means where process could generate signals to other process or to itself.
CS307 ARTIFICIAL INTELLIGENCE AND EXPERT L T P C
SYSTEMS 3 0 0 3
COURSE OBJECTIVES
 To obtain a thorough knowledge of various knowledge representation
schemes.
 To have an overview of various AI applications.
 To study about various heuristic and game search algorithms.
 To know about various Expert System tools and applications.
 To know about basic concepts of NLP.
Unit I – Introduction
History of AI - Intelligence, Knowledge, and Human artifice – Overview of AI application
Areas –Propositional Calculus - Predicate Calculus - Using Inference Rules to Produce
Predicate Calculus Expressions - Application: A Logic-Based Financial Advisor.
Unit II - Searching Techniques

Graph Theory- Strategies for State Space Search- Using the State Space to Represent
Reasoning with the Predicate Calculus- Hill Climbing and Dynamic Programming- The
Best-First Search Algorithm- A* algorithm- Admissibility, Monotonicity, and
Informedness- Using Heuristics in Games- Complexity Issues.
Unit III - Stochastic Methods and Implementation

The Elements of Counting- Elements of Probability Theory- Applications of the
Stochastic Methodology- Bayes’ Theorem - Recursion-Based Search- Production
Systems- The Blackboard Architecture for Problem Solving.
Unit IV - Representation and Reasoning
Issues in Knowledge Representation- A Brief History of AI Representational Systems-
Conceptual Graphs: A Network Language- Alternative Representations and Ontologies-
Agent Based and Distributed Problem Solving- Overview of Expert System Technology-
Rule-Based Expert Systems- Model-Based, Case Based and Hybrid Systems- Logic-
Based Abductive Inference- Abduction: Alternatives to Logic- The Stochastic Approach
to Uncertainty.
Unit V - Natural Language Processing
Introduction to Weak Methods in Theorem Proving- The General Problem Solver and
Difference Tables- Resolution Theorem Proving- PROLOG and Automated Reasoning-
The Natural Language Understanding Problem- Deconstructing Language: An Analysis-
Syntax- Transition Network Parsers and Semantics- Stochastic Tools for Language
Understanding- Natural Language Applications- AI: Current Challenges and Future
Directions.
TEXT BOOK
1. G. Luger, “Artificial Intelligence, Structures and Strategies for Complex Problem
Solving”, Sixth Edition, Addison-Wesley Pearson, 2008.
REFERENCE BOOK
1. E. Rich, K. Knight and B. Nair, “Artificial Intelligence”, McGraw Hill, Third

Edition, 2009.
COURSE OUTCOMES
 Compare AI with human intelligence and traditional information processing,
discuss its strengths,limitations and its application to complex and human-
centered problems.
 Analyze and formalize the problem as a state space, graph, design heuristics and
select amongst different search or game based techniques to solve them.
 Formulate and solve problems with uncertain information using Bayesian
approaches.
 Apply Artificial Intelligence techniques for problem solving, design AI functions
and components involved in intelligent systems, such as computer games and
Expert Systems.
 Apply concept Natural Language processing to problems leading to
understanding of cognitive computing and acquaintance with programming
language PROLOG.
CS309 DATABASE MANAGEMENT SYSTEM L T P C
LABORATORY 0 0 3 2
COURSE OBJECTIVES
 To understand basic concepts and terminology related to DB and storage
management.
 To program simple database applications in MySQL.
 To implement database connectivity.
LIST OF EXERCISES
Exercises are based on MySQL
1. Applications involving vendor development systems, storage management

system, financial management etc.
2. Creation and querying of database tables.
3. Writing application software with host language interface.
4. Database connectivity.
5. Mini project.
COURSE OUTCOMES
 Design Tables and Views with Constraints.
 Write queries for design and manipulation of database tables using MySQL.
 Apply normalization procedures is in the database tables.
 Demonstrate the working of Database connectivity.
 Implement, analyze and evaluate the project developed for an application.
L T P C
CS311 OPERATING SYSTEMS LABORATORY
0 0 3 2
COURSE OBJECTIVES
 To understand and write program in Unix environment.
 To design and implement the scheduling algorithms.
 To design and implement advanced file system operations.
LIST OF EXERCISES
1. Learning applications of System Calls Using Fork (), Sleep (), Wait ().
2. Implementation of CPU Scheduling Algorithm.
a. First Come First Serve Scheduling
b. Shortest Job First Scheduling
c. Priority Scheduling
d. Round Robin Scheduling
3. Implementing of Producer-Consumer Problem Using Semaphore.
4. Implementing Bakery Algorithm (Critical Section Problem).
5. Implementing Banker’s Algorithm (Deadlock Avoidance).
6. Simulate Paging technique of Memory Management.
7. Implementation of File Systems
a. Basic File Operations
b. File Operation – I
c. File Operation – II
8. Implementing Page Replacement Algorithm
a. First in First out (FIFO Page Replacement)
b. Least Recently Used (LRU Page Replacement)
c. Optimal Page Replacement
COURSE OUTCOMES
 Familiarize with the shell commands in Unix environment.
 Build ‘C’ program for process and file system management using system calls.
 Choose the best CPU scheduling algorithm for a given problem instance.
 Develop algorithm for deadlock avoidance, detection and file allocation
strategies.
 Identify the performance of various page replacement algorithms.
SIXTH SEMESTER
L T P C
HM312 CORPORATE COMMUNICATION
3 0 0 3
COURSE OBJECTIVES
 To introduce the students to the corporate world and culture.
 Enhance their communication and soft skills, and thereby enabling them to apply
this knowledge in the global world outside.
 Equip the students with LSRW subskills, so as to functions effectively in the
global world.
Unit I - Communication in the Corporate World

Corporate culture and communication, Presentation Skills, Group Dynamics, Group
Discussions, Corporate Branding- Captions and eye catchers, Communication in Crisis,
Marketing Language.
Unit II - Basics of Spoken English

Pronunciation Practice – MTI and Accent neutralization, Conversation Practice, Dialect,
Sociolect, Varieties of English: RP, GAE, and GIE.
Unit III - Technical Writing Skills

Mechanics of Technical Writing, Summary writing on graphs, tables, charts etc., Business
Proposals, Report Writing - Oral and Written Reports.
Unit IV - Reading for Specific Purposes

Reading technical reports/articles, Primary and Secondary literature, Structure of a research
article, Glossary, Index, Reference and bibliography.
Unit V - Soft Skills

Relationship between Soft skills and Communication Skills, Leadership Skills, Team
management Skills, Interview Skills, Telephone etiquettes.
TEXT BOOKS
1. Raymond V. Lasikar and Marie E. Flatley. “Basic Business Communication”, Tata
McGraw Hill, 2005.
2. Meenakshi Raman and Sangeeta Sharma, “Technical Communication: Principles
and Practice”, OUP Publication, 2014.
3. M. Ashraf Rizvi, “Effective Technical Communication”, Tata McGraw Hill, 2005.
REFERENCE BOOKS
1. David Lindsay, “A Guide to Scientific Writing”, Macmillan, 1995.
2. Richard A Boning, “Multiple Reading Skills”, McGraw Hill, 1990.
3. Rod Ellis, “English for Engineers & Technologists: A Skill Approach”, Orient
Blackswan, Reprint 2003.
4. Dhamija and Sasikumar, “Spoken English”, McGraw Hill Education, 2015.
5. C. Bovee and C.A. Paul, “Business Communication Today”, Pearson, 2018.
COURSE OUTCOMES
 Become professionally adept in the use of English in work space, and gain
confidence in dealing with people of different culture across the globe.
 Understand the concept of technical writing and evaluate the importance of
documentation in it.
 Integrate language with content specific subject knowledge through task-based
activities.
 Systematically put forward the ideas in an effective manner to the global world.
 Inculcate a research favour and temperament.
L T P C
CS302 PRINCIPLES OF COMPILER DESIGN
3 0 0 3
COURSE OBJECTIVES
 To enrich the knowledge in various phases of compiler ant its use, code
optimization techniques, machine code generation, and use of symbol table.
 To extend the knowledge of parser by parsing LL parser and LR parser.
 To learn code optimization techniques.
Unit I - Introduction to Compilers
Structure of a compiler – Lexical Analysis – Role of Lexical Analyzer – Input Buffering –
Specification of Tokens – Recognition of Tokens – Lex – Finite Automata – Regular
Expressions to Automata – Minimizing DFA.
Unit II - Syntax Analysis

Role of Parser – Grammars – Error Handling – Context-free grammars – Writing a grammar
– Top Down Parsing – General Strategies Recursive Descent Parser - Predictive Parser-
LL(1) Parser-Shift Reduce Parser-LR Parser-LR (0) Item Construction of SLR Parsing Table
-Introduction to LALR Parser – Error Handling and Recovery in Syntax Analyzer-YACC.
Unit III - Intermediate Code Generation

Syntax Directed Definitions, Evaluation Orders for Syntax Directed Definitions,
Intermediate Languages: Syntax Tree, Three Address Code, Types and Declarations,
Translation of Expressions, Type Checking.
Unit IV - Run-Time Environment and Code Generation

Storage Organization, Stack Allocation Space, Access to Non-local Data on the Stack, Heap
Management – Issues in Code Generation – Design of a simple Code Generator.
Unit V - Code Optimization

Principal Sources of Optimization – Peep-hole optimization – DAG- Optimization of Basic
Blocks-Global Data Flow Analysis – Efficient Data Flow Algorithm.
TEXT BOOK
1. A.V. Aho, Monica, R.Sethi, J.D.Ullman, "Compilers, Principles, Techniques and
Tools", Second Edition, Pearson Education/Addison Wesley, 2009.
REFERENCE BOOKS
1. Andrew W. Appel, “Modern Compiler Implementation in Java”, Second Edition,
2009.
2. J.P. Tremblay and P.G. Sorrenson, “The Theory and Practice of Compiler Writing”,
McGraw Hill, 1985.
COURSE OUTCOMES
 Understand the major phases of compilation and to understand the knowledge of
Lex tool & YAAC tool.
 Develop the parsers and experiment the knowledge of different parsers design
without automated tools.
 Construct the intermediate code representations and generation.
 Convert source code for a novel language into machine code for a novel computer.
 Apply for various optimization techniques for dataflow analysis.
L T P C
CS304 WEB TECHNOLOGY
3 0 0 3
COURSE OBJECTIVES
 To understand the basics of Web Designing using HTML, DHTML, and CSS.
 To learn the basics about client-side scripts and server-side scripts.
 To design and deploy web services.
Unit I - Basics of Markup Language

HTML- List, Tables, Images, Forms, Frames, Cascading Style sheets. XML- Document type
definition, XML Schemas, Document Object model, Data Formats –XML, JSON, CBOR.
Unit II - Introduction to JavaScript

Java Script -Control statements, Functions, Arrays, Objects, Events, Dynamic HTML with
Java Script.
Unit III - Web Servers and its Applications

Web servers – IIS (XAMPP, LAMPP) and Tomcat Servers. Java Web Technologies-
Servlets, JavaServer Pages, Java Server Faces, Web Technologies in Netbeans, Building a
Web Application in Netbeans, JSF Components, Session Tracking, Cookies.
Unit IV - Angular JS
Introduction - Data Binding – Modules – Scopes – Controllers – Expressions – Filters –
Directives - Module Loading - Multiple Views and Routing - Dependency Injection –
Services – XHR – Server Communication – Testing – Events – Caching – Security –
Optimization
Unit V - Web Services and Ajax

Web Services: Introduction to Web Services, UDDI, SOAP, WSDL, Web Service
Architecture, Developing and deploying web services. Ajax – Improving web page
performance using Ajax, Programming in Ajax.
TEXT BOOKS
1. Paul J. Deitel, Harvey M. Deitel, Abbey Deitel, “Internet & World Wide Web How
to Program”, Deitel series, Fifth Edition, 2018.
2. Ari Lerner, “ng-book The Complete Book on AngularJS”, Fullstack.io, 2013.
3. Ron Schmelzer, Travis Vandersypen, Jason Bloomberg, Madhu Siddalingaiah, Sam
hunting, Micheal D.Qualls, David Houlding, Chad Darby, Diane Kennedy, “XML
and Web Services”, Sams, Feburary, 2002.
REFERENCE BOOKS
1. Eric Newcomer, “Understanding Web Services: XML, WSDL, SOAP, and UDDI”,
Addison-Wesley, 2002.
2. Mathew Eernisse, “Build Your Own AJAX Web Applications”, SitePoint, 2006.
COURSE OUTCOMES
 Understand, analyze and create web pages using HTML, DHTML and Cascading
Styles sheets.
 Analyze and build dynamic web pages using server-side programming.
 Install Tomcat Server and execution of programs on server side and identify the
problems in Servlets and overcome those using Java Server Pages also develop JSP
applications with Model View Control architecture.
 Build real client apps with Angular on their own.
 Understand, analyze and build web services, make the web pages more dynamic and
interactive.
HM312 ENGINEERING ETHICS AND PRECEPTS OF L T P C
CONSTITUTION OF INDIA 3 0 0 0
COURSE OBJECTIVES
 To create an awareness on Engineering Ethics.
 To identify individual role and ethical responsibility towards society.
 To Know the Human rights and its implications, know features of our
constitution.
Unit I - Engineering Ethics

Engineering Ethics - Senses of ‘Engineering Ethics’ – Variety of Moral Issues – Types of
Inquiry – Moral Dilemmas – Moral Autonomy – Kohlberg’s theory – Gilligan’s theory –
Consensus and Controversy – Models of professional Roles - Theories about right action –
Self-interest – Customs and Religion – Uses of Ethical Theories. Valuing Time – Co-
operation – Commitment.
Unit II - Engineering as Social Experimentation

Engineering as Social Experimentation - Engineering as Experimentation – Engineers as
responsible Experimenters – Codes of Ethics – A Balanced Outlook on Law – The
Challenger Case Study.
Unit III - Safety, Responsibilities and Rights

Safety, Responsibilities and Rights - Safety and Risk – Assessment of Safety and Risk –
Risk Benefit Analysis and Reducing Risk – The Three Mile Island and Chernobyl Case
Studies.
Unit IV - Global Issues

Global Issues - Multinational Corporations – Environmental Ethics – Computer Ethics –
Weapons Development – Engineers as Managers – Consulting Engineers – Engineers as
Expert Witnesses and Advisors – Moral Leadership.
Unit V - Indian Constitution & Human Rights

Constitution of India – Preamble – Fundamental Rights and Duties- Role of Parliament and
Legislatures in Federal Setup, Law and Justice – Human Rights and Protection of Human
rights- Place of Official Languages and Education pertinent to Concurrent List –
Perspectives of Indian issues on Trade and Commerce - Role parliament to impose restriction
of Trade, Commerce and Intercourse.
TEXT BOOK
1. Magbook, “Indian Polity and Governance”, Arihant Experts, 2018.
REFERENCE BOOKS
1. S.K. Kapoor, “Human Rights”, Seventh Edition, 2017.
2. Durga Das Basu, “Introduction to the Constitution of India”, Prentice, 2015.
COURSE OUTCOMES
 Understand Engineering ethics and responsibilities of Engineers.
 Practice the moral values that ought to guide the Engineering profession.
 Know the definitions of risk and safety also discover different factors that affect
the perception of risk.
 Discover about corporate, computer and environment ethics to address the
Global issues.
 Know the successful functioning of democracy in India and have an awareness
about basic human rights in India.
L T P C
CS306 COMPILER DESIGN LABORATORY
0 0 3 2
COURSE OBJECTIVES
 To provide a deep insight into the various programmatic stages in building a
Compiler.
 To implement different kinds of parsers.
 Emphasis on problem solving and implementation of code and to optimize the
code using a universal subset of the C programming language.
LIST OF EXERCISES
1. Design of lexical analyzers and parsers like recursive-descent parser for a block
structured language with typical constructs.
2. Exercises using LEX and YACC.
3. C/C++ Program on Left Recursion elimination and Left factoring, SLR, and LALR.
4. Quadruples/Triples generation using LEX and YACC for a subset of a block

structured language.
COURSE OUTCOMES
 Complete understanding of the working principles of a compiler.
 Design and implementation of lexical analyzer using lex,YACC tools.
 Implement the parsing techniques.
 Demonstrate simple code generation techniques.
L T P C
CS308 WEB TECHNOLOGY LABORATORY
0 0 3 2
COURSE OBJECTIVES
 To develop skills in Web Designing using HTML, DHTML, and CSS.
 To develop programming skills in using client-side and server-side scripting
languages.
 To develop web applications.
LIST OF EXERCISES
1. Designing a static web page using HTML.
2. Designing a dynamic webpage using JAVASCRIPT.
3. Programs using Java Applets.
4. Working with AWT and different layouts in Java.
5. Display digital clock in website using Ajax.
6. Programming using Angular JS.
7. Programming using UDDI, SOAP, WSDL.
8. Mini Project.
COURSE OUTCOMES
 Programming skill set in developing internet applications.
 Create a static web pages using HTML and CSS and dynamic web pages using
AJAX.
 Develop JavaScript code for data validation.
 Develop dynamic web apps using Angular JS.
 Know how on developing sophisticated web sites and web applications.
SEVENTH SEMESTER
INDUSTRIAL ECONOMICS AND L T P C
HM411
MANAGEMENT 3 0 0 3
COURSE OBJECTIVES
 To understand the basic concepts of Industrial Economics.
 To understand the basic concepts of production.
 To understand markets, functions of management and marketing management.
Unit I - Introduction to Economics

Definitions, Nature, Scope, Difference between Microeconomics & Macroeconomics
Theory of Demand & Supply; meaning, determinants, law of demand, law of supply,
equilibrium between demand & supply Elasticity; elasticity of demand, price elasticity,
income elasticity, cross elasticity.
Unit II - Theory of production

Introduction to production function, meaning, factors of production (meaning &
characteristics of Land, Labour, capital & entrepreneur), Law of variable proportions & law
of returns to scale Cost; meaning, short run & long run cost, fixed cost, variable cost, total
cost, average cost, marginal cost, opportunity cost. Break even analysis; meaning,
explanation, numerical.
Unit III - Markets

Introduction, types of markets & their characteristics (Perfect Competition, Monopoly,
Monopolistic Completion, Oligopoly) National Income; meaning, stock and flow concept,
NI at current price, NI at constant price, GNP, GDP, NNP, NDP, Personal income, disposal
income.
Unit IV - Introduction to Management

Definitions, Nature, scope Management & administration, skill, types and roles of managers
Management Principles; Scientific principles, Administrative principles, Maslow’s
Hierarchy of needs theory. Functions of Management: Planning, Organizing, Staffing,
Directing, controlling (meaning, nature and importance) Organizational Structures;
meaning, principles of organization, types-formal and informal, line, line & staff, matrix,
hybrid (explanation with merits and demerits), span of control, departmentalization.
Unit V - Introduction to Marketing management

Marketing Mix, concepts of marketing, demand forecasting and methods, market
segmentation Introduction to Finance Management; meaning, scope, sources, functions.
Introduction to Production Management - definitions, objectives, functions, plant layout-
types & factors affecting it, plant location- factors affecting it. Introduction to Human
Resource Management - definitions, objectives of manpower planning, process, sources of
recruitment, process of selection.
TEXT BOOKS
1. R.Paneerselvam, “Engineering Economics”, PHI publication, Second Edition, 2013.
2. Robbins S.P. and Decenzo David A, ” Fundamentals of Management: Essential
Concepts and Applications”, Pearson Education, Tenth Edition, 2016.
3. N Gregory Mankiw, “Economics: Principles of Economics”, Cengage Learning,
Eighth Edition, 2017.
REFERENCE BOOKS
1. L.M.Prasad , “Principles and Practices of Management”, Eighth Edition, 2013.
2. Tripathy and Reddy, “Principles of Management”, Fifth Edition, 2012.
3. Dr. K. K. Dewett and M. H. Navalur, “Modern Economic Theory”, S.Chand
Publications, 2006.
COURSE OUTCOMES
 Help the students to understand the fundamental concepts and principles of
management and marketing.
 Function on a multidisciplinary team.
 Identify, formulate, and solve engineering problems.
 An understanding of professional and ethical responsibility.
 Communicate effectively.
 Get a knowledge of contemporary issues.
L T P C
CS401 COMPUTER GRAPHICS
3 0 0 3
COURSE OBJECTIVES
 To understand the basics of various inputs and output computer graphics
hardware devices.
 Exploration of fundamental concepts in 2D and 3D computer graphics.
 To know 2D raster graphics techniques, 3D modelling, geometric
transformations, 3D viewing and rendering.
Unit I - Introduction to computer graphics & graphics systems
Overview of computer graphics, storage tube graphics display, Raster scan display. Points
& lines, Line drawing algorithms, DDA algorithm, Bresenham’s line algorithm, Circle
generation algorithm, Ellipse generating algorithm, scan line polygon, fill algorithm,
boundary fill algorithm, flood fill algorithm.
Unit II - 2D transformation & viewing

Basic transformations: translation, rotation, scaling, Matrix representations & homogeneous
coordinates, transformations between coordinate systems, reflection shear, Transformation
of points, lines, parallel lines, intersecting lines. Viewing pipeline, Window to viewport co-
ordinate transformation, clipping operations, point clipping, line clipping, clipping circles,
polygons & ellipse.
Unit III - 3D transformations

translation, rotation, scaling & other transformations. Rotation about an arbitrary axis in
space, reflection through an arbitrary plane, general parallel projection transformation;
clipping, viewport clipping, 3D viewing.
Unit IV - Curves
Curve representation, surfaces, designs, Bezier curves, B-spline curves, end conditions for
periodic B-spline curves, rational B-spline curves. Hidden surface Detection: Depth
comparison, Z-buffer algorithm, Back face detection, BSP tree method, the Printer’s
algorithm, scan-line algorithm, Hidden line elimination, wire frame methods.
Unit V - Color & shading models

Light & color model, interpolative shading model, Flat shading, Phong shading, Gouraud
shading, Lambert lighting model, Phong lighting model, Blinn-Phong lighting model,
Texture.
TEXT BOOKS
1. Donald Hearn and Pauline Baker, “Computer Graphics with OpenGL”, Fourth
edition, Pearson Education, 2013.
2. F.S. Hill, ”Computer Graphics using OPENGL”, Third edition, Pearson Education,
2006.
REFERENCE BOOK
1. John F. Hughes, Andries van Dam, Morgan McGuire, David F. Sklar, James D.
Foley, Steven K. Feiner, Kurt Akeley, “Computer Graphics- Principles and practice”,
Third Edition in C, Pearson Education, 2013.
COURSE OUTCOMES
 Understand the various computer graphics hardware and display technologies.
 Implement various 2D objects transformation and viewing techniques.
 Implement various 3D objects transformation and viewing techniques.
 Understand curve detection and algorithms.
 Apply color and shading models to real world applications.
L T P C
CS403 MACHINE LEARNING
3 0 0 3
COURSE OBJECTIVES
 Learn about supervised and unsupervised learning.
 Study about Classification algorithms and its applications.
 Learn the importance of dimensionality reduction methods.
 Study advanced topics like Q learning, genetic algorithms.
Introduction to machine Learning – Types of Machine Learning –Applications - Supervised
Learning – The Brain and the Neuron – Design a Learning System – Perspectives and Issues
in Machine Learning – Concept Learning Task – Concept Learning as Search –Finding a
Maximally Specific Hypothesis – Version Spaces and the Candidate Elimination Algorithm-
Perceptron – Linear Separability – Linear Regression.
Unit II -Unsupervised Learning

Clustering–Applications- Metrics - Partitional Clustering - K means Algorithms – K-
mediods - Hierarchical clustering – Density based clustering: DBSCAN, Mean-Shift
clustering - Vector Quantization - Self Organizing Feature Map.
Unit III - Classification Methods

Classification metrics –Confusion matrix - Neural Network model - Multi-layer Perceptron
- Decision tree - Support Vector Machines- K-Nearest Neighbour – Boosting and Bagging -
Convolutional Neural Network.
Unit IV - Dimensionality Reduction

Dimensionality Reduction - Linear Discriminant Analysis - Principal Component Analysis
(PCA)- Factor Analysis - Independent Component Analysis. Feature selection: Filter and
Wrapper methods. Rank based algorithms.
Unit V - Advanced Topics

Reinforcement learning - Non deterministic rewards and Actions – Q Learning – Genetic
Algorithm. Tools for machine learning. Case study IRIS dataset using Weka: Classification,
Feature selection – Case study.
TEXT BOOK
1. T.M. Mitchell, “Machine Learning”, McGraw-Hill, 1997.
REFERENCE BOOKS
1. Ethern Alpaydin, “Introduction to Machine Learning”, MIT Press, 2004.
2. Stephen Marsland, “Machine Learning -An Algorithmic Perspective”, Second
Edition, Chapman and Hall/CRC Machine Learning and Pattern Recognition Series,
2014.
COURSE OUTCOMES
 Gain knowledge about basic concepts of Machine Learning.
 Identify machine learning techniques suitable for a given problem.
 Solve the problems using various machine learning techniques.
 Apply Dimensionality reduction techniques.
 Design application using machine learning techniques.
DEPARTMENT ELECTIVES FOR FIFTH SEMESTER
L T P C
CS321 GRAPH THEORY
3 0 0 3
COURSE OBJECTIVES
 Understand the importance of graph theory with respect to computer science
applications and application of the basic corollaries and theorems learnt.
 To apply graph theory based tools in solving practical problems.
 To understand and apply the fundamental concepts in graph theory.
Graphs – Introduction – Isomorphism – Sub graphs – Walks, Paths, Circuits –
Connectedness – Components – Euler Graphs – Hamiltonian Paths and Circuits – Trees –
Properties of trees – Distance and Centers in Tree – Rooted and Binary Trees.
Unit II - Trees, Cut-sets, Connectivity

Spanning trees – Fundamental Circuits – Finding All Spanning Trees of a Graph – Cut Sets
– Properties of Cut Set – All Cut Sets – Fundamental Circuits and Cut Sets – Connectivity
and Separability.
Unit III - Planarity

Combinational and Geometric Graphs – Planar Graphs – Kuratowski‟s Two Graphs –
Different Representation of a Planar Graph-Geometric Dual –Combinatorial Dual.
Unit IV - Matrices, Colouring and Directed graph

Incidence matrix – Circuit Matrix – Path Matrix – Adjacency Matrix – Chromatic Number
– Chromatic partitioning – Chromatic polynomial – Matching – Covering – Four Color
Problem – Directed Graphs – Types of Directed Graphs – Digraphs and Binary Relations –
Euler Graphs – Adjacency Matrix of a Digraph.
Unit V - Graph Theoretic Algorithms

Algorithms: Connectedness and Components – Spanning tree – Set of Fundamental Circuits
– Cut Vertices and Separability – Shortest Path Algorithm – Depth First Search – Planarity
Testing – Isomorphism.
TEXT BOOK
1. NarsighDeo, “Graph Theory: With Application to Engineering and Computer
Science”, Prentice Hall of India, 2003.
REFERENCE BOOK
1. R.J. Wilson, “Introduction to Graph Theory”, Fourth Edition, Pearson Education,
2003.
COURSE OUTCOME
 Use the concepts learnt in graph theory in designing algorithms for real world
applications.
 Write precise and accurate mathematical definitions of objects in graph theory.
 Use mathematical definitions to identify and construct examples.
 Use a combination of theoretical knowledge and independent mathematical
thinking in creative investigation of questions in graph theory.
 Validate and critically assess a mathematical proof.
L T P C
CS323 WIRELESS AD HOC NETWORKS
3 0 0 3
COURSE OBJECTIVES
 To understand the challenges of ad hoc networks.
 To understand the Network Protocol design for Wireless Ad Hoc Networks.
 To be able to correlate with application scenarios.
Unit I - Adhoc Wireless

Cellular and ad hoc wireless networks, Applications of ad hoc wireless networks. Issues in ad
hoc wireless networks-medium access scheme, routing, transport layer protocols, security and
energy management. Adhoc wireless internet.
Unit II - MAC Protocol

Design goals of a MAC protocol, Contention based protocols; Contention based protocols with
reservation mechanisms and scheduling mechanisms, MAC protocols using directional
antennas.
Unit III - Adhoc Routing Protocols

Table driven routing protocols, on demand routing protocols, hybrid routing protocols,
Hierarchical routing protocols, Power aware routing protocols, Tree based and mesh based
multicast routing protocols.
Unit IV - Security Mechanism

Network security requirements - Issues and challenges, network security attacks, key
management, secure routing protocols.
Unit V - Energy Management Adhoc Network and QoS

Energy management schemes-Battery management, transmission power management, system
power management schemes, Quality of service solutions in ad hoc wireless networks.
TEXT BOOK
1. C. Siva Ram Murthy and B.S. Manoj, “Ad Hoc Wireless Networks architectures and
Protocols”, Pearson, Sixth printing, 2008.
REFERENCE BOOKS
1. C K Toh, “Ad Hoc Mobile Wireless Networks Protocols and Systems”, Pearson, 2009.
2. Ozan K. Tonguz, Gianluigi Ferrari, “Ad Hoc Wireless Networks – A Communication-
Theoretic Perspective”, Wiley, 2009.
COURSE OUTCOMES
 Compare the differences between cellular and ad hoc networks and the analyse the
challenges at various layers and applications.
 Summarize the protocols used at the MAC layer and scheduling mechanisms.
 Compare and analyse types of routing protocols used for unicast and multicast
routing.
 Examine the network security solution and routing mechanism.
 Evaluate the energy management schemes and Quality of service solution in ad hoc
networks.
L T P C
CS325 JAVA PROGRAMMING
3 0 0 3
COURSE OBJECTIVES
 Comprehension of java programming constructs, control structures in java.
 Implementing object-oriented constructs such as various class hierarchies,
interfaces and exception handling.
 Understanding of thread concepts and I/O in java.
Unit I - Introduction to OOPS

Introduction to object-oriented programming - principles of object-oriented languages -
procedural languages Vs. OOPs - applications of OOPs - java features - program structures
- Variables - primitive data types – identifiers - naming conventions – keywords – literals –
operators – binary - unary and ternary – expression - precedence rules and associativity -
primitive type conversion and casting.
Unit II - Programming Constructs

Control statements – arrays- one dimensional and multidimensional - command line
arguments. Introducing classes – class fundamentals – methods - objects - constructors – this
keyword – garbage collection.
Unit III - Inheritance, Interface and Exceptions

Types of inheritance - interface - interface vs abstract classes - packages-creating packages
- access protection -java.lang package - exception handling techniques - user defined
exception– assertions.
Unit IV - Multithreading And I/O

Threads - thread priority – multithreading – Synchronization - suspending and resuming
threads - communication between threads. Java I/O streaming – filter and pipe streams.
Unit V - Collection Frameworks

Collection Framework in Java – Introduction to Java Collections, Overview of
Java Collection frame work, Generics, Commonly used Collection classes– Array List,
Vector, Hash table, Stack, Enumeration, Iterator, String Tokenizer, Random, Scanner,
calendar and Properties
TEXT BOOK
1. Herbert Scheldt,” The complete reference java”, Tenth Edition, TMH, 2017.
REFERENCE BOOKS
1. Y.Daniel Liang, “Introduction to Java programming”, Sixth Edition , Pearson, 2014.
2. E.Balaguruswamy, “Programming with JAVA”, Fifth Edition, TMH, 2014.
COURSE OUTCOMES
 Knowledge of the structure and model of the Java programming language.
 Use the Java programming language for various programming technologies.
 Develop software in the Java programming language.
 Evaluate user requirements for software functionality required to decide whether
the Java programming language can meet user requirements.
 Propose the use of certain technologies by implementing them in the Java
programming language to solve the given problem.
CS327 INFORMATION THEORY AND CODING L T P C
3 0 0 3
COURSE OBJECTIVES
 Mutual information, entropy for discrete ensembles, Shannon's noiseless coding
theorem, Encoding of discrete sources.
 To enhance knowledge of probabilities, entropy, measures of information.
 Techniques of coding and decoding, Huffman codes and uniquely detectable
codes, Cyclic codes, convolutional arithmetic codes.
Unit I - Entropy, Relative Entropy, and Mutual Information

Entropy, Joint Entropy and Conditional Entropy, Relative Entropy and Mutual Information,
Chain Rules, Data-Processing Inequality, Fano’s Inequality. Typical Sequences and
Asymptotic Equipartition Property: Asymptotic Equipartition Property Theorem,
Consequences of the AEP: Data Compression, High-Probability Sets and the Typical Set.
Unit II - Source Coding and Data Compression

Kraft Inequality, Huffman Codes, Optimality of Huffman Codes. Channel Capacity:
Symmetric Channels, Properties of Channel Capacity, Jointly Typical Sequences, Channel
Coding Theorem, Fano’s Inequality and the Converse to the Coding Theorem.
Unit III - Differential Entropy and Gaussian Channel

Differential Entropy, AEP for Continuous Random Variables, Properties of Differential
Entropy, Relative Entropy, and Mutual Information, Coding Theorem for Gaussian
Channels.
Unit IV- Linear Binary Block Codes

Introduction, Generator and Parity-Check Matrices, Repetition and Single-Parity-Check
Codes, Binary Hamming Codes, Error Detection with Linear Block Codes, Weight
Distribution and Minimum Hamming Distance of a Linear Block Code, Hard-decision and
Soft-decision Decoding of Linear Block Codes, Cyclic Codes, Parameters of BCH and RS
Codes, Interleaved and Concatenated Codes.
Unit V - Convolutional Codes

Encoder Realizations and Classifications, Minimal Encoders, Trellis representation, MLSD
and the Viterbi Algorithm, Bit-wise MAP Decoding and the BCJR Algorithm.
TEXT BOOKS
1. Thomas Cover and Joy Thomas, “Elements of Information Theory”, Second Edition,
2006.
2. William Ryan and Shu Lin, “Channel Codes: Classical and Modern”, Cambridge
University Press, 2009.
REFERENCE BOOKS
1. Robert Gallager, “Information Theory and Reliable Communication”, 1969.
2. N. Abramson, “Information and Coding”, McGraw Hill, 1963.
3. M. Mansurpur, “Introduction to Information Theory”, McGraw Hill, 1987.
4. R.B. Ash, “Information Theory”, Prentice Hall, 1970.
5. Shu Lin and D.J. Costello Jr., “Error Control Coding”, Prentice Hall, 1983.
COURSE OUTCOMES
 Design the channel performance using Information theory.
 Calculate the information content of a random variable from its probability
distribution.
 Construct efficient codes for data on imperfect communication channels.
 Apply linear block codes for error detection and correction.
 Apply convolution codes for performance analysis and cyclic codes for error
detection and correction.
L T P C
CS329 COMPUTATIONAL COMPLEXITY
3 0 0 3
COURSE OBJECTIVES
 To important insights to have emerged from Theoretical Computer Science is
that computational problems can be classified according to how difficult they are
to solve.
 Try to identify at what extent we need randomness in computation.
 This course deals with some of the computational complexity theory aspects.
Unit I - NP and NP Completeness
Review of Complexity Classes, NP and NP Completeness, Space Complexity, Hierarchies,
Circuit satisfiability, Karp Lipton Theorem.
Unit II – Randomized Computation

Randomized Computation classes, Randomized Polynomial Time (RP), Bounded
Probabilistic Polynomial Time (BPP), Zero-error Probabilistic Polynomial (ZPP),
Randomized Reductions, Counting Complexity, Permanent’s and Valiant’s Theorem.
Unit III – Complexity Classes
Review of Interactive Proofs, Lower bounds: Randomized Decision Trees, Yao’s minimax
lemma, Communication Complexity, Multiparty Communication Complexity.
Unit IV - Average case Complexity
Advanced Topics: Selected topics from Average case Complexity, Polynomial hierarchy,
Toda’s theorem and Hardness of Approximation, Quantum Computation.
Unit V- Interactive Proofs
Graph Isomorphism problem, Goldwasser-Sipser theorem, Interactive Proofs, Shamir’s
theorem.
TEXT BOOK
1. Sanjeev Arora and Boaz Barak, “Computational Complexity: A Modern Approach”,
Cambridge University, 2009.
REFERENCE BOOKS
1. Papadimtriou C. H., “Computational Complexity”, Addison Wesley, First Edition,
1993.
2. Motwani R, “Randomized Algorithms”, Cambridge University Press, 1995.
3. Vazirani V., “Approximation Algorithms”, Springer, First Edition, 2004.
4. Mitzenmacher M and Upfal E., “Probability and Computing, Randomized
Algorithms and Probabilistic Analysis”, Cambridge University Press, 2005.
COURSE OUTCOMES
 Analyse the complexity of a variety of problems and algorithms.
 Find a polynomial time reduction from one problem to another.
 Determine the complexity class of a decidable problem.
 Be familiar with the complexity classes P, NP, NP-hard and others.
 Be able to evaluate specific algorithm in terms of worst and average-case
complexity of performance.
L T P C
CS331 OBJECT ORIENTED ANALYSIS AND DESIGN
3 0 0 3
COURSE OBJECTIVES
 To understand basic OO analysis and design skills through an elaborate case
study.
 To understand the UML design diagrams.
 To understand design based on requirements.
 To impart of converting design to code.
 To apply the appropriate design patterns.
Unit I - OOAD Basics

Introduction – Overview of object-oriented system development – Object basics-The
Unified Process – Modeling concepts – Modeling as a design technique – Analysis and
modeling – UML diagrams – Use case Modeling – Class modeling – State modeling –
Interaction Modeling.
Unit II - Requirements & More Modeling

Object Constraint Language - Inception – Evolutionary Requirements – Domain Models –
System Sequence Diagrams – Operation Contracts.
Unit III - Design and Principles of Design

Requirements to Design – Design Patterns – Logical Architecture – Package diagram –
Design patterns – Model, View, Control pattern – Detailed design – Object design with
GRASP pattern – Detailed class diagram with Visibility.
Unit IV - Mapping to Code

Mapping designs to code – Test Driven development and refactoring – UML Tools and UML
as blueprint.
Unit V - More Patterns

More Patterns – Analysis update – Objects with responsibilities – Applying design patterns
– Architectural Analysis – Logical Architecture Refinement – Package Design – Persistence
framework with patterns.
TEXT BOOKS
1. Michael Blaha and James Rumbaugh, “Object-oriented modeling and design with
UML”, Prentice-Hall of India, 2012.
2. Craig Larman, “Applying UML and Patterns-An introduction to Object-Oriented
Analysis and Design and Iterative Development”, Third Edition, Pearson Education,
2008.
REFERENCE BOOKS
1. Ali Bahrami, “Object Oriented Systems Development”, McGraw-Hill, 2017.
2. Booch and Grady, “Object Oriented Analysis and Design”, Third Edition, Pearson
Education, 2007.
3. Fowler and Martin, “UML Distilled”, Third Edition, Pearson Education, 2004.
4. Lunn and Ken, “Software development with UML”, Palgrave Macmillan, 2003.
5. O’Docherty and Mike, “Object-Oriented Analysis & Design”, Wiley, 2005.
COURSE OUTCOMES
 Demonstrate a thorough knowledge of one object-oriented method down to
detailed design.
 Implement a detailed object-oriented design in an object-oriented language.
 Critically evaluate issues of patterns and structure in object-oriented
development.
 Develop, explore the conceptual model into various scenarios and applications.
 Apply the concepts of architectural design for deploying the code for software.
L T P C
CS333 DISTRIBUTED SYSTEMS
3 0 0 3
COURSE OBJECTIVES
 To impart advanced technologies for developing distributed systems.
 To understand the development of Microkernel, Distributed algorithms, Time
stamping in distributed systems.
 To understand the assumptions and limitations of the underlying distributed
systems.
Unit I - Distributed Systems

Introduction: Goal - Advantages over centralized systems - Organization of multiprocessor
systems - Hardware/software concepts - Review of layered protocols.
Unit II - Client/Server Model

Microkernel - RMI - Distributed algorithms - Time stamping - Circulating tokens - Diffusing
computations.
Unit III - Mutual Exclusion Algorithm

Synchronisation in Distributed system. Logical clock. Mutual exclusion. Election algorithm
- Detecting loss of tokens and regeneration - Distributed deadlock detection algorithms -
Distributed termination algorithms.
Unit IV - File Replication

Semantics of file sharing - Remote access methods - Fault tolerant issues - Introduction to
distributed operating systems.
Unit V - Distributed Operating Systems

Motivations - Management systems - Levels of distribution transparency - Architecture -
Introduction to concurrency control. Synchronisation in distributed OS.
TEXT BOOKS
1. George Coulouris and Jean Dollimore, and Tim Kindberg, "Distributed System
Concepts and Design", Fifth Edition, Pearson Education, 2013.
2. A. S. Tanenbaum, "Distributed Operating Systems", Pearson Education, 2009.
REFERENCE BOOK
1. S. Ceri and G.Pelagatti, "Distributed Databases - Principles and Systems", McGraw
Hill, 2017.
COURSE OUTCOMES
 Identify the advantages and challenges in designing distributed algorithms.
 Understand, implement and describe common algorithms and techniques that
are required in a modern distributed system.
 Compare different implementation strategies that are possible when designing
a distributed system.
 Differentiate between different types of faults and fault handling techniques in
order to implement fault tolerant systems.
 Analyze different algorithms and techniques for the design and development of
distributed systems subject to specific design and performance constraints.
DEPARTMENT ELECTIVES FOR SIXTH SEMESTER
L T P C
CS322 SOFTWARE TESTING
3 0 0 3
COURSE OBJECTIVES
 Expose the criteria for test cases.
 Learn the design of test cases.
 Be familiar with test management and test automation techniques.
 Be exposed to test metrics and measurements.
Testing as an Engineering Activity – Testing as a Process – Testing axioms – Basic
definitions – Software Testing Principles – The Tester’s Role in a Software Development
Organization – Origins of Defects – Cost of defects – Defect Classes – The Defect
Repository and Test Design – Defect Examples – Developer/Tester Support of Developing
A Defect Repository – Defect Prevention strategies.
Unit II – Test Case Design

Test case Design Strategies – Using Black Bod Approach to Test Case Design – Random
Testing – Requirements based testing – Boundary Value Analysis – Equivalence Class
Partitioning – Statebased testing – Cause-effect graphing – Compatibility testing – user
documentation testing – domain testing – Using White Box Approach to Test design – Test
Adequacy Criteria – static testing vs. structural testing – code functional testing – Coverage
and Control Flow Graphs – Covering Code Logic – Paths – code complexity testing
Evaluating Test Adequacy Criteria.
Unit III – Levels of Testing

The need for Levers of Testing – Unit Test – Unit Test Planning – Designing the Unit Tests
– The Test Harness – Running the Unit tests and Recording results – Integration tests –
Designing Integration Tests – Integration Test Planning – Scenario testing – Defect bash
elimination System Testing – Acceptance testing – Performance testing – Regression
Testing – Internationalization testing – Ad-hoc testing – Alpha, Beta Tests – Testing OO
systems – Usability and Accessibility testing – Configuration testing – Compatibility testing
-Testing the documentation – Website testing.
Unit IV – Test Management

People and organizational issues in testing – Organization structures for testing teams –
testing services – Test Planning – Test Plan Components – Test Plan Attachments – Locating
Test Items – test management – test process – Reporting Test Results – The role of three
groups in Test Planning and Policy Development – Introducing the test specialist – Skills
needed by a test specialist – Building a Testing Group.
Unit V – Test Automation

Software test automation – skill needed for automation – scope of automation – design and
architecture for automation – requirements for a test tool – challenges in automation – Test
metrics and measurements – project, progress and productivity metrics – Case study using
latest frameworks.
TEXT BOOK
1. Srinivasan Desikan and Gopalaswamy Ramesh, “Software Testing – Principles and

Practices”, Pearson Education, 2006.
REFERENCE BOOK
1. Ron Patton, “Software Testing”, Second Edition, Sams Publishing, Pearson
Education, 2007.
COURSE OUTCOMES
 Identify suitable tests to be carried out.
 Prepare test planning based on the document.
 Document test plans and test cases designed.
 Use of automatic testing tools.
 Develop and validate a test plan.
L T P C
CS324 ADVANCED COMPUTER ARCHITECTURE
3 0 0 3
COURSE OBJECTIVES
 To understand the fundamental knowledge in architecture design, pipelined
processor design, and their impacts on performance.
 To understand the fundamental knowledge in memory hierarchy.
 To assess the communication and the computing possibilities of parallel
system architecture.
Fundamentals of computer Architecture, Power, Febrication, Amdahl’s law, Iron’s Law,
Measuring and reporting performance. Pipelining: The Major Hurdle of Pipelining—
Pipeline Hazards, stalls, data dependencies, handling hazards How Is Pipelining
Implemented? What Makes Pipelining Hard to Implement? Extending the MIPS Pipeline to
Handle Multicycle Operations.
Unit II - Instruction-Level Parallelism and Its Exploitation

Instruction-Level Parallelism: Concepts and Challenges, Basic Compiler Techniques for
Exposing, Reducing Branch Costs with Prediction, BTB, BHT, Bit predictor, History
Predictor, RAS.
Unit III - Overcoming Data Hazards with Dynamic Scheduling, Dynamic Scheduling
Examples and the Algorithm, Tumasulo Algorithm, ROB, Load Store Queue, Hardware-
Based Speculation, Exploiting ILP Using Multiple Issue and Static Scheduling. Multiple
Issue and Speculation, Advanced Techniques for Instruction Delivery and Speculation,
VLIW, Super Scalar Processor - Limits on Instruction-Level Parallelism: Limitations on ILP
for Realizable Processors, Hardware versus Software Speculation, Multithreading.
Unit IV - Multiprocessors and Thread-Level Parallelism

Symmetric Shared-Memory Architectures, Distributed Shared Memory and Directory-
Based Coherence, Synchronization, Models of Memory Consistency, Case studies of recent
processors.
Unit V - Memory Hierarchy Design

Eleven Advanced Optimizations of Cache Performance, Memory Technology and
Optimizations, Protection: Virtual Memory and Virtual Machines. The Design of Memory
Hierarchies, Cache Performance, Cache Optimization Techniques.
TEXT BOOK
1. David Patterson and John L. Hennessy, “Computer Architecture: A Quantitative
Approach”, Fifth Edition, Morgan Kaufmann, 2011.
REFERENCE BOOK
1. K. Hwang, “Advanced Computer Architecture, Parallelism, Scalability,
Programmability”, Third Edition, McGraw Hill, New York, 2015.
COURSE OUTCOMES
 Understand the sequential changes in computer architecture.
 Understand parallelism both in terms of a single processor and multiple
processors.
 Understand parallel hardware constructs.
 Develop the skill in thread level parallelism on multiprocessor systems.
 Develop the ability to design various levels of memories.
L T P C
CS326 MOBILE COMMUNICATION
3 0 0 3
COURSE OBJECTIVES
 To understand the fundamentals of mobile communication.
 To understand the architecture of various Wireless Communication
Networks.
 To understand the significance of different layers in mobile system.
Introduction to Wireless Networks – Applications – History – Simplified Reference Model
– Wireless transmission – Frequencies – Signals – Antennas – Signal propagation –
Multiplexing – Modulation – Spread spectrum – Cellular Systems: Frequency Management
and Channel Assignment- types of hand-off and their characteristics.
Unit II - MAC and GSM

MAC – Motivation – SDMA, FDMA, TDMA, CDMA –Telecommunication Systems –
GSM: Architecture-Location tracking and call setup- Mobility management- Handover-
Security- GSM SMS –International roaming for GSM- call recording functions-subscriber
and service data management – DECT – TETRA – UMTS – IMT-2000.
Unit III - WLAN

Wireless LAN – Infrared Vs Radio transmission – Infrastructure – Adhoc Network –IEEE
802.11WLAN Standards – Architecture – Services– HIPERLAN – Bluetooth Architecture
& protocols.
Unit IV - Mobile Network Layer and Transport Layer

Mobile Network Layer – Mobile IP – Dynamic Host Configuration Protocol - 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 V - WAP
WAP Model- Mobile Location based services -WAP Gateway –WAP protocols – WAP user
agent profile- caching model-wireless bearers for WAP - WML - WML Scripts - WTA –
iMode - SyncML.
TEXT BOOKS
1. Jochen Schiller, “Mobile Communication”, Second Edition, Pearson Education,
2008.
2. Theodore and S. Rappaport, “Wireless Communications, Principles, Practice”,
Second Edition, PHI, 2010.
REFERENCE BOOKS
1. William Stallings, “Wireless Communications and Networks”, Second Edition,
2. C.Siva Ram Murthy and B.S.Manoj, “Adhoc Wireless Networks: Architectures and
Protocols”, Second Edition, Pearson Education, 2008.
3. Vijay. K. Garg, “Wireless Communication and Networking”, Morgan Kaufmann
Publishers, 2011.
COURSE OUTCOMES
At the end of the course, the students will be able
 To develop a strong grounding in the fundamentals of mobile Networks.
 To impart basic knowledge in MAC protocols and GSM.
 To understand about different WLAN technologies.
 To understand various Mobile Network Layer and Transport Layer protocols.
 To comprehend WAP model.
L T P C
CS328 RANDOMIZED ALGORITHM
3 0 0 3
COURSE OBJECTIVES
 To introduce the concept of randomized algorithms.
 To apply the concepts of probabilistic analysis of algorithms.
 To apply models on real world problems.
Unit I - Elementary Probability Theory

Elements of probability theory, Verification of strings, poly identities, matrix multiplication
Las Vegas and Monte Carlo algorithms, Expectations, Jensen's Inequality, Coupon
collector's problem, geometric distribution.
Unit II - Random Variable and Chebyshev Inequality

Randomized Quick Sort and its expected run-time, Variance and moments, Chebyshev's
inequality, Coupon collector's problem, randomized median finding, analysis, moment
generating functions.
Unit III - Chernoff Bound and packet routing in sparse networks

Derivation and application of Chernoff's bounds, Sum of Poisson Trials, Coin flips, Set
balancing, Packet routing in sparse networks, permutation routing on the hypercube,
butterfly.
Unit IV - Hashing and random graphs

Birthday paradox, balls and bins model, application to bucket sort, Poisson distribution,
Application to hashing, random graph models, Hamiltonian cycles in random graphs.
Unit V - Markov Chain and Random Walk

Markov chains, representations, randomized algorithm for 2-satisfiability and 3-
satisfiability, classification of states, gambler's ruin, random walks on undirected graphs, s-
t connectivity algorithm.
TEXT BOOK
1. M. Mitzenmacher and E. Upfal, “Probability and computing: Randomized algorithms
and Probabilistic analysis”, Cambridge University Press, 2017.
COURSE OUTCOMES
 Apply basics of probability theory in the analysis of algorithms.
 Comprehend randomized algorithms and its advantages to traditional algorithm.
 Get understanding on Chernoff Bound and packet routing in sparse networks.
 Get knowledge on Hashing and random graphs.
 Apply Markov Chain and Random Walk on real world problems.
L T P C
CS330 NETWORK PROTOCOLS
3 0 0 3
COURSE OBJECTIVES
 To provide insight about networks, topologies, and the key concepts.
 To gain comprehensive knowledge about the layered communication
architectures (OSI and TCP/IP) and its functionalities.
 To understand the principles, key protocols, design issues, and significance of
each layers in ISO and TCP/IP.
 To know the implementation of various layers.
Unit I - Introduction to network model and topologies

Review of Reference Models, Topology and switching, IEEE Standard 802 from Ethernet,
Token Bus, Token Ring and Wireless LAN, Connecting Devices.
Unit II - IPV4
IPv4 headers, IP forwarding, Host Processing of IP datagrams, DHCP and
Autoconfiguration, Firewalls and NAT, ICMPv4, IP Fragmentation, DNS, Broadcasting and
Local Multicasting – IGMP, Routing Protocols.
Unit III - IPV6

IPv6 Transition issues, Protocol basics, Addressing, Options and Extension headers,
ICMPv6, Neighbor Discovery, Routing, Autoconfiguration, Multicast Listener Discovery
(MLD), IPv6 and DNS.
Unit IV - Transmission Control Protocol

Transmission Control Protocol (TCP), TCP Connection Management, TCP Data Flow and
Window Management, Stream Control Transmission Protocol (SCTP), Services, SCTP
Association management, SCTP flow and error control.
Unit V - Mobile IP
Need for Mobile IP, Overview of Mobile IP, Details of Mobile IP, Tunneling, Mobility for
IPv6, Applications of Mobile IP – Security primer, Campus Mobility, Internet wide mobility,
A service provider perspective.
TEXT BOOKS
1. W. Richard Stevens and G. Gabrani, “TCP/IP Illustrated: The Protocols”, Pearson,
2012.
2. Behrouz A. Forouzan, “TCP/IP Protocol Suite”, Fourth edition, 2017.
3. Peter Loshin and Morgan Kaufmann, “IPv6: Theory, Protocol, and Practice”,
4. James Solomon, “Mobile IP: The Internet Unplugged”, First Edition, Pearson
Education, 2008.
REFERENCE BOOKS
1. Kevin R. Fall and W. Richard Stevens, “TCP/IP Illustrated, Vol. 1- The Protocols”,
Second Edition, Addison-Wesley, 2012.
2. Silvia Hagen, “IPv6 Essentials”, Second Edition, O'Reilly Media, 2006.
3. Charles E. Perkins, “Mobile IP: Design Principles and Practices”, First Edition,
COURSE OUTCOMES
 Gain insight about basic network theory and layered communication
architectures.
 Code and implement IPV4.
 Code and implement IPV6.
 Code and implement TCP.
 Design and develop Mobile IP.
L T P C
CS332 PATTERN RECOGNITION
3 0 0 3
COURSE OBJECTIVES
 Understand the algorithms for Pattern Recognition.
 Representation of patterns and classes and the similarity measures.
 Understanding classification and clustering of patterns.
Unit I - Basics of probability and statistics

Introduction: Basics of Probability and Statistics, Linear Algebra, Linear Transformations,
Components of Pattern Recognition System, Learning and adaptation, Supervised Learning
(Classification) and Unsupervised Learning (Clustering).
Unit II - Bayes Decision Theory

Bayesian Decision Theory: classifiers, discriminant functions, decision surfaces,
Discriminant functions for Normal density, Error bounds for Normal density, Maximum
Likelihood and Bayesian Parameter Estimation, Principal Component Analysis, Fisher
Linear Discriminant, Hidden Markov Models.
Unit III - Parameter Estimation Methods

Non-parametric Techniques: Parzen window estimation, k-nearest neighbour classification,
Perceptron classifier, Support Vector Machines, Decision Tree based classifiers.
Unit IV - Feature Extraction and Feature Selection

Feature Extraction and Feature Selection: Feature extraction – discrete cosine and sine
transform, Discrete Fourier transform, Principal Component analysis, Kernel Principal
Component Analysis. Feature selection – class separability measures, Feature Selection
Algorithms - Branch and bound algorithm, sequential forward / backward selection
algorithms.
Unit V - Clustering
Unsupervised Learning/Clustering: distance/similarity measures, K-means clustering, single
linkage and complete linkage clustering, MST, medoids, DBSCAN. Recent advances in
Pattern Recognition: Structural PR, SVMs, FCM, Soft-computing and Neuro-fuzzy
techniques, and real-life examples.
TEXT BOOKS
1. C. M. Bishop, “Pattern Recognition and Machine Learning”, Springer 2016.
2. S. Theodoridis and K. Koutroumbas, “Pattern Recognition”, Wiley 2012.
REFERENCE BOOK
1. R. O. Duda and P. E. Hart, D. G. Stork, “Pattern Classification”, Wiley Interscience,
COURSE OUTCOMES
 Understand the basic pattern recognition concepts.
 Understand and implement Bayes Decision Theory on real world problems.
 Understand different parameter estimation methods.
 Gain knowledge on feature extraction and feature selection techniques.
 Understand and implement clustering algorithms.
L T P C
CS334 GAME THEORY
3 0 0 3
COURSE OBJECTIVES
 To provide an understanding of formal models of programming language syntax
and semantics.
 To provide a deeper understanding of the processes of programming,
programming language definition, design, and implementation.
 The ability to bring together and flexibly apply knowledge to characterise,
analyse and solve a wide range of problems.
 The ability to apply the principles of lifelong learning to any new challenges.
Unit I - Introduction to game theory

Non-cooperative Game Theory: Games in Normal Form - Preferences and utility, examples
of normal-form, Analyzing games: Pareto optimality, Nash equilibrium, Maxmin and
minmax strategies, dominated strategies, Rationalizability, Correlated equilibrium.
Unit II - Normal- form and general-sum games

Computing Solution Concepts of Normal-Form Games: Computing Nash equilibria of
twoplayer, zero-sum games, Computing Nash equilibria of two-player, general-sum games,
Complexity of computing Nash equilibrium, Lemke–Howson algorithm, Searching the
space of supports, Computing Nash equilibria of n-player, general-sum games, Computing
maxmin and minmax strategies for two-player, general-sum games, Computing correlated
equilibria.
Unit III - Extensive form games

Games with the Extensive Form: Perfect-information extensive-form games, Subgame-
perfect equilibrium, Computing equilibria, Imperfect-information extensive-form games,
Sequential equilibrium.
Unit IV - Repeated and incomplete information games

Other Representations: Repeated games: Finitely repeated games, Infinitely repeated games,
automata, Stochastic games Bayesian games: Computing equilibria, Coalitional Game
Theory: Transferable Utility, Analyzing Coalitional Games, The Shapley Value.
Unit V - Core Mechanism design

The Core Mechanism Design: Strategic voting, unrestricted preferences, Implementation,
quasi linear setting, Efficient mechanisms, Computational applications of mechanism
design, Task scheduling, Bandwidth allocation in computer networks Auctions: Single-good
auctions, Canonical auction families, Bayesian mechanisms, Multiunit auctions,
Combinatorial auctions.
TEXT BOOK
1. Nisan. N., T. Roughgarden, E. Tardos, and V. Vazirani (Eds.).,” Algorithmic Game
Theory”, Cambridge University Press, 2007.
REFERENCE BOOKS
1. Shoham. Y and Leyton Brown. K, “Multiagent Systems: Algorithmic, Game
Theoretic, and Logical Foundations”, Cambridge University Press, 2008.
2. Osborne M. J and Rubinstein A,” A Course in Game Theory”, Cambridge, MA: MIT
Press, 1994.
COURSE OUTCOMES
 Express computational solutions in the main programming idioms.
 Select an appropriate programming language for solving a computational
problem, with justification.
 Know and understand the principal programming abstractions.
 Know and understand the functional programming language.
 Solve simple games using various techniques.
DEPARTMENT ELECTIVES FOR SEVENTH SEMESTER
L T P C
CS421 INTERNET OF THINGS
3 0 0 3
COURSE OBJECTIVES
 To provide an understanding of the technologies and the standards relating to the
Internet of Things
 To understand State of the Art - IoT Architecture.
 To understand real world IoT Design constraints.
 To study the security and privacy issues in IoT.
Internet & Web Basics – IoT - The Vision, Applications, IoT Standardization – IoT
Components – Sensors – Actuators – Intelligent Analytics – Intelligent Analysis.
Unit II - IoT Architecture
Traditional TCP/IP protocol stack and IoT Protocol Stack –Data Formats –Representational
State Transfer (REST) and activity streams –Business Aspects and models.
Unit III - IoT Communication
Fundamentals-Devices and gateways, Local and wide area networking, Data management,
Communication protocols –Constrained Application Protocol (CoAP), Web Socket, PUSH
-Everything as a Service (XaaS), Knowledge Management.
Unit IV - IoT Implementation and Security
Introduction to Raspberry Pi, Arduino Boards –Operating System (Micro Python) –Python
Programming language –Multiple security levels –Security and Privacy Issues in IoT –
Privacy preserving algorithms in IoT –Complexity Analysis of the cryptographic algorithms
in IoT.
Unit V - Case Study and implications
Real-World Design Constraints-Technical Design constraints -Data representation and
visualization, Interaction and remote control. Case Studies: IoT in Disaster Management
System, &IoT in Agriculture –Societal Implications.
TEXT BOOK
1. Jan Holler, Vlasios Tsiatsis, Catherine Mulligan, Stefan Avesand, Stamatis
Karnouskos, David Boyle, “From Machine-to-Machine to the Internet of Things:
Introduction to a New Age of Intelligence”, First Edition, Academic Press, 2014.
REFERENCE BOOKS
1. Vijay Madisetti and Arshdeep Bahga, “Internet of Things (A Hands-on-Approach)”,
First Edition, VPT, 2014.
2. Francis da Costa, “Rethinking the Internet of Things: A Scalable Approach to
Connecting Everything”, First Edition, Apress Publications, 2013.
COURSE OUTCOMES
 Understand the technology and standards relating to IoTs.
 Knowledge of standard development initiatives and reference architectures.
 Demonstration of real world IoT application.
 Working ability with Raspberry Pi.
 Analyze the security constraints in IoT applications.
L T P C
CS423 MOBILE APPLICATION DEVELOPMENT
3 0 0 3
COURSE OBJECTIVES
 Understand system requirements for mobile applications.
 Generate suitable design using specific mobile development frameworks.
 Generate mobile application design.
 Implement the design using specific mobile development frameworks.
 Deploy the mobile applications in marketplace for distribution.
Unit I –Introduction
Introduction to mobile applications, embedded systems, Market and business drivers for
mobile applications, Publishing and delivery of mobile applications, Requirements gathering
and validation for mobile applications.
Unit II - Basic Design

Introduction to embedded systems design, Embedded OS, Design constraints for mobile
applications, both hardware and software related, architecting mobile applications, User
interfaces for mobile applications, touch events and gestures, Achieving quality constraints,
performance, usability, security, availability and modifiability.
Unit III - Advanced Design

Designing applications with multimedia and web access capabilities, Integration with GPS
and social media networking applications, accessing applications hosted in a cloud
computing environment, Design patterns for mobile applications.
Unit IV - Technology I -Android Platform

Introduction to establishing the development environment, Android architecture, Activities
and views, Interacting with UI, Persisting data using SQLite, Packaging and deployment,
Interaction with server side applications, Using Google Maps, GPS and Wi-Fi, Integration
with social media applications.
Unit V - Technology II – Cross platform application development

Installation and features of Cordova,Ionic and React Native. Cross-platform application
development (Cordova, HTML5, CSS3, Javascript). Developing apps using React Native
and Javascript.
TEXT BOOKS
1. Jeff McWherter and Scott Gowell, “Professional Mobile Application Development”,
Wrox, 2012.
2. Charlie Collins, Michael Galpin and Matthias Kappler, “Android in Practice”,
DreamTech, 2012.
REFERENCE BOOKS
1. James Dovey and Ash Furrow, “Beginning Objective C”, Apress, 2012.
2. David Mark, Jack Nutting, Jeff LaMarche and Frederic Olsson, “Beginning iOS 6
Development: Exploring the iOS SDK”, Apress, 2013.
COURSE OUTCOMES
 Describe the requirements for mobile applications.
 Explain the challenges in mobile application design and development.
 Develop design for mobile applications for specific requirements.
 Implement the design using Android SDK.
 Develop apps using React Native and Javascript.
CS425 DESIGN AND ANALYSIS OF PARALLEL L T P C
ALGORITHMS 3 0 0 3
COURSE OBJECTIVES
 To learn about parallel computing models.
 To design and analyze parallel algorithms for PRAM machines and
Interconnection networks.
 To understand different techniques for solving graph problems.
Structures and algorithms for array processors: SIMD Array Processors, Interconnection
networks, Parallel algorithms for Array processors. Multiprocessor architecture -
Interconnection networks-multiprocessor control and algorithms - parallel algorithms for
multiprocessors.
Unit II - Design of parallel algorithms

Selection – broadcast - all sums - parallel selection - Searching a random sequence - sorted
sequence on PRAM models - Tree and Mesh.
Unit III - Merging & Sorting

Merging - A network for merging - merging on PRAM models - Sorting on a linear array,
EREW, CREW and CRCW SIMD models, MIMD Enumeration sort.
Unit IV - Matrix Operations

Matrix operations - Transposition, Matrix by matrix multiplication, matrix by vector
multiplication. Numerical problems - solving systems of linear equations, finding roots of
non linear equations on PRAM models.
Unit V - Graph Problems

Graphs - Connected components - dense graphs- sparse graphs. Minimum spanning tree-
Solli’s algorithm, Biconnected components, Ear decomposition, Directed graphs – case
study.
TEXT BOOKS
1. Kai Wang and Briggs, “Computer Architecture and Parallel Processing”, McGraw
Hill, 1985.
2. S. G. Akl, “Design and Analysis of Parallel Algorithms”, Prentice Hall Inc., 1992.
3. Joseph Jaja, “An Introduction to parallel Algorithms”, Addison Wesley, 1992.
REFERENCE BOOK
1. S. Lakshmivarahan and S. K. Dhall, “Analysis and Design of Parallel Algorithms -
Arithmetic and Matrix Problems”, McGraw Hill, 1990.
COURSE OUTCOMES
 Enable the student to design and analyze parallel algorithms.
 Analyse various parallel algorithms.
 Apply sorting and merging techniques on networks.
 Construct pseudo-code for parallel algorithms to solve well-known problems like
matrix operations, solving equations and graph based computation problems.
 Apply various techniques for solving the graph theory problem.
L T P C
CS427 FUNCTIONAL PROGRAMMING LANGUAGES
3 0 0 3
COURSE OBJECTIVES
 To understand the fundamental design of the Functional Programming Language
(FPL).
 Generate suitable design using specific functional paradigm.
 To be able to design and build an application/service over the FPL.
Unit I - Preliminary Concepts

Introduction to Programming languages, Programming domains, Language Evaluation
Criteria, influences on Language design, Language categories, Programming Paradigms,
Imperative, Object Oriented, functional Programming and Logic Programming,
Programming Language Implementation, Compilation and Virtual Machines, programming
environments.
Unit II - Fundamentals of Functional Programming Languages (FPL)

Introduction to Functional Programming; Functional programs; Introduction to Scheme,
Order of evaluation, Recursion; Higher-order functions; Anonymous functions;
Curryfication; Definitions; Lists; Recursion on flat and nested lists; Correctness proofs;
Typed languages, Introduction to Lambda-calculus and LISP, Search strategies in LISP.
Unit III - Erlang

Introduction to Erlang, Basic Syntax, Erlang Data types, Bit Syntax, Functions & Modules,
Pattern Matching and Guards, Recursion, Higher Order Functions, Records, Handling
Errors, concurrent programming in Erlang. Introduction to Erlang Web servers.
Unit IV - Haskell
Introduction to Haskell, tuples, polymorphism, higher order functions, strings &characters,
lazy evaluation, Data-Type declarations, Defining functions over datatypes using patterns,
Enumerations,The Shape Datatype of the text, Program Manipulation, Comparing the
functional paradigm, Actions and Haskell, Monads, Simple Graphics.
Unit V - Golang
Introduction to Golang, Syntax, Interfaces and Embedding, Array and methods, Slices &
Maps, Concurrency pattern, Standard library, Testing method, Debugging, Channels and
Race Conditions, Error Handling, Packing & Exporting, Project structure, Pointers.
TEXT BOOKS
1. Fethi A. Rabhi and Guy Lapalme, “Algorithms - A Functional Programming
Approach”, Pearson Education, 1999.
2. Joe Armstrong, “Programming Erlang. Software for a Concurrent World”, O'Reilly
publication, 2009.
3. Richard Bird, “Introduction to Functional Programming using Haskell”, Prentice
Hall, Second Edition, 1998.
4. Alan A. A. Donovan and Brian W. Kernighan, “The Go Programming Language”,
Addison Wesley, 2015.
REFERENCE BOOKS
1. Robert W. Sebesta, “Concepts of Programming Languages”, Eighth Edition, Pearson
Education, 2008.
2. Patric Henry Winston and Paul Horn, “LISP”, Pearson Education, Third Edition,
1989.
COURSE OUTCOMES
 Demonstrate a thorough knowledge of various Functional paradigms.
 Implement a detailed Functional programming design in a Functional programming
language.
 Gain a new, unique perspective of coding and add an esoteric language to their
repertoire.
 Get to grip with advanced features like Go Language and Concurrency.
 Write simple programs involving elementary Haskell techniques, including pure
function definitions.
L T P C
CS429 NETWORK SECURITY
3 0 0 3
COURSE OBJECTIVES
 To understand the number theory used for network security.
 To understand the design concept of cryptography and authentication.
 To understand the design concepts of internet security.
 To develop experiments on algorithm used for security.
Unit I - Conventional and Modern Encryption

Model of network security – Security attacks, services and attacks – OSI security
architecture – Classical encryption techniques – SDES – Block cipher Principles- DES –
Strength of DES – Block cipher design principles – Block cipher mode of operation –
Evaluation criteria for AES – RC4 - Differential and linear cryptanalysis – Placement of
encryption function – traffic confidentiality.
Unit II - Public Key Encryption

Number Theory – Prime number – Modular arithmetic – Euclid’s algorithm - Fermet’s and
Euler’s theorem – Primality – Chinese remainder theorem – Discrete logarithm – Public
key cryptography and RSA – Key distribution – Key management – Diffie Hellman
key exchange – Elliptic curve cryptography.
Unit III - Authentication

Authentication requirement – Authentication function – MAC – Hash function – Security of
hash function and MAC – SHA –MD5- HMAC – CMAC - Digital signature and
authentication protocols – DSS.
Unit IV - Security Practice

Authentication applications – Kerberos – X.509 Authentication services - E-mail security –
IP security - Web security.
Unit V - System Security

Introduction to distributed ledgers - Intruder – Intrusion detection system – Virus
and related threats – Countermeasures – Firewalls design principles – Trusted systems
– Practical implementation of cryptography and security.
TEXT BOOK
1. William Stallings, “Cryptography & Network Security”, Pearson Education, Sixth
Edition 2014.
REFERENCE BOOKS
1. Charlie Kaufman, Radia Perlman, Mike Speciner, “Network Security, Private
communication in public world”, PHI Second Edition, 2002.
2. BruceSchneier and Neils Ferguson, “Practical Cryptography”, Wiley Dreamtech
India Pvt Ltd., First Edition, 2003.
3. Douglas R Simson, “Cryptography – Theory and practice”, CRC Press, First Edition,
1995.
COURSE OUTCOMES
 Explain basic functions of cryptography and classify the symmetric encryption
techniques.
 Explain computational number theory and illustrate various Public key
cryptographic techniques.
 Evaluate the authentication and hash algorithms.
 Analyse various security models.
 Summarize the intrusion detection and its solutions to overcome the attacks.
L T P C
CS431 KNOWLEDGE ENGINEERING
3 0 0 3
COURSE OBJECTIVES
 To display the implicit knowledge about a subject in a form that programmers
can encode in algorithms and data structures.
 To analyze knowledge about the real world and map it to a computable form.
 To know the existing technology for implementation.
Unit I – Logic
Historical Background -Representing Knowledge in Logic - Varieties of Logic - Names,
Types and Measures- Unity Amidst Diversity – Ontology: Ontological Categories -Top-
Level Categories-Describing Physical Entities-Defining abstractions- Sets, Collections,
Types and Categories- Space and Time.
Unit II - Knowledge Representations

Knowledge Engineering - Representing Structure in Frames-Rules and Data-Object-
Oriented Systems -Natural Language Semantics - Levels of Representation.
Unit III - Processes

Times, Events, and Situations - Classification of Processes - Procedures, Processes, and
Histories - Concurrent Processes - Computation - Constraint Satisfaction.
Unit IV - Contexts and Knowledge Soup

Purposes, Contexts and Agents: Purpose- Syntax of Contexts- Semantics of Contexts – First-
Order Reasoning in Contexts- Modal Reasoning in Contexts - Encapsulating Objects in
Contexts- Agents - Knowledge Soup: Vagueness, Uncertainty, Randomness, and Ignorance
-Limitations of Logic –Non-monotonic Logic-Theories, Models and the World-Semiotics.
Unit V - Knowledge Acquisition and Sharing

Sharing Ontologies -Conceptual Schema - Accommodating Multiple Paradigms- Relating
Different Knowledge Representations - Language Patterns - Tools for Knowledge
Acquisition - Case studies: Hotel Reservation System - Library Database- ACE Vocabulary
-Translating ACE to Logic.
TEXT BOOK
1. John F.Sowa, “Knowledge Representation: Logical, Philosophical, and
Computational Foundations”, 2000.
REFERENCE BOOKS
1. Ronald Brachman and Hector Levesque “Knowledge Representation and
Reasoning”, The Morgan Kaufmann Series in Artificial Intelligence, 2004.
2. Arthur B. Markman, “Knowledge Representation”, Lawrence Erlbaum Associates,
1998.
COURSE OUTCOMES
 Application of logic and ontology to the task of constructing computable models
for some domain.
 Apply knowledge representation, reasoning to real-world problems.
 Analyse the role of Concurrent Processes and Constraint Satisfaction.
 Analyzing a problem, identifying the kinds of things that have to be represented,
and mapping them to a computable form.
 Implement examples in the learned technology.
L T P C
CS433 DATA WAREHOUSING AND DATA MINING
3 0 0 3
COURSE OBJECTIVES
 To understand the components used in data warehousing, basic idea about OLAP.
 To understand the detailed functioning of Data Mining and various classification
and prediction.
 To assess the mining object in web based application.
Unit I - Data Warehousing

Data warehousing Components – Building a Data warehouse – Mapping the Data
Warehouse to a Multiprocessor Architecture – DBMS Schemas for Decision Support – Data
Extraction, Cleanup and Transformation Tools –Metadata.
Unit II – Business Analysis

Reporting, Query tools and Applications – Tool Categories – The Need for Applications –
Cognos Impromptu – Online Analytical Processing (OLAP) – Need – Multidimensional
Data Model – OLAP Guidelines – Multidimensional versus Multirelational OLAP –
Categories of Tools – OLAP Tools and the Internet.
Unit III - Data Mining

Introduction – Data – Types of Data – Data Mining Functionalities – Interestingness of
Patterns – Classification of Data Mining Systems – Data Mining Task Primitives –
Integration of a Data Mining System with a Data Warehouse – Issues –Data Preprocessing.
Unit IV - Association Rule Mining and Classification

Mining Frequent Patterns, Associations and Correlations – Mining Methods – Mining
various Kinds of Association Rules – Correlation Analysis – Constraint Based Association
Mining – Classification and Prediction – Basic Concepts – Decision Tree Induction –
Bayesian Classification – Rule Based Classification – Classification by Back propagation –
Support Vector Machines – Associative Classification – Lazy Learners – Other
Classification Methods – Prediction.
Unit V – Clustering and Trends in Data Mining

Cluster Analysis – Types of Data – Categorization of Major Clustering Methods – K-means–
Partitioning Methods – Hierarchical Methods – Density-Based Methods – Grid Based
Methods – Model - Based Clustering Methods – Clustering High Dimensional Data –
Constraint – Based Cluster Analysis – Outlier Analysis – Data Mining Applications.
TEXT BOOKS
1. Alex Berson and Stephen J.Smith, “Data Warehousing, Data Mining and OLAP”,
Tata McGraw – Hill Edition, Thirteenth Reprint, 2008.
2. Jiawei Han and MichelineKamber, “Data Mining Concepts and Techniques”, Third
Edition, Elsevier, 2012.
REFERENCE BOOKS
1. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, “Introduction to Data

Mining”, Person Education, 2007.
2. K.P. Soman, Shyam Diwakar and V. Aja, “Insight into Data Mining Theory and
Practice”, Eastern Economy Edition, Prentice Hall of India, 2006.
3. G. K. Gupta, “Introduction to Data Mining with Case Studies”, Eastern Economy
Edition, Prentice Hall of India, 2006.
4. Daniel T. Larose, “Data Mining Methods and Models”, Wiley-Interscience, 2006.
COURSE OUTCOMES
 Understand the mechanism used in Data Warehousing.
 Store voluminous data for online processing.
 Understand the mechanism used in Data mining and preprocess the data for mining
applications.
 Apply the association rules for mining the data, design and deploy appropriate
classification techniques.
 Cluster the high dimensional data for better organization of the data.
L T P C
CS435 CYBER SECURITY
3 0 0 3
COURSE OBJECTIVES
 To understand the basics of Cyber security and Cyber crime.
 To understand the detailed functioning of Network and Security Concepts.
 To know attacks, defence and analysis technique.
Unit I - Introduction to Cyber Security and Cyber crime

Overview of Cyber Security- Introduction to Cyber Crime- Classification of Cyber Crimes-
Reasons for Commission of Cyber Crimes - Malware and its types-Kinds of Cyber crime.
Unit II - Cyber Security Fundamentals

Network and Security Concepts-Information Assurance Fundamentals - Basic Cryptography
- Symmetric Encryption - Public Key Encryption - Firewalls.
Unit III - Attacker techniques and motivation

Anti – forensics - Proxies and types - Detecting the Use of Proxies – VPN -Tunneling
Techniques - Fraud Techniques - Threat Infrastructure.
Unit IV - Exploitation and Malicious code

Web Exploit Tools - Brute Force and Dictionary Attacks - Misdirection, Reconnaissance,
and Disruption Method - Self-Replicating Malicious Code - Evading Detection and
Elevating Privileges – Spyware - stealing Information and Exploitation.
Unit V - Defence and analysis technique

Memory Forensics – Honeypots - Malicious Code Naming - Automated Malicious Code
Analysis Systems - Intrusion Detection Systems.
TEXT BOOKS
1. Dr. Jeetendra Pande, “Introduction to Cyber Security”, Uttarakhand Open
University, 2017.
2. James Graham Richard Howard Ryan Olson, “Cyber Security Essentials”, Taylor &
Francis Group, LLC, 2011.
3. Nelson Phillips and Enfinger Steuart, “Computer Forensics and Investigations”,
Cengage Learning, New Delhi, 2009.
4. Kevin Mandia, Chris Prosise, Matt Pepe, “Incident Response and Computer
Forensics”, Tata McGraw -Hill, New Delhi, 2006.
REFERENCE BOOKS
1. Robert M Slade, “Software Forensics”, Tata McGraw Hill, New Delhi, 2005.
2. Bernadette H Schell and Clemens Martin, “Cybercrime”, ABC – CLIO Inc,
California, 2004.
COURSE OUTCOMES
 Define, understand and explain concepts of cyber security and cyber crime.
 Apply common cryptographic techniques and controls for authentication and
encryption.
 Analyse the threats and protect any network by designing firewall.
 Validate various attacks.
 Implement Intrusion Detection Systems.
L T P C
CS437 FAULT TOLERANT SYSTEM
3 0 0 3
COURSE OBJECTIVES
 To understand faults and their effects (errors, failures).
 To know redundancy techniques.
 To know how fault-tolerant systems are evaluated.
Definition of fault tolerance, Redundancy, Applications of fault-tolerance, Fundamentals of
dependability.
Unit II - Attributes and Fault Handling

Reliability, availability, safety, Impairments: faults, errors and failures, Means: fault
prevention, removal and forecasting.
Unit III - Dependability Evaluation

Common measures: failures rate, mean time to failure, mean time to repair, etc. Reliability
block diagrams, Markov processes.
Unit IV - Redundancy
Hardware redundancy, Redundancy schemes, Evaluation and comparison, Applications,
Information redundancy, Codes: linear, Hamming, cyclic, unordered, arithmetic. Encoding
and decoding techniques, Applications, Time redundancy.
Unit V- Features and Techniques for Fault Tolerant Systems

Software fault tolerance, Specific features, Software fault tolerance techniques: N-version
programming, recovery blocks, self-checking software, etc.
TEXT BOOKS
1. Anderson. T and P.A. Lee, “Fault-Tolerant Principles and Practices”, Prentice-Hall,
1981.
2. Hwang. K, “Computer Architecture and Parallel Processing”, McGraw-Hill, 2017.
3. Jalote. P, “Fault-Tolerance in Distributed Systems”, Prentice-Hall, 1994.
REFERENCE BOOKS
1. Johnson B.W, “Design and Analysis of Fault-Tolerant Systems”, Addison Wesely,
1989.
2. Leveson, Nancy G., “Safeware: System safety and computers”, Addison Wesely,
1995.
3. Pradhan D.K, “Fault-Tolerant Computing-Theory and Techniques”, Prentice-Hall,
1986.
4. Pradhan D.K, “Fault-Tolerant Computer System Design”, Prentice-Hall,1996.
COURSE OUTCOMES
 Understand the fundamental concepts of fault-tolerance.
 Understand the differences between fault, error and failure.
 Apply Markov modeling for prediction of reliability and availability.
 Understand and analyze methods for redundancy.
 Understand methods for development of fault tolerant software.
L T P C
CS439 DEEP LEARNING
3 0 0 3
COURSE OBJECTIVES
 To understand the major technology trends driving Deep Learning.
 To be able to build, train and apply fully connected deep neural networks.
 To know how to implement efficient (vectorized) neural networks.
 To understand the key parameters and hyperparameters in a neural network's
architecture.
Unit I - Linear Algebra

Scalars, Vectors, Matrices and Tensors, Matrix operations, types of matrices, Norms, Eigen
decomposition, Singular Value Decomposition, Principal Components Analysis.
Probability and Information Theory: Random Variables, Probability Distributions, Marginal
Probability, Conditional Probability, Expectation, Variance and Covariance, Bayes’ Rule,
Information Theory. Numerical Computation: Overflow and Underflow, Gradient-Based
Optimization, Constrained Optimization, Linear Least Squares.
Unit II - Machine Learning Basics

Learning Algorithms, Capacity, Overfitting and Underfitting, Hyperparameters and
Validation Sets, Estimators, Bias and Variance, Maximum Likelihood, Bayesian Statistics,
Supervised and Unsupervised Learning, Stochastic Gradient Descent, Challenges
Motivating Deep Learning. Deep Feedforward Networks: Learning XOR, Gradient-Based
Learning, Hidden Units, Architecture Design, Back-Propagation and other Differentiation
Algorithms.
Unit III - Regularization for Deep Learning

Parameter Norm Penalties, Norm Penalties as Constrained Optimization, Regularization and
Under-Constrained Problems, Dataset Augmentation, Noise Robustness, Semi-Supervised
Learning, Multi-Task Learning, Early Stopping, Parameter Tying and Parameter Sharing,
Sparse Representations, Bagging and Other Ensemble Methods, Dropout, Adversarial
Training, Tangent Distance, Tangent Prop and Manifold Tangent Classifier. Optimization
for Training Deep Models: Pure Optimization, Challenges in Neural Network Optimization,
Basic Algorithms, Parameter Initialization Strategies, Algorithms with Adaptive Learning
Rates, Approximate Second-Order Methods, Optimization Strategies and Meta-Algorithms.
Unit IV - Convolutional Networks

The Convolution Operation, Pooling, Convolution, Basic Convolution Functions, Structured
Outputs, Data Types, Efficient Convolution Algorithms, Random or Unsupervised Features,
Basis for Convolutional Networks.
Unit V - Sequence Modelling: Recurrent and Recursive Nets

Unfolding Computational Graphs, Recurrent Neural Networks, Bidirectional RNNs,
Encoder-Decoder Sequence-to-Sequence Architectures, Deep Recurrent Networks,
Recursive Neural Networks, Echo State Networks, LSTM, Gated RNNs, Optimization for
Long-Term Dependencies, Autoencoders, Deep Generative Models.
TEXT BOOKS
1. Ian Goodfellow, Yoshua Bengio, Aaron Courville, “Deep Learning”, MIT Press,
2016.
2. Josh Patterson and Adam Gibson, “Deep learning: A practitioner's approach”,
O'Reilly Media, First Edition, 2017.
REFERENCE BOOKS
1. Chao Pan, “Deep Learning Fundamentals: An Introduction for Beginners”, AI
Sciences LLC, 2018.
2. Li Deng and Dong Yu, “Deep Learning Methods and Applications, Foundations and
Trends in Signal Processing”, 2014.
3. Martin T. Hagan, Howard B. Demuth, Mark H. Beale, Orlando De Jesús, “Neural
Network Design”, Second Edition, 2014.
4. Simon Haykin, “Neural Networks and Learning Machines”, Third edition, 2008.
5. D. Kriesel, “A Brief Introduction to Neural Networks”, 2007.
6. Phil Kim, “MATLAB Deep Learning: With Machine Learning Neural Networks and
Artificial Intelligence”, Apress, First Edition, 2017.
COURSE OUTCOMES
 Understand the mathematical foundation of neural network.
 Describe the machine learning basics.
 Understand different architecture of deep neural network.
 Understand how to build a convolutional neural network.
 Understand how to build and train RNN and LSTMs.
DEPARTMENT ELECTIVES FOR EIGHTH SEMESTER
CS422 ADVANCED DATABASE MANAGEMENT L T P C
SYSTEMS 3 0 0 3
COURSE OBJECTIVES
 To the design and implement Distributed Databases.
 To understand advanced DBMS techniques to construct tables and write
effective queries, forms, and reports.
 To understand about transaction management.
Distributed Database, Promises of DDBSs, Complications Introduced by Distribution,
Design Issues, Distributed DBMS Architecture, Distributed database design, Database
Integration, Data and Access Control.
Unit II - Distributed query processing

Query Processing Problem, Complexity of Relational Algebra Operations, Characterization
of Query Processors, Layers of Query Processing, Query Decomposition and Data
Localization, Optimization of Distributed Queries, Multi database Query Processing.
Unit III - Transaction Management

Introduction to Transaction Management, Distributed Concurrency Control, Locking -Based
Concurrency Control Algorithms, Timestamp-Based Concurrency Control Algorithms,
Optimistic Concurrency Control Algorithms, Deadlock Management, “Relaxed”
Concurrency Control.
Unit IV - Distributed DBMS Reliability

Reliability Concepts and Measures, Failures in Distributed DBMS, Local Reliability
Protocols, Distributed Reliability Protocols, Dealing with Site Failures, Network
Partitioning, Data Replication.
Unit V Distributed Database Systems

Parallel Database System Architectures, Distributed Object Database Management, Peer-to-
Peer Data Management, Web Data Management.
TEXT BOOK
1. M. Tamer Özsu and Patrick Valduriez, “Principles of Distributed Database Systems”,
Springer, Third Edition, 2011.
REFERENCE BOOKS
1. S. Ceri and G. Pelagatti, “Distributed Databases Principles and Systems”, Second
Edition, McGraw Hill, 2006.
2. S. K. Rahimi and F. S. Haug, “Distributed Database Management Systems: A
Practical approach”, First Edition, Wiley, 2011.
COURSE OUTCOMES
 Know the design and system issues related to distributed database systems.
 Know the Design and implementation issues related to multi-database systems
(MDBS) and applications as well.
 Identify, describe and categorize transaction.
 Learn the usage of different design strategies for distributed databases.
 Study and implement the query processing techniques and algorithms as well as
transaction management and concurrency control concepts used in such systems
and in real world applications.
L T P C
CS424 SOFT COMPUTING
3 0 0 3
COURSE OBJECTIVES
 To understand the concepts of feed forward &feedback neural networks.
 To understand the concept of fuzziness involved in various systems.
 To expose the ideas about genetic algorithm.
Artificial Neural Networks: Basic concepts of artificial neural networks, Earlier neural
networks: ADALINE, MADALINE. Neural Network Architectures: Single layer
feedforward network, Multi-layer feedforward network, Recurrent network.
Unit II – Supervised and Unsupervised Learning Network

Supervised Learning Network: Perceptron network, Back propagation network, Radial basis
function network. Unsupervised Learning Network: Fixed weight competitive nets,
Kohonen self-organizing feature maps, Counter propagation network, Adaptive reasoning
theory. Associative memory: Auto associative memory network, Hetro associative memory
network, Bidirectional associative memory, Hopfield networks.
Unit III – Fuzzy Logic

Fuzzy Logic: Crisp set and Fuzzy set, Basic concepts of fuzzy sets, Fuzzy set operations,
Fuzzy Arithmetic-fuzzy numbers, Fuzzy ordering, Fuzzy vectors. Fuzzy measures-belief and
plausibility measure. Probability measure - Measure of fuzziness, Fuzzy integrals.
Membership functions: Features of membership function, Fuzzification. Fuzzy Rule Based
Systems: Fuzzy proposition, Formation and decomposition of rules, Fuzzy reasoning, Fuzzy
inference systems, Fuzzy expert system. Defuzzification: Max-membership, Centroid
method, Weighted average, Mean max.
Unit IV – Generic Algorithms

Genetic Algorithms: Traditional optimization and search techniques, Genetic algorithms.
Operators: Encoding, Selection, Crossover, Mutation. Classification: Adaptive genetic
algorithms, Hybrid genetic algorithms, Parallel genetic algorithms, Real coded genetic
algorithm.
Unit V – Hybrid Intelligent System

Neuro fuzzy hybrid systems, Adaptive neuro fuzzy inference systems, Fuzzy
backpropagation network, Genetic neuro hybrid system, Genetic algorithm-based
backpropagation network, Genetic-fuzzy hybrid systems.
TEXT BOOK
1. Simon Haykin,” A comprehensive foundation. Neural Networks”, Pearson, Second
Edition, 2001.
REFERENCE BOOKS
1. Timothy J. Ross, “Fuzzy logic with engineering applications”, John Wiley & Sons,
Third Edition, 2009.
2. Melanie Mitchell, “An Introduction to Genetic Algorithms”, Prentice-Hall, 1998.
COURSE OUTCOMES
 Design neural network to solve classification and function approximation
problems.
 Comprehend machine learning and soft computing techniques in solving real
world applications.
 Build optimal classifiers using genetic algorithms.
 Apply Artificial Neural Network, Fuzzy Logic, and Genetic Algorithms as
computational tools to solve a variety of problems in various area of interest
ranging from Optimization problems to Text Analytics.
L T P C
CS426 BIG DATA ANALYTICS
3 0 0 3
COURSE OBJECTIVES
 To optimize business decisions and create competitive advantage with Big Data
analytics.
 To learn to analyze the big data using intelligent techniques.
 To introduce programming tools PIG & HIVE in Hadoop echo system.
Introduction to big data: Introduction to Big Data Platform – Challenges of Conventional
Systems - Intelligent data analysis – Nature of Data - Analytic Processes and Tools -
Analysis vs Reporting.
Unit II - Stream Processing

Mining data streams: Introduction to Streams Concepts – Stream Data Model and
Architecture - Stream Computing - Sampling Data in a Stream – Filtering Streams –
Counting Distinct Elements in a Stream – Estimating Moments – Counting Oneness in a
Window – Decaying Window - Real time Analytics Platform (RTAP) Applications - Case
Studies - Real Time Sentiment Analysis - Stock Market Predictions.
Unit III - Introduction to Hadoop

Hadoop: History of Hadoop- the Hadoop Distributed File System – Components of Hadoop
Analysing the Data with Hadoop - Scaling Out - Hadoop Streaming - Design of HDFS - Java
interfaces to HDFS Basics - Developing a Map Reduce Application - How Map Reduce
Works - Anatomy of a Map Reduce Job run – Failures - Job Scheduling - Shuffle and Sort
– Task execution - Map Reduce Types and Formats - Map Reduce Features Hadoop
environment.
Unit IV - Frameworks and Applications

Frameworks: Applications on Big Data Using Pig and Hive – Data processing operators in
Pig – Hive services – HiveQL – Querying Data in Hive - fundamentals of HBase and
ZooKeeper.
Unit V - Predictive Analytics and Visualizations

Predictive Analytics - Simple linear regression - Multiple linear regression - Interpretation
of regression coefficients. Visualizations - Visual data analysis techniques - interaction
techniques - Systems and applications.
TEXT BOOKS
1. Tom White, “Hadoop: The Definitive Guide”, Third Edition, O’reilly Media, Fourth
Edition, 2015.
2. Chris Eaton, Dirk DeRoos, Tom Deutsch, George Lapis, Paul Zikopoulos,
“Understanding Big Data: Analytics for Enterprise Class Hadoop and Streaming
Data”, McGrawHill Publishing, 2012.
3. Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, CUP,
2012.
REFERENCE BOOKS
1. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data
Streams with Advanced Analytics”, John Wiley& sons, 2012.
2. Glenn J. Myatt, “Making Sense of Data”, John Wiley & Sons, 2007.
3. Pete Warden, “Big Data Glossary”, O’Reilly, 2011.
4. Jiawei Han, Micheline Kamber, “Data Mining Concepts and Techniques”, Second
Edition, Elsevier, Reprinted 2008.
5. Da Ruan, Guoquing Chen, Etienne E.Kerre, Geert Wets, “Intelligent Data Mining”,
Springer, 2007.
6. Paul Zikopoulos, DirkdeRoos, Krishnan Parasuraman, Thomas Deutsch, James
Giles, David Corrigan, “Harness the Power of Big Data:The IBM Big Data
Platform”, Tata McGraw Hill Publications, 2012.
7. Arshdeep Bahga and Vijay Madisetti, “Big Data Science & Analytics: A Hands On
Approach “, VPT, 2016.
8. Bart Baesens, “Analytics in a Big Data World: The Essential Guide to Data Science
and its Applications (WILEY Big Data Series)”, John Wiley & Sons, 2014.
COURSE OUTCOMES
 Understand big data challenges in different domains including social media,
transportation, finance and medicine.
 Use various techniques for mining data stream.
 Design and develop Hadoop.
 Identify the characteristics of datasets and compare the trivial data and big data
for various applications.
 Explore the various search methods and visualization techniques.
L T P C
CS428 MANAGEMENT INFORMATION SYSTEMS
3 0 0 3
COURSE OBJECTIVES
 To have a sound knowledge about today’s business world.
 To understand concepts like intelligent supply chain management, IT in business
process management.
 Plan projects, work in team settings and deliver project outcomes in time.
Information Systems in Global Business Today - Global E-Business and collaboration -
Information Systems, Organization and Strategy – Ethical and social issues in Information
Systems.
Unit II - Emerging Technologies & Information Management

IT infrastructure and Emerging Technologies – Foundations of Business Intelligence:
Databases and Information Management.
Unit III - Technologies in Enterprises

Telecommunications, the internet and Wireless Technology – Securing Information Systems
– Achieving Operational Excellence and Customer Intimacy: Enterprise Applications.
Unit IV - Introduction to D-commerce

E – Commerce: Digital Markets, Digital Goods – Managing Knowledge - Enhancing
Decision Making.
Unit V - Project Management and Global Systems

Building Information Systems – Managing Projects – Managing Global Systems.
TEXT BOOK
1. Kenneth J Laudon and Jane P. Laudon, “Management Information Systems”,
Fourteenth Edition, Pearson PHI, 2016.
REFERENCE BOOK
1. W. S. Jawadekar, “Management Information Systems”, Third Edition, TMH, 2004.
COURSE OUTCOMES
 Determine key terminologies and concepts including IT, marketing,
management, economics, accounting, finance in the major areas of business.
 Design, develop and implement Information Technology solutions for business
problems.
 Analysis of computing systems and telecommunication networks for business
information systems.
 Understand ethical issues that occur in business, evaluate alternative courses of
actions and evaluate the implications of those actions.
 Combine analytical thinking, creativity and business-problem-solving as applied
to ongoing MIS challenges, future trends, and relevant case studies.
L T P C
CS430 REAL TIME SYSTEMS
3 0 0 3
COURSE OBJECTIVES
 To study issues related to the design and analysis of systems with real-time
constraints.
 To learn about various real time communication protocols.
 To study the difference between traditional and real time databases.
Unit I - Introduction to real-time computing

Introduction to real time computing - Concepts; Example of real-time applications –
Structure of a real time system – Characterization of real time systems and tasks - Hard and
Soft timing constraints - Design Challenges - Performance metrics - Prediction of Execution
Time: Source code analysis, Micro-architecture level analysis, Cache and pipeline issues-
Programming Languages for Real-Time Systems.
Unit II - Real time OS

Real time OS – Threads and Tasks – Structure of Microkernel – Time services – Scheduling
Mechanisms Communication and Synchronization – Event Notification and Software
interrupt.
Unit III - Task Assignment and Scheduling

Task assignment and Scheduling - Task allocation algorithms - Single-processor and
Multiprocessor task scheduling - Clock-driven and priority-based scheduling algorithms-
Fault tolerant scheduling.
Unit IV - Real-time Communication

Real Time Communication - Network topologies and architecture issues – protocols –
contention based, token based, polled bus, deadline based protocol, Fault tolerant routing.
RTP and RTCP.
Unit V - Real time Databases

Real time Databases – Transaction priorities – Concurrency control issues – Disk scheduling
algorithms – Two phase approach to improve predictability.
TEXT BOOK
1. C.M. Krishna and Kang G. Shin, “Real Time Systems”, International Edition,
McGraw Hill Companies, Inc., New York, 1997.
REFERENCE BOOKS
1. Jane W.S. Liu, “Real-Time Systems", Pearson Education India, 2000.
2. Philip A. Laplante and Seppo J. Ovaska, “Real-Time Systems Design and
Analysis: Tools for the Practitioner”, Fourth Edition, IEEE Press, Wiley, 2011.
COURSE OUTCOMES
 Design real time operating systems.
 Gain knowledge about Schedulability analysis.
 Learn Real-time programming environments.
 Gain knowledge about real time communication and databases.
L T P C
CS432 NATURAL LANGUAGE PROCESSING
3 0 0 3
COURSE OBJECTIVES
 To understand and produce human language for applications such as information
extraction, machine translation, automatic summarization.
 Its covers knowledge-based and statistical approaches to language processing for
syntax (language structures), semantics (language meaning), and
pragmatics/discourse (the interpretation of language in context).
 To understand about the applications of Natural Language Processing.
Introduction - Regular Expressions, Text Normalization, Edit Distance - N-gram Language
Models – smoothing - Naive Bayes and Sentiment Classification – optimizing for sentiment
analysis - Naive Bayes for other text classification tasks- Naive Bayes as a Language Model-
Evaluation: Precision, Recall, F-measure - Test sets and Cross - validation.
Unit II - Logic Regression

Logistic Regression - Learning in Logistic Regression - Multinomial logistic regression -
Vector Semantics - Lexical Semantics - Vector Semantics - Words and Vectors - Cosine for
measuring similarity - TF-IDF and application - Neural Networks and Neural Language
Models - Part-of-Speech Tagging - Sequence Processing with Recurrent Networks.
Unit III - Syntactic Parsing

Syntactic Parsing - Statistical Parsing - Probabilistic Context-Free Grammars - Dependency
Parsing - Transition and graph - based Dependency Parsing - Representation of Sentence
Meaning - Computational Semantics.
Unit IV - Semantic Analysis

Semantics - Meaning representation, semantic analysis, lexical semantics, WordNet Word
Sense Disambiguation - Selectional restriction, machine learning approaches, dictionary
based approaches.
Unit V - Discourse and Applications of NLP

Discourse - Reference resolution, constraints on co-reference, algorithm for pronoun
resolution, text coherence, discourse structure. Applications of NLP - Spell-checking,
Summarization Information Retrieval - Vector space model, term weighting, homonymy,
polysemy, synonymy, improving user queries. Machine Translation – Overview.
TEXT BOOK
1. Daniel Jurafsky and James H Martin, “Speech and Language Processing”, Third
REFERENCE BOOKS
1. James. A,” Natural language Understanding”, Second Edition, Pearson Education,
1994.
2. Bharati. A, Sangal. R, Chaitanya. V,” Natural language processing: a Paninian
perspective”, PHI, 2000.
3. Siddiqui. T, Tiwary U.S,” Natural language processing and Information retrieval”,
OUP, 2008.
COURSE OUTCOMES
 Understand the mathematical and linguistic foundations underlying approaches
to the above areas in NLP.
 Demonstrate accomplishments of knowledge and comprehension, application
and analysis, and synthesis.
 Develop system for conferring one natural language to another.
 Design and develop machine learning techniques in the area of NLP.
L T P C
CS434 NUMBER THEORY AND CRYPTOGRAPHY
3 0 0 3
COURSE OBJECTIVES
 To apply modern cryptographic theories and techniques, mainly focusing on their
application into real systems.
 To understand the concepts about Key establishment and maintenance.
 To get an insight into the working of different existing cryptographic algorithms.
Overview of Cryptography Introduction, Information security and cryptography, Basic
terminology and concepts, Symmetric key encryption, Digital signatures, Public-key
cryptography, Hash functions, Protocols and mechanisms, Key establishment, management,
and certification, Pseudorandom numbers and sequences, Classes of attacks and security
models.
Unit II - Mathematics Background &Number-Theoretic Reference Problems

Mathematical Background Probability theory, Information theory, Complexity theory,
Number theory, Abstract algebra, Finite fields, The integer factorization problem, The RSA
problem, The Diffie-Hellman problem, Composite moduli.
Unit III - Introduction to Finite Fields

A quick introduction to groups, rings, integral domain and fields (including: Lagrange
theorem, Structure of cyclic and abelian groups, isomorphism theorems).
Unit IV - Finite Fields

Fields, Characteristic of a field, prime fields, Arithmetic of polynomials over fields. Field
extensions, Galois group of a field extensions, Fixed field and Galois extensions. Minimum
polynomial, Construction of fields with the help of an irreducible polynomial. Splitting field
of a polynomial, Separable polynomial and Separable extensions. Construction of finite
fields and their structure. Enumeration of irreducible polynomials over finite fields.
Fundamental theorem of Galois Theory.
Unit V - Key Establishment Protocols & Management Techniques

Cyclotomic extensions, Geometric constructions and Galois theory of Equations (Statement
only of Abel Ruffini), Solving Cubic and Bi-quadratic polynomials using radicals. Key
Establishment Protocols Introduction, Key transport based on symmetric encryption, Key
agreement based on symmetric techniques, Key transport based on public-key encryption,
Key agreement based on asymmetric techniques, Secret sharing, Key Management
Techniques, Techniques for distributing public keys, Techniques for controlling key usage,
Key management involving multiple domains.
TEXT BOOKS
1. Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone, “Handbook of
Applied Cryptography”, CRC Press, Fifth printing, 2014.
2. William Stallings,” Cryptography and Network Security: Principles and Practice”,
Fourth Edition, 2005.
3. B. Schneier, “Applied Cryptography: Protocols, Algorithms, and Source Code in C”,
Second Edition, John Wiley & Sons, 1995.
REFERENCE BOOKS
1. Matt Bishop, “Computer Security: Art and Science”, Addison-Wesley, 2002.
2. Mihir Bellare and Phillip Rogaway, “Introduction to Modern Cryptography”, 2005.
3. J.M. Howie, “Field and Galois Theory”, Springer, 2007.
COURSE OUTCOMES
 Explain and discuss the main theorems and algorithms in number theory used in
cryptography.
 Analyze encryption algorithms.
 Know the methods of conventional encryption. To understand the concepts of
public key encryption and number theory.
 Evaluate possibilities and limitations of practical use of the main cryptographic
algorithms and demonstrate an understanding of the relation of cryptography to
security.
L T P C
CS436 MULTIMEDIA ANALYSIS
3 0 0 3
COURSE OBJECTIVES
 To understand the technologies like image processing and pattern recognition.
 To apply their mathematical knowledge and understanding of algorithms to
problems in image and video processing.
 To understand the concepts from pre-processing, to quantitation, video
compression and video interpretation.
Introduction, Audio-visual Content Analysis, Video indexing, Browsing, Abstraction,
MPEG – 7 Standard.
Unit II - Background and Previous works

Visual content analysis, Audio Content Analysis, Speaker Identification, Video Abstraction.
Unit III - Content based movie scene and event extraction

Content based movie scene and event extraction- movie scene extraction, movie event
extraction, experimental results.
Unit IV - Speaker identification for movies

Speaker identification for movies - supervised speaker identification for movie dialogues,
adaptive speaker identification, experimental results.
Unit V - Scene-based movie summarization

Scene-based movie summarization- overview, hierarchical key frame extraction, scalable
movie summarization, experimental results.
TEXT BOOK
1. Ying Li and Jay Kuo, “Video Content Analysis using Multimodal Information”,
Kluwer Publishers, 2003.
COURSE OUTCOMES
 Understand and describe the fundamental principles of image and video
analysis and have an idea of their application.
 Understand the concepts of image processing and audio content analysis.
 Understand the process of event extraction and video processing.
 Understand the concept of working in real world.
L T P C
CS438 CLOUD COMPUTING
3 0 0 3
COURSE OBJECTIVES
 To provide an in-depth and comprehensive knowledge of the Cloud Computing
fundamental issues, technologies, applications and implementations.
 To motivate students to do programming and experiment with the various cloud
computing environments.
 To shed light on the Security issues in Cloud Computing.
History of Centralized and Distributed Computing - Overview of Distributed Computing,
Cluster computing, Grid computing. Technologies for Network based systems- System
models for Distributed and cloud computing- Software environments for distributed systems
and clouds.
Unit II - Virtualization
Introduction to Cloud Computing- Cloud issues and challenges - Properties - Characteristics
- Service models, Deployment models. Cloud resources: Network and API - Virtual and
Physical computational resources - Data-storage. Virtualization concepts - Types of
Virtualization- Introduction to Various Hypervisors - High Availability (HA)/Disaster
Recovery (DR) using Virtualization, Moving VMs.
Unit III - Service Models

Service models - Infrastructure as a Service (IaaS) - Resource Virtualization: Server,
Storage, Network - Case studies. Platform as a Service (PaaS) - Cloud platform &
Management: Computation, Storage - Case studies. Software as a Service (SaaS) - Web
services - Web 2.0 - Web OS - Case studies – Anything as a service (XaaS) – Micro services.
Unit IV - Cloud Programming and Software Environments

Cloud Programming and Software Environments – Parallel and Distributed Programming
paradigms – Current technologies – Programming support of App Engines – Emerging
Cloud software Environment.
Unit V - Cloud Access

Cloud Access: authentication, authorization and accounting - Cloud Provenance and meta-
data - Cloud Reliability and fault-tolerance - Cloud Security, privacy, policy and
compliance- Cloud federation, interoperability and standards.
TEXT BOOK
1. Kai Hwang, Geoffrey C. Fox and Jack J. Dongarra, “Distributed and cloud
computing from Parallel Processing to the Internet of Things”, Morgan Kaufmann,
Elsevier, 2012.
REFERENCE BOOKS
1. Barrie Sosinsky, “Cloud Computing Bible”, John Wiley & Sons, 2010.
2. Tim Mather, Subra Kumaraswamy, and Shahed Latif, “Cloud Security and Privacy:
An Enterprise Perspective on Risks and Compliance”, O'Reilly, 2009.
COURSE OUTCOMES
 Articulate the main concepts, key technologies, strengths, and limitations of cloud
computing.
 Identify the architecture and infrastructure of cloud computing, including SaaS,
PaaS, IaaS, public cloud, private cloud, hybrid cloud, etc.
 Explain the core issues of cloud computing such as security, privacy, and
interoperability.
 Provide the appropriate cloud computing solutions and recommendations
according to the applications used.
 Collaboratively research and write a research paper, and present the research
online.
GLOBAL ELECTIVES (OFFERED FOR STUDENTS OTHER THAN CSE)
L T P C
CS451 INTRODUCTION TO CLOUD COMPUTING
3 0 0 3
COURSE OBJECTIVES
 To provide an in-depth and comprehensive knowledge of the Cloud Computing.
fundamental issues, technologies, applications and implementations.
 To expose the students to the frontier areas of Cloud Computing.
 To motivate students to do programming and experiment with the various cloud
computing environments.
 To shed light on the Security issues in Cloud Computing.
 To introduce about the Cloud Standards.
Unit I - History of Cloud computing

History of Centralized and Distributed Computing - Overview of Distributed Computing,
Cluster computing - Grid computing. Technologies for Network based systems - System
models for Distributed and cloud computing- Software environments for distributed systems
and clouds.
Unit II - Virtualization and Hypervisors

Introduction to Cloud Computing- Cloud issues and challenges - Properties - Characteristics
- Service models, Deployment models. Cloud resources: Network and API - Virtual and
Physical computational resources - Data-storage. Virtualization concepts - Types of
Virtualization- Introduction to Various Hypervisors - High Availability (HA)/Disaster
Recovery (DR) using Virtualization, Moving VMs.
Unit III - Cloud Computing Services

Service models - Infrastructure as a Service (IaaS) - Resource Virtualization: Server,
Storage, Network - Case studies. Platform as a Service (PaaS) - Cloud platform &
Management: Computation, Storage - Case studies. Software as a Service (SaaS) - Web
services - Web 2.0 - Web OS - Case studies – Anything as a service (XaaS)- Micro services.
Unit IV - Parallel Programming in Cloud

Cloud Programming and Software Environments – Parallel and Distributed Programming
paradigms – Overview of existing technologies.
Unit V - Cloud Security

Cloud Access: authentication, authorization and accounting - Cloud Provenance and meta-
data - Cloud Reliability and fault-tolerance - Cloud Security, privacy, policy and
compliance- Standards.
TEXT BOOK
1. Kai Hwang, Geoffrey C. Fox and Jack J. Dongarra, “Distributed and cloud
computing from Parallel Processing to the Internet of Things”, Morgan Kaufmann,
Elsevier, 2012.
REFERENCE BOOKS
1. Barrie Sosinsky, “Cloud Computing Bible”, John Wiley & Sons, 2010.
2. Tim Mather, Subra Kumaraswamy, and Shahed Latif, “Cloud Security and Privacy
an Enterprise Perspective on Risks and Compliance”, O'Reilly, 2009.
COURSE OUTCOMES
 Articulate the main concepts, key technologies, strengths, and limitations of
cloud computing and the possible applications for state-of-the-art cloud
computing.
 Identify the architecture and infrastructure of cloud computing, including SaaS,
PaaS, IaaS, public cloud, private cloud, hybrid cloud, etc.
 Explain the core issues of cloud computing such as security, privacy, and
interoperability.
 Provide the appropriate cloud computing solutions and recommendations
according to the applications used.
 Collaboratively research and write a research paper, and present the research
online.
L T P C
CS452 INFORMATION SECURITY
3 0 0 3
COURSE OBJECTIVES
 To understand the basics of Information Security.
 To know the legal, ethical and professional issues in Information Security.
 To know the aspects of risk management.
 To become aware of various standards in this area.
 To know the technological aspects of Information Security.
Information Security-Critical Characteristics of Information-NSTISSC Security Model-
Components of an Information System-Securing the Components-Balancing Security and
Access-The SDLC-The Security SDLC.
U nit II - Security Investigation

Need for Security-Business Needs-Threats-Attacks-Legal-Ethical and Professional Issues –
An Overview of Computer Security – Access Control Matrix-Policy-Security Policies-
Confidentiality policies- Integrity policies and Hybrid policies.
U nit III - Security Analysis

Risk Management: Identifying and Assessing Risk-Assessing and Controlling Risk –
Systems: Access Control Mechanisms-Information Flow and Confinement Problem.
U nit IV - Logical Design

Blueprint for Security-Information Security Policy-Standards and Practices-ISO 17799/BS
7799-NIST Models-VISA International Security Model-Design of Security Architecture-
Planning for Continuity.
U nit V - Physical Design

Security Technology-IDS-Scanning and Analysis Tools-Cryptography-Access Control
Devices-Physical Security-Security and Personnel.
TEXT BOOK
1. Michael E Whitman and Herbert J Mattord, “Principles of Information Security”,
Vikas Publishing House, New Delhi, 2003.
REFERENCE BOOKS
1. Micki Krause and Harold F. Tipton, “Handbook of Information Security
Management”, Vol 1-3, CRC Press LLC, 2004.
2. Stuart McClure, Joel Scrambray, George Kurtz, “Hacking Exposed”, Tata McGraw-
Hill, 2003.
3. Matt Bishop, “Computer Security Art and Science”, Pearson/PHI, 2002.
COURSE OUTCOMES
 Discuss the basics of information security.
 Illustrate the legal, ethical and professional issues in information security.
 Demonstrate the aspects of risk management.
 Become aware of various standards in the Information Security System.
 Design and implementation of Security Techniques.
L T P C
CS453 DATA STRUCTURES AND ALGORITHMS
3 0 0 3
COURSE OBJECTIVES
 This course aims to provide the students with a foundation in different data
structures.
 To Understand basic concepts about stacks, queues, lists, trees and graphs.
 To solve problems related to their field of engineering.
Introduction: Dynamic aspects of operations on data, Characteristics of data structures,
Creation and manipulation of data structures, Operations on data structures, Types of data
structures – linear and nonlinear. Introduction to algorithm: Asymptotic notations, Analysis
of algorithms: Time and Space complexity.
Unit II - Arrays and Linked Lists

Arrays: Dynamic memory allocation, one-dimensional arrays, multidimensional arrays,
operations on arrays, storage – Row major order, Column major order. Linked lists: types of
linked lists – singly, doubly and circularly linked lists, operations on linked lists.
Unit III - Stacks and Queues

Stacks: Implementation of stacks– array and linked list, operations on stacks, Applications
of Stacks, Notations – infix, prefix and postfix, Conversion and evaluation of arithmetic
expressions using Stacks. Queues: Implementation of queues– array and linked list,
operations on queues, Types of queues – queue, double ended queue and priority queue.
Unit IV - Trees and Graphs

Trees: Binary tree, Binary search tree, Threaded binary tree, Height balanced trees, Tries,
Heaps, Hash tables. Graph traversals: Breadth First Search, Depth First Search, Shortest
path: Depth first search in directed and undirected graphs. Union-find data structure and
applications. Directed acyclic graphs; topological sort.
Unit V - Searching and Sorting

Searching: Linear search, Binary search and Hashing. Algorithms and data structures for
sorting: Insertion Sort, Bubble sort, Selection Sort, Merge sort, Quick Sort, Heap sort, Radix
sort, Bucket sort. Algorithm design techniques: Divide and conquer, Greedy approach,
dynamic programming.
TEXT BOOK
1. E. Horowitz and S. Sahni, "Fundamentals of Data Structures", Publisher Computer
Science Press, Second Edition, 2008.
REFERENCE BOOKS
1. E. Balagurusamy, "Data Structures Using C", Tata McGraw Hill, 2013.
2. R.L. Kruse, "Data Structure and Program Design", Prentice Hall, Second Edition,
1996.
3. A. M. Tanenbaum, Y. Langsam, M. J. Augenstein, "Data Structures Using C",
COURSE OUTCOMES
 Choose appropriate data structure as applied to specified problem definition.
 Handle operations like searching, insertion, deletion, traversing mechanism etc.
on various data structures.
 Implement Linear and Non-Linear data structures.
 Design advance data structure using Non-Linear data structure.
 Analyze algorithms and algorithm correctness.
L T P C
CS454 OPERATING SYSTEM CONCEPTS
3 0 0 3
COURSE OBJECTIVES
 To know the basics such as process and CPU scheduling algorithms.
 To understand the critical regions and dead lock problem.
 To understand virtual memory concept, thrashing problem and page replacement
algorithms.
 To understand the file tables, access algorithms, and spoofing.
Unit I - Basic OS Concepts

User's view of the OS - Architectural support - Thread and process scheduling - Pre-emptive
and non-pre-emptive - FCFS, SJF, Round Robin, Multilevel Queue.
Unit II - Synchronization
Peterson's solution - Bakery algorithm - Hardware-based solutions - Semaphores - Critical
regions - Problems of synchronization - Deadlock prevention and recovery - Banker's
algorithms.
Unit III - Memory Management

Swapping – Contiguous Memory Allocation – Paging – Segmentation – Segmentation with
Paging – Virtual Memory – Demand Paging – Process Creation – Page Replacement –
Allocation of Frames – Thrashing.
Unit IV - File Systems

File Concept – Access Methods – Directory Structure – File System Mounting – File Sharing
– Protection – File System Structure – File System Implementation – Directory
Implementation – Allocation Methods – Free Space Management.
Unit V - I/O Systems

Kernel I/O Subsystem – Disk Structure – Disk Scheduling – Disk Management – Swap
Space Management – RAID Structure – Case study on Linux System – Case study on
Windows XP.
TEXT BOOK
1. A.Silberchatz and P.B.Galvin, "Operating System Concepts", Addison Wesley,
Tenth Edition, 2018.
REFERENCE BOOK
1. W.Stallings, "Operating Systems", Prentice Hall, Fifth Edition, 2005.
COURSE OUTCOMES
 Implement CPU scheduling algorithms and resolve problems related to critical
regions.
 Implement page replacement algorithms like FCFS, LRU, etc.
 Change UNIX access controls to protect the files.
 Describe the various Data Structures and algorithms used by Different Oss like
Windows XP, Linux and Unix pertaining with Process, File, I/O management.
 Control the behaviour of OS by writing Shell scripts.
L T P C
CS455 OBJECT ORIENTED PROGRAMMING WITH C++
3 0 0 3
COURSE OBJECTIVES
 To understand fundamentals of programming such as variables, conditional and
iterative execution, methods, etc.
 To impact the program using more advanced C++ features such as composition
of objects, operator overloads, dynamic memory allocation, inheritance and
polymorphism, file I/O, exception handling, etc.
 To understand and build C++ classes using appropriate encapsulation and design.
Object oriented programming concepts – Data types – Tokens – Expressions- Pointers –
Arrays.
Unit- II - Structures and Functions

Structures – Functions- Returning values from functions. Reference arguments. Overloaded
function. Inline function. Default arguments. Returning by reference.
Unit III - Classes and Objects

Classes – Objects Constructor and Destructor - Operator overloading - String Handling –
Type Conversion- Inheritance.
Unit IV - Advanced Object Oriented Programming Concepts

Polymorphism – Run time polymorphism – Virtual Functions- Manipulators - Templates–
Exception Handling.
Unit V - Strings and File Handling

File Handling- Manipulation of Strings - Standard Template Library – List.
TEXT BOOK
1. P.J. Deitel, “C++ How to Program”, Prentice-Hall of India Pvt Ltd., Sixth edition,
2013.
REFERENCE BOOKS
1. Robert Lafore, “Object oriented programming in C++”, Galgotia Publication, 2008.
2. E. Balagurusamy, “Object Oriented Programming with C++”, McGraw Hill
Company Ltd., 2013.
3. B. Trivedi, “Programming with ANSI C++”, Oxford University Press, 2012.
4. Ira Pohl, “Object Oriented Programming using C++”, Pearson Education, Second
Edition, Reprint 2013.
5. S. B. Lippman, Josee Lajoie, Barbara E. Moo, “C++ Primer”, Fourth Edition,
COURSE OUTCOMES
 Implement language features used in C++.
 Get basic knowledge on structural programming.
 Understand advanced features of C++ specifically stream I/O, templates and
operator overloading.
 Understand how to apply the major object-oriented concepts to implement
object-oriented programs in C++, encapsulation, inheritance and polymorphism.
 Understand advanced features of C++ specifically stream I/O, templates and
operator overloading.
L T P C
CS456 WEB OF THINGS
3 0 0 3
COURSE OBJECTIVES
 To learn the basic issues, policy and challenges in the Internet.
 To get an idea of some of the application areas where Web of Things can be
applied.
 To understand the cloud and internet environment.
 To understand the various modes of communications with Internet.
Introduction to Internet of Things-Enter of web of things-a supercharged internet of things
Hello world wide Web of Things, Node.js for the Web of Things.
Unit II - Embedded Systems

Embedded systems- The world of embedded devices, first Web of Things device, installing
node.js on the Raspberry Pi.
Unit III - Building Network of Things

Networking protocols on Things, Application protocols for things, The Web of Things
architecture, Building the Web of Things. -Web APIs for Things, Beyond REST:the real
time web of things.
Unit IV - Implementing Web of Things

Connecting devices to the web, direct integration pattern, gateway integration pattern, cloud
integration pattern Describe and discover Web of Things- Discovering things, describing
web things, the semantic web things.
Unit V - Securing and Sharing Web of Things

Securing things, authentication and access control, the social Web of Things.
TEXT BOOK
1. Dominique Guinard, “Building the Web of Things: With examples in Node.js and
Raspberry Pi”, First Edition, 2016.
REFERENCE BOOK
1. Honbo Zhou,” The Internet of Things in the Cloud: A Middleware Perspective”,
CRC Press, 2012.
COURSE OUTCOMES
 Identify the components of Web of Things.
 Analyze various protocols of Web of Things.
 Design portable Web of Things using appropriate boards.
 Develop schemes for the applications of Web of Things in real time scenarios.
 Design business Intelligence and Information Security for Web of Things.
L T P C
CS457 COMMUNICATION AND COMPUTER NETWORKS
3 0 0 3
COURSE OBJECTIVES
 To provide insight about networks, topologies, and the key concepts.
 To gain comprehensive knowledge about the layered communication
architectures (OSI and TCP/IP) and its functionalities.
 To understand the principles, key protocols, design issues, and significance of
each layer in OSI and TCP/IP.
 To know the basic concepts of network security and its various security issues
related with each layer.
Network architecture – layers – Physical links – Channel access on links – Hybrid multiple
access techniques - Issues in the data link layer - Framing – Error correction and detection –
Link-level Flow Control.
Unit II - Medium Access Control (MAC) Layer

Medium access: Carrier Sense Multiple Access (CSMA) - Ethernet – Token ring (IEEE
802.5) – Fiber Distributed Data Interface (FDDI) – Wireless Local Area Network (WLAN)
– Bridges and Switches.
Unit III - Network Layer

Circuit switching vs. Packet switching/ Packet switched networks. Protocols: Internet
Protocol (IP) – Address Resolution Protocol (ARP) – Reverse Address Resolution Protocol
(RARP) –Dynamic Host Configuration Protocol (DHCP) – Internet Control Message
Protocol (ICMP). Queuing discipline – Routing algorithms: Routing Information Protocol
(RIP) – Open Shortest Path First (OSPF). Subnet creation - Interdomain routing: BGP – IPv6
– Multicasting.
Unit IV - Transport Layer

User Datagram Protocol (UDP) – Transmission Control Protocol (TCP) – Adaptive Flow
Control – Adaptive Retransmission - Congestion control –Congestion avoidance – Quality
of Service (QoS).
Unit V - Application Layer

Protocols: Hyper Text Transfer Protocol (HTTP) – Domain Name System (DNS) – (Simple
Network Management Protocol (SNMP) – File Transfer Protocol (FTP). E-mail related
protocols: Simple Mail Transfer Protocol (SMTP), Multipurpose Internet Mail Extensions
(MIME), Post Office Protocol (POP3).
TEXT BOOKS
1. Larry L. Peterson and Bruce S. Davie, “Computer Networks: A Systems Approach”,
Fifth Edition, Morgan Kaufmann Publishers Inc., 2012.
2. Andrew S. Tanenbaum and David J. Wetherall, “Computer Networks”, Fifth Edition,
2010.
3. William Stallings, “Data and Computer Communication”, Eighth Edition, Pearson
Education, 2007.
REFERENCE BOOKS
1. James F. Kuross and Keith W. Ross, “Computer Networking, A Top-Down
Approach Featuring the Internet”, Third Edition, Addison Wesley, 2004.
2. Nader F. Mir, “Computer and Communication Networks”, Pearson Education,
2007.
3. Comer, “Computer Networks and Internets with Internet Applications”, Fourth
COURSE OUTCOMES
 Obtain insight about basic network theory and layered communication
architectures.
 Provide solutions to various problems in network theory.
 Identify the different types of network topologies and protocols.
 Understand and building the skills of subnetting and routing mechanisms.
 Enumerate the layers of the OSI model and TCP/IP. Explain the functions of
each layer.
L T P C
CS458 INTRODUCTION TO JAVA PROGRAMMING
3 0 0 3
COURSE OBJECTIVES
 Implementing program for user interface and application development using core
java principles.
 Comprehension of java programming constructs, control structures in java.
 Implementing object-oriented constructs such as various class hierarchies,
interfaces and exception handling.
 Understanding of thread concepts and I/O in java.
Unit I - Introduction to OOPS

Introduction to object-oriented programming - principles of object oriented languages -
procedural languages Vs. OOPs - applications of OOPs - java features - program structures
- Variables - primitive data types – identifiers - naming conventions – keywords – literals –
operators – binary - unary and ternary – expression - precedence rules and associativity -
primitive type conversion and casting.
Unit II - Programming Constructs

Control statements – arrays- one dimensional and multidimensional - command line
arguments. Introducing classes – class fundamentals – methods - objects - constructors – this
keyword – garbage collection.
Unit III - Inheritance, Interface and Exceptions

Types of inheritance – interface - interface vs abstract classes - packages-creating packages
- access protection -java.lang package - exception handling techniques - user defined
exception– assertions.
Unit IV - Multithreading And I/O

Threads - thread priority – multithreading – Synchronization - suspending and resuming
threads - communication between threads. Java I/O streaming – filter and pipe streams.
Unit V - Collection Frameworks

Collection Framework in Java – Introduction to Java Collections, Overview of
Java Collection frame work, Generics, Commonly used Collection classes– Array List,
Vector, Hash table, Stack, Enumeration, Iterator, String Tokenizer, Random, Scanner,
calendar and Properties
TEXT BOOK
1. Herbert Schildt, ” The complete reference java”, Tenth Edition, TMH, 2017.
REFERENCE BOOKS
1. Y.Daniel Liang, “Introduction to Java programming”, Sixth Edition , Pearson, 2014.
2. E.Balaguruswamy, “Programming with JAVA”, Fifth Edition, TMH, 2014.
COURSE OUTCOMES
 Have knowledge of the structure and model of the Java programming language.
 Use the Java programming language for various programming technologies.
 Develop software in the Java programming language.
 Evaluate user requirements for software functionality required to decide whether
the Java programming language can meet user requirements.
 Propose the use of certain technologies by implementing them in the Java
programming language to solve the given problem.
L T P C
CS459 MACHINE LEARNING TECHNIQUES
3 0 0 3
COURSE OBJECTIVES
 Learn about supervised and unsupervised learning.
 Study about Classification algorithms and its applications.
 Learn the importance of dimensionality reduction methods.
 Study advanced topics like Q learning, genetic algorithms.
Introduction to machine Learning – Types of Machine Learning –Applications - Supervised
Learning – The Brain and the Neuron – Design a Learning System – Perspectives and Issues
in Machine Learning – Concept Learning Task – Concept Learning as Search –Finding a
Maximally Specific Hypothesis – Version Spaces and the Candidate Elimination Algorithm-
Perceptron – Linear Separability – Linear Regression.
Unit II - Unsupervised Learning

Clustering–Applications- Metrics - Partitional Clustering - K means Algorithms – K-
mediods - Hierarchical clustering – Density based clustering: DBSCAN, Mean-Shift
clustering - Vector Quantization - Self Organizing Feature Map.
Unit III - Classification Methods

Classification metrics –Confusion matrix - Neural Network model - Multi-layer Perceptron
- Decision tree - Support Vector Machines- K-Nearest Neighbour – Boosting and Bagging -
Convolutional Neural Network.
Unit IV - Dimensionality Reduction

Dimensionality Reduction - Linear Discriminant Analysis - Principal Component Analysis
(PCA)- Factor Analysis - Independent Component Analysis. Feature selection: Filter and
Wrapper methods. Rank based algorithms.
Unit V - Advanced Topics

Reinforcement learning - Non deterministic rewards and Actions – Q Learning – Genetic
Algorithm - Tools for machine learning and case study.
TEXT BOOK
1. T.M. Mitchell, “Machine Learning”, McGraw-Hill, 1997.
REFERENCE BOOKS
1. Ethern Alpaydin, “Introduction to Machine Learning”, MIT Press, 2004.
2. Stephen Marsland, “Machine Learning -An Algorithmic Perspective”, Second
Edition, Chapman and Hall/CRC Machine Learning and Pattern Recognition Series,
2014.
COURSE OUTCOMES
 Gain knowledge about basic concepts of Machine Learning.
 Identify machine learning techniques suitable for a given problem.
 Solve the problems using various machine learning techniques.
 Apply Dimensionality reduction techniques.
 Design application using machine learning techniques.
L T P C
CS460 PYTHON PROGRAMMING FUNDAMENTALS
3 0 0 3
COURSE OBJECTIVES
 To develop Python programs with conditionals, loops and functions.
 To use Python data structures – lists, tuples, dictionaries.
 To explore various file operations and OOPS and advanced concepts.
Unit I - Basics of Python Programming

The way of the program – Variables, expressions and statements – Functions – Case Study:
interface design – Conditionals and recursion – Fruitful functions – Iteration – Strings -
Case Study: word play.
Unit II - Lists, Strings

Lists, tuples, and dictionaries - basic list operators – replacing - inserting - removing an
element - searching and sorting lists - dictionary literals - adding and removing keys -
accessing and replacing values - traversing dictionaries- String manipulations: subscript
operator, indexing, slicing a string; strings and number system.
Unit III - Files and OOPS

Files: Reading and Writing, Format operator, Filenames and path, Databases, Pickling,
Pipes, Writing Modules – Classes and functions - Inheritance- Data encapsulation - data
modeling - persistent storage of objects polymorphism - operator overloading abstract
classes - exception handling.
Unit IV - GUI
Graphical user interfaces; event-driven programming paradigm; tkinter module, creating
simple GUI; buttons, labels, entry fields, dialogs; widget attributes - sizes, fonts, colors
layouts, nested frames – Plotting - Data Visualisation and Regular expression -– Design
Patterns.
Unit V - Advanced Concepts

Role of Python in Hacking and cyber Forensics – Debugging – Hooking- Case study.
TEXT BOOKS
1. Allen B. Downey, “Think Python – How to Think Like a Computer Scientist”,
Second Edition, Green Tea Press, 2015.
2. Mark Pilgrim, “Dive into Python”, 2004.
REFERENCE BOOK
1. Annapoornima Koppad, “Introduction to Python Programming”, Sixth Edition, 2016.
COURSE OUTCOMES
 Structure simple Python programs for solving problems.
 Represent compound data using Python lists, tuples and dictionaries.
 Read and write data from/to files in Python Programs.
 Develop GUI applications for various modules.
 Explore python’s role in different fields.
L T P C
CS461 R PROGRAMMING
3 0 0 3
COURSE OBJECTIVES
 Master the use of the R interactive environment.
 Understand the different data types, data structures in R.
 Manipulate strings in R.
 Understand basic regular expressions in R.
Introduction and preliminaries - Simple manipulation - Numbers and vectors - Quoting and
escape sequence - Missing values - Objects - their modes and attributes - ordered and
unordered factors - Arrays and Matrices - Lists and Data frames.
Unit II - Basics
Reading data from file – Grouping - Loops and conditional execution - Writing your own
functions - Probability and distributions- Statistical model in R.
Unit III - Graphics

Scatterplot - Line graph - Bar graph – Histogram - Box plot - Controlling overall appearance
of the graph - Using colours in plots.
Unit IV - Data Analytics

Simple linear regression - Residuals and fitted value - prediction and confidence bands –
correlation - Linear models - polynomial regression - Regression through the origin – Two
way ANOVA with replication - Analysis of covariance.
Unit V - R-Advanced analytics and web application using R-shiny

Logistic regression - Generalized linear models - logistic regression on tabular data - logistic
regression using raw data – prediction - model checking - Building your own web page using
R shiny - taking control of reactivity - inputs and outputs - running and sharing your
creations.
TEXT BOOKS
1. Peter Dalgaard, “Introductory statistics with R”, Second Edition, springer, 2008.
2. Winston Cbang, “R graphics cook book”, O’Reilly publication, First Edition, 2013.
REFERENCE BOOK
1. Mark Gardener, “Beginning R: The statistical programming”, Weilly Publication,
2012.
COURSE OUTCOMES
 List motivation for learning a programming language.
 Import, review, manipulate and summarize data-sets in R.
 Access online resources for R and import new function packages into the R
workspace.
 Explore data-sets to create testable hypotheses and identify appropriate statistical
tests.
 Apply of R programming for simple case studies in Data Mining, Data Analytics.

B.Tech. Degree in Computer Science and Engineering

Uploaded by

Copyright:

Available Formats

B.Tech. Degree in Computer Science and Engineering

Uploaded by

Document Information

Original Description:

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

B.Tech. Degree in Computer Science and Engineering

Uploaded by

Copyright:

Available Formats

B.Tech.

SYLLABUS FOR CREDIT BASED CURRICULUM

DEPARTMENT OF COMPUTER SCIENCE AND

NATIONAL INSTITUTE OF TECHNOLOGY PUDUCHERRY

CODE COURSE TITLE L T P C

HM111 Business English 2 0 2 3

MA111 Algebra and Calculus 3 0 0 3

Basics of Electrical and

CH111 Engineering Chemistry 3 0 0 3

CS101 Programming Fundamentals 3 0 0 3

CH113 Chemistry Laboratory 0 0 3 2

CS103 Programming in C Laboratory 0 0 3 2

EE113 Workshop Practice 0 0 2 2

CODE COURSE TITLE L T P C

Vectors and Ordinary

PH112 Engineering Physics 2 0 2 3

ME112 Environmental Engineering 3 0 0 3

ME114 Engineering Graphics 0 0 3 3

CS102 Data Structures 3 0 0 3

CS104 Digital Computer Fundamentals 3 0 0 3

PH114 Engineering Physics Laboratory 0 0 3 2

CS106 Data Structures Laboratory 0 0 3 2

CODE COURSE TITLE L T P C

MA211 Discrete Mathematics 3 0 0 3

Design and Analysis of

CS203 Programming Paradigms 3 0 0 3

CS205 Automata and Formal Languages 3 0 0 3

Computer Organization and

CS209 Data Communication 3 0 0 3

Design and Analysis of Algorithm

CODE COURSE OF STUDY L T P C

MA212 Probability and Statistics 3 0 0 3

CS202 Computer Networks 3 0 0 3

CS204 Software Engineering 3 0 0 3

CS206 Python Programming 3 0 0 3

CS208 Computer Networks Laboratory 0 0 3 2

CS210 Python Programming Laboratory 0 0 3 2

CODE COURSE OF STUDY L T P C

CS301 Database Management System 3 0 0 3

CS303 Operating Systems 3 0 0 3

CS305 UNIX Programming 3 1 0 4

Artificial Intelligence and Expert

Database Management System

CS311 Operating Systems Laboratory 0 0 3 2

CODE COURSE OF STUDY L T P C

HM312 Corporate Communication 3 0 0 3

CS302 Principles of Compiler Design 3 0 0 3

CS304 Web Technology 3 0 0 3

Engineering Ethics and Precepts

CS306 Compiler Design Laboratory 0 0 3 2

CS308 Web Technology Laboratory 0 0 3 2

CODE COURSE OF STUDY L T P C

Industrial Economics &

CS401 Computer Graphics 3 0 0 3

CS403 Machine Learning 3 0 0 3

CS491 Project Work Phase – I 0 0 0 3

CODE COURSE OF STUDY L T P C

CS492 Project Work Phase–II 0 0 0 6