B.Tech Hons. CSE With AI-ML All Semesters Course Structure and Syllabus

SCHOOL OF ENGINEERING &
TECHNOLOGY
B.Tech. (Hons.) Computer Science & Engineering

[Artificial Intelligence & Machine Learning]
Course Structure and Syllabus
2020–21
(Full Time)
1st Semester to 8th Semester
SCHOOL OF ENGINEERING AND TECHNOLOGY

JAGRAN LAKECITY UNIVERSITY, BHOPAL
TECHNOLOGY
B.Tech (Honors) CSE [Artificial Intelligence & Machine Learning]
Program Name and Duration:
The study of the program B.Tech (Honors) Computer Science and Engineering [Artificial Intelligence
& Machine Learning] shall extend for the period of four years, which is divided into eight semesters
with an end semester examination at the end of every semester.
Evaluation Pattern:
1. The medium of instruction is English. The Performance in most Courses is spelt out in terms of
letter grades O, A+, A, B+, B, C, P, F, Ab. Each letter grade has a qualitative meaning and a
grade point value as given below.
Credit Based Grading System

Letter Grade Description Range of
Grade Points Marks (%)
O 10 Outstanding 96-100
A+ 09 Excellent 86-95
A 08 Very Good 76-85
B+ 07 Good 66-75
B 06 Above 56-65
Average
C 05 Average 46-55
P 04 Pass 40-45
F 0 Fail <40
Ab 0 Absent 0
2. Each student will be evaluated with 40% in Mid Semester Examination and two internal
examinations and with 60% in the end semester examination. Minimum marks has to be scored,
otherwise the student will be awarded F in concern subject.
Credit distribution is as follows:-
Number Total
S.No
Type of Paper of Subjects Credit
1 Core Courses 18 48
2 Discipline Specific Course (DSE) 6 24
3 Internship 1 08
4 Dissertation/ Project/Seminar Work 4 12
5 Generic Elective (GE) 2 04
6 Ability Enhancement Compulsory Courses 3 6
(AECC)
7 Skill Enhancement Courses (SEC) and Others 4 8
8 Program Specialization Courses (PSC) 12 35
9 Basic Science courses (BSC) 7 21
10 Engineering Sciene Course (ESC) 10 25
Total Credit 191
2
TECHNOLOGY
Program Description:
B. Tech in Computer Science & Engineering (Artificial Intelligence and Machine Learning) is an
undergraduate programme with advanced learning solutions imparting knowledge of advanced
innovations like machine learning, often called deep learning and artificial intelligence.
This course is designed to enable students to build intelligent machines, software, or applications with
a cutting-edge combination of machine learning, analytics and visualization technologies. The main
goal of artificial intelligence and machine learning (AI-ML) is to program computers to use example
data or experience to solve a given problem.
Objective of the Program:
The Programme Objectives are to prepare the students to:

 Apply foundational knowledge successfully to bear analytical and computational approaches on
changing technological challenges.
 Engage in technology development and deployment with social awareness and responsibility.
 Drives scientific and societal advancement through technological innovation and
entrepreneurship.
 Adapt, contribute and innovate new technologies and systems in the key domains of Computer
Science and Engineering.
 Perform in technical/managerial roles ranging from design, development, problem solving to
production support in software industries and R&D sectors.
Outcome of the Program:

After undergoing this programme, a student will be able to:
 Illustrate & apply the relevant principles, concepts & methods from mathematics, Computer
Science, Artificial Intelligence and other allied disciplines to solve real life practical problems by
developing suitable solutions.
 Adapt knowledge centric education and accomplish innovative & modern research in the
specialized areas of Computer Science and Engineering.
 Design and evaluate improved/ new technologies and analyze them to decide the best possible
solution to a real life problem.
 Utilize Artificial Intelligence and Machine Learning towards problem solving, inference,
perception, knowledge representation, and learning.
 Develop new systems and maintain them in compliance with industry specifications, standards
and recommendations.
 Build intelligent machines, software or applications with a cutting-edge combination of machine
learning, analytics and visualization tools.
 Develop the skills to communicate and engage effectively with diverse stakeholders.
 Construct proficiency in teamwork skills through experiential learning to perform any
technical/managerial role in the industry.
 Adapt to cultural, environmental, sustainability and ethical issues.
 Adapt to situations demanding self-driven continuous learning.
3
TECHNOLOGY
Department of Computer Science & Engineering

B.Tech. (Hons.) Computer Science & Engineering
[Artificial Intelligence & Machine Learning]
Course Structure
FIRST SEMESTER
Lectures Tutorial (T) Practical

S. Course
Course Title (L) Hours/ Hours/ (P) Hours Credits
No Code
Week Week Week
Basic Science Courses (BSC)
1. BTF101 Engineering Mathematics-I 3 1 - 4
2. BTF102 Engineering Physics 3 1 - 4
Engineering Science Course (ESC)
Computer Fundamentals And Programming
3. BTF103 3 1 - 4
in C
4. BTF104 Engineering Graphics 4 - - 4
5. BTF105 Fundamentals of Digital Logic 3 - - 3
Ability Enhancement Compulsory Courses (AECC)
6. BTF106 Communication Skills 2 - - 2
Practical/ Tutorials
7. BTF107 Engineering Physics Lab - - 2 1
Computer Fundamentals And Programming

8. BTF108 - - 4 2
in C Lab
9. BTF109 Engineering Graphics Lab - - 4 2
Total Available Credits 26
4
TECHNOLOGY
SECOND SEMESTER

S. Course
No Code
Week Week Week
1. BTF201 Engineering Mathematics II 3 1 - 4
2. BTF202 Engineering Chemistry 3 - - 3
Engineering Science Course (ESC)
3. BTF203 Basic Electrical & Electronics Engineering 3 - - 3
4. BTF204 Basic Mechanical Engineering 3 - - 3

Core Courses
5. BTF205 Data Structures 3 - - 3
Skill Enhancement Courses (SEC)
6. BTF206 Skill for Engineers–I 2 - - 2
7. BTF207 Engineering Chemistry Lab - - 2 1
Basic Electrical & Electronics Engineering
8. BTF208 - - 2 1
Lab
9. BTF209 Basic Mechanical Engineering Lab - - 2 1
10. BTF210 Data Structures Lab - - 4 2
11. BTF211 Workshop Practice - - 4 2
5
TECHNOLOGY
THIRD SEMESTER

S. Course
No Code
Week Week Week
1. BTF301 Engineering Mathematics III 3 1 - 4
Core Courses
2. BTAIC302 Object Oriented Programming 3 1 - 4
3. BTAIC303 Discrete Mathematics 3 1 - 4
4. BTAIC304 Analysis and Design of Algorithms 3 1 - 4
5. BTF305 Environmental Science 2 - - 2
6. BTF306 Skills for Engineers II 2 - - 2
7. BTAIC307 Object Oriented Programming Lab - - 4 2
8. BTAIC308 Analysis and Design of Algorithms Lab - - 2 1
9. BTAIC309 Java Programming Lab - - 4 2
6
TECHNOLOGY
FOURTH SEMESTER

S. Course
No Code
Week Week Week
Core Courses
1. BTAIC401 Operating Systems 3 1 - 4
2. BTAIC402 Computer Networks 3 1 - 4
3. BTAIC403 Computer Organization & Architecture 3 1 - 4
Discipline Specific Courses (DSE)
4. Program Elective-I 3 1 4
5. BTF405 Disaster Management 2 - - 2
6. BTF406 Skills for Engineers III 2 - - 2

7. BTAIC407 Operating Systems Lab - - 4 2
8. BTAIC408 Computer Networks Lab - - 2 1
9. BTAIC409 Python Programming Lab - - 4 2
Note:
 Students may go for International Training & Education Program for duration of one month
and it will be evaluated in 5th Sem.
 Students can opt the elective from the given list or any MOOC courses from SWAYAM
Platform as per the Annexure [BOS-1].
Program Elective I
Course Code Elective Course Name
BTAIE409 Graph Theory
BTAIE410 Software Engineering
BTAIE411 Embedded Systems
BTAIE412 Advanced Algorithms
BTAIE413 Principles of Programming Languages
BTAIE414 Digital Communication
7
TECHNOLOGY
FIFTH SEMESTER

S. Course
No Code
Week Week Week
Program Specialization Courses (PSC)
(PSC)
1. BTAIS501 Introduction to AI and Machine Learning 3 1 - 4
2. BTAIS502 Statistics & EDA 3 1 - 4
Core Courses
3. BTF505 Database Management System 1 3 - - 3
-
4
4. Program Elective-II 3 1 4
5. Program Elective-III 3 1 4
6. BTF506 Skills for Engineers IV 2 - - 2
Introduction to AI and Machine Learning
7. BTAIS507 - - 2 1
Lab
8. BTAIS508 Statistics & EDA Lab - - 4 2
9. BTAIC509 Database Management System Lab - - 2 1
International Training & Education

10. BTAIP510 - - 4 2
Program/Mini Project
Note:
Program Elective II
BTAIE509 Theory of Computation
BTAIE510 Distributed Systems
BTAIE511 Computer Graphics
BTAIE512 Advanced Operating Systems
BTAIE513 Cryptography & Network Security
BTAIE514 Parallel and Distributed Algorithms
8
TECHNOLOGY
Program Elective III

BTAIE515 Soft Computing Techniques
BTAIE516 Optimization Techniques
BTAIE517 Computational Complexity
BTAIE518 Pattern Recognition
BTAIE519 Web Technology
BTAIE520 Linux Programming
9
TECHNOLOGY
SIXTH SEMESTER

S. Course
No Code
Week Week Week
(PSC)
1. BTAIS601 Machine Learning II 3 1 - 4
2. BTAIS602 Natural Language Processing 3 1 - 4
Core Courses
3. BTAIC603 Compiler Design 1 3 1 - 4
-
4
4. Program Elective-IV 3 1 - 4
Generic Elective (GE)
5. Open Elective-I 1 2 - - 2
4
6. BTAIS606 Machine Learning II Lab - - 4 2
7. BTAIS607 Natural Language Processing Lab - - 4 2
8. BTAIC608 Compiler Design Lab - - 2 1
9. BTAIP609 Minor Project - - 4 2
Note:
 Students need to go for industrial training for duration of 6 weeks and it will be evaluated in
7th Sem.
Program Elective IV
BTAIE609 Android Application Development
BTAIE610 Introduction to Cloud Computing
BTAIE611 Biometric Systems
BTAIE612 Robotics & Automation
BTAIE613 Ad-Hoc and Sensor Networks
BTAIE614 Real Time Systems
10
TECHNOLOGY
Open Elective I
BTAIO615 Project Management
BTAIO616 Supply chain management
BTAIO617 Multimedia and Animation
BTAIO618 Cyber Law and Ethics
BTAIO619 Social Network Analysis
BTAIO620 Contemporary Management Process
11
TECHNOLOGY
SEVENTH SEMESTER

S. Course
No Code
Week Week Week
(PSC)
1. BTAIS701 Big Data Analytics 3 1 - 4
2. BTAIS702 Deep Learning 3 1 - 4
3. Program Elective-V 3 1 - 4
4. Program Elective-VI 3 1 4
Generic Elective (GE)
5. Open Elective-II 1 2 - - 2
4
6. BTAIS706 Big Data Analytics Lab - - 4 2
7. BTAIS707 Deep Learning Lab - - 4 2
8. BTAIP708 Industrial Training/ Major Project-I - - 8 4
Note:
 Students may go for Industrial Internship for duration of 8-12 Weeks and it will be evaluated
in 8th Sem.
Program Elective V
BTAIE706 Internet of Things
BTAIE707 Wireless Sensor Networks (WSN)
BTAIE708 High Performance Computing
BTAIE709 E – Commerce
BTAIE710 Open Source Systems
BTAIE711 Social Web Mining
12
TECHNOLOGY
Program Elective VI
Course Elective Course Name
Code
BTAIE712 Digital Image Processing
BTAIE713 Data Mining and Warehousing
BTAIE714 Mobile Computing
BTAIE715 Quantum Computing
BTAIE716 Information Retrieval
BTAIE717 Information Theory and Coding
Open Elective II
BTAIO718 Tourism Concepts and Impacts
BTAIO719 Human Rights and Duties
BTAIO720 Intellectual Property Rights
BTAIO721 Social Psychology
BTAIO722 Mass Communication and Journalism
BTAIO723 Indian Music System
13
TECHNOLOGY
EIGTH SEMESTER

S. Course
No Code
Week Week Week
Internship / Dissertation/ Project/Seminar Work
1. BTAIP801 Industrial Internship/ Major Project-II - - 16 8
BTAIP802 Industrial Internship/ Major Project-II - - 8 4
2.
Report
Note: Evaluation will be done on the basis of submission of project report, presentation and viva-voce.
14
TECHNOLOGY
Total Credit
Semester/ Lecture/ Tutorial/ Practical
Total Credits
Category L T P
I 18 03 10 26
II 17 01 14 25
Total 35 04 24 51
Lecture/ Tutorial/ Practical

Semester/ Total Credits
Category L T P
III 16 4 10 25
IV 16 4 10 25
V 17 4 12 27
VI 14 4 14 25
VII 14 4 16 26
VIII 0 0 24 12
Total 77 20 86 140
GRAND TOTAL (I to VIII Semester) 191
15
TECHNOLOGY
FIRST SEMESTER
Engineering Mathematics-I
Engineering Mathematics-I L T P C
Course Code:
3 1 0 4
BTF101
COURSE OBJECTIVES
 To provide students the basic knowledge of Matrix calculations .
 To provide knowledge and functionality of Integral calculus and differential calculus
 To impart analytical ability in solving mathematical problems as applied to the respective
branches of Engineering.
COURSE OUTCOMES
Student shall be able to:
 Illustrate various problems that can be solved using Calculus.
 Apply concepts of differential equations that relate one or more functions and
their derivatives.
 Model the solutions for complex problems using Matrix & Algebra of Logic.
UNIT I
DIFFERENTIAL CALCULUS
Partial Differentiation, Euler‟s Theorem and its application in application and errors, Maxima
and Minima of Functions of two variables, Curvature, Radius of Curvature, Centre of Curvature.
Some applications of Differential Calculus
UNIT II
INTEGRAL CALCULUS
Definite integral, Double and Triple integrals, Change of order of integration, Area, Volume,
Surface, using double and triple integral, Some applications of Integral Calculus
UNIT III
DIFFERENTIAL EQUATIONS (12 hours)
Ordinary Differential Equations of first order and first degree for exact differential equations,
Solution of O.D.E of first order and higher degree, Linear higher order with constant
coefficients. Application of O.D.E
UNIT IV
MATRICES (12 hours)
16
TECHNOLOGY
Rank, solution of simultaneous equation by elementary transformation, Characteristic equation –
Eigen values and Eigen vectors, Cayley – Hamilton theorem and its application to find its
inverse.Application of Matrices.
UNIT V
Algebra of Logic, Graph Theory
Algebra of logic, Boolean algebra and Boolean function, principal of duality, Principal of
duality, Basics theorems of Boolean algebra.Application in switching & logical circuits.
Application of graph theory
Text books:
1. B.S, Grewal“Higher Engineering Mathematics”, Khanna Publications, 42thedition.
References:
1.Kreyszig.E, “Advanced Engineering Mathematics”, John Wiley & Sons. Singapore, 10th
Edition, 2012.
2. D.C.Agarwal , “Engineering Mathematics-1”,Shree SaiPrakashan, 9th edition.
3.H.K.Dass, “Advanced Engineering Mathematics”, S.Chand& Company 12 thedition .
17
TECHNOLOGY
FIRST SEMESTER
Engineering Physics
Course Code: L T P C
BTF102 Engineering Physics 3 1 0 4
COURSE OBJECTIVES
 To impart knowledge in basic concepts of physics relevant to engineering applications.
 To introduce advances in technology for engineering applications.
 To emphasize the significance of Green technology through Physics principles
COURSE OUTCOMES
 Explain basic concepts of physics in solving technical problems.
 Apply the knowledge of quantum mechanics and wave optics in various applications.
 Value the significance of green technology through Physics principles.
UNIT I
Mechanical and Electronic Properties of Materials: Stress-strain relationship – Hooke‟s law,

Torsional Pendulum, Young‟s modulus by cantilever, Uniform and non-uniform bending,
semiconductors and insulators; intrinsic and extrinsic semiconductors, Fermi energy and
Variation of Fermi level with temperature, Hall effect, Dilute Magnetic Semiconductors (DMS)
and their applications,
UNIT II
Laser and Fiber Optics: Characteristics of Lasers, Einstein‟s coefficients and their relations,
spontaneous emission and stimulated emission of radiations, Population inversion, Principle and
working of Ruby Laser, Nd-YAG, He-Ne, CO2 laser, Application of Laser, Introduction to
optical fibers, principle of propagation of light in optical fibers, Acceptance angle and
acceptance cone, numerical aperture, V-number, types of optical fibers, attenuation in optical
fibers, advantage of optical fibers in communications, fiber optics communication system,
application of optical fibers, fiber optics sensors.
UNIT III
Quantum Mechanics and wave Optics: Introduction to Quantum Physics and quantum
computing, De Broglie hypothesis for matter waves, Heisenberg‟s uncertainty principle, Wave
function and its properties, energy and momentum operators, Schrödinger time dependent and
18
TECHNOLOGY
time independent waves equations. Diffraction of X-rays by crystal planes, Imperfections in

crystals, Interference of light, Bi-prism experiment/Newton‟s ring
UNIT IV
Superconductivity and Nanotechnology: Introduction and historical developments; Meissner

effect and its contradiction to the Maxwell‟s equation; Effect of magnetic field, Type-I and
Type-II superconductors, BCS theory, Josephson effect and tunnelling, Applications of
superconductors; Basics principle of nano-science and nano-technology, top down and bottom up
approach, Preparation, characteristics and analysis methods, thin films, carbon nano-tubes and
application of nanotechnology.
UNIT V
Green Energy Physics; Introduction to Green energy, Solar energy: Energy conversion by
photovoltaic principle, Solar cells, Wind energy: Basic components and principle of wind energy
conversion systems, Ocean energy: Wave energy, Wave energy conversion devices, Tidal
energy, single and double basin tidal power plants, Ocean Thermal Electric Conversion (OTEC,
Geothermal energy: Geothermal sources (hydrothermal, geo-pressurized hot dry rocks, magma),
Biomass: Biomass and bio-fuels, bio-energies from wastages, Fuel cells: H2O2, Futuristic
Energy: Hydrogen, Methane Hydrates, Carbon capture and storage (CCS), advantages and
disadvantages of green energy sources.
Text Books:
1. Dattu R.Joshi, “Engineering Physics”,Tata McGraw- Hill,New Delhi, 2010
2. Thiruvadigal .J. D, Ponnusamy .S, Sudha.D and Krishnamohan .M, “Physics for
Technologists”, Vibrant Publication, Chennai, 2013.
3. Charles Kittel, "Introduction to Solid State Physics", Wiley India Pvt. Ltd, 7th ed., 2007
4. V. Rajendran and A. Marikani, Material Science, Tata Mcgraw-Hill(2004)
Reference Books:
1. Physics Resnick & Halliday Volume I WileyIndia Publications.
2. Frank Fahy, “Foundations of Engineering Acoustics”, Elsevier Academic Press, 2005.
3. Alberto Sona, “Lasers and their applications”, Gordon and Breach Science Publishers
Ltd., 1976.
4. David J. Griffiths, “Introduction to electrodynamics”, 3rd ed., Prentice Hall, 1999.
5. Leonard. I. Schiff, “Quantum Mechanics”, Third Edition, Tata McGraw Hill, 2010.
6. Charles Kittel, "Introduction to Solid State Physics", Wiley India Pvt. Ltd, 7th ed., 2007.
7. Godfrey Boyle, “Renewable Energy: Power sustainable future”, 2nd edition, Oxford
University Press, UK, 2004.
19
TECHNOLOGY
FIRST SEMESTER
Computer Fundamentals and Programming in C
Computer Fundamentals and Programming L T P C

Course Code:
in C 3 1 0 4
BTF103
COURSE OBJECTIVES
 Understand the programming environment with the C Program structure.
 Design and create different types of programs in C language.
COURSE OUTCOMES
 Ilustrate fundamental concepts of computer programming.
 Design and develop the computer programs in C, analyzes, and interprets the concept of
pointers, declarations, initialization, operations on pointers and their usage.
UNIT I
Introduction to Digital Computer, block diagram of a Computer, different units and their
functions, Memory units, Software types, Computer languages DOS: introduction: External and
Internal commands, Algorithm, Pseudocode, Flowchart, program development steps, Basics of
Programming in C: Structure of C program, Simple C program, Consol input and output,
character set, constants, variables and keywords, instruction types, different types of operators.
UNIT II
Decision Control Structure: if, if-else, nested if-else, switch case, Loop Control Structure: while,
do-while and for statements, nesting of Loops, break, continue statements, Functions: user-
defined functions, standard library functions, function declaration and prototypes, passing values
between functions, Calling Convention, recursive functions.
UNIT III
Pointers: concepts, notation, initialization of pointer variables, Recursion and Stack, Storage
Classes: auto, register, static, extern, Arrays: concepts, declaration, definition, accessing
elements, storing elements, arrays, and functions, Passing an entire array to a function two-
dimensional and multi-dimensional arrays, applications of arrays.
20
TECHNOLOGY
UNIT IV
Strings:Standard library string functions, arrays of strings, string manipulation functions,

Preprocessor: Macro Expansion, File Inclusion, Conditional Compilation, Structures: Basics of
Structure, array of structures, pointer to structure, self-referential structures, unions, typedef,
bitfields.
UNIT V
Concept of a file, file operations, files opening modes, text files and binary files, error handling.
Text Books:
1. E Balagurusami, “Programming in ANSI C” Tata McGraw-Hill Education, Sixth Edition.

2. B.A. Forouzan and R.F. Gilberg, “Computer science, A structured programming approach
using C”, Thomson, Third edition.
3. Yashvant Kanetker, “Let Us C”, BPB publications, Tenth Edition.
Reference Books:
1. B.W. Kernighan, Dennis M.Ritchie, “The C Programming Language”, PHI/Pearson
Education.
2. J.A. Jones & K. Harrow, “C Programming with problem-solving”, Dreamtech Press.
21
TECHNOLOGY
FIRST SEMESTER
Engineering Graphics
L T P C
Course Code: Engineering Graphics
4 4 0 4
BTF104
COURSE OBJECTIVES
 To learn the basics of Technical Drawing in Theory and Practice using free hand
sketching, drafting with help of hand-held drafting tools, and computer-aided drafting
(AutoCAD).
COURSE OUTCOMES
After learning the course the students will be able to

 Demonstrate the conventions and the method of engineering drawing.
 Apply visualization skills for designing new products.
Unit I: Scales
Introduction of Engineering Graphics, Utility of Engineering graphics in respective branch,

Representative factor, Plain scales, Diagonal scales, Scale of chords. Conic sections: Construction
of ellipse, Parabola, Hyperbola by different methods; Normal and Tangent. Special Curves:
Cycloid, Epi-cycloid, Hypo-cycloid, Involutes, Archimedean and logarithmic spirals.
Unit II : Projection
Types of projection, Orthographic projection, First and third angle projection, Projection of points
and lines, Line inclined to one plane, inclined with both the plane, True Length and True
Inclination, Traces of straight lines.
Unit III - Projection of planes and solids
Projection of Planes like circle and polygons in different position, Projection of polyhedrons like
prisms, pyramids and solids of revolutions like cylinder, cones in different positions.
Unit IV :Section of Solids
Section of right solids by normal and inclined planes, Intersection of cylinders. Development of
Surfaces: Parallel line and radial - line method for right solids.
22
TECHNOLOGY
Unit V : Isometric Projections

Isometric scale, Isometric axes, Isometric Projection from orthographic drawing.
Computer Aided Drafting (CAD)
Introduction, benefit, Software‟s basic commands of drafting entities like line, circle, polygon,
polyhedron, cylinders; transformations and editing commands like move, rotate, mirror, array;
Benefit, software‟s, Wire frame, Surface and Solid Model, Basic commands of drafting entities like
line, circle, polygon, polyhedron, cylinders. Modification and editing commands like offset, Fillet,
Chamfer, trim Extend, mirror, array etc. Solution of projection problems on CAD.
Text Book:
1.N.D. Bhatt Laxmi Publication 2013 Edition.

2. Dr. C.M. Agarwal TMH 2012-13 Publication.
3. Venugopal –Engineering Drawing Latest version. (With AutoCAD)
4. Jeyopoovan. T, Engineering Drawing, Vikas Publication.
Reference Book:
1. John K.C, Engineering Graphics for Degree , PHI.

2. Agrawal&Agrawal, Engineering Graphics, TMH.
3. DhawanRK ,Engineering Drawing,S Chand & Co.
23
TECHNOLOGY
FIRST SEMESTER
Fundamentals of Digital Logic

L T P C
Course Code: Fundamentals of Digital Logic
3 0 0 3
BTF105
COURSE OBJECTIVES
 To understand different forms of number representation and their conversions
 To implement simple logical operations using combinational logic circuits
 To design combinational logic circuits, sequential logic circuits
 To understand memory organization
COURSE OUTCOMES
 Summarize basics concepts of digital electronics

 Analyze and design combinational and sequential circuits
 Discuss different types of memories & programmable logic devices.
UNIT I
Number System and Boolean Algebra:
Number Systems, Base Conversion Methods, Complements of Numbers, Codes- Binary Codes,
Binary Coded Decimal Code and its Properties, Unit Distance Codes, Error Detecting and
Correcting Codes.Digital Logic Gates, Universal Gates, Basic Theorems and Properties,
Switching Functions, Canonical and Standard Form.
UNIT II
Minimization Techniques:
Introduction, The minimization with theorems, The Karnaugh Map Method, Don‟t Care Map
Entries, Using the Maps for Simplifying, Quine-McCluskey Method, Prime and Essential
Implications, Multilevel NAND/NOR realizations.
UNIT III
Combinational Circuits:
Design Procedure – Half Adder, Full Adder, Half Subtractor, Full Subtractor, Parallel Binary
Adder, Parallel binary subtractor, Binary Multiplier, Multiplexers/DeMultiplexers, decoder,
Encoder, Code Converters, Magnitude Comparator
24
TECHNOLOGY
UNIT IV
Sequential Circuits:
Introduction, Basic Architectural Distinctions between Combinational and Sequential circuits,

Latches, Flip-Flops, SR,JK,D,T and Master slave, characteristic Tables and equations. Various
types of registers and Counters – Design Mode Counter, Ripple Counter, Ring Counter, Shift
Register, Ring counter using Shift Register
UNIT V
Memory Devices:
Classification of memories – ROM: ROM organization, PROM, EPROM, EEPROM, RAM:

RAM organization, Programmable Logic Devices: Programmable Logic Array (PLA),
Programmable Array Logic, Implementation of Combinational Logic circuits using ROM,
PLA,PAL.
Text Books:
1. Digital Design- Morris Mano, PHI, 3rd Edition.
2. Switching Theory and Logic Design-A. Anand Kumar, PHI, 2nd Edition.
Reference Books:
1. Digital Fundamentals – A Systems Approach – Thomas L. Floyd, Pearson, 2013.

2. Fundamentals of Logic Design- Charles H. Roth, Cengage LEanring, 5th, Edition
3. W. H. Gothmann, "Digital Electronics - An Introduction to Theory and Practice",
Prentice Hall of India, 2nd Edition, 1982
4. Stephen Brown, Z Vranesic, “Fundamental of Digital Logic with Verilog Design”,
McGraw Hill, 2ndedition, 2007
25
TECHNOLOGY
FIRST SEMESTER
Communication Skills
L T P C
Course Code: Communication Skills
2 0 0 2
BTF106
COURSE OBJECTIVES
 To provide an outline to effective Organizational Communication.
 To outline the nuances of Business communication.
COURSE OUTCOMES
 Classify various levels of organizational communication and communication barriers
while developing an understanding of Communication as a process in an organization.
 Develop knowledge, skills, and judgment around human communication that facilitate
their ability to work collaboratively with others
UNIT I
Elements of Communication
The Communication Cycle, The Barriers To Communication, The Principles Of Communication,

The Medium Of Communication, Accuracy, Brevity, Clarity, Courtesy, The Modes Of
Communication.
UNIT II
The Types of Communication
Oral Communication, Written Communication, Nonverbal Communication, Visual Signs In

Nonverbal Communication, Audio Signals In Nonverbal Communication, Silence, Time, Touch,
The Functions Of Nonverbal Communication, The Merits & Demerits Of Nonverbal
Communication.
UNIT III
Verbal Skills & Body Language
The Language Used In Oral Communication, Verbal & Linguistic Modifiers & Regulators &
Voice Culture, The Techniques Of Delivery.
26
TECHNOLOGY
Introduction To Body Language, The Types Of Body Language, Facial Expressions, Kinesics
Related To The Body, Touch.
UNIT IV
Listening
Listening & Hearing, The Value of Listening, The Functions of Listening, The Pitfalls Involved
In Listening, The Process of Listening / The Principles of Listening, How To Listen Efficiently,
The Barriers To Efficient Listening, The Types of Listening.
UNIT V
Types of Business Communication
Introduction, Business Communication, The Classification, Functions & Scope Of Business

Communication, Internal Communication, External Communication.
Dyadic Communication, Group Communication, Interviews, Letter Heads, Continuation Sheets,

Presentation.
Text Books:
1. Communication Skills : Dr. Rao & Dr. Dashimalaya Publishing House

2. Communication Skills : Dr. Urmila Rai, S.M. Rai – Himalaya Publishing House
Reference Books:
1. Communication : By C.S. Rayadu Himalaya Publishing House
2. Developing Communication Skills : Mohan Banerjee, Macmillan, India
27
TECHNOLOGY
FIRST SEMESTER
Engineering Physics Lab
BTF107 Engineering Physics Lab 0 0 2 1
COURSE OBJECTIVES
 The objective of the Engineering Physics Lab is that the student will have exposure to
various experimental skills which is very essential for an engineering student.
 The experiments are selected from various areas of physics like optics, lasers, fibre
optics, sound, mechanics, electricity and magnetism and basic electronics.
 To explore various tools like microscopes, spectrometers, screw gauge and vernier
calipers.
COURSE OUTCOMES
Students shall be able to :
 Summarize principle, concept, working and application of new technologies and
comparison of results with theoretical calculations.
 Explain measurement technology, usage of new instruments and real time applications
in engineering studies.
 Develop skills to impart practical knowledge of engineering physics in real time
solution.
List of Experiments
1. To determine the (i) moment of inertia of the disc and (ii) the rigidity modulus of the
material of the wire by torsional oscillations.
2. To calculate the Young‟s modulus of elasticity of wire material using searle‟s apparatus.
3. I–V Characteristics of Zener Diode (determination of knee voltage, Zener voltage and
forward resistance)
4. I–V Characteristics of P-N junction Diode (determination of cut off voltage and forward
and reverse resistance).
5. Photo Diode Characteristics (Study of I–V characteristics in reverse bias and variation of
photocurrent as a function of reverse voltage and intensity) (Solar Cell).
6. Diffraction (Measurement of wavelength of laser source using diffraction grating).
7. Torsional pendulum (Determination of M.I. of wire and Rigidity modulus).
8. Uniform Bending Experiment (Determination of Young‟s modulus of material bar).
9. Newton‟s Rings, (Determination of radius of curvature of plan convex lens).
10. To study the diffraction pattern formed by diffraction grating and to determine the
wavelength of a laser beam.
11. To study the number of lines in a transmission grating by using Diode laser.
28
TECHNOLOGY
12. To Determine the Angular Divergence of a Laser Beam and Particle size with the help of
laser.
13. To determine the wave lengths of main spectral lines of mercury lamp with the help of
plane transmission grating
14. To Determine angle of prism and angle of minimum deviation
15. To determine the refractive indices µ0 and µe of quartz for the ordinary and extraordinary
rays using spectrometer and sodium light.
16. To determine the dispersive power of a plane transmission grating and speed of light in
glass.
17. Calibration of the given voltmeter using potentiometer and Calibration of the given
Ammeter using potentiometer.
18. Determine characteristics of fiber optics i.e. NA, attenuation loss etc.
Reference Books:
1. C.L. Arora, Practical physics, S. Chand Publication
2. B.L. Worsnop and H. T. Flint, Advanced Practical Physics, Asia Publishing House.
3. Thiruvadigal .J. D, Ponnusamy et al, Physics for Technologists vibrant publications.
29
TECHNOLOGY
FIRST SEMESTER
Computer Fundamentals and Programming in C Lab
Computer Fundamentals and Programming L T P C

Course Code:
in C Lab 0 0 4 2
BTF108
COURSE OBJECTIVES
 Apply the programming skills using C programming language.
 Analyse the different types of problems during implementation.
COURSE OUTCOMES
 Outline the importance of computer programming.
 Design and develop programs in C language to solve various real-world problems.
List of Experiments (Expandable)
1. DOS Internal and External Commands.

2. Basic Flowchart and Pseudo Code.
3. Programs in C using mathematical operators.
4. Programs in C Using if-else, nested if else, switch case.
5. Program in C using while, do while and for loops.
6. Program in C using user defined functions.
7. Program in C which explains call by value and call by reference.
8. Program in C using array and pointers.
9. Program in C using storage classes.
10. Program in C using structure and Union.
11. Program in C used for string manipulation.
12. Program in C using Macros & preprocess directives.
13. Program in C for file input and output.
30
TECHNOLOGY
Text Books:
1. E Balagurusami, “Programming in ANSI C” Tata McGraw-Hill Education, Sixth Edition.

2. B.A. Forouzan and R.F. Gilberg, “Computer science, A structured programming approach
using C”, Thomson, Third edition.
3. Yashvant Kanetker, “Let Us C”, BPB publications, Tenth Edition.
Reference Books:
1. B.W. Kernighan, Dennis M.Ritchie,“The C Programming Language”, PHI/Pearson Education.

2. J.A. Jones & K. Harrow,“C Programming with problem solving”, Dreamtech Press.
31
TECHNOLOGY
FIRST SEMESTER
Engineering Graphics Lab

L T P C
Course Code: Engineering Graphics Lab
0 0 4 2
BTF109
COURSE OBJECTIVES
 To develop Basic Graphic skills.
 To develop skills in Preparation of Basic Drawings.
 To develop skills in Reading and Interpretation of Engineering Drawings
COURSE OUTCOMES
 Make use of the drawing instruments effectively and able to dimension the given figures.
 Value the usage of engineering curves in tracing the paths of simple machine
components.
 Adapt to the concepts of projection and visualization skills
 Design the solutions of new problems.
List of Practical
1. Draw sheet for the Scales: Plain and Diagonal Scale Engineering, scale of cords.
2. Draw sheet for Engineering Curves: Conic section, Ellipse, parabola, hyperbola,
cycloidal Curves: Cycloid, Epicycloids, Hypocycloid, and Involutes.
3. Draw sheet for the Projection planes of four quadrants, first and third angle
projection, reference line symbols for methods of projection.
4. Draw sheet for the Orthographic projection.
5. Draw sheet for Projection of Points: point situated in first, second, third & fourth
quadrant.
6. Draw sheet for Projection of lines: line parallel to one or both the planes, line
contained by one or both the planes, line perpendicular to one of the planes, line
inclined to one plane and parallel to other. Line inclined to both the planes.
7. Draw sheet for Projections of planes: projection of planes, projection of planes

perpendicular to both the reference planes, perpendicular to one plane and parallel to
the other plane,perpendicular to one plane and inclined to the other plane.
32
TECHNOLOGY
8. Draw sheet for Projections of Solids: Projections of solids in simple position,
projections of solids with axes inclined to one of the reference planes and parallel to
the other, projections of solids with axes inclined to both H.P. and the V.P., section
planes.
9. Draw sheet for Development of Surfaces: Draw of lateral surfaces of right solids,
cube, prisms, cylinders, pyramids & cone.
10. Draw Isometric Projection: Isometric axes, lines & planes, Isometric scale, Isometric
projection and Isometric view of simple objects.
11. Draw in Computer Aided Drawing: Creation of two dimensional drawing.
Text Book:
1. N.D. Bhatt Laxmi Publication 2013 Edition.

2. Dr. C.M. Agarwal TMH 2012-13 Publication.
3. Venugopal –Engineering Drawing Latest version. (With AutoCAD)
4. Jeyopoovan. T, Engineering Drawing, Vikas Publication.
Reference Book:
1. John K.C, Engineering Graphics for Degree , PHI.

2. Agrawal&Agrawal, Engineering Graphics, TMH.
3. DhawanRK ,Engineering Drawing,S Chand & Co.
33
TECHNOLOGY
SECOND SEMESTER
Engineering Mathematics-II
Engineering Mathematics-II L T P C
Course Code:
3 1 0 4
BTF201
COURSE OBJECTIVES
 To provide students the basic knowledge of Fourier series and Transform.
 To provide knowledge and functionality of Vector Calculus.
COURSE OUTCOMES
 Interpret the problem that can be solved using transformation method.

 Apply concept of Partial differential equation in complex problems.
 Evaluate the vector problems.
UNIT I
FOURIER SERIES&FOURIER TRANSFORM
Fourier series for Continuous and Discontinuous function, Fourier series for Even and Odd
Function, Half range Fourier sine and cosine series. Statement of Fourier integral theorem
(without proof) - Fourier transform pairs -Fourier Sine and Cosine transforms, Application of the
transform.
UNIT II
LAPLACE TRANSFORMS (12hours)
Transforms of simple functions – Basic operational properties – Transforms of derivatives and
integrals – Initial and final value theorems – Inverse transforms – Convolution theorem –
periodic functions – Applications of Laplace transforms for solving linear ordinary differential
equations up to second order with constant coefficients only, applications of Laplace transform
UNIT III
SECOND ORDER LINEAR DIFFERENTIAL EQUATIONS WITH VARIABLE
COEFFICIENTS
Second order differential equations with variable coefficients, Method of variation of parameter
Solution of differential equations by series method and its applications.
34
TECHNOLOGY
UNIT IV
PARTIAL DIFFERENTIAL EQUATIONS:
Partial Differential Equations, order, classification, Partial differential equations with constant
coefficients, Methods of forming PDE, Lagrange‟s linear equation, Method of multipliers,
Solution of equation by direct integration. Application of P.D.E. Non-Linear Partial Differential
Equations of First Order: Methods for solving the standard forms (Clairaut‟s form), Charpits
method, Linear partial differential equation with constant coefficients. Application of Non-linear
P.D.E
UNIT IV
VECTOR CALCULUS (12 hours)
Gradient, divergence, curl ,Solenoidal and irrotational fields ,Vector identities (without proof) –
Directional derivatives, Line, surface and volume integrals,Green‟s, Gauss divergence and
Stoke‟s theorems (without proof) ,applications of vector calculus.
Text Book:
1. B.S Grewal, “Higher Engineering Mathematics”, Khanna Publications, 42th Edition, 2012
References:
1. H.K. Dass, “Advanced Engineering Mathematics”,S.Chand& Company, 12thedition.

2. Dr. D.C.Agarwal, “Engineering Mathematics-2”, Shree SaiPrakashan9thedition.
3. Kreyszig.E, “Advanced Engineering Mathematics”, 10th edition, John Wiley & Sons.
Singapore, 2012.
35
TECHNOLOGY
SECOND SEMESTER
Engineering Chemistry
L T P C
Course Code: Engineerning Chemistry
3 0 0 3
BTF202
COURSE OBJECTIVES
 To enable the students to acquire knowledge in the principles of chemistry for
engineering applications.
COURSE OUTCOMES
 Define and Classify various water treatment methods for domestic and industrial
applications.
 Identify the properties and applications of important polymers and FRPs.
 Apply the knowledge of lubricants for protection of different metals from Corrosion
Unit I
Water Treatment
Water quality parameters: Physical, Chemical & Biological significance -Hardness of water -
disadvantages of using hard water in boilers: Scale, sludge formation - disadvantages – prevention -
treatment: Internal conditioning - phosphate, carbon and carbonate conditioning methods - External:
Zeolite, ion exchange methods - desalination – reverse osmosis and domestic water treatment.
Unit II
Polymers and Reinforced Plastics
Polymers – Types – Polymerization – Addition and condensation polymerization –mechanism –
Plastics – classification- preparation, properties and uses of PVC, Teflon, Polyurethane, Nylon 6:6,
PET, Bakelite, and Epoxy resin – Compounding of Plastics- Compression moulding – Injection
moulding – Composites – definition – types of Polymer matrix composites – FRP - Carbon and
Glass- applications.
Unit III
Lubricants and Refractories
Lubricants: Classification –solid, semi solid, liquid, emulsion- properties – selection of lubricants for
different purposes, Refractories – Classification-( acidic, basic and neutral) – Properties
(refractoriness, refractoriness under load, porosity, dimensional stability, thermal spalling) –
manufacture of alumina, magnesite and Zirconia bricks – Abrasives – Natural abrasives – (Quartz,
corundum, emery, garnet, diamond) – Artificial abrasives (silicon carbide, boron carbide)
36
TECHNOLOGY
Unit IV
Corrosion and Its Control
Corrosion: Basic concepts - mechanism of chemical, electrochemical corrosion - Types of

Electrochemical corrosion - galvanic corrosion - differential aeration corrosion - pitting
corrosion - stress corrosion – factors influencing corrosion. Corrosion control: Cathodic
protection - sacrificial anodic method – corrosion inhibitors. Protective coatings: surface
preparation for metallic coatings – electro plating (copper plating) and electroless plating (Nickel
plating) – Galvanizing and Tinning.
Unit V
Instrumental Methods of Analysis
Basic principles, instrumentation and applications of colorimetry, UV – visible spectroscopy,

infrared spectroscopy, atomic absorption spectroscopy and flame photometry.
Text Books:
1. Dara .S.S, “A Text book of Engineering Chemistry”, 10th Edition, S.Chand & Company Ltd., New
Delhi, 2003.
2. Jain.P.C and Monika Jain, "Engineering Chemistry", Danpat Rai publishing company (P) Ltd,
New Delhi, 2010
Reference Books:
1. J.C. Kuriacose and J. Rajaram “ Chemistry in Engineering and Technology” Tata McGraw
Hills (P) Ltd. New Delhi
37
TECHNOLOGY
SECOND SEMESTER
Basic Electrical and Electronics Engineering

L T P C
Course Code: Basic Electrical and Electronics Engineering
3 0 0 3
BTF203
COURSE OBJECTIVES
 To provide the knowledge of various fundamental components and laws used in electrical
circuits
 To provide DC & AC circuit concepts in solving engineering problems.
 To explain the working principle, construction, applications of DC machines, AC
machines & measuring instruments so that students can utilize in the field of engineering
problems
 To emphasize the significance of semiconductors in the field of engineering and
technology.
COURSE OUTCOMES
 Interpret the behavior of electronics devices and basic concepts of digital electronics.
 Make use of transformer and different electrical machines in various electrical
applications.
 Formulate and solve different DC and AC circuits.
UNIT I
DC circuit analysis:
Voltage and current sources, dependent and independent sources, Ohm‟s law, Kirchhoff‟s
laws and their applications to circuits, source conversion, DC circuits analysis using mesh &
nodal method, Thevenin‟s & superposition theorem, star-delta transformation.
UNIT II
Single phase and Three phase AC circuit analysis:

Generation of alternating voltage and currents, RMS and Average value, form factor , crest
factor, AC through resistance, inductance and capacitance, R-L , R-C and R-L-C series and
parallel circuits, phasor diagrams, power and power factor, series and parallel resonance.
Active, reactive and apparent power, Three phase systems – Overview and advantages,
Meaning of Phase sequence, balanced and unbalanced supply and loads. Relationship
between line and phase values.
38
TECHNOLOGY
UNIT III
Transformer:
Review of laws of electromagnetism, mmf, flux, and their relation, analysis of magnetic
circuits. Single-phase transformer, Principle of operation and construction of single phase
transformers (core and shell types), EMF equation, voltage, current and impedance
transformation, equivalent circuits, phasor diagram, voltage regulation, losses and efficiency,
Open circuit and Short circuit test.
UNIT IV
Rotating Electric Machines:

Construction, working principles, EMF equations, Characteristics of DC machines
(generators & motors), 3-phase synchronous and induction motor, single phase Induction
motor. Losses occurring in different types of electrical machines and their application.
UNIT V
Electronic Components and Circuits:

Introduction to Semiconductors, Diodes, V-I characteristics, application as a rectifier.
Transistors -Bipolar junction transistors (BJT) and their working, introduction to CC, CB &
CE transistor configurations characteristics, different configurations and modes of operation
of BJT, DC biasing of BJT
Digital Electronics:
Number systems used in digital electronics, decimal, binary, octal, hexadecimal, their
complements, operation and conversion, Introduction and study of logic gates AND, OR,
NOT, NOR, NAND, EX-NOR, EX-OR and their representation, truth table, De-Morgan‟s
Theorem half and full adder circuits.
Text Books:
1. J. Nagrath & D.P. Kothari,Basic Electrical and Electronics Engineering, III Edition
TMH.
2. S.K. Bhattacharya, Basic Electrical and Electronics Engineering, Pearson,II Edition
3. T. K. Nagsarkar, Basic Electrical and electronics engineering, Oxford University .
Reference Books:
1. S.N.Singh , Basic Electrical Engineering, P.H.I.,2013

2. Vincent Del Toro, Electrical Engineering Fundamentals, PHI Learning, II Edition
3. S.Ghosh, Fundamentals of Electrical and Electronics Engineering, PHI, II Edition.
4. J.S. Katre, Basic Electronics Engineering, Max Pub. Pune.
39
TECHNOLOGY
SECOND SEMESTER
Basic Mechanical Engineering

L T P C
Course Code: Basic Mechanical Engineering
3 0 0 3
BTF204
COURSE OBJECTIVES
 To familiarize with various laws of thermodynamics and applications to thermodynamic system
 To know the types and behavior of material at various in compression and tension
 To study the different types of fluid properties and their determination
COURSE OUTCOMES
 Apply the concepts of thermodynamics systems.
 Utilize the knowledge of compression and tension test results to understand stress, strain, young‟s
modulus etc.
 Examine the fluids under static and dynamic states
UNIT I
Law of Thermodynamics
Thermodynamic system, properties, state, thermodynamics equilibrium reversible and
irreversible process, zeroth law, first law and second law of thermodynamics, thermodynamic
processes for flow and non flow process.
Boilers: Classification and working of boilers, mountings and accessories of boilers natural and
artificial draught; steam properties, use of steam tables, working principle of steam Engine.
UNIT II
IC Engine
Carnot cycle, working of two stroke & four stroke petrol & diesel engine, Otto and Diesel cycles,
P-v & T-s diagrams
Refrigeration
Methods of refrigeration, reverse carnot cycle, working principle of simple vapour compression
refrigeration system, coefficient of performance (COP).
UNIT III
Engineering Materials
Classification of engineering materials, composition of cast iron and carbon steels, alloy steel
and their applications. mechanical properties of materials, hooks law and modulus of elasticity,
tensile test- stress-strain diagram of ductile and brittle materials.
40
TECHNOLOGY
UNIT IV
Mechanical Measurement
Temperature, pressure, velocity, flow, strain & torque measurement, concept of measurement
error & uncertainty analysis, micrometer, dial gauge, slip gauge, sine-bar and combination set.
Machine Tools
Introduction to lathe, milling, shaper, drilling machines and their various operations.
UNIT V
Fluids
Fluid properties: pressure, density and viscosity, specific weight, Newton‟s law of viscosity,
types of fluids, Pascal‟s law, hydrostatic law, Bernoulli‟s equation for incompressible fluids,
introduction to laminar and turbulent flow, working principle of hydraulic machines, pumps,
turbines, torque converter .
Text Books:
1. Basic Mechanical Engineering, Agrawal C M, Wiley Publication, 2012

2. Engineering Thermodynamics Nag P.K, TMH, 2014
3. Instrumentation and Measurements, Nakra & Chaudhary, TMH, 2011
Reference Books:
1. Engineering Thermodynamics: Cengel and Boles, TMH, 2012

2. Internal Combustion Engines Sharma & Mathur TMH, 2012
3. Fluid Mechanics & Machinery, R.K, Bansal, S. Chand Publication, 2016
41
TECHNOLOGY
SECOND SEMESTER
Data Structures
L T P C
Course Code: Data Structures
3 0 0 3
BTF205
COURSE OBJECTIVES
 Analyze the arrangements of data in memory.
 Understand the design and implementation of arrays, stacks, queues, and linked lists.
 Apply the techniques of sorting and searching.
COURSE OUTCOMES
 Select appropriate data structures as per the specified problem definition.
 Implement operations like searching, insertion, and deletion, traversing mechanism etc.
on various data structures.
 Determine and analyze the complexity of the given algorithms.
UNIT I
Introduction: Data structure, classification of data structure, operations on data structure,

Development of Algorithms: Notations and analysis, recursion, Arrays: Definition, Types of
arrays, operations on an array, and applications of arrays, sparse matrices.
UNIT II
Linked Lists: Linear, circular, double, and priority link lists, operations on polynomials, dynamic
storage management: garbage collection and compaction.
UNIT III
Stacks: Stacks as ADT, Different implementation of the stack, multiple stacks. Application of
Stack: Conversion of infix to postfix notation using stack, evaluation of postfix expression,
Recursion. Queues: Queues as ADT, Different implementation of queue, Circular queue,
Concept of Dequeue and Priority Queue, Queue simulation, Application of queues.
UNIT IV
Linear search, binary search; Sorting Techniques: selection, bubble, insertion, merge, heap,
quick, and radix sort, Hashing: Hash Functions, separate chaining, open addressing, rehashing.
42
TECHNOLOGY
UNIT V
Tree: General tree, binary Tree, rooted tree, binary search tree, tree traversal, Expression
manipulation, height-balanced trees, red-black trees.
Graph: Definition, walks, paths, trails, connected graphs, regular and bipartite graphs, cycles and
circuits, Spanning trees, Hamiltonian and Eulerian graphs, planar graphs, Graph traversal
techniques, shortest path problems
Text Books:
1. M. Tenenbaumand Augestien, “Data Structures using C”, Pearson Education, 3 rd Edition.

2. Sahni Horowitz, Fundamentals of Data Structures in C++, Universities Press
3. Seymour Lipschutz, “Data Structures With C”, Schaum‟s, Outline Series, 1st Edition.
Reference Books:
1. Yashwant Kanetkar, “Data Structure Through C”, BPB Publications, 2nd Edition.
2. J. P. Tremblay and P. G. Sorenson, "An Introduction to Data Structures with applications",
Tata McGraw Hill, 2nd Edition.
43
TECHNOLOGY
SECOND SEMESTER
Skill for Engineers–I

L T P C
Course Code: Skill for Engineers–I
2 0 0 2
BTF206
COURSE OBJECTIVES
 To provide a comprehensive knowledge in English language communication and soft
skills
COURSE OUTCOMES
 Assess the requirements of a successful career in their preferred industry/profession in a
domestic/international setting
 Identify their development requirements [short, medium and long term]
 Perceive the nuances of writing emails, speaking publicly and develop reflective skills
and record the subsequent observations
Unit I
Developing as an Independent Learner: Self awareness, identifying strengths and weakness,
building self confidence/self esteem , Goal setting: thinking about long term and short term
plans; making a development plan for self, Identifying your learning style: what kind of a
learner are you; what learning style suits you; forming an individual learning style
Unit II
Social Skills: Greetings, introducing and talking about yourself and your University, Small talk
Unit III
Email Writing:Basics of writing an email, Structure, Approaches (direct or indirect), Register
(adapting emails to the person being addressed), Email etiquette
Unit IV
Reading and Interpreting work related texts: Skimming, Scanning, Reading between the lines,
Reading critically, Analyzing
Unit V
Presentations and Public speaking: Basics of presentations, Making simple presentations, Basics
of public speaking, Expressing yourself clearly and suitably
Unit VI
Reflecting about progress, Documenting daily work and progress
44
TECHNOLOGY
Reference Books:
1. English for Technical Communication, Cambridge University Press
2. A Quick Guide to Writing Better Emails, Heather Wright, Create space Independent Pub
3. How to Develop Self-Confidence and Influence People by Public Speaking, Dale Carnegie,
Fingerprint Publishing
4. Developing Reading Skills: A Practical Guide to Reading Comprehension Exercises,
Frangoise Grellet, Cambridge University Press
5. Emotional Intelligence, Daniel Coleman, Bantam Books
45
TECHNOLOGY
SECOND SEMESTER
Engineering Chemistry Lab
L T P C
Course Code: Engineerning Chemistry
0 0 2 1
BTF207
COURSE OBJECTIVES
 To apply the concepts of chemistry and develop analytical skills for applications in
engineering.
COURSE OUTCOMES
Students shall able to

 Demostrate the concepts involved in the analyses.
 Apply innovative methods to produce soft water for industrial use and
potable water at cheaper cost.
List of Experiments
1. Estimation of total, permanent and temporary hardness by EDTA method
2. Conductometric titration - determination of strength of an acid
3. pH titration (acid and base)
4. Estimation of alkalinity of water sample
5. Estimation of acidity of water sample
6. Determination of dissolved oxygen in a water sample by Digital DO meter
7. Determination of Na / K in water sample by Flame photometry (Demonstration)
46
TECHNOLOGY
SECOND SEMESTER
Basic Electrical and Electronics Engineering Laboratory
Basic Electrical and Electronics Engineering L T P C

Course Code:
Laboratory 0 0 2 1
BTF208
COURSE OBJECTIVES
 To demonstrate measurement of electrical quantities like current, voltage and power in
electrical circuit.
 To provide working knowledge and importance of transformer.
 To provide understanding and behavior of basic electronics devices.
COURSE OUTCOMES
 Analyze the behavior of different electrical and electronics circuits.
 Measure different electrical quantities using measuring instruments and able to
demonstrate different circuit laws.
 Discuss the need of transformer in different electrical applications.
LIST OF EXPERIMENTS
1. Study of different types of measuring instruments.

2. To verify Kirchhoff‟s Current Law (KCL).
3. To verify Kirchhoff‟s Voltage Law (KVL).
4. To calculate the active & reactive power of single phase inductive Load.
5. To perform load test on a Single phase transformer for the following..
(i) To find voltage regulation and efficiency
(ii) To plot a graph between voltage regulation & current, efficiency & current.
6. To measure the voltage ratio of primary & secondary windings of a single phase
transformer at different tapping.
7. To perform polarity test on a single phase transformer.
8. To determine the no load losses parameters by open circuit test on single phase
transformer.
47
TECHNOLOGY
9. To determine the full load parameter losses by short circuit test on single phase
transformer.
10. Study of different logic gates with the help of universal gate - NAND gate.
11. Study of characteristics of Bipolar Junction Transistor.
Text Books:
1. I.J. Nagrath & D.P. Kothari,Basic Electrical and Electronics Engineering, III Edition
TMH.
2. S.K. Bhattacharya, Basic Electrical and Electronics Engineering, Pearson,II Edition
3. T. K. Nagsarkar, Basic Electrical and electronics engineering, Oxford University
Reference Books:
1. Basic electrical and electronics engineering Laboratory Manual.
48
TECHNOLOGY
SECOND SEMESTER
Basic Mechanical Engineering Lab

L T P C
Course Code: Basic Mechanical Engineering Lab
0 0 2 1
BTF209
COURSE OBJECTIVES
 To give an overview of Boilers, their classification, applications, operation and processes
 To give an overview of Internal Combustion Engines, their classification, applications,
operation and processes
 To familiarize with measurement of pressure ,temperature, discharge devices.
COURSE OUTCOMES
Student shall able to
 Classify different types of Boiler working operation
 Interpret various types of I.C. Engines and Cycles of operation
 Evaluate Mechanical properties of Material
 Discuss working principles in the measurement of pressure, temperature and flow rate
1. To study the Lancashire Boiler.

2. To study the Babcock Wilcox Boiler.
3. To study the locomotive Boiler and its Accessories and Mountings.
4. To Study two stroke and four stroke petrol engine.
5. To Study two stroke and four stroke diesel engine
6. To study the Vapour compression Refrigeration System.
7. To prove Bernoulli‟s Theorem experimentally.
8. To Study Measurement of Pressure using Bourdon Tube Pressure Gauge.
9. To Study Measurement of Temperature using Thermocouple.
10. To study the Universal Testing Machine and to perform tensile test on mild steel.
11. To study different types of Lathe and Drilling Machine.
Text Books:
1. Basic Mechanical Engineering, Agrawal C M, Wiley Publication, 2012

2. Engineering Thermodynamics Lab Manual.
Reference Books:
1. Engineering Thermodynamics: Cengel and Boles, TMH, 2012

2. Fluid Mechanics & Machinery, R.K, Bansal, S. Chand Publication, 2016
49
TECHNOLOGY
SECOND SEMESTER
Data Structures Lab

L T P C
Course Code: Data Structures Lab
0 0 4 2
BTF210
COURSE OBJECTIVES
 Understand the implementation of different types of algorithms like array, linked list,
stack, queue, etc.
 Create and implementation of different types of searching and sorting algorithms.
COURSE OUTCOMES
 Create and apply various data structure algorithms.
 Make use of searching and sorting on real world problems.
List of Experiments (expandable)

1. Write a program to implement traversal, insertion and deletion in an array.
2. Write a program to create a linked list and to traverse it.
3. Write a program to insert a node into a singly linked list.
4. Write a program to delete a node from a singly linked list.
5. Write a program to perform push and pop operation in a stack using an array.
6. Write a program to perform insertion and deletion operation in a queue using an array.
7. Write a program to implement stack using a linked list.
8. Write a program to implement queue using a linked list.
9. Write a program to implement linear search.
10. Write a program to implement binary search.
11. Write a program to sort N numbers using insertion sort.
12. Write a program to sort N numbers using selection sort.
13. Write a program to sort N numbers using bubble sort.
14. Write a program to sort N numbers using quick sort.
15. Write a program to create a binary search tree and traverse it using inorder, preorder and
postorder.
50
TECHNOLOGY
Text Books:
1. M. Tenenbaumand Augestien, “Data Structures using C”, Pearson Education, 3rd Edition.
2. Seymour Lipschutz, “Data Structures with C”, Schaum‟s, Outline Series, 1st Edition.
Reference Books:
1. Yashwant Kanetkar, “Data Structure Through C”, BPB Publications, 2nd Edition.
2. J. P. Tremblay and P. G. Sorenson, "An Introduction to Data Structures with applications",
Tata McGraw Hill, 2nd Edition.
51
TECHNOLOGY
SECOND SEMESTER
Workshop Practice
L T P C
Course Code: Workshop Practice
0 0 4 2
BTF211
COURSE OBJECTIVES
 To provide the students hands on experience on different trades ofEngineering like
fitting, carpentry, smithy, welding and sheet metal.
COURSE OUTCOMES
Student shall able to

 Make use of basic tools and equipment used in fitting, carpentry, sheet metal, welding
and smithy.
 Analyze the production of simple wooden models.
Unit I : Machine Shop
Tools and equipment – practice. Lathe machine and radial drill machine operation i.e.cutting
with machine,different type of machine operations like turning,plain turning, shoulder turning,
taper turning.
UnitII :Carpentry
Tools and Equipment- Planning practice.Making Half Lap joint,Dovetail, Mortise &Tenon
joints.Mini project - model of a single door window frame.
Unit III :Fitting
Tools & Equipment – Practice in filing. Making V - Joints, Square, Dovetail joints and Key
making - plumbing.Mini project – Assembly of simple I.C. engines.
UnitIV : Welding
Tools and equipment -Arc welding of butt joint, Lap joint, Tee fillet. Demonstration of gas
welding, TIG & MIG welding.
UnitV :Smithy & Foundry

Tools and Equipment –Making simple parts like hexagonal headed bolt, chisel. Foundry,foundry
material,type of pattern,pattern making process, type of sands.
52
TECHNOLOGY
Text Books:
1. Gopal .T.V, Kumar .T, and Murali .G, “A first course on workshop practice –
Theory, Practice and Work Book”, Suma Publications, Chennai, 2005.
Reference Books:
1. Kannaiah .P, and Narayanan .K. C., “Manual on Workshop Practice,”Scitech

Publications, Chennai, 1999.
2. Venkatachalapathy .V.S, “First year Engineering Workshop Practice,” Ramalinga
Publications, Madurai, 1999.
53
TECHNOLOGY
THIRD SEMESTER
Engineering Mathematics-III
L T P C
Course Code: Engineering Mathematics-III 3 1 0 4
BTF301
COURSE OBJECTIVES
 To learn about existence and uniqueness criteria for numerical methods
 To solve systems of linear equations by direct methods
 To use iterative methods to solve systems of non-linear equations
COURSE OUTCOMES

 Summarize different types of numerical methods.
 Build skill set in implementing numerical algorithms to solve mathematical problems.
UNIT I
FINITE DIFFERENCES
Finite Differences, forward differences, backward differences, central differences, Difference of
a polynomial, Properties of Operator, Types of Operators, Relations between the Operators,
Various types of errors, Application of Finite difference.
UNIT II
INTERPOLATION
Bisection method, Regular-falsi method, Newton-Raphson method, Interpolation and
Extrapolation, Inverse Interpolation, Newton's forward and backward interpolation, Numerical
Differentiation and Integration - Simpson's one-third rule, Simpson's three-eighth rule,
applications of the various methods.
UNIT III
NUMERICAL SOLUTION OF EQUATIONS
Solution of Algebraic and Transcendental equations (Regular False,Newton-
Raphson,Iterative,Graffe‟s root squaring methods).Solution of Simultaneous algebraic equations,
Solution of Ordinary Differential Equations, Solution of Partial Differential Equations.
54
TECHNOLOGY
UNIT IV
FUZZY SETS
Introduction to Fuzzy sets, Equality of two fuzzy sets, Complement of a fuzzy set, union of two
fuzzy sets, Intersection of two fuzzy sets, Truth value, Applications.
UNIT V
FUNCTION OF COMPLEX VARIABLE
Analytic Function, Harmonic Conjugate, Milne-Thomson‟s method, Conformal mappings
,Introduction to Bilinear transformation, Line integral, Cauchy‟s integral formulae and its
applications, Singularities – Poles and Residues,Cauchy‟s residue theorem,Contour integration.
Text Book
1. P. Kandasamy and K. Thilagavathy, “Numerical Methods”, S. Chand Publication, 2007.

2. Grewal .B.S, “Numerical Methods in engineering and science”, Khanna Publishers, 42nd
edition, 2012.
3. Sastry .S.S, “Introductory Methods of Numerical Analysis”, 4th edition, 2005.
4. Dr.D.C.Agarwal, “Engineering Mathematics-2”, Shree SaiPrakashan 9th edition.
5. Dr.D.C.Agarwal, “Engineering Mathematics-3”, Shree SaiPrakashan 9th edition.
Reference Books
1. Dr. M.K. Venkataraman, “Numerical Methods in Science and Engineering”, National
Publishing Co., 2005.
2. Balagurusamy .E, “Computer Oriented Statistical and Numerical Methods” Tata McGraw
Hill., 2000.
3. Jain .M.K, SRK Iyengar and Jain .R.L, “Numerical Methods for Scientific and
Engineering Computation”, Wiley Eastern Ltd., 4th edition, 2003.
4. H.K.Dass, “Advanced Engineering Mathematics”, S.Chand& Company 12 th edition.
55
TECHNOLOGY
THIRD SEMESTER
Object Oriented Programming

L T P C
Course Code: Object Oriented Programming
3 1 0 4
BTAIC302
COURSE OBJECTIVES
 To introduce object-oriented concepts to solve modular programming skills.
 To enhance the programming skills of the students by giving practical assignments
 To demonstrate to the use of object-oriented concepts in programming
COURSE OUTCOMES
 Illustrate basic concepts of object oriented programming to model real life problems.
 Identify the purpose and types of relationship exist between the objects.
 Develop programs for performing different file related operations and handling
exceptions.
UNIT I
Concepts of OOP: Introduction OOP, procedural vs. object oriented programming, principles of
OOP, benefits and applications of OOP. C++ Basics: Overview, Program structure, namespaces,
identifiers, variables, constants, enum, operators, typecasting, control structures, scope and
storage class, arrays and pointers.
UNIT II
C++ Functions: Simple functions call and return, Parameter passing, overloading of functions,
default arguments, type conversion.
Objects and Classes: Basics of object and class in C++, Private and public members, static data
and function members, constructors and their types, destructors., inline functions, macro vs.
inline functions, friend functions, virtual functions; operator overloading,.
UNIT III
Inheritance: Concept of Inheritance, Types of inheritance: Single, Multiple, Multilevel,

Hierarchical, Hybrid, protected members, Polymorphism: Overloading, overriding, virtual base
class, this pointer, virtual and pure virtual functions.
56
TECHNOLOGY
UNIT IV
Templates: Function templates, class templates, Exceptions: Introduction to exception, try-catch-

throw, multiple catch, catch all, re-throwing exception, STL: Overview and use of Standard
Template Library.
UNIT V
I/O and File Management: Streams and formatted I/O – I/O manipulators, file handling, random
access, File management functions, File modes, object serialization.
Text Books:
1. E Balagurusamy, “Object oriented Programming with C++”, Tata McGraw Hill, 3 rd Edition,
2006,
2. Bhushan Trivedi, “Programming with ANSI C++”, Oxford Press, 2nd Edition, 2012.
3. HM Deitel and PJ Deitel “C++ How to Program”, Prentice Hall, 7th Edition, 2010.
Reference Books:
1. David Parsons, “Object oriented programming with C++” BPB publication, 2nd Edition,
2010.
2. Robert Lafore, “Object oriented programming in C++”, Galgotia publication, 4th Edition,
2002
3. Ira Pohl, “Object–Oriented Programming Using C++”, Pearson Education, 2ndb Edition,
2003
4. Kamthane,” Object Oriented Programming with ANSI and Turbo C++”, Pearson
Education, 2003
57
TECHNOLOGY
THIRD SEMESTER
Discrete Mathematics
L T P C
Course Code: Discrete Mathematics
3 1 0 4
BTAIC303
COURSE OBJECTIVES
 Introduce the design, analysis and implementation of different types of problem solving
algorithms.
 Implementation of dynamic programming and greedy concept for problem solving.
COURSE OUTCOMES
 Ilustrate sets with operations, and identify their structure.
 Identify structures of algebraic nature, and discover, prove and use properties about them.
 Apply logical notation to define and reason mathematically about the fundamental data
types and structures (such as numbers, sets) used in computer algorithms and systems.
UNIT-1
Set Theory , Set operations, properties , power set , methods of proof , relations, graph and
matrix of a relation , partial and total orders, well ordering , equivalence relations, classes and
properties , functions, mapping.
UNIT-2
Introduction to Logic. Propositional Logic, Truth tables, Deduction, Resolution, Predicates and
Quantifiers, Mathematical Proofs. Infinite sets, well-ordering. Countable and Uncountable sets,
Cantor's diagonalization. Mathematical Induction - weak and strong induction.
UNIT-3
Counting, Sum and product rule, Principle of Inclusion Exclusion, Pigeon Hole Principle,
Counting by Bijections. Double Counting, Linear Recurrence relations - methods of solutions.
Generating Functions. Permutations and counting.
UNIT-4
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
58
TECHNOLOGY
UNIT-5
Lattices: Definitions and examples, Lattices as partially ordered sets, some properties of lattices,
lattices as algebraic systems, sub-lattices, direct product and homomorphism.
Graph Theory: Representation of a graph, Trees, Cycles, Paths and connectedness, Graph
Isomorphism, Operations on graphs, Vertex and edge cuts
Text Books:
1. J. P. Tramblay and R Manohar, “Discrete Mathematical Structure with Application to

Computer Science”,Tata-McGraw-Hill, ,2010
2. Kenneth Rosen, “Discrete Mathematics and Its Applications”, TMH, 7th Edition, 2017.
Reference Books:
1. K. D. Joshi, "Foundations of discrete mathematics ", John Wiley & Sons. 2007
2. Shanker G. Rao, “Discrete Mathematical Structures”,New age International Publisher, 2nd

Edition 2009,
59
TECHNOLOGY
THIRD SEMESTER
Analysis and Design of Algorithms
Analysis and Design of Algorithms
BTAIC304 3 1 0 4
COURSE OBJECTIVES
 Understand the importance of algorithm and its complexity.
 Apply the mathematics for the analysis of algorithms.
 Analyse the dynamic programming and greedy concept for problem solving.
COURSE OUTCOMES
 Explain different algorithm and analyze its performance.
 Choose appropriate algorithm for solving problems.
UNIT I
Algorithm - Fundamental of Algorithms, Design Techniques, Analysis of an algorithm,

Asymptotic Notations, Mathematical Analysis- Induction Method, Recurrence Relation –
Substitution Method, Recursion Method and Master‟s Theorem.
UNIT II
Introduction of divide and conquer methods, Analysis of Binary Search, Quick sort and Merge
Sort, Strassen's matrix multiplication, Greedy method - Knapsack problem, Job sequencing with
deadlines, Minimum spanning trees.
UNIT III
Introduction: Dynamic Programming, 0/1 Knapsack Problem, Multistage graphs, All pair‟s
shortest paths, Optimal binary search trees and Travelling salesman problem.
UNIT IV
Backtracking concept, Backtracking based problems: NXN Queen's Problem, Sum of Subsets,
Graph Coloring, Hamiltonian's Circuit, Branch & Bound: principle, Travelling Salesman
Problem.
60
TECHNOLOGY
UNIT V
Introduction: Randomized algorithms, Matrix Chain Multiplication, Randomized Quick Sort, NP

Problems: NP-Hard and NP-complete problems, Turing machines, NP-Hard graph problems.
Text Books:
1. Horowitz & Sahani, “Analysis & Design of Algorithm”, Galgotia Publication.

2. T. H. Cormen, C. E. Leiserson, R. L. Rivest, "Introduction to Algorithms", The MIT press,
Cambridge, Massachusetts and McGraw Hill.
Reference Books:
1. V. Aho, J. E. Hopcroft and J. D. Ullman, "The Design and Analysis of Computer Algorithms",
Addison Wesley.
61
TECHNOLOGY
THIRD SEMESTER
Environmental Science
L T P C
Course Code: Environmental Science
2 0 0 2
BTF305
COURSE OBJECTIVES
 To learn the fundamentals of Environmental studies
 To analyze complex, unstructured qualitative and quantitative problems, using
appropriate tools
 Understanding obligations of business to society
COURSE OUTCOMES
 Ilustrate the environmental studies need for sustainable development
 Analyze the problems of pollution, loss of forget, solid waste disposal, degradation of
environment, issues like economic productivity and national security, Global warming,
the depletion of ozone layer and loss of biodiversity etc.
UNIT-1
Multidisciplinary nature of environmental studies Definition, scope and importance, need for
public awareness.
UNIT-2
Natural Resources : Renewable and non-renewable resources : Natural resources and associated
problems. a) Forest resources : Use and over-exploitation, deforestation, case studies. Timber
extraction, mining, dams and their effects on forest and tribal people. b) Water resources : Use
and over-utilization of surface and ground water, floods, drought, conflicts over water, dams-
benefits and problems. c) Mineral resouces : Use and exploitation, environmental effects of
extracting and using mineral resources, case studies. d) Food resources : World food problems,
changes caused by agriculture and overgrazing, effects of modern agriculture, fertilizer-pesticide
problems, water logging, salinity, case studies. e) Energy resources : Growing energy needs,
renewable and non renewable energy sources, use of alternate energy sources. Case studies. f)
Land resources : Land as a resource, land degradation, man induced landslides, soil erosion and
desertification. • Role of an individual in conservation of natural resources. • Equitable use of
resources for sustainable lifestyles.
62
TECHNOLOGY
UNIT-3
Ecosystems • Concept of an ecosystem. • Structure and function of an ecosystem. • Producers,

consumers and decomposers. • Energy flow in the ecosystem. • Ecological succession. Food
chains, food webs and ecological pyramids. • Introduction, types, characteristic features,
structure and function of the following ecosystems :- a. Forest ecosystem b. Grassland ecosystem
c. Desert ecosystem d. Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries)
UNIT-4
Biodiversity and its conservation (8 lectures) • Introduction – Definition: genetic, species and
ecosystem diversity. • Biogeographically classification of India • Value of biodiversity :
consumptive use, productive use, social, ethical, aesthetic and option values • Biodiversity at
global, National and local levels. • India as a mega-diversity nation • Hot-sports of biodiversity. •
Threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts. • Endangered
and endemic species of India • Conservation of biodiversity: In-situ and Ex-situ conservation of
biodiversity.
UNIT-5
Environmental Pollution (8 lectures) Definition • Cause, effects and control measures of :- a. Air
pollution b. Water pollution c. Soil pollution d. Marine pollution e. Noise pollution f. Thermal
pollution g. Nuclear hazards • Solid waste Management : Causes, effects and control measures of
urban and industrial wastes. • Role of an individual in prevention of pollution. • Pollution case
studies. • Disaster management: floods, earthquake, cyclone and landslides.
UNIT-6
Social Issues and the Environment • From Unsustainable to Sustainable development • Urban
problems related to energy • Water conservation, rain water harvesting, watershed management •
Resettlement and rehabilitation of people; its problems and concerns. Case Studies •
Environmental ethics : Issues and possible solutions. • Climate change, global warming, acid
rain, ozone layer depletion, nuclear accidents and holocaust. Case Studies. • Wasteland
reclamation. • Consumerism and waste products. • Environment Protection Act. • Air
(Prevention and Control of Pollution) Act. • Water (Prevention and control of Pollution) Act •
Wildlife Protection Act • Forest Conservation Act • Issues involved in enforcement of
environmental legislation. • Public awareness.
UNIT-7
Human Population and the Environment • Population growth, variation among nations.•
opulation explosion – Family Welfare Programme. VII • Environment and human health. •
63
TECHNOLOGY
Human Rights. • Value Education. • HIV/AIDS. • Women and Child Welfare. • Role of
Information Technology in Environment and human health. • Case Studies.
Text/ Reference Books:
1. Agarwal, K.C. 2001 Environmental Biology, Nidi Publ. Ltd. Bikaner.
2. Bharucha Erach, The Biodiversity of India, Mapin Publishing Pvt. Ltd., Ahmadabad - 380013,
India, Email: mapin@icenet. net (R).
3. Brunner R.C., 1989, Hazardous Waste Incineration, McGraw Hill Inc. 480p.
4. Clerk B.S., Marine Pollution, Clanderson Pross Oxford (TB).
5. Cunningham, W.P.Cooper, T.H. Gorhani, E & Hepworth, M.T.2001, Environmental

Encyclopedia, Jaico Publ. House, Mumbai, 1196p.
64
TECHNOLOGY
THIRD SEMESTER
Skill for Engineers–II

L T P C
Course Code: Skill for Engineers–II
2 0 0 2
BTF306
COURSE OBJECTIVES
 To provide a comprehensive knowledge in English language communication and soft
skills
COURSE OUTCOMES
 Interpret the dynamics of effective teamwork and undertake tasks in effective teams
 Identify the value of giving and receiving relevant feedback in a constructive manner
 Apply the concept of emotional intelligence, Understand the dynamics of persuasion and
pitch for an idea [to external or internal audience] using persuasion skills
 Appreciate what produces an effective negotiation and use negotiation skills to achieve a
goal.
Unit I
Teamwork: Importance of groups in organizations, How to build a good team, Team interactions
Unit II
Giving/receiving feedback: Various ways in which feedback can be given, Understanding how
feedback works, Positive and negative feedback
Unit III
Conflict Management: Conflicts in human relations, Approaches to conflict resolution,
Unit IV
Listening Skills: Listening strategies, Selective listening, Application exercises
Unit V
Writing Skills: Describing a process, Writing instructions and manuals, Writing product
descriptions
Unit VI
Negotiations: Introduction: basics of networking and negotiations, Stages in a negotiation
process
65
TECHNOLOGY
Reference Books:
2. Tools for Teams: Building Effective Teams, edited by Craig Swenson
3. HBR Guide to Dealing with Conflict, Harvard Business Review

4. HBR Winning Negotiations, Harvard Business Review, Harvard Business Review Press
5. Active Listening: Building Skills for Understanding, Marc Hegelson, Steven Brown,
Cambridge University Press
66
TECHNOLOGY
THIRD SEMESTER
Object Oriented Programming Lab

L T P C
Course Code: Object Oriented Programming Lab
0 0 4 2
BTAIC307
COURSE OBJECTIVES
 To understand fundamentals of object-oriented programming.
 To give a concrete understanding to write a computer program to solve specified
problems.
 To demonstrate to the use of object-oriented concepts and make the student learn an
object oriented way of solving problems.
COURSE OUTCOMES
Students will be able to
 Apply the object oriented programming concepts and its various features while creating
the programs for solving any real-world problem.
 Experiment with exception handling in object-oriented programs.
 Build program using C++ features such as objects, classes, Operator overloading,
inheritance, Polymorphism etc.
List of experiments:
Note: At-least 10 experiment should be performed by the students.
1. Write a program to prints numbers, alphabets and special characters on the output screen.
2. Write a program to that accept age in years from user as input and displays his age in months
and days.
3. Write a C++ program to implement function overloading in order to compute power(m,n)

where i) m is double and n is int ii) m and n are int.
4. Create a 'DISTANCE' class with: -
a. feet and inches as data members
b. member function to input distance
c. member function to output distance
67
TECHNOLOGY
d. member function to add two distance objects
Write a main function to create objects of DISTANCE class. Input two distances and output the
sum.
5. Create a class called 'EMPLOYEE' that has
- EMPCODE and EMPNAME as data members
- member function getdata( ) to input data
- member function display( ) to output data
Write a main function to create EMP, an array of EMPLOYEE objects. Accept and display the
details of at least 6 employees.
6. Create a class called 'TIME' that has
- three integer data members for hours, minutes and seconds
- constructor to initialize the object to zero
- constructor to initialize the object to some constant value
- member function to add two TIME objects
- member function to display time in HH:MM:SS format
Write a main function to create two TIME objects, add them and display the result in
HH:MM:SS format.
7. Create a class 'COMPLEX' to hold a complex number. Write a friend function to add two
complex numbers. Write a main function to add two COMPLEX objects.
8. Create a 'MATRIX' class of size mxn. Overload the „+‟ operator to add two MATRIX objects.
Write a main function to implement it.
9. Derive a class „MAT‟ from MATRIX class created in program No. 8. Add a member function
to overload „*‟ operator to multiply two objects. (Single Inheritance).
10. Write a c++ program :
a. to illustrate multilevel inheritance
b. to illustrate multiple inheritance
11. Create a 'STRING' class which overloads „ = = ' operator to compare two STRING objects.
68
TECHNOLOGY
12. Write a C++ program to illustrate „this‟ pointer and pointers to derived classes.
13. Create a base class called 'SHAPE' having
- two data members of type double
- member function get-data( ) to initialize base class data members
- pure virtual member function display-area( ) to compute and display the area of the geometrical
object.
Derive two specific classes 'TRIANGLE' and 'RECTANGLE' from the base class. Using these
three classes design a program that will accept dimension of a triangle / rectangle interactively
and display the area.
14. Write a C++ program to read a list containing item name, item code and cost interactively
and display the data in a tabular format as shown below:
Name Code Cost
15. Design your own manipulator to provide the following output specification for printing
money value: 1) 10 columns width 2) The character '$' at the beginning 3) Showing '+' sign. 4)
Two digits precision 5) Filling of unused spaces with ' * ' 6) Trailing zeros shown.
16. Write a C++ program that uses a single file for both reading and writing the data.
17. A file contains a list of names and telephone numbers in the following form:
Name Tel. No.
Write a C++ program to read the file and output the list in the tabular format. The name should
be left-justified and numbers right-justified. Use a class object to store each set of data.
18. Write an interactive, menu-driven program that will access the file created in program No.17
and implement the following tasks: i) To determine the telephone numbers of the specified
person. ii) To determine the name if a telephone number is given. iii) To update the telephone
number whenever there is a change.
19. Write a C++ program that displays the size (in bytes) of a given file. The name of the file is
specified as command line argument.
20. Define a function template for finding the minimum value contained in an array. Write main
( ) function to find the minimum value of integer array and minimum value of floating point
numbers in an array.
69
TECHNOLOGY
21. Write a class template to represent a generic vector. Include member functions to perform the
following tasks: 1) to create the vector. 2) To modify the value of a given element. 3) To
multiply the vector by a scalar value. 4) To display the vector in the form (10, 20, 30,…..).
Experiments can be expanded and revised by course instructor based on latest industry
requirement.
Text Books:
1. Object Oriented Programming with C++ by E Balagurusamy, 2001, Tata McGraw-Hill.

2. Object Oriented Programming in Turbo C++ by Robert Lafore , 1994, The WAITE
Group Press.
Reference Book:
1. Compete Reference C++, Herbert Schlitz, TMH.

2. Kamthane,” Object Oriented Programming with ANSI and Turbo C++”, Pearson
Education, 2003.
70
TECHNOLOGY
THIRD SEMESTER
Analysis and Design of Algorithms Lab

L T P C
Course Code: Analysis and Design of Algorithms Lab
0 0 2 1
BTAIC308
COURSE OBJECTIVES
 Introduce the design, analysis and implementation of different types of problem solving
algorithms.
 Implementation of dynamic programming and greedy concept for problem solving.
COURSE OUTCOMES
 Compare and develop different type of algorithmic approaches with implementation.
 Analyze how the choice of data structures and the algorithm design methods impact the
performance of programs.
List of Experiments (expandable)
1. Write a program to implement Binary Search and analyze its complexity.
2. Write a program to implement Merge Sort and analyze its complexity.
3. Write a program to implement Quick Sort and analyze its complexity.
4. Write a program to implement Strassen‟s Matrix Multiplication and analyze its complexity.
5. Write a program to implement Knapsack problem and analyze its complexity.
6. Write a program to implement minimum spanning trees using Kruskal‟s algorithm and analyze
its complexity.
7. Write a program to implement minimum spanning trees using Prim‟s algorithm and analyze its
complexity.
8. Write a program to implement 0/1 knapsack problem and analyze its complexity.
9. Write a program to implement all pair shortest path algorithm and analyze its complexity.
10. Write a program to implement traveling salesman problem and analyze its complexity.
11. Write a program to implement 8 queen problems and analyze its complexity.
71
TECHNOLOGY
12. Write a program to implement matrix chain multiplication and analyze its complexity.
Text Books:
1. Horowitz & Sahani, “Analysis & Design of Algorithm”, Galgotia Publication.

2. T. H. Cormen, C. E. Leiserson, R. L. Rivest, "Introduction to Algorithms", The MIT press,
Cambridge, Massachusetts and McGraw Hill.
Reference Books:
1. V. Aho, J. E. Hopcroft and J. D. Ullman, "The Design and Analysis of Computer Algorithms",
Addison Wesley.
72
TECHNOLOGY
THIRD SEMESTER
Java Programming Lab

L T P C
Course Code: Java Programming Lab
0 0 4 2
BTAIC309
COURSE OBJECTIVES
 Able to use the Java SDK environment to create, debug and run simple Java programs.
 Understand the fundamentals concept of object-oriented programming in Java, including objects,
classes, invoking methods etc and exception handling mechanisms.
 To enhance the knowledge to server side programming.
COURSE OUTCOMES

 Illustrate Object Oriented features and Java concepts.
 Create Java programs using inheritance and polymorphism
 Develop java programs using interfaces.
List of Experiments:
1. Write a java program to get a Number and Display the Sum of the Digits
2. Write a java program to check Whether the Entered Year is a Leap Year or Not
3. Write a java program to accept the Height of a Person & Categorize as Taller, Dwarf &
Average
4. Write a java program to read a Grade & Display the Equivalent Description
5. Write a java program to find duplicate characters in a String
6. Write a java program to Illustrate Use of Abstract Class and Method
7. Write a java program to Add Two Matrix Using Multi-dimensional Arrays
8. Write a java program to make a calculator using switch case
9. Write a java program to Create the Object for Class and to Assign Value in the Object Using
Constructor
10. Write a java program to Make Shape as an Interface and Implement it Using Circle and
Rectangle Class
73
TECHNOLOGY
11. Write a Java program to get a list of all file/directory names from the given.
12. Write a Java program to create a new array list, add some colors (string) and print out the
collection.
13. Write a Java program to join two array lists.
14. Compute the following:
 Create a package name org.jlu
 Create some classes in the package representing types of employee like faculty, non-
teaching, supporting_staff, admin_staff and soon. The classes should contain work
and courses method in them.
 Compile the package.
 Use this package to find work and courses of different schools as chosen by the user.
15. To implements the client/server application.
requirement.
Text Books:
1. Herbert Schildt, “The Complete Reference – Java 2”, Tata McGraw Hill, 9th Edition 2014
2. Joyce Farrell, “Java Programming”, Cengage Learning, 7 th Edition, 2014.
Reference Books:
1. John Dean, Raymond Dean, “Introduction to Programming with JAVA – A Problem

Solving Approach”, Tata McGraw Hill, 2014.
2. E Balagurusamy, “Programming with Java a Primer”, TMH, 4 th edition.
3. Patrick Naughton, “Java Handbook”, Osborne McGraw-Hill.
74
TECHNOLOGY
FOURTH SEMESTER
Operating Systems
L T P C
Course Code: Operating Systems
3 1 0 4
BTAIC401
COURSE OBJECTIVES
 To study the basic concepts and functions of operating systems.

 To learn about mechanisms of OS to handle processes, Threads and Scheduling
algorithms.
 To understand the principles of concurrency, Mutual exclusion algorithms, deadlock
detection algorithms and agreement protocols.
 To learn the mechanisms involved in memory management in contemporary OS , I/O
management and File systems, basics of Linux system and perform administrative tasks
on Linux Servers.
COURSE OUTCOMES

 Describe the basic components of an operating system and their role in implementations for
general purpose, real-time, and embedded applications.
 Define the concepts of processes, threads, asynchronous signals and competitive system resource
allocation.
 Elaborate the policies for scheduling, deadlocks, memory management, synchronization, system
calls, and file systems.
UNIT I
OPERATING SYSTEMS OVERVIEW: Evolution of Operating system, OS , Operating System

Functionalities, Types of Operating Systems, System Calls, System Boots, Processes:
Defination, Process Concepts, Threads, Benifits of threads,Concept of multithreds
UNIT II
PROCESS SCHEDULING: Scheduling objectives, Types of Schedulers, Scheduling Criteria,

Scheduling algorithms: Premptive and Non premptive scheduling, FCFS, SJF, SRTF, RR,
Priority Scheduling, Performance evaluation of the scheduling
75
TECHNOLOGY
PROCESS SYNCHRONIZATION: Interprocess Commmunication, precedence graphs, critical
section problem, semaphores, pipes, Message Passing, Signals, Monitors, classical problems of
synchronization.
UNIT III:
Deadlock: Principles of deadlock, Characterization, Conditions for Deadlock –Mutual Exclusion,

Hold and Wait, No premption, Circular Wait, Methods for handling deadlocks - Deadlock
Prevention, Deadlock Avoidance- Banker‟s Algorithm, Deadlock Detection, Deadlock Recovery
UNIT IV
MEMORY MANAGEMENT: Memory Management requirements, Memory partitioning,

Memory Allocation, Fragmentation, Swapping, and Paging. Segmentation,Structure and
Implementation of page table, Demand paging, Virtual Memory: Concepts, management of VM,
Page Replacement Policies, Thrashing, Cache Memory.
UNIT-V
FILE MANAGEMENT: File concept, Types and Structures, Directory Structure, Access
Methods and Matrices, File Security, User authentication.
DEVICE MANAGEMENT: Devices and their characteristics, Device drivers, Device handling, Disk
scheduling algorithms.
Text Books:
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System
Concepts”, 9th Edition, John Wiley and Sons Inc., 2012.
Reference Books:
1. William Stallings, “Operating Systems – Internals and Design Principles”, 7th Edition,
Prentice Hall, 2011.
2. Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition, Addison Wesley,
2001.
3. Charles Crowley, “Operating Systems: A Design-Oriented Approach”, Tata McGraw
HillEducation”, 1996.
4. D M Dhamdhere, “Operating Systems: A Concept-Based Approach”, Second Edition,
Tata
76
TECHNOLOGY
FOURTH SEMESTER
Computer Networks
Computer Networks L T P C
Course Code:
3 1 0 4
BTAIC402
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
COURSE OUTCOMES
 Perceive and describe the layered protocol model.
 Analyze and evaluate various networking protocols.
 Identify the challenges in building networks and develop the solutions to those
challenges.
UNIT I
Overview of the Internet: Protocol, layering scenario, TCP/IP protocol suite: the OSI model,
internet history, standards and administration, comparison of the OSI and TCP/IP reference model.
Physical Layer: Guided transmission media, wireless transmission media. Data Link Layer: design
issues, CRC codes, elementary data link layer protocols
UNIT II
Multi Access Protocols: ALOHA, CSMA, collision free protocols, Ethernet: physical layer,
Ethernet Mac sub-layer, data link layer switching & use of bridges, learning bridges, spanning tree
bridges, repeaters, hubs, bridges, switches, routers and gateways.
UNIT III
Network Layer: Network Layer Design issues, store and forward packet switching, connection less
and connection oriented networks, routing algorithms-optimality principle, shortest path, flooding,
Distance Vector Routing, Control to Infinity Problem, Hierarchical Routing, Congestion control
algorithms, admission control.
UNIT IV
Internetworking: Tunneling, internetwork routing, packet fragmentation, IPv4, IPv6 protocol, IP
addresses, CIDR, IMCP, ARP, RARP, DHCP.
77
TECHNOLOGY
Transport Layer: Services provided to the upper layers, elements of transport protocol: addressing,
connection establishment, connection release, crash recovery. The Internet Transport Protocols-
Introduction to TCP, The TCP Service Model, The TCP Segment Header, The Connection
Establishment, The TCP Connection Release, The TCP Connection Management Modeling, The
TCP Sliding Window, The TCP Congestion Control
UNIT V
Application Layer: Introduction, providing services, applications layer paradigms, client server
model, standard client-server application, HTTP, FTP, electronic mail, TELNET, DNS, SSH.
Text books:
1. Data Communications and Networking - Behrouz A. Forouzan, Fifth Edition TMH, 2013.
2. Computer Networks - Andrew S Tanenbaum, 4th Edition, Pearson Education
Reference books:
1. An Engineering Approach to Computer Networks - S. Keshav, 2nd Edition, Pearson Edication.
2. Understanding communications and Networks, 3rd Edition, W. A. Shay, Cengage Learning.
78
TECHNOLOGY
FOURTH SEMESTER
Computer Organization & Architecture

L T P C
Course Code: Computer Organization & Architecture
3 1 0 4
BTAIC403
COURSE OBJECTIVES
 Explain the principles of computer organization and the basic architecture concepts.
 Understand the basic architecture of processing, memory and i/o organization in a
computer system.
COURSE OUTCOMES
Student shall be able to
 Explain the architecture of modern computers and their arithmetic operation.
 Summarize the concepts of CPU, memory and I/O sub-blocks and multiprocessor.
 Apply different number systems and codes for digital representation of data in a
computer system.
UNIT – I
STRUCTURE OF COMPUTERS: Computer types, Functional units, Basic operational concepts,
Von Neumann Architecture, Bus Structures, Software, Performance, Multiprocessors and
Multicomputer, Data representation, Fixed and Floating point, Error detection and correction
codes.
COMPUTER ARITHMETIC: Addition and Subtraction, Multiplication and Division algorithms,
Floating-point Arithmetic Operations, Decimal arithmetic operations.
UNIT – II
BASIC COMPUTER ORGANIZATION AND DESIGN: Instruction codes, Computer Registers,
Computer Instructions and Instruction cycle. Timing and Control, Memory-Reference
Instructions, Input-Output and interrupt. Central processing unit: Stack organization, Instruction
Formats, Addressing Modes, Data Transfer and Manipulation, Complex Instruction Set
Computer (CISC) Reduced Instruction Set Computer (RISC), CISC vs RISC
UNIT – III
REGISTER TRANSFER AND MICRO-OPERATIONS: Register Transfer Language, Register
Transfer, Bus and Memory Transfers, Arithmetic Micro-Operations, Logic Micro-Operations,
Shift Micro-Operations, Arithmetic logic shift unit.
MICRO-PROGRAMMED CONTROL: Control Memory, Address Sequencing, Micro-Program
example, Design of Control Unit.
79
TECHNOLOGY
UNIT – IV
MEMORY SYSTEM: Memory Hierarchy, Semiconductor Memories, RAM(Random Access
Memory), Read Only Memory (ROM), Types of ROM, Cache Memory, Performance
considerations, Virtual memory, Paging, Secondary Storage, RAID.
UNIT – V
INPUT OUTPUT: I/O interface, Programmed IO, Memory Mapped IO, Interrupt Driven IO,
DMA.
MULTIPROCESSORS: Characteristics of multiprocessors, Interconnection structures, Inter
Processor Arbitration, Inter processor Communication and Synchronization, Cache Coherence.
Text Books:
1. Hamachar, Vranesic & Zaky, “Computer Organization”, 5th edition TMH.

2. M. Moris Mano (2006), Computer System Architecture, 3rd edition, Pearson/PHI, India.
Reference Books:
1. Carl Hamacher, Zvonks Vranesic, SafeaZaky (2002), Computer Organization, 5th

edition, McGraw Hill, New Delhi, India.
2. William Stallings (2010), Computer Organization and Architecture- designing for
performance, 8th edition, Prentice Hall, New Jersy.
3. Anrew S. Tanenbaum (2006), Structured Computer Organization, 5th edition, Pearson
Education Inc,
4. John P. Hayes (1998), Computer Architecture and Organization, 3rd edition, Tata
McGrawHill
80
TECHNOLOGY
FOURTH SEMESTER
Disaster Management
L T P C
Course Code: Disaster Management
2 0 0 2
BTF405
COURSE OBJECTIVES
 To provide students an exposure to disasters, their significance and types.
 To ensure that students begin to understand the relationship between vulnerability,
disasters, disaster prevention and risk reduction
 To gain a preliminary understanding of approaches of Disaster Risk Reduction (DRR)
COURSE OUTCOMES

 Define humanitarian response within the framework of an understanding of development
 Analyze the vulnerability and disaster risk reduction as an integral part of development
UNIT – I
Introduction to Disasters: Concepts, and definitions (Disaster, Hazard, Vulnerability, Resilience,
Risk.
UNIT – II
Disasters: Classification Causes, Impacts (including social, economic, political, environmental,
health, psychosocial, etc.) Differential impacts- in terms of caste, class, gender, age, location,
disability Global trends in disasters: urban disasters, pandemics, complex emergencies, Climate
change
UNIT – III
Approaches to Disaster Risk reduction: Disaster cycle - its analysis, Phases, Culture of safety,
prevention, mitigation and preparedness community, roles and responsibilities of- communities
& other stake-holders.
UNIT – IV
Inter-relationship between Disasters and Development: Factors affecting Vulnerabilities,
differential impacts, impact of Development projects such as dams, embankments, changes in
Land-use etc. Climate Change Adaptation. Relevance of indigenous knowledge, appropriate
technology and local resources
81
TECHNOLOGY
UNIT – V
Disaster Risk Management in India Hazard and Vulnerability profile of India Components of
Disaster Relief: Water, Food, Sanitation, Shelter, Health, Waste Management, (Mitigation,
Response and Preparedness, DM Act and Policy, Other related policies, plans, programmes and
legislation)
UNIT – VI
Project Work: (Field Work, Case Studies) the project /fieldwork is meant for students to
understand vulnerabilities and to work on reducing disaster risks and to build a culture of safety.
Projects must be conceived creatively based on the geographic location and hazard profile of the
region where the college is located. A few ideas or suggestions are discussed below. Several
governmental initiatives require Urban Local Bodies (ULBs) and Panchayati Raj Institutions
(PRIs) to be proactive in preparing DM Plan Several governmental initiatives require Urban
Local Bodies (ULBs) and Panchayati Raj Institutions (PRIs) to be proactive in preparing DM
Plans and community based disaster preparedness plans. Information on these would be available
with the district Collector or Municipal Corporations. The scope for students to collaborate on
these initiatives is immense.
Text/Reference Books:
1. Alexander David, Introduction in 'Confronting Catastrophe', Oxford University Press, 2000

2. Andharia J. Vulnerability in Disaster Discourse, JTCDM, Tata Institute of Social Sciences Working
Paper no. 8, 2008
3. Blaikie, P, Cannon T, Davis I, Wisner B 1997. At Risk Natural Hazards, Peoples' Vulnerability and
Disasters,
4. Routledge. Coppola P Damon, 2007. Introduction to International Disaster Management, Carter,
Nick 1991. Disaster Management: A Disaster Manager's Handbook. Asian Development Bank,
Manila Philippines.
5. Cuny, F. 1983. Development and Disasters, Oxford University Press. Document on World Summit on
Sustainable Development 2002. Govt. of India: Disaster Management Act 2005, Government of
India, New Delhi. Government of India, 2009. National Disaster Management Policy
82
TECHNOLOGY
FOURTH SEMESTER
Skill for Engineers–III

L T P C
Course Code: Skill for Engineers–III
2 0 0 2
BTF406
COURSE OBJECTIVES
 To Understand the dynamics of persuasion and pitch for an idea [to external or internal audience]
using persuasion skills
COURSE OUTCOMES
 Appreciate the usefulness of networking
 Justify and defend a logical evidence based argument, singly or with others
 Appreciate what produces an effective negotiation
 Identify the role played by diversity when communication across cultures
UNIT I
Group Discussions and Panel Discussions
Establishing a verbal argument, Presenting an argument logically, Basics of group discussions and
panel discussions
UNIT II
Presentation Skills
Using visuals, How to make a presentation, PowerPoint, Language, Handling audience questions
UNIT III
Writing Skills (12 hours)
Notes, Messages, Memos
UNIT IV
Workplace Ethics/Office Culture (12 hours)
Assessing the culture of an organization, Understanding ethical behavior and applying it in
dayto-day dealings
UNIT V
Diversity/Inter-cultural communication
Understanding cross cultural communication, Cultural stereotypes
UNIT VI
Negotiating/Networking continued
Guidelines for effective negotiating, Bargaining stages
83
TECHNOLOGY
Text books:
2. Guide to Cross Cultural Communications, Sana Reynolds, Deborah Valentine, Pearson
Education India
3. HBR Winning Negotiations, Harvard Business Review, Harvard Business Review Press
4. Emotional Intelligence, Daniel Coleman, Bantam Books
References:
1. Presentations (20 Minute Manager), Harvard Business Review, Harvard Business School
Press India Ltd
2. Ethics Can: Managing Workplace Ethics, Cynthia Schoeman, Knowledge Resources
Publishing Pty Ltd
84
TECHNOLOGY
FOURTH SEMESTER
Operating Systems Lab

L T P C
Course Code: Operating Systems Lab
0 0 4 2
BTAIC407
COURSE OBJECTIVES
 To implement various CPU Scheduling Algorithms
 To implement Deadlock Avoidance and Deadlock Detection Algorithms
 To implement Page Replacement Algorithms.
 To implement File Organization and File Allocation Strategies.
COURSE OUTCOMES
 Interpret and implement basic services and functionalities of the operating system using
system calls.
 Analyze and simulate CPU Scheduling Algorithms
 Apply the memory management schemes and page replacement schemes.
LIST OF EXPERIMENTS:
1. Write a program to implement CPU scheduling for first come first serve.
2. Write a program to implement CPU scheduling for shortest job first.
3. Write a program to perform priority scheduling.
4. Write a program to implement CPU scheduling for Round Robin.
5. Write a program for page replacement policy using a) LRU b) FIFO c) Optimal.
6. Write a program to implement first fit, best fit and worst fit algorithm for memory
management.
7. Write a program to simulate the concept of dining philosopher problem.
8. Write a program to implement reader/writer problem using semaphore.
9. Write a program to implement Banker‟s algorithm for deadlock avoidance.
10. Write a C program to simulate disk scheduling algorithms. a) FCFS b) SCAN c) C-SCAN
requirement.
85
TECHNOLOGY
FOURTH SEMESTER
Computer Networks Lab
Computer Networks Lab L T P C

Course Code:
0 0 2 1
BTAIC408
COURSE OBJECTIVES
 Learn to communicate between two desktop computers
 Learn to implement the different protocols
 Build an understanding of the fundamental concepts of computer networking
 To demonstrate the TCP/IP and OSI models with merits and demerits.
 Allow the student to gain expertise in some specific areas of networking such as the design and
maintenance of individual networks.
COURSE OUTCOMES
After successfully completing students should be able to:
 Identify the different types of network topologies, protocols, network devices and their functions
within a network.
 Apply different networking concepts for implementing network solution.
 Evaluate and implement routing algorithms to solve real life problems
LIST OF EXPERIMENTS
1. Study of different types of Network cables and Network Devices

2. Study of network IP.
3. Connect the computers in Local Area Network
4. Study of basic network command and Network configuration commands
5. Configure a Network topology using packet tracer software
6. Performing an Initial Switch Configuration
7. Performing an Initial Router Configuration
8. Configure a Network using Distance vector routing algorithm.
9. Configure a Network using link state routing algorithm.
10. Study and explore the features of Wireshark.
86
TECHNOLOGY
FOURTH SEMESTER
Python Programming Lab

L T P C
Course Code: Python Programming Lab
0 0 4 2
BTAIC409
COURSE OBJECTIVES
 Understand the basic concepts of programming and the Python programming language.
 Design and develop the programs by using real world dataset.
COURSE OUTCOMES
Student shall able to:
 Analyze the real world dataset.
 Describe the Python language syntax including control statements, loops and functions to
write programs for a wide variety problem in mathematics, science, and games.
Experiments based on:
1. Installation of Python and the supporting libraries.

2. Types of data types (Strings, list, dictionaries, etc.) and conditional statement.
3. Loops
4. Functions, modules, packages, recursions, iterations, Case study: Interface design
5. Tuples, files, classes and objects, classes and functions, classes and methods, case study: Data
structure selection.
6. Inheritance, Case Study: Tkinter- Debugging, Analysis and algorithm.

7. Load and analyze the real world dataset.
Note: Number of experiments may very as per the requirements of course instructor.
Text Books:
1. Allen Downey, “Think Python” version 2.0.17

2. Dave Kuhlman. “A Python Book: Beginning Python, Advanced Python and Python Exercise”
2nd Edition.
Reference Books:
1. Mark Lutz, “Learning Python”, 4th Edition O.Reilly Publication.
87
TECHNOLOGY
FIFTH SEMESTER
Introduction to AI and Machine Learning

L T P C
Course Code: Introduction to AI and Machine Learning
3 1 0 4
BTAIS501
COURSE OBJECTIVES
 Understand the basic principles of AI toward problem solving, inference, perception,
knowledge representation, and learning.
 Investigate applications of AI techniques in intelligent agents, expert systems and other
machine learning models
 Understand the strengths and weaknesses of many popular machine learning approaches
COURSE OUTCOMES
 Explain the evolution of the artificial intelligence (AI) and its foundations.
 Apply basic principles of AI in solutions that require problem solving, inference,
perception, knowledge representation, and learning.
 Illustrate the basic concepts of machine learning systems, types of learning etc.
UNIT I
Introduction: Introduction to Artificial Intelligence, Foundations and History of Artificial

Intelligence, Applications of Artificial Intelligence, Intelligent Agents, Structure of Intelligent
Agents. Expert Systems.
UNIT II
Introduction to Search : Searching for solutions, Uniformed search strategies, Informed search
strategies, Local search algorithms and optimistic problems, Adversarial Search, Search for
games, Alpha - Beta pruning.
UNIT III
Knowledge Representation & Reasoning: Propositional logic, Theory of first order logic,
Inference in First order logic, Forward & Backward chaining, Resolution, Probabilistic
reasoning, Utility theory, Hidden Markov Models (HMM), Bayesian Networks.
88
TECHNOLOGY
UNIT IV
Introduction:
Basic concepts: Definition of learning systems, Goals and applications of machine learning.
Aspects of developing a learning system: training data, concept representation, function
approximation.
Types of Learning: Supervised learning and unsupervised learning. Overview of classification:

setup, training, test, validation dataset, over fitting.
UNIT V
Linear Regression- model assumptions, regularization (lasso, ridge, elastic net), Dimensionality
Reduction, Subset Selection, Shrinkage Methods, Principle Components Regression, Linear
Classification, Logistic Regression, Linear Discriminant Analysis, Optimization.
Text Books:
1. Stuart Russell, Peter Norvig, “Artificial Intelligence – A Modern Approach”, Pearson

Education
2. Elaine Rich and Kevin Knight, “Artificial Intelligence”, McGraw-Hill
3. E Charniak and D McDermott, “Introduction to Artificial Intelligence”, Pearson Education
4. Tom M. Mitchell, “Machine Learning”, McGraw-Hill.
Reference Books:
1. Dan W. Patterson, “Artificial Intelligence and Expert Systems”, Prentice Hall of India,
89
TECHNOLOGY
FIFTH SEMESTER
Statistics & EDA

L T P C
Course Code: Statistics & EDA
3 1 0 4
BTAIS502
COURSE OBJECTIVES
 Understand the elementary concepts of descriptive and inferential techniques of statistical
methodology.
 To learn the basic statistics and testing hypothesis for specific problems.
 Analyzing and summarizing the main characteristics of data sets including visual
methods
COURSE OUTCOMES
 Extend and formalize knowledge of the theory of probability and random variables.
 Apply appropriate statistical concepts, methodologies and technologies in organizing,
analyzing and interpreting various real-world situations.
 Analyze Data Sets using the Principles of Exploratory Data Analysis.
UNIT I
Basics of Statistics: Population, Sample, Attribute and Variable (Discrete and Continuous),
Classification and Tabulation of Data,
Descriptive statistics: Measures of Central Tendency - Mean, Median, Mode, Dispersion and its
Measures – Range, Quartile Deviation, Mean Deviation, Standard Deviation. Skewness and
Kurtosis.
UNIT II
Random Variables: Random Variable – Introduction: Probability Mass Function, Probability

Density Function and Cumulative Distribution Function, Moments of Random a Variable,
Bernoulli, Binomial, Poisson and Normal Distributions.
Statistical Inference: Introduction to Random Sampling - The Central Limit Theorem,

Sampling Distribution, Concept of Estimation and Testing of Hypotheses, Level of Significance,
Confidence Interval, P-Value, Critical Value, Critical Region; Tests for Population Means and
Variances for Single and Double Samples, Chi-Square Test.
90
TECHNOLOGY
UNIT III
Correlation And Regression: Bivariate Data, Scatter Plots. Pearson Product-Moment and
Spearman‟s Rank Correlation Coefficients, Properties of Correlation Coefficient. Simple Linear
Regression - Regression Equations, ANOVA and Simple Designs: One-Way and Two-Way.
UNIT IV
Introduction to exploratory data analysis and data visualization, Typical data format and the
types of EDA, Univariate non-graphical EDA- Categorical data, Characteristics of quantitative
data, Central tendency Spread Skewness and kurtosis,
UNIT V
Univariate graphical EDA- Histograms, Stem-and-leaf plots, Boxplots, Quantile-normal plots,

Multivariate non-graphical EDA- Cross-tabulation, Correlation for categorical data , Univariate
statistics by category, Correlation and covariance, Covariance and correlation matrices, Multivariate
graphical EDA - Univariate graphs by category, Scatterplots.
Text Books:
1. Adi Adhikari and John De Nero, “Computational and Inferential Thinking: The Foundations
of Data Science”, First edition, 2019
2. Douglas C. Montgomery, George C. Runger, “Applied Statistics and Probability for
Engineers”, Sixth Edition, Wiley, 2013
3. Dr.J.Ravichandran, “Probability And Statistics For Engineers”, First Edition, Wiley, 2010
Reference Books:
1. Ajit C. Tamhan, Dorothy D. Dunlop, “Statistics and Data Analysis: From Elementary to
Intermediate”, Pearson
2. Jiawei Han, Micheline Kamber, Jian Pei, “Data Mining Concepts and Techniques”, Third
edition, Elsevier Publisher, 2006
3. Wendy L. Martinez, Angel R. Martinez, Computational Statistics Handbook with
MATLAB, Second edition, Chapman Hall/CRC, 2008
91
TECHNOLOGY
FIFTH SEMESTER
Database Management System

L T P C
Course Code: Database Management System
3 0 0 3
BTAIC503
COURSE OBJECTIVES
 To learn the fundamentals of data models and to represent a database system using ER
diagrams.
 To study SQL and relational database design.
 To understand the internal storage structures using different file and indexing
techniques which will help in physical DB design.
 To understand the fundamental concepts of transaction processing- concurrency
control techniques and recovery procedures.
 To have an introductory knowledge about the Storage and Query processing
Techniques.
COURSE OUTCOMES
 Describe the fundamental elements of relational database management systems

 Improve the database design by normalization.
 Discuss basic database storage structures and access techniques: file and page
organizations, indexing methods including B+ tree, and hashing.
UNIT I
INTRODUCTION: Database, Data models, Database management system, Schemas and

instances, Three-schema architecture of DBMS, Components of DBMS. Data independence,
Functions of DBA, ER model- E-R diagram, Weak Entitiy sets, Generalization, Specialization,
Aggregation
UNIT II
RELATIONAL MODEL: Structure of relation database- Domains, Relations, Keys, Key

attributes, Referential integrity, Intension and Extension.
SQL QUERY & RELATIONAL ALGEBRA : Basics of SQL, DDL, DML, DCL, structure-
creation, alteration, defining constaints, Data extraction from tables, Joins, Complex queries,
Relational Algebra and Relational Calculas
92
TECHNOLOGY
UNIT III
RELATIONAL DATABASE DESIGN: Functional Dependency , Normalization- Introduction,

1NF, 2NF, 3NF, Decomposition, Dependency Preservation , BCNF, Mutivalued Dependancy,
4NF, Join Dependency and 5NF
QUERY PROCESSING: Query Evaluation, Operator Evaluation, Query Optimization,
Optimization Methods- Heuristic Based, Cost Estimation based, Semantic Query Optimization
UNIT IV
TRANSACTION MANAGEMENT: Transaction concepts , ACID properties, Transaction
systems, Testing of Serilizability, Serializability of schedules, conflict & view serializable
schedule, recoverability, Concurrency Control Technique-Concurrency Control, locking
Techniques for concurrency control.
UNIT V
STORAGE & DATA SECURITY: Storage structure, file organisation, Recovery and atomicity,
Performance measures of discs, RAID levels, Indices, B+ Tree, Hashing, Bitmap indices, Query
optimizations , Database Security, Data mining models and techniques, Distributed Databases,
GIS.
Text Books:
1. An Introduction to Database Systems, by C.J. Date, Pearson

2. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, “Database System Concepts”,
Fifth Edition, Tata McGraw Hill, 2006
Reference Books:
1. Ramez Elmasri, Shamkant B. Navathe, “Fundamentals of Database Systems”, Fourth

Edition, Pearson/Addision Wesley.
2. Raghu Ramakrishnan, “Database Management Systems”, Third Edition, McGraw Hill
3. Database Systems: The Complete Book, by Hector Garcia-Molina, Jeffrey D. Ullman and
Jennifer Widom, Pearson.
93
TECHNOLOGY
FIFTH SEMESTER
Skills for Engineers- IV

L T P C
Course Code: Skills for Engineers- IV
2 0 0 2
BTF506
COURSE OBJECTIVES
 To understand interview strategies and roles of effective CV while applying for a job.
COURSE OUTCOMES
 Identify the key elements of a successful interview [interviewer and interviewee]

 Take part in an interview confidently and effectively [interviewer and interviewee]
 Develop a professional CV and adapt the CV to job and person specifications [for
domestic employment, for international employment]
 Evaluate a range of theories and models used to tackle a range of managerial
responsibilities: Resolving conflicts - Managing change – Delegating]
UNIT I
Preparing for the job market:
Researching the job market, Identifying areas of interests, Understanding job adverts and company
profiles: identifying job applications and CVs according to adverts
UNIT II
Leadership Styles:
Traits of a good leader, Assessment of leadership skills
UNIT III
Coaching and Mentoring
Helping others, coaching to improve performance
UNIT IV
Delegation
Understanding delegation, Determinants of delegation, Delegation skills
94
TECHNOLOGY
UNIT V
Meetings
Role of Chair, Agenda, Minutes
UNIT VI
Behavioral Skills
Understanding attitude and other important behavior skills, Application Exercises
Text Books:
Recommended Reading
2. The Global Resume and CV Guide, Mary Anne Thompson, John Wiley and Sons
3. Leadership and the One Minute Manager, Kenneth Blanchard, Harper Collins
Reference Books:
1. Delegating Work (20 Minute Manager), HBR, Harvard Business Edition

2. Harvard Business Essentials: Coaching and Mentoring, Harvard Business Essentials, Harvard
Business Review Press
95
TECHNOLOGY
FIFTH SEMESTER
Introduction to AI and Machine Learning Lab
Course Code: Introduction to AI and Machine Learning L T P C

BTAIS507 Lab 0 0 2 1
COURSE OBJECTIVES
 Understand the basic concepts of Problem Solving and Searching Techniques.
 Make use of Data sets in implementing the machine learning algorithms
COURSE OUTCOMES
 Apply various AI search algorithms.
 Analyse the fundamental issues and challenges of machine learning: data, model
selection, model complexity, etc.
 Design and implement various machine learning algorithms in a range of real-world
applications.
List of Experiments
1. Implementation of DFS for water jug problem.

2. Implementation of BFS for tic-tac-toe problem
3. Implementation of Hill-climbing to solve 8- Puzzle Problem
4. Implement A* Search algorithm.
5. Implement AO* Search algorithm
6. Study of training, testing and validation sets of data.
7. Study of Overfitting And Underfitting In Machine Learning.
8. Study of K-fold cross-validation and hyperparameter tuning techniques to prevent the
model from overfitting.
9. Implement the non-parametric Locally Weighted Regression algorithm in order to fit data
points. Select appropriate data set for your experiment and draw graphs.
10. Classification of linearly separable data with a perceptron.
96
TECHNOLOGY
FIFTH SEMESTER
Statistics & EDA Lab

L T P C
Course Code: Statistics & EDA Lab
0 0 4 2
BTAIS508
COURSE OBJECTIVES
 Understand the basic concepts of Statistics and Data Analysis.
 Describing the data for various applications related to real world problems.
COURSE OUTCOMES
 Analyze the data through hands-on experience in order to demonstrate understanding of
the theoretical concepts of statistics.
 Make use of graphics packages for drawing of graphs and use computational software for
statistical analysis of data.
The Practicals will be based on
1. Compute measures of central tendency using software

2. Compute measures of variation using software.
3. Importing the required libraries for EDA
4. Loading the data into the data frame.
5. Checking the types of data
6. Dropping irrelevant columns.
7. Renaming the columns
8. Dropping the duplicate rows
9. Dropping the missing or null values.
10. Detecting Outliers
11. Plot different features against one another (scatter), against frequency (histogram)
Note: The experiments can be performed using Python or R Programing.
requirement.
97
TECHNOLOGY
FIFTH SEMESTER
Database Management Systems Lab
L T P C
Course Code: Database Management Systems Lab
0 0 2 1
BTAIC509
COURSE OBJECTIVES
 To familiarise the participant with the different database environments towards an
information-oriented data-processing oriented framework
 To give a good formal foundation on the relational model of data
 To study SQL and procedural interfaces to SQL comprehensively
 To give an introduction to systematic database design approaches covering conceptual
design, logical design and an overview of physical design
COURSE OUTCOMES
Students will be able to:

 Explain the underlying concepts of database technologies
 Design and develop a database schema for a given problem-domain.
 Apply various SQL DML/DDL commands to execute the queries.
LIST OF EXPERIMENTS:
1. Creation of a database and writing SQL queries to retrieve information from the database.
2. Performing Insertion, Deletion, Modifying, Altering, Updating and Viewing records based
on
conditions.
3. Creation of Views, Synonyms, Sequence, Indexes, Save point.
4. Creating an Employee database to set various constraints.
5. Creating relationship between the databases.
6. Study of PL/SQL block.
7. Write a PL/SQL block to satisfy some conditions by accepting input from the user.
8. Write a PL/SQL block that handles all types of exceptions.
9. Creation of Procedures.
10. Creation of database triggers and functions
11. Mini project (Application Development using Oracle/ Mysql )
 Inventory Control System.
 Hospital Management System.
 Railway Reservation System.
 Timetable Management System.
 Hotel Management System
requirement.
98
TECHNOLOGY
SIXTH SEMESTER
Machine Learning II
L T P C
Course Code: Machine Learning II
3 1 0 4
BTAIS601
COURSE OBJECTIVES
 To understand machine learning techniques and computing environment that are suitable
for the applications under consideration
 To implement various ways of selecting suitable model parameters for different machine
learning techniques.
COURSE OUTCOMES
 Define various supervise & unsupervise machine learning approaches and paradigms.
 Compare and contrast pros and cons of various machine learning techniques and to get an
insight of when to apply a particular machine learning approach.
 Adapt the features that can be used for a particular machine learning approach in various
IOT applications.
UNIT I
Supervised Learning (Regression/Classification): Basic methods: Distance-based methods,

Nearest-Neighbours, Decision Trees, Naive Bayes, Support Vector Machines, Nonlinearity and
Kernel Methods, Multi-class/Structured Outputs, Ranking
UNIT II
Unsupervised Learning:
Clustering, K-means, EM Algorithm, Mixture of Gaussians, Factor analysis, PCA (Principal

components analysis), ICA (Independent components analysis), latent semantic indexing,
Spectral clustering, Markov models Hidden Markov models (HMMs).
UNIT III
Reinforcement Learning and Control:
MDPs. Bellman equations, Value iteration and policy iteration, Linear quadratic regulation
(LQR). LQG. Q-learning. Value function approximation, Policy search. Reinforce. POMDPs.
99
TECHNOLOGY
UNIT IV
Evaluating Machine Learning algorithms and Model Selection, Introduction to Statistical

Learning Theory, Ensemble Methods (Boosting, Bagging, Random Forests).
UNIT V
Sparse Modeling and Estimation, Modeling Sequence/Time-Series Data, Deep Learning and
Feature Representation Learning, Scalable Machine Learning, Semi-supervised Learning, Active
Learning, Inference in Graphical Models, Recent trends in various learning techniques of
machine learning and classification methods for IOT applications.
Text Books:
1. Kevin Murphy, Machine Learning: A Probabilistic Perspective, MIT Press, 2012

2. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements of Statistical Learning,
Springer 2009 (freely available online)
3. Christopher Bishop, Pattern Recognition and Machine Learning, Springer, 2007.
Reference Books:
1. Dan W. Patterson, “Artificial Intelligence and Expert Systems”, Prentice Hall of India,
2. Tom M. Mitchell, “Machine Learning”, McGraw-Hill.
100
TECHNOLOGY
SIXTH SEMESTER
Natural Language Processing

L T P C
Course Code: Natural Language Processing
3 1 0 4
BTAIS602
COURSE OBJECTIVES
 To teach students the leading trends and systems in natural language processing.
 To understand the concepts of morphology, syntax, semantics and pragmatics of the
language.
COURSE OUTCOMES
 Illustrate linguistic phenomena and an ability to model them with formal grammars.
 Design and analyze the various NLP algorithms.
 Discuss the application based on natural language processing and to show the points of
syntactic, semantic and pragmatic processing.
UNIT I
INTRODUCTION:
Origins and challenges of NLP, Language Modeling: Grammar based LM, Statistical LM,
Regular Expressions, Finite-State Automata, English Morphology, Transducers for lexicon and
rules, Tokenization, Detecting and Correcting Spelling Errors, Minimum Edit Distance
WORD LEVEL ANALYSIS:
Unsmoothed N-grams, Evaluating N-grams, Smoothing, Interpolation and Backoff, Word

Classes, Part-of-Speech Tagging, Rule-based, Stochastic and Transformation-based tagging,
Issues in PoS tagging , Hidden Markov and Maximum Entropy models.
UNIT II
SYNTACTIC ANALYSIS
Context-Free Grammars, Grammar rules for English, Treebanks, Normal Forms for grammar ,
Dependency Grammar , Syntactic Parsing, Ambiguity, Dynamic Programming parsing , Shallow
parsing , Probabilistic CFG, Probabilistic CYK, Probabilistic Lexicalized CFGs , Feature
structures, Unification of feature structures.
101
TECHNOLOGY
UNIT III
SEMANTICS AND PRAGMATICS
Requirements for representation, First-Order Logic, Description Logics , Syntax-Driven

Semantic analysis, Semantic attachments , Word Senses, Relations between Senses, Thematic
Roles, selectional restrictions , Word Sense Disambiguation, WSD using Supervised, Dictionary
& Thesaurus, Bootstrapping methods , Word Similarity using Thesaurus and Distributional
methods.
UNIT IV
BASIC CONCEPTS of Speech Processing:
Speech Fundamentals: Articulatory Phonetics, Production And Classification Of Speech Sounds;

Acoustic Phonetics, Acoustics Of Speech Production; Review Of Digital Signal Processing
Concepts; Short-Time Fourier Transform, Filter-Bank And LPC Methods.
UNIT V
Features, Feature Extraction And Pattern Comparison Techniques: Speech Distortion Measures,
Mathematical And Perceptual , Log,Spectral Distance, Cepstral Distances, Weighted Cepstral
Distances And Filtering, Likelihood Distortions, Spectral Distortion Using A Warped Frequency
Scale, LPC, PLP And MFCC Coefficients, Time Alignment And Normalization , Dynamic Time
Warping, Multiple Time , Alignment Paths.
Text Books:
1. Daniel Jurafsky, James H. Martin―Speech and Language Processing: An Introduction to

Natural Language Processing, Computational Linguistics and Speech, Pearson Publication,
2014.
2. Steven Bird, Ewan Klein and Edward Loper, ―Natural Language Processing with Python,
First Edition, OReilly Media, 2009.
3. Nitin Indurkhya and Fred J. Damerau, ―Handbook of Natural Language Processing, Second
Edition, Chapman and Hall/CRC Press, 2010.
Reference Books:
1. Tanveer Siddiqui, U.S. Tiwary, ―Natural Language Processing and Information Retrieval
Oxford University Press, 2008.
2. Lawrence Rabiner And Biing-Hwang Juang, “Fundamentals Of Speech Recognition”, Pearson
Education, 2003.
102
TECHNOLOGY
SIXTH SEMESTER
Compiler Design
L T P C
Course Code: Compiler Design
3 1 0 4
BTAIC603
COURSE OBJECTIVES
 To provide a thorough understanding of the internals of Compiler Design.
 To understand various stages involved in design of a compiler.
COURSE OUTCOMES
 Explain the concepts and different phases of compilation with compile time error
handling.
 Compare top down with bottom up parsers, and develop appropriate parser to produce
parse tree representation of the input.
 Apply optimization techniques to intermediate code and generate machine code for high
level language program.
UNIT I
Introduction to compilers – Analysis of the source program, Phases of a compiler, Grouping of

phases, compiler writing tools – bootstrapping
Lexical Analysis:
The role of Lexical Analyzer, Input Buffering, Specification of Tokens using Regular
Expressions, Review of Finite Automata, Recognition of Tokens.
UNIT II
Syntax Analysis:
Review of Context-Free Grammars – Derivation trees and Parse Trees, Ambiguity.
Top-Down Parsing:
Recursive Descent parsing, Predictive parsing, LL(1) Grammars.
103
TECHNOLOGY
UNIT III
Bottom-Up Parsing:
Shift Reduce parsing – Operator precedence parsing (Concepts only) LR parsing – Constructing
SLR parsing tables, Constructing, Canonical LR parsing tables and Constructing LALR parsing
tables.
UNIT IV
Syntax directed translation:
Syntax directed definitions, Bottom- up evaluation of Sattributed definitions, L- attributed

definitions, Top-down translation, Bottom-up evaluation of inherited attributes.
Type Checking:
Type systems, Specification of a simple type checker.
UNIT V
Intermediate Code Generation (ICG):
Intermediate languages – Graphical representations, ThreeAddress code, Quadruples, Triples.

Assignment statements, Boolean expressions.
Code Optimization:
Principal sources of optimization, Optimization of Basic blocks
Code generation:
Issues in the design of a code generator. The target machine, A simple code generator.
Text Books:
1. Aho A. Ravi Sethi and D Ullman. Compilers – Principles Techniques and Tools, Addison
Wesley, 2006.
2. D. M.Dhamdhare, System Programming and Operating Systems,Tata McGraw Hill &
Company, 1996.
Reference Books:
1. Kenneth C. Louden, Compiler Construction – Principles and Practice, Cengage Learning

Indian Edition, 2006.
2. Tremblay and Sorenson, The Theory and Practice of Compiler Writing, Tata McGraw Hill &
Company,1984.
104
TECHNOLOGY
SIXTH SEMESTER
Machine Learning II Lab
Machine Learning II Lab
BTAIS606 0 0 4 2
COURSE OBJECTIVES
 To make use of Data sets in implementing the machine learning algorithms.
 To implement the machine learning concepts and algorithms in any suitable language of
choice.
COURSE OUTCOMES
 Identify the Machine Learning algorithms to solve real world problems.
 Design and develop the programs for various Learning algorithms.
 Apply appropriate data sets to the Machine Learning algorithms.
List of Experiments
1. Study and Implement the Naive Bayes learner. (The datasets taken can be: Breast Cancer
data file or Reuter‟s data set).
2. Study and Implement the Decision Tree learners. (The datasets taken can be: Breast
Cancer data file or Reuter‟s data set).
3. Estimate the accuracy of decision classifier on breast cancer dataset using 5-fold cross-
validation. (You need to choose the appropriate options for missing values).
4. Estimate the precision, recall, accuracy, and F-measure of the decision tree classifier on
the text classification task for each of the 10 categories using 10-fold cross-validation.
5. Develop a machine learning method to classifying your incoming mail.
6. Develop a machine learning method to Predict stock prices based on past price variation.
7. Develop a machine learning method to predict how people would rate movies, books, etc.
8. Develop a machine learning method to Cluster gene expression data, how to modify
existing methods to solve the problem better
9. Select two datasets. Each dataset should contain examples from multiple classes. For
training purposes assume that the class label of each example is unknown (if it is known,
ignore it). Implement the K-means algorithm and apply it to the data you selected.
Evaluate performance by measuring the sum of Euclidean distance of each example from
its class center. Test the performance of the algorithm as a function of the parameter k.
Suggest and test a method for automatically determining the number of clusters.
105
TECHNOLOGY
SIXTH SEMESTER
Natural Language Processing Lab
Natural Language Processing Lab
BTAIS607 0 0 4 2
COURSE OBJECTIVES
 To introduce the students with the basics of NLP
 To empower students for developing advanced NLP tools and solving practical problems
in the field.
COURSE OUTCOMES
 Analyze the fundamental mathematical models and algorithms in the field of NLP.
 Design and Develop various NLP applications such as information retrieval and
information extraction.
 Apply POS tagging and context free grammar for English language
List of Experiments
1. Write a Program for Word Analysis.

2. Write a Program for Word Generation.
3. Write a program to implement Morphology.
4. Write a Program to implement N-Grams.
5. Write a Program to implement N-Grams Smoothing.
6. Write a Program to implement POS Tagging: Hidden Markov Model.
7. Write a Program to implement POS Tagging: Viterbi Decoding.
8. Write a Program to implement Chunking
106
TECHNOLOGY
SIXTH SEMESTER
Compiler Design Lab
Compiler Design Lab
BTAIC608 0 0 2 1
COURSE OBJECTIVES
 To deepen the understanding of compiler design
 To develop problem solving ability using programming
COURSE OUTCOMES
 Design & conduct experiments for DFA from a given regular expression
 Develop program for solving parser problems.
 Create program for intermediate code generation and code generation.
List of Experiments
1. Implement a DFA which simulates the regular expression a + (aa)*b.

2. Implementation of Lexical analysis
3. Write a Program for computation of FIRST AND FOLLOW of non-terminals.
4. Write a program to check whether a grammar is left recursive or not, if it is remove left
recursion.
5. Implementation of Predictive Parsing Table Construction
6. Implementation of Shift Reduce Parsing
7. Implementation of Operator Precedence Parsing
8. Implementation of LR Parsing
9. Implementation of Intermediate Code Generation
10. Implementation of Code Generation
requirement.
107
TECHNOLOGY
SEVENTH SEMESTER
Big Data Analytics

L T P C
Course Code: Big Data Analytics
3 1 0 4
BTAIS701
COURSE OBJECTIVES
 To Understand the Big Data Platform and its Use cases
 To Provide an overview of Apache Hadoop
 To Provide HDFS Concepts and Interfacing with HDFS
COURSE OUTCOMES
 Interpret the concepts of big data management and its associated applications in
intelligent business and scientific computing.
 Develop big data solutions using hadoop ecosystem.
 Discuss applications using Map Reduce Concepts
UNIT I : INTRODUCTION TO BIG DATA AND HADOOP

Types of Digital Data, Introduction to Big Data, Big Data Analytics, History of Hadoop, Apache
Hadoop, Analyzing Data with Unix tools, Analyzing Data with Hadoop, Hadoop Streaming,
Hadoop Eco System, IBM Big Data Strategy, Introduction to Infosphere BigInsights and Big
Sheets.
UNIT II : HDFS(Hadoop Distributed File System)

The Design of HDFS, HDFS Concepts, Command Line Interface, Hadoop file system interfaces,
Data flow, HADOOP Architecture: Architecture, Storage, Task trackers, Hadoop Configuration.
UNIT III : Map Reduce

Anatomy of a Map Reduce Job Run, Failures, Job Scheduling, Shuffle and Sort, Task
Execution, Map Reduce Types and Formats, Map Reduce Features.
UNIT IV: NOSQL Data Management for Big Data and Visualization
NoSQL Databases: Schema-less Models‖: Increasing Flexibility for Data Manipulation-Key
Value Stores Document Stores, Tabular Stores, Object Data Stores, Graph Databases Hive,
Sharding,
Hbase – Analyzing big data with twitter ,Big data for E-Commerce Big data for blogs.
108
TECHNOLOGY
UNIT V: Data Analytics with R Machine Learning

Introduction, Supervised Learning, Unsupervised Learning, Collaborative Filtering. Big Data
Analytics with BigR.
Text Books:
1 Tom White “ Hadoop: The Publications, CRC press (2013) Definitive Guide” Third Edit
on, O‟reily Media, 2012.
2 Seema Acharya, Subhasini Chellappan, "Big Data Analytics" Wiley 2015.
Reference Books:
1 Michael Berthold, David J. Hand, "Intelligent Data Analysis”, Springer, 2007.

2 Jay Liebowitz, “Big Data and Business Analytics” Auerbach
109
TECHNOLOGY
SEVENTH SEMESTER
Deep Learning
L T P C
Course Code: Deep Learning
3 1 0 4
BTAIS702
COURSE OBJECTIVES
 To understand deep learning techniques and computing environment that are suitable for
the applications under consideration
 To cover the fundamentals of neural networks as well as some advanced topics such as
recurrent neural networks, long short term memory cells and convolutional neural
networks.
COURSE OUTCOMES
 Explain the theory behind deep learning methods such as Convolutional Neural
Networks, Autoencoders etc.
 Discuss open issues and trends in deep learning research
 Apply deep recurrent and memory network on sequential data.
UNIT I
Introduction
History of Deep Learning, Deep Learning Success Stories, Feedforward Neural networks.
Gradient descent and the backpropagation algorithm. Unit saturation, aka the vanishing gradient
problem, and ways to mitigate it. RelU Heuristics for avoiding bad local minima. Heuristics for
faster training. Nestors accelerated gradient descent. Regularization. Dropout.
UNIT II
Convolutional Neural Networks
Architectures, convolution / pooling layers, LeNet, AlexNet, ZF-Net, VGGNet, GoogLeNet,

ResNet, Object Detection, RCNN, Fast RCNN, Faster RCNN, YOLO
UNIT III
Recurrent Neural Networks:
LSTM, GRU, Encoder Decoder architectures,
110
TECHNOLOGY
Deep Unsupervised Learning
Autoencoders (standard, sparse, denoising, contractive, etc), Variational Autoencoders,

Adversarial Generative Networks, Autoencoder and DBM, Attention and memory models,
Dynamic memory networks
UNIT IV
Applications of Deep Learning to Computer Vision
Image segmentation, object detection, automatic image captioning, Image generation with
Generative adversarial networks, video to text with LSTM models. Attention models for
computer vision tasks.
UNIT V
Applications of Deep Learning to NLP
Word Vector Representations: Continuous Skip-Gram Model, Continuous Bag-of Words model
(CBOW), Glove, Evaluations and Applications in word similarity, analogy reasoning, Named
Entity Recognition, Opinion Mining using Recurrent Neural Networks, Parsing and Sentiment
Analysis using Recursive Neural Networks, Sentence Classification using Convolutional Neural
Networks, Dialogue Generation with LSTMs.
Text Books:
1. Bengio, Yoshua, Ian J. Goodfellow, and Aaron Courville. "Deep learning." An MIT Press
book in preparation. (2015)
2. Bengio, Yoshua. "Learning deep architectures for AI." Foundations and trends in Machine
Learning 2.1 (2009)
3. Hochreiter, Sepp, and Jargen Schmidhuber. "Long short-term memory." Neural computation
9.8 (1997)
Reference Books:
1. Jon Krohn, “Deep Learning for Natural Language Processing: Applications of Deep Neural
Networks to Machine Learning Tasks by Pearson Learn IT”, Addison-Wesley Professional
(2017)
2. Sudharsan Ravichandran “Hands-On Deep Learning Algorithms with Python” Packt
Publishing Limited (2019)
111
TECHNOLOGY
SEVENTH SEMESTER
Big Data Analytics Lab

L T P C
Course Code: Big Data Analytics Lab
0 0 4 2
BTAIS706
COURSE OBJECTIVES
 To introduce the tools required to manage and analyze big data like Hadoop, Map-Reduce.
 To Interpret business models and scientific computing paradigms, and apply software tools for
big data analytics
COURSE OUTCOMES
 Interpret business models & scientific computing paradigms, and apply software tools for big
data analytics.
 Analyze fundamental enabling techniques and scalable algorithms like Hadoop, Map Reduce
and NO SQL in big data analytics.
LIST OF EXPERIMENTS
1. Installation of HADOOP.
2. Installation of HADOOP in different modes.
3. Perform file management tasks in HADOOP.
4. Write a Word Count Map Reduce program to understand Map Reduce Paradigm.
5. Write Weather Report POC-Map Reduce Program to analyze time-temperature statistics and
generate report with max/min temperature.
6. Implement matrix multiplication with Hadoop Map Reduce
7. To perform NoSQL database using mongodb to create, update and insert.
8. Installation of Hive
9. To study and create database, tables using Hive
10. To study and create views, functions and indexes on Hive
112
TECHNOLOGY
SEVENTH SEMESTER
Deep Learning Lab

L T P C
Course Code: Deep Learning Lab
0 0 4 2
BTAIS707
COURSE OBJECTIVES
 To understand deep learning techniques and computing environment that are suitable for
the applications under consideration
 To cover the fundamentals of neural networks as well as some advanced topics such as
recurrent neural networks, long short term memory cells and convolutional neural
networks.
COURSE OUTCOMES
 Discuss mechanics of deep learning algorithms and why they work so well.
 Analyse fully connected neural networks, convolutional neural networks, and recurrent
neural networks.
 Apply deep learning algorithms with Pytorch to solve real world problems.
List of Experiments
1. Study of GPU with Pytorch

2. Study of improving the accuracy of our neural network by adding depth
3. Study of Max Pooling and Convolution Layers with practical examples.
4. Train a deep neural network with a GPU.
5. Train a simple Convolutional Neural Network (CNN) to classify CIFAR or any dataset
images using tensorflow.
6. Implement from scratch a 10-layer convolutional neural network for image recognition
and obtain results which are not far from the state-of-the-art.
7. Implement from scratch a recurrent neural network with LSTM cells for a language
modeling task. Then we will ask the network to complete sentences or to generate text.
113
TECHNOLOGY
PROGRAM
ELECTIVES
114
TECHNOLOGY
FOURTH SEMESTER
Advanced Algorithms
L T P C
Course Code: Advanced Algorithms
3 1 0 4
BTAIE412
COURSE OBJECTIVES
 To introduce advanced algorithms, programming techniques necessary for developing
sophisticated computer application programs.
 Introduce students to the advanced methods of designing and analyzing algorithms
 The student should be able to choose appropriate algorithms and use it for a specific
problem.
COURSE OUTCOMES
 Apply and implement the advanced algorithm to solve real life problem.
 Discuss recent activities in the field of the advanced data structure.
UNIT I
Design Paradigms: Overview of Divide and Conquer, Greedy and Dynamic Programming
strategies. Basic search and traversal techniques for graphs, Backtracking, Branch and Bound.
UNIT II
Weighted Graphs: Single-Source Shortest Paths, All-Pairs Shortest Paths, Minimum Spanning
Trees. Network Flow and Matching: Flows and Cuts, Maximum Bipartite Matching, Minimum-
Cost Flow.
UNIT III
Text Processing: Strings and Pattern Matching Algorithms, Tries, Text Compression, Text
Similarity Testing.
UNIT IV
Number Theory and Cryptography: Fundamental Algorithms involving numbers, Cryptographic

Computations, Information Security Algorithms and Protocols.
115
TECHNOLOGY
UNIT V
Computational Geometry: Range Trees, Priority Search Trees, Quad trees and k-D Trees,
Convex Hulls.
Text Books:
1. E Horowitz S Sahani, S Rajasekaran, “Computer Algorithms”, Second Edition, Silicon

Press, 2007.
2. Cormen, Lieserson, Rivest “Introduction to Algorithms”, 2nd Edition, MIT Press, 2009.
Reference Books:
1. M T Goodrich, R Tomassia. “Algorithm Design – Foundations, Analysis, and Internet

Algorithms”, John Wiley, 2006.
2. Aho, A V Hopcraft, Ullman J D, “The Design and Analysis of Computer Algorithms”,
Pearson Education, 2007.
116
TECHNOLOGY
FOURTH SEMESTER
Digital communication
L T P C
Course Code: Digital communication
3 1 0 4
BTAIE414
COURSE OBJECTIVES
 To understand basic digital communication systems theory and design implementation.
 To carry out research and innovation through lifelong learning adapting to technological
changes in modern digital communications.
COURSE OUTCOMES
 Identify and describe various techniques in modern digital communications.
 Discuss and encourage the fact that the implementation and development of modern
communication technology requires mathematical modeling and problem solving.
UNIT I
Introduction to communication signals and systems, Low pass and Band pass representation of
signals, Signal space representation, Gram-Schmidt orthogonalization procedure.
UNIT II
Digital Modulation Techniques: Baseband modulation- Pulse amplitude modulation (binary and
M-ary PAM, QAM) Bandpass modulation (M-ary ASK, PSK, FSK, DPSK), Continuous phase
modulation (QPSK and variants, MSK, GMSK), Power spectral density of baseband and band
pass signals.
UNIT III
Demodulation and detection: Optimum receiver: Matched filter demodulator, Correlator

demodulator, Binary Detection, Optimum rule for ML and MAP detection, Performance, Bit-
error-rate, symbol error rate for coherent and non-coherent schemes. M-ary detection, 4-PAM,
QPSK and M-ary PAM detection, Gray coding.
117
TECHNOLOGY
UNIT IV
Baseband signaling, Inter symbol interference, Pulse shape design for channels with ISI, Nyquist
pulse, Partial response signaling (duo-binary and modified duo-binary pulses), Equalization
techniques, Linear and Non-linear equalizers
UNIT V
Special modulation techniques: Spread Spectrum Modulation, OFDM modulation, Trellis coded
modulation.
Text Books:
1. S. R.N.Mutagi, “Digital Communication, Theory, Techniques and Applications”, Oxford

University Press, Nov 2011
2. J.M.Wozencraft, and I.M.Jacobs, “Principles of Communication Engineering”, Wiley,
NY 1965.
Reference Books:
1. H. M. K. Simon, S. M. Hinedi and W. C. Lindsey, “Digital Communication Techniques:

Signaling and detection”, Prentice Hall India, N. Delhi, 1995.
2. E.A.Lee, D.G.Messerschmitt, “Digital Communication”, Kluwer Academic Publishers
118
TECHNOLOGY
FOURTH SEMESTER
Embedded Systems
L T P C
Course Code: Embedded Systems
3 1 0 4
BTAIE411
COURSE OBJECTIVES
 To provide students the basic knowledge of Embedded System, it‟s components,
architecture and application.
 To develop the understanding of application of embedded system in present scenario.
COURSE OUTCOMES
 Explain the basic concept of embedded system and new technological advancement in the
area.
 Identify and use the different components of embedded systems in this era of smart
applications.
UNIT I
Introduction, Characteristics of Embedding Computing Applications, Challenges in Embedded

System Design, Embedded System Architecture, Basics Of Embedded System, Application of
ES, Examples of ES.
UNIT II
Introduction to Microcontroller, Basics of Programming Language, Programming in C,

Programming in Assembly Language, Python Programming.
UNIT III
Components of Embedded System:- Hardware components like power supply, processor,

memory, communication ports, input, output etc. and software components like assembler,
emulator, debugger and compiler.
UNIT IV
New technologies and sensors:- – RFID, GSM, GPS, BLUETOOTH, DTMF, RF,
ULTRASONIC SENSOR, ACTUATORS- Different types, Examples, Electrical actuators,
Application of actuators.
119
TECHNOLOGY
UNIT V
Case study: Embedded systems in automobile, smart city using embedded systems, smart home,
smart card etc.
Text Books:
1. Embedded Systems Architecture Programming and Design by Raj Kamal, II edition, Tata
MC Graw-Hill.
2. Designing Embedded Systems with PIC Microcontrollers: principles and applications by
Tim Wilmshurst, Elsevier.
Reference Books:
1. Embedded Systems Design by Steve Heath, II edition, Newnes publications

2. Embedded Systems Architecture: A Comprehensive Guide for Engineers and
Programmers by Tammy Noergaard, Elsevier.
120
TECHNOLOGY
FOURTH SEMESTER
Graph Theory
Graph Theory L T P C
Course Code:
3 1 0 4
BTAIE409
COURSE OBJECTIVES
 To familiar with the most fundamental Graph Theory concepts.
 To formulate and prove central theorems about trees, matching, connectivity, colouring
and planar graphs.
 To use graph theory as a modelling tool

COURSE OUTCOMES
 Write precise and accurate mathematical definitions of objects in graph theory.
 Apply and describe some basic algorithms for graphs
 Identify and use a combination of theoretical knowledge and independent mathematical
thinking in creative investigation of questions in graph theory.
UNIT I
Introduction: Graphs, Types of Graphs, Isomorphism, Sub graphs, Walks, Paths, Circuits
,Components, Euler graphs, Hamiltonian paths and circuits , Trees, Properties of trees, Distance
and centers in tree , Rooted and binary trees.
UNIT II
Trees, connectivity & planarity: Spanning trees , Fundamental circuits , Spanning trees in a
weighted graph , cut sets , Properties of cut set, All cut sets , Fundamental circuits and cut sets,
Connectivity and separability , Network flows , 1-Isomorphism , 2-Isomorphism ,
Combinational and geometric graphs , Planer graphs, Different representation of a planer graph.
UNIT III
Matrices, colouring and directed graph: Chromatic number, Chromatic partitioning,

Chromatic polynomial,Matching, Covering, Four color problem, Directed graphs, Types of
directed graphs, Digraphs and binary relations, Directed paths and connectedness, Euler graphs.
121
TECHNOLOGY
UNIT IV
Permutations & combinations: Fundamental principles of counting, Permutations and

combinations, Binomial theorem, combinations with repetition, Combinatorial numbers,
Principle of inclusion and exclusion, Derangements, Arrangements with forbidden positions.
UNIT V
Generating functions: Generating functions, Partitions of integers, Exponential generating

function, Summation operator, Recurrence relations, First order and second order, Non-
homogeneous recurrence relations, Method of generating functions.
Text Books:
1. Narsingh Deo, “Graph Theory: With Application to Engineering and Computer Science”,
Prentice Hall of India, 2003.
2. Grimaldi R.P. “Discrete and Combinatorial Mathematics: An Applied Introduction”,
Addison Wesley, 1994.
Reference Books:
1. Clark J. and Holton D.A, “A First Look at Graph Theory”, Allied Publishers, 1995.
2. Mott J.L., Kandel A. and Baker T.P. “Discrete Mathematics for Computer Scientists and
Mathematicians” , Prentice Hall of India, 1996.
3. Liu C.L., “Elements of Discrete Mathematics”, Mc Graw Hill, 1985.
4. Rosen K.H., “Discrete Mathematics and Its Applications”, Mc Graw Hill, 2007.
122
TECHNOLOGY
FOURTH SEMESTER
Principles of Programming Languages

L T P C
Course Code: Principles of Programming Languages
3 1 0 4
BTAIE413
COURSE OBJECTIVES
 To provide students the general concepts common to all programming languages so as to
facilitate learning new languages.
 To understand and explain syntax and semantics of programming languages.
 To develop programs in non-procedural programming paradigms.
COURSE OUTCOMES
 Discuss the key ideas which help in implementation of common characteristics of
programming languages.
 Develop program in different programming language and evaluate their comparative
assistances.
UNIT I
Introduction Syntax and semantics: Evolution of programming languages, describing syntax,

context, free grammars, attribute grammars, describing semantics, lexical analysis, parsing,
recursive – decent bottom-up parsing, data, data types, basic statements
UNIT II
Subprograms and implementations: Subprograms, design issues, local referencing, parameter

passing, overloaded methods, generic methods, design issues for functions, the semantics of call
and return, implementing simple subprograms, stack and dynamic local variables, nested
subprograms, blocks, dynamic scoping.
UNIT III
Object- orientation, concurrency, and event handling: Object – orientation, design issues for
OOP languages, implementation of object, oriented constructs, concurrency, semaphores,
Monitors, message passing, threads, statement level concurrency, exception handling, event
handling.
123
TECHNOLOGY
UNIT IV
Functional programming languages: Introduction to lambda calculus, fundamentals of functional

programming languages, Lambda calculus- Lambda expressions, Variables, Substitutions,
Arithmetic, Conditionals, Recursion, Lambda reduction, Type assignment, Polymorphism,
Lambda calculus and computability Programming with Scheme, Programming with ML
UNIT V
Logic programming languages: Introduction to logic and logic programming, – Programming

with Prolog, multi-paradigm languages, Prolog- Syntax, Lists, Operators and arithmetic, Control,
I/O, data structures.
Text Books:
1. S. Robert W. Sebesta, “Concepts of Programming Languages”, Tenth Edition, Addison

Wesley, 2012.
2. Programming Languages, Principles & Paradigms, 2ed, Allen B Tucker, Robert E
Noonan, TMH
3. R. Kent Dybvig, “The Scheme programming language”, Fourth Edition, MIT Press,
2009.
Reference Books:
1. H. Jeffrey D. Ullman, “Elements of ML programming”, Second Edition, Prentice Hall,

1998.
2. Richard A. O‟Keefe, “The craft of Prolog”, MIT Press, 2009.
3. W. F. Clocksin and C. S. Mellish, “Programming in Prolog: Using the ISO Standard”,
Fifth Edition, Springer, 2003.
124
TECHNOLOGY
FOURTH SEMESTER
Software Engineering
L T P C
Course Code: Software Engineering
3 1 0 4
BTAIE410
COURSE OBJECTIVES
 To introduce advanced algorithms, programming techniques necessary for developing
sophisticated computer application programs.
 Introduce students to the advanced methods of designing and analyzing algorithms
 The student should be able to choose appropriate algorithms and use it for a specific
 problem.
COURSE OUTCOMES
 Apply the concepts and choose an appropriate SDLC process model for user
requirements.
 Analyze requirement techniques like Data flow diagram, Entity relationship diagram etc.
 Demonstrate various testing methodologies and debugging tools for prototype software.
UNIT I
Introduction:
Introduction of Software (SW), Type of Software, SW Components: Process, People, Project,

Product, Software crisis, Software Process Models: Details of People involve in each Process,
SDLC methods/models: Build & Fix, Waterfall, Prototype (Evolutionary & Throw-away),
Iterative, Incremental iterative, Spiral, RAD, Agile methodology
UNIT II
Requirement Analysis & Specifications:
Requirement Analysis, Requirement Specification, Approaches to Requirement analysis,

Specifying Behavioural & Non-Behavioural Requirements, SRS Components & various User‟s
of SRS. Introduction of Requirement Specification: Dataflow(DF) Diagram, Data dictionaries,
Entity-Relationship (ER) diagram, Object Diagram etc., Requirement Validation.
125
TECHNOLOGY
UNIT III
Software Design and Testing:
Design Architecture and Patterns, Modularity, Function oriented design, Object Oriented Design,
Software Testing: Software Testing Strategy and Techniques, Functional testing, Structural
testing, Debugging and testing tools.
UNIT IV
SW/HW reliability, Reliability concepts and models, Reliability allocation, Software

Maintenance: Introduction to SW Maintenance and types, SW Maintenance models: Re-
engineering & Forward Engineering.
UNIT V
Software Project Planning:
Role of Software Project Planning, Estimation method, Estimation of Effort & Schedule,
Software Metrics: Introduction to Size metrics, Data structure metrics, information flow metrics,
entropy-based measures, metric analysis. Basic COCOMO, Intermediate COCOMO, Detailed
COCOMO, Quality Planning, Planning Parameter, Quality Defect Removal Cycle, Role of Risk
Analysis.
Text Books:
1. R.S. Pressman, Software Engineering – A Practitioner‟s Approach, 6th Edition, TMH, 2013.
2. Ian Sommerville, Software Engineering, 8th Edition, Addison Wesley, 2009.
.Reference Books:
1. Pankaj Jalote, An Integrated Approach to Software Engineering, Narosa Publishing, 2010.
2. K.K.Aggarwal, Yogesh Singh: Software Engineering, New Age International Ltd, 2001
126
TECHNOLOGY
FIFTH SEMESTER
Advanced operating Systems

L T P C
Course Code: Advanced operating Systems
3 1 0 4
BTAIE512
COURSE OBJECTIVES
 To provide students the basic knowledge of various modules of an operating system.
 To provide knowledge of functionality system calls related to files, processes, signals,
semaphores etc., stored in operating systems.
COURSE OUTCOMES
 Compare and Contrast the most common designs of operating system
 Identify the performance issues that batch systems, interactive systems, and real-time
systems have to address.
 Discuss the performance challenges of distributed operating systems.
UNIT I
Introduction: Functions of operating systems, Design approaches: layered ,kernel based and
virtual machine approach, why advanced operating systems, types of advanced operating
systems
UNIT II
Distributed Operating Systems : Architecture of distributed operating systems, system

architecture types, issues in distributed operating systems, inherent limitation of distribute
systems, distributed mutual exclusion: classification of mutual exclusion algorithms, Lamport‟s
,token based algorithm, Suzuki-Kasami‟s Broadcast algorithm, Raymond‟s Tree based
algorithm, Distributed deadlock detection, Distributed file systems, Distributed shared memory,
Distributed scheduling
UNIT III
Multiprocessor Operating Systems Introduction, structure of multiprocessor operating system,

operating system design issues, threads, the test and set instruction, the swap instruction,
implementation of the process wait , processor scheduling, reliability and fault tolerance.
127
TECHNOLOGY
UNIT IV
Real Time Operating System Introduction to Real time systems and Real Time Operating
Systems, Characteristics of Real Time operating Systems, Classification of Real Time Operating
Systems, Services, structure, goal and feature of RTOS, architecture of RTOS, micro kernels and
monolithic kernels, tasks in RTOS, Performance measures, estimating program runtimes, task
assignment, scheduling in RTOS, rate monotonic scheduling, priority inversion, task
management, inter task communication, applications of various RTOS.
UNIT V
Data base operating System: Introduction to database operating systems, concurrency control:
theoretical aspect, distributed database system, concurrency control algorithms
Mobile Operating System: Symbian O.S.: introduction, kernel design in Symbian OS,
scheduling in Symbian OS, File systems on mobile phones, I/O in Symbian OS, Application
development using Android.
Text Books:
1. M Singhal and NG Sivaratri, Advanced Concepts in Operating Systems, Tata McGraw Hill
Inc., 2001 2.
2. A.S. Tanenbaum, Distributed Operating system, Pearson Education Asia, 2001.
3. A.S. Tanenbaum, Modern Operating system, Prentice Hall, 3rd edition.
4. Real Time Operating System, Barr M
Reference Books:
1. SILBERSCHATZ and P. GALVIN, Operating System Concepts, VI edition, Addison

Wesley 2004.
128
TECHNOLOGY
FIFTH SEMESTER
Computer Graphics
L T P C
Course Code: Computer Graphics
3 1 0 4
BTAIE511
COURSE OBJECTIVES
 To provide students the basic introduction to the theory and practice of computer
graphics.
 To provide knowledge of functionality in mathematics including familiarity with the
theory and use of coordinate geometry and of linear algebra such as matrix
multiplication.
COURSE OUTCOMES

 Define the core concepts of computer graphics.
 Compare various algorithms which provide knowledge about line plotting.
 Discuss various 2D and 3D objects transformation techniques.
UNIT I
BASIC OF COMPUTER GRAPHICS: Basic of Computer Graphics, Applications of computer

graphics, Display devices, Random and Raster scan systems, Graphics input devices, Graphics
software and standards
UNIT II
GRAPHICS PRIMITIVES: Points, lines, circles and ellipses as primitives Straight Line, DDA
algorithm, Bresenham's Line Algorithm, Circle- Mid Point Circle Algorithm, polygon filling
algorithms- boundary fill, scan-line algorithm, inside-outside test, boundary and flood-fill
UNIT III
2D TRANSFORMATION: Transformations (translation, rotation, scaling), matrix

representation, homogeneous coordinates, composite transformations, reflection and shearing,
viewing pipeline and coordinates system, window-to-viewport transformation, clipping including
point clipping, line clipping (Cohen-Sutherland, Liang- Bersky, NLN), polygon clipping
129
TECHNOLOGY
UNIT IV
3D CONCEPTS AND TECHNIQUES: 3D display techniques, 3D Transformations, 3D

modelling schemes, Projection-parallel projections, perspective projection, Visible Surface
Detection- Hidden Surface removal Algorithms-scan line method, Z-buffer method
UNIT V
COLOUR ILLUMINATION METHODS: Color properties of light, XYZ, RGB, YIQ and CMY
color models, Specular reflection, Visible surface detection concepts, Back-Face detection,
Depth buffer method, Illumination, Light Sources, Illumination Methods
Text Books:
1. Donald Hearn, M. Pauline Baker, Computer Graphics, 2nd edition, C version, Prentice
Hall, 1996.
2. Principles of Interactive Computer Graphics – By Newman & Sproull.
Reference Books:
1. Computer Graphics for Scientists and Engineers – By Asthana and Sinha.

2. James D. Foley, Andries van Dam, Steven K. Feiner, John F. Hughes, Computer
Graphics: Principles & Practices, Addison Wesley Longman, 2nd edition in C, 1994.
130
TECHNOLOGY
FIFTH SEMESTER
Cryptography and Network security

L T P C
Course Code: Cryptography and Network Security
3 1 0 4
BTAIE513
COURSE OBJECTIVES
 To understand Cryptography Theories, Algorithms and Systems.

 To understand necessary Approaches and Techniques to build protection mechanisms in order to
secure computer networks.
COURSE OUTCOMES
 Compare various Cryptographic algorithms.
 Classify various security threats and develop a security model to prevent, detect and recover from
the attacks.
UNIT I
INTRODUCTION: Need for Security, Security attacks, Security Services – Confidentiality,
Integrity, Availability, Information Security, Classical encryption techniques: substitution
techniques, transposition techniques, steganography- Foundations of modern cryptography:
perfect security, information theory, product cryptosystem, cryptanalysis.
UNIT II
SYMMETRIC KEY CRYPTOGRAPHY: Algebraic structures – Modular arithmetic, Euclid‟s
algorithm, Congruence and matrices, Symmetric key ciphers: DES, Block cipher Principles of
DES, Strength of DES, Differential and linear cryptanalysis, Block cipher design principles,
Block cipher mode of operation, Evaluation criteria for AES , Advanced Encryption Standard –
RC4 , Key distribution.
UNIT III
PUBLIC KEY CRYPTOGRAPHY: Primes, Primality Testing, Factorization, Euler„s totient
function, Fermat„s and Euler„s Theorem, Chinese Remainder Theorem, Exponentiation and
logarithm, Asymmetric key ciphers: RSA cryptosystem, Key distribution, Key management,
Diffie Hellman key exchange, ElGamal cryptosystem, Elliptic curve arithmetic, Elliptic curve
cryptography.
131
TECHNOLOGY
UNIT IV
MESSAGE AUTHENTICATION AND INTEGRITY : Authentication requirement,
Authentication function, MAC, Hash function, Security of hash function and MAC, SHA ,
Digital signature and authentication protocols, DSS, Entity Authentication: Biometrics,
Passwords, Challenge Response protocols, Authentication applications, Kerberos, X.509
UNIT V
SECURITY PRACTICE AND SYSTEM SECURITY: Electronic Mail security, PGP, S/MIME,
IP security, Web Security, System Security: Intruders, Malicious software, viruses, Firewalls.
Text books:
1. Stallings, W., “Cryptography and Network Security: Principles and Practice”, 4th Ed.,
Prentice-Hall, 2006
2. Forouzan, B.A., “Cryptography and Network Security”, Tata McGraw-Hill, 2007
References:
1. Information Systems Security: Security Management, Metrics, Frameworks and Best Practices
by Nina Godbole
2. Network Security Bible by Eric Cole
3. Schneier, B., “Applied Cryptography”, 2nd Ed., Wiley & Sons. 2002 4. Kaufman, C.,
Perlman, R. and Speciner, M., “Network Security”, Prentice-Hall. 2002.
4. Marchette, D. J., “Computer Intrusion Detection and Network Monitoring: A Statistical
Viewpoint”, Springer.
5. Cryptography and Security by C K Shyamala, N Harini and Dr T R Padmanabhan – Wiley
Publications, First Edition
132
TECHNOLOGY
FIFTH SEMESTER
Distributed Systems
L T P C
Course Code: Distributed Systems
3 1 0 4
BTAIE510
COURSE OBJECTIVES
 To understand the knowledge of operating system and sequential program design.
 To design and create fault tolerant and efficient distributed algorithms to solve large
problems.
COURSE OUTCOMES
 Explain the models for distributed processing and communication.

 Identify the challenges in designing distributed systems.
 Develop distributed programs using sockets and RPC/RMI
UNIT I
Introduction to distributed Systems, Goal, Advantages over centralized systems, Organization of

multiprocessor systems, Hardware/software concepts, Review of layered protocols.
UNIT II
Client/Server Model, Microkernel, Inter-process and inter-node communication using Sockets –

connection oriented and connection-less, RPC (Remote Procedure Calls), RMI (Remote Method
Invocation), Distributed algorithms, Time stamping, Circulating tokens, Diffusing computations.
UNIT III
Mutual Exclusion Algorithm, Election algorithm, Detecting loss of tokens and regeneration,
Distributed deadlock detection algorithms, Distributed termination algorithms.
UNIT IV
Distributed File System Design and Implementation - NFS, Andrew File Systems and HDFS,
File Replication, Semantics of file sharing, Remote access methods, Fault tolerant issues, Voting
techniques, Introduction to distributed operating systems.
133
TECHNOLOGY
UNIT V
Introduction to Distributed Operating Systems, Motivations, Management systems, Levels of

distribution transparency, Architecture, Introduction to concurrency control.
Text Books:
1. George Coulouris and Jean Dollimore, and Tim Kindberg, "Distributed System Concepts
and Design", 4th Edition, Addison Wesley.
2. A. S. Tanenbaum, "Distributed Operating Systems", Prentice Hall.
Reference Books:
1. S. Ceri and G.Pelagatti, "Distributed Databases - Principles and Systems", McGraw Hill.
134
TECHNOLOGY
FIFTH SEMESTER
Parallel and Distributed Algorithms

L T P C
Course Code: Parallel and Distributed Algorithms
3 1 0 4
BTAIE514
COURSE OBJECTIVES
 To learn fundamental concepts, techniques and tools of parallel and distributed
algorithms.
 To study the complexity and correctness models for parallel algorithms and distributed
file systems.
COURSE OUTCOMES
 Utilize the knowledge of algorithms in the development of parallel applications.
 Apply knowledge of parallel and distributed computing techniques to solve problem.
 Analyze performance and properties such as efficiency, speedup etc., of various
algorithms.
UNIT I
Introduction to Parallel Computing, Parallel Architecture, Architectural Classification Scheme,

Performance of Parallel Computers, Performance Metrics for Processors, Parallel Programming
Models, Parallel Algorithms.
UNIT II
Introduction to Pipeline Processing, Pipeline Performance, Arithmetic Pipelines, Pipelined

Instruction Processing, Pipeline Stage Design, Hazards, Dynamic Instruction Scheduling,
Synchronous Parallel Processing, Example-SIMD Architecture and Programming Principles,
SIMD Parallel Algorithms.
UNIT III
Definition, Issues, Goals, Types of distributed systems, Distributed System Models, Hardware
concepts, Software Concept, Models of Middleware, Services offered by middleware, Client
Server model, Remote Procedure Call, Remote Object Invocation, Message Oriented
Communication, Stream Oriented Communication.
135
TECHNOLOGY
UNIT IV
Clock Synchronization, Logical Clocks, Election Algorithms, Mutual Exclusion, Distributed

Mutual Exclusion-Classification of mutual Exclusion Algorithm, Requirements of Mutual
Exclusion Algorithms, Non Token based Algorithms: Lamport Algorithm, Ricart–Agrawala‟s
Algorithm, Token Based Algorithms: Suzuki-Kasami‟s Broardcast Algorithms, Singhal‟s
Heurastic Algorithm.
UNIT V
Introduction to Data-Centric and Client-Centric Consistency Models, Replica Management,

Distributed File Systems, good features of DFS, File models, File Accessing models, File-
Caching Schemes, File Replication, Network File System (NFS), Andrew File System (AFS),
Hadoop Distributed File System and Map Reduce.
Text Books:
1. Parallel Programming, Barry Wilkinson, Michael Allen, Pearson Education, 2nd Edition.
2. Introduction to Parallel Programming - By Steven Brawer.
3. Introduction to Parallel Computing, Ananth Grama, Anshul Gupta, George Karypis,
Vipin Kumar, By Pearson Publication.
Reference Books:
1. Introduction to Parallel algorithms by Jaja from Pearson, 1992.

2. Introduction to Parallel Processing – By M.Sasikumar, Dinesh Shikhare And P. Ravi
Prakash.
136
TECHNOLOGY
FIFTH SEMESTER
Theory of Computation
L T P C
Course Code: Theory of Computation
3 1 0 4
BTAIE509
COURSE OBJECTIVES
 Create problem-solving abilities using mathematical theories.
 Design and interpret finite automata
 Analyze the mathematical tools including grammar and Turing machines.
COURSE OUTCOMES
 Utilize basic knowledge of Theory of Computation in the computer field to solve
computational problems
 Design, analyze and interpret regular expression
UNIT I
Finite Automata Introduction, basic mathematical notation and techniques, finite state systems,
basic definitions; Finite Automaton: DFA & NDFA, a finite automaton with €- moves, regular
languages, regular expression, equivalence of NFA and DFA, equivalence of NDFA‟s with and
without €-moves, equivalence of finite automaton and regular expressions, minimization of
DFA, Pumping Lemma for regular sets.
UNIT II
Introduction of grammar, types of grammar, context-free grammars and languages, derivations

and languages, ambiguity, relationship between derivation and derivation trees; Simplification of
CFG: elimination of useless symbols, unit productions & null productions; Greibach normal
form, Chomsky normal form.
UNIT III
Pushdown Automata definitions, moves, instantaneous descriptions, deterministic pushdown

automata, equivalence of pushdown automata, and CFL, Pumping Lemma for CFL.
UNIT IV
137
TECHNOLOGY
Definitions of Turing machines, models, computable languages and functions, techniques for
Turing machine construction, multi-head and multi tape Turing machines, halting problem, and
partial solvability.
UNIT V
Unsolvable problems and computable functions, primitive recursive functions, recursive and
recursively enumerable languages, universal Turing machine Complexity: tractable and
intractable problems, P and NP-completeness, polynomial-time reductions.
Text Books:
1. Hopcraft J.E, Motwani R., and Ullman J.D, “Introduction to Automata Theory, Languages and
computations”, second edition, Pearson Education.
2. John C Martin, “Introduction to languages and theory of computation “, Third Edition, Tata
McGraw Hill Publishing company, New Delhi.
3. K.L.P Mishra and N Chandrasekaran, “Theory of computer science – Automata, Languages,

and computation” Third Edition –PHI.
Reference Books:
1. A. A. Putambakar, “Theory of computation”, First Edition Technical Publication.
2. Kamala Krithivasan and Rama R, “Introduction to Formal Languages, Automata Theory and
computation”, Person Education.
138
TECHNOLOGY
FIFTH SEMESTER
Computational Complexity
L T P C
Course Code: Computational Complexity
3 1 0 4
BTAIE517
COURSE OBJECTIVES
 To provide students the basic mathematical theory of analysing the hardness of
computational problems.
 To get familiar with basics of complexity classes.
COURSE OUTCOMES
 Divide problems into appropriate complexity classes.
 Determine whether a problem is computable, and prove that some problems are not
computable.
 Analyse optimization problems using the concept of interactive proofs.
UNIT I
INTRODUCTION: Introduction to Computational Complexity, Complexity Classes(NP, NP and

PSAPCE), Reductions, hardness, completeness, hierarchy, relationships between complexity
classes.
UNIT II
SPACE COMPLEXITY AND HIERARCHY THEOREMS: Circuit satisfiability, Savitch and

Immerman theorems, Karp Lipton Theorem. DSPACE[s], Linear Space Compression Theorem.
PSPACE, NPSPACE, PSPACE = NPSPACE, PSPACE-completeness. Quantified Boolean
Formula problem is PSPACE-complete, L, NL and NLcompleteness. NL=coNL. Hierarchy
theorems
UNIT III
Randomized Complexity classes, Randomized Polynomial Time (RP), Bounded Probabilistic

Polynomial Time (BPP), Zero-error Probabilistic Polynomial (ZPP), Adleman's theorem, Sipser
Gacs theorem, Randomized Reductions, Counting Complexity, Permanent‟s and Valiant‟s
Theorem.
139
TECHNOLOGY
UNIT IV
Parallel complexity, P-completeness, Sup-liner space classes, Renegold's theorem, Polynomial

hierarchy, Toda's theorem, Arthur Merlin games.
UNIT V
Optimization and approximation: Combinatorial optimization problems, Relative error, Bin-

packing problem, Polynomial and fully polynomial approximation schemes, Vertex cover,
traveling salesman problem, minimum partition.
Text Books:
1. Michael Sipser, Introduction to the Theory of Computation, (First edition - PWS

Publishing Company, January 1997, or second edition - Thomson Course Technology,
2005).
2. Computational Complexity: A Modern Approach, Sanjeev Arora and Boaz, Barak
Cambridge University Press, 2009.
3. Computational Complexity Papadimtriou C. H. Addison Wesley First Edition, 1993.
Reference Books:
1. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.

2. Approximation Algorithms Vazirani V. Springer First Edition, 2004
.
140
TECHNOLOGY
FIFTH SEMESTER
Linux Programming
Linux Programming L T P C
Course Code:
3 1 0 4
BTAIE520
COURSE OBJECTIVES
 To understand principles of operating system including File handling utilities, Security by
file permissions, Process utilities, Disk utilities, Networking Commands, Basic Linux
commands, Scripts and filters.
 To acquire knowledge about Inter process communication.
COURSE OUTCOMES

 Demonstrate various Linux commands that are used to manipulate system operations
 Design and develop Shell Programs using Linux commands
 Create IPC-API‟s that can be used to control various processes for synchronization.
UNIT I
Introduction: Linux, Linux utilities, History of LINUX, architecture of LINUX, features of

LINUX, introduction to vi editor, Linux Commands, file handling utilities, security by file
permissions, Disk utilities, Networking commands, Text Processing utilities and backup utilities
UNIT II
Introduction to Shells: Linux Session, Standard Streams, Redirection, Pipes, Tee Command,
Command Execution, Command-Line Editing, Quotes, Command Substitution, Job Control,
Aliases, Variables, Predefined Variables, Options, Shell/Environment Customization, Filters
UNIT III
Grep: Operation, grep Family, Searching for File Content, Sed- Scripts, Operation, Addresses,
commands, Applications of grep and sed.
Unix file structure: Introduction, inode (Index Node), file descriptors, system calls and device
drivers.
141
TECHNOLOGY
File Management :File Structures, System Calls for File Management – create, open, close, read,
write, lseek, link, symlink, unlink, stat, fstat, lstat, chmod, chown, Directory API – opendir,
readdir, closedir, mkdir, rmdir, umask.
UNIT IV
Process and signals: Process, process identifiers, process structure, process scheduling, zombie
processes, orphan process, fork, vfork, exit, wait, waitpid, exec, signals functions, unreliable
signals, interrupted system calls, kill, raise, alarm, pause, abort, system, sleep functions, signal
sets.
File locking: creating lock files, locking regions, use of read and write with locking, competing
locks, other lock commands, deadlocks.
UNIT V
Inter process communication: Pipe, process pipes, the pipe call, parent and child processes, and
named pipes: fifos, semaphores: semget, semop, semctl, message queues: msgget, msgsnd,
msgrcv, msgctl, shared memory: shmget, shmat, shmdt, shmctl, ipc status commands.
Introduction: Socket, socket connections - socket attributes, socket addresses, connect, bind,
listen, accept, socket communications
Text Books:
1. W. Richard. Stevens (2005), Advanced Programming in the UNIX Environment, 3rd edition,
Pearson Education, New Delhi, India
2. Unix and shell Programming Behrouz A. Forouzan, Richard F. Gilberg.Thomson
Reference Books:
1. Linux System Programming, Robert Love, O‟Reilly, SPD.

2. Advanced Programming in the UNIX environment, 2nd Edition, W.R.Stevens, Pearson
Education.
142
TECHNOLOGY
FIFTHSEMESTER
Optimization Techniques
L T P C
Course Code: Optimization Techniques
3 1 0 4
BTAIE516
COURSE OBJECTIVES
 To understand the Linear Programming problem.
 To learn the concept of various type of theories.
COURSE OUTCOMES
 Summarize the Sequencing problems & theories.

 Analyze and appreciate variety of performance measures for various optimization
problems.
 Solve and apply basic concepts of mathematics to formulate an optimization problem.
UNIT-I
LINEAR PROGRAMMING
Introduction, Formulation Of Linear Programming Problems Graphical Method Of Solution,
Some Exceptional Cases, Theory Of Simplex Method, Artificial Variable Technique Various
Methods & Special Cases In The Simplex Method.
UNIT-II
TRANSPORTATION MODEL
Definition to The Transportation Model, Matrix Terminology, Formulation And Solution Of The
Transportation Model, Variants In Transportation Problems, Addition Problems.
UNIT-III
ASSIGNMENT MODEL
Definition And Mathematical Representation Of The Assignment Model, Comparison With The
T.P, Formulation And Solution Of The Assignment Model, Variants In Assignment Problems,
Addition Problems.
143
TECHNOLOGY
UNIT-IV
REPLACEMENT THEORY
Replacement Of Item That Whose Maintenance And Repair Cost Increase With Time, Ignoring
Changes In The Value Of Money During The Period, Replacement Of Items That Fails
Suddenly, Group Replacement Theory.
UNIT-V
INVENTORY THEORY
Necessity For Maintaining Inventory, Inventory Cost, Inventory Control Problem, Various
Inventory Models With Deterministic Demand.
Text Book:
1. KantiSwarup “Operation Research” latest edition.
2. Hira& Gupta “Operation Research” 10 Edition 2007 .
Reference Books:
1. Gillet B.E. “Introduction to Operation Research” latest edition.
2. Taha,H.A. “Operation Research - an introduction” latest edition.
3. S.D.Sharma “Operation Research” latest edition.
144
TECHNOLOGY
FIFTH SEMESTER
Pattern Recognition
L T P C
Course Code: Pattern Recognition
3 1 0 4
BTAIE518
COURSE OBJECTIVES
 Understand the design and construction of a pattern recognition system
 Analyse the major approaches in statistical and syntactic pattern recognition
COURSE OUTCOMES
 Explain and define concepts of pattern recognition

 Find meaningful information from feature data
 Discuss and distinguish procedures, methods and algorithms related to pattern
recognition
UNIT I
Basics of Probability, Random Processes and Linear Algebra (recap): Probability: independence
of events, conditional and joint probability, Bayes theorem Random Processes: Stationary and
non-stationary processes, Expectation, Autocorrelation, Cross-Correlation, spectra.
UNIT II
Bayes Decision Theory, Discriminant Functions and Services, the Normal Distribution, Bayesian
Classification, Estimating Probability, Density Functions, Nearest Neighbor Rules, Bayesian
Networks. Gaussian mixture models, Expectation-Maximization method for parameter
estimation, Maximum entropy estimation.
UNIT III
Introduction to Pattern Recognition, Sequential Pattern Recognition- Hidden Markov Models

(HMMs), Discrete HMMs, Continuous HMMs, Nonparametric techniques for density
estimation. Parzen-window method. K-Nearest Neighbour method.
UNIT IV
Dimensionality reduction - The Curse of Dimensionality, Principal component analysis,. Fisher

discriminant analysis, Locally Linear Embedding. Clustering - K-Means, Expectation
145
TECHNOLOGY
Maximization, Mean Shift. Linear discriminant functions: Gradient descent procedures,
Perceptron, Support vector machines.
UNIT V
Artificial neural networks - Multilayer perceptron, feedforwark neural network, back

propogation algorithm. Non-metric methods for pattern classification - Non-numeric data or
nominal data. Decision trees - Classification and Regression Trees (CART).
Text Books:
1. R.O.Duda, P.E.Hart and D.G.Stork, Pattern Classification, John Wiley, 2001.

2. S.Theodoridis and K.Koutroumbas, Pattern Recognition, 4th Ed., Academic Press, 2009.
Reference Books:
1. C.M.Bishop, Pattern Recognition and Machine Learning, Springer, 2006.
146
TECHNOLOGY
FIFTH SEMESTER
Soft Computing Techniques

L T P C
Course Code: Soft Computing Techniques
3 1 0 4
BTAIE515
COURSE OBJECTIVES
 Develop the skills to gain a basic understanding of neural network theory and fuzzy logic
theory.
 Analyze the genetic algorithms and their applications.
COURSE OUTCOMES

 Compare different soft computing technique and their combinations.
 Design and implement algorithms for solving engineering and real life problems using
ANN, fuzzy logic and genetic algorithms.
UNIT I
INTRODUCTION: Introduction to soft computing, application areas of soft computing,

classification of soft computing techniques, structure & functioning of biological brain &
Neuron, and concept of learning/training. Model of an Artificial Neuron, transfer/activation
functions, perceptron, perceptron learning model, binary & continuous inputs, linear separability.
UNIT II
MULTILAYER NEURAL NETWORKS: Feed Forward network - significance, training, loss

function, Back-Propagation algorithm, convergence & generalization, momentum, applications.
Feedback network -Hopfield Nets: architecture, energy functions, training algorithms &
examples, competitive learning, self-organizing maps, Introduction to CNN and RNN network.
UNIT III
FUZZY SYSTEMS: fuzzy set theory, fuzzy sets and operations, membership functions, concept
of fuzzy relations and their composition, concept of fuzzy Measures. Fuzzy logic: fuzzy rules,
inferencing. Fuzzy Control system: selection of membership functions, Fuzzyfication, rule based
design & inferencing, defuzzyfication, applications of fuzzy system.
147
TECHNOLOGY
UNIT IV
GENETIC ALGORITHM: concepts, creation of offspring, working principle, encoding, fitness

functions, reproduction, genetic modeling, generation cycle & convergence of GA, application
areas of GA.
UNIT V
ADVANCED SOFT COMPUTING TECHNIQUES: Rough Set Theory - Introduction, Set

approximation, Rough membership, Attributes, optimization. SVM - Introduction, obtaining the
optimal hyper plane, linear and nonlinear SVM classifiers. Introduction to Swarm Intelligence,
Swarm Intelligence Techniques: Ant Colony Optimization, Particle Swarm Optimization, Bee
Colony Optimization etc.
Text Books:
1. S. Rajasekaran& G.A. Vijayalakshmi Pai, “Neural Networks, Fuzzy Logic & Genetic
Algorithms, Synthesis & applications”, PHI Publication.
2. S.N. Sivanandam & S.N. Deepa, “Principles of Soft Computing”, Wiley Publications.
Reference Books:
1. Kosko “Neural Network & Fuzzy System”, PHI Publication

2. Klir &Yuan,”Fuzzy sets & Fuzzy Logic: Theory &Application”, PHI Pub.
3. Hagen, “Neural Network Design”, Cengage Learning
148
TECHNOLOGY
FIFTH SEMESTER
Web Technology
Web Technology L T P C
Course Code:
3 1 0 4
BTAIE519
COURSE OBJECTIVES
 To impart the design, development and implementation of Static & Dynamic Web Pages.
 To develop programs for Web using Scripting Languages.
COURSE OUTCOMES

 Explain the history and development of the World Wide Web and associated
technologies
 Design and develop interactive Web pages using HTML/XHTML.
UNIT I
Introduction to the Internet:
The World Wide Web, Web Browsers, Web Servers, Uniform Resource Locators, Multipurpose
Internet Mail Extensions, Hypertext Transfer Protocol. Common Gateway Interface (CGI),
Content Management System – Basics
Case Study: Apache Server, WordPress.
UNIT II
Introduction to HTML/XHTML:
Origins and Evolution of HTML and XHTML, Basic Syntax of HTML, Standard HTML
Document Structure, Basic Text Markup, Images, Hypertext Links, Lists, Tables, Forms,
HTML5, Syntactic Differences between HTML and XHTML.
149
TECHNOLOGY
UNIT III
Introduction to Styles sheets and Frameworks
Cascading Style Sheets: Levels of Style Sheets – Style Specification Formats, Selector Forms,
Property-Value Forms, Font Properties, List Properties, Alignment of Text, Color, The Box
Model, Background Images, The span and div Tags. Frameworks: Overview and Basics of
Responsive CSS Frameworks - Bootstrap.
UNIT IV
Introduction to JavaScript:
The Basics of JavaScript: Overview of JavaScript, Object Orientation and JavaScript, General
Syntactic Characteristics- Primitives, Operations, and Expressions, Screen Output and Keyboard
Input, Control Statements, Object Creation and Modification,Arrays, Functions. Callback
Functions, Java Script HTML DOM.
UNIT V
Introduction to Data Interchange Formats
XML: The Syntax of XML, XML Document Structure, Namespaces, XML Schemas, Displaying
Raw XML Documents, Displaying XML Documents with CSS, XSLT Style Sheets, XML
Applications.
JSON(Basics Only): Overview, Syntax, Datatypes, Objects, Schema, Comparison with XML.
Text Books:
1. P. J. Deitel, H.M. Deitel, Internet &World Wide Web How To Program, 4/e, Pearson
International Edition 2010.
2. Robert W Sebesta, Programming the World Wide Web, 7/e, Pearson Education Inc.,
2014.
3. N. P. Gopalan, T. A. Adikesavan, “Web Technology: a developer's perspective” PHI
Learning Pvt. Ltd, 2014
Reference Books:
1. Web Applications : Concepts and Real World Design, Knuckles, Wiley-India
150
TECHNOLOGY
SIXTH SEMESTER
Ad-Hoc and Sensor Networks
Ad-Hoc and Sensor Networks
BTAIE613 3 1 0 4
COURSE OBJECTIVES
 To understand the design issues in ad hoc and sensor networks.
 To learn the different types of MAC protocols.
 To be familiar with different types of adhoc routing protocols.
 To understand TCP issues in adhoc networks.
 To learn the architecture and protocols of wireless sensor networks.
COURSE OUTCOMES
 Explain the concepts, network architectures and applications of ad hoc and sensor
networks.
 Compare routing protocols , for ad hoc and wireless sensor networks with respect to
some protocol design issues.
 Evaluate the QoS related performance measurements of ad hoc and sensor networks.
UNIT I
Introduction:Fundamentals of Wireless Communication Technology – The Electromagnetic

Spectrum – Radio propagation Mechanisms – Characteristics of the Wireless Channel -mobile ad
hoc networks (MANETs) and wireless sensor networks (WSNs) :concepts and architectures.
Applications of Ad Hoc and Sensor networks. Design Challenges in Ad hoc and Sensor
Networks.
UNIT II
Mac protocols for Ad hoc wireless networks: Issues in designing a MAC Protocol- Classification
of MAC Protocols- Contention based protocols-Contention based protocols with Reservation
Mechanisms- Contention based protocols with Scheduling Mechanisms – Multi channel MAC-
IEEE 802.11.
151
TECHNOLOGY
UNIT III
Routing protocols and transport layer in Ad hoc wireless networks: Issues in designing a routing
and Transport Layer protocol for Ad hoc networks- proactive routing, reactive routing (on-
demand), hybrid routing- Classification of Transport Layer solutions-TCP over Ad hoc wireless
Networks.
UNIT IV
Wireless sensor networks (WSNs) and MAC protocols: Single node architecture: hardware and
software components of a sensor node – WSN Network architecture: typical network
architectures-data relaying and aggregation strategies -MAC layer protocols: self-organizing,
Hybrid TDMA/FDMA and CSMA based MAC- IEEE 802.15.4.
UNIT V
WSN routing, localization & QOS: Issues in WSN routing – OLSR- Localization – Indoor and
Sensor Network Localization-absolute and relative localization, triangulation-QOS in WSN-
Energy Efficient Design-Synchronization-Transport Layer issues.
Text Books:
1. C. Siva Ram Murthy, and B. S. Manoj, “Ad Hoc Wireless Networks: Architectures and
Protocols “, Prentice Hall Professional Technical Reference, 2008.
Reference Books:
1. Carlos De Morais Cordeiro, Dharma Prakash Agrawal “Ad Hoc & Sensor
Networks: Theory and Applications”, World Scientific Publishing Company, 2006.
2. Feng Zhao and Leonides Guibas, “Wireless Sensor Networks”, Elsevier Publication
2002.
3. Holger Karl and Andreas Willig “Protocols and Architectures for Wireless Sensor
Networks”, Wiley,2005.
4. Kazem Sohraby, Daniel Minoli, & Taieb Znati, “Wireless Sensor Networks-
Technology, Protocols, and Applications”, John Wiley, 2007.
5. Anna Hac, “Wireless Sensor Network Designs”, John Wiley, 2003 .
152
TECHNOLOGY
SIXTH SEMESTER
Android Application Development

L T P C
Course Code: Android Application Development
3 1 0 4
BTAIE609
COURSE OBJECTIVES
 Understanding of the fundamentals concept of Android operating systems.
 Learn and obtain hands-on experience in developing basic and advanced Android apps.
COURSE OUTCOMES

 Demonstrate their understanding of the fundamentals of Android operating systems.
 Develop, debug and deploy android application with reasonable complexity on android
platform.
UNIT I
Introduction of Android, Android versions and its feature set, Android Development
Environment - System Requirements, Android SDK, Installing Java, and Android Studio-
Integrated Development Environment (IDE), Creating Android Virtual Devices (AVDs).
Android Architecture Overview and Creating an Example Android Application: The Android
Software Stack, The Linux Kernel, Android Runtime - Dalvik Virtual Machine, Android
Runtime – Core Libraries, Dalvik VM Specific Libraries, Java Interoperability Libraries,
Android Libraries, Application Framework, Creating a New Android Project, Project
Configuration Settings, Running the Application in the AVD and mobile device.
UNIT II
The Directory Structure of an Android Project, Common Default Resources Folders, The Values
Folder, Android XML, Screen Sizes, Android Application Components, Android Activities:
Defining the UI, Android Services: Processing in the Background, Broadcast Receivers:
Announcements and Notifications Content Providers: Data Management, Android Intent
Objects: Messaging for Components, Android Manifest XML.
153
TECHNOLOGY
UNIT III
Designing for Different Android Devices, Views and View Groups, Android Layout Managers,
The View Hierarchy, Designing an Android User Interface using the Graphical Layout Tool,
Displaying Text with TextView, Retrieving Data from Users, Using Buttons, Check Boxes and
Radio Groups, Getting Dates and Times from Users, Using Indicators to Display Data to Users,
Adjusting Progress with SeekBar, Working with Menus using views.
UNIT IV
Saving and Loading Files, SQLite Databases, Android Database Design, Exposing Access to a
Data Source through a Content Provider, Content Provider Registration, Native Content
Providers. Intent Overview, Implicit Intents, Creating the Implicit Intent Example Project,
Explicit Intents, Creating the Explicit Intent Example Application, Intents with Activities, Intents
with Broadcast Receivers.
UNIT V
An Overview of Threads, The Application Main Thread, Thread Handlers, A Basic Threading
Example, Creating a New Thread, Implementing a Thread Handler, Passing a Message to the
Handler. Playing Audio and Video, Recording Audio and Video, Using the Camera to Take and
Process Pictures.
Text Books:
1. Wei-Meng Lee,”Beginning Android Application Development” , 1st Ed, Wiley

Publishing.
2. J. F. DiMarzio, “Android: A Programmers Guide”, McGraw Hill Education (India)
Private Limited.1st Edition.
Reference Books:
1. Paul Deitel “Android for Programmers: An App-Driven Approach” 1st Edition, Pearson
India.
2. Wei-Meng Lee, “Beginning Android 4 Application Development”, Wiley India Pvt Ltd.
154
TECHNOLOGY
SIXTH SEMESTER
Biometric Systems
L T P C
Course Code: Biometric Systems
3 1 0 4
BTAIE611
COURSE OBJECTIVES
 To understand the biometric systems like fingerprint, iris, face and speech recognition.
 To understand the general principles of design of biometric systems and the underlying
trade-offs.
COURSE OUTCOMES

 Identify issues in realistic evaluation of biometrics based systems.
 Discuss different Biometric Applications and it‟s issues in deployment.
UNIT I
BIOMETRIC FUNDAMENTALS AND STANDARDS: Definition, Biometrics versus

traditional techniques, Characteristics, Key biometric processes: Verification - Identification -
Biometric matching, Performance measures in biometric systems, Assessing the privacy risks of
biometrics - Designing privacy sympathetic biometric systems, Different biometric standards,
Application properties.
UNIT II
PHYSIOLOGICAL BIOMETRICS: Facial scan, Ear scan, Retina scan, Iris scan, Finger scan,
Automated fingerprint identification system, Palm print, Hand vascular geometry analysis,
Knuckle, DNA, Dental, Cognitive Biometrics - ECG, EEG.
UNIT III
BEHAVIOURAL BIOMETRICS: Signature scan, Keystroke scan, Voice scan, Gait recognition,
Gesture recognition, Video face, Mapping the body technology.
155
TECHNOLOGY
UNIT IV
USER INTERFACES: Biometric interfaces: Human machine interface - BHMI structure,

Human side interface: Iris image interface - Hand geometry and fingerprint sensor, Machine side
interface: Parallel port - Serial port - Network topologies, Case study: Palm Scanner interface.
UNIT V
BIOMETRIC APPLICATIONS: Categorizing biometric applications, Application areas:

Criminal and citizen identification – Surveillance - PC/network access - E-commerce and
retail/ATM, Costs to deploy, Issues in deployment, Biometrics in medicine, cancellable
biometrics.
Text Books:
1. Anil K Jain, Patrick Flynn and Arun A Ross, “Handbook of Biometrics”, Springer, USA,
2010.
2. John R Vacca, “Biometric Technologies and Verification Systems”, Elsevier, USA, 2009.
3. Samir Nanavati, Michael Thieme and Raj Nanavati, “Biometrics – Identity Verification
in a Networked World”, John Wiley and Sons, New Delhi, 2003.
Reference Books:
1. Paul Reid, “Biometrics for Network Security, Pearson Education, New Delhi, 2004.
2. Reid M. Bolle et al, “Guide to Biometrics, Springer”, USA, 2004.
3. David D Zhang, “Automated Biometrics: Technologies and Systems”, Kluwer Academic
Publishers, New Delhi, 2000.
156
TECHNOLOGY
SIXTH SEMESTER
Introduction to Cloud Computing

L T P C
Course Code: Introduction to Cloud Computing
3 1 0 4
BTAIE610
COURSE OBJECTIVES
 To understand the concept of cloud computing.
 To appreciate the evolution of cloud from the existing technologies.
 To have knowledge on the various issues in cloud computing.
COURSE OUTCOMES
 Outline the main concepts, key technologies, strengths, and limitations of cloud.
 Explain the architecture and compare various cloud services and deployment models.
 Discuss the core issues of cloud computing such as security, privacy, and
interoperability.
UNIT I INTRODUCTION TO CLOUD COMPUTING
Definition of Cloud , Evolution of Cloud Computing ,Underlying Principles of Parallel and Distributed
Computing , Cloud Characteristics , Elasticity in Cloud , On-demand Provisioning.
UNIT II CLOUD ARCHITECTURE, SERVICES AND STORAGE
Layered Cloud Architecture Design ,NIST Cloud Computing Reference Architecture, Public, Private and
Hybrid Cloud, laaS, PaaS , SaaS ,Architectural Design Challenges ,Cloud Storage , Storage-as-a-Service ,
Advantages of Cloud Storage.
UNIT III CLOUD VIRTUALIZATION
Need for Virtualization , Pros and cons of Virtualization ,Types of Virtualization ,System VM, Process
VM, Virtual Machine monitor, Virtual machine properties, Cloud security challenges –, Common
Standards: The Open Cloud Consortium , The Distributed management Task Force , Cloud security
alliance model.
UNIT IV RESOURCE MANAGEMENT AND SECURITY IN CLOUD
Inter Cloud Resource Management , Resource Provisioning and Resource Provisioning Methods , Global
Cloud Interoperability , Security Overview , Cloud Security Challenges ,Security Governance , Virtual
Machine Security , IAM ,Security Standards.
157
TECHNOLOGY
UNIT V CLOUD TECHNOLOGIES AND ADVANCEMENTS
Hadoop, MapReduce, Virtual Box, Google App Engine ,Amazon Web Services, Google cloud platform,
M icrosoft Azure, Federation in the Cloud, Four Levels of Federation ,Federated Services and
Applications ,Future of Federation.
Text Book
1 Cloud Computing: Principles and Paradigms by Rajkumar Buyya , James Broberg,
Andrzej M.Goscinski.
2 Virtualization: From the Desktop to the Enterprise Paperback –by Chris Wolf , Erick M.
Halter, Apress; 2005 edition, November 1, 2008.
Reference Book
1 Velte, “Cloud Computing- A Practical Approach” ,TMH Pub
2 Sosinsky, “ Cloud Computing” , Wiley Pub
158
TECHNOLOGY
SIXTH SEMESTER
Real Time System

L T P C
Course Code: Real Time System
3 0 0 3
BTCSD612
COURSE OBJECTIVES
 To study issues related to the design and analysis of systems with real-time constraints.
 To learn the features of Real time OS.
 To study the various uniprocessor and Multiprocessor scheduling mechanisms.
COURSE OUTCOMES
 Compare and contrast knowledge about schedulability analysis

 Develop real time programming concepts
Unit – I
Introduction to real-time computing, Structure of a real-time system, Characterization of realtime
systems and tasks, Performance measures.
Unit – II
Task Assignment and Scheduling, Uniprocessor scheduling algorithms, Task assignment, Mode
changes, Fault tolerant scheduling.
Unit – III
Real-time Communication, Network topologies and architecture issues, Protocols, Contention
based, token-based, polled bus, Fault tolerant routing.
Unit – IV
Real-time Databases, Transaction priorities and aborts, Concurrency control issues, Scheduling
algorithms, Two-phase approach to improve predictability.
Unit – V
Programming Languages and Tools, Hierarchical decomposition, Run-time error handling,
Overloading, Timing specification, Recent trends and developments.
Text Book
1. C. M. Krishna and Kang G. Shin, "Real-Time Systems", International Edition,
McGrawHill Companies, Inc., New York, 1997.
159
TECHNOLOGY
SIXTH SEMESTER
Robotics & Automation

L T P C
Course Code: Robotics & Automation
3 1 0 4
BTAIE612
COURSE OBJECTIVES
 To introduce the functional elements of Robotics, direct and inverse kinematics.
 To introduce the manipulator differential motion and control.
COURSE OUTCOMES

 Summarize the features and operation of automation products.
 Discuss the dynamics and control of manipulators.
UNIT-I
Brief History, Types of robots, Overview of robot subsystems, resolution, repeatability and
accuracy, Degrees of freedom of robots, Robot configurations and concept of workspace,
Mechanisms and transmission, End effectors and Different types of grippers, vacuum and other
methods of gripping. Pneumatic, hydraulic and electrical actuators, applications of robots,
specifications of different industrial robots.
UNIT-II
Rotation matrices, Euler angle and RPY representation, Homogeneous transformation matrices,
Denavit-Hartenberg notation,representation of absolute position and orientation in terms of joint
parameters, direct kinematics.
UNIT-III
Inverse Kinematics, inverse orientation, inverse locations, Singularities, Jacobian, Trajectory

Planning: joint interpolation, task space interpolation, executing user specified tasks.
UNIT-IV
Static force analysis of RP type and RR type planar robots, Dynamic analysis using Lagrangian
and Newton-Euler formulations of RR and RP type planar robots, , Independent joint control, PD
160
TECHNOLOGY
and PID feedback, actuator models, nonlinearity of manipulator models, Computed torque
control, force control, hybrid control.
UNIT-V
Sensors and controllers: Internal and external sensors, position, velocity and acceleration sensors,
proximity sensors, force sensors, laser range finder. Robot vision: image processing
fundamentals for robotic applications, image acquisition and preprocessing. Segmentation and
region characterization object recognition by image matching and based on features.
Text Books:
1. Nagrath and Mittal, “Robotics and Control”, Tata McGraw-Hill, 2003.

2. Spong and Vidhyasagar, “Robot Dynamics and Control”, John Wiley and sons, 2008.
Reference Books:
1. Fu. K.S, Gonzalez, R.C., Lee, C.S.G, Robotics, control, sensing, Vision and Intelligence,
McGraw Hill International, 1987.
2. Harry Asada & Slottine “Robot Analysis& Control” , Wiley Publications, 2014 5. S K
Saha, “introduction to Robotics “, 2 nd edition, TMH, 2013.
161
TECHNOLOGY
SEVENTH SEMESTER
E-commerce
L T P C
Course Code: E-commerce
3 1 0 4
BTAIE709
COURSE OBJECTIVES
 To understand various concepts of E-commerce and their types.
 To provide security to different applications on the web.
 To identify and define the main e-Business models currently being adopted by
organizations
COURSE OUTCOMES
 Combine user-centered design guidelines in developing user-friendly websites.
 Analyze real business cases regarding their e-business strategies and transformation
processes and choices.
 Design and implement an e-commerce applications
Unit – I
Introduction to e-Commerce and Network Infrastructure for e-commerce.
Unit – II
E-commerce Models, e-Advertising & Marketing.
Unit – III
Electronic Payment Systems and Electronic Data Exchange.
Unit – IV
E-commerce Security, e-CRM
Unit – V
Mobile Commerce.
162
TECHNOLOGY
References:
1. Introduction to E-commerce by Jeffrey F.Rayport& Bernard J.Jaworski
2. Frontiers of E-commerce by Kalakota& Winston
3. E-Commerce- Strategy technologies and Applications by David Whiteley
4.E-Commerce-Concepts, Models & Strategies by C.S.V. Murthy
163
TECHNOLOGY
SEVENTH SEMESTER
High Performance Computing

L T P C
Course Code: High Performance Computing
3 1 0 4
BTAIE708
COURSE OBJECTIVES
 Introduce the students with the design, analysis, and implementation of high performance
computational science and engineering applications.
 Understand the advanced computer architectures, parallel algorithms, parallel languages,
and performance-oriented computing.
COURSE OUTCOMES
 Change and extend algorithms in the computational area to efficient programming code
for modern computer architectures.
 Organize and handle programs for scientific computations.
 Utilize tools for performance optimization and debugging.
UNIT I
Modern Processors: Stored-program computer architecture, General-purpose cache-based

microprocessor architecture, Performance metrics and benchmarks, Transistors galore: Moore‟s
Law, Pipelining, Superscalarity, SIMD, Memory hierarchies, Cache, Cache mapping, Prefetch,
Multicore processors, Multithreaded processors, Vector processors, Design principles, Maximum
performance estimates, Programming for vector architectures.
UNIT II
Parallel Computers: Taxonomy of parallel computing paradigms, Shared-memory computers,

Cache coherence, UMA, NUMA, Distributed-memory computers, Hierarchical (hybrid) systems,
Networks, Basic performance characteristics of networks, Buses, Switched and fat-tree networks,
Mesh networks, Hybrid networks.
UNIT III
Basics of parallelization: Why parallelize Parallelism, Data parallelism, Functional parallelism,

Parallel scalability, Factors that limit parallel execution, Scalability metrics, Simple scalability
laws, Parallel efficiency.
164
TECHNOLOGY
UNIT IV
Distributed-memory parallel programming: Distributed memory parallel programming with MPI

- Message passing, A short introduction to MPI, A simple example, Messages and point-to-point
communication, Collective communication, Non-blocking point-to-point communication, Virtual
topologies.
UNIT V
Efficient MPI programming: MPI performance tools, Communication parameters,

Synchronization, serialization, contention, Implicit serialization and synchronization, Contention,
Reducing communication overhead, Optimal domain decomposition, Aggregating messages,
Non-blocking vs. asynchronous communication, Collective communication, Understanding
intra-node point-to-point communication.
Text Books:
1. Georg Hager and Gerhard Wellien, “Introduction to High Performance Computing for
Scientists and Engineers”, CRC Press 2011.
2. Lloyd D. Fosdick, Elizabeth R. Jessup Carolyn J.C. Schauble and GittaDomik, “An
Introduction to High-Performance Scientific Computing.” The MIT Press, 1996.
Reference Books:
1. Anshul Joshi, Rahul Lakhanpal, “Learning Julia: Build High Performance Applications for
Scientific Computing”, 2017.
2. Thomas Sterling, Mathew Anedrson, “High Performance Computing: Modern Systems and
Practices”, 2017.
165
TECHNOLOGY
SEVENTH SEMESTER
Internet of Things
L T P C
Course Code: Internet of Things
3 1 0 4
BTAIE706
COURSE OBJECTIVES
 Understand general concepts of Internet of Things (IoT) and M2M architectures.
 Recognize and use various components of Internet of things such as Sensors, actuators
and Devices to develop IOT solutions.
COURSE OUTCOMES

 Explain IoT Reference Architecture and RealWorld Design Constraints.
 Develop IoT solutions using sensors, actuators and Devices.
UNIT I
IoT-An Architectural Overview– Definitions and functional requirements, Sensing, Actuation,

Networking basics, Communication Protocols, Sensor Networks, Machine-to-Machine
Communications, IoT Definition, Characteristics. IoT Functional Blocks, Physical design of IoT,
Logical design of IoT, Communication models & APIs.
UNIT II
IOT PROTOCOLS - Protocol standardization for IoT, efforts, M2M and WSN protocols,
SCADA and RFID protocols, issues with IoT standardization, unified data standards, protocols,
IEEE 802.15.4, BACNet protocol, Modbus, KNX, Zigbee, network layer, APS layer, security .
UNIT III
M2M to IoT- Introduction, From M2M to IoT, M2M towards IoT-the global context, M2M vs
IoT An Architectural Overview–Building architecture, Main design principles and needed
capabilities, An IoT architecture outline, standards considerations. Reference Architecture and
Reference Model of IoT
166
TECHNOLOGY
UNIT IV
Developing IoT solutions: Introduction to Python, Introduction to different IoT tools,

Introduction to Arduino and Raspberry Pi Implementation of IoT with Arduino and Raspberry,
Cloud Computing, Fog Computing, Connected Vehicles, Data Aggregation for the IoT in Smart
Cities, Privacy and Security Issues in IoT
UNIT V
CASE STUDIES- Reading RFID cards using 8051- RFID in the supply chain- Vehicles parking
using RFID- library management system- electronic toll payment- smart shipping containersfleet
monitoring and management.
Text Books:
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”, 1st Edition, Academic Press, 2014.
2. Honbo Zhou, “The Internet of Things in the Cloud: A Middleware Perspective”, CRC
Press, 2012.
3. Dieter Uckelmann, Mark Harrison, Michahelles, Florian (Eds), “Architecting the Internet
of Things”, Springer, 2011.
Reference Books:
1. Olivier Hersent, Omar Elloumi and David Boswarthick, “The Internet of Things:
Applications to the Smart Grid and Building”, Wiley, 2012.
2. Olivier Hersent, David Boswarthick, Omar Elloumi, “The Internet of Things – Key
applications and Protocols”, Wiley, 2012
167
TECHNOLOGY
SEVENTH SEMESTER
Open Source System
Open Source System L T P C

Course Code:
3 1 0 4
BTAIE710
COURSE OBJECTIVES
 Understand the different types of open source software.
 Familiarity with different operating systems.
 Understanding and development of web applications using open source web technologies like
Apache, MySql and PHP (LAMP/XAMP).
COURSE OUTCOMES
Students shall be able to:

 Compare open source software and commercial software.
 Identify, install and run Linux operating system, Apache and PHP.
UNIT I OPEN SOURCE:

Introduction to Open Source – Open Source vs. Commercial Software , What is Linux ,Free Software ,
Where I can use Linux, Linux Kernel , Linux Distributions.
UNIT II LINUX:
Introduction to Linux Essential Commands , File system Concept - Standard Files, The Linux Security
Model, Vi Editor , Partitions creation , Shell Introduction.
UNIT III APACHE:

Apache Explained - Starting, Stopping, and Restarting Apache - Modifying the Default Configuration -
Securing Apache - Set User and Group - Consider Allowing Access to Local Documentation - Don't
Allow public html Web sites - Apache control with .htaccess
UNIT IV MYSQL:
Introduction to MYSQL, The Show Databases and Table , The USE command , Create Database and
Tables , Describe Table , Select, Insert, Update, and Delete statement , Some Administrative detail , Table
Joins , Loading and Dumping a Database.
UNIT V PHP:
Introduction- General Syntactic Characteristics, PHP Scripting, Commenting your code - Primitives,
Operations and Expressions, PHP Variables - Operations and Expressions Control Statement - Array ,
Functions.
168
TECHNOLOGY
TEXT BOOK:
1. James Lee and Brent Ware ,"Open Source Web Development with LAMP using Linux, Apache,
MySQL, Perl and PHP", , Dorling Kindersley(India) Pvt. Ltd, 2008.
SUGGESTED READINGS:
1. Eric Rosebrock, Eric Filson ,"Setting Up LAMP: Getting Linux, Apache, MySQL, and PHP and
working Together", Published by John Wiley and Sons, 2004.
169
TECHNOLOGY
SEVENTH SEMESTER
Social Web Mining
Social Web Mining L T P C

Course Code:
3 1 0 4
BTAIE711
COURSE OBJECTIVES
 To describe web mining and understand the need for web mining
 To differentiate between Web mining and data mining
 To understand the different application areas for web mining
COURSE OUTCOMES
 Summarize classic and recent developments in Web search and data mining.
 Utilize statistical techniques to analyze complex information and social networks.
UNIT I INTRODUCTION TO WEB DATA MINING AND DATA MINING FOUNDATIONS

Introduction – World Wide Web (WWW), A Brief History of the Web and the Internet, Web Data
Mining-Data Mining, Web Mining.
UNIT II DATA MINING FOUNDATIONS

Association Rules and Sequential Patterns – Basic Concepts of Association Rules, Apriori Algorithm-
Frequent Itemset Generation, Association Rule Generation, Data Formats for Association Rule Mining.
UNIT III SUPERVISED AND UNSUPERVISED LEARNING SUPERVISED LEARNING

Basic Concepts, Decision Tree Induction – Learning Algorithm, Impurity Function, Handling of
Continuous Attributes, Classifier Evaluation, Rule Induction – Sequential Covering, Rule Learning,
Classification Based on Associations, Naïve Bayesian Classification , Naïve Bayesian Text Classification
– Probabilistic Framework, Naïve Bayesian Model . Unsupervised Learning – Basic Concepts , K-means
Clustering – K-means Algorithm, Representation of Clusters, Hierarchical Clustering – Single link
method, Complete link Method, Average link method, Strength and Weakness.
UNIT IV INFORMATION RETRIEVAL AND WEB SEARCH

Basic Concepts of Information Retrieval, Information Retrieval Methods – Boolean Model, Vector Space
Model and Statistical Language Model, Relevance Feedback, Evaluation Measures, Text and Web Page
Preprocessing
170
TECHNOLOGY
UNIT V LINK ANALYSIS AND WEB CRAWLING: LINK ANALYSIS

Social Network Analysis, Co-Citation and Bibliographic Coupling, Page Rank Algorithm Web Crawling
– A Basic Crawler Algorithm- Breadth First Crawlers, Preferential Crawlers, Implementation Issues.
Opinion Mining – Sentiment Classification – Classification based on Sentiment Phrases, Classification

Using Text Classification Methods, Feature based Opinion Mining.
TEXT BOOK:
 Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data by Bing Liu (Springer
Publications)
REFERENCES BOOKS:
 Data Mining: Concepts and Techniques, Second Edition Jiawei Han, Micheline Kamber (Elsevier
Publications)
 Web Mining:: Applications and Techniques by Anthony Scime
171
TECHNOLOGY
SEVENTH SEMESTER
Wireless Sensor Network

L T P C
Course Code: Wireless Sensor Network
3 1 0 4
BTAIE707
COURSE OBJECTIVES
 To understand the basic of WSN technology and supporting protocol.
 Learn the basic fundamentals of MAC protocol.
 Learn key routing protocol for Wirless Sensor Networks.
COURSE OUTCOMES
 Compare and contrast various WSN protocols.

 Develop wireless sensor systems for different applications.
UNIT I
Sensor networks overview: Introduction, Applications of WSN, Range of Applications, Design

issues, Basic Wireless Sensor Technology: Sensor node architecture, Hardware and Software,
Sensor Taxonomy, WSN Operating Environment, Trend.
UNIT II
Wireless Transmission Technology and Systems: Introduction, Radio Technology Primer,

Propagation & Propagation Impairments, Available Wireless Technologies.
UNIT III
Fundamentals of MAC Protocols: Performance Requirements, Common Protocols, MAC

Protocols for WSNs, Schedule-Based Protocols, Random Access-Based Protocols, Sensor-MAC
Case Study, Protocol Overview, Periodic Listen and Sleep Operations, Schedule Selection and
Coordination, Schedule Synchronization, Adaptive Listening, Access Control and Data
Exchange.
UNIT IV
Routing Protocols for Wireless Sensor Networks: Routing Challenges and Design Issues in
Wireless, Sensor Networks, Network Scale and Time-Varying Characteristics, Resource
172
TECHNOLOGY
Constraints, Sensor Applications Data Models, Routing Strategies in Wireless Sensor Networks,
WSN Routing Techniques, Flooding and Its Variants, Sensor Protocols for Information via
Negotiation, Low Energy Adaptive Clustering Hierarchy, Power-Efficient Gathering in Sensor
Information Systems, Directed Diffusion, Geographical Routing.
UNIT V
Applications Of WSN: WSN Applications - Home Control - Building Automation - Industrial

Automation - Medical Applications - Reconfigurable Sensor Networks - Highway Monitoring -
Military Applications - Civil and Environmental Engineering Applications
Text Books:
1.KazemSohraby, Daniel Minoli and TaiebZnati, “ Wireless Sensor Networks Technology,

Protocols, and Applications“, John Wiley & Sons, 2007.
2.Holger Karl and Andreas Willig, “Protocols and Architectures for Wireless Sensor Networks”,
John Wiley & Sons, Ltd, 2005.
Reference Books:
1. Security in Wireless Sensor Networks by Piotr Szczechowiak/ Lap Lambert Academic

Publishing.
2. Wireless Sensor Networks by RaghavendraSivalingamZnati/ Springer India.
3. Building Wireless Sensor Networks by Robert Faludi/ O‟reill.
173
TECHNOLOGY
SEVENTH SEMESTER
Data Mining and Data warehousing

L T P C
Course Code: Data Mining and Data Warehousing
3 1 0 4
BTAIE713
COURSE OBJECTIVES
 To comprehend the standards of Data warehousing and Data Mining.
 To know the architecture of a Data Mining framework and Data preprocessing Methods.
 To perform characterization and prediction of information
COURSE OUTCOMES
 Explain Data Warehouse fundamentals, Data Mining Principles
 Compare and evaluate different data mining techniques like classification, prediction,
clustering, and association rule mining.
 Design Data Warehouse with dimensional modeling.
UNIT I
Introduction - Relation to Statistics, Databases- Data Mining Functionalities, Steps in Data

Mining Process, Architecture of Typical Data Mining Systems
UNIT II
Data Pre-processing and Association Rules- Data Cleaning, Integration, Transformation,
Reduction, Discretization Concept Hierarchies- Data Generalization and Summarization.
UNIT – III
Predictive Modelling, Classification and Prediction- Classification by Decision Tree Induction,
Bayesian Classification, Prediction, Clusters Analysis: Categorization of Major Clustering
Methods: Partitioning Methods, Hierarchical Methods.
UNIT – IV
Data Warehousing Components, Multi Dimensional Data Model, Data Warehouse Architecture,
Data Warehouse Implementation, Mapping the Data Warehouse to Multiprocessor Architecture-
OLAP.
UNIT – V
Applications of Data Mining, Social Impacts of Data Mining, Tools, WWW, Mining Text
Database, Mining Spatial Databases.
174
TECHNOLOGY
Text Books
1. Jiawei Han and Micheline Kamber, "Data Mining: Concepts and Techniques", Morgan
Kaufmann Publishers, 2002.
2. Alex Berson and Stephen J. Smith, “Data Warehousing, Data Mining, & OLAP”, Tata
McGraw- Hill, 2004.
Reference Books
1. Usama M. Fayyad, Gregory Piatetsky - Shapiro, Padhrai Smyth, and Ramasamy
Uthurusamy, "Advances in Knowledge Discovery and Data Mining", the M.I.T Press,
1996.
2. Ralph Kimball, "The Data Warehouse Life Cycle Toolkit", John Wiley & Sons Inc.,
1998.
3. Sean Kelly, "Data Warehousing In Action", John Wiley & Sons Inc., 1997.
175
TECHNOLOGY
SEVENTH SEMESTER
Digital Image Processing

L T P C
Course Code: Digital Image Processing
3 1 0 4
BTAIE712
COURSE OBJECTIVES
 Design and develop image processing applications.
 Understand different feature extraction techniques for image analysis and recognition.
COURSE OUTCOMES
 Classify the different type of image restoration techniques.
 Analyze images in the frequency domain using various transforms.
 Evaluate the techniques for image enhancement and image restoration.
UNIT I
Introduction: Background, Digital Image Representation, Fundamental Steps in Image

Processing, Elements of a Digital Image Processing System, Digital Image Fundamentals-
Elements of Visual Perception, A Simple Image Model, Sampling and Quantization,
Relationships between Pixels, Image File Format, Colour Models.
UNIT II
Spatial Domain Filtering, Intensity transformations, contrast stretching, histogram equalization,

Correlation and convolution, Smoothing filters, sharpening filters, gradient and Laplacian.
UNIT III
Detection of Discontinuities, Edge Linking using Hough Transform, Thresholding, Region based
Segmentation, Split and Merge Technique, Image Representation and Description, Chain Code,
Polygonal, Representation, Shape Number, Moments.
UNIT IV
Morphological operations in Binary and Gray Images, Restoration techniques, Noise

characterization, Noise restoration filters, Adaptive filters, Linear, Position invariant
degradations, Estimation of Degradation functions, Restoration from projections.
176
TECHNOLOGY
UNIT V
Error free compression, Variable length coding, LZW, Bit-plane coding, Lossless predictive
coding Lossy compression: Lossy predictive coding, transform coding, wavelet coding. Image
compression standards, CCITT, JPEG, JPEG 2000, Video compression standards.
Text Books:
1. R. C.Gonzalez, R.E.Woods,” Digital Image processing”, Pearson edition.

2. A.K.Jain,” Fundamentals of Digital Image Processing”, PHI.
Reference Books:
1. J.C. Russ,” The Image Processing Handbook”, CRC, 2006.
177
TECHNOLOGY
SEVENTH SEMESTER
Information Retrieval
Information Retrieval L T P C
Course Code:
3 1 0 4
BTAIE716
COURSE OBJECTIVES
 Understand basic concepts and techniques of information retrieval
 familiarize with difference between Information retrieval and data Base Management
Systems
COURSE OUTCOMES

 Explain about various components of Information Retrieval
 Acquire the necessary experience to design, and implement real applications using
Information Retrieval systems.
UNIT I: INTRODUCTION
History of IR, Components of IR , Issues, Open source Search engine Frameworks , impact of
the web on IR , role of artificial intelligence (AI) in IR, IR Versus Web Search, Components of a
Search engine, Characterizing the web.
UNIT II: INFORMATION RETRIEVAL
Boolean and vector space retrieval models, Term weighting, TF-IDF weighting, cosine
similarity, Preprocessing, Inverted indices, efficient processing with sparse vectors, Language
Model based IR , Probabilistic IR,Latent Semantic Indexing, Relevance feedback and query
expansion.
UNIT III: WEB SEARCH ENGINE, INTRODUCTION AND CRAWLING
Web search overview, web structure, the user, paid placement, search engine optimization/
spam. Web size measurement, search engine optimization/spam, Web Search Architectures,
crawling, meta-crawlers, Focused Crawling, web indexes, Near-duplicate detection , Index
Compression,XMLretrieval.
178
TECHNOLOGY
UNIT IV: WEB SEARCH, LINK ANALYSIS AND SPECIALIZED SEARCH
Link Analysis, hubs and authorities, Page Rank and HITS algorithms -Searching and
Ranking, Relevance Scoring and ranking for Web, Similarity - Hadoop & Map Reduce
Evaluation , Personalized search, Collaborative filtering and content-based recommendation of
documents and products, handling “invisible” Web - Snippet generation, Summarization,
Question Answering, Cross- Lingual Retrieval.
UNIT V : DOCUMENT TEXT MINING
Information filtering; organization and relevance feedback, Text Mining -Text classification and
clustering - Categorization algorithms: naive Bayes; decision trees; and nearest neighbor -
Clustering algorithms: agglomerative clustering; k-means; expectation maximization (EM).
Text Books:
1. C. Manning, P. Raghavan, and H. Schütze, Introduction to Information Retrieval ,

Cambridge University Press, 2008.2
2. Ricardo Baeza -Yates and Berthier Ribeiro - Neto, Modern Information Retrieval: The
Concepts and Technology behind Search 2 nd Edition, ACM Press Books 2011
3. Bruce Croft, Donald Metzler and Trevor Strohman, Search Engines: Information
Retrieval in Practice, 1 st Edition Addison Wesley, 2009.
Reference Books:
1. Stefan Buettcher, Charles L. A. Clarke, Gordon V. Cormack, Information

Retrieval: Implementing and Evaluating Search Engines, The MIT Press, 2010
2. Ophir Frieder “Information Retrieval: Algorithms and Heuristics: The Information Retrieval
Series “, 2 nd Edition, Springer, 2004
179
TECHNOLOGY
SEVENTH SEMESTER
INFORMATION THEORY & CODING
INFORMATION THEORY & CODING L T P C

Course Code:
3 1 0 4
BTAIE717
COURSE OBJECTIVES
 To introduce the basic concepts of information theory, leading to the channel capacity
theorem.
 To describe information theory, the fundamentals of error control coding techniques.
 To provide error control coding techniques and applications.
 To define application of Information theory like Data compression and cryptology.
COURSE OUTCOMES
 Define basic notions of information, channel capacity, convolution code, block codes &
their decoding techniques.
 Illustrate how error control coding techniques are applied in communication systems.
 Discuss the application areas of information theory.
UNIT I
Information Theory: Introduction, Measure of information, Information content of message,

Information and Entropy Information Measures: Characteristics on information measure,
Shannon‟s communication model, Model for source coding theorem; Communication system,
Source coding and line/channel coding; channel mutual information capacity (Bandwidth).
UNIT II
Source Coding: Source coding theorem, Prefix Codes, Channel coding, Theorem for discrete
memory less channel, Encoding of the Source Output, Shannon‟s Encoding Algorithm.
Shannon Fano Encoding Algorithm, Huffman codes.
UNIT III
Information Channels: Communication Channels, Channel Models, Channel Matrix, Joint

probabilty Matrix, Binary Symmetric Channel,System Entropies, Mutual Information, Channel
180
TECHNOLOGY
Capacity, Channel Capacity of :Binary Symmetric Channel, Binary Erasure Channel, Contineuos
Channels.
UNIT IV
Error Control Coding, Types of Errors, Controlling Errors, Types of Codes, Linear Block Codes:
Matrix description of Linear Block Codes, Error Detection and Error Correction Capabilities of
Linear Block Codes, SingleError Correcting hamming Codes. Binary Cyclic Codes: Polynomial
Representation of Codewords, Generator Polynomial, Generator Matrix, Encoding using an (n-k)
BitShift register, Syndrome Calculation and Error Detection, Decoding of Cyclic Codes.
UNIT V
Compression techniques- Principles, Text Compression, Static Huffman Coding, Dynamic

Huffman Coding, Arithmetic Coding, Image Compression, Graphics Interchange Format,
Digitized Documents, Introduction to JPEG Standards
Text Books:
1. Digital Communication by Proakis, TMH.

2. Digital Communication by Das, Mullick & Chatterjee, New Age Pub.
Reference Books:
1. Jorge Castiñeira Moreira, Patrick Guy Farrell , Essentials of Error-Control Coding

2. Dominic Welsh, Codes and Cryptography, Oxford Science Publications, 1988
(reference).
3. Digital Image Processing by Gonzales & Woods, Pearson.
181
TECHNOLOGY
SEVENTH SEMESTER
Mobile Computing
L T P C
Course Code: Mobile Computing
3 1 0 4
BTAIE714
COURSE OBJECTIVES
 To provide an overview of Wireless Communication networks and its applications in
communication engineering.
 To explain the various terminology, principles, devices, schemes, concepts and different
methodologies used in Wireless Communication Networks.
COURSE OUTCOMES

 Extend knowledge of mobile and wireless communication concepts.
 Demonstrate basic skills for cellular networks design.
UNIT – I
Introduction to Wireless Networks, Applications, History, Simplified Reference Model, Wireless
transmission, Frequencies, Signals, Antennas, Signal propagation, Multiplexing, Modulation,
Spread spectrum , Cellular Systems.
UNIT – II
MAC- Motivation, SDMA, FDMA, TDMA, CDMA, Telecommunication Systems – GSM ,
DECT, TETRA, UMTS, IMT-2000.
UNIT – III
Wireless LAN, Infrared Vs Radio transmission, Infrastructure, Adhoc Network, 802.11
HIPERLAN, Bluetooth, Mobile Network Layer, Mobile IP, Dynamic Host Configuration
Protocol.
UNIT – IV
Adhoc Networks , 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
Support for Mobility, File Systems, WWW, Wireless Application Protocol.
182
TECHNOLOGY
Text Books:
1. Jochen Schiller, “Mobile Communications”, Pearson Education, Asia Publications,

2000.
Reference Books:
1. William Stallings, “Wireless Communication and Networks”.

2. Frank Adelstein, et al., “Fundamentals of Mobile and Pervasive Computing”,
McGraw-Hill, 2005.
183
TECHNOLOGY
SEVENTH SEMESTER
Quantum Computing
L T P C
Course Code: Quantum Computing
3 1 0 4
BTAIE715
COURSE OBJECTIVES
 To know the definition of qubit, quantum logic gates, quantum circuits and quantum
algorithms
 To know the basic requirements for implementation of quantum computers and classify
the schemes for implementation of quantum computers
COURSE OUTCOMES
 Explain the framework of quantum computation, and how that may be useful for future
quantum technologies.
 Outline some of the important quantum computing algorithm
 Extend knowledge about forthcoming quantum information technology products
UNIT I
Linear Algebra & Dirac Notation: Dirac notation and Hilbert spaces, dual vectors, linear
operators, The spectral theorem, functions of operators, Tensor products, Schmidt decomposition
theorem.
Qubits & The Framework of Quantum Mechanics: State of a quantum system, time-evolution
of a closed quantum system, measurement in quantum mechanics, Pure and mixed states, density
operator, partial trace, general quantum operators, Bloch-sphere representation of single qubit
states, qubit rotations, single qubit gates.
UNIT II
Quantum Model of Computation: The quantum circuit model, single and multi-qubit
operations, universal sets of quantum gates, Efficiency of approximating unitary transformations,
implementing measurements with quantum gates.
UNIT III
Quantum Algorithms: Probabilistic versus quantum algorithms, Phase kick-back, The Deutsch
and Deutsch-Jozsa algorithms, Quantum phase estimation and quantum Fourier transform error
analysis in arbitrary phase estimation, Finding orders, Shor‟s algorithm for order estimation,
184
TECHNOLOGY
Quantum algorithms based on amplitude amplification, Grover‟s quantum search algorithm and
related topics.
UNIT IV
Quantum Entanglement & Teleportation: Mathematical and physical conceptions of quantum

entanglement, entanglement distillation, entanglement of formation, Entanglement in pure and
mixed states, No-cloning theorem for quantum states, Quantum teleportation and quantum
communication
UNIT V
Quantum Error-correction: Three qubit bit flip and phase flip codes, Theory of quantum error
correction, discretization of errors, independent error models, Construction of quantum codes,
quantum circuits for encoding, decoding and corrections, Fault-tolerant quantum computing.
Text Books:
1. Quantum Computation and Quantum Information, M.A. Nielsen and I.L. Chuang, Cambridge
University Press. 2002
2. An Introduction to Quantum Computing, P. Kaye, R. Laflamme and M. Mosca
3. Benenti G., Casati G. and Strini G., Principles of Quantum Computation and Information, Vol.
I: Basic Concepts, Vol II: Basic Tools and Special Topics, World Scientific, 2004
Reference Books:
1. Quantum Computing, M. Hirvensalo
2. The Principles of Quantum Mechanics, P.A.M. Dirac
3. Modern Quantum Mechanics, J.J. Sakurai
4. Mathematical Physics, S. Hassani, Springer-Verlag
185
TECHNOLOGY
OPEN
ELECTIVES
186
TECHNOLOGY
SIXTH SEMESTER
Contemporary Management Process

L T P C
Course Code: Contemporary Management Process
2 0 0 2
BTAIO620
COURSE OBJECTIVES
 Knowledge of management theory and practices.
 An ability to use it to make sound, well argued management process.
COURSE OUTCOMES
 Describe various supervision methods, tools and techniques to motivate individuals and
work groups.
 Apply organizing techniques to establish appropriate and effective lines of authority and
communication among people and throughout various levels of an organization.
UNIT I
Management and Managers – Introduction and Overview, The History and Evolution of
Management Thought, the Management Process Today, the Manager and Leader: Values,
Attitudes, Emotions, and Culture
UNIT II
The Managerial Environment, Ethics, Diversity and Stakeholder Management
UNIT III
Planning, Decision-Making and Competitive Advantage, Decision Making, Learning, Creativity,
and Entrepreneurship, Planning, Strategy, and Competitive Advantage
UNIT IV
Organizational Design, Structure and Change, Designing Organizational Structure Innovation,
Control, Change, and Entrepreneurship
UNIT V
Leading Individuals and Groups Motivation, Leaders and Leadership, Effective Team Work and
Team Management.
TEXT BOOKS:
1. Gareth R. Jones & Jennifer M. George (2013) Essentials of Contemporary Management, 5th
Edition, McGraw Hill, Boston, MA. ISBN: 978-0-07-802934-9.
187
TECHNOLOGY
2. MacKenzie, Gordon (1996) Orbiting the Giant Hairball: A Corporate Fool‟s Guide to
Surviving with Grace, New York, N.Y., Viking, Penquin Group ISBN: 0-670-87983-5.
SIXTH SEMESTER
Cyber Law & Ethics

L T P C
Course Code: Cyber Law & Ethics
2 0 0 2
BTAIO618
COURSE OBJECTIVES
 To analyze various types of cybercrime and formulate procedures for real world
Cybercrime Investigations
 To resolve challenges posed to law enforcement agents, policy makers and prosecutors
 To find solutions in cybercrime investigations, evidence and applicable law for real
world case studies
COURSE OUTCOMES
 Identify cyber crime by methods currently available for finding illegal activities on
computer and networks.
 Analyze the criminal activity on the Internet and propose available tools to prevent such
activity.
UNIT I
Introduction Computers and its Impact in Society, Overview of Computer and Web Technology,
Need for Cyber Law, Cyber Jurisprudence at International and Indian Level, Cyber Law -
International Perspectives UN & International Telecommunication Union (ITU) Initiatives
Council of Europe - Budapest Convention on Cybercrime, Asia-Pacific Economic Cooperation
(APEC), Organization for Economic Co-operation and Development (OECD), World Bank,
Commonwealth of Nations.
UNIT II
Constitutional & Human Rights Issues in Cyberspace Freedom of Speech and Expression in
Cyberspace, Right to Access Cyberspace – Access to Internet, Right to Privacy, Right to Data
Protection, Cyber Crimes & Legal Framework Cyber Crimes against Individuals, Institution and
188
TECHNOLOGY
State, Hacking, Digital Forgery, Cyber Stalking/Harassment, Cyber Pornography, Identity Theft
& Fraud Cyber terrorism, Cyber Defamation.
UNIT III
Cyber Torts Cyber Defamation, Different Types of Civil Wrongs under the IT Act 2000,
Intellectual Property Issues in Cyber Space Interface with Copyright Law, Interface with Patent
Law, Trademarks & Domain Names Related issues
UNIT IV
E-Commerce Concept, E-commerce-Salient Features, Online approaches like B2B, B2C & C2C
Online contracts, Click Wrap Contracts, Applicability of Indian Contract Act, 1872.
UNIT V
Dispute Resolution in Cyberspace, Concept of Jurisdiction, Indian Context of Jurisdiction and IT

Act, 2000. International Law and Jurisdictional Issues in Cyberspace, Dispute Resolutions .
Text Books:
1. Cyber Law Simplified, VivekSood, Pub: TMH

2. Cyber Laws and IT Protection, Harish Chander, Pub:PHI.
Reference Books:
1. John R. Vacca, Computer Forensics: Computer Crime Scene Investigation, 2nd

Edition, Charles River Media, 2005
2. Cyber Security by Nina Godbole, SunitBelapure Pub: Wiley-India
3. Information Warfare: Corporate attack and defense in digital world, William
Hutchinson, Mathew Warren, Elsevier.
189
TECHNOLOGY
SIXTH SEMESTER
Multimedia and Animation

L T P C
Course Code: Multimedia and Animation
2 0 0 2
BTAIO617
COURSE OBJECTIVES
 To introduce the fundamental elements of multimedia and Animation.
 To learn representations, perceptions and applications of multimedia.
COURSE OUTCOMES

 Summarize the key concepts of multimedia technologies.
 Discuss the application avenues for the Multimedia and Animation concepts.
UNIT I
What is multimedia, Components of multimedia, Web and Internet multimedia applications,

Transition from conventional media to digital media.
UNIT II
Usage of text in Multimedia, Families and faces of fonts, outline fonts, bitmap fonts International
character sets and hypertext, Digital fonts techniques.
UNIT III
Digitization of sound, frequency and bandwidth, decibel system, data rate, audio file format,
Sound synthesis, MIDI, wavetable, Compression and transmission of audio on Internet, Adding
sound to your multimedia project, Audio software and hardware.
UNIT IV
Colour Science , Colour, Colour Models, Colour palettes, Dithering, 2D Graphics, Image
Compression and File Formats :GIF, JPEG, JPEG 2000, PNG, TIFF, EXIF, PS, PDF, Basic
Image Processing [ Can Use Photoshop ], Use of image editing software, White balance
correction, Dynamic range correction, Gamma correction, Photo Retouching.
UNIT V
190
TECHNOLOGY
Video Basics , How Video Works, Broadcast Video Standards, Analog video, Digital video,
Video Recording and Tape formats, Shooting and Editing Video (Use Adobe Premier for
editing), Video Compression and File Formats. Video compression based on motion
compensation, MPEG-1, MPEG-2, MPEG-4, MPEG-7, MPEG-21, Animation: Cell Animation,
Computer Animation, Morphing.
Text Books:
1. Tay Vaughan, “Multimedia making it work”, Tata McGraw-Hill, 2008.

2. Rajneesh Aggarwal & B. B Tiwari, “ Multimedia Systems”, Excel Publication, New
Delhi, 2007.
3. Li & Drew, “ Fundamentals of Multimedia” , Pearson Education, 2009.
Reference Books:
1. Parekh Ranjan, “Principles of Multimedia”, Tata McGraw-Hill, 2007

2. AnirbanMukhopadhyay and Arup Chattopadhyay, “Introduction to Computer Graphics
and Multimedia”, Second Edition, Vikas Publishing House.
191
TECHNOLOGY
SIXTH SEMESTER
Project Management
Project Management L T P C
Course Code:
2 0 0 2
BTAIO605
COURSE OBJECTIVES
 To describe a project life cycle, and can skillfully map each stage in the cycle
 To introduce project management topics such as resources, costs, time constraints and project
scopes.
 To build a successful project from pre-implementation to completion.
COURSE OUTCOMES
 Summarize stakeholders with information regarding project costs by considering factors such
as estimated costs, variances and profits, time etc.
 Identify and develop a project scope while considering factors such as customer requirements.
 Discuss and solve complex management situations with knowledge and facts.
UNIT I
Project Management: Introduction, Defination, Purpose for Project Management, Project

Management Knowledge Areas and Processes, Project Life Cycle, Role of Project Manager
(PM), Project Management Life Cycle phases.
UNIT II
Project Identification and Selection: Introduction, Categorising different types of projects,

Project Identification Process, Identifying and delivering on your client‟s priorities, Project
Initiation, Impact of Delays in Project Completions, Project Management Principles,
UNIT III
Project Planning: Project Planning Introduction, Requirement of Project Planning, Developing

a project management plan ,Role of planning in Project Life Cycle, Dependability,
Responsibility and Team Work, Project Planning Process, Work Breakdown Structure (WBS),
Feasibility Studies, Assessing the feasibility of a project, Identifying and managing risks.
192
TECHNOLOGY
UNIT IV
Identifying Organisational Structure: Introduction, Concept of Organisational Structure,

Organisational Issues, Roles and Responsibilities of Project Leader, Team Management and
Diversity Management, Change management, Estimating costs and budgeting, critical path
project management tools (WBS, Gantt chart, Project Network Diagram), programme evaluation
and review technique (PERT tool), CPM Model, Network Cost System.
UNIT V
Project Risk Management: Role of Risk Management in Overall Project Management, Risk
Analysis, Reducing Risks, Project Quality Management, Project Management Information
System (PMIS), Project Execution, Project Control Process. Case Studies of Project
Management.
Text Books:
1. Panneerselven and Serthil kumar; Project management, PHI Learning.
Reference Books:
1. Burke ; Project Management-Planning and control technics; Wiley India

2. Kamaraju R; Essentials of Project Management; PHI Learning
3. Jack R. Meredith, Project Management: a managerial approach, Wiley.
193
TECHNOLOGY
SIXTH SEMESTER
Social Network Analysis

L T P C
Course Code: Social Network Analysis
2 0 0 2
BTAIO619
COURSE OBJECTIVES
 Understand the components of social networks.
 Model and visualize social networks.
 Understand the role of semantic web in social networks.
COURSE OUTCOMES
 Illustrate the basic components of social networks.
 Analyze the different measurements and metrics of social networks.
 Apply different techniques to detect and evaluate communities in social networks.
UNIT I: Introduction
Introduction to social network analysis, Fundamental concepts in network analysis, social
network data, notations for social network data, Graphs and Matrices.
UNIT II: Measures & Metrics

Strategic network formation - network centrality measures: degree, betweenness, closeness,
eigen vector - network centralization density reciprocity transitivity ego network measures for
ego network - dyadic network triadic network - cliques - groups- clustering search.
UNIT III: Community Networks

Tamura features- Wold features-Simultaneous Auto-Regressive (SAR) Model-Wavelet
transform features- Shape: Moment invariants Turning angles Fourier descriptors-Spatial
information
UNIT IV: Models

Small world network - WattsStrogatz networks - Statistical Models for Social Networks Net-
work evolution models: dynamical models, growing models - Nodal attribute model: expo-
nential random graph models Preferential attachment - Power Law - random network model:
Erdos-Renyi and Barabasi-AlbertEpidemics - Hybrid models of Network Formation
194
TECHNOLOGY
UNIT V: Semantic Web

Modelling and aggregating social network data, developing social semantic application,
evaluation of web-based social network extraction, Data Mining, Text Mining in social network,
Tools case study, Visualization of social networks, novel visualizations and interactions for
social networks, applications of social network analysis tools, R Tools for Social Network
Analysis
TEXT BOOKS:
1. Stanley Wasserman, Katherine Faust, Social network analysis: Methods and applications,
Cambridge university press, 2009
2. John Scott, Social network analysis, 3rd edition, SAGE, 2013.
REFERENCES:
1. Borko Furht, Handbook of Social Network Technologies and applications, Springer, 2010.
2. Jalal Kawash, Online Social Media Analysis and Visualization (Lecture Notes in Social
Networks), 2015.
3. Charu Aggarwal, Social Network data analysis, Springer, 2011.
195
TECHNOLOGY
SIXTH SEMESTER
Supply Chain Management

L T P C
Course Code: Supply Chain Management
2 0 0 2
BTAIO616
COURSE OBJECTIVES
 To have knowledge of supply chain management.
 To learn the applicability of supply chain management in any business/organization.
COURSE OUTCOMES
 Interpret the importance of Supply chain management for company‟s success and
customer‟s satisfaction.
 Apply SCM knowledge and capabilities to support medical missions, conduct disaster
relief operations, and handle other types of emergencies.
UNIT – INTRODUCTION
Supply Chain Management, Importance of Supply Chain Management, The Supply Chain
Management Pipeline, Objectives of the Supply Chain Management, Supply Chain Principles/
Methodology and Solutions: Supply Chain Principles, Methodology of a Supply Chain
Management project-solutions, Expected results/ benefits, Opportunity areas (examples),
Characteristics of Firms/ Organizations and Service Providers.
UNIT – II SUPPLY CHAIN DRIVERS AND METRICS
Drivers of Supply Chain Performance, Framework for Structuring Drivers, Facilities, Inventory,
Transportation, Information, Sourcing, Pricing, Obstacles to Achieving Fit.
UNIT – III APPLICATIONS
Where the technique has been applied, how can be SCM applied to an organization? Types of
firms/ Organizations, where SCM can be applied, Duration and Implementation cost of Supply
Chain Management, Conditions for implementation, European Organizations supporting the
implementation of the method.
UNIT – IV IMPLEMENTATION PROCEDURE
Steps-actions/ phases: Implementing a competitive approach to Warehousing and Distribution

Partial techniques and tools included in each step, related software.
196
TECHNOLOGY
UNIT – V INFORMATION TECHNOLOGY IN A SUPPLY CHAIN
The Role of IT in a Supply Chain, The Supply Chain IT Framework, Customer Relationship
Management, Internal Supply Chain Management, Supplier Relationship Management, The
Transaction Management Foundation, The Future of IT in the Supply Chain, Risk Management
in IT, Supply Chain IT in Practice.
Text Book:
1. Supply Chain Management: Strategy, Planning, and Operation, Sunil Chopra and Peter
Meindel, Prentice Hall of India.
Reference Books:
1. Designing and Managing the Supply Chain: Concepts, Strategies, and Case Studies, Second
Edition, David Simchi-Levi, Philip Kaminsky, and Edith Simchi-Levi, McGraw-Hill/Irwin,
New York, 2003.
2. Introduction to Supply Chain Management, Robert Handfield & Ernest Nichols, Prentice hall.
197
TECHNOLOGY
SEVENTH SEMESTER
Human Rights and Duties

L T P C
Course Code: Human Rights and Duties 2 0 0 2
BTAIO719
COURSE OBJECTIVES
 To enhance the knowledge and understanding of human rights.
 To foster attitudes of tolerance, respect, solidarity, and responsibility.
 To develop awareness of how human rights can be translated into social and political
reality.
 To develop skills for protecting human rights.
COURSE OUTCOMES
 Illustrate the fundamental knowledge about concepts of human rights, evolution and its
different aspect at national and international perspective.
 Perceive the human rights enforcement mechanism under UN bodies and domestic
institutions like NHRC and Judiciary.
UNIT I
Human Rights: Concept, Origin and Importance; Kinds of Human Rights and its different
perspectives; Human Rights and Duties; Democracy & Human Rights.
UNIT II
Human Rights in National Perspective: Indian State and Human Rights Law; Indian perspective
of Human Rights: Development, Human Rights concern of vulnerable groups.
UNIT III
Human Rights in International Perspective: United Nation and Human Rights; International Bill
of Human Rights- UDHR, ICCPR, ICESCR
UNIT IV
Enforcement Mechanism of Human Rights: UN, NHRC & Judiciary
198
TECHNOLOGY
UNIT V
Protection of Human Rights in Globalised World; Climate Change and Human Rights; Business
and Human Rights relationship; terrorism and Human Rights.
Text Book:
1. Cindy Holder & David Reidy, “Human Rights: The Hard Questions” Cambridge
University Press (2013)
2. Janusz Symonides, New Dimensions And Challenges For Human Rights, Rawat
Publication
Reference Books:
1. Alston, Phillip, The United Nations and Human Rights, Clarendon Press, London (1995).
2. Bajwa, G.S. and D.K. Bajwa, Human Rights in India: Implementation and Violations, D.K.
Publishers, New Delhi (1996).
3. Basu, D.D., Human Rights in Constitutional Law, Prentice Hall, New Delhi (1994).
4. Sehgal, B.P.Singh, ed., Human Rights in India: Problems and Perspectives, Deep and Deep
Publications, New Delhi (1999).
5. S.K.Avesti and R.P.Kataria, Law Relating to Human Rights, Orient Publications, New Delhi
(2000)
6. SK Kapoor, Human Rights under International and Indian Law, Central Law Agency,
Allahabad, (1999) 7. HO Agarwal, Human Rights, Central Law Publications, Allahabad, (12th
Edn. - 2012)
199
TECHNOLOGY
SEVENTH SEMESTER
Indian Music System
Indian Music System L T P C

Course Code:
2 0 0 2
BTAIO723
COURSE OBJECTIVES
To enable the student learners acquire a basic knowledge of the Indian Music System at
the beginner‟s level and also know the culture in Music field
COURSE OUTCOMES
 Build their Musical Skills
 Identify different Ragas and Talas in Indian Music System
UNIT-1
The study of sound and concept of Naad/swar - Brief history of Indian Music - Study of
Technical terms of Indian Music
UNIT-II
An introduction to Raga, Classification of Raga, Component/technical terms & structure of
presentation of Raga
UNIT-II
Rhythm & Music Laya & Taal Writing of basic taalas-teental, ektaal, rupak, jhaptaal - Writing
an essay of 1000 words on relationship between Music and the subject belongs to you –
UNIT-III
Music therapy and its impact on human body - Different kind of compositional forms and their
evolution - Understanding music through Rag Mala painting
UNIT-IV
Establishment of ShudhSwaras on 22 Shruties in relation to the vibration and length of strings
according to the ancient, medieval and modern scholars. Classification of Indian Instruments,
History of Indian Music of Ancient period with special reference to books/granthas.
200
TECHNOLOGY
UNIT- V
Preliminary knowledge of western music: (i) Swar (ii) Scale (iii) Harmony (iv) Melody. Nine
Jaties :Odav, Shadav, Sampoorn in detail. Life Histories and contributions of the following
musicians: PanditRavishanker ,PanditBheemsen Joshi
Reference Books:
1. SangeetVisharad - Vasant
2. SangeetShastraDarpan - Shanti Goverdhan Part I, II and III
3. Rag Parichaya - H.C. Shrivastav Part I, II and III
4. SulabhSangeetShastra (Part III) - R.N. Telegaonkar
5. KaramikPustakMalika - V.N. Bhatkhande Part II & III
6. Rag Prabhakar - R.K. Vyas
7. HamareSangeetRatan - L.N. Garg
8. Sitar Malika - L.N. Garg
201
TECHNOLOGY
SEVENTH SEMESTER
Intellectual Property Rights

L T P C
Course Code: Intellectual Property Rights 2 0 0 2
BTAIO720
COURSE OBJECTIVES
 To give an idea about IPR, registration and its enforcement.
 To aware about current trends in IPR and Govt. steps in fostering IPR
 To introduce fundamental aspects of Intellectual property Rights to students who are
going to play a major role in development and management of innovative projects in
industries.
 To disseminate knowledge on patents on copyrights and its related rights
COURSE OUTCOMES
 Organize Intellectual Property portfolio to enhance the value of the firm.
 Apply intellectual property law principles (including copyright, patents, designs and
trademarks) to real problems and analyze the social impact of intellectual property law
and policy
UNIT I
Introduction to IPRs, Basic concepts and need for Intellectual Property – Patents, Copyrights,
Geographical Indications, IPR in India and Abroad – Genesis and Development – the way from
WTO to WIPO –TRIPS, Nature of Intellectual Property, Industrial Property, technological
Research, Inventions and Innovations – Important examples of IPR.
UNIT II
Registration of IPRs: Meaning and practical aspects of registration of Copy Rights, Trademarks,
Patents, Geographical Indications, Trade Secrets and Industrial Design registration in India and
Abroad
UNIT III
Agreements and Legislations: International Treaties and Conventions on IPRs, TRIPS
Agreement, PCT Agreement, Patent Act of India, Patent Amendment Act, Design Act,
Trademark Act, Geographical Indication Act, Introduction to copyright and scope
202
TECHNOLOGY
UNIT IV
Digital Products and Law: Digital Innovations and Developments as Knowledge Assets – IP
Laws, Cyber Law and Digital Content Protection – Unfair Competition – Meaning and
Relationship between Unfair Competition and IP Laws, – Case Studies
UNIT V
Enforcement of IPRs and Patents: Infringement of IPRs, Enforcement Measures, Emerging
issues – Case Studies, Patent, Criteria for patentability and non-patentable inventions, Procedure
for registration and term of protection, Grants of patent, rights of patentee and revocation of
patent, Compulsory licence and government use of patent, Infringement, exceptions to
infringement of patent and remedies, Patent office and Appellate Board
Text Books:
1. V. Scople Vinod, Managing Intellectual Property, Prentice Hall of India pvt Ltd, 2012
2. S. V. Satakar, ―Intellectual Property Rights and Copy Rights, Ess Ess Publications,
New Delhi, 2002
References:
1. Deborah E. Bouchoux, Intellectual Property: The Law of Trademarks, Copyrights,

Patents and Trade Secrets, Cengage Learning, Third Edition, 2012.
2. Prabuddha Ganguli, Intellectual Property Rights: Unleashing the Knowledge
Economy, McGraw Hill Education, 2011.
3. Edited by Derek Bosworth and Elizabeth Webster, The Management of Intellectual
Property, Edward Elgar Publishing Ltd., 2013.
203
TECHNOLOGY
SEVENTH SEMESTER
Mass Communication and Journalism

L T P C
Course Code: Mass Communication and Journalism
2 0 0 2
BTAI0722
COURSE OBJECTIVES
 To provide knowledge and fundamentals of communication.
 To make the student equipped with essential skills required for working in various media
organizations
COURSE OUTCOMES
The Students will able to
 Develop communication skills, appreciation for creativity, critical thinking, and
analytical approach
 Adapt functional knowledge of the underlying principles and recent emerging trends of
the media industry.
 create, design, conceptualize high-quality media content for print, TV, radio, films and
various digital platforms like social media, mobile etc.
UNIT I
Communication and Journalism:
Communication and Journalism: Basic terms, Concepts and definition, Nature and Process.
Types of communication. Access and Mass Communication – Nature of Media and Content.
Mass communication in India – Reach, Nature of Audience.
UNIT II
Role of Media in Society:
Characteristics of Indian Society – Demographic and Sociological impact of media in

general. Impact of media on specific audiences – Women, children, etc.Mass media effects
studies and their limitations. Mass campaigns for specific issues – Social concerns,
environment, human rights, gender equality.The press, radio, television, cinema and
traditional form of communication.
204
TECHNOLOGY
UNIT III
Journalism as a Profession:
Journalists – Their role and responsibilities. Indian Constitution and freedom of press.
Research restrictions. Ethics and journalism. Careers in journalism and Mass media. Training
problems, perception and response by the industry Media management – Principles and
practices. Professional organizations in media. Media Laws in India.
UNIT IV
History of Media:
History of Print and Broadcast media in general with particular reference to India,
Development of Television – Perception, initial development and experimental approach;
SITE phase and evaluation; Expansion of television, Cinema – Historical overview and
contemporary analysis – Commercial, parallel and documentary genres – Problems and
prospects for the film industry.
UNIT V
Communication and theories of social change:

Communication and theories of social change. Role of media in social change – Dominant
paradigms.Critique of the Dominant paradigm and alternative conception. Development
initiatives – State, market and the third force (NGO sector). Participatory approaches and
community media – Ownership and management perspectives.
Text Books:
1. Mass communication Principles and Concepts by Hasan S., Second Edition

2. Journalism: Principles and practice by Tony Harcup
Reference Books:
1. Mass communication Principles and practice by B. K. Chaturvedi and S.K. Mittal

2. Handbook of Journalism and Mass Communication by A.K. Shukla
205
TECHNOLOGY
SEVENTH SEMESTER
Social Psychology
Social Psychology L T P C
Course Code:
2 0 0 2
BTAIO721
COURSE OBJECTIVES
 To increase the better interactions in community.
 To apply psychological theories in social life.
COURSE OUTCOMES

 Summarize the major theories, concepts, perspectives, and empirical findings in social
psychology
 Apply social psychological theories and principles to their everyday behavior.
UNIT-I
Introduction: Nature and Scope. Methods of studying social behavior: Observation,
Experimental, Field study, Survey, and Sociometry.
UNIT-II
Socialization: Agents of mechanism, socialization and deviation.
Interpersonal Attraction: Nature, measurement and antecedent conditions of Interpersonal
attraction. Attitude: Nature, formation and change of attitudes, Measurement of attitude.
UNIT-III
Social Perception: Perceiving others: forming impression, Role of non-verbal cues, Group
stereotypes. Primary and Recency effects, Attribution and causality: Biases and theories (Jones
and Davis Kelley). Perceiving Groups: Prejudice, Stereotypes, and Conflicts: Sources, dynamics
and remedial techniques
Unit-IV
Leadership and Communication: Definition and functions of leadership, Trait, Situational,
Interactional, and Contingency approaches to leadership effectiveness. Verbal and non-verbal
strategies of communication, language and social interaction, barriers to communication.
Unit-V
Helping Behaviour: Determinants: personal, situational, and socio-cultural determinants.
Bystander effect. Theoretical perspective; exchange and normative.
206
TECHNOLOGY
Text Books:
1. AlcocKk J.E., Carment, D.W. Sadava, S.W., Collins, J.E. & Green, J.M. (1997). A Text Book of
Social Psychology. Scarborough, Ontario,: Prentice Hall/ Allyn & Bacon.
2. Baron, R.A. & Byrne, D. (2000) Social Psychology. N. Delhi: Prentice Hall.
3. Feldman, R.S. (1985). Social psychology: Theories, Research and Application. New York: Mc
Graw Hill.
207
TECHNOLOGY
SEVENTH SEMESTER
Tourism Concepts and Impacts

L T P C
Course Code: Tourism Concepts and Impacts
2 0 0 2
BTAIO718
COURSE OBJECTIVES
 To understand the basic concept of Tourism.
 To understand the role and function of different part of tourism industry
COURSE OUTCOMES
Students shall able to
 Explain the diverse nature of tourism
 Apply relevant technology for the administration and management of tourism experiences.
 Adapt how to plan, lead, control and organize resources for the effective functioning of
tourism operations.
UNIT I
Concepts, Definitions & Historical development of Tourism. Types of Tourist: Tourist,

traveler, excursionist. Forms of tourism: Inbound, Domestic, International. Tourism System:
Nature, Characteristics and components of tourism industry.
UNIT II
Tourism Demand, Motivation of Tourism Demand. Measuring Tourism Demand. Pattern &
characteristic of tourism supply Factors influencing tourism supply.
UNIT III
Elements of Tourist Destination. Influences of elements on tourist flows. Role of ITDC, State
Tourism Development Corporations, ASI, Ministry of Railways &. Civil Aviation in tourism
development, Role and functions of Important Tourism Organizations: WTO, IATA, PATA,
TAAI, WTTC, FHRAI.
.UNIT IV
Tourist Development VIS-A VIS Impacts, Range of Impacts, costs and benefits of
(sociocultural, economic and physical) at TGR.TTR and TDR.
208
TECHNOLOGY
UNIT V
Impact assessment methods, Social impact assessment, Environmental impact assessment

and environmental audit. Managing impacts: Role of various policy measures, control,
standard capacities.
Text Books:
1. Chuck Y. Gee , Travel industry:

2. R Gartner, Tourism Development: Tourism System: Mill R.C & Morrison
Reference Books:
1. P.M. Seth, Successful Tourism Management:

2. J.K. Sharma , Tourism Planning & Development:
3. Cooper C, Fletcher J, and Gilbert D & Wahill S. Tourism; Principles & Practices
209

B.Tech Hons. CSE With AI-ML All Semesters Course Structure and Syllabus

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

B.Tech Hons. CSE With AI-ML All Semesters Course Structure and Syllabus

Uploaded by

Copyright:

Available Formats

SCHOOL OF ENGINEERING &

B.Tech. (Hons.) Computer Science & Engineering

SCHOOL OF ENGINEERING AND TECHNOLOGY

Program Name and Duration:

Credit Based Grading System

Credit distribution is as follows:-

Objective of the Program:

The Programme Objectives are to prepare the students to:

Outcome of the Program:

Department of Computer Science & Engineering

Lectures Tutorial (T) Practical

6. BTF106 Communication Skills 2 - - 2

7. BTF107 Engineering Physics Lab - - 2 1

Computer Fundamentals And Programming

Total Available Credits 26

Lectures Tutorial (T) Practical

3. BTF203 Basic Electrical & Electronics Engineering 3 - - 3

4. BTF204 Basic Mechanical Engineering 3 - - 3

6. BTF206 Skill for Engineers–I 2 - - 2

10. BTF210 Data Structures Lab - - 4 2

11. BTF211 Workshop Practice - - 4 2

Total Available Credits 25

Lectures Tutorial (T) Practical

6. BTF306 Skills for Engineers II 2 - - 2

8. BTAIC308 Analysis and Design of Algorithms Lab - - 2 1

9. BTAIC309 Java Programming Lab - - 4 2

Total Available Credits 25

Lectures Tutorial (T) Practical

6. BTF406 Skills for Engineers III 2 - - 2

8. BTAIC408 Computer Networks Lab - - 2 1

9. BTAIC409 Python Programming Lab - - 4 2

Total Available Credits 25

Lectures Tutorial (T) Practical

6. BTF506 Skills for Engineers IV 2 - - 2

9. BTAIC509 Database Management System Lab - - 2 1

International Training & Education

Program Elective III

Lectures Tutorial (T) Practical

6. BTAIS606 Machine Learning II Lab - - 4 2

7. BTAIS607 Natural Language Processing Lab - - 4 2

8. BTAIC608 Compiler Design Lab - - 2 1

9. BTAIP609 Minor Project - - 4 2

Total Available Credits 25

Lectures Tutorial (T) Practical

6. BTAIS706 Big Data Analytics Lab - - 4 2

7. BTAIS707 Deep Learning Lab - - 4 2

8. BTAIP708 Industrial Training/ Major Project-I - - 8 4

Total Available Credits 26

Lectures Tutorial (T) Practical

Lecture/ Tutorial/ Practical

GRAND TOTAL (I to VIII Semester) 191

1. B.S, Grewal“Higher Engineering Mathematics”, Khanna Publications, 42thedition.

Mechanical and Electronic Properties of Materials: Stress-strain relationship – Hooke‟s law,

time independent waves equations. Diffraction of X-rays by crystal planes, Imperfections in

Superconductivity and Nanotechnology: Introduction and historical developments; Meissner

Computer Fundamentals and Programming in C

Computer Fundamentals and Programming L T P C

Strings:Standard library string functions, arrays of strings, string manipulation functions,

1. E Balagurusami, “Programming in ANSI C” Tata McGraw-Hill Education, Sixth Edition.

After learning the course the students will be able to

Introduction of Engineering Graphics, Utility of Engineering graphics in respective branch,

Unit III - Projection of planes and solids

Unit IV :Section of Solids