Sri

SAI RAM
INSTITUTE OF TECHNOLOGY
An Autonomous Institution
West Tambaram, Chennai - 44
www.sairamit.edu.in

Approved by AICTE, New Delhi NATIONAL ASSESSMENT AND

ACCREDITATION COUNCIL
ISO 9001 : 2015

Afliated to Anna University

NATIONAL
INSTITUTIONAL
RANKING
FRAMEWORK
ACCREDITED

AUTONOMOUS
REGULATIONS CURRICULUM AND
2020
SYLLABUS
Academic Year 2020-21 onwards I - VIII
SEMESTERS
 SRI SAIRAM INSTITUTE OF TECHNOLOGY

VISION
To be iden fied as a “Centre of Excellence” with high standards of Knowledge
Dissemina on and Research opportuni es and to transform the students to
imbibe quali es of technical exper se of interna onal standards and high levels
of ethical values, who in turn shall contribute to the advancement of society and
human kind.

MISSION
We shall dedicate and commit ourselves to a ain and maintain excellence in
Technical Educa on through commitment and con nuous improvement of
infrastructure and equipment and provide an inspiring environment for Learning,
Research and Innova on for our students to transform them into complete
human beings with ethical and social values.

QUALITY POLICY

We at Sri Sai Ram Ins tute of Technology are commi ed to build a be er na on

through Quality Educa on with team spirit. Our students are enabled to excel in
all values of Life and become Good Ci zens. We con nually improve the System,
Infrastructure and Services to sa sfy the Students, Parents, Industry and Society.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

VISION
To be a centre of excellence in educa ng and gradua ng Computer Engineers by
providing unique environment that foster research, technological, and social
enrichment with intellectual knowledge to acquire interna onal standards.

MISSION

Ÿ To deliver qualified computer professionals having innova ve research

capabili es.
Ÿ To inculcate the spirit of moral values that contributes to societal ethics.
Ÿ To provide training programs that bridges the gap between academia and
industry.
Ÿ To enhance research quality and produc vity through state of the art
facili es.
 Curriculum CSE
AUTONOMOUS CURRICULA AND SYLLABI
Regulations 2020
SEMESTER I
WEEK HOURS TOTAL
S. COURSE
COURSE TITLE CONTACT CREDITS
NO CODE L T P HOURS

THEORY
1 20BSMA101 Engineering Mathematics-I 3 1 0 4 4
2 20HSEN101 Technical English-I 3 0 0 3 3
3 20BSPH101 Engineering Physics 3 0 0 3 3
4 20BSCY101 Engineering Chemistry 3 0 0 3 3
5 20ESCS101 Problem Solving and Programming in C 3 0 0 3 3
6 20ESGE101 Engineering Graphics 1 2 0 3 3
PRACTICALS
7 20BSPL101 Physics and Chemistry Laboratory 0 0 3 3 1.5
8 20ESPL101 Programming in C Laboratory 0 0 3 3 1.5
VALUE ADDITIONS - I
9 20TPHS101 Skill Enhancement 0 0 2 2 1
10 20HSMG101 Personal Values 2 0 0 2 0
TOTAL 29 23

SEMESTER II
WEEK HOURS TOTAL
S. COURSE
COURSE TITLE CONTACT CREDITS
NO CODE L T P HOURS

THEORY

1 20BSMA204 Discrete Structures 3 1 0 4 4

2 20HSEN201 Technical English – II 3 0 0 3 3
3 20BSPH203 Physics for Information Science 3 0 0 3 3
4 20BSCY201 Environmental Science and Engineering 3 0 0 3 3
5 20ESIT202 Python Programming 3 0 0 3 3
6 20ESIT203 Digital Principles and System Design 2 1 0 3 3
PRACTICALS
7 20ESPL201 Python Programming Laboratory 0 0 3 3 1.5
8 20ESPL202 Digital Laboratory 0 0 3 3 1.5
9 20ESGE201 Engineering Practices Laboratory 0 0 3 3 1.5
VALUE ADDITIONS - II
10 20TPHS201 Skill Enhancement 0 0 2 2 1
11 20HSMG201 Interpersonal Values 2 0 0 2 0
TOTAL 33 24.5
 Curriculum CSE

SEMESTER III
WEEK HOURS TOTAL
S. COURSE
COURSE TITLE CONTACT CREDITS
NO CODE L T P HOURS

THEORY

1 20BSMA304 Statistics and Linear Algebra 3 1 0 4 4

2 20CSPC301 Object Oriented Programming 2 1 0 3 3
3 20ESEC301 Communication Engineering 3 0 0 3 3
4 20ITPC301 Data Structures 3 0 0 3 3
5 20ITPC303 Computer Organization and Architecture 3 0 0 3 3
PRACTICALS
6 20ITPL301 Data Structures Laboratory 0 0 3 3 1.5
7 20CSPL301 Object Oriented Programming Laboratory 0 0 3 3 1.5
8 20CSTE301 Live-in-Lab - I 0 0 2 2 1
VALUE ADDITIONS - III
9 20CSTP301 Skill Enhancement 0 0 2 2 1
10 20MGMC301 Constitution of India 2 0 0 2 0
TOTAL 28 21

SEMESTER IV
WEEK HOURS TOTAL
S. COURSE
COURSE TITLE CONTACT CREDITS
NO CODE L T P HOURS

THEORY

1 20BSMA402 Probability and Queuing Theory 3 1 0 4 4

2 20CSPW401 Computer Networks (With Laboratory) 3 0 2 5 4
3 20CSPC401 Operating Systems 3 0 0 3 3
4 20CSPC402 Database Management Systems 3 0 0 3 3
5 20CSPC403 Object Oriented Software Engineering 3 0 0 3 3
6 20ITPC401 Design and Analysis of Algorithms 2 1 0 3 3
PRACTICALS
7 20CSPL401 Operating Systems Laboratory 0 0 3 3 1.5
8 20CSPL402 Database Management Systems Laboratory 0 0 3 3 1.5
9 20CSTE401 Live-in-Lab - II 0 0 2 2 1
VALUE ADDITIONS - IV
10 20CSTP401 Skill Enhancement 0 0 2 2 1
TOTAL 31 25

ii
 Curriculum CSE

SEMESTER V
WEEK HOURS TOTAL
S. COURSE
COURSE TITLE CONTACT CREDITS
NO CODE L T P HOURS

THEORY

1 20CSPC501 Internet Programming 3 0 0 3 3

2 20CSPC502 Theory of Computation 2 1 0 3 3
3 20ESEC502 Microprocessors and Microcontrollers 3 0 0 3 3
4 20CSPC503 Mobile Computing 3 0 0 3 3
5 20XXELXXX Professional Elective – I 3 0 0 3 3
6 20XXOEXXX Open Elective - I 3 0 0 3 3
PRACTICALS
7 20CSPL501 Internet Programming Laboratory 0 0 4 4 2
8 20ESPL501 Microprocessors & Microcontrollers
Laboratory 0 0 3 3 1.5
9 20CSTE501 Live in Lab - III 0 0 4 4 2

VALUE ADDITIONS - V
10 20CSTP501 Skill Enhancement 0 0 2 2 1

TOTAL 31 24.5

SEMESTER VI
WEEK HOURS TOTAL
S. COURSE
COURSE TITLE CONTACT CREDITS
NO CODE L T P HOURS

THEORY

1 20CSPC601 Articial Intelligence 3 0 0 3 3

2 20CSPC602 Compiler Design 3 0 0 3 3
3 20CSPC603 Cloud Computing 3 0 0 3 3
4 20XXELXXX Professional Elective – II 3 0 0 3 3
5 20HSMG601 Principles of Engineering Management 3 0 0 3 3
PRACTICALS
6 20CSPL601 Articial Intelligence Laboratory 0 0 3 3 1.5
7 20CSPL602 Cloud Computing Laboratory 0 0 3 3 1.5
8 20HSPL501 Communication and Soft Skills Laboratory 0 0 2 2 1
9 20CSPJ601 Innovative Design Project 0 0 2 2 1
VALUE ADDITIONS - VI
10 20CSTP601 Skill Enhancement 0 0 2 2 1
TOTAL 27 21
iii
 Curriculum CSE

SEMESTER VII
WEEK HOURS TOTAL
S. COURSE
COURSE TITLE CONTACT CREDITS
NO CODE L T P HOURS

THEORY

1 20CSPC701 Big Data Analytics 3 0 0 3 3

2 20CSPC702 Machine Learning Techniques 3 0 0 3 3
3 20ITPC701 Cryptography and Network Security 3 0 0 3 3
4 20XXELXXX Professional Elective -III 3 0 0 3 3
5 20XXOEXXX Open Elective – II 3 0 0 3 3
PRACTICALS
6 20CSPL701 Big Data Analytics Laboratory 0 0 3 3 1.5
7 20ITPL701 Cryptography & Network Security Laboratory 0 0 3 3 1.5
8 20CSPJ701 Project Phase - I 0 0 4 4 2
VALUE ADDITIONS - VII
10 20CSTP701 Skill Enhancement 0 0 2 2 1
TOTAL 27 21

SEMESTER VIII
WEEK HOURS TOTAL
S. COURSE
COURSE TITLE CONTACT CREDITS
NO CODE L T P HOURS

THEORY

1 20XXELXXX Professional Elective - IV 3 0 0 3 3

PRACTICAL
2 20CSPJ801 Project Phase - II 0 0 8 8 4
TOTAL 11 7

CREDIT DISTRIBUTION

Category BS ES HS EL PC+PL PW OE TE PJ TP IS MC TOTAL

Credit 29.5 25.5 10 12 62 04 06 04 7 7 3 Y 170

Percentage 17.4 15.0 5.9 7.1 36.5 2.4 3.5 2.4 4.1 4.1 1.8 -

*IS-Internship

iv
 Curriculum CSE

PROFESSIONAL ELECTIVES - I
S. COURSE WEEK HOURS TOTAL
COURSE TITLE CONTACT CREDIT STREAM
NO CODE L T P HOURS

Articial
1. 20CSEL501 Data Warehousing and Data Mining 3 0 0 3 3 Intelligence
Cloud Computing
2. 20CSEL502 Cyber Forensics 3 0 0 3 3 & Security
Cloud Computing
3. 20CSEL503 Distributed Systems 3 0 0 3 3 & Security
Data
4. 20CSEL504 Foundation of Data Science 3 0 0 3 3 Science
5. 20CSEL505 NoSQL Database 3 0 0 3 3 Data
Science
6. 20ITEL601 Software Testing 3 0 0 3 3 Software Engg.
& Computing
7. 20ITEL706 Computer Graphics and Multimedia 3 0 0 3 3 Software Engg.
& Computing
Internet of
8. 20ITEL702 Wireless Ad Hoc and Sensor Networks 3 0 0 3 3 Things
Articial
9. 20ITEL804 Digital Image Processing 3 0 0 3 3 Intelligence
Internet of
10. 20ITEL709 Internet of Things 3 0 0 3 3 Things
11. 20MGEL501 Intellectual Property Rights 3 0 0 3 3 Management

PROFESSIONAL ELECTIVES - II
S. COURSE WEEK HOURS TOTAL
COURSE TITLE CONTACT CREDIT STREAM
NO CODE L T P HOURS
Software Engg.
1 20CSEL601 Software Project Management 3 0 0 3 3 & Computing
Cloud Computing
2 20CSEL602 Digital Forensics 3 0 0 3 3 & Security
Cloud Computing
3 20CSEL603 Virtualization Technologies 3 0 0 3 3 & Security
Data
4 20CSEL604 Bio Informatics 3 0 0 3 3 Science
5 20CSEL605 Predictive Modeling 3 0 0 3 3 Data
Science
Internet of
6 20CSEL606 IoT Architecture, Network & Security 3 0 0 3 3 Things
7 20CSEL607 Agile Methodologies 3 0 0 3 3 Software Engg.
& Computing
Internet of
8 20ITEL607 Embedded Systems 3 0 0 3 3 Things
Articial
9 20CSEL608 Soft Computing 3 0 0 3 3 Intelligence
10 20ITEL806 Pattern Recognition Techniques 3 0 0 3 3 Articial
Intelligence
11. 20MGEL601 Total Quality Management 3 0 0 3 3 Management

v
 Curriculum CSE

PROFESSIONAL ELECTIVES - III

S. COURSE WEEK HOURS TOTAL
COURSE TITLE CONTACT CREDIT STREAM
NO CODE L T P HOURS

Data
1. 20CSEL701 Social Network Analysis 3 0 0 3 3 Science
Cloud Computing
2. 20CSEL702 Software Dened Networks 3 0 0 3 3 & Security
Articial
3. 20CSEL703 Information Retrieval Techniques 3 0 0 3 3 Intelligence
4. 20CSEL704 Natural Language Processing 3 0 0 3 3 Articial
Intelligence
5. 20CSEL705 Ethical Hacking 3 0 0 3 3 Cloud Computing
& Security
6. 20CSEL706 Multi-core Architectures and
Internet of
Programming 3 0 0 3 3 Things
Data
7. 20CSEL707 Web Analytics 3 0 0 3 3 Science
8. 20CSEL708 IT Security Compliance and Forensics 3 0 0 3 3 Software Engg.
& Computing
Internet of
9. 20MEPC702 Robotics and Applications 3 0 0 3 3 Things
10. 20ITEL803 Intrusion Detection Systems 3 0 0 3 3 Software Engg.
& Computing
11. 20MGEL701 Foundation Skills in Integrated Management
Product Development 3 0 0 3 3

PROFESSIONAL ELECTIVES - IV
S. COURSE WEEK HOURS TOTAL
COURSE TITLE CONTACT CREDIT STREAM
NO CODE L T P HOURS
Cloud Computing
1 20CSEL801 Green Computing 3 0 0 3 3 & Security
Data
2 20CSEL802 Deep Learning Principles & Practices 3 0 0 3 3 Science
3 20CSEL803 Block Chain and Crypto
Cloud Computing
Currency Technologies 3 0 0 3 3 & Security
Software Engg.
4 20CSEL804 Software Quality Assurance 3 0 0 3 3 & Computing
Articial
5 20CSEL805 Speech Processing 3 0 0 3 3 Intelligence
Software Engg.
6 20CSEL806 Cognitive Science 3 0 0 3 3 & Computing
Articial
7 20CSEL807 Computer Vision 3 0 0 3 3 Intelligence
8 20CSEL808 Scientic Visualization Techniques 3 0 0 3 3 Data
Science
Internet of
9 20CSEL809 Game Programming 3 0 0 3 3 Things
10 20ITEL802 Virtual & Augmented Reality 3 0 0 3 3 Internet of
Things
11. 20HSMG301 Professional Ethics and Values 3 0 0 3 3 Management

vi
 Curriculum CSE
PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

PEO1 To enable graduates to have sound knowledge in the core competency areas of
Mathematics, Scientic and Engineering concepts to analyse and solve problems
in the eld of Computer Science and Engineering.
PEO 2 To empower graduates to excel in collaborative learning and the spirit of teamwork
through multidisciplinary projects with current tools and technologies to meet
Industrial and Societal needs.
PEO 3 To facilitate graduates to have the ability and attitude to acquire new skills and
adapt to emerging technological changes.
PEO 4 To ensure graduates can pursue Higher Education, Research, as Entrepreneurs
or have a successful career in Industry.

PROGRAM SPECIFIC OUTCOMES (PSOs)

PSO 1 The Computer Science and Engineering graduates are able to analyze, design,
develop, test and apply management principles, mathematical foundations in the
development of computational solutions, make them to expert in designing the
computer software and hardware.
PSO 2 Develop their skills to solve problems in the broad area of programming concepts
and appraise environmental and social issues with ethics and manage different
projects in inter-disciplinary eld.
COMPONENTS OF THE CURRICULUM (COC)

Curriculum Content Total number

Total Number
Course Component (% of total number of of contact
of credits
credits of the program) hours
Basic Sciences(BS) 17.4 31 29.5
Engineering Sciences(ES) 15.0 33 25.5
Humanities and Social Sciences (HS) 5.9 12 10
Professional Electives(EL) 7.1 12 12
Program Core+Program Lab (PC+PL) 36.5 76 62
Program theory with Lab (PW) 2.4 05 04
Open Electives (OE) 3.5 06 06
Talent Enhancement (TE) 2.4 08 04
Project (PJ) 4.1 14 07
Training & Placement (TP) 4.1 14 07
Internships/Seminars (IS) 1.8 - 03
Mandatory Courses (MC) NA 06 NA
Total number of Credits 217 170
vii
 Curriculum CSE

PROGRAMME OUTCOMES(POs)
PROGRAM OUTCOME REPRESENTS THE KNOWLEDGE, SKILLS
AND ATTITUDES THAT THE STUDENTS WOULD BE EXPECTED TO
HAVE AT THE END OF THE 4 YEAR ENGINEERING DEGREE PROGRAM

12 02
Life-long
learning
01 Problem
Analysis
Engineering
Recognize the need for, and Identify and analyze
have the preparation, ability to
knowledge complex engineering
engage in independent and Apply the basic principle problems reaching logical
life-long learning in the context and knowledge of conclusions using the basic
of technological change. mathematics, science and principles of mathematics,
engineering principles to science and engineering.
solve technical problems.

11 03
Project Development
management of solutions
Demonstrate knowledge and Design solutions for
apply the principles of well-defined technical
engineering & management problems and assist with
in their own / team projects in
ING DE
EER
the design of systems,
multidisciplinary environments. components or processes

IN G to meet specified needs.

ENG

RE

10 04
E

Communicate Investigate
effectively complex problems
Communicate effectively Perform investigations, use
amongst the engineering research based knowledge
community, being able to and conduct experiments,
comprehend & write effective analyze and interpret the
reports, make presentations & results to provide valid
give/receive clear instructions. conclusions.

09
Individual &
05
Modern
Teamwork tool usage
Function effectively as Create, select and apply the
an individual, and as a latest techniques, resources
member or leader in and modern engineering / IT

07
diverse teams, and in tools to develop appropriate

08 06
multi-disciplinary solutions with an understanding
professional settings. of the limitations.
Environment &
Apply ethical Sustainability The Engineer
principles Demonstrate professional and Society
Apply ethical principles skills, knowledge and Apply reasoning based on
and commit to professional contextual reasoning to contextual knowledge to
ethics and responsibilities assess / environmental / assess societal, legal and
based on the norms of societal issues for cultural issues with
professional engineering sustainable development. competency in professional
pratices. engineering practices.

viii
 Syllabus CSE

SEMESTER - I
20BSMA101 L T P C
ENGINEERING MATHEMATICS-I
SDG NO. 4 & 9 3 1 0 4
OBJECTIVES:
The intent of this course is
l To understand and gain knowledge in the concepts of matrix algebra
l To introduce the notion of limits, continuity, differentiation and maxima and
minima of functions
l To acquaint the concept of definite and improper integrals and their
applications
l To provide an understanding of double and triple integrals
l To acquire knowledge in representing elementary and periodic functions as
an infinite series

UNIT I MATRICES 12
Symmetric, skew symmetric and orthogonal matrices; Eigenvalues and
Eigenvectors of a real matrix – Characteristic equation – Properties of
Eigenvalues and Eigenvectors – Cayley-Hamilton theorem(excluding proof) –
Reduction of a Quadratic form to Canonical form using Orthogonal
Transformation - Nature of Quadratic forms.

UNIT II DIFFERENTIAL CALCULUS 12

Limit, continuity, Differentiation rules - Maxima and Minima of functions of
one variable, partial derivatives, Taylor's series for functions of two variables,
Jacobian, Maxima & Minima of functions of several variables, saddle points,
Method of Lagrange multipliers.

UNIT III INTEGRAL CALCULUS 12

Evaluation of definite and improper integral - Techniques of Integration-
Substitution rule - Integration by parts, Integration of rational functions by
partial fraction, Integration of irrational functions - Applications of definite
integrals to evaluate surface areas and volumes of revolution.

UNIT IV MULTIPLE INTEGRALS 12

Double integrals – Change of order of integration – Double integrals in polar
coordinates – Area enclosed by plane curves – Triple integrals – Volume of
solids – Change of variables in double and triple integrals.

1
 Syllabus CSE
UNIT V SEQUENCES AND SERIES 12
Introduction to sequences and series – power series – Taylor's series – series
for exponential, trigonometric, logarithmic, hyperbolic functions – Fourier
series – Half range Sine and Cosine series – Parseval's theorem.
TOTAL: 60 PERIODS
TEXTBOOKS:
1. James Stewart, “Calculus: Early Transcendentals”, Cengage Learning, 7th
Edition, New Delhi, 2015.
2. B. V. Ramana, “Higher Engineering Mathematics”, Tata McGraw-Hill, New
Delhi, 11th Reprint, 2010.

REFERENCES:
1. G.B. Thomas and R.L. Finney, “Calculus and Analytic Geometry”, 9th Edition,
Pearson, Reprint, 2002.
2. Erwin Kreyszig, “Advanced Engineering Mathematics”, 9th Edition, John
Wiley & Sons, 2006.
3. T. Veerarajan, “Engineering Mathematics for first year”, Tata McGraw-Hill,
New Delhi, 2008.
4. N.P. Bali and Manish Goyal, “A text-book of Engineering Mathematics”,
Laxmi Publications, Reprint, 2008.
5. B. S. Grewal, “Higher Engineering Mathematics”, Khanna Publishers, New
Delhi, 40th Edition, 2014.

WEB REFERENCES:
1. https://math.mit.edu/~gs/linearalgebra/ila0601.pdf
2. http://ocw.mit.edu/ans7870/18/18.013a/textbook/HTML/chapter30/
3. https://ocw.mit.edu/courses/mathematics/18-02sc-multivariable-
calculus-fall-2010/2.-partial-derivatives/
4. http://ocw.mit.edu/ans7870/18/18.013a/textbook/HTML/chapter31/

ONLINE RESOURCES:
1. https://www.khanacademy.org/math/linear-algebra/alternate-
bases/eigen-everything/v/linear-algebra-introduction-to-eigenvalues-
and-eigenvectors
2. https://www.khanacademy.org/math/differential-calculus

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand the concepts of symmetric, skew symmetric, orthogonal
matrices, properties of Eigen values and eigen vectors, the nature of a
quadratic form, sequences and series, power series representation of
2
 Syllabus CSE
functions, series representation of exponential, trigonometric logarithmic
and hyperbolic functions. (K2)
2. Compute the eigen values, eigen vectors of a matrix, diagonalize the
quadratic form using orthogonal transformation and find the inverse and
higher powers of a matrix using Cayley Hamilton theorem. (K3)
3. Calculate the limit, derivative, partial derivatives, Jacobians of simple
functions and evaluate integrals of single variable using the rules of
integration. (K3)
4. Determine the Taylor series representation of functions of one variable
and two variables and evaluate maxima and minima of functions of one
variable, two variables and several variables. (K3)
5. Evaluate double integrals using change of order technique, double and
triple integrals using change of variables technique and calculate surface
areas and volume of solids of revolution. (K3)
6. Compute the Fourier series, Sine and Cosine series representation of
functions defined in a period and use Fourier series and Parseval’s
theorem to find the value of infinite series. (K3)

CO - PO MAPPING :
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 3 2 1 - - - - - - - 1

CO2 3 3 2 1 - - - - - - - 1

CO3 3 3 2 1 - - - - - - - 1

CO4 3 3 2 1 - - - - - - - 1

CO5 3 3 2 1 - - - - - - - 1

CO6 3 3 2 1 - - - -- - - - 1

SEMESTER - I
20HSEN101 L T P C
TECHNICAL ENGLISH - I
SDG NO. 4 3 0 0 3
OBJECTIVES:
●
l To develop the basic LSRW skills of the students
●
l To encourage the learners to adapt to listening techniques
●
l To help learners develop their communication skills and converse fluently
in real contexts
●
l To help learners develop general and technical vocabulary through reading
and writing tasks
3
 Syllabus CSE
●
l To improve the language proficiency for better understanding of core
subjects

UNIT I INTRODUCTION 9
Listening – short texts – formal and informal conversations - Speaking –
basics in speaking – speaking on given topics & situations – recording
speeches and strategies to improve - Reading – critical reading – finding key
information in a given text – shifting facts from opinions - Writing – free
writing on any given topic – autobiographical writing - Language
Development – tenses – voices- word formation: prefixes and suffixes – parts
of speech – developing hints

UNIT II READING AND LANGUAGE DEVELOPMENT 9

Listening - long texts - TED talks - extensive speech on current affairs and
discussions -Speaking – describing a simple process – asking and answering
questions - Reading comprehension – skimming / scanning / predicting &
analytical reading – question & answers – objective and descriptive answers
–identifying synonyms and antonyms - process description - Writing
instructions – Language Development – writing definitions – compound
words - articles – prepositions

UNIT III SPEAKING AND INTERPRETATION SKILLS 9

Listening - dialogues & conversations - Speaking – role plays – asking about
routine actions and expressing opinions - Reading longer texts & making a
critical analysis of the given text - Writing – types of paragraph and writing
essays – rearrangement of jumbled sentences - writing recommendations -
Language Development – use of sequence words - cause & effect expressions
- sentences expressing purpose - picture based and newspaper based
activities – single word substitutes

UNIT IV VOCABULARY BUILDING AND WRITING SKILLS 9

Listening - debates and discussions – practicing multiple tasks – self
introduction – Speaking about friends/places/hobbies - Reading -Making
inference from the reading passage – Predicting the content of the reading
passage - Writing – informal letters/e-mails - Language Development -
synonyms & antonyms - conditionals – if, unless, in case, when and others –
framing questions.

UNIT V LANGUAGE DEVELOPMENT AND TECHNICAL WRITING 9

Listening - popular speeches and presentations - Speaking - impromptu
speeches & debates - Reading - articles – magazines/newspapers Writing –
essay writing on technical topics - channel conversion – bar diagram/ graph –
4
 Syllabus CSE
picture interpretation - process description - Language Development –
modal verbs - fixed / semi-fixed expressions – collocations
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Board of Editors. Using English: A Coursebook for Undergraduate
Engineers and Technologists. Orient Blackswan Limited, Hyderabad:
2015.
2. Dhanavel, S.P. English and Communication Skills for Students of Science
and Engineering. Orient Blackswan, Chennai, 2011.

REFERENCES:
1. Anderson, Paul V. Technical Communication: A Reader – Centered
Approach. Cengage, New Delhi, 2008.
2. Smith-Worthington, Darlene & Sue Jefferson. Technical Writing for
Success. Cengage, Mason, USA, 2007.
3. Grussendorf, Marion, English for Presentations, Oxford University Press,
Oxford, 2007.
4. Chauhan, Gajendra Singh and et.al.Technical Communication (Latest
Revised Edition). Cengage Learning India Pvt. Limited, 2018.

WEB REFERENCES:
1. https://swayam.gov.in/nd1_noc19_hs31/preview
2. http://engineeringvideolectures.com/course/696

ONLINE RESOURCES:
1. h t t p s : / / w w w. p e a r s o n . c o m / e n g l i s h / c a t a l o g u e / b u s i n e s s -
english/technical-english.html
2. https://www.cambridgeenglish.org/learning-english/free-resources/

OUTCOMES:
Upon completion of the course, the student should be able to
1. Comprehend conversations and talks presented in English (K2)
2. Speak fluently in informal and formal contexts (K1)
3. Read articles of any kind and be able to comprehend (K2)
4. Write technical concepts in simple and lucid style (K2)
5. Prepare informal letters and e-mails efficiently (K3)
6. Present technical concepts and summaries in correct grammar and
vocabulary (K1)

5
 Syllabus CSE
CO - PO MAPPING :
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 - 2 - - - - 1 - - 3 - -

CO2 1 - - - - - - - - 3 - -

CO3 - - - - - - - - - - 3 2

CO4 - 3 - - - - - - 2 - - -

CO5 - - - - - - - - - 3 - -

CO6 - - - - - - 3 - - - 2 -

SEMESTER - I
20BSPH101 L T P C
ENGINEERING PHYSICS
SDG NO. 4 3 0 0 3

OBJECTIVES:
l To educate and enhance the fundamental knowledge in Physics and its
applications relevant to various streams of Engineering and Technology

UNIT I CRYSTAL PHYSICS 9

Single crystalline, Polycrystalline and Amorphous materials - single crystals:
unit cell, crystal systems, Bravais lattices, directions and planes in a crystal -
Miller indices - Interplanar distance - Powder diffraction method - Debye
Scherer formula - Calculation of number of atoms per unit cell - Atomic radius -
Coordination number - packing factor for SC, BCC, FCC and HCP structures -
Polymorphism and allotropy - Diamond and Graphite structure (qualitative) -
Growth of single crystals: Solution and Melt growth Techniques.

UNIT II PROPERTIES OF MATTER 9

Elasticity - Stress - strain diagram and its uses - Poisson's ratio - Relationship
between three moduli of elasticity (qualitative) - Factors affecting elastic
modulus and tensile strength - Twisting couple - shaft - Torsion pendulum:
theory and experiment - bending of beams - bending moment - cantilever:
theory and experiment - uniform and non-uniform bending: theory and
experiment - I-shaped girders - stress due to bending in beams.

UNIT III QUANTUM PHYSICS 9

Black body radiation - Planck's theory (derivation) - Compton effect: theory -
6
 Syllabus CSE
wave particle duality - electron diffraction - progressive waves - wave equation
- concept of wave function and its physical significance - Schrödinger's wave
equation - Time independent and Time dependent equations - particle in a box
(one dimensional motion) - Tunneling (qualitative) - scanning tunneling
microscope.

UNIT IV LASERS AND FIBER OPTICS 9

Lasers: population of energy levels, Einstein's A and B coefficients derivation -
pumping methods - resonant cavity, optical amplification (qualitative) - three
level and four level laser - CO2 laser - Semiconductor lasers: Homojunction and
Heterojunction.
Fiber optics: Principle, Numerical aperture and Acceptance angle - Types of
optical fibers (material, refractive index, mode) - Losses associated with
optical fibers - Fiber Optical Communication system (Block diagram) - Fiber
optic sensors: pressure and displacement.

UNIT V THERMAL PHYSICS 9

Transfer of heat energy - thermal expansion of solids and liquids - bimetallic
strips - thermal conduction, convection and radiation - heat conduction in
solids (qualitative) - thermal conductivity - Forbe's and Lee's disc method:
theory and experiment - conduction through compound media (series and
parallel) - thermal insulation - applications: heat exchangers, refrigerators
and solar water heaters.
TOTAL : 45 PERIODS
TEXT BOOKS:
1. D.K. Bhattachary & T.Poonam, “Engineering Physics”. Oxford University
Press, 2015.
2. R.K. Gaur& S.L. Gupta, “Engineering Physics”. Dhanpat Rai Publishers,
2012.
3. B.K. Pandey & S.Chaturvedi, “Engineering Physics”, Cengage Learning
India, 2017.
4. V. Rajendran, “Engineering Physics”, Mc Graw Hill Publications Ltd. New
Delhi, 2014.
5. M.N. Avadhanulu& P.G. Kshirshagar, “A textbook of Engineering Physics”,
S. Chand & Co Ltd. 2016.

REFERENCES:
1. D. Halliday, . Resnick & J. Walker, “Principles of Physics”, Wiley, 2015.
2. R.A. Serway, & J.W. Jewett, “Physics for Scientists and Engineers”, Cengage
Learning, 2010.
3. N.K. Verma,” Physics for Engineers”, PHI Learning Private Limited, 2014.
7
 Syllabus CSE
4. P.A. Tipler & G. Mosca “Physics for Scientists and Engineers”,
W.H.Freeman, 2020.
5. Brijlal and Subramanyam, “Properties of Matter”, S. Chand Publishing,
2018.
6. Shatendra Sharma & Jyotsna Sharma, “Engineering Physics”, Pearson,
2018.

OUTCOMES :
Upon completion of the course, the student should be able to
1. Understand the basics of crystals, structures and crystal growth
techniques (K3)
2. Select a right choice of materials based on their properties for potential
applications / acquire fundamental knowledge on elasticity and its
applications relevant to the field of engineering (K3)
3. Apply the advanced physics concepts of quantum theory to characterize
the matter (K4)
4. Understand the basic concepts in laser and its types and fiber optics (K3)
5. Acquire adequate knowledge on the fundamental concepts of thermal
properties of materials (K2)
6. Evaluate the applications of powder diffraction method, optical fibers in
sensors, quantum mechanical tunneling and thermal materials in
expansion joints and heat exchangers (K4)

CO - PO MAPPING :
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 2 3 3 - - - - - - - 1

CO2 3 2 3 3 - - 2 - - - - 3

CO3 3 3 3 2 - - 3 - - - - 2

CO4 3 3 3 3 - - - - - - - 3

CO5 3 3 3 3 - - 3 - - - - 3

CO6 3 3 3 3 - - 3 - - - - 3

8
 Syllabus CSE
SEMESTER - I
20BSCY101 L T P C
ENGINEERING CHEMISTRY
SDG NO. 4,6&7 3 0 0 3

OBJECTIVES:
l To make the students conversant with boiler feed water requirements,
related problems and water treatment techniques
l To illustrate the principles of electrochemical reactions, redox reactions in
corrosion of materials and methods for corrosion prevention and
protection of materials
l To categorize types of fuels, calorific value calculations, manufacture of
solid, liquid and gaseous fuels
l To demonstrate the principles and generation of energy in batteries,
nuclear reactors, solar cells, windmills and fuel cells
l To recognize the applications of polymers, composites and nano-materials
in various fields

UNIT I WATER TECHNOLOGY AND SURFACE CHEMISTRY 9

Water Technology : Introduction – Hard water and Soft water. Hardness of
water – types – expression of hardness (numerical problems). Boiler troubles
– scale and sludge, priming and foaming, caustic embrittlement and boiler
corrosion. Treatment of boiler feed water – Internal treatment (carbonate,
phosphate, calgon, colloidal and sodium aluminate conditioning). External
treatment – Ion exchange process, Zeolite process –Domestic water treatment
(break point chlorination) –Desalination of brackish water – Reverse
Osmosis.
Surface Chemistry: Adsorption – types – adsorption of gases on solids –
adsorption of solutes from solution – applications of adsorption –role of
adsorbents in catalysis and pollution abatement.

UNIT II ELECTROCHEMISTRY AND CORROSION 9

Electrochemistry: Cells – types (electrochemical and electrolytic cell) Redox
reaction – single electrode potential (oxidation potential and reduction
potential) – measurement and applications –Nernst equation (derivation
and problems) – electrochemical series and its significance.
Corrosion: Causes, factors and types – chemical and electrochemical
corrosion (galvanic, differential aeration). Corrosion control – material
selection and design aspects, cathodic protection methods (sacrificial
anodic and impressed current cathodic method) and corrosion inhibitors.
Paints: Constituents and its functions. Electroplating of Copper and electroless
plating of Nickel.
9
 Syllabus CSE
UNIT III FUELS AND COMBUSTION 9
Fuels: Introduction – classification of fuels – Coal – analysis of coal (proximate
and ultimate). Carbonization – manufacture of metallurgical coke (Otto
Hoffmann method) – Petroleum – manufacture of synthetic petrol (Bergius
process). Knocking – octane number and cetane number – Gaseous fuels –
Compressed natural gas (CNG), Liquefied petroleum gases (LPG). Biofuels –
Gobar gas and Biodiesel.
Combustion of Fuels: Introduction – calorific value – higher and lower
calorific values- theoretical calculation of calorific value – flue gas analysis
(ORSAT Method).

UNIT IV ENERGY SOURCES AND STORAGE DEVICES 9

Energy sources: Nuclear fission – nuclear fusion – differences between
nuclear fission and fusion – nuclear chain reactions – nuclear energy – light
water nuclear power plant – breeder reactor – solar energy conversion – solar
cells – wind energy.
Storage devices: Batteries – types of batteries – primary battery (dry cell)
secondary battery (lead acid battery, lithium–ion–battery), fuel cells – H2 -O2
fuel cell and super capacitors.

UNIT V POLYMERS AND NANOMATERIALS 9

Polymers: Classification – types of polymerization – mechanism (Free radical
polymerization) –Engineering polymers: Nylon–6, Nylon–6,6, Teflon, Kevlar
and PEEK – preparation, properties and uses – Plastic and its types –
Conducting polymers – types and applications. Composites – definition, types,
polymer matrix composites – FRP.
Nanomaterials: Introduction – Nanoparticles, Nanoclusters, Nanorods,
Nanotubes (CNT: SWNT and MWNT) and Nanowires – Properties (surface to
volume ratio, melting point, optical and electrical), Synthesis (precipitation,
thermolysis, hydrothermal, electrodeposition, chemical vapour deposition,
laser ablation, sol-gel process) and Applications.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. S. S. Dara and S. S. Umare, “A Textbook of Engineering Chemistry”, S. Chand
& Company LTD, New Delhi, 2015.
2. P. C. Jain and Monika Jain, “Engineering Chemistry” DhanpatRai Publishing
Company (P) LTD, New Delhi, 2015.
3. S. Vairam, P. Kalyani and Suba Ramesh, “Engineering Chemistry”, Wiley
India PVT, LTD, New Delhi, 2013.

10
 Syllabus CSE
REFERENCES:
1. Friedrich Emich, “Engineering Chemistry”, Scientific International PVT,
LTD, New Delhi, 2014.
2. Prasanta Rath, “Engineering Chemistry”, Cengage Learning India PVT,
LTD, Delhi, 2015.
3. Shikha Agarwal, “Engineering Chemistry-Fundamentals and
Applications”, Cambridge University Press, Delhi, 2015.

OUTCOMES
Upon completion of the course, the student should be able to
1. Identify the origin of water resources and develop innovative methods to
produce soft water for industrial use and potable water at cheaper cost.
(K2)
2. Recognize the basic design of adsorption systems and its industrial
applications and the basics concepts of electrochemistry to understand
battery technology. (K2)
3. Apply the principles of electrochemistry to corrosion process and the
applications of protective coatings to overcome the corrosion. (K3)
4. Disseminating the knowledge about the chemistry of fuels and combustion
and its application in various levels.. (K2)
5. Acquire the basics of non-conventional sources of energy and understand
the principles and the reaction mechanism of batteries and fuel cells. (K3)
6. Illustrate the synthesis and applications of polymers, composites and
nano-materials. (K2)

CO – PO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 1 2 - - 1 2 - - - - 1

CO2 3 2 2 2 1 1 2 - - - - 3

CO3 3 2 3 2 1 1 2 - - - 1 1

CO4 3 1 2 2 - 1 2 - - - 1 1

CO5 3 2 3 1 1 1 2 - - - 1 3

CO6 3 2 3 1 - 1 1 - - - 1 2

11
 Syllabus CSE

SEMESTER - I
20ESCS101 PROBLEM SOLVING AND L T P C
SDG NO. 4&9 PROGRAMMING IN C 3 0 0 3
OBJECTIVES:
l To understand about the programming language
l To develop C Programs using basic Programming Constructs, Loops Arrays
and Strings
l To develop applications in C using Functions , Pointers and Structures
l To perform I/O operations and File Handling in C

UNIT I INTRODUCTION TO PROGRAMMING AND ALGORITHMS

FOR PROBLEM SOLVING 10
The Basic Model of Computation, Programming Paradigms- Program
Development Life Cycle - Algorithm –Pseudo Code – Flow Chart -
Programming Languages - Compilation - Linking and Loading - Testing and
Debugging - Documentation - Control Structures – Algorithmic Problem
Solving- Problems Based on Sequential, Decision Making - Branching and
Iteration.

UNIT II BASICS OF C PROGRAMMING 8

Structure of C program - C programming: Data Types – Storage Classes -
Constants – Enumeration Constants - Keywords – Operators: Precedence and
Associativity - Expressions – Input / Output Statements - Assignment
Statements – Decision making Statements - Switch Statement - Looping
Statements – Pre-Processor Directives - Compilation Process

UNIT III ARRAYS AND STRINGS 9

Introduction to Arrays: Declaration, Initialization – One Dimensional Array –
Example Program: Computing Mean, Median and Mode - Two Dimensional
Arrays – Example Program: Matrix Operations (Addition, Scaling,
Determinant and Transpose) - String Operations: Length, Compare,
Concatenate - Copy – Selection Sort - Linear and Binary Search.

UNIT IV FUNCTIONS AND POINTERS 9

Introduction to Functions: Function Prototype, Function Definition,
Function Call, Built-in Functions (String Functions, Math Functions) –
Recursion – Example Program: Computation of Sine Series - Scientific
Calculator using Built-in Functions - Binary Search using Recursive Functions
– Pointers – Pointer Operators – Pointer Arithmetic – Arrays and Pointers –
12
 Syllabus CSE
Array of Pointers – Example Program: Sorting of Names – Parameter Passing:
Pass by Value - Pass by Reference – Example Program: Swapping of Two
Numbers using Pass by Reference.

UNIT V STRUCTURES and FILE PROCESSING 9

Structure - Nested Structures – Pointer and Structures – Array of Structures –
Example Program using Structures and Pointers – Self Referential Structures –
Dynamic Memory Allocation - Singly Linked List – Typedef.
Files – Types of File Processing: Sequential Access, Random Access –
Sequential Access File - Example Program: Finding Average of Numbers stored
in Sequential Access File - Random Access File - Example Program:
Transaction Processing Using Random Access Files – Command Line
Arguments.
TOTAL: 45 PERIODS

TEXT BOOKS:
1. Reema Thareja, “Programming in C”, Oxford University Press, Second
Edition, 2016.
2. Kernighan, B.W and Ritchie,D.M, “The C Programming language”, Second
Edition, Pearson Education, 2012.

REFERENCES:
1. Paul Deitel and Harvey Deitel, “C How to Program”, Seventh edition,
Pearson Publication, 2015.
2. Jeri R. Hanly & Elliot B. Koffman, “Problem Solving and Program Design in
C”, Pearson Education, 2013.
3. Pradip Dey, Manas Ghosh, “Fundamentals of Computing and Programming
in C”, First Edition, Oxford University Press, 2009.
4. Anita Goel and Ajay Mittal, “Computer Fundamentals and Programming in
C”, Dorling Kindersley (India) Pvt. Ltd., Pearson Education in South Asia,
2011.
5. Byron S. Gottfried, "Schaum's Outline of Theory and Problems of
Programming with C", McGraw-Hill Education, 1996.
6. Kanetkar Y, “Let us C”, BPB Publications, 2007.
7. Hanly J R & Koffman E.B, “Problem Solving and Programme design in C”,
Pearson Education, 2009.

WEB REFERENCES:
1. https://www.learn-c.org/
2. https://codeforwin.org/
3. https://www.cprogramming.com/
13
 Syllabus CSE
ONLINE RESOURCES:
1. https://www.linuxtopia.org/online_books/programming_books/
gnu_c_programming_tutorial
2. https://nptel.ac.in/courses/106105171
3. https://swayam.gov.in/nd1_noc19_cs42/preview

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand the concepts of algorithms for solving a problem. (K2)
2. Illustrate the various constructs in C to develop simple applications. (K3)
3. Understand the concepts of Array & Strings. (K2)
4. Demonstrate the usage of Functions and Pointers. (K3)
5. Explain the Structure and union concepts. (K2)
6. Describe the file manipulation and its organisation.(K2)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3 2 1 1 - 2 2 - 3 2 3

CO2 3 3 3 3 2 - 1 1 2 2 3 3 2 3

CO3 3 3 3 3 2 1 1 1 2 - 3 - 3 2

CO4 3 3 3 3 2 1 - 1 2 2 3 3 1 2

CO5 3 3 3 3 2 1 1 1 2 2 3 3 2 1

CO6 3 3 3 3 2 1 1 1 2 2 3 3 3 2

SEMESTER - I
20ESGE101 L T P C
SDG NO. 4,6,7, 9, ENGINEERING GRAPHICS
12,14 &15 1 2 0 3
OBJECTIVES:
l To develop in students, graphic skills for communication of concepts, ideas
and design of engineering products
l To visualize the job in three dimensions
l To have a clear conception and appreciation of the shape, size, proportion
and design
l To expose the student community to existing national standards related to
technical drawings
14
 Syllabus CSE
CONCEPTS AND CONVENTIONS (Not for Examination) 3
Importance of graphics in engineering applications – Use of drafting
instruments – BIS conventions and specifications – Size, layout and folding of
drawing sheets – Lettering and dimensioning- Projection of Points

UNIT I PLANE CURVES AND FREEHAND SKETCHING 6+9

Basic Geometrical constructions, Curves used in engineering practices: Conics
– Construction of ellipse, parabola and hyperbola by eccentricity method –
Construction of cycloid on Horizontal Surfaces – construction of involutes of
circle for one complete revolution – Drawing of tangents and normal to the
above curves.
Visualization concepts and Free Hand sketching: Visualization principles
–Representation of Three Dimensional objects – Layout of views- Freehand
sketching of multiple views from pictorial views of objects.

UNIT II PROJECTION OF LINES AND PLANE SURFACE 6+9

Orthographic projection- principles-Principal planes- Projection of straight
lines (only First angle projections) inclined to both the principal planes -
Determination of true lengths and true inclinations by rotating line method-
Projection of planes (polygonal and circular surfaces) inclined to both the
principal planes by rotating object method.

UNIT III PROJECTION OF SOLIDS 6+9

Projection of simple solids like prisms, pyramids, cylinder and cone when the
axis is inclined to one of the principal planes by rotating object method.

UNIT IV PROJECTION OF SECTIONED SOLIDS AND

DEVELOPMENT OF SURFACES 6+9
Sectioning of prisms, pyramids, cylinder and cone in simple vertical position
when the cutting plane is inclined to one of the principal planes and
perpendicular to the other – obtaining true shape of section. Development of
lateral surfaces of simple and truncated solids in vertical position – Prisms,
pyramids cylinder and cone.

UNIT V ISOMETRIC AND PERSPECTIVE PROJECTIONS 6+9

Principles of isometric projection – isometric scale –Isometric projections of
simple solids and truncated solids - Prisms, pyramids, cylinder, cone-
Perspective projection of simple solids-Prisms, pyramids and cylinder by
visual ray method.
TOTAL: 78 PERIODS

15
 SyllabusCSE
TEXT BOOKS:
1. Venugopal K. and Prabhu Raja V., “Engineering Graphics”, New Age
International (P) Limited, 2008.
2. T. Jeyapoovan, “Engineering Graphics using AUTOCAD”, Vikas Publishing
House Pvt Ltd, 7th Edition.

REFERENCES:
1. Bhatt N.D. and Panchal V.M., “Engineering Drawing”, Charotar Publishing
House, 50th Edition, 2010.
2. Natrajan K.V., “A text book of Engineering Graphics”, Dhanalakshmi
Publishers, Chennai, 2009.
3. Basant Agarwal and Agarwal C.M., “Engineering Drawing”, Tata McGraw
Hill Publishing Company Limited, New Delhi, 2008.
4. Gopalakrishna K.R., “Engineering Drawing” (Vol. I&II combined), Subhas
Stores, Bangalore, 2007.
5. Luzzader, Warren.J. and Duff,John M., “Fundamentals of Engineering
Drawing with an introduction to Interactive Computer Graphics for
Design and Production, Eastern Economy Edition, Prentice Hall of India
Pvt. Ltd, New Delhi, 2005.
6. N S Parthasarathy and Vela Murali, “Engineering Graphics”, Oxford
University, Press, New Delhi, 2015.
7. Shah M.B., and Rana B.C., “Engineering Drawing”, Pearson, 2nd Edition,
2009.

WEB REFERENCES:
1. https://nptel.ac.in/courses/112/103/112103019/

ONLINE RESOURCES:
1. https://nptel.ac.in/courses/105/104/105104148/

PUBLICATION OF BUREAU OF INDIAN STANDARDS:

1. IS10711 – 2001: Technical products Documentation – Size and lay out of
drawing sheets.
2. IS9609 (Parts 0 & 1) – 2001: Technical products Documentation –
Lettering.
3. IS10714 (Part 20) – 2001 & SP 46 – 2003: Lines for technical drawings.
4. IS11669 – 1986 & SP 46 – 2003: Dimensioning of Technical Drawings.
5. IS15021 (Parts 1 to 4) – 2001: Technical drawings – Projection Methods

16
 Syllabus CSE
OUTCOMES:
Upon completion of the course, the student should be able to
1. Relate thoughts and ideas graphically in a neat fashion and ability to
perform sketching of engineering curves used in engineering practices,
multiple views of objects. (K1)
2. Understand the concepts of orthographic projections for basic
geometrical constructions. (K2)
3. Acquire the knowledge of orthographic projection in three dimensional
object. (K2)
4. Develop knowledge about Sectioning and apply interior shapes of solids.
(K3)
5. Analyze the concepts of design in developing various 3 dimensional
projections. (K4)
6. Build a strong foundation to analyze the design in various dimensions.
(K4)

CO - PO , PSO MAPPING:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 2 - - - - - 2 2 - 2 2 2

CO2 3 2 2 - - - - - 2 2 - 2 2 2

CO3 3 2 2 - - - - - 2 2 - 2 2 2

CO4 3 2 2 - - - - - 2 2 - 2 2 2

CO5 3 2 2 - - - - - 2 2 - 2 2 2

CO6 3 2 2 - - - - - 2 2 - 2 2 2

SEMESTER - I
20BSPL101 PHYSICS AND CHEMISTRY L T P C
SDG NO. 4 LABORATORY 0 0 3 1.5

PHYSICS LABORATORY
OBJECTIVES:
l To acquaint the students with practical knowledge of physics principles in
various fields such as optics, thermal physics and properties of matter for
developing basic experimental skills
l To make the student to acquire practical skills in the determination of water
quality parameters through volumetric and instrumental analysis

17
 Syllabus CSE

LIST OF EXPERIMENTS (Any 5 Experiments)

1. Determination of Young's modulus by non-uniform bending method.
2. Determination of rigidity modulus –Torsion pendulum.
3. Determination of velocity of sound and compressibility of liquid –
Ultrasonic Interferometer.
4. (a) Determination of wavelength and particle size using Laser.
(b) Determination of acceptance angle in an optical fiber.
5. Determination of thermal conductivity of a bad conductor – Lee's Disc
method.
6. Determination of specific resistance of a given coil of wire – Carey
Foster's bridge.
7. Determination of wavelength of mercury spectrum – spectrometer
grating.
8. Determination of band gap of a semiconductor.
9. Determination of Hall coefficient by Hall Effect experiment.
10. Determination of solar cell characteristics.

LAB REQUIREMENTS FOR A BATCH OF 30 STUDENTS /

6 (max.) STUDENTS PER EXPERIMENT
1. Young's modulus by non-uniform bending method-
experimental set-up – 12 sets
2. Rigidity modulus - Torsion pendulum experimental
set-up – 12 sets
3. Ultrasonic Interferometer to determine velocity of sound
and compressibility of liquid – 6 sets
4. (a) Experimental set-up to find the wavelength of light,
and to find particle size using Laser – 6 sets
(b) Experimental set-up to find acceptance angle in an
optical fiber – 6 sets
5. Lee's disc method- experimental set up to find thermal
conductivity of a bad conductor – 6 sets
6. Experimental set-up to find specific resistance of a coil
of wire-Carey Foster's Bridge – 6 sets
7. Experimental set-up to find the wavelength of mercury
spectrum-spectrometer grating – 6 sets
8. Experimental set-up to find the band gap of a semiconductor – 12 sets
9. Experimental set-up to find the Hall coefficient by
Hall Effect Experiment – 6 sets
18
 Syllabus CSE
10. Experimental set-up to study characteristics of solar cells – 6 sets

TEXTBOOKS:
1. J.D. Wilson& C.A. Hernandez Hall “Physics Laboratory Experiments”
Houghton Mifflin Company, New York, 2010.
2. M.N. Srinivasan, S. Balasubramanian &R. Ranganathan, “Practical
Physics”, S. Chand & Sons educational publications, New Delhi, 2011.
3. R. Sasikumar, “Practical Physics”, PHI Learning Pvt. Ltd., New Delhi, 2011.

CHEMISTRY LABORATORY
(Any five experiments to be conducted)

OBJECTIVES:
l To acquaint the students with practical knowledge of the basic concepts of
chemistry, the student faces during the course of their study in the industry
and engineering field
l To make the student to acquire practical skills in the determination of water
quality parameters through volumetric and instrumental analysis
l To understand and develop experimental skills for building technical
competence

LIST OF EXPERIMENTS (Any five experiments to be conducted)

1. Estimation of HCl using Na2CO3 as primary standard and Determination
of alkalinity in water samples.
2. Determination of total, temporary & permanent hardness of water by
EDTA method.
3. Determination of DO content of water sample by Winkler's method.
4. Determination of chloride content of water sample by argentometric
method.
5. Determination of strength of given hydrochloric acid using pH meter.
6. Conductometric titration of strong acid vs strong base.
7. Estimation of iron content of the given solution using potentiometer.
8. Estimation of iron content of the water sample using spectrophotometer
(1, 10- Phenanthroline / thiocyanate method).
9. Estimation of sodium and potassium present in water using flame
photometers.
10. Determination of molecular weights of polymers using Ostwald's
Viscometer.

19
 Syllabus CSE

LAB REQUIREMENTS FOR A BATCH OF 30 STUDENTS /

6 (MAX.) STUDENTS PER EXPERIMENT.
1. Estimation of HCl using Na2CO3 as primary standard and
Determination of alkalinity in water sample - 6 sets
2. Determination of total, temporary & permanent
hardness of water by EDTA method - 6 sets
3. Determination of DO content of water sample by
Winkler's method - 6sets
4. Determination of chloride content of water sample by
argentometric method – 6 sets
5. Determination of strength of given hydrochloric acid using
pH meter - 6 sets
6. Conductometric titration of strong acid vs strong base - 6 sets
7. Estimation of iron content of the given solution using
potentiometer - 6 sets
8. Estimation of iron content of the water sample using
spectrophotometer (1,10- Phenanthroline /
thiocyanate method) - 2 sets
9. Estimation of sodium and potassium present in water
using flame photometer - 2 sets
10. Determination of molecular weights of polymer using
Ostwald's Viscometer. - 6 sets
TOTAL: 30 PERIODS
TEXT BOOKS:
1. Vogel's Textbook of Quantitative Chemical Analysis (8th edition, 2014).

OUTCOMES:
Upon completion of the course, the student should be able to
1. Apply the principles of thermal physics and properties of matter to
evaluate the properties of materials and to determine the physical
properties of liquid using ultrasonic interferometer. (K1)
2. Understand measurement technique and usage of new instruments in
optics for real time application in engineering. (K2)
3. Apply the knowledge of semiconductor materials to evaluate the band
gap and Hall coefficient of materials and to study the characteristics of
solar cell for engineering solutions. (K3)
4. Apply the different techniques of quantitative chemical analysis to
generate experimental skills in building technical competence.(K2)

20
 Syllabus CSE
5. Apply basic techniques used in chemistry laboratories for water
analyses/purification and estimates the ions/metal ions present in
domestic/industry wastewater. (K2)
6. Utilize the fundamental laboratory techniques for analyses such as
volumetric titrations, conductometric, potentiometric and
spectroscopy. (K2)

CO- PO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 3 3 2 1 3 3 2 2 1 1 3

CO2 3 3 3 3 3 3 3 2 2 2 2 3

CO3 3 3 3 3 3 3 3 2 1 1 2 3

CO4 3 2 3 3 1 1 2 2 2 2 3 2

CO5 3 2 3 3 1 1 2 2 2 2 3 2

CO6 3 2 3 3 1 1 2 2 2 2 3 2

SEMESTER - I
20ESPL101 L T P C
PROGRAMMING IN C LABORATORY
SDG NO. 4&9 0 0 3 1.5

OBJECTIVES:
l To develop programs in C using basic Programming Constructs
l To develop applications in C using Arrays and Strings
l To design and implement applications in C using Functions, Structures
l To develop applications in C using Files

LIST OF EXPERIMENTS
1. Write a program using I/O statements and expressions.
2. Write programs using decision-making constructs.
3. Write a program to find whether the given year is leap year or not? (Hint:
not every centurion year is a leap. For example 1700, 1800 and 1900 is
not a leap year)
4. Write a program to perform the Calculator operations, namely, addition,
subtraction, multiplication, division and square of a number.
5. Write a program to check whether a given number is Armstrong number
or not?
21
 Syllabus CSE
6. Write a program tocheck whether a given number is odd or even?
7. Write a program to find the factorial of a given number.
8. Write a program to find out the average of 4 integers.
9. Write a program to display array elements using two dimensional arrays.
10. Write a program to perform swapping using function.
11. Write a program to display all prime numbers between two intervals
using functions.
12. Write a program to reverse a sentence using recursion.
13. Write a program to get the largest element of an array using the function.
14. Write a program to concatenate two string.
15. Write a program to find the length of String.
16. Write a program to find the frequency of a character in a string.
17. Write a program to store Student Information in Structure and Display it.
18. The annual examination is conducted for 10 students for five subjects.
Write a program to read the data and determine the following:
(a) Total marks obtained by each student.
(b) The highest marks in each subject and the marks of the student who
secured it.
(c) The student who obtained the highest total marks.
19. Insert, update, delete and append telephone details of an individual or a
company into a telephone directory using random access file.
20. Count the number of account holders whose balance is less than the
minimum balance using sequential access file.
TOTAL: 45 PERIODS

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

Standalone desktops with C compiler 30 Nos.
(or)
Server with C compiler supporting 30 terminals or more.

OUTCOMES:
Upon completion of the course, the student should be able to
1. Solve some simple problems leading to specific applications. (K3)
2. Demonstrate C programming development environment, compiling,
debugging, linking and executing a program. (K3)
3. Illustrate C programs for simple applications making use of basic
constructs, arrays and strings. (K3)
4. Construct C programs involving functions and recursion. (K3)

22
 CSE
Syllabus
5. Demonstrate C programs involving pointers, and structures. (K3)
6. Interpret applications using sequential and random access file. (K3)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3 2 1 1 - 2 2 - 3 2 3

CO2 3 3 3 3 2 - 1 1 2 2 3 3 2 3

CO3 3 3 3 3 2 1 1 1 2 - 3 - 3 2

CO4 3 3 3 3 2 1 - 1 2 2 3 3 1 2

CO5 3 3 3 3 2 1 1 1 2 2 3 3 2 1

CO6 3 3 3 3 2 1 1 1 2 2 3 3 3 2

SEMESTER - I
20TPHS101 L T P C
SKILL ENHANCEMENT
SDG NO. 4&5 0 0 2 1

OBJECTIVES:
l To enrich social network ethics
l To develop and enhance browsing culture
l To understand the concepts of networking
l To promote self professionalism
l To acquire knowledge about various digital identification procedures

UNIT I SOCIAL NETWORK ETIQUETTES 6

Introduction to social network – Social Networking Etiquettes - Pros and Cons
- Usage of Facebook, Instagram, WhatsApp , Telegram, Youtube, Evolution of
Android and IOS, Introduction to Linkedin & Benefits. (Practicals – Official
Mail id- Linkedin Id Creation, Linkedin Profile Bulilding , Facebook Id and
Creation and Modifying the existing FB ID)

UNIT II BROWSING CULTURE 6

Introduction to browsing – Search Engines-Google - Bing -Yahoo!-AOL -MSN
–DuckDuckGo ,browsers, phishing – Cookies - URL – https:// extensions ,
browsing history, Incognito mode- VPN – Pros and Cons – Book mark.

23
 Syllabus CSE
UNIT III NETWORKING 6
Basics of networking - LAN, MAN, WAN, Introduction to network topologies,
Protocols , IP Commands (Command line prompt), Define online complier
and editor (Practicals – Find Your System IP,Ping Command, Firewall Fortinet,
Basic DOS Commands)

UNIT IV PROFESSIONALISM 6
Dress Code, Body Language, Appropriate Attire ,Communication Skills,
Interview preparation – Introducing yourself - How to greet Superiors,
Importance of Eye Contact During conversation.

UNIT V DIGITAL IDENTIFICATION 6

Introduction to NAD - Importance of Aadhar, PAN Card, Passport, Bank
Account, Bar Code, QR scan, Payment Gateway (Gpay, Phone Pe, UPI, BHIM,
Paytm), Mobile Banking (Practicals - NAD registration Step by Step, Linking
bank account with netbanking , Register for payment gateway).
TOTAL : 30 PERIODS

WEB REFERENCES :
Unit I: Social Network Etiquettes:
1. https://sproutsocial.com/glossary/social-media-etiquette/
2. https://www.shrm.org/resourcesandtools/tools-and-samples/hr-
qa/pages/socialnetworkingsitespolicy.aspx
3. https://www.frontiersin.org/articles/10.3389/fpsyg.2019.02711/full
4. https://medium.com/@sirajea/11-reasons-why-you-should-use-
telegram-instead-of-whatsapp-ab0f80fbfa79
5. https://buffer.com/library/how-to-use-instagram/
6. https://www.webwise.ie/parents/what-is-youtube/
7. https://www.androidauthority.com/history-android-os-name-789433/
8. https://www.mindtools.com/pages/article/linkedin.htm

Unit II: Browsing Culture:

1. https://sites.google.com/site/bethanycollegeofteacheredn/unit--ict-
connecting-with-world/national-policy-on-information-and-
communication-technology-ict/accessing-the-web-introduction-to-the-
browser-browsing-web
2. https://www.wordstream.com/articles/internet-search-engines-
history
3. https://www.malwarebytes.com/phishing/
4. https://www.adpushup.com/blog/types-of-cookies/
24
 Syllabus CSE
5. https://www.eff.org/https-everywhere
6. https://www.sciencedirect.com/topics/computer-science/browsing-
history\
7. https://www.vpnmentor.com/blog/pros-cons-vpn/
8. https://www.tech-wonders.com/2016/10/use-hush-private-
bookmarking-extension-chrome.html

Unit III:Networking
1. https://www.guru99.com/types-of-computer-network.html
2. https://www.studytonight.com/computer-networks/network-
topology-types
3. https://www.cloudflare.com/learning/network-layer/what-is-a-
protocol/
4. https://www.howtogeek.com/168896/10-useful-windows-commands-
you-should-know/
5. https://paiza.io/en

Unit IV : Professionalism
1. https://career.vt.edu/develop/professionalism.html
2. https://englishlabs.in/importance-dress-code/
3. https://www.proschoolonline.com/blog/importance-of-body-language-
in-day-to-day-life
4. https://www.thespruce.com/etiquette-of-proper-attire-1216800
5. https://shirleytaylor.com/why-are-communication-skills-important/
6. https://www.triad-eng.com/interview-tips-for-engineers/
7. https://www.indeed.co.in/career-advice/interviewing/interview-
question-tell-me-about-yourself
8. https://toggl.com/track/business-etiquette-rules/

Unit V: Digital Identification

1. https://nad.ndml.in/nad-presentation.html
2. https://www.turtlemint.com/aadhaar-card-benefits/
3. https://www.bankbazaar.com/pan-card/uses-of-pan-card.html
4. https://www.passportindex.org/passport.php
5. https://consumer.westchestergov.com/financial-education/money-
management/benefits-of-a-bank-account
6. https://en.wikipedia.org/wiki/QR_code

25
 Syllabus CSE
7. https://www.investopedia.com/terms/p/payment-gateway.asp
8. https://www.paisabazaar.com/banking/mobile-banking/

OUTCOMES:
Upon completion of the course, the student should be able to
1 . Learn and apply social network ethics. (K3)
2. Understand the browsing culture. (K2)
3. Analyze the networking concepts . (K4)
4. Develop self professionalism. (K3)
5. Gain hands-on experience in various digital identification procedures.
(K2)
6. Analyse and apply the different digital payment gateway methods. (K4)

CO- PO MAPPING :
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 - - - - 3 2 - 3 2 3 - 2

CO2 - - - - 3 2 - 3 2 3 - 2

CO3 - - - - 3 2 - - 1 3 - 2

CO4 - - - - 3 2 - 3 3 3 - 2

CO5 - - - - 3 2 - - 2 3 - 2

CO6 - - - - 3 2 - - 2 3 - 2

SEMESTER - I
20HSMG101 L T P C
PERSONAL VALUES
SDG NO. 4&5 2 0 0 0

OBJECTIVES:
l Values through Practical activities

UNIT I SELF CONCEPT 6

Understanding self Concept – Identify Yourself – Who am I – an individual,
engineer, citizen – Attitude – Measuring Behaviour – Change of Behaviour –
Personality – Characteristics in personal, professional life.

26
 Syllabus CSE

UNIT II INDIVIDUAL VALUES 6

Personal Values – Attributes –Courage – Creativity, Honesty, Perfection,
Simplicity, Responsibility – Measuring personal values

UNIT III MORAL VALUES 6

Moral – Understanding right and wrong – Positive thoughts – Respect to
others – Doing good to society.

UNIT IV PHYSICAL AND MENTAL WELL-BEING 6

Health – Physical fitness –Mental vigour – Diet management – Yoga –
Meditation – Peaceful life – Happiness in life

UNIT V DECISION MAKING 6

Goal Setting – Decision making skill – Overcome of Barriers – Success – Mental
strength and weakness
TOTAL: 30 PERIODS
Note:
Each topic in all the above units will be supplemented by practice exercises
and classroom activities and projects.

REFERENCE BOOKS:
1. Barun K. Mitra, “Personality Development and Soft Skills”, Oxford
University Press, 2016.
2. B.N.Ghosh, “Managing Soft Skills for Personality Development” McGraw
Hill India, 2012.

OUTCOMES:
Upon completion of the course, the student should be able to
1. Become an individual in knowing the self. (K4)
2. Acquire and express Personal Values, Spiritual values and fitness. (K4)
3. Practice simple physical exercise and breathing techniques. (K2)
4. Practice Yoga asana which will enhance the quality of life. (K1)
5. Practice Meditation and get benefitted. (K1)
6. Understanding moral values and need of physical fitness. (K2)

27
CO – PO MAPPING:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 - - - - - 2 2 3 3 1 1 1

CO2 - - - - - 2 2 3 3 1 1 1

CO3 - - - - - 2 2 3 3 1 1 1

CO4 - - - - - 2 2 3 3 1 1 1

CO5 - - - - - 2 2 3 3 1 1 1

CO6 - - - - - 2 2 3 3 1 1 1
 Syllabus CSE

SEMESTER - II
20BSMA204 L T P C
DISCRETE STRUCTURES
SDG NO. 4 3 1 0 4

OBJECTIVES:
l To learn the basic concepts of Relations and Functions
l To learn the concepts of Mathematical induction, Permutation and
Combination
l To understand the concepts of Logic, Rules of inference and Quanti iers
l To impart the knowledge on Groups, Normal subgroups, Rings and Fields
l To develop Graph Algorithms by using the concepts of Graphs and Trees

UNIT I RELATION AND FUNCTION 12

Binary Relation, Partial Ordering Relation, Equivalence Relation – Sum and
Product of functions – Bijective functions – Inverse and composite functions.

UNIT II COMBINATORICS 12
The Principles of Mathematical Induction-The Well-Ordering Principle –
Recursive de inition – Basic counting techniques – Inclusion and exclusion ,
Pigeonhole principle – Permutation – Combination.

UNIT III LOGICS AND PROOFS 12

Basic Connectives – Truth Tables – Logical Equivalence: The Laws of Logic,
Logical Implication – Rules of Inference – The use of Quanti iers – Proof
Techniques: Some Terminology – Proof Methods and Strategies – Forward
Proof – Proof by Contradiction – Proof by Contraposition.

UNIT IV ALGEBRAIC STRUCTURES 12

Algebraic Structures with One Binary Operation – Semi Groups, Monoids,
Groups, Permutation Groups – Subgroups – Normal subgroups – Algebraic
Structures with two Binary Operations - De inition and Examples of Rings and
Fields – Boolean Algebra – Identities of Boolean Algebra.

UNIT V GRAPHS AND TREES 12

Graphs and their properties – Degree, Connectivity, Path, Cycle – Sub Graph –
Isomorphism – Eulerian and Hamiltonian Walks –Rooted Trees, Trees and
Sorting.
TOTAL: 60 PERIODS

29
 Syllabus CSE
TEXT BOOKS:
1. Kenneth H. Rosen, “Discrete Mathematics and its Applications: with
Combinatorics and Graph Theory”, 7th Edition, Tata McGraw –Hill
Education Pvt. Ltd., 2015.
2. J.P. Tremblay and R. Manohar, “Discrete Mathematical Structure with
Applications to Computer Science”, Tata Mc Graw Hill Education (India)
Edition 1997.
3. Narsingh Deo, “Graph theory with applications to Engineering and
Computer Science”, Prentice Hall Inc., Englewood Cliffs,N.J., 1974.

REFERENCES:
1. Susanna S. Epp, “Discrete Mathematics with Applications”, 4th edition,
Brooks/Cole, Cengage Learning, 2010.
2. Norman L. Biggs, “Discrete Mathematics”, 2nd Edition, Oxford University
Press, 2002.
3. Seymour Lipschutz, MarcLipson, “Discrete Mathematics, Schaum's
Outlines Series”, 3rd edition, McGraw-Hill Education, 2009.
4. C. L. Liu and D. P. Mohapatra, “Elements of Discrete Mathematics: A
Computer Oriented Approach”, 4th Edition, Tata McGraw–Hill Education
Pvt. Ltd, 2012.

WEB REFERENCES :
1. https://web.stanford.edu/class/cs103x/cs103x-notes.pdf
2. https://www.cs.cornell.edu/~rafael/discmath.pdf
3. http://home.iitk.ac.in/~arlal/book/mth202.pdf

ONLINE RESOURCES:
1 https://www.youtube.com/watch?v=h_9WjWENWV8&list=PL3o9D
4Dl2FJ9q0_gtFXPh_H4POI5dK0yG
2 https://www.youtube.com/watch?v=xlUFkMKSB3Y&list=PL0862
D1A947252D203.
3 https://www.youtube.com/watch?v=4LlTmsfDS4Y&list=PLEAYk
Sg4uSQ2Wfc_l4QEZUSRdx2ZcFziO&index=13
4 https://www.youtube.com/watch?v=jBsEKyx6Rj0&list=PLwdnzl
V3ogoVxVxCTlI45pDVM1aoYoMHf
5. https://www.youtube.com/watch?v=rdXw7Ps9vxc&list=PLHXZ9O
QGMqxersk8fUxiUMSIx0DBqsKZS

30
 Syllabus CSE
OUTCOMES:
Upon completion of the course, the student should be able to
1. Check whether the relation is Binary, Partial Order or equivalence and a
function is injective, subjective or bijective, compute inverse and
composite of functions (K3)
2. Solve problems on permutations and combinations using the Counting
principle and Pigeon hole Principle(K3)
3. Construct mathematical arguments and test the validity of statements
using the rules of logic, rules of inference, quanti iers, proof strategies
and mathematical induction. (K3)
4. Identify a set with the given binary relation as a group, normal group,
ring, ields and Boolean algebra. (K3)
5. Identify Graph isomorphism, Eulerian and Hamiltonian walks and
sorting in trees(K3)
6. Explain the properties of functions, relations and graph(K2

CO- PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 3 1 2 - - - - - - - 1

CO2 3 3 1 2 - - - - - - - 1

CO3 3 3 1 2 - - - - - - - 1

CO4 3 3 1 2 - - - - - - - 1

CO5 3 3 1 2 - - - - - - - 1

CO6 3 3 1 2 - - - - - - - 1

SEMESTER - II
20HSEN201 L T P C
TECHNICAL ENGLISH - II
SDG NO. 4 3 0 0 3

OBJECTIVES:
l To strengthen the listening skills for comprehending and critically
analyzing passages
●
l To enhance students’ ability with multiple strategies and skills for making
technical presentations
●
l To participate in group discussions for developing group attitude
●
l To develop skills for preparing effective job application
●
l To write effective technical reports
31
 Syllabus CSE
UNIT I LANGUAGE DEVELOPMENT 9
Listening – Listening conversations involving two participants – multiple
participants – Speaking – conversation methods in real life occurrences using
expressions of different emotions and imperative usages – Reading passages
and short stories - Writing – preparation of checklist – extended definition –
Language Development – tenses - subject - verb agreement

UNIT II VOCABULARY BUILDING 9

Listening – listening formal and informal conversation and participative
exercises – Speaking - creating greetings/wishes/excuses and thanks –
Reading – articles/novels-Writing summary of articles and concise writing
identifying new words – homonyms, homophones, homographs – one-word
substitutions – easily confused words - creating SMS and using emoticons -
sharing information in social media. Language Development - reported
speeches – regular and irregular verbs - idioms & phrases

UNIT III WRITING TECHNICAL REPORTS 9

Listening – listening conversation – effective use of words and their sound
aspects, stress, intonation & pronunciation – Speaking - practicing telephonic
conversations – observing and responding. Reading – regular columns of
newspapers/magazines - Writing – reports – feasibility, accident, survey and
progress - preparation of agenda and minutes – Language Development -
using connectives – discourse markers

UNIT IV TECHNICAL WRITING 9

Listening – Model debates & documentaries - Speaking – expressing
agreement/disagreement, assertiveness in expressing opinions – Reading
biographies/autobiographies – Writing – note-making – formal letters –
inviting guests – acceptance/declining letters - Language Development –
degrees of comparison - numerical adjectives – embedded sentences

UNIT V GROUP DISCUSSION AND JOB APPLICATION 9

Listening – Listening - classroom lectures – recommending suggestions &
solutions – Speaking – participating in group discussion – learning GD
strategies – Reading – journal articles - Writing – Job application – cover letter
- résumé preparation – Language Development – purpose statement –
editing – verbal analogies.
TOTAL: 45 PERIODS
TEXT BOOKS :
1. Board of editors. Fluency in English: A Course book for Engineering and
Technology. Orient Blackswan, Hyderabad 2016.

32
 Syllabus CSE
2. Ashraf Rizvi. M, Effective Technical Communication. 2nd ed. McGraw Hill,
New Delhi, 2018.

REFERENCES
1. Bailey, Stephen. Academic Writing: A Practical Guide for Students.
Routledge, New York,2011.
2. Raman, Meenakshi and Sharma, Sangeetha. Technical Communication
Principles and Practice. Oxford University Press, New Delhi, 2014.
3. Muralikrishnan& Mishra Sunitha, Communication skills for Engineers
2nd ed. Pearson, Tamilnadu, India 2011. P. Kiranmai and Rajeevan,
Geetha. Basic Communication Skills, Foundation Books, New Delhi,
2013.
4. Suresh Kumar, E. Engineering English. Orient Blackswan, Hyderabad,
2015
5. Richards, Jack C. Interchange Students’ Book – 2. Cambridge University
Press, New Delhi, 2015.

WEB REFERENCES :
1. https://swayam.gov.in/nd1_noc20_hs21/preview
2. https://nptel.ac.in/content/storage2/nptel_data3/html/mhrd/ict/
text/109106122/lec1.pdf
3. https://freevideolectures.com/course/3250/introduction-to-film-
studies/10

ONLINE RESOURCES
1. https://www.ef.com/wwen/english-resources/
2. https://www.smilesforlearning.org/gclid=EAIaIQobChMI49DF9
bnd6AIVSY6PCh1d_gV9EAAYASAAEgIBPvD_BwE.

OUTCOMES:
Upon completion of the course, the student should be able to
1. Acquire the ability to speak effectively in real life situations (K1)
2. Adapt group behaviour and execute the role as a contributing team
member (K1)
3. Employ active and passive vocabulary in oral and written communication
(K2)
4. Share opinions and suggestions effectively in conversations, debates and
discussions (K2)

33
 Syllabus CSE
5. Prepare winning job applications (K3)
6. Write technical reports convincingly (K3)

CO - PO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 - - - - - - - - - 3 - 2

CO2 - 2 - - - - - - - 3 - -

CO3 - - - 1 - - 2 - - 3 - -

CO4 - - - - - 2 - 3 - - - -

CO5 - - - - - - - - - 3 - 2

CO6 - - - - - - - - - 3 - 2

SEMESTER - II
20BSPH203 L T P C
PHYSICS FOR INFORMATION SCIENCE
SDG NO. 4 3 0 0 3

OBJECTIVES:
l To understand the essential principles of physics of conducting materials,
superconducting and optical properties of materials
l To educate the basic principles of semiconductor device and electron
transport properties
l To become pro icient in magnetic materials
l To acquire the basic working of nanoelectronic devices

UNIT I CONDUCTING MATERIALS 9

Classical free electron theory - Expression for electrical conductivity - Thermal
conductivity expression - Wiedemann-Franz law - Success and failures -
Electrons in metals - Motion of a particle in a three dimensional box (Quantum
Mechanical Approach) - degenerate states - Fermi- Dirac statistics - Density of
energy states - Electron in periodic potential - Energy bands in solids - Tight
binding approximation - Electron effective mass - Concept of hole.

UNIT II SEMICONDUCTOR MATERIALS 9

Intrinsic Semiconductors - Direct and indirect band gap semiconductors -
Carrier concentration in intrinsic semiconductors - extrinsic semiconductors -

34
 Syllabus CSE
Carrier concentration in N-type & P-type semiconductors - Variation of carrier
concentration with temperature - Variation of Fermi level with temperature
and impurity concentration - Carrier transport in Semiconductor: random
motion, drift, mobility and diffusion - Hall effect and devices - Ohmic contacts -
Schottky diode.

UNIT III MAGNETIC PROPERTIES OF MATERIALS 9

Magnetic dipole moment - atomic magnetic moments - magnetic permeability
and susceptibility - Magnetic material classi ication: diamagnetism -
paramagnetism - ferromagnetism - antiferromagnetism - ferrimagnetism -
Ferromagnetism: origin and exchange interaction - Domain Theory - M versus
H behaviour - Hard and soft magnetic materials - applications - Magnetic
principle in computer data storage - Magnetic hard disc - GMR sensor.

UNIT IV SUPERCONDUCTING & OPTICAL PROPERTIES OF MATERIALS 9

Super conductivity - Type-I and Type-II superconductors - Properties and
applications - Classi ication of optical materials - Carrier generation and
recombination processes - Photo current in a P-N diode - Solar cell - LED -
Organic LED - Optical data storage techniques and devices.

UNIT V NANO DEVICES 9

Introduction - Size dependence of Fermi energy - Quantum con inement -
Quantum structures - Density of states in quantum well, quantum wire and
quantum dot structure - Band gap of nanomaterials - Tunneling: single
electron phenomena and single electron transistor - Quantum dot laser -
Carbon nanotubes: Properties and applications.
TOTAL: 45 PERIODS

TEXT BOOKS:
1. Jasprit Singh, “Semiconductor Devices: Basic Principles”, Wiley 2012.
2. Kasap, S.O., “Principles of Electronic Materials and Devices”, McGraw-
HillEducation, 2017.
3. Kittel, C., “Introduction to Solid State Physics”, Wiley, 2018.
4. S.O.Pillai, “Solid State Physics, New Academic Science”, 2017.
5. D.K.Bhattacharya & PoonamTandon., “Physics for Information Science and
Electronics Engineering”, Oxford Higher Education”,2017.

REFERENCES:
1. Garcia, N. & Damask, A., “Physics for Computer Science Students”,
Springer-Verlag, 2012.
2. Hanson, G.W., “Fundamentals of Nanoelectronics”, Pearson Education,
2009.
35
 CSE
Syllabus

3. Rogers, B., Adams, J. &Pennathur, S., “Nanotechnology: Understanding

Small Systems”, CRC Press, 2014.

OUTCOMES:
At the end of the course, the students should able to
1. Understand the basic concepts of various free electron theory and to
determine the electrical properties of solids. (K3)
2. Apply the classical and quantum free electron theory to determine the
properties of conductors (K3)
3. To analyze the properties of semiconductors and its applications (K4)
4. To analyze the mechanisms involved in the magnetic and optical materials
using the quantum concepts (K4)
5. To gain the knowledge on superconducting materials and nanostructures
and its applications. (K2)
6. To demonstrate the working principles of micro and nanoelectronic
devices. (K3)

CO - PO MAPPING:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 3 - - - - - - - - - -

CO2 3 3 - 3 - - - - - - - -

CO3 3 3 - 3 - - - - - - - -

CO4 3 3 2 - 1 - - - - - - 1

CO5 3 3 3 - 2 1 - - - - - 2

CO6 3 3 3 - 3 1 1 - - - - 3

SEMESTER - II
20BSCY201 ENVIRONMENTAL SCIENCE L T P C
SDG NO. 4,17 AND ENGINEERING 3 0 0 3

OBJECTIVES:
l To study the nature and facts about environment
l To find and implement scientific, technological, economic and political
solutions to environmental problems
l To study the interrelationship between living organism and environment
l To provide the importance of environment by assessing its impact on the

36
 Syllabus CSE
human world; envision the surrounding environment, its functions and its
value
l To study the integrated themes and biodiversity, natural resources,
pollution control and waste management

UNIT I ENVIRONMENT, ECOSYSTEMS AND BIODIVERSITY 10

Definition, scope and importance of environment – need for public awareness
– Ecosystem: concept of an ecosystem – structure and functions of an
ecosystem – producers, consumers and decomposers – energy flow in the
ecosystem – food chains, food webs and ecological pyramids – ecological
succession. Introduction to biodiversity definition: genetic, species and
ecosystem diversity – values of biodiversity. Biodiversity at global, national
and local levels – India as a mega-diversity nation – hot-spots of biodiversity –
threats to biodiversity – man-wildlife conflicts – endangered and endemic
species of India. Conservation of biodiversity: In-situ and ex-situ conservation
of biodiversity. Field study of common plants, insects, birds; Field study of
simple ecosystems – pond, river, hill slopes, etc.

UNIT II ENVIRONMENTAL POLLUTION 9

Definition – causes, 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 municipal solid wastes – role of an individual in
prevention of pollution – pollution case studies. Disaster management: floods,
earthquake, cyclone and landslides – nuclear accidents and holocaust – case
studies. Field study of local polluted site – Urban / Rural / Industrial
/Agricultural.

UNIT III NATURAL RESOURCES 9

Forest resources: Use and over – exploitation, deforestation, case studies –
Water resources: Use and over- utilization of surface and ground water –
dams-benefits and problems, conflicts over water – Mineral resources:
Environmental effects of extracting and using mineral resources, case studies
– Food resources: World food problems, changes caused by agriculture and
overgrazing, effects of modern agriculture, case studies – Energy resources:
Growing energy needs, use of alternate energy sources - renewable and non
renewable energy sources – Land resources: land degradation, man induced
landslides, soil erosion and desertification – role of an individual in
conservation of natural resources. Field study of local area to document
environmental assets – river / forest / grassland / hill / mountain.

37
 Syllabus CSE
UNIT IV SOCIAL ISSUES AND THE ENVIRONMENT 9
From unsustainable to sustainable development – Sustainable Development
Goals – Water conservation: rain water harvesting, watershed management –
Climate change: global warming, chemical and photochemical reactions in the
atmosphere – acid rain, ozone layer depletion – environmental ethics: Issues
and possible solutions – 12 Principles of green chemistry – Environmental
Legislation & Laws: Environment (Protection) Act – 1986 Air (Prevention and
Control of Pollution) act – Water (Prevention and control of Pollution) act –
Wildlife protection act – Forest conservation act – The Biomedical Waste
(Management and Handling) Rules; 1998 and amendments - scheme of
labelling of environmentally friendly products (Ecomark) – Issues involved in
enforcement of environmental legislation - central and state pollution control
boards, role of non-governmental organization – Public awareness.

UNIT V HUMAN POPULATION AND THE ENVIRONMENT 8

Population growth, variation among nations – population explosion – family
welfare programme – environment and human health – human rights – value
education – HIV / AIDS – women and child welfare – Environmental Impact
Assessment(EIA) - role of information technology in environment and human
health – Case studies.
TOTAL: 45 PERIODS

TEXT BOOKS:
1. Benny Joseph, “Environmental Science and Engineering”, Tata McGraw-
Hill, New Delhi, 2006.
2. Gilbert M.Masters, “Introduction to Environmental Engineering and
Science”, 2nd edition, Pearson Education, 2004.

REFERENCES :
1. Dharmendra S. Sengar, “Environmental law”, Prentice hall of India Pvt Ltd,
New Delhi, 2007.
2. Erach Bharucha, “Textbook of Environmental Studies”, Universities
Press(I) Pvt Ltd., Hydrabad, 2015.
3. G. Tyler Miller and Scott E. Spoolman, “Environmental Science”, Cengage
Learning India Pvt. Ltd., Delhi, 2014.
4. Rajagopalan. R, “Environmental Studies-From Crisis to Cure”, Oxford
University Press, 2005.

38
 Syllabus CSE
OUTCOMES:
Upon successful completion of this course, student should be able to
1. Understand the relationship between the environment and human
activities to maintain the ecological balance. (K1)
2. Identify societal issues and implement suitable technological solutions to
eradicate. (K3)
3. Acquire skills for scientific problem solving related to environmental
pollution and Disaster Management. (K3)
4. Disseminate the need for the natural resources and its application to meet
the modern requirements. (K2)
5. Aware of environmental issues and Protection Acts to achieve the
Sustainable Development Goals. (K2)
6. Recognize the need for population control measures and the
environmental based value.education concepts for attaining an eco-
friendly environment. (K2)

CO - PO MAPPING :
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 1 1 - - - 1 2 - 1 1 - 2

CO2 2 2 2 - 2 2 3 1 2 2 - 2

CO3 1 1 1 1 - 1 1 - 1 2 - 1

CO4 2 2 2 2 1 1 1 - 1 1 1 1

CO5 2 2 1 - - 1 1 - - - 1 -

CO6 1 1 1 1 1 1 1 1 1 1 1 1

SEMESTER - II
20ESIT202 L T P C
PYTHON PROGRAMMING
SDG NO. 4&9 3 0 0 3
OBJECTIVES:
l To develop simple Python programs with conditionals and loops
l To de ine Python functions and to implement lists, tuples, dictionaries and
sets
l To perform ile operations and understand OO concepts in Python
l To understand NumPy, Pandas and Matplotlib

39
 Syllabus CSE
UNIT I BASICS OF PYTHON PROGRAMMING 9
Introduction to Python – Literals – Variables and Identi iers – Data Types –
Input Operation – Comments – Reserved words – Indentation – Operators and
Expressions - Conditionals: Boolean values and operators - conditional if -
alternative if - chained conditional - Iteration - Illustrative programs:
Evaluation of expressions - String Operations - Circulate the values of n
variables - Square root (Newton's method) - GCD - Sum an Array of Numbers.

UNIT II STRING, LISTS, TUPLES, DICTIONARIES, SETS 9

Strings: String slices - Immutability - String functions and methods - String
module - Lists: List operations - List slices - List methods - List loop - Mutability
- Aliasing - Cloning lists - List parameters - Tuples: Tuple assignment - Tuple as
return value.
Dictionaries: Operations and Methods - Advanced list processing - List
comprehension - Sets: Creating Sets – Operations and methods – Set
comprehension - Illustrative programs: Linear search - Binary search -
Selection sort - Insertion sort - Merge sort.

UNIT III FUNCTIONS, MODULES, PACKAGES 9

Functions - de inition and use - Flow of execution - Parameters and arguments
- Fruitful functions: Return values - Parameters - Local and global scope -
Function composition - Recursion - Modules – from import statement – Name
of Module – Making your own modules - Packages - Packages in Python –
Standard Library Modules – Globals(), Locals() and Reload(); Illustrative
programs: Fibonacci series using functions - Arithmetic operations using
module - Area of different shapes using packages.

UNIT IV FILES, EXCEPTIONS, CLASSES AND OBJECTS 9

Files and exception: Text iles - Reading and writing iles - Format operator -
Command line arguments - Errors and exceptions - Handling exceptions -
Classes and Objects: De ining classes - Creating Objects – Data abstraction –
Class constructor – Class variables and Object variables – Public and Private
data members – Private Methods; Illustrative programs: Word count - Copy
ile - Creating user de ined exception - Creating student class and object.

UNIT V NUMPY, PANDAS, MATPLOTLIB 9

Introduction - Basics of NumPy - N-dimensional Array in NumPy - Methods
and Properties - Basics of SciPy - Broadcasting in NumPy Array Operations -
Array Indexing in NumPy, Pandas - Introduction - Series - DataFrame -
Matplotlib - Basics - Figures and Axes - Method subplot() - Axis container

40
 Syllabus CSE
Illustrative Programs: Multiplying a Matrix by a Vector, Solving Linear System
of Equations - Using Pandas to Open CSV iles - Creating a Single plot.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Reema Thareja, “Python Programming Using Problem Solving Approach”,
Oxford University Press 2018.
2. Anurag Gupta, G.P. Biswas, “Python Programming: Problem Solving,
Packages and Libraries”, McGrawHill, 2020.

REFERENCES:
1. Allen B. Downey, “Think Python: How to Think Like a Computer Scientist”,
Second edition, Updated for Python 3, Shroff/O'Reilly Publishers, 2016
2. Guido van Rossum and Fred L. Drake Jr, “An Introduction to Python –
Revised and updated for Python 3.2", Network Theory Ltd., 2011.
3. John V Guttag, “Introduction to Computation and Programming Using
Python'', Revised and expanded Edition, MIT Press , 2013
4. Robert Sedgewick, Kevin Wayne, Robert Dondero, “Introduction to
Programming in Python: An Inter-disciplinary Approach”, Pearson India
Education Services Pvt. Ltd., 2016.
5. Timothy A. Budd, “Exploring Python”, Mc-Graw Hill Education (India)
Private Ltd., 2015.
6. Kenneth A. Lambert, “Fundamentals of Python: First Programs”, CENGAGE
Learning, 2012.
7. Charles Dierbach, “Introduction to Computer Science using Python: A
Computational Problem-Solving Focus”, Wiley India Edition, 2013.
8. Paul Gries, Jennifer Campbell and Jason Montojo, “Practical Programming:
An Introduction to Computer Science using Python 3”, Second edition,
Pragmatic Programmers, LLC, 2013.

WEB REFERENCES:
1. http://greenteapress.com/wp/think-python/
2. www.docs.python.org
3. https://nptel.ac.in/courses/106/106/106106182/

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand the syntax and semantics, string operations of python
programming language (K2)

41
 Syllabus CSE
2. Develop python programs using control low statements.(K3)
3. Construct various Data structures to develop python programs. (K3)
4. Illustrate the concepts of Functions, Modules and Packages in Python.(K3)
5. Understand the concepts of Object Oriented Programming, iles and
Exception handling.(K2)
6. Examine various problem solving concepts in python to develop real time
applications.(K4)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3 3 1 1 0 0 1 0 1 2 2

CO2 3 3 3 3 3 1 0 0 0 0 0 1 2 2

CO3 3 3 3 3 3 2 1 0 0 0 0 1 2 2

CO4 3 3 3 3 3 2 1 0 0 0 0 1 2 2

CO5 3 3 3 3 3 2 2 1 0 2 0 2 3 3

CO6 3 3 3 3 3 3 3 2 3 2 3 2 3 3

SEMESTER - II
20ESIT203 DIGITAL PRINCIPLES AND L T P C
SDG NO. 4 & 9 SYSTEM DESIGN 2 1 0 3
OBJECTIVES:
l To analyze and design combinational circuits
l To analyze and design synchronous and asynchronous sequential circuits
l To understand Programmable Logic Devices
l To write HDL code for combinational and sequential circuits

UNIT I BOOLEAN ALGEBRA AND LOGIC GATES 9

Number Systems – Arithmetic Operations – Binary Codes- Boolean Algebra
and Logic Gates – Theorems and Properties of Boolean Algebra – Boolean
Functions – Canonical and Standard Forms – Simpli ication of Boolean
Functions using Karnaugh Map – Logic Gates – NAND and NOR
Implementations.
42
 Syllabus CSE
UNIT II COMBINATIONAL LOGIC 9
Combinational Circuits – Analysis and Design Procedures – Binary Adder-
Subtractor – Decimal Adder – Binary Multiplier – Magnitude Comparator –
Decoders – Encoders – Multiplexers – Introduction to HDL – HDL Models of
Combinational circuits.

UNIT III SYNCHRONOUS SEQUENTIAL LOGIC 9

Sequential Circuits – Storage Elements: Latches , Flip-Flops – Analysis of
Clocked Sequential Circuits – State Reduction and Assignment – Design
Procedure – Registers and Counters – HDL Models of Sequential Circuits.
UNIT IV ASYNCHRONOUS SEQUENTIAL LOGIC 9
Analysis and Design of Asynchronous Sequential Circuits – Reduction of State
and Flow Tables – Race-free State Assignment – Hazards.

UNIT V MEMORY AND PROGRAMMABLE LOGIC 9

RAM – Memory Decoding – Error Detection and Correction – ROM –
Programmable Logic Array – Programmable Array Logic – Sequential
Programmable Devices.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. M. Morris R. Mano, Michael D. Ciletti, “Digital Design: With an Introduction
to the Verilog HDL, VHDL, and SystemVerilog”, 6th Edition, Pearson
Education, 2017.

REFERENCES:
1. G. K. Kharate, “Digital Electronics”, Oxford University Press, 2010
2. John F. Wakerly, “Digital Design Principles and Practices”, Fifth Edition,
Pearson Education, 2017.
3. Charles H. Roth Jr, Larry L. Kinney, “Fundamentals of Logic Design”, Sixth
Edition, CENGAGE Learning, 2013
4. Donald D. Givone, “Digital Principles and Design”, Tata Mc Graw Hill, 2003.

ONLINE RESOURCES:
1. https://ocw.mit.edu/courses/online-textbooks/
2. https://nptel.ac.in/courses/117105080/

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understanding Boolean algebra, number systems and simplify Boolean
functions using Kmap. (K2)
43
 Syllabus CSE
2. Understand the Combinational and sequential Circuits. (K2)
3. Demonstrate the use of Combinational Circuits and Sequential circuits
(K3)
4. Interpret the designs using Programmable Logic Devices. (K3)
5. Apply HDL code for combinational and Sequential Circuits. (K3)
6. Interpret and troubleshoot logic circuits. (K3)

CO – PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 - - - - - - - - - - 3 - -

CO2 - 2 - - - - - - - - 3 1 - -

CO3 - 2 3 - - - - - - - 3 1 - -

CO4 - - - - - - - - - - 3 - - -

CO5 - - - - 1 - - - - - - 2 - -

CO6 - - - - - - - - - - 3 - - -

SEMESTER - II
20ESPL201 PYTHON PROGRAMMING L T P C
SDG NO. 4 LABORATORY 0 0 3 1.5

OBJECTIVES:
l Develop Python programs with conditionals, loops and functions
l Represent compound data using Python lists, tuples, dictionaries
l Read and write data from/to iles in Python
l Implement NumPy, Pandas, Matplotlib libraries

LIST OF EXPERIMENTS :
1 Compute the GCD of two numbers
2 Find the maximum and minimum of a list of numbers
3 Linear search and Binary search
4 Selection sort, Insertion sort
5 Merge sort, Quick Sort
6 First n prime numbers

44
 Syllabus CSE
7 Multiply matrices
8 Programs that take command line arguments (word count)
9 Find the most frequent words in a text read from a ile
10 Exception Handling – License Process
11 Classes and Objects – Student class
12 Solving Linear System of Equations
13 Using Pandas to Open csv iles
14 Creating a Single plot
15 Creating Scatter plot, Histogram

TOTAL: 45 PERIODS
LAB REQUIREMENTS
Python 3

OUTCOMES
On completion of the laboratory course, the student should be able to
1. Illustrate simple programs for describing the syntax, semantics and
control low statements. [K3]
2. Describe the core data structures like String, lists, dictionaries, tuples and
sets in Python to store, process and sort the data. [K2]
3. Interpret the concepts of functions, modules and packages in Python. [K3]
4. Illustrate the applications of python libraries. [K3]
5. Describe the ile manipulation and its operations. [K2]
6. Demonstrate exceptions and classes and objects for any real time
applications. [K3]

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 - 1 2 1 2 - - - 1 - 3 3 - 1

CO2 1 2 3 3 3 2 1 1 1 1 1 3 1 2

CO3 - 1 3 3 2 1 - - - - 1 3 - 1

CO4 1 2 3 3 2 - - - - - 1 3 1 2

CO5 - - 3 3 2 - - 1 - - 2 3 - -

CO6 - - 3 3 2 - - 1 - - 2 3 - -

45
 Syllabus CSE

SEMESTER - II
20ESPL202 L T P C
DIGITAL LABORATORY
SDG NO. 4 & 9 0 0 3 1.5

OBJECTIVES:
l To design and implement the various combinational circuits
l To design and implement combinational circuits using MSI devices
l To design and implement sequential circuits
l To understand and code with HDL programming

LIST OF EXPERIMENTS
1. Veri ication of Boolean Theorems using basic gates
2. Design and implementation of combinational circuits using basic gates
for arbitrary functions, code converters
3. Design and implement Half/Full Adder and Subtractor
4. Design and implement combinational circuits using MSI devices:
a) 4 bit binary adder/subractor
b) Parity generator/checker
c) Magnitude comparator
5. Application using multiplexers
6. Design and implement shift-registers
7. Design and implement synchronous counters
8. Design and implement asynchronous counter
9. Coding combinational circuits using HDL
10. Coding sequential circuits using HDL
11. Design and implementation of a simple digital system (Mini Project)

LAB REQUIREMENTS:
HARDWARE:
DIGITAL TRAINER KITS
DIGITAL IC’s required for the experiments in suf icient numbers

SOFTWARE:
HDL, Verilog simulator
TOTAL: 45 PERIODS

46
 CSE Syllabus
OUTCOMES
On completion of the laboratory course, the student should be able to
1. Implement simpli ied combinational circuits using basic logic gates. (K6)
2. Implement combinational circuits using MSI devices. (K6)
3. Implement sequential circuits like registers and counters.(K6)
4. Simulate combinational and sequential circuits using HDL.(K4)
5. Implement designs using Programmable Logic Devices. (K6)
6. Design and implementation of a simple digital system.(K6)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 3 3 2 2 1 1 - 2 2 - 2 1 1

CO2 3 3 3 2 3 2 1 1 2 2 2 3 1 1

CO3 2 3 3 3 3 2 2 1 2 2 2 3 1 1

CO4 3 3 3 3 3 2 2 1 3 3 3 3 1 1

CO5 2 3 3 2 2 - - 2 - 2 2 2 1 1

CO6 2 3 3 2 2 1 - - 2 2 3 2 1 1

SEMESTER - II
20ESGE201 ENGINEERING PRACTICES L T P C
SDG NO. 4,9,12 LABORATORY 0 0 3 1.5

OBJECTIVES:
l To provide exposure to the students with hands on experience on various
basic engineering practices in Electrical and Electronics Engineering, Civil and
Mechanical Engineering

ELECTRICAL ENGINEERING PRACTICE

1. Residential house wiring using switches, fuse, indicator, lamp and energy
meter.
2. Fluorescent lamp wiring.
3. Stair case wiring.
4. Measurement of electrical quantities – voltage, current, power & power
factor in RLC circuit.

47
 Syllabus CSE
5. Measurement of energy using single phase energy meter.
6. Measurement of resistance to earth of electrical equipment.

ELECTRONICS ENGINEERING PRACTICE

1. Study of Electronic components and equipments – Resistor, colour coding
measurement of AC signal parameter (peak-peak, rms period, frequency)
using CRO.
2. Study of logic gates AND, OR, EX-OR and NOT.
3. Generation of Clock Signal.
4. Soldering practice – Components, Devices and Circuits – Using general
purpose PCB.
5. Measurement of ripple factor of HWR and FWR.

CIVIL ENGINEERING PRACTICE

Buildings:
Study of plumbing and carpentry components of residential and industrial
buildings, safety aspects.

Plumbing Works:
1. Study of pipeline joints, its location and functions: valves, taps, couplings,
unions, reducers, elbows in household fittings.
2. Study of pipe connections requirements for pumps and turbines.
3. Preparation of plumbing line sketches for water supply and sewage works.
4. Hands-on-exercise: Basic pipe connections – Mixed pipe material
connection – Pipe connections with different joining components.
5. Demonstration of plumbing requirements of high-rise buildings.

Carpentry using Power Tools only:

1. Study of the joints in roofs, doors, windows and furniture.
2. Hands-on-exercise: Wood work, joints by sawing, planing and cutting.

MECHANICAL ENGINEERING PRACTICE

Welding:
1. Preparation of butt joints, lap joints and T- joints by Shielded metal arc
welding.
2. Gas welding practice.

48
 Syllabus CSE
Basic Machining:
1. Simple Turning and Taper turning.
2. Drilling Practice.

Sheet Metal Work:

1. Forming & Bending.
2. Model making – Trays and funnels.
3. Different type of joints.
Machine assembly practice:
1. Study of centrifugal pump.
2. Study of air conditioner.

Demonstration on:
1. Smithy operations, upsetting, swaging, setting down and bending.
Example – Exercise – Production of hexagonal headed bolt.
2. Foundry operations like mould preparation for gear and step cone pulley.
3. Fitting – Exercises – Preparation of square fitting and V – fitting models.
Total : 45 PERIODS

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS

1. Electrical
1 Assorted electrical components for house wiring 15 Sets
2 Electrical measuring instruments 10 Sets
3 Study purpose items:
Iron box, fan and regulator, emergency lamp 1 Each
4 Megger (250V/500V) 1 No
5 Power Tools:
Range Finder 2 Nos
Digital Live-wire detector 2 Nos

2. Electronics
1 Soldering guns 10 Nos
2 Assorted electronic components for making circuits 50 Nos
3 Small PCBs 10 Nos
4 Multimeters 10 Nos

3. Civil
1 Assorted components for plumbing consisting of metallic
pipes, plastic pipes, flexible pipes, couplings, unions, elbows,
49
 Syllabus CSE
plugs and other fittings. 15 Sets
2 Carpentry vice (fitted to work bench) 15 Nos
3 Standard woodworking tools 15 Sets
4 Models of industrial trusses, door joints, furniture joints 5 each
5 Power Tools:
Rotary Hammer 2 Nos
Demolition Hammer 2 Nos
Circular Saw 2 Nos
Planer 2 Nos
Hand Drilling Machine 2 Nos
Jigsaw 2 Nos

4. Mechanical
1 Arc welding transformer with cables and holders 5 Nos
2 Welding booth with exhaust facility 5 Nos
3 Welding accessories like welding shield, chipping hammer,
wire brush, etc 5 Sets
4 Oxygen and acetylene gas cylinders, blow pipe and other
welding outfit. 2 Nos
5 Centre lathe 2 Nos
6 Hearth furnace, anvil and smithy tools 2 Sets
7 Moulding table, foundry tools 2 Sets
8 Power Tool: Angle Grinder 2 Nos
9 Study-purpose items: centrifugal pump, air-conditioner 1 each

OUTCOMES:
Upon completion of the course, the students should be able to
1. Elaborate on the components, gates, soldering practices. Calculate
electrical parameters such as voltage, current, resistance and power.
(K1)
2. Design and implement Rectifier and Timer circuits (K2)
3. Measure the electrical energy by single phase and three phase energy
meters. (K2)
4. Prepare the carpentry and plumbing joints. (K2)
5. Perform different types of welding joints and sheet metal works (K2)
6. Perform different machining operations in lathe and drilling. (K2)

50
 Syllabus CSE
CO - PO MAPPING:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 2 1 1 2 1 - - 1 1 1 1

CO2 3 2 1 1 2 1 - - 1 1 1 1

CO3 2 2 1 1 1 1 - - 1 1 1 1

CO4 1 1 1 - - 2 - - 1 1 1 2

CO5 2 1 1 - - 1 1 1 1 1 1 2

CO6 2 1 1 - - 1 - 1 1 1 1 2

SEMESTER - II
20TPHS201 L T P C
SKILL ENHANCEMENT
SDG NO. 4&5 0 0 2 1
OBJECTIVES:
l To understand the nuances in resume building
l To explore various virtual meeting tools
l To gain knowledge about online certification courses
l To develop knowledge in Google Suite products
l To enhance presentation skills

UNIT I RESUME BUILDING 6

Your Strength, Projects, Internship, Paper Presentation, uploading your
coding in github, Introduction to HackerRank, HackerEarth virtual online
assessment (Auto Proctored) (Practicals - Construct a resume, Register for a
online Mock Assessment / Contest)

UNIT II VIRTUAL MEETINGS 6

Basic Etiquette of virtual meeting – Introduction to Skype - Zoom - Webex -
Google Meet - Gotowebinar - Jio meet – Screen Share - Jamboard - Feedback
polling - Chatbox
(Practicals - Accept and Register for a mock class to attend - How to host a
meeting).

UNIT III ONLINE LEARNING 6

Online Certification - Coursera – Udemy – Edx – Cisco – Online Practice
Platforms - SkillRack – Myslate - FACEprep - BYTS - aptimithra - Contest
51
 CSE Syllabus
Registrations - TCS Campus Commune - HackwithInfy, InfyTQ - Virtusa
NurualHack - Mindtree Osmosis – Online assessment - AMCAT-PGPA.
(Practicals - Campus Commune Registration , Coursera registration - Mock
Registration (KAAR Technologies as sample).

UNIT IV GOOGLE SUITE 8

Define google suite - Benefits of google suite - Google Search - Sheet - Docs -
Forms - Calender - Drive - Slide - Translate - Duo - Earch - Maps - Hangouts-
Sites - Books - Blogger
(Practicals – Create google sheets and share - Create google Forms and share,
Create Google Slide and share , Google drive creation and share (Knowledge of
Rights), Create poll and share.

UNIT V PRESENTATION SKILLS 4

Email Writing – Group Discussion - Power Point Presentation
(Practicals- Create a self SWOT Analysis report. A PowerPoint Slide
Preparation)
TOTAL : 30 PERIODS
WEB REFERENCES :
Unit I: Resume Building:
1. https://zety.com/blog/resume-tips
2. https://resumegenius.com/blog/resume-help/how-to-write-a-resume
3. https://www.hackerearth.com/recruit/
4. https://www.hackerrank.com/about-us

Unit – II:Virtual Meetings

1. https://www.claphamschool.org/our-community/blog/online-
learning-etiquette-guide-14-principles-to-guide-students
2. h t t p s : / / o n l i n e . h b s . e d u / b l o g / p o s t / v i r t u a l - i n t e r v i e w -
tips?c1=GAW_SE_NW&source=IN_GEN_DSA&cr2=search__-__nw__-
__in__-__dsa__-__general&kw=dsa__-__general& cr5=459341920955&cr7
=c&gclid=Cj0KCQjw8fr7BRDSARIsAK0Qqr4dRRbboL3kltrwDsr7hm8oI
HtN5dfjD3NIFZULuzNwEXxhjpNFQ2caApn5EALw_wcB
3. https://hygger.io/blog/top-10-best-group-meeting-apps-business/
4. https://www.zdnet.com/article/best-video-conferencing-software-and-
services-for-business/

Unit – III:Online Learning

1. https://www.coursera.org/browse
2. https://support.udemy.com/hc/en-us/articles/229603868-Certificate-

52
 Syllabus CSE
of-Completion
3. https://www.edx.org/course/how-to-learn-online
4. h t t p s : / / w w w. c i s c o . c o m / c / e n / u s / t ra i n i n g - eve n t s / t ra i n i n g -
certifications/certifications.html
5. https://campuscommune.tcs.com/en-in/intro
6. https://www.freshersnow.com/tcs-campus-commune-registration/
7. https://www.infosys.com/careers/hackwithinfy.html
8. https://www.mindtree.com/blog/osmosis-2013-my-experiences
9. https://www.myamcat.com/knowing-amcat
10. https://www.admitkard.com/blog/2020/02/06/amcat/

Unit IV: Google Suite

1. https://www.inmotionhosting.com/blog/what-is-g-suite-and-why-
should-i-consider-using-it/
2. https://en.wikipedia.org/wiki/G_Suite
3. https://blog.hubspot.com/marketing/google-suite
4. https://kinsta.com/blog/g-suite/

Unit V: Presentation Skills

1. https://www.mindtools.com/CommSkll/EmailCommunication.htm
2. https://www.grammarly.com/blog/email-writing-tips/
3. https://business.tutsplus.com/articles/how-to-write-a-formal-email--
cms-29793
4. https://www.softwaretestinghelp.com/how-to-crack-the-gd/
5. https://www.mbauniverse.com/group-discussion/tips
6. https://slidemodel.com/23-powerpoint-presentation-tips-creating-
engaging-interactive-presentations/
7. https://business.tutsplus.com/articles/37-effective-powerpoint-
presentation-tips--cms-25421
8 https://blog.prezi.com/9-tips-on-how-to-make-a-presentation-a-
success/
9. http://www.garrreynolds.com/preso-tips/design/

OUTCOMES:
On completion of this course, the student should be able to
1. Construct a suitable resume and registration procedure for online mock
assessments. (K1)

53
 CSE
Syllabus
2. Handle various virtual meeting tools. (K3)
3. Acquire exposure about online certification courses. (K4)
4. Get involved and work in a collaborative manner. (K2)
5. Gain knowledge in various presentation methodologies. (K1)
6. Apply knowledge to practice Google suite features and SWOT analysis. (K3)

CO – PO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 - - - - 3 2 - 3 2 3 - 2

CO2 - - - - 3 2 - 3 2 3 - 2

CO3 - - - - 3 2 - - 1 3 - 2

CO4 - - - - 3 2 - 3 3 3 - 2

CO5 - - - - 3 2 - - 2 3 - 2

CO6 - - - - 3 2 - - 2 3 - 2

SEMESTER - II
20HSMG201 L T P C
INTERPERSONAL VALUES
SDG NO. 4 & 5 2 0 0 0
OBJECTIVES:
l Values through Practical activities

UNIT I INTERPERSONAL VALUES 6

Interpersonal Relationships and Values – Importance and Barriers – Building
and maintain relationships – Mutual understanding – Respect to others.

UNIT II EFFECTIVE COMMUNICATION 6

Communication skills –Importance and Barriers - Impressive formation and
management – Public speaking
UNIT III GROUP DYNAMICS 6
Group formation –Teamwork – Identify others attitude and behaviour –
Formation of relationship – Personal and professional.

UNIT IV MUTUAL RELATIONSHIP 6

Building mutual understanding and cooperation – Enhancing decision making
skills – Problem solving skills – Comparative Appraisal – Interpersonal needs.

54
 CSE
Syllabus
UNIT V POSITIVE ATTITUDE 6
Fostering trust and cooperation – Developing and maintain positive attitude –
Improving socialization – Development of security and comfort.
TOTAL: 30 PERIODS
Note: Each topic in all the above units will be supplemented by practice
exercises and classroom activities and projects.

REFERENCE BOOKS:
1. Barun K. Mitra, “Personality Development and Soft Skills”, Oxford
University Press, 2016.
2. B.N.Ghosh, “Managing Soft Skills for Personality Development”, McGraw
Hill India, 2012.

OUTCOMES:
Upon completion of the course, the student should be able to
1. Develop a healthy relationship & harmony with others. (K1)
2. Practice respecting every human being. (K3)
3. Practice to eradicate negative temperaments. (K3)
4. Acquire Respect, Honesty, Empathy, Forgiveness and Equality. (K4)
5. Manage the cognitive abilities of an Individual. (K5)
6. Understanding the importance of public speaking and teamwork. (K2)

CO – PO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 - - - - - 2 2 3 3 1 1 1

CO2 - - - - - 2 2 3 3 1 1 1

CO3 - - - - - 2 2 3 3 1 1 1

CO4 - - - - - 2 2 3 3 1 1 1

CO5 - - - - - 2 2 3 3 1 1 1

CO6 - - - - - 2 2 3 3 1 1 1

55
 Syllabus CSE
SEMESTER - III
20BSMA304 L T P C
STATISTICS AND LINEAR ALGEBRA
SDG NO. 4 3 1 0 4
OBJECTIVES:
l The main objective of this course is to provide students with the foundations
of statistics and linear algebra mostly used in varied applications in
engineering.

UNIT I BASIC STATISTICS 12

Measures of Central tendency: Moments, Skewness and Kurtosis - Probability
distributions - Binomial, Poisson and Normal - evaluation of statistical
parameters for these three distributions, Correlation and regression – Rank
correlation

UNIT II TESTING OF HYPOTHESIS 12

Sampling distributions - Estimation of parameters - Statistical hypothesis -
Test of signi icance: Large sample test for single proportion, difference of
proportions, single mean, difference of means - Tests based on t, Chi-square
and F distributions for mean, variance and proportion - Contingency table
(test for independence) - Goodness of it.

UNIT III VECTOR SPACES 12

Vector spaces – Subspaces – Linear combinations– Linear independence and
linear dependence – Bases and dimensions.

UNIT IV LINEAR TRANSFORMATION AND DIAGONALIZATION 12

Linear transformation - Null spaces and ranges - Dimension theorem - Matrix
of a linear transformation - Eigenvalues and eigenvectors - Diagonalizability.

UNIT V INNER PRODUCT SPACES 12

Inner product, norms - Gram Schmidt orthogonalization process - Adjoint of
linear operations - Least square approximation.
TOTAL: 60 PERIODS

TEXT BOOKS:
1. Michael Baron,”Probability and Statistics for Computer Scientists” second
edition, CRC press, USA (Unit-I&II)
2. Howard Anton, Chris Rorres, “Elementary Linear Algebra”,Wiley
Publications,11th edition,2014(Unit-III,IV&V)
56
 Syllabus CSE
REFERENCES:
1. Spiegel. M.R., Schiller. J. and Srinivasan. R.A., "Schaum's Outlines on
Probability and Statistics ", Tata McGraw Hill Edition,2004.
2. Walpole. R.E., Myers. R.H., Myers. S.L. and Ye. K., “Probability and Statistics
for Engineers and Scientists", 8thEdition, Pearson Education, Asia,2007.
3. Kapur J. N., Saxena H.C., “Mathematical Statistics”, 18th Edition, S. Chand &
Company Ltd., 1997.
4. Friedberg A.H.,Insel A.J. and Spence L., “Linear Algebra”, Prentice Hall of
India, New Delhi,2014.
5. Strang G., “Linear Algebra and its applications”, Thomson (Brooks/Cole),
New Delhi, 2005.
6. Kumaresan S., ―”Linear Algebra – A Geometric Approach”, Prentice – Hall
of India, New Delhi, Reprint, 2010.
7. E. Kreyszig, “Advanced Engineering Mathematics”, 8th Edition, John
Wiley,1999.

WEB REFERENCES:
1. https://people.richland.edu/james/lecture/m113/
2. https://nptel.ac.in/courses/111105041/
3 https://www.imsc.res.in/~svis/Algebra/Sunder-LinearAlg-notes.pdf

ONLINE RESOURCES:
1. https://ocw.mit.edu/courses/mathematics/18-06-linear-algebra-
spring-2010/video-lectures/
2. https://www.khanacademy.org/math/statistics-probability/
signi icance-tests-one-sample/more-signi icance-testing-videos/v/
hypothesis-testing-and-p-values

OUTCOMES:
Upon completion of the course, the student should be able to
1. Evaluate the statistical parameters of standard distributions using the
concepts of probability. (K3)
2. Apply tests of hypotheses for large and small samples. (K3)
3. Compute correlation coef icient, regression, Chi –square statistic and least
square approximation. (K3)
4. Compute basis, dimension, null space, range, matrix of linear
transformation (K3)
5. Construct the diagonal form of the linear transformation and ind the
adjoint of linear operators. (K3)
6. Apply the concept of inner product to compute the orthonormal basis
using Gram Schmidt orthogonalization process. (K3)

57
 Syllabus CSE
CO – PO MAPPING:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 3 2 1 - - - - - - - 1

CO2 3 3 2 1 - - - - - - - 1

CO3 3 3 2 1 - - - - - - - 1

CO4 3 3 2 1 - - - - - - - 1

CO5 3 3 2 1 - - - - - - - 1

CO6 3 3 2 1 - - - - - - - 1

SEMESTER - III
20CSPC301
OBJECT ORIENTED PROGRAMMING L T P C
SDG NO. 4 & 9 2 1 0 3
OBJECTIVES:
l To understand Object Oriented Programming concepts and principles of
Packages, Inheritance and Interfaces
l To de ine Exceptions and use I/O streams
l To develop a Java application with threads and generic classes
l To design and build simple Graphical User Interfaces

UNIT I INTRODUCTION TO OOP AND JAVA FUNDAMENTALS 10

Object Oriented Programming – Abstraction – Objects and Classes –
Encapsulation– Inheritance – Polymorphism– OOP in Java – Characteristics of
Java – The Java Environment – Java Source File – Compilation - Fundamental
Programming Structures in Java – De ining Classes in Java – Constructors -
Methods - Access Speci iers – Static Members - Comments - Data Types-
Variables - Operators- Control Flow- Arrays- Packages – Javadoc Comments.

UNIT II INHERITANCE AND INTERFACES 9

Inheritance – Super Classes– Sub Classes –Protected Members – Constructors
in Sub Classes– The Object Class – Abstract Classes and Methods – Final
Methods and Classes – Interfaces – De ining an Interface - Implementing
Interface - Differences between Classes and Interfaces and Extending
Interfaces – Object Cloning -Inner Classes -Array Lists -Strings.

UNIT III EXCEPTION HANDLING AND I/O 9

Exceptions – Exception Hierarchy – Throwing and Catching Exceptions – Built-
58
 Syllabus CSE
in Exceptions-Creating own Exceptions - Stack Trace Elements - Input /
Output Basics – Streams – Byte Streams and Character Streams – Reading and
Writing Console – Reading and Writing Files.

UNIT IV MULTI-THREADING AND GENERIC PROGRAMMING 8

Differences between Multi-Threading and Multitasking - Thread Life Cycle -
Creating Threads - Synchronizing Threads - Inter-Thread Communication -
Daemon Threads - Thread Groups - Java Concurrency Packages - Generic
Programming – Generic Classes – Generic Methods – Bounded Types –
Restrictions and Limitations.

UNIT V LAMBDAS STREAMS AND REACTIVE PROGRAMMING 9

Lambda Expressions – Library Enhancements to Support Lambdas – No
Parameter-Single Parameter - Multiple Parameters – With or Without Return
Keyword-Comparator– Filter Collection Data-Streams-Generating Streams-
Java Stream Interface Methods – For each-Map-Filter-Limit-Sorted - Parallel
Processing - Reactive Programming– ReactiveX– ReactiveX Classes– Creating
Operator– Reactive Subjects.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Herbert Schildt, “Java - The Complete Reference”, 8th Edition, McGrawHill
Education, 2011.
2. E.Balagursamy- “Programming with Java”, 6 th Edition, McGrawHill
Education, 2019.

REFERENCES:
1. Paul Deitel, Harvey Deitel, “Java SE 8 for Programmers”, 3rd Edition,
Pearson, 2015.
2. Steven Holzner, “Java 2 Blackbook”, Dream Tech Press, 2011.
3. Timothy Budd, “Understanding Object-Oriented Programming with Java”,
Updated Edition, Pearson Education, 2000.
4. Kathy Sierra, Bert Bates, Trisha Gee, "Head First Java", 3rd Edition, O'Reilly,
2022.
5. Joshua Bloch, " Effective Java", Third Edition, Addison Wesley, 2018.

WEB REFERENCES:
1. https://www.w3schools.com/java/java_oop.asp
2. https://www.edureka.co/blog/object-oriented-programming/
3. https://www.ntu.edu.sg/home/ehchua/programming/java/J3a_
OOPBasics.html

59
 Syllabus CSE
ONLINE RESOURCES :
1. https://www.ntu.edu.sg/home/ehchua/programming/java/J3a_
OOPBasics.html
2. https://introcs.cs.princeton.edu/java/lectures/

OUTCOMES:
Upon completion of the course, students should be able to
1. Comprehend Object Oriented Programming Concepts in Java. (K2)
2. Illustrate the purpose of packages, Java documents and Analyze the various
types of Inheritance. (K4)
3. Apply the Object Oriented Programming Concepts to develop the reusable
Applications. (K3)
4. Illustrate the java applications using Java Exceptions and I/O Streams.(K4)
5. Understand the concept of Multithreading and Generic Classes in Java. (K2)
6. Design and implement Lambda expressions, streams and reactive
programming. ( K6)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 1 2 2 - 2 - - - - - 2 3 2

CO2 3 1 3 2 - 2 - - 2 - - 2 3 2

CO3 3 1 3 2 - 2 - - - - - 2 3 3

CO4 3 1 3 2 - 2 - - - - - 2 3 2

CO5 3 1 3 2 3 2 - - - - - 2 3 2

CO6 3 1 3 2 3 2 - - 1 - - 2 3 2

SEMESTER - III
20ESEC301 L T P C
COMMUNICATION ENGINEERING
SDG NO. 4 3 0 0 3

OBJECTIVES:
l To introduce the relevance of this course to the existing technology through
demonstrations, case studies, simulations, contributions of scientist,
national/international policies with a futuristic vision along with socio-
economic impact and issues
l To study the various analog and digital modulation techniques

60
 Syllabus CSE
l To study the principles behind information theory and coding
l To study the various digital communication techniques

UNIT I ANALOG MODULATION 9

Amplitude Modulation – AM, DSBSC, SSBSC, VSB-Modulators and
Demodulators – Angle modulation – PM and FM -Modulators and
Demodulators – Super heterodyne receivers

UNIT II PULSE MODULATION 9

Low pass sampling theorem – Quantization – PAM, PTM – Line coding – PCM,
DPCM, DM & ADM - Time Division Multiplexing, Frequency Division
Multiplexing.

UNIT III DIGITAL MODULATION AND TRANSMISSION 9

Amplitude Shift Keying (ASK), Frequency Shift Keying (FSK), Phase shift
keying – BPSK, QPSK, 8 PSK.QAM-8 QAM, 16 QAM – Comparison of various
digital communication system, Inter Symbol Interference– Eye pattern.

UNIT IV INFORMATION THEORY AND CODING 9

Measure of information – Entropy – Source coding theorem – Shannon–Fano
coding, Huffman Coding , Mutual Information, Channel capacity – Error
control codes-Linear block codes, Cyclic codes, Syndrome calculation –
Convolution Coding.

UNIT V WIRELESS COMMUNICATION 9

Spread Spectrum and Multiple Access Techniques –Global system for Mobile
Communication (GSM)-Cellular Concept and Frequency Reuse-Satellite
Communication-Bluetooth
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Wayne Tomasi, “Advanced Electronic Communication Systems”, 6/e,
Pearson Education, 2007.
2. Simon Haykin, “Communication Systems”, 4th Edition, John Wiley & Sons.
2001.
3. H Taub, D L Schilling, G Saha, “Principles of Communication Systems” 3/e,
TMH, 2007.

REFERENCES:
1. S. Haykin “Digital Communications” John Wiley, 2005.
2. B.Sklar, Digital Communications Fundamentals and Applications” 2/e
Pearson Education, 2007.
61
 Syllabus CSE
rd
3. B.P.Lathi, “Modern Digital and Analog Communication Systems”, 3 edition,
OxfordUniversity Press, 2007.
4. H P Hsu, Schaum Outline Series – “Analog and Digital Communications”
TMH, 2006.

ONLINE RESOURCES:
1. https://freevideolectures.com/search/communication-engineering/
2. https://www.tutorialspoint.com/principles_of_communication/
index.htm

WEB REFERENCES :
1. https://swayam.gov.in/nd1_noc20_ee16/preview
2. https://www.scientechworld.com/education-software-training-and-
skill- development/sku-online-learning/analog-and-digital-
communication

OUTCOMES:
Upon completion of the course, the student should be able to:
1. Interpret various modulation techniques to model a communication
system (K3)
2 Discuss angle modulation techniques and compare various analog
modulation techniques. (K2)
3 Interpret the performance of digital modulation schemes such as BPSK,
BFSK, QPSK, DPSK & QAM. (K3)
4 Illustrate and compare the Encoding schemes such as PCM, DPCM, DM &
ADM and different waveform coding schemes. (K3)
5 Infer the channel coding theorem and error control coding and decoding
schemes like block codes, hamming codes, cyclic codes, convolutional
codes and viterbi decoder. (K2)
6 Analyze the different multiple access Techniques, cellular concept and free
reuse for wireless communication. (K4)

62
 Syllabus CSE
CO- PO, PSO MAPPING:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 - 3 - - 3 - - - - - 1

CO2 3 3 3 - 3 - - 3 - - 1 1 - 1

CO3 3 3 3 2 - - - - - - - 1 2 1

CO4 3 3 2 1 - - - - - - - 1 2 1

CO5 3 3 3 2 - - - - - - - 1 2 1

CO6 3 3 3 3 - - 1 2 - 3 2 1 2 1

SEMESTER - III
20ITPC301 L T P C
DATA STRUCTURES
SDG NO. 4 3 0 0 3

OBJECTIVES:
l To understand the concepts of ADT’s
l To learn Linear Data Structures – Lists, Stacks, and Queues
l To understand Sorting, Searching and Hashing Algorithms
l To learn Dynamic Data Structures - Tree and Graph

UNIT I LINEAR DATA STRUCTURES – I 9

Stacks and Queues : Abstract Data Types (ADTs) – Stack ADT – Operations -
Applications - Evaluating arithmetic expressions- Conversion of In ix to
Post ix expression - Queue ADT – Operations - Circular Queue – Priority Queue
–Dequeue – Applications of Queues.

UNIT II LINEAR DATA STRUCTURES – II 9

Linked List: List ADT – Array-Based Implementation – Linked List
Implementation –– Singly Linked Lists- Circularly Linked Lists- Doubly-Linked
Lists – Applications of Lists –Polynomial Manipulation – All Operations
(Insertion, Deletion, Merge, Traversal).

UNIT III NON LINEAR DATA STRUCTURES – I 9

Trees : Tree ADT – Tree Traversals - Binary Tree ADT – Expression Trees –
Applications of Trees – Binary Search Tree ADT –Threaded Binary Trees- AVL
Trees – B-Tree - B+ Tree -Heap – Applications of Heap.
63
 Syllabus CSE

UNIT IV NON LINEAR DATA STRUCTURES – II 9

Graphs : De inition – Representation of Graph – Types of Graph – Breadth First
Traversal –Depth First Traversal – Topological Sort – Bi-Connectivity – Cut
Vertex – Euler Circuits – Dijkstra‟s algorithm – Bellman-Ford algorithm –
Floyd's Algorithm - minimum spanning tree – Prim's and Kruskal's algorithms
– Applications of Graphs.

UNIT V SEARCHING, SORTING AND HASHING TECHNIQUES 9

Searching- Linear Search - Binary Search - Sorting - Bubble Sort - Selection Sort
- Insertion Sort - Shell Sort – Radix Sort – Hashing- Hash Functions – Separate
Chaining – Open Addressing – Rehashing – Extendible Hashing.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, Pearson
Education Asia, 2002.
2. Reema Thareja, “Data Structures Using C”, Second Edition, Oxford
University Press, 2011.

REFERENCES:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein,
“Introduction to Algorithms", Second Edition, Mcgraw Hill, 2002.
2. Stephen G. Kochan, “Programming in C”, 3rd edition, Pearson Education.
3. Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson
Education, 1983.
4. Ellis Horowitz, SartajSahni, Susan Anderson-Freed, “Fundamentals of Data
Structures in C”, Second Edition, University Press, 2008.

WEB REFERENCES :
1. https://www.programiz.com/dsa
2. http://masterraghu.com/subjects/Datastructures/ebooks/
remathareja.pdf

OUTCOMES:
Upon completion of the course, the student should be able to
1. Implement abstract data types for linear data structures. (K3)
2. Implement abstract data types for non-linear data structure. (K3)
3. Apply the different linear and non-linear data structures to problem
solutions. (K3)
4. Implement the various sorting and searching algorithms. (K3)
5. Solve Problem involving Graph, Trees and Heap. (K3)
6. Choose appropriate data structures to solve real world problems
ef iciently. (K3)
64
 Syllabus CSE
CO- PO, PSO MAPPING :
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 2 1 2 1 1 1 0 2 2 3 3 1 1

CO2 2 2 1 2 1 1 1 0 2 2 3 3 1 1

CO3 3 3 2 3 3 1 1 1 2 2 3 3 1 1

CO4 2 2 1 2 3 2 1 0 1 1 2 1 1 2

CO5 2 2 1 2 3 0 0 1 2 1 2 2 1 2

CO6 3 3 3 3 1 0 0 0 1 1 2 1 2 2

SEMESTER - III
20ITPC303 COMPUTER ORGANIZATION AND L T P C
SDG NO. 4 & 9 ARCHITECTURE 3 0 0 3
OBJECTIVES:
l To learn the basic structure and operations of a Computer
l To study the implementation of Fixed-Point and Floating Point Arithmetic
unit
l To understand Parallelism and Multi-core processors using Pipelined
execution
l To understand the Cache memories, Virtual memories and Communication
of I/O devices

UNIT I BASIC STRUCTURE OF A COMPUTER SYSTEM 7

Functional Units – Basic Operational Concepts – Performance – Instructions:
Language of the Computer – Operations, Operands – Instruction
representation – Logical operations –Decision Making – MIPS Addressing.

UNIT II ARITHMETIC OPERATIONS IN PROCESSORS 11

Addition and Subtraction – Multiplication – Division – Floating Point
Representation – Floating Point Operations – Subword Parallelism.

UNIT III PROCESSOR AND CONTROL UNIT 11

A Basic MIPS implementation – Building a Datapath – Control Implementation
Scheme – Pipelining – Pipelined Datapath and Control – Handling Data
Hazards & Control Hazards – Exceptions.

65
 Syllabus CSE
UNIT IV PARALLELISM 7
Parallel Processing Challenges – Flynn's classi ication – SISD, MIMD, SIMD,
SPM and Vector Architectures – Hardware multithreading – Multi-core
processors and other Shared Memory Multiprocessors – Introduction to
Graphics Processing Units, Clusters, Warehouse Scale Computers and other
Message-Passing Multiprocessors.

UNIT V MEMORY AND I/O SYSTEMS 9

Memory Hierarchy – memory technologies – Cache Memory – Measuring and
Improving Cache Performance – Virtual Memory, TLB's – Accessing I/O
Devices – Interrupts – Direct Memory Access – Bus structure – Bus Operation –
Arbitration – Interface circuits – USB.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. David A. Patterson and John L. Hennessy, “Computer Organization and
Design: The Hardware/Software Interface”, Fifth Edition, Morgan
Kaufmann / Elsevier, 2014.
2. Carl Hamacher, ZvonkoVranesic, SafwatZaky and NaraigManjikian,
“Computer Organization and Embedded Systems”, Sixth Edition, Tata
McGraw Hill, 2012.

REFERENCES:
1. William Stallings, “Computer Organization and Architecture – Designing
for Performance”, Eighth Edition, Pearson Education, 2010.
2. John P. Hayes, “Computer Architecture and Organization”, Third Edition,
Tata McGraw Hill, 2012.
3. John L. Hennessey and David A. Patterson, “Computer Architecture – A
Quantitative Approach”, Morgan Kaufmann / Elsevier Publishers, Fifth
Edition, 2012.

WEB REFERENCES:
1. https://nptel.ac.in/courses/106/106/106106147/

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand the physical and logical aspects of Computer System (K2)
2. Analyze the various parameters of the processor to improve system
performance. (K4)
3. Evaluate the ixed and loating point arithmetic operations. (K5)
4. Design data path and control unit of computer system (K6)
5. Understand parallel processing architectures with pipelining and
avoidance of hazards (K2)

66
 Syllabus CSE
6. De ine the various components of computer system hardware (K1)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 1 - - - - - - - - 1 2 3

CO2 3 3 2 - - - - - - - - 2 3 3

CO3 3 3 3 - - - - - - - - 2 3 3

CO4 3 3 3 - - - - - - - - 3 3 3

CO5 3 1 1 - - - - - - - - 3 3 3

CO6 3 1 1 - - - - - - - - 3 2 3

SEMESTER - III
20ITPL301 L T P C
DATA STRUCTURES LABORATORY
SDG NO. 4 0 0 3 1.5
OBJECTIVES:
l To implement Linear and Non-linear Data Structures
l To understand the different operations of Search Trees
l To implement Graph Traversal algorithms
l To get familiarized to Sorting and Searching algorithm

LIST OF EXPERIMENTS :
1. Array implementation of Stack and Queue ADTs
2. Array implementation of List ADT
3. Linked list implementation of List, Stack and Queue ADTs
4. Applications of List, Stack and Queue ADTs
5. Implementation of Binary Trees and operations of Binary Trees
6. Implementation of Binary Search Trees
7. Implementation of AVL Trees
8. Implementation of Heaps using Priority Queues
9. Graph representation and Traversal algorithms
10. Applications of Graphs- Implementation of searching and sorting
algorithms
11. Implementation of any two Collision Techniques in Hashing
TOTAL: 45 PERIODS

67
 Syllabus CSE
LAB REQUIREMENTS :
Turbo C/Dev C++, Borland C

OUTCOMES:
On completion of this laboratory course, the student should be able to
1. Write functions to implement linear and non-linear data structure
operations. [K1]
2. Suggest appropriate linear / non-linear data structure operations for
solving a given problem. [K2]
3. Design and analyze the time and space ef iciency of data structure.[K2]
4. Apply sorting and searching techniques. [K3]
5. Apply appropriate hash functions that result in a collision free scenario for
data storage and retrieval. [K3]
6. Choose and implement ef icient data structures and apply them to solve
problems. [K3]

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 3 1 2 1 1 - - - - 2 2 2 2

CO2 2 3 2 2 2 1 - - - - 2 3 2 2

CO3 3 3 2 2 1 1 - - - - 2 2 2 2

CO4 3 3 2 2 1 1 - - - - 2 3 2 2

CO5 1 2 2 1 2 1 - - - - 1 1 2 2

CO6 1 2 2 1 1 - - - - - 1 1 2 2

68
 Syllabus CSE

SEMESTER - III
20CSPL301 OBJECT ORIENTED PROGRAMMING L T P C
SDG NO. 4 & 9 LABORATORY 0 0 3 1.5

OBJECTIVES:
l To understand Object Oriented Programming concepts and basic
characteristics of Java
l To know the principles of Packages, Inheritance and Interfaces
l To develop a Java application with Threads and Generic classes
l To make the students understand life cycle of the Applets and its
functionality

LIST OF EXPERIMENTS :
1. Basic JAVA Programs
a. Write a program to ind the sum of individual digits of a positive integer.
b. Write a program to generate the irst n terms of the sequence.
c. Write a program to generate all the prime numbers between 1 and n,
where n is a value supplied by the user.
d. Write a program to ind both the largest and smallest number in a list of
integers.
e. Write a program to ind factorial of list of number reading input as
command.
2. Write a program to calculate bonus for different departments using
method overriding.
3. Write a program to sort list of elements in ascending and descending order
and show the exception handling.
4. Write a program to implement the concept of importing classes from user
de ined package and creating packages.
5. Write programs that illustrate how the following forms of inheritance are
supported:
a) Single inheritance
b) Multiple inheritance
c) Multi level inheritance
d) Hierarchical inheritance
6. Write a program to demonstrate use of implementing interfaces.
7. Write a program to implement interfaces all string operations.

69
 Syllabus CSE
8. Write a program to create student report using applet, read the input using
text boxes and display the output using buttons.
9. Write a program to implement thread priorities.
10. Write a program to implement thread, applets and graphics to animate ball
movement.
11. JAVA Applet program
a) Write a Applet program using paint brush
b) Write a program to display analog clock using Applet
c) Write a program to create different shapes and ill colors using Applet
12. JAVA Event Handling program
a) Write a program that display the x and y position of the cursor
movement using Mouse
b) Write a program that identi ies key-up key-down event user entering
text in a Applet
13. JAVA programs on Swings
a) Write a program to build a Calculator in Swings
b) Write a program to display the digital watch in swing
c) Write a program that to create a single ball bouncing inside a Jpanel.
d) Write a program JTree as displaying a real tree upside down
TOTAL : 45 PERIODS
LAB REQUIREMENTS :
Hardware :
Desktop Systems - Pentium IV with 2 GB RAM
160 GB HARD Disk
Monitor 1024 x 768 colour

Software :
Windows operating system
JDK 1.8

OUTCOMES:
On completion of this laboratory course, the student should be able to
1. Write Java programs in accordance with the object oriented
programming concepts. (K6)
2. Design user de ined java packages. (K6)
3. Create Java programs using Inheritance and Polymorphism. (K6)

70
 CSE Syllabus
4. Implement Error-handling techniques using Exception handling and
Multithreading. (K6)
5. Develop Applet program and GUI using Swing components. (K6)
6. Enumerate the event handling techniques in Java Programming. (K5)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 2 2 - 2 - - - - 2 2 3 2

CO2 2 2 3 2 - 2 - - - - 2 2 3 2

CO3 2 2 3 2 - 2 - - 2 2 2 2 3 2

CO4 3 3 2 2 - 2 - - - - 2 2 3 2

CO5 3 3 3 2 - 2 - - - - 2 2 3 2

CO6 2 3 3 2 - 2 - - 2 2 2 2 3 2

SEMESTER - III
20CSTE301 L T P C
SDG NO. 4,11&15 LIVE-IN-LAB - I
0 0 2 1

OBJECTIVES:
l To understand the engineering aspects of design with reference to simple
products
l To foster innovation in design of products
l To develop design that add value to products and solve technical problems.
l To create awareness among the students of the characteristics of several
domain areas where IT can be effectively used

COURSE PLAN :
Study: Take minimum three simple products, processes or techniques in the
area of specialization, study, analyze and present them. The analysis shall be
focused on functionality, construction, quality, reliability, safety, maintenance,
handling, sustainability, cost etc. whichever are applicable. Each student in the
group has to present individually; choosing different products, processes or
techniques.
Design: The project team shall identify an innovative product, process or
technology and proceed with detailed design. At the end, the team has to
document it properly and present and defend it. The design is expected to
71
 Syllabus CSE
concentrate on functionality; design for strength is not expected.

Note: The one hour/week allotted for tutorial shall be used for discussions and
presentations. The project team (not exceeding four) can be students from
different branches, if the design problem is multidisciplinary.

EVALUATION:
1. First evaluation (Immediately after irst internal examination) : 20 marks
2. Second evaluation (Immediately after second internal examination):
20 marks
3. Final evaluation ( Last week of the semester) : 60 marks

Note: All the three evaluations are mandatory for course completion and for
awarding the inal grade.

OUTCOMES:
Upon completion of the course, the student should be able to
1. List the problems and conduct literature survey to identify the gap and
come up with an application oriented research problem in the speci ic
domain.(K1)
2. Understand the project characteristics and explore necessary tools and
components needed at various stages of the project(K2)
3. Design and validate the proposed system using simulation.(K3)
4. Develop the Prototype of the proposed system by adapting Industrial
safety standards and best financial management practices(K5)
5. Analyze the obtained results and prepare a technical report.(K4)
6. Evaluate the project and go for journals and patents publication.(K5)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 2 2 2 2 2 2 3 2 2 3 3 3

CO2 3 3 3 2 3 3 2 2 3 3 3 3 3 3

CO3 3 3 3 2 3 3 2 2 3 3 3 3 3 3

CO4 2 2 2 1 2 1 1 1 3 2 3 3 3 2

CO5 2 2 2 1 2 1 1 1 3 2 3 3 3 2

CO6 2 2 2 1 2 1 1 1 3 2 3 3 3 2

72
 Syllabus CSE

SEMESTER - III
20CSTP301 L T P C
SKILL ENHANCEMENT
SDG NO. 4 0 0 2 1

APTITUDE & COGNITIVE SKILLS – PHASE 1

OBJECTIVE:
l To educate and enrich the students on quantitative ability, reasoning
ability, and verbal ability.
l Improve their quantitative ability.
l Improve the ability of arithmetic reasoning
l Enhance their verbal ability through vocabulary building and grammar
l Equip with creative thinking and problem solving skills

UNIT I QUANTITATIVE ABILITY – I 10

Problems on Trains - Time and Distance - Height and Distance - Time and
Work

UNIT II QUANTITATIVE ABILITY – II 10

Problems on Ages - Alligation or Mixture - Chain Rule - Simple Interest - Simple
Equation - Theory Of Equation.

UNIT III REASONING ABILITY – I 8

Analytical Reasoning - Pipes and Cistern - Logical Problems - Logical Games -
Logical Deduction - Data Suf iciency - Arithmetic Reasoning
UNIT IV VERBAL ABILITY – I 10
Idioms & Phrases - Synonyms - Antonyms - Classi ication

UNIT V CREATIVITY ABILITY – I 7

Venn Diagrams -Cube and Cuboids - Dice - Cubes and Dice - Figure Matrix.
TOTAL : 45 PERIODS
REFERENCES:
1. Quantitative Aptitude for Competitive Exams by R. S. Agarwal
2. Quantum CAT by Sarvesh Verma
3. A Modern Approach to Logical Reasoning by R. S. Agarwal
4. Verbal Ability and Reading Comprehension by Arun sharma

73
 Syllabus CSE

PROBLEM SOLVING USING C PROGRAMMING - PHASE 2

OBJECTIVES:
l To provide exposure to problem-solving through programming.
l To train the student to the basic concepts of the C-programming language.
l To provide exposure to problem-solving through programming.
l To give the student hands-on experience with the concepts

UNIT I INTRODUCTION TO PRINCIPLES OF PROGRAMMING 9

Introduction to Programming , Programming Domain : Scienti ic Application ,
Business Applications, Arti icial Intelligence, Systems Programming , Web
Software Categories of Programming Languages: Machine Level Languages,
Assembly Level Languages , High Level Languages Programming Design
Methodologies : Top Down and Bottom UP Program Development Cycle with
case study, Program Execution and Translation Process ,Problem solving using
Algorithms and Flowcharts, Performance Analysis and Measurements: Time
and Space complexity.

UNIT II INTRODUCTION TO C PROGRAMMING 9

Features of C and its Basic Structure, Simple C programs, Constants, Integer
Constants, Real Constants, Character Constants, String Constants, Backslash
Character Constants, Concept of an Integer and Variable, Rules for naming
Variables and assigning values to variables, Floating-point Numbers,
Converting Integers to Floating-point and vice-versa, Mixed-mode
Expressions, The type cast Operator, The type char, Keywords, Character
Input and Output, Formatted input and output, The gets() and puts()
functions, Interactive Programming.

UNIT III OPERATORS, EXPRESSIONS AND CONTROL STATEMENTS 9

Arithmetic Operators, Unary Operators, Relational and Logical Operators, The
Conditional Operator, Library Functions, Bitwise Operators, The Increment
and Decrement Operators, The Size of Operator, Precedence of operators, The
goto statement, The if statement, The if-else statement, Nesting of if
statements, The conditional expression, The switch statement, The while loop,
The do…while loop, The for loop, The nesting of for loops, The break statement
and continue statement.

74
 Syllabus CSE
UNIT IV ARRAYS, STRINGS AND POINTERS 9
One Dimensional Arrays, Passing Arrays to Functions, Multidimensional
Arrays, Strings, Basics of Pointers, Pointers and One-dimensional Arrays,
Pointer Arithmetic, Pointer Subtraction and Comparison, Similarities between
Pointers and One-dimensional Arrays, Null pointers, Pointers and Strings,
Pointers and two-dimensional arrays, Arrays of Pointers.

UNIT V STRUCTURES, UNIONS AND FUNCTIONS 9

Basics of Structures, Arrays of Structures, Pointers to Structures, Self-
referential Structures, Unions, Function Philosophy, Function Basics, Function
Prototypes, and Passing Parameters: Passing Parameter by value and Passing
Parameter by reference, passing string to function, Passing array to function,
Structures and Functions Recursion.
TOTAL : 45 PERIODS
REFERENCES:
1. Programming in ANSI C - Balagurusamy - Tata McGraw-Hill Education,
2008
2. Programming in C (3rd Edition), by Stephen G. Kochan, Sams, 2004
3. Programming in C - Stephen G. Kochan, III Edition, Pearson Education.

COURSE OUTCOMES :
Upon completion of this course, the students should be able to:
1. 1. Analyze their quantitative ability. (K4)
2. Understand the ability of arithmetic reasoning along with creative
thinking and problem solving skills. (K2)
3. Create their verbal ability through vocabulary building and grammar. (K6)
4. Evaluate the situations to analyze the computational methods in order to
identify and abstract the programming task involved. (K5)
5. Analyze tasks in which the numerical techniques are applicable in order to
apply them to write, edit, compile, debug, correct, recompile and run
programs. (K4)
6. Analyze and Design applications using Arrays, Strings,Pointers,Structures
and Unions. (K4)

75
 Syllabus CSE
CO- PO & PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 - - - - 3 2 - 3 2 3 - 2 - -

CO2 - - - - 3 2 - 3 2 3 - 2 - -

CO3 - - - - 3 2 - - 1 3 - 2 - -

CO4 - - - - 3 2 - 3 3 3 - 2 2 2

CO5 - - - - 3 2 - - 2 3 - 2 2 2

CO6 - - - - 3 2 - - 2 3 - 2 2 2

SEMESTER - III
20MGMC301 L T P C
CONSTITUTION OF INDIA
SDG NO. 4 2 0 0 0

OBJECTIVES:
At the end of the course, the student is expected to
l To know about Indian constitution
l To know about central government functionalities in India
l To know about state government functionalities in India
l To know about Constitution function
l To Know about Constitutional remedies

UNIT I INTRODUCTION 6
Historical Background – Constituent Assembly of India – Philosophical
foundations of the Indian Constitution – Preamble – Fundamental Rights –
Directive Principles of State Policy – Fundamental Duties

UNIT II STRUCTURE AND FUNCTION OF CENTRAL GOVERNMENT 6

Union Government – Structures of the Union Government and Functions –
President – Vice President – Prime Minister – Cabinet – Parliament – Supreme
Court of India.

76
 Syllabus CSE
UNIT III STRUCTURE AND FUNCTION OF STATE GOVERNMENT 6
State Government – Structure and Functions – Governor – Chief Minister –
Cabinet – State Legislature – Judicial System in States – High Courts and other
Subordinate Courts.

UNIT IV CONSTITUTION FUNCTIONS 6

Indian Federal System – Centre – State Relations – President's Rule –
Constitutional Amendments – Constitutional Functionaries.

UNIT V CONSTITUTIONAL REMEDIES 6

Enforcement of fundamental rights - Power of parliament to modify the rights
the conferred by this part in their application to forces.
TOTAL: 30 PERIODS

TEXT BOOKS:
1. Durga Das Basu, “Introduction to the Constitution of India “, Prentice Hall of
India, New Delhi.
2. R.C. Agarwal, (1997) “Indian Political System”, S. Chand and Company, New
Delhi.
3. M.V. Pyle (2019) , “An Introduction to The Constitution of India, 5/e”, Vikas
Publishing, New Delhi.
4 P.M. Bakshi, (2018) , “Constitution of India”, Universal Law Publishing,
New Delhi.

REFERENCES:
1. Sharma, Brij Kishore, “Introduction to the Constitution of India”, Prentice
Hall of India, New Delhi.
2. U.R.Gahai, “Indian Political System”, New Academic Publishing House,
Jalandhar.

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand about Constitution & Fundamental rights of citizens. (K2)
2. Interpret the structure and hierarchy of Central and State Government.
(K2)
3. Analyze the functions of Judiciary, Parliament and its constituent
members. (K4)
4. Evaluate the functions and boundaries of Central and State Governments
in respect of their powers, duties and Centre-State relationship. (K5)
5. Remember the Indian social structure in respect of caste, religion,

77
 Syllabus CSE
language, rights to citizens particularly rights to women, children and
weaker sections. (K1)
6. Analyze remedies and rights available to India Citizens. (K4)

CO – PO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 - - - - - 1 - - - - - -

CO2 - - - - 1 - - - - - -

CO3 - - - - - 1 - - - - - -

CO4 - - - - - 1 - - - - - -

CO5 - - - - - 2 - 3 - - - -

CO6 - - - - - 2 - 2 - - - -

78
 Syllabus CSE
SEMESTER - IV
20BSMA402 L T P C
PROBABILITY AND QUEUEING THEORY
SDG NO. 4 3 1 0 4
OBJECTIVES:
l To impart necessary basic knowledge in Probability theory, Random
Processes and Queueing models which are invariably used in Computer
science courses

UNIT I PROBABILITY AND RANDOM VARIABLES 12

Probability – Axioms of probability – Conditional probability – Baye's theorem
- Discrete and Continuous random variables – Moments – Moment generating
functions – Binomial, Poisson, Geometric, Uniform, Exponential, Erlang and
Normal distributions.

UNIT II TWO-DIMENSIONAL RANDOM VARIABLES 12

Joint distributions – Marginal and Conditional distributions – Covariance –
Correlation and Linear Regression – Transformation of Random Variables –
Central Limit Theorem (for independent and identically distributed random
variables).

UNIT III RANDOM PROCESSES 12

Classi ication – Stationary process – Markov process - Poisson process –
Discrete parameter Markov chain – Chapman Kolmogorov equations –
Limiting distributions.

UNIT IV QUEUEING MODELS 12

Markovian queues – Birth and Death processes – Single and multiple server
Queueing models – Little's formula - Queues with inite waiting rooms –Self-
service model.

UNIT V ADVANCED QUEUEING MODELS 12

Finite source models - M/G/1 queue – Pollaczek-Khinchin formula - M/D/1
and M/EK/1 as special cases – Series queues – Open Jackson networks.
TOTAL: 60 PERIODS
TEXT BOOKS:
1 Ibe, O.C., “Fundamentals of Applied Probability and Random Processes",
Elsevier, 1st Indian Reprint, 2007. (1.1-1.3, 1.6, 1.7 - 1.7.1, 1.8, 1.13 -
Exercise problems in the above sections ; 2.1 – 2.8, 3.1 – 3.5, 3.9 , 4.1 - 4.3,
4.4 - 4.4.2, 4.7 – 4.11, 5.1 - 5.7, 6.1 – 6.3, 6.8, 6.10, 8.1 - 8.5, 10.5 (10.5.1 -
10.5.6), 10.6, 10.7 – 10.7.1-10.7. 5) (Units I, II & III).
79
 Syllabus CSE
2. Gross, D., Shortle, J.F, Thompson, J.M and Harris. C.M., “Fundamentals of
Queueing Theory", Wiley Student 4th Edition, 2014. (1.1 – 1.5, 1.7, 2.1 -
2.7, 4.1, 4.2, 5.1 – 5.1.1) (Units IV and V)

REFERENCES:
1. Hwei Hsu, “Schaum's Outline Theory and Problems of Probability,
Random variables and Random Processes”, Tata Mcgraw Hill Edition,
New Delhi, 2004.
2. Taha, H.A., “ Operations Research”, 9th Edition , Pearson India Education
Services, Delhi,2016.
3. Trivedi, K.S., “Probability and Statistics with Reliability, Queueing and
Computer Science Applications”, 2nd Edition, John Wiley and Sons, 2002.
4. Yates, R.D. and Goodman. D.J., “Probability and Stochastic Processes”, 2nd
Edition, Wiley India Pvt. Ltd., Bangalore, 2012.
5. Veerarajan T., “Probability and Statistics, Random Processes and
Queueing Theory”, TataMc-Graw Hill Education Pvt. Ltd., New Delhi

WEB REFERENCES:
1. https://nptel.ac.in/courses/117103017/
2. https://nptel.ac.in/courses/111105041/
3. http://home.iitk.ac.in/~skb/ee679/ee679.html

ONLINE RESOURCES:
1. https://freevideolectures.com/course/3066/performance-evaluation-
of-computer-systems/5
2. https://freevideolectures.com/course/3066/performance-evaluation-
of-computer-systems/6
OUTCOMES:
Upon completion of the course, the student should be able to
1. Compute the probability, conditional probability and statistical averages
of events and standard distributions. (K3)
2. Compute the probability and statistical averages of one dimensional and
two dimensional random variables and use transformation of random
variables to ind the joint and marginal probability density functions.
(K3)
3. Use the Central limit theorem to ind probabilities of the sum of
independent and identically distributed random variables and calculate
the limiting state probabilities of discrete parameter Markov chains. (K3)
4. Classify and describe random processes. (K2)
5. Analyze various types of Markovian queuing models and evaluate its
characteristics. (K4)
80
 Syllabus CSE
6. Analyze advanced queuing models and study their characteristics. (K4)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 3 2 - - - - - - - - 1

CO2 3 3 2 - - - - - - - - 1

CO3 3 3 2 - - - - - - - - 1

CO4 3 3 2 - - - - - - - - 1

CO5 3 3 2 - - - - - - - - 1

CO6 3 3 2 - - - - - - - - 1

SEMESTER - IV
20CSPW401 COMPUTER NETWORKS L T P C
SDG NO. 4 & 9 WITH LABORATORY 3 0 2 4

OBJECTIVES:
l To understand the protocol layering and physical level communication
l To understand the various components required to build different
networks and analyze the performance of a network
l To learn the functions of network layer and the various routing protocols
l To familiarize the functions and protocols of the Transport layer

UNIT I INTRODUCTION AND PHYSICAL LAYER 9

Networks – Types – Protocol Layering – TCP/IP Protocol suite – OSI Model –
Physical Layer: Performance – Transmission media – Switching – Circuit-
switched Networks – Packet Switching.

UNIT II DATA LINK LAYER & MEDIA ACCESS 9

Introduction – Data Link Layer - Addressing – DLC Services – Data-Link Layer
Protocols – HDLC – PPP - Media Access Control - Wired LANs: Ethernet -
Wireless LANs – Introduction – IEEE 802.11, Bluetooth – Connecting Devices.

UNIT III NETWORK LAYER 9

Network Layer Services – Packet switching – Performance – IPV4 Addresses –
Forwarding of IP Packets - Network Layer Protocols: IP, ICMP v4 – Unicast
81
 Syllabus CSE
Routing Algorithms – Protocols – Multicasting Basics – IPV6 Addressing – IPV6
Protocol.

UNIT IV TRANSPORT LAYER 9

Introduction – Transport Layer Protocols – Services – Port Numbers – User
Datagram protocol – Transmission Control Protocol – SCTP.

UNIT V APPLICATION LAYER 9

WWW and HTTP – FTP – Email –Telnet –SSH – DNS – SNMP.

LIST OF EXPERIMENTS : 15
1. Simple client server program.
2. Socket program for echo/ping commands.
3. Implementing Link state routing algorithm.
4. Implementing distance vector routing algorithm.
5. Study of Network Simulator (NS2 or NS3 ) and Simulation of Congestion
Control Algorithms using NS.
6. Study of TCP/UDP performance using Simulation tool.
7. Simulation of error correction code (like CRC).
8. Traf ic Analysis using Wireshark.
TOTAL: 60 PERIODS

LAB REQUIREMENTS:
1. C/C++/JAVA/Equivalent compiler
2. Network Simulator like NS2/OPNET/Wireshark

TEXT BOOKS:
1. Behrouz A. Forouzan, “Data communications and networking with TCP/IP
protocol suite", Sixth Edition, McGraw Hill, cop. 2022.
2. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems
Approach”, Fifth Edition, Morgan Kaufmann Publishers Inc., 2012.

REFERENCES:
1. William Stallings, “Data and Computer Communications”, Tenth Edition,
Pearson Education, 2014.
2. Nader F. Mir, "Computer and Communication Networks", Second Edition
Prentice Hall, 2014.
3. Ying-Dar Lin, Ren-Hung Hwang and Fred Baker, “Computer Networks: An
Open Source Approach”, McGraw Hill Publisher, 2011.

82
 Syllabus CSE
4. James F. Kurose, Keith W. Ross, Computer Networking, A Top-Down
Approach Featuring the Internet, Sixth Edition, Pearson Education, 2013.
5. Andrew S. Tanenbaum, David J. Wetherall,"Computer Networks ", 5th
edition, Pearson Education,2011

WEB REFERENCES:
1. https://swayam.gov.in/nd2_cec19_cs07/preview
2. https://nptel.ac.in/courses/106105081/
3. https://www.isi.edu/nsnam/ns/

ONLINE RESOURCES:
1. https://ptgmedia.pearsoncmg.com/images/9780789749048/
samplepages/0789749041.pdf
2. https://www.cse.iitb.ac.in/~sri/cs348/cs378-lab00-overview.pdf
3. https://freevideolectures.com/course/2276/computer-networks
4. h t t p s : / / w w w. y o u t u b e . c o m / w a t c h ? v = g 8 i Y 3 6 o n L e M & l i s t =
PLWPirh4EWFpHJrW1D9UB24wsbM3zx7QMx

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand the basic layers and its functions in computer networks. (K2)
2. Demonstrate the performance of a network. (K2)
3. Explain the basics of how data lows from one node to another. (K2)
4. Understand IEEE standards, analyze and design routing algorithms. (K2)
5. Describe the working of various transport and application layer
protocols.(K2)
6. Apply the protocols for various functions in the network.(K3)

CO-PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 1 3 2 2 - 2 1 - 1 3 2

CO2 3 3 2 - - - 1 - - - - - 2 1

CO3 3 3 3 - 1 - 1 - - 1 - 1 3 1

CO4 3 3 3 - - - 1 - - 1 - - 2 2

CO5 3 3 3 - 1 - 2 - - 1 - 1 3 2

CO6 3 3 3 - 1 - 1 - - 1 - - 3 2
83
 Syllabus CSE
SEMESTER - IV
20CSPC401 L T P C
OPERATING SYSTEMS
SDG NO. 4&9 3 0 0 3
OBJECTIVES:
l To understand the basic concepts, functions of Operating Systems,
Processes and Threads
l To analyze Scheduling algorithm and understand the concept of Deadlock
l To analyse various Memory Management schemes and understand I/O
management and File Systems
l To be familiar with the basics of Linux system and Mobile OS like iOS and
Android

UNIT I OPERATING SYSTEM OVERVIEW 7

Computer System Overview-Basic Elements - Instruction Execution -
Interrupts - Memory Hierarchy - Cache Memory - Direct Memory Access -
Multiprocessor and Multicore Organization - Operating System Overview-
Objectives and Functions - Evolution of Operating System - Computer System
Organization Operating System Structure and Operations - System Calls -
System Programs - OS Generation and System Boot.

UNIT II PROCESS MANAGEMENT 11

Processes - Process Concept - Process Scheduling - Operations on Processes -
Inter-process Communication - CPU Scheduling - Scheduling Criteria -
Scheduling Algorithms- Multiple - Processor Scheduling - Real Time
Scheduling - Threads - Overview - Multithreading Models - Threading Issues -
Process Synchronization - The Critical - Section Problem - Synchronization
Hardware - Mutex Locks - Semaphores - Classic Problems of Synchronization -
Critical Regions - Monitors - Deadlock – System Model - Deadlock
Characterization - Methods for Handling Deadlocks - Deadlock Prevention -
Deadlock Avoidance - Deadlock Detection - Recovery from Deadlock.

UNIT III STORAGE MANAGEMENT 9

Main Memory – Background, Swapping, Contiguous Memory Allocation -
Paging - Segmentation - Segmentation with Paging - 32 and 64 Bit Architecture
Examples - Virtual Memory – Background - Demand Paging - Page
Replacement - Allocation - Thrashing - Allocating Kernel Memory - OS
Examples.

84
 Syllabus CSE

UNIT IV FILE SYSTEMS AND I/O SYSTEMS 9

Mass Storage System – Overview of Mass Storage Structure - Disk Structure -
Disk Scheduling and Management - Swap Space Management - File-System
Interface - File Concept - Access Methods - Directory Structure - Directory
Organization - File System Mounting - File Sharing and Protection - File System
Implementation- File System Structure - Directory Implementation -
Allocation Methods - Free Space Management - Ef iciency and Performance -
Recovery - I/O Systems – I/O Hardware - Application I/O Interface - Kernel I/O
Subsystem - Streams - Performance.

UNIT V CASE STUDY 9

Linux System - Design Principles - Kernel Modules - Process Management -
Scheduling - Memory Management - Input-Output Management - File System -
Inter-Process Communication - Mobile OS - iOS and Android - Architecture and
SDK Framework - Media Layer - Services Layer - Core OS Layer - File System.
TOTAL : 45 PERIODS
TEXT BOOK :
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating
System Concepts”, 9th Edition, John Wiley and Sons Inc., 2012.
2 William Stallings, “Operating Systems – Internals and Design
Principles”,7th Edition, Prentice Hall, 2011

REFERENCES :
1. Ramez Elmasri, A. Gil Carrick, David Levine, “Operating Systems – A
Spiral Approach”, Tata McGraw Hill Edition, 2010.
2. AchyutS.Godbole, Atul Kahate, “Operating Systems”, McGraw Hill
Education, 2016.
3. Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition,
Pearson Education, 2004.
4. Gary Nutt, “Operating Systems”, Third Edition, Pearson Education, 2004.
5. Harvey M. Deitel, “Operating Systems”, Third Edition, Pearson
Education, 2004.

WEB REFERENCES :
1. https://nptel.ac.in/courses/106/106/106106144/
2. https://www.coursera.org/courses?query=operating%20system
3. https://www.computerhope.com/jargon/o/os.html
4. https://www.os-book.com/OS9/slide-dir/
5. http://web.iitd.ac.in/~minati/MTL458.html

85
 Syllabus CSE
ONLINE RESOURCES:
1. https://www.udacity.com/course/introduction-to-operating-systems-
-ud923
2. https://freevideolectures.com/course/3670/introduction-to-
operating-systems

OUTCOMES:
Upon the completion of the course, the students should be able to
1. Understand the basic concepts and functions of the operating system.
(K2)
2. Analyze various scheduling algorithms. (K4)
3. Understand deadlock, prevention and avoidance algorithms. (K2)
4. Compare and contrast various memory management schemes. (K4)
5. Understand the functionality of ile systems (K2)
6. Understand the performance of administrative tasks on Linux servers.
(K2)

CO-PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 1 - 1 - 1 1 - - - 1 2 2

CO2 3 3 3 2 2 - 1 1 - - - 1 2 2

CO3 3 3 2 2 2 - 1 1 - - - 1 2 2

CO4 2 2 3 2 2 - 1 1 - - - 1 2 2

CO5 3 3 3 2 2 - 1 1 - - - 1 2 2

CO6 3 3 2 2 2 - 1 1 - - - 1 2 2

86
 Syllabus CSE
SEMESTER - IV
20CSPC402 L T P C
DATABASE MANAGEMENT SYSTEMS
SDG NO. 4&9 3 0 0 3
OBJECTIVES:
l To design a database using ER diagrams, convert them to Relational
Databases and to write SQL Queries
l To understand the fundamental concepts of Transaction Processing,
Concurrency Control techniques and Recovery procedures
l To understand the Internal Storage structures and about the Query
Processing Techniques
l To have an introductory knowledge about the Object Databases, XML
Databases and NoSQL Databases

UNIT I DATABASE DESIGN 7

Purpose of Database System – Views of Data –Database System Architecture-
Data Models– Entity Relationship Model – ER Diagrams – Enhanced ER Model.

UNIT II RELATIONAL DATABASES 11

Introduction to Relational Databases – Relational Model-ER-to-Relational
Mapping– Keys –Relational Algebra – SQL Fundamentals – Advanced SQL
features – Embedded SQL– Dynamic SQL-Functional Dependencies – Non-loss
Decomposition – First – Second - Third Normal Forms - Dependency
Preservation – Boyce/CoddNormal Form – Multi Valued Dependencies and
Fourth Normal Form – Join Dependencies and Fifth Normal Form.

UNIT III TRANSACTIONS 9

Transaction Concepts – ACID Properties – Schedules – Serializability –
Concurrency Control – Need for Concurrency – Locking Protocols – Two Phase
Locking – Deadlock – Transaction Recovery – Save Points – Isolation Levels –
SQL Facilities for Concurrency and Recovery.

UNIT IV IMPLEMENTATION TECHNIQUES 9

RAID – File Organization – Organization of Records in Files – Indexing and
Hashing –Ordered Indices – B+ Tree Index Files – B Tree Index Files – Static
Hashing – Dynamic Hashing – Query Processing Overview – Algorithms for
SELECT and JOIN operations – Query optimization using Heuristics - Cost
Estimation.

UNIT V ADVANCED TOPICS 9

Distributed Databases – Architecture - Data Storage - Transaction Processing –
87
 SyllabusCSE
Object Based Databases - Object Database Concepts – Object Relational
Features - ODMG Object Model – ODL - OQL – XML Databases - XML
Hierarchical Model – DTD - XML Schema –Xquery.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, “Database System
Concepts”, Seventh Edition, Tata McGraw Hill, 2020.
2. RamezElmasri, Shamkant B. Navathe, “Fundamentals of Database
Systems”, Seventh Edition, Pearson Education, 2016.

REFERENCES:
1. C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database
Systems”, Eighth Edition, Pearson Education, 2006.
2. Raghu Ramakrishnan, “Database Management Systems”, Fourth Edition,
McGraw-Hill Education, 2015.
3. G.K.Gupta,”Database Management Systems”, Tata McGraw Hill, 2011.

WEB REFERENCES:
1. https://swayam.gov.in/nd1_noc19_cs46/
2. http://www.nptelvideos.in/2012/11/database-management-
system.html
3. https://www.classcentral.com/course/swayam-database-management-
system-9914
4. http://learnsql.com
5. https://www.w3schools.com/sql/default.asp
6. https://www.khanacademy.org/computing/computer-programming/
sql

OUTCOMES:
Upon completion of the course, the student should be able to
1. Discuss the concepts of database to apply the Relational, ER model for
design and SQL for implementation of the database. (K2)
2. Recognize and identify the use of normalization and functional
dependencies to reine the database system. (K1)
3. Demonstrate various SQL queries for the Transaction Processing &
Locking using concept of Concurrency control. (K2)
4. Build the query processing techniques for the optimization of SQL queries.
(K3)
5. Implement the indexing and hashing techniques for the organisation of
database records. (K3)

88
 Syllabus CSE
6. Illustrate how the advanced databases differ from the traditional
databases. (K2)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 1 1 1 2 1 0 0 0 0 0 0 2 2

CO2 2 2 2 2 1 1 0 0 0 0 0 0 2 2

CO3 2 1 2 1 2 1 0 0 0 0 0 0 2 2

CO4 2 2 2 2 1 1 0 0 0 0 0 0 2 2

CO5 2 2 2 2 1 1 0 0 0 0 0 0 2 2

CO6 2 2 2 1 2 1 0 0 0 0 0 0 2 2

SEMESTER - IV
20CSPC403 OBJECT ORIENTED SOFTWARE L T P C
SDG NO. 4 ENGINEERING 3 0 0 3

OBJECTIVES:
l To address the real time complex Engineering problems using innovative
approaches with strong core computing skills
l To apply Core-analytical knowledge and appropriate techniques and
provide solutions to real time challenges of National and Global society
l To understand the concepts of OOAD and Design projects using UML
diagrams
l To improve the Software Design with Design Patterns

UNIT I SOFTWARE PROCESS AND AGILE DEVELOPMENT 9

Introduction to Software Engineering - Software Process - Perspective and
Specialized Process Models - Introduction to Agility-Agile process-Extreme
Programming-XP Process.

UNIT II REQUIREMENTS ANALYSIS AND SOFTWARE DESIGN 9

Software Requirements: Functional And Non-Functional - User
Requirement - System Requirements - Software Requirements Document –
Requirement Engineering Process - Feasibility Studies - Requirements
Elicitation and Analysis -Requirements Validation - Requirements

89
 Syllabus CSE
Management - Design Process – Design Concepts - Design Model – Design
Heuristic – Architectural Design -Architectural Styles - Architectural Design -
Architectural Mapping using Data Flow.

UNIT III STATIC AND DYNAMIC UML DIAGRAMS 9

Introduction To OOAD with OO Basics-Uni ied Process-Usecase – Case Study-
The Next Gen Pos System, Inception –Use Case Modeling - Relating Use Cases-
Include, Extend And Generalization-Class Diagram-Elaboration-Domain
Model-Finding Conceptual Classes And Description Classes-Associations-
Attributes-Aggregation And Composition-Dynamic Diagrams-UML
Interaction Diagrams-System Sequence Diagram-Collaboration Diagram-
State Machine Diagram And Modeling-Activity Diagram.

UNIT IV IMPLEMENTATION UML DIAGRAMS AND DESIGN PATTERNS 9

Implementation Diagrams-Package Diagram-Component and Deployment
Diagrams - GRASP: Designing Objects with Responsibilities - Creator -
Information Expert - Low Coupling-High Cohesion-Controller Design Patterns
- Creational - Factory Method - Structural - Bridge - Adapter - Behavioral-
Strategy-Observer-Applying GoF Design Patterns-Mapping Design to Code.

UNIT V TESTING AND MAINTENANCE 9

Software Testing Fundamentals-Internal And External Views of Testing-White
Box Testing – Basis Path Testing - Control Structure Testing - Black Box
Testing- Regression Testing – Unit Testing – Integration Testing – Validation
Testing – System Testing and Debugging –Software Implementation
Techniques: Coding Practices - Refactoring - Maintenance and Reengineering-
BPR Model - Reengineering Process Model - Reverse and Forward
Engineering.
TOTAL: 45 PERIODS

TEXT BOOKS:
1. Roger S. Pressman, “Software Engineering – A Practitioner's Approach”,
Sixth Edition, McGraw Hill International Edition, 2005
2. Craig Larman, “Applying UML and Patterns: An Introduction to Object-
Oriented Analysis and Design and Iterative Development”, Third Edition,
Pearson Education, 2005.

REFERENCES:
1. Rajib Mall, “Fundamentals of Software Engineering”, Third Edition, PHI
Learning Private Limited, 2009.

90
 Syllabus CSE
2. Pankaj Jalote, “Software Engineering, A Precise Approach”, Wiley India,
2010.
3. Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides, “Design
patterns: Elements of Reusable Object-Oriented Software”, Addison-
Wesley, 1995.
4. Martin Fowler, “UML Distilled: A Brief Guide to the Standard Object
Modeling Language”, Third edition, Addison Wesley, 2003.
5. Ian Sommerville, “Software Engineering”, Seventh Edition, Pearson
Education Asia, 2007.
6. Ali Bahrami, “Object Oriented Systems Development”, McGraw Hill
International Edition, 1999.

WEB REFERENCES:
1. https://swayam.gov.in/nd1_noc19_cs69/preview
2. https://nptel.ac.in/noc/courses/noc19/SEM2/noc19-cs69
3. https://nptel.ac.in/courses/106/105/106105182/
4. https://en.wikipedia.org/wiki/Object-oriented_analysis_and_design
5. https://www.tutorialspoint.com/object_oriented_analysis_design/
ooad_object_oriented_analysis.htm

ONLINE RESOURCES:
1. http://www.vssut.ac.in/lecture_notes/lecture1428551142.pdf
2. https://freevideolectures.com/course/2318/software-engineering
3. https://courses.cs.washington.edu/courses/cse403/01au/lectures/
4. https://cosmolearning.org/courses/introduction-to-software-
engineering/video-lectures/
5. https://www.ece.rutgers.edu/~marsic/books/SE/instructor/slides/

OUTCOMES:
Upon completion of the course, the student should be able to
1. Identify the key activities in managing a software project and Compare
different process models.(K1)
2. Understand Concepts of requirements engineering and Analysis Modeling.
(K2)
3. Apply systematic procedure for software design and deployment. (K3)
4. Compare and contrast the various testing and maintenance. (K5)
5. Express software design with UML diagrams.(K2)
6. Convert UML based software design into pattern based design using
design patterns. (K3)

91
 Syllabus CSE

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 - 2 3 3 2 3 3 3 3 - - 3

CO2 3 2 - 2 3 3 2 2 3 3 3 - - 3

CO3 3 2 - 3 3 3 3 1 3 3 3 1 1 3

CO4 3 3 3 3 3 3 3 2 3 2 2 2 3 2

CO5 3 3 3 3 3 3 3 2 3 2 2 2 3 2

CO6 3 2 - 2 3 3 2 3 3 3 3 - - 3

SEMESTER - IV
20ITPC401 DESIGN AND ANALYSIS OF L T P C
SDG NO. 4 ALGORITHMS 2 1 0 3

OBJECTIVES:
l To understand and apply the algorithm analysis techniques
l To critically analyze the ef iciency of alternative algorithmic solutions for
the same problem
l To understand different algorithm design techniques
l To understand the limitations of Algorithmic power

UNIT I INTRODUCTION 10
Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving –
Important Problem Types – Fundamentals of the Analysis of Algorithmic
Ef iciency –Asymptotic Notations and their properties - Analysis Framework –
Empirical analysis - Mathematical analysis for Recursive and Non-recursive
algorithms – Visualization.

UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUER 9

Brute Force – Computing an – String Matching - Closest-Pair and Convex-Hull
Problems - Exhaustive Search - Travelling Salesman Problem - Knapsack
Problem - Assignment Problem.
Divide and Conquer Methodology – Binary Search – Merge sort – Quick sort –
Heap Sort - Multiplication of Large Integers – Closest-Pair and Convex - Hull
Problems.

92
 Syllabus CSE
UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUES 9
Dynamic programming – Principle of optimality - Coin Changing Problem -
Computing a Binomial Coef icient – Floyd's Algorithm – Multi Stage Graph -
Optimal Binary Search Trees – Knapsack Problem and Memory functions -
Greedy Technique – Container Loading Problem - Prim's Algorithm and
Kruskal's Algorithm – 0/1 Knapsack Problem - Optimal Merge pattern -
Huffman Trees.

UNIT IV ITERATIVE IMPROVEMENT 8

The Simplex Method - The Maximum-Flow Problem – Maximum Matching in
Bipartite Graphs - Stable Marriage problem.

UNIT V COPING WITH THE LIMITATIONS OF ALGORITHM POWER 9

Lower - Bound Arguments - P, NP, NP - Complete and NP-Hard Problems-
Backtracking – n-Queen Problem - Hamiltonian Circuit Problem – Subset Sum
Problem. Branch and Bound – LIFO Search and FIFO Search - Assignment
Problem – Knapsack Problem – Travelling Salesman Problem - Approximation
Algorithms for NP-Hard Problems – Travelling Salesman Problem – Knapsack
Problem.
TOTAL: 45 PERIODS

TEXT BOOKS:
1. AnanyLevitin, “Introduction to the Design and Analysis of
Algorithms”, Third Edition, Pearson Education, 2012.
2. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, “Computer
Algorithms/ C++”, Second Edition, Universities Press, 2007.

REFERENCES:
1. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford
Stein, “Introduction to Algorithms”, Third Edition, PHI Learning Private
Limited, 2012.
2. Alfred V.Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures
and Algorithms”, Pearson Education, Reprint 2006.
3. Harsh Bhasin, “Algorithms Design and Analysis”, Oxford university press,
2016.
4. S. Sridhar, “Design and Analysis of Algorithms”, Oxford university press,
2014.

93
 Syllabus CSE
WEB REFERENCES:
1. https://nptel.ac.in/courses/106101060
2. https://www.cse.iitm.ac.in/course_details.php?arg=OTI
3. https://swayam.gov.in/nd1_noc19_cs47/previ

ONLINE RESOURCES:
1. https://ocw.mit.edu/courses/electrical-engineering-and-computer-
science/6-046j-design-and-analysis-of-algorithms-spring-2015/
2. http://www.learnalgorithms.in/
3. https://courses.cs.vt.edu/ csonline/Algorithms/Lessons/
4. http://openclassroom.stanford.edu/MainFolder/Course
Page.php?course=IntroToAlgorithms.

OUTCOMES:
Upon completion of the course, the student should be able to
1. Review the fundamentals of algorithmic problem solving and analyzing
ef iciency of algorithms [K2]
2. Apply mathematical formulation,complexity analysis and methodologies
to solve recurrence relations for algorithms [K3]
3. Compare the time complexities of various algorithms [K3]
4. Critically analyze the different algorithm design techniques for a given
problem [K3]
5. Illustrate NP class problems and formulate solutions using standard
approach [K2]
6. Articulate solutions for real life problems using algorithm design
principles [K3]

CO-PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 1 0 0 0 0 0 0 0 0 0 0 1

CO2 3 3 1 0 0 0 0 0 0 0 0 0 0 1

CO3 2 3 0 1 0 0 0 0 0 0 0 0 0 1

CO4 2 3 0 2 0 0 0 0 0 0 0 0 0 1

CO5 1 2 0 1 0 0 0 0 0 0 0 0 0 1

CO6 1 2 1 2 0 0 0 0 0 0 0 0 0 1

94
 Syllabus CSE
SEMESTER - IV
20CSPL401 L T P C
OPERATING SYSTEMS LABORATORY
SDG NO. 4 & 9 0 0 3 1.5
OBJECTIVES:
l To learn Unix commands and Shell programming
l To implement various CPU scheduling algorithm, Process Creation and
Interprocess Communication
l To implement Deadlock avoidance and Deadlock Detection algorithms
l To implement Page Replacement algorithms and File strategies

LIST OF EXPERIMENTS :
1. Basics of UNIX commands & Administrator commands (man, uptime,
users, service, pkill, pmap, wget, free, Shutdown commands, ping, su, who,
env).
2. Write programs using the following system calls of UNIX operating
system fork, exec, getpid, exit, wait, close, stat, opendir, readdir.
3. Write programs to simulate UNIX commands like cp, ls, grep, etc.
4. Shell Programming.
5. Write programs to implement the various CPU Scheduling Algorithms.
6. Implementation of Semaphores.
7. Implementation of Shared memory and IPC.
8. Implementation of Bankers Algorithm for Deadlock Avoidance.
9. Implementation of Deadlock Detection Algorithm.
10. Write program to implement Threading & Synchronization Applications.
11. Implementation of the following Memory Allocation Methods for ixed
partition
a) First Fit b) Worst Fit c) Best Fit
12. Implementation of Paging Technique of Memory Management.
13. Implementation of the following Page Replacement Algorithms
a) FIFO b) LRU c) LFU
14. Implementation of the various File Organization Techniques.
15. Implementation of the following File Allocation Strategies
a) Sequential b) Indexed c) Linked
TOTAL: 45 PERIODS

LAB REQUIREMENTS
1. Standalone desktops with C / C++ / Java / Equivalent compiler 30 Nos.
with Linux OS
95
 CSE Syllabus
OUTCOMES:
On completion of this laboratory course, the student should be able to
1. Compare the performance of various CPU Scheduling Algorithms (K4)
2. Implement Deadlock avoidance and Detection Algorithms (K2)
3. Implement Semaphores. Create processes and implement IPC (K2)
4. Analyze the performance of the various Page Replacement Algorithms
(K4)
5. Implement File Organization and File Allocation Strategies (K2)
6. Implement File Allocation Strategies (K2)

CO-PO,PSO MAPPING :
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 1 - 1 - - - - - - 1 2 2

CO2 3 3 3 2 1 1 1 2 2 2 1 2 2 2

CO3 3 3 3 3 1 2 1 2 2 2 2 2 2 2

CO4 3 3 3 2 1 - - 1 1 1 1 2 2 2

CO5 3 3 3 2 1 - - 1 1 1 1 1 2 2

CO6 3 3 2 2 1 - - 1 1 1 1 1 2 2

SEMESTER - IV
20CSPL402 DATABASE MANAGEMENT SYSTEMS L T P C
SDG NO. 4&9 LABORATORY 0 0 3 1.5
OBJECTIVES:
l To learn the use of Data De inition, Data Manipulation Commands, Nested
and Join queries
l To understand Functions, Procedures and Procedural extensions of
databases
l To be familiar with the use of a Front End tool
l To understand design and implementation of typical Database applications

LIST OF EXPERIMENTS :
1. Data De inition Commands, Data Manipulation Commands for inserting,
deleting, updating and retrieving Tables and Transaction Control
statements.
2. Database Querying – Simple queries, Nested queries, Sub queries and
Joins.
96
 Syllabus CSE
3. Implementation of Views, Sequences and Synonyms.
4. Database Programming: Implicit and Explicit Cursors.
5. Procedures and Functions.
6. Triggers.
7. Exception Handling.
8. Database Design using ER Modeling, Normalization and Implementation
for any application.
9. Database Connectivity with Front End Tools.
10. Case Study using Real Life Database applications.
TOTAL: 45 PERIODS

LAB REQUIREMENTS
SOFTWARE
Front end: VB/VC ++/JAVA or Equivalent
Back end: Oracle / SQL / MySQL/ Postgres / DB2 or Equivalent

OUTCOMES :
On completion of this laboratory course, the student should be able to
1. Use typical data de initions and manipulation commands. (K1)
2. Design applications to test Nested and Join Queries. (K3)
3. Implement simple applications that use Views. (K3)
4. Critically analyze the use of Tables, Views, Functions and Procedures. (K4)
5. Make use of ER modeling and normalization to design and implement
database. (K3)
6. Implement real life applications that require a Front-end Tool as a Team.
(K3)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 1 1 1 2 1 0 0 0 0 0 0 2 2

CO2 2 2 2 1 2 1 0 0 0 0 0 0 2 2

CO3 2 2 2 1 2 1 0 0 0 0 0 0 2 2

CO4 2 2 2 1 2 1 0 0 0 0 0 0 2 2

CO5 2 2 2 2 1 1 0 0 0 0 0 0 2 2

CO6 2 2 2 1 2 1 0 0 0 0 0 0 2 2

97
 Syllabus CSE
SEMESTER - IV
20CSTE401 L T P C
LIVE-IN-LAB - II
SDG NO. 4,11&15 0 0 2 1

OBJECTIVES:
l To provide opportunities for the students, expose to Industrial environment
and real time work
l To offer students a glimpse into real world problems and challenges that
need IT based solutions
l To improve the team building, communication and management skills of the
students
l To introduce students to the vast array of literature available of the various
research challenges in the ield of CSE

COURSE METHODOLOGY:
1. This initiative is designed to inculcate ethical principles of research and to
get involve in life-long learning process for the students.
2. The course must involve engineering design with realistic constraints. It
must also include appropriate elements of the following: Engineering
standards, design analysis, modeling, simulation, experimentation,
prototyping, fabrication, correlation of data, and software development.
3. Project can be individual work or a group project, with maximum of 3
students. In case of group project, the individual project report of each
student should specify the individual's contribution to the group project.
4. On completion of the project, the student shall submit a detailed project
report. The project should be reviewed and the report shall be evaluated
and the students shall appear for a viva-voce oral examination on the
project approved by the Coordinator and the project guide.

EVALUATION:
1. First evaluation (Immediately after irst internal examination ) : 20 marks
2. Second evaluation (Immediately after second internal examination):
30marks
3. Final evaluation (Last week of the semester) : 50marks

Note: All the three evaluations are mandatory for course completion and for
awarding the inal grade
TOTAL: 45 PERIODS

98
 Syllabus CSE
OUTCOMES:
Upon completion of the course, the students should be able to
1. Conduct literature survey to identify the gap and an application oriented
research problem in the speci ic domain(K4)
2. Design and validate the proposed system using simulation(K6)
3. Prototype the proposed system(K5)
4. Analyze the obtained results and prepare a technical report(K4)
5. Publish the work in journals and apply for the patents.(K3)
6. Prepare for industrial environment and real time work(K3)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 2 2 2 2 2 2 3 2 2 3 3 3

CO2 3 3 3 2 3 3 2 2 3 3 3 3 3 3

CO3 2 2 2 1 2 1 1 1 3 2 3 3 3 2

CO4 2 2 2 1 2 1 1 1 3 2 3 3 3 2

CO5 2 2 2 1 2 1 1 1 3 2 3 3 3 2

CO6 2 2 2 2 3 2 2 2 2 2 3 3 3 3

SEMESTER - IV
20CSTP401 L T P C
SKILL ENHANCEMENT
SDG NO. 4 0 0 2 1

APTITUDE AND COGNITIVE SKILLS – PHASE 1

OBJECTIVES:
l Improve their quantitative ability.
l Improve their reasoning ability.
l Enhance their verbal ability through vocabulary building and grammar
l Equip with creative thinking and problem solving skills

UNIT I QUANTITATIVE ABILITY – III 10

Compound Interest - Profit and Loss- Partnership - Percentage- Set Theory

99
 SyllabusCSE
UNIT II QUANTITATIVE ABILITY – IV 10
True Discount-Ratio and Proportion - Simplification - Problems On H.C.F
and L.C.M

UNIT III REASONING ABILITY – II 8

Course of Action - Cause and Effect - Statement and Conclusion - Statement
and Argument - Data Sufficiency (DS) - Statement and Assumption - Making
Assumptions.

UNIT IV VERBAL ABILITY – II 10

Change of Voice - Change of Speech - Letter and Symbol Series - Essential Part-
Verbal Reasoning - Analyzing Arguments.

UNIT V CREATIVITY ABILITY – II 7

Seating Arrangement - Direction Sense Test - Character Puzzles - Missing
Letters Puzzles - Mirror &Water Images.
TOTAL : 45 PERIODS
REFERENCES:
1. Quantitative Aptitude for Competitive Exams by R. S. Agarwal
2. Quantum CAT by Sarvesh Verma
3. A Modern Approach to Logical Reasoning by R. S. Agarwal
4. Verbal Ability and Reading Comprehension by Arun sharma

ADVANCED C PROGRAMMING - PHASE 2

COURSE OBJECTIVE:
l To improve C programming skills with understanding of code
organization and functional hierarchical decomposition with using
complex data types.
l To understand procedural programming methods using Dynamic
memory Allocation.

UNIT I INTRODUCTION TO RECURSION 9

Introduction to Recursion, Types of Recursion - Head Recursion , Tail
Recursion, Tree Recursion, Indirect Recursion and Nested Recursion .
Recursion vs Looping - Analysis on efficiency of looping and recursion,
Working of recursive code in main memory. Recurrence Relation , Different
types of recurrence relation. Deriving time complexity and space complexity
using recurrence relation.

100
 Syllabus CSE
UNIT II GROWTH FUNCTIONS AND RECURSION 9
Polynomial Equations, Compare growth functions - order growth functions,
omega growth functions, theta growth functions - Constant time, Linear time,
Logarithmic time, Quadratic time and exponential time. Problems on
Recursions - Factorial Number, Sum of first N Natural Numbers, Nth Fibonacci
Number, Exponent Function, Taylor Series, Tower of Hanoi.

UNIT III STORAGE CLASSES, THE PREPROCESSOR AND

DYNAMIC MEMORY ALLOCATION 9
Storage Classes and Visibility, Automatic or local variables, Global variables,
Static variables, External variables, File Inclusion, Macro Definition and
Substitution, Macros with Arguments, Nesting of Macros, Conditional
Compilation, Dynamic Memory Allocation, Allocating Memory with malloc,
Allocating Memory with calloc, Freeing Memory, Reallocating Memory Blocks,
Pointer Safety, The Concept of linked list, Inserting a node by using Recursive
Programs, Sorting and Reversing a Linked List, Deleting the Specified Node in
a Singly Linked List.

UNIT IV FILE MANAGEMENT 9

Defining and Opening a file, Closing Files, Input/output Operations on Files,
Predefined Streams, Error Handling during I/O Operations, Random Access to
Files, Command Line Arguments.

UNIT V BIT MANIPULATION 9

The hexadecimal number system, C bitwise operators, Working with
individual bits, How to check if a given number is a power of 2, Count the
number of ones in the binary representation of the given number, Check if the
ith bit is set in the binary form of the given number, How to generate all the
possible subsets of a set, Find the largest power of 2 (most significant bit in
binary form), which is less than or equal to the given number N, Tricks with
Bits, Applications of bit operations.
TOTAL : 45 PERIODS
REFERENCES:
1. R. G. Dromey, "How to Solve It By Computer", Pearson, 1982
2. A.R. Bradley, "Programming for Engineers", Springer, 2011
3. Kernighan and Ritchie, "The C Programming Language", (2nd ed.) Prentice
Hall, 1988

101
 CSE Syllabus
COURSE OUTCOMES :
Upon completion of this course, the students should be able to:
1. Analyze their quantitative ability. (K4)
2. Understand the ability of arithmetic reasoning along with creative
thinking and problem solving skills. (K2)
3. Create their verbal ability through vocabulary building and grammar. (K6)
4. Evaluate code organization and functional hierarchical decomposition
with complex data types. (K5)
5. Understand C programming skills to apply advanced structured and
procedural programming. (K2)
6. Apply Various File and Bit Manipulation algorithms in Problem Solving.
(K3)

CO- PO & PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 - - - - 3 2 - 3 2 3 - 2 - -

CO2 - - - - 3 2 - 3 2 3 - 2 - -

CO3 - - - - 3 2 - - 1 3 - 2 - -

CO4 - - - - 3 2 - 3 3 3 - 2 2 2

CO5 - - - - 3 2 - - 2 3 - 2 2 2

CO6 - - - - 3 2 - - 2 3 - 2 2 2

102
 Syllabus CSE
SEMESTER - V
20CSPC501 L T P C
INTERNET PROGRAMMING
SDG NO. 4 & 9 3 0 0 3
OBJECTIVES:
l Understand different Internet Technologies
l Be exposed to Java speci ic Web services architecture
l Create Dynamic Web Pages using different Scripting
l Build tools that assist in automating data transfer over the Internet.

UNIT I WEBSITE BASICS, HTML 5, CSS 3, WEB 2.0 9

Web Essentials: Clients, Servers And Communication –World Wide Web –
HTML5 – Tables – Lists – Image – HTML5 Control Elements – Semantic
Elements – Drag And Drop – Audio – Video Controls - CSS3 – Inline, Embedded
and External Style Sheets – Rule Cascading – Inheritance – Backgrounds –
Border Images – Colors – Shadows – Text – Transformations – Transitions –
Animations.

UNIT II CLIENT SIDE PROGRAMMING 9

Java Script: An Introduction to Javascript–Javascript DOM Model-Date and
Objects,- Regular Expressions- Exception Handling-Validation-Built-In
Objects-Event Handling- DHTML with Javascript- JSON Introduction – Syntax –
Function Files – HTTP Request – SQL.

UNIT III SERVER SIDE PROGRAMMING 9

Servlets: Java Servlet Architecture - Servlet Life Cycle- Form GET and POST
actions- Session Handling- Understanding Cookies- DATABASE
CONNECTIVITY: JDBC perspectives, JDBC program example - JSP:
Understanding Java Server Pages-JSP Standard Tag Library (JSTL)-Creating
HTML forms by embedding JSP code.

UNIT IV PHP 9
An introduction to PHP: PHP- Using PHP- Variables- Program control- Built-in
functions- Form Validation- Regular Expressions - File handling – Cookies -
Connecting to Database.

UNIT V XML and INTRODUCTION TO AJAX 9

XML: Basic XML- Document Type De inition- XML Schema DOM and
Presenting XML, XML Parsers and Validation, XSL and XSLT Transformation.

103
 Syllabus CSE
AJAX: Ajax Client Server Architecture-XML HTTP Request Object-Call Back
Methods.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Deitel and Deitel and Nieto, “Internet and World Wide Web- How to
Program”, Prentice Hall India Learning Pvt.Ltd, Fifth Edition, 2011.
2. Elliotte Rusty Harold, “Java Network Programming”, O’Reilly Publishers,
2013.

REFERENCES:
1. Stephen Wynkoop and John Burke, “ Running a Perfect Website”,
QUE, 2nd Edition, 1999.
2. Chris Bates, Web Programming – “Building Intranet Applications”, 3rd
Edition, Wiley Publications, 2009.
3. Jeffrey C and Jackson, ― “Web Technologies A Computer Science
Perspective”, Pearson Education, 2011.
4. Gopalan N.P. and Akilandeswari J., “Web Technology”, Prentice Hall of
India, 2011.
5. Uttam K.Roy, “Web Technologies”, Oxford University Press, 2011.

WEB REFERENCES:
1. https://www.brainkart.com/subject/Internet-Programming_173/
2. https://nptel.ac.in/courses/106105084/

ONLINE RESOURCES:
1. https://www.udemy.com/course/the-web-developer-bootcamp/
2. https://www.coursera.org/specializations/web-design

OUTCOMES:
Upon completion of the course, the student should be able to
1. Construct a basic website using HTML and Cascading Style Sheets.(K2)
2. Build dynamic web pages with validation using Javascript objects and by
applying different event handling mechanisms. (K3)
3. Develop server side programs using Servlets and JSP.(K2)
4. Construct simple web pages in PHP.(K3)
5. Represent web data using XML and develop dynamic web page using
AJAX.(K2)
6. Use web services to develop interactive web applications(K3)

104
 Syllabus CSE
CO- PO, PSO MAPPING:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 1 1 - 1 - - - - 1 - - 2 - 2

CO2 1 3 3 3 2 - - - 2 1 - 2 2 2

CO3 1 3 - 2 2 - - - 1 - - - 1 2

CO4 1 3 - - 2 - - - 1 2 - - - 2

CO5 1 1 - - 1 - - - 1 - - - 2

CO6 - 3 2 1 2 - - - 2 1 - - 1 2

SEMESTER - V
20CSPC502 L T P C
THEORY OF COMPUTATION
SDG NO. 4 2 1 0 3

OBJECTIVES:
l To construct Automata for any given pattern and ind its equivalent regular
expressions
l To design a context free grammar for any given language
l To understand Turing machines and their capability
l To understand undecidable problems and NP class problems

UNIT I AUTOMATA FUNDAMENTALS 9

Introduction to formal proof – Additional forms of Proof – Inductive Proofs
–Finite Automata –Deterministic Finite Automata – Non-deterministic Finite
Automata –Finite Automata with Epsilon Transitions

UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9

Regular Expressions–FA and Regular Expressions –Proving Languages not to
be regular –Closure Properties of Regular Languages –Equivalence and
Minimization of Automata.

UNIT III CONTEXT FREE GRAMMAR AND LANGUAGES 9

CFG –Parse Trees –Ambiguity in Grammars and Languages –De inition of the
Pushdown Automata –Languages of a Pushdown Automata –Equivalence of
Pushdown Automata and CFG, Deterministic Pushdown Automata.

105
 Syllabus CSE
UNIT IV PROPERTIES OF CONTEXT FREE LANGUAGES 9
Normal Forms for CFG –Pumping Lemma for CFL –Closure Properties of CFL
–Turing Machines –Programming Techniques for TM.
UNIT V UNDECIDABILITY 9
Non Recursive Enumerable (RE) Language – Undecidable Problem with RE –
Undecidable Problems about TM –Post's Correspondence Problem, The Class
P and NP.
TOTAL: 45 PERIODS
TEXT BOOK:
1. J.E.Hopcroft, R.Motwani and J.D Ullman, “Introduction to Automata
Theory, Languages and Computations”, Second Edition, Pearson
Education, 2011.
2. Peter Linz, “An Introduction to Formal Languages and Automata”, 5th
Edition, Jones & Bartlett Learning, 2011.

REFERENCES:
1. H.R.Lewis and C.H.Papadimitriou, "Elements of the theory of
Computation", Second Edition, PHI, 2010.
2. J.Martin, "Introduction to Languages and the Theory of Computation",
4th Edition, TMH, 2019.
3. Micheal Sipser, "Introduction of the Theory and Computation", 4th Edition
Thomson Brokecole, 2014.
4. K.L.P.Mishra , N.Chandrasekaran ,”Theory of Computer Science
(Automata, Languages and Computation)”, Third Edition,PHI,2008.
5. S.P.Eugene Xavier “Theory of Automata, Formal Languages and
Computation”, New Age International Publishers, 2007.

WEB REFERENCES:
1. https://nptel.ac.in/courses/106/104/106104148
2. https:// automation simulator.com/
3. https://swayam.gov.in/nd1_noc19_cs79/

ONLINE RESOURCES:
1. http://www.youtube.com/watch?v=eqCkkC9A0Q4
2. http://www.udemy.com/course/theory-of-computation-toc/
3. https://online.standford.edu/courses/soe-ycsautomata-automata-
theory
4. https://www.aduni.org/courses/theory/index.php?view=cw

106
 Syllabus CSE
OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand the models of computation, including formal languages,
Grammars and Automata, and their connections (K2)
2. Construct Automata, Regular Expression for any pattern (K3)
3. Develop Context Free Grammar for any given language and understand
the language of Push Down Automata (K3)
4. Construct Turing Machines for any Language, solve various problems by
applying normal form techniques (K3)
5. Identify Computation Solutions using Turing Machines (K2)
6. Identify whether a problem is decidable or not. (K2)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 2 2 1 2 - - - - - 1 2 2

CO2 3 3 3 2 1 2 - - - - 1 1 2 2

CO3 3 2 3 2 - 2 - - - - - 1 2 2

CO4 3 3 3 2 3 2 - - 2 - - 1 2 2

CO5 3 3 3 2 3 2 - - 2 2 1 1 2 2

CO6 3 3 3 2 3 2 - - 2 2 1 1 2 2

SEMESTER - V
20ESEC502 MICROPROCESORS AND L T P C
SDG NO. 4 MICROCONTROLLERS 3 0 0 3
OBJECTIVES:
l To learn the basics of 8086 Microprocessor and 8051 Microcontroller
l To understand and implement the 8086 family Assembly Language
Programming and basic 8051 programming
l To explore the I/O interfacing with 8086 and 8051
l To learn about advanced Microprocessors like Pentium and Intel Core i7
Processors

UNIT I INTRODUCTION TO MICROPROCESSOR 8

Introduction - Microprocessors and Microcontrollers - Evolution of
Microprocessors - Basic Functional Blocks of a Microprocessor - 8086
107
 Syllabus CSE
Architecture - Instruction and data low in 8086 - Even and Odd Memory Banks
- Addressing Modes.

UNIT II 8086 FAMILY ASSEMBLY LANGUAGE PROGRAMMING 8

Pin Diagram-Instruction Set-Assembler Directives- System Bus Timing - Bus
Cycles of 8086 - Timing Diagram.

UNIT III PROGRAMMING CONCEPTS 9

Password Validation - Reverse a String - Rotate a byte 3 places to the left -
Convert to uppercase letter - Modular Programming - Using the Keyboard and
Video Display - Data Conversions - Example Programs: Binary to ASCII - ASCII
to Binary.
UNIT IV I/O INTERFACE AND ADVANCED MICROPROCESSORS 10
Introduction to I/O Interfacing - Programmable Peripheral Interface - Intel
8253/8254 Programmable Timer/Counter - Programmable Keyboard/
Display Controller - Programmable Interrupt Controller - Intel 8237 DMA
Controller - Case Studies: Traf ic Light Control System - LED Display -
Architecture of Intel Pentium IV and Intel Core i7 Processors.

UNIT V ARCHITECTURE AND PROGRAMMING 8051 10

Introduction to the Intel 8051 Microcontroller - Architecture of 8051 - Special
Function Registers - Instruction set - Addressing modes - ALP - Programming -
8051 Timers - Serial Port Programming - Interrupt Programming - Stepper
Motor Control using 8051.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. A. NagoorKani, “Microprocessors and Microcontrollers”, McGrawHill
Education (India) Private Limited, 2013.
2. Yu-Cheng Liu, Glenn A.Gibson,,"Microcomputer Systems: The 8086 / 8088
Family - Architecture Programming and Design", Second Edition, Prentice
Hall of India, 2007.

REFERENCES:
1. N. Senthilkumar, M. Saravanan, S. Jeevananthan, "Microprocessors and
Microcontrollers", Oxford University Press, 2011.
2. A.K.Ray and K.M. Bhurchandi, “Advanced Microprocessor and Peripherals”,
Tata McGraw Hill, 3rd Edition, 2013.
3. Kenneth J Ayala, "The 8086 Microprocessor: Programming and Interfacing
the PC", Cengage Learning, Reprint 2014.

108
 Syllabus CSE

4. Kenneth J Ayala, "The 8051 Microcontroller", 3rd edition, Cengage

Learning, Reprint 2014.
5. Muhammed AliMazidi, Janice GillispleMaidi, Rolin.D. McKinlay, "The 8051
Microcontroller and Embedded Systems, Using Assembly and C", Second
edition, Pearson Prentice Hall, 2015.

ONLINE RESOURCES:
1. http://read.pudn.com/downloads165/ebook/754892/micro.pdf
2. http://www.openloop.com/education/classes/sjsu_engr/engr_comp
Org/spring2002/studentProjects/Truc_Tran/Eng120.htm
3. https://www.intel.com/content/dam/www/public/us/en/
documents/white-papers/ia-introduction-basics-paper.pdf
4. http://ecerelatedbooks.blogspot.com/2018/01/microprocessor-and-
microcontroller.html

OUTCOMES:
Upon completion of the course, the student should be able to
1. Describe the fundamental concepts of 8086 Microprocessors.(K2)
2. Understand the pin diagram, instruction set and assembler directives of
8086 Microprocessor. (K2)
3. Summarize the timing diagram of 8086.(K2)
4. Implement various Assembly Language Programming using 8086.(K3)
5. Interpret I/O interfaces using 8086 and advanced microprocessors.(K3)
6. Discuss the concepts of 8051 Microcontroller.(K2)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 1 - - - - - - - - - 1 1 2

CO2 2 1 - - - - - - - - - 1 1 2

CO3 2 1 - - - - - - - - - 1 1 2

CO4 2 1 2 - - - - - - - - 1 1 2

CO5 2 1 2 - - - - - - - - 1 1 2

CO6 2 1 2 - - - - - - - - 1 1 2

109
 Syllabus CSE
SEMESTER - V
20CSPC503 L T P C
MOBILE COMPUTING
SDG NO. 4 & 9 3 0 0 3

OBJECTIVES:
l To understand the basic concepts of Mobile Computing
l To learn the basics of Mobile Telecommunication System
l To be familiar with the Network layer protocols and Ad-Hoc networks
l To know the basis of Transport and Application layer protocols

UNIT I INTRODUCTION 9
Introduction to Mobile Computing – Applications of Mobile Computing-
Generations of Mobile Communication Technologies- Multiplexing – Spread
spectrum - MAC Protocols – Wireless MAC Issues– SDMA– TDMA– FDMA–
CDMA.

UNIT II MOBILE TELECOMMUNICATION SYSTEM 9

Global System for Mobile Communication (GSM) – General Packet Radio
Service (GPRS) –Universal Mobile Telecommunication System (UMTS), Long
Term Evolution (LTE), 5G NR.

UNIT III MOBILE NETWORK LAYER 9

Mobile IP –Ad Hoc– Proactive Protocol-DSDV, Reactive Routing Protocols –
DSR, AODV, Hybrid routing –ZRP, Multicast Routing- ODMRP, Vehicular Ad Hoc
networks (VANET) – Security.

UNIT IV MOBILE TRANSPORT AND APPLICATION LAYER 9

Mobile TCP– Improvements in TCP–I TCP–S TCP–M TCP –WAP – Architecture –
WDP – WTLS – WTP –WSP – WAE – WML.

UNIT V MOBILE PLATFORMS AND APPLICATIONS 9

Mobile Device Operating Systems –Commercial Mobile Operating Systems –
Software Development Kit: iOS, Android, BlackBerry, Windows Phone –
MCommerce– Structure – Pros & Cons – Mobile Payment System – Security
Issues.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Jochen Schiller, “Mobile Communications”, Prentice Hall India, Second
Edition, 2009.

110
 Syllabus CSE
2. Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”,
Prentice Hall India Learning Pvt.Ltd, New Delhi, 2012.

REFERENCES:
1. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober,
“Principles of Mobile Computing”, Springer, 2003.
2. William.C.Y.Lee,“Mobile Cellular Tele communications-Analog and Digital
Systems”, Second Edition,TataMcGraw Hill Edition , 2006.
3. Michael Gregg, “Build Your Own Security Lab”, Wiley Publishing Inc., 2009.
4. Dharma Prakash Agarval, Qing and An Zeng, "Introduction to Wireless and
Mobile systems",Thomson Asia Pvt Ltd, 2005.
5. C.K.Toh, “AdHoc Mobile Wireless Networks”, First Edition, Pearson
Education, 2002.

WEB REFERENCES:
1. https://nptel.ac.in/courses/106/106/106106147/
2. https://www.cse.iitb.ac.in/~mythili/teaching/cs653_spring2014/
index.html
3. https://freevideolectures.com/course/4818/nptel- mobile-computing
4. https://alison.com/course/introduction-to-mobile-and-cloud-
computing

ONLINE RESOURCES:
1. https://youtu.be/zp3KtaICq2U
2. https://youtu.be/Bz0aw4_K8oc
3. https://youtu.be/ytLkrvyIf6g
4. Android Developers : http://developer.android.com/index.html
5. Apple Developer : https://developer.apple.com/
6. Windows Phone DevCenter : http://developer.windowsphone.com
7. BlackBerry Developer : http://developer.blackberry.com/

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand the basics of Wireless and Mobile Communications. (K2)
2. Summarize and select the access medium based on the applications. (K2)
3. Illustrate the architecture of Mobile Networks.(K3)
4. Apply Various Security mechanisms in the Transmission protocols.(K3)
5. Demonstrate Various Mobile Routing Protocols based on the applications
on different Mobile OS.(K3)

111
 Syllabus CSE
6. Determine the Fragmentation and Reassembling based on the
communicating device and the availability of the network bandwidth.(K3)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 - - - - - - - - - 3 2

CO2 3 3 3 - - - - - - - - - 3 2

CO3 3 3 3 1 1 - - - - - - 1 3 2

CO4 3 3 2 2 - - - - - - - - 3 2

CO5 3 3 3 1 - - - - - - - - 3 2

CO6 3 3 3 - 3 2 - 2 3 3 - 3 3 2

SEMESTER - V
20CSPL501 INTERNET PROGRAMMING L T P C
SDG NO. 4 & 9 LABORATORY 0 0 4 2

OBJECTIVES:
l Familiar with Web page design using HTML/XML and Style sheets
l Exposed to creation of User Interfaces using Java Frames and Applets
l Create Dynamic Web Pages using Server Side Scripting
l To understand PHP programming

LIST OF EXPERIMENTS:
1. Create a web page with the following using HTML
a. To embed a map in a web page
b. To ix the hot spots in that map
c. Show all the related information when the hot spots are clicked.
2. Create a web page with the following.
a. Cascading style sheets.
b. Embedded style sheets.
c. Inline style sheets. Use our college information for the web pages.
3. Validate the Registration, user login, user pro ile and payment by credit
card pages using JavaScript.
4. Write programs in Java using Servlets:
a. To invoke servlets from HTML forms

112
 Syllabus CSE
b. Session tracking using hidden form ields and Session tracking for a
hit count
5. Write programs in Java to create three-tier applications using servlets for
conducting on- line examination for displaying student mark list. Assume
that student information is available in a database which has been stored
in a database server.
6. Install TOMCAT web server. Convert the static web pages of programs into
dynamic web pages using servlets (or JSP) and cookies. Hint: Users
information (user id, password, credit card number) would be stored in
web.xml. Each user should have a separate Shopping Cart.
7. Redo the previous task using JSP by converting the static web pages into
dynamic web pages. Create a database with user information and books
information. The books catalogue should be dynamically loaded from the
database.
8. Create and save an XML document at the server, which contains 10 users
Information. Write a Program, which takes user Id as an input and returns
the User details by taking the user information from the XML document
9. a. Validate the form using PHP regular expression.
b. PHP stores a form data into database.
10. Write a web service for inding what people think by asking 500 people's
opinion for any consumer product.
TOTAL: 45 PERIODS
LAB REQUIREMENTS:
Dream Weaver or Equivalent, MySQL or Equivalent,
Apache Server, WAMP/XAMPP

OUTCOMES:
On completion of this laboratory course, the student should be able to
1. Construct Web pages using HTML/XML and style sheets.(K1)
2. Build dynamic web pages with validation using JavaScript objects and by
applying different event handling mechanisms.(K3)
3. Develop dynamic web pages using server side scripting.(K2)
4. Use PHP programming to develop web applications.(K3)
5. Construct web applications using AJAX and XML.(K2)
6. Develop web services in Java.(K3)

113
 Syllabus CSE
CO- PO, PSO MAPPING:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 2 3 2 - - - - 2 2 1 1

CO2 3 3 3 2 3 2 - - - - 2 2 2 2

CO3 3 3 3 3 3 3 - - - - 2 2 2 2

CO4 3 3 3 2 3 3 - - - - 2 2 2 3

CO5 3 3 3 2 3 3 - - - - 2 1 2 2

CO6 3 3 3 2 3 2 - - - - 2 2 1 1

SEMESTER - V
20ESPL501 MICROPROCESSORS AND L T P C
SDG NO. 4 MICROCONTROLLERS LABORATORY 0 0 3 1.5

OBJECTIVES:
l To write Assembly Language Programs for arithmetic and logical operations
using the 8086 instruction set
l To perform Data transfer and Matrix operations in 8086
l To interface various I/O devices with 8086
l To implement Arithmetic and Logical operations using the 8051 instruction
set
LIST OF EXPERIMENTS :
8086 programs
1. Basic arithmetic and Logical operations
2. Code conversion
3. Searching
4. Sorting
5. Data transfer operations
6. Matrix operations
7. Print RAM size and system date
8. Traf ic Light Control
9. Stepper motor control
10. Digital Clock
11. Keyboard and Display

114
 Syllabus CSE
8051 programs
1. Basic arithmetic and Logical operations
2. Find 2's complement of a number
3. Find Square and Cube of a number
TOTAL: 45 PERIODS
LAB REQUIREMENTS
HARDWARE
1. 8086 development kits - 30Nos
2. Interfacing Devices - 15 each
3. Microcontroller – 30 Nos

OUTCOMES :
On completion of this laboratory course, the student should be able to
1. Write various ALP programs for arithmetic and logical operations using
8086.(K3)
2. Demonstrate various ALP programs for data manipulation and matrix
operations using 8086.(K3)
3. Implement the interfacing of 8086 to control the devices.(K3)
4. Interpret the Interfacing of 8086 to display the output.(K3)
5. Write various ALP programs for arithmetic and logical operations using
8051.(K3)
6. Demonstrate various ALP programs for data manipulation in 8051.(K3)

CO-PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 1 - 1 - - - - - - - - 2 2

CO2 2 1 - 1 - - - - - - - - 2 2

CO3 2 1 - 1 - - - - - - - - 2 2

CO4 2 1 - 1 - - - - - - - - 2 2

CO5 2 1 - 1 - - - - - - - - 2 2

CO6 2 1 - 1 - - - - - - - - 2 2

115
 Syllabus CSE

SEMESTER - V
20CSTE501
LIVE-IN-LAB III L T P C
SDG NO. 4,11&15 0 0 4 2
OBJECTIVES:
l To provide opportunities for the students, expose to Industrial environment
and real time work
l To give access to NASSCOM research and intelligence that tracks industry
trends, growth opportunities and best practices, access to a repository of
industry presentations, blogs, discussions and articles
l To impart detailed knowledge of Computer Networks, various protocols
used in Communication, Managing and con iguring Cisco Switches and
Routers and various WAN technologies
l To automate repetitive and redundant tasks and eliminates the human
intervention using UiPath a Robotic Process Automation tool

COURSE METHODOLOGY:
1. This initiative is designed to inculcate ethical principles of research and to
get involve in life-long learning process for the students.
2. To engage students in CSE beyond their robust academic curriculum that
sparks curiosity and imagination while teaching critical knowledge and
skills.
3. This practice will engage beyond curriculum using industry-relevant
technologies that help students get ready for the next step in their
educations or careers. It helps the learners expand knowledge; develop
skills, and their innovativeness.
4. The initiative is designed to provide students with foundational
knowledge and skills in areas of CSE that are universally in high demand
across computing jobs
5. On completion of the course, the student shall be able to develop
applications and submit a detailed report for evaluation.

EVALUATION:
1. First evaluation (Immediately after irst internal examination ) : 20 marks
2. Second evaluation (Immediately after second internal examination):
30marks

116
3. Final evaluation (Last week of the semester) : 50marks
Note: All the three evaluations are mandatory for course completion and for
awarding the inal grade
TOTAL: 45 PERIODS
OUTCOMES:
Upon completion of the course, the students should be able to
1. Perform literature survey to identify the gap and an application oriented
research problem in the speci ic domain (K2)
2. Design and validate the proposed system using simulation (K3)
3. Implement the proposed system (K3)
4. Examine the obtained results and prepare a technical report (K4)
5. Publish the work in journals and apply for the patents.(K3)
6. Prepare for industrial environment and real time work (K3)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 2 2 2 2 2 2 3 2 2 3 3 3

CO2 3 3 3 2 3 3 2 2 3 3 3 3 3 3

CO3 2 2 2 1 2 1 1 1 3 2 3 3 3 2

CO4 2 2 2 1 2 1 1 1 3 2 3 3 3 2

CO5 2 2 2 1 2 1 1 1 3 2 3 3 3 2

CO6 2 2 2 2 3 2 2 2 2 2 3 3 3 3
 Syllabus CSE

SEMESTER - V
20CSTP501 L T P C
SKILL ENHANCEMENT
SDG NO. 4 0 0 2 1

ANALYTICAL & CRITICAL THINKING SKILLS – PHASE 1

OBJECTIVES:
l Enhance their quantitative ability.
l Enhance their reasoning ability
l Enhance their verbal ability.
l Equip with creative thinking and problem solving skills

UNIT I QUANTITATIVE ABILITY – V 10

Compound Interest - Profit and Loss- Partnership - Percentage- Set Theory

UNIT II QUANTITATIVE ABILITY – VI 10

Probability, Averages, Area, Odd Man Out, Crypt Arithmetic, Flowcharts

UNIT III REASONING ABILITY – III 8

Data Interpretation Table Charts, Data Interpretation Bar Charts, Blood
Relationship, Puzzles

UNIT IV VERBAL ABILITY – III 10

Spellings, Selecting Words, Spotting Errors, Ordering of Words, Logical
Sequence of Words

UNIT V CREATIVITY ABILITY – III 7

Logical Puzzles, Playing Cards Puzzles, Clock Puzzles, Number Puzzles,
Sudoku
TOTAL : 45 PERIODS
REFERENCES:
1. Quantitative Aptitude for Competitive Exams by R. S. Agarwal
2. Quantum CAT by Sarvesh Verma
3. A Modern Approach to Logical Reasoning by R. S. Agarwal
4. Verbal Ability and Reading Comprehension by Arun sharma

118
 Syllabus CSE
20CSTP501 PYTHON PROGRAMMING & R PROGRAMMING
– PHASE 2

COURSE OBJECTIVE:
l Gain strong knowledge of Python.
l Understand the concepts of R Programming
l Perform statistical computing and data visualizations

UNIT I INTRODUCTION, DATA TYPES AND STRINGS,

LIST & TUPLES 10
DataTypes - Integer , Float , Boolean , String , List , Tuple , Dictionary and Sets.
String - Concatenation and Replication, isalnum functions, Slicing Operation
sorted() , reversed(), min() , max() , index() and count() function, packing and
unpacking of data in a tuple

UNIT II DICTIONARY AND SETS HANDLING 10

Dictionary - del Keyword,. Sets - Frozen sets, Internal working of sets, add() ,
union() , intersection() and difference() method, symmetric_difference,
clear() method, Operators in sets, Higher Order Functions - map , filter , reduce
and lambda function, Random Library

UNIT III EXCEPTIONAL HANDLING, REGULAR EXPRESSIONS

AND OBJECT ORIENTED PROGRAMMING 10
Exception Handling - All Error Categories, try , except , finally blocks, Raising
an exception, Regular Expression, Object Oriented Programming - Types of
Inheritance, Data encapsulation and Abstraction, Polymorphism, Method
Overriding, Operator overloading, operator Overriding,

UNIT IV INTRODUCTION TO R PROGRAMMING 7

Introduction, How to run R, R Sessions, and Functions, Basic Math, Variables,
Data Types, Vectors, Conclusion, Advanced Data Structures, Data Frames,
Lists, Matrices, Arrays, Classes.

UNIT V BASICS OF R PROGRAMMING 8

R Programming Structures, Control Statements, Loops, Looping Over Non
Vector Sets, If-Else, Arithmetic and Boolean Operators and values, Default
Values for Argument, Return Values, Deciding Whether to explicitly call
return- Returning Complex Objects, Functions are Objective, No Pointers in R,
Recursion, A Quicksort Implementation-Extended Extended Example: A
Binary SearchTree.

119
 Syllabus CSE
REFERENCES:
1 Python-(Mark Lutz)
2 Python Training guide (BPB Publications)
3 Lander, “R for Everyone”, Pearson
4 The Art of R Programming, Norman Matloff, CengageLearning

COURSE OUTCOMES:
Upon completion of this course, the students will be able to:
1. Define the syntax and semantics of python programming language and
Understand control flow statements, strings and functions. (K1)
2. Determine the methods to create and manipulate python programs by
utilizing the data structures like lists, dictionaries, tuples and sets. (K3)
3. Annotate the concepts of functions, modules and packages in
python.(K2)
4. Understand the concepts of files, exception handling and also apply the
object oriented programming concept by creating classes and objects.
(K3)
5. Understand the basics of data science and R programming
fundamentals. (K2)
6. Apply R programming language concepts such as data types, vectors,
matrix arrays, structures, functions, and boolean operators by writing R
programs and through examples. (K3)

CO- PO & PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 - - - - 3 2 - 3 2 3 - 2 - -

CO2 - - - - 3 2 - 3 2 3 - 2 - -

CO3 - - - - 3 2 - - 1 3 - 2 - -

CO4 - - - - 3 2 - 3 3 3 - 2 2 2

CO5 - - - - 3 2 - - 2 3 - 2 2 2

CO6 - - - - 3 2 - - 2 3 - 2 2 2

120
 Syllabus CSE

SEMESTER - VI
20CSPC601 L T P C
ARTIFICIAL INTELLIGENCE
SDG NO. 4 & 9 3 0 0 3

OBJECTIVES:
l To understand the various characteristics of Intelligent agents
l To learn the different search strategies in AI
l To learn to represent knowledge in solving AI problems
l To understand the different ways of designing software agents and about
the various applications of AI

UNIT I INTRODUCTION 9
Introduction - De inition - Future of Arti icial Intelligence – Characteristics of
Intelligent Agents – Typical Intelligent Agents – Problem Solving Approach to
Typical AI Problems – Search Strategies - Uninformed - Heuristics - Informed.

UNIT II PROBLEM SOLVING METHODS 9

Local Search Algorithms and Optimization Problems - Searching with Partial
Observations – Constraint Satisfaction Problems – Constraint Propagation -
Backtracking Search - Game Playing – Optimal Decisions in Games – Alpha-
Beta Pruning - Stochastic Games.

UNIT III REPRESENTATION OF KNOWLEDGE 9

First Order Predicate Logic – Prolog Programming – Uni ication – Forward
Chaining - Backward Chaining – Resolution – Knowledge Representation -
Ontological Engineering - Categories and Objects - Events - Mental Events and
Mental Objects - Reasoning Systems for Categories - Reasoning with Default
Information.

UNIT IV PLANNING AND LEARNING 9

Planning – Planning with State Space Search- Partial Order Planning
Algorithm – Planning Graphs - Logical Formulation of Learning - Knowledge in
Learning - Explanation-based Learning - Learning using Relevance
Information.

UNIT V NATURAL LANGUAGE PROCESSING 9

Language models - Phrase Structure Grammars - Syntactic Analysis –
Augmented Grammars and Semantic Interpretation - Application with NLP:
Developing a Simple Chatbot - Types of Chatbot.
TOTAL: 45 PERIODS
121
 Syllabus CSE
TEXT BOOKS:
1 Stuart J Russell and Peter Norvig, "Arti icial Intelligence: A Modern
Approach”, Prentice Hall, Third Edition, 2009.
2 Elaine Rich, Kevin Knight, Shivashankar B. Nair, “Arti icial Intelligence”,
Tata McGraw-Hill Education, Third Edition, 2008.

REFERENCES:
1. M. Tim Jones, “Arti icial Intelligence: A Systems Approach(Computer
Science)”, Jones and Bartlett Publishers, Inc.; First Edition, 2008.
2. Nils J. Nilsson, “The Quest for Arti icial Intelligence”, Cambridge University
Press, 2009.
3. William F. Clocksin and Christopher S. Mellish, “Programming in Prolog:
Using the ISO Standard”, Springer, Fifth Edition, 2003.
4. George F Luger, “Arti icial Intelligence: Structures and Strategies for
Complex Problem Solving”, Pearson Education, New Delhi, Fifth Edition,
2017.
5. Steven Bird, Ewan Klein and Edward Loper, “Natural Language Processing
with Python”, O’Reilly, 2009, https://www.nltk.org/book/.
6. I. Bratko, “Prolog: Programming for Arti icial Intelligence”, Addison-
Wesley Educational Publishers Inc., Fourth Edition, 2011.

WEB REFERENCES:
1. https://books.google.co.in/books?id=uSvYmki2yg0C&printsec=
frontcover&dq=Supervised+Learning&hl=en&sa=X&ved=0ahUKE
wigkNa1xN3oAhWawjgGHe8hAzoQ6AEIKDAA#v=onepage&q=Sup
ervised% 20Learning&f=false

OUTCOMES:
Upon completion of the course, the students should be able to
1. Infer the agent characteristics and its problem solving approaches.(K2)
2. Select appropriate search algorithms for any AI problem.(K1)
3. Apply the principles of AI in game playing.(K3)
4. Construct and solve a problem using irst order and predicate logic.(K3)
5. Identify the methods of solving problems using planning and
learning.(K3)
6. Implement applications for Natural Language Processing that use
Arti icial Intelligence.(K3)

122
 Syllabus CSE

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 3 2 3 2 1 1 - 1 - - 1 2 3

CO2 2 3 2 3 2 1 1 - 1 - - 1 3 3

CO3 2 3 2 3 2 1 1 - 1 - - 1 3 2

CO4 2 3 2 3 2 1 1 - 1 - - 1 3 3

CO5 2 3 2 3 3 1 1 - 2 - - 1 2 2

CO6 2 3 2 3 3 1 1 - 2 - - 1 2 3

SEMESTER - VI
20CSPC602 L T P C
COMPILER DESIGN
SDG NO. 4 & 9 3 0 0 3
OBJECTIVES:
l To learn about the various phases of the Compiler
l To learn various Parsing techniques
l To understand Intermediate code generation & run time environment
l To analyze Code optimization techniques & Code generation algorithm

UNIT I INTRODUCTION TO COMPILERS 9

Translators-Compilation and Interpretation-Language processors – Analysis
of the source program – Phases of a compiler – Cousins of the Compiler –
Grouping of Phases – Compiler construction tools – Lexical Analysis – Role of
Lexical Analyzer – Input Buffering – Speci ication of Tokens– Recognition of
Tokens – LEX tool–Regular Expressions to Automata Direct method.

UNIT II SYNTAX ANALYSIS 12

Role of the parser –Writing a Grammar –Context-Free Grammars – Top Down
parsing – Recursive Descent Parsing – Predictive LL(1) Parsing – Bottom-up
parsing – Shift Reduce Parsing – Operator Precedence Parsing – LR Parsers –
SLR Parser – Introduction to LALR & CLR Parser - Error Handling and
Recovery in Syntax Analyzer-YACC.

UNIT III INTERMEDIATE CODE GENERATION 8

Intermediate languages – Declarations – Assignment Statements – Boolean
Expressions – Case Statements –BackPatching – Procedure calls. Type
123
 Syllabus CSE
Systems-Speci ication of a simple type checker- Equivalence of Type
Expressions-Type Conversions.

UNIT IV RUN-TIME ENVIRONMENT AND CODE GENERATION 8

Source Language Issues-Storage Organization-Storage Allocation-Parameter
Passing-Symbol Tables- Dynamic Storage Allocation. Issues in the design of
code generator – The target machine - Basic Blocks and Flow Graphs – Next-
use Information – A simple Code generator – DAG Representation of Basic
Blocks.

UNIT V CODE OPTIMIZATION 8

Principal Sources of Optimization – Peep-hole optimization - DAG-
Optimization of Basic Blocks- Global Data Flow Analysis - Ef icient Data Flow
Algorithm.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman, "Compilers:
Principles, Techniques and Tools", Second Edition, Pearson Education,
2009.
2. V. Raghavan, "Principles of Compiler Design", Tata McGraw Hill
Education Publishers, 2010.

REFERENCES:
1. Randy Allen, Ken Kennedy, “Optimizing Compilers for Modern
Architectures: A Dependence based Approach”, Morgan Kaufmann
Publishers, 2002.
2. Steven S. Muchnick, “Advanced Compiler Design and Implementation”,
Morgan Kaufmann Publishers - Elsevier Science, India, Indian Reprint
2003
3. Keith D Cooper and Linda Torczon, “Engineering a Compiler”, Morgan
Kaufmann Publishers Elsevier Science, 2004.
4. Allen I. Holub, “Compiler Design in C”, Prentice-Hall Software Series,
1993.
5. Charles N. Fischer, Richard. J. LeBlanc, “Crafting a Compiler with C”, 2008.

WEB REFERENCES:
1. http://www.holub.com/software/compiler.design.in.c.docs.pdf
2. http://www.cs.usfca.edu/~galles/compilerdesign/x86.pdf

124
 Syllabus CSE
ONLINE RESOURCES:
1. https://www.javatpoint.com/compiler-tutorial

OUTCOMES:
Upon completion of the course, the students should be able to:
1. Explain the role of each phase of a compiler with its construction
tools.(K2)
2. Illustrate the role of a Lexical Analyzer for recognizing the tokens of a
given language with the knowledge of symbol table management and
error-handling (K3)
3. Construct parsers like top-down, bottom-up for a given grammar (K3)
4. Develop semantic analyzers for type-checking and intermediate code
generators to translate the source program into an intermediate code (K3)
5. Outline Runtime environment and a simple Code Generator using the
code generation Algorithm (K2)
6. Implement code optimizers to optimize the target code generated (K3)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 - - - - - - - - - - - 2 2

CO2 3 2 - 1 2 - - - - - - 1 2 2

CO3 2 3 - 2 - - - - - - - 1 2 2

CO4 2 3 1 2 - - - - - - - 1 2 2

CO5 3 2 - - - - - - - - - 1 2 2

CO6 1 - 3 - 1 - - - - - - 1 2 2

SEMESTER - VI
20CSPC603 L T P C
CLOUD COMPUTING
SDG NO. 4 &9 3 0 0 3

OBJECTIVES:
l To understand the concept of Cloud Computing
l To appreciate the Evolution of Cloud from the existing technologies
l To have knowledge on the various issues in Cloud Computing

125
 Syllabus CSE
l To appreciate the Emergence of Cloud as the next generation computing
paradigm

UNIT I INTRODUCTION 9
Introduction to Cloud Computing – De inition of Cloud – Evolution of Cloud
Computing – Underlying Principles of Parallel and Distributed Computing –
Cloud Characteristics – Elasticity in Cloud – On-demand Provisioning.

UNIT II CLOUD ENABLING TECHNOLOGIES 10

Service Oriented Architecture – REST – Web Services – Publish-Subscribe
Model – Micro services – Micro services Architecture - Basics of Virtualization
– Types of Virtualization – Implementation Levels of Virtualization –
Virtualization Structures – Tools and Mechanisms – Virtualization of CPU –
Memory – I/O Devices –Virtualization Support and Disaster Recovery.

UNIT III CLOUD ARCHITECTURE, SERVICES AND STORAGE 8

Layered Cloud Architecture Design – NIST Cloud Computing Reference
Architecture – Public, Private and Hybrid Clouds - laaS – PaaS – SaaS –
Architectural Design Challenges – Cloud Storage – Storage-as-a-Service –
Advantages of Cloud Storage – Cloud Storage Providers – S3.

UNIT IV RESOURCE MANAGEMENT AND SECURITY IN CLOUD 10

Inter Cloud Resource Management – Resource Provisioning and Resource
Provisioning Methods – Global Exchange of Cloud Resources – Security
Overview – Cloud Security Challenges – Software-as-a-Service Security –
Security Governance – Virtual Machine Security – IAM – Security Standards.

UNIT V CLOUD TECHNOLOGIES AND ADVANCEMENTS 8

Hadoop – Map Reduce – Virtual Box - Google App Engine – Programming
Environment for Google App Engine – Open Stack – Federation in the Cloud –
Four Levels of Federation – Federated Services and Applications – Future of
Federation.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Kai Hwang, Geoffrey C. Fox, Jack G. Dongarra, "Distributed and Cloud
Computing, From Parallel Processing to the Internet of Things", Morgan
Kaufmann Publishers, 2012.
2. Rittinghouse, John W., and James F. Ransome, “Cloud Computing:
Implementation, Management and Security”, CRC Press, 2017.

126
 Syllabus CSE
REFERENCES:
1. Rajkumar Buyya, Christian Vecchiola, S. ThamaraiSelvi, “Mastering Cloud
Computing”, Tata Mcgraw Hill, 2013.
2. Toby Velte, Anthony Velte, Robert Elsenpeter, "Cloud Computing - A
Practical Approach”, Tata Mcgraw Hill, 2009.
3. George Reese, “Cloud Application Architectures: Building Applications
and Infrastructure in the Cloud: Transactional Systems for EC2 and
Beyond (Theory in Practice)”, O'Reilly, 2009.
4. Douglas Comer,"The Cloud Computing Book: The Future of Computing
Explained",Chapman and Hall/CRC,2021
5. Hemanand D,Chembian W T,Vallem Ranadheer Reddy, "CLOUD
COMPUTING: Cloud Concepts;Methodology,Network Architecture"July
2021,LAP LAMBERT Academic Publishing

ONLINE RESOURCES:
1. https://eniac2017. iles.wordpress.com/2017/03/distributed-and-
cloud-computing.pdf.
2. https://www.vmware.com/topics/glossary/content/distributed-
cloud.html

WEB REFERENCES:
1. https://swayam.gov.in/nd1_noc20_cs20/preview
2. https://nptel.ac.in/courses/106/105/106105167/
3. https://freevideolectures.com/course/4639/nptel-cloud-computing
4. https://www.udemy.com/course/learn-cloud-computing-from-scratch/

OUTCOMES:
Upon completion of the course, the student should be able to
1. Identify the main concepts, key technologies, strengths and limitations of
cloud computing. (K3)
2. Explain the key and enabling technologies that help in the development of
the cloud.(K2)
3. Understand and use the architecture of compute and storage cloud,service
and delivery models.(K2)
4. Explain the core issues of cloud computing such as resource management
and security.(K2)
5. Discover and use current cloud technologies. (K3)
6. Identify the appropriate technologies, algorithms and approaches for
implementation and use of cloud. (K3)

127
 Syllabus CSE

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 3 2 1 - - - - - - - -

CO2 2 3 2 1 - - - - - - - -

CO3 3 2 2 1 3 - - - - - - -

CO4 3 3 3 2 3 3 2 2 1 1 2 2

CO5 3 3 2 2 2 - - - - 1 - 2

CO6 3 3 3 3 1 3 1 3 - - 2 2

SEMESTER - VI
20HSMG601 PRINCIPLES OF ENGINEERING L T P C
SDG NO. 4,8,9,10&12 MANAGEMENT 3 0 0 3
OBJECTIVES:
l Enable the students to study the evolution of Management
l Study the functions and principles of management
l Learn the application of the principles in an organization.

UNIT I INTRODUCTION TO MANAGEMENT AND ORGANIZATIONS 9

Management – Science or Art – Manager Vs Entrepreneur – types of managers
– Engineers as Managers. Evolution of Management – Scienti ic, human
relations, system and contingency approaches – Types of Business
organization – Sole proprietorship, partnership, company-public and private
sector enterprises – Organization culture and Environment – Current issues
and future trends in Management; Industry 4.0 – Engineering management in
modern business.

UNIT II PLANNING 9
Planning, Technology Planning - Nature and purpose of planning – planning
process – types of planning – objectives – setting objectives – policies –
Planning premises – MBO – process - Principles and functions of engineering
management – Planning Tools and Techniques – Decision making steps and
process.

UNIT III ORGANISING 9

Nature and purpose – Formal and informal organization – organization chart –
organization structure – types – Line and staff authority –
128
 Syllabus CSE
departmentalization – delegation of authority – centralization and
decentralization – Job Design – Human Resource Management – HR Planning,
Recruitment, selection, Training and Development, Performance
Management, Career planning and management.

UNIT IV DIRECTING and CONTROLLING 9

Foundations of individual and group behaviour – Motivation – theories and
techniques–Leadership – Level 5 leadership - theories – Leadership as a
determinant of Engineering management - Communication – process and
barriers – effective communication – Communication and IT - System and
process of controlling – budgetary and non-budgetary control techniques.

UNIT V INNOVATION AND TECHNOLOGY MANAGEMENT 9

Innovation management of Product and Services, Role of R & D in
Entrepreneurship, Breakthrough Innovation, Disruptive Innovation – Modern
approaches in Engineering management – Green management, Lean
management, Managing diversity. IPR – Principles of Ethics for Engineering
Managers.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Tripathy PC and Reddy PN, Principles of Management, Tata McGraw Hill,
1999.

REFERENCES:
1. Stephen P. Robbins and Mary Coulter, Management, Prentice Hall (India)
Pvt. Ltd., 10th Edition, 2009.
2. JAF Stoner, Freeman R.E and Daniel R Gilbert Management, Pearson
Education, 6th Edition, 2004.
3. Stephen A. Robbins and David A. Decenzo and Mary Coulter,
Fundamentals of Management Pearson Education, 7th Edition, 2011.
4. Robert Kreitner and MamataMohapatra, Management, Biztantra, 2008.
5. Harold Koontz and Heinz Weihrich Essentials of management Tata
McGraw Hill,1998.

WEB RESOURCES:
1. h t t p s : / / w w w. m a n a g e m e n t s t u d y g u i d e . c o m / o r g a n i
zationmanagement.htm
2. https://nptel.ac.in/courses/110/105/110105034/
3. https://courses.lumenlearning.com/boundless-
management/chapter/principles-of-management/

129
 Syllabus CSE
ONLINE RESOURCES:
1. https://nptel.ac.in/courses/110/105/110105033/

OUTCOMES:
Upon completion of the course, the students should be able to
1. Understand the evolution and basic concepts of engineering
management. (K2)
2. Demonstrate the planning concepts for effective decision making
process. (K2)
3. Describe the basic concepts of organization and its function. (K2)
4. Describe the ability to direct, leadership and communicate effectively.
(K2)
5. Apply the concepts of innovation and technology management.(K3)

CO – PO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 1 - 1 2 3 3 2 1 1 1 - 1

CO2 3 2 - 2 1 3 - 1 1 1 1 1 - 1

CO3 3 1 - 1 1 1 1 - 1 1 1 1 - 1

CO4 3 2 - 1 1 1 - - 1 1 1 1 - 1

CO5 3 1 - 1 - - 1 - 1 1 1 1 - 1

SEMESTER - VI
20CSPL601 L T P C
ARTIFICIAL INTELLIGENCE LABORATORY
SDG NO. 4 0 0 3 1.5
OBJECTIVES:
l To learn Prolog Program
l To Implement in Prolog, C and its working environment
l To Implement N-Queen problem and puzzle problem using Prolog
l To Analyze the problem using BFS and DFS algorithm

LIST OF EXPERIMENTS :
1. Study of Prolog.
2. Write simple fact for the statements using Prolog.

130
 Syllabus CSE

3. Write predicates - one converts centigrade temperature to Fahrenheit,

other checks if a temperature is below freezing.
4. Write a program to solve 4-Queen problem.
5. Write a program to solve 8-Puzzle problem.
6. Write a program to solve any problem using Breadth First Search.
7. Write a program to solve any problem using Depth First Search.
8. Write a program to solve Travelling Salesman Problem.
9. Write a program to solve Water Jug problem.
10. Write a program to solve Missionaries and Cannibal problem.
11. Write a program to implement Library Management System.
TOTAL: 45 PERIODS
LAB REQUIREMENTS :
SOFTWARE : Prolog, Turbo C

OUTCOMES:
On completion of this laboratory course, the student should be able to
1 Interpret the concepts of Turbo and Prolog programming in AI.(K3)
2 Examine First order predicate logic to solve AI problems. (K4)
3 Apply Informed search strategies to solve AI problems.(K3)
4 Apply Uninformed search strategies to solve AI problems.(K3)
5 Select State Space Searching method to solve AI problems.(K3)
6 Demonstrate an application using Natural Language Processing. (K3)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 1 2 - 1 - 1 - - - - - 1 2

CO2 3 2 2 1 1 - - - - - - - 2 2

CO3 3 2 1 - 2 - - - - - - 1 2 1

CO4 3 2 1 - 2 - - - - - - 1 2 1

CO5 2 2 2 - 1 - 1 - - - - - 2 2

CO6 2 2 1 2 2 - - - - - - - 2 1

131
 Syllabus CSE

SEMESTER - VI
20CSPL602 CLOUD COMPUTING L T P C
SDG NO. 4 LABORATORY 0 0 3 1.5

OBJECTIVES:
l To develop Web Applications in Cloud
l To learn the design and development process involved in creating a Cloud
Based Application
l To understand the installation of Cloud Simulation tools and Cloud Setup
tools
l To learn to implement and use Parallel programming using Hadoop

LIST OF EXPERIMENTS :
1. Install VirtualBox/VMware Workstation with different lavors of Linux or
Windows OS on top of Windows 7 or 8.
2. Install a C compiler in the virtual machine created using virtual box and
execute simple programs.
3. Install Google App Engine. Create hello world app and other simple web
applications using Python/Java.
4. Use GAE launcher to launch the Web Applications.
5. Simulate a cloud scenario using CloudSim and run a scheduling algorithm
that is not present in CloudSim.
6. Find a procedure to transfer the iles from one Virtual Machine to another
Virtual Machine.
7. Find a procedure to launch Virtual Machine using try stack (Online
Openstack Demo Version)
8. Install Hadoop single node cluster and run simple applications like
wordcount.
TOTAL: 45 PERIODS
LAB REQUIREMENTS:
S.No. Software
1. Virtual box
2. VMware Workstation
3. Openstack, Hadoop

132
 Syllabus CSE
4. Cloudism
5. GAE launcher

OUTCOMES :
On completion of this laboratory course, the student should be able to
1. Discuss various virtualization tools such as Virtual Box, VMware to create
virtual Environment. (K2)
2. Design and Implement applications on the Cloud.(K3)
3. Illustrate web applications in a PaaS environment. (K3)
4. Understand how to simulate a cloud environment to implement new
schedulers. (K2)
5. Demonstrate and use a Generic Cloud environment that can be used as a
private cloud. (K3)
6. Manipulate large data sets in a parallel environment. (K3)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 2 2 1 3 1 1 - - - 2 2 3 2

CO2 3 3 3 2 3 1 1 - - - 2 2 2 2

CO3 3 3 3 3 3 - - - - - 2 2 3 2

CO4 2 2 3 2 3 - - - - - 2 2 3 2

CO5 3 3 3 3 2 1 1 - - - 3 3 3 2

CO6 3 3 3 3 2 1 1 - - - 2 2 3 2

133
 Syllabus CSE
SEMESTER - VI
20HSPL501 COMMUNICATION AND SOFT SKILLS L T P C
SDG NO. 4 & 8 LABORATORY 0 0 2 1

OBJECTIVES:
l To develop effective communication and presentation skills
l To enhance the employability and career skills of the learners
l To enable the learners for preparing job application and e-portfolio
l To make the learners use soft skills efficiently
l To develop their confidence and help them in attending interviews
successfully

UNIT I LISTENING AND SPEAKING SKILLS 6

Conversational skills participate in formal and informal talks – general, –
group discussion – time management – group dynamics – GD strategies -
making effective presentations - listening/watching interviews
conversations, documentaries - listening to lectures, discussions from social
media – improving articulation.

UNIT II ADVANCED READING AND WRITING SKILLS 6

Reading different genres of texts - writing job applications – cover letter –
résumé – emails – memos - writing abstracts – summaries – interpreting visual
texts.

UNIT III SKILLS FOR COMPETITIVE EXAMS 6

Reading passages for competitive exams – language focus exercise – building
vocabulary tasks - FAQs related to competitive exams – current affairs -
improving global reading skills – elaborating ideas – summarizing –
understanding arguments – identifying opinion/attitude and making
inferences - critical reading.

UNIT IV SOFT SKILLS 6

Motivation – emotional intelligence – managing changes – stress management
– leadership straits – team work – career planning – intercultural
communication – creative and critical thinking

UNIT V INTERVIEW SKILLS 6

Different types of interview – personal interview – panel interview –
telephone/online interview - interview etiquette - answering questions –

134
 Syllabus CSE

offering information – mock interviews – FAQs related to job interviews

TOTAL: 30 PERIODS
REFERENCES:
1. Business English Certificate Materials, Cambridge University Press.
2. Comfort, Jeremy, et al. Speaking Effectively: Developing Speaking Skills
for Business English. Cambridge University Press, Cambridge, 2011.
3. International English Language Testing System Practice Tests,
Cambridge University Press.
4. Personality Development (CD-ROM), Times Multimedia, Mumbai.

WEB REFERENCES:
1. http://www.slideshare.net/rohitjsh/presentation-on-group-discussion
2. http://www.oxforddictionaries.com/words/writing-job-applications
3. http://www.skillsyouneed.com/ips/interview-skills.html
4. http://www.personalitydevelopment.org/
5. https://nptel.ac.in/courses/109/107/109107121/
6. https://swayam.gov.in/nd1_noc19_hs33/preview
7. https://ict.iitk.ac.in/courses/enhancing-soft-skills-and-personality/

ONLINE RESOURCES:
1. https://www.britishcoucil.my/english/courses-adults/learning-
tips/importance-of-soft-skills
2. https://www.skillsoft.com/content-solutions/business-skills-
training/soft-skills-training/

OUTCOMES:
Upon completion of the course learners should be able to
1. Demonstrate a better understanding of the communication process by
articulating effectively(K2)
2. Exhibit soft skills & technical skills and construct e-portfolio
effectively(K3)
3. Apply critical thinking abilities and perform well in group discussions(K2)
4. Adapt the skills towards grooming as a professional continuously(K2)
5. Identify different types of personal interview skills through mock
interviews and practices(K2)
6. Execute the employability and career skills in their chosen profession(K3)

135
 Syllabus CSE
CO - PO MAPPING:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 - - - - - - - 1 2 3 1 1

CO2 - - - - - - - 2 3 3 2 1

CO3 - - - - - - - 2 3 2 - 1

CO4 - - - - - - - 1 1 3 2 2

CO5 - - - - - 2 - 1 2 3 - 1

SEMESTER - VI
20CSPJ601 L T P C
INNOVATIVE DESIGN PROJECT
SDG NO. 4,11&15 0 0 2 1

OBJECTIVES:
l To understand the engineering aspects of design with reference to simple
products
l To foster innovation in design of products
l To develop design that add value to products and solve technical problems.
l To create awareness among the students of the characteristics of several
domain areas where IT can be effectively used

COURSE PLAN :
Study: Take minimum three simple products, processes or techniques in the
area of specialization, study, analyze and present them. The analysis shall be
focused on functionality, construction, quality, reliability, safety, maintenance,
handling, sustainability, cost etc. whichever are applicable. Each student in the
group has to present individually; choosing different products, processes or
techniques.
Design: The project team shall identify an innovative product, process or
technology and proceed with detailed design. At the end, the team has to
document it properly and present and defend it. The design is expected to
concentrate on functionality; design for strength is not expected.

Note: The one hour/week allotted for tutorial shall be used for discussions and
presentations. The project team (not exceeding four) can be students from
different branches, if the design problem is multidisciplinary.

136
 Syllabus CSE

EVALUATION:
1. First evaluation (Immediately after irst internal examination) : 20 marks
2. Second evaluation (Immediately after second internal examination):
20 marks
3. Final evaluation ( Last week of the semester) : 60 marks
Note: All the three evaluations are mandatory for course completion and for
awarding the inal grade.

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand how to approach innovation challenges from a human-
centred perspective [K2]
2. develop many creative ideas through structured brainstorming sessions
[K3]
3. Apply the perspectives of different people that lead to best innovations
[K3]
4. Comprehend the importance of incorporating multidisciplinary approach
that address human needs and sustainable development [K3]
5. The signi icance of developing innovation projects with a prototyping
mind set, where iterations, trial and error, and even failure are all part of a
valuable, creative learning process [K4]

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3 3 3 2 2 3 3 3 2 3 3

CO2 3 3 3 3 3 3 2 2 3 3 3 2 3 3

CO3 2 2 2 1 2 1 1 1 3 2 3 3 3 2

CO4 2 2 2 1 2 1 1 1 3 2 3 3 3 2

CO5 2 2 2 1 2 1 1 1 3 2 3 3 3 2

137
 Syllabus CSE
SEMESTER - VI
20CSTP601 L T P C
SKILL ENHANCEMENT
SDG NO. 4 0 0 2 1

APTITUDE AND COGNITIVE SKILLS – PHASE 1

OBJECTIVES:
l Enhance their quantitative ability.
l Enhance their reasoning ability
l Enhance their verbal ability.

UNIT I QUANTITATIVE ABILITY – VII 10

Races And Games, Boats and Streams, Surds and Indices, Pipes and Cistern,
Alligations And Mixtures
UNIT II QUANTITATIVE ABILITY – VIII 10
Numbers, Problems on Numbers, Pick Wrong Number, Missing Number,
Areas, Shapes, Perimeter

UNIT III REASONING ABILITY – IV 8

Data Interpretation Pie Charts, Data Interpretation Line Charts, Data
Sufficiency (DS), Data Arrangements, LR – Arrangements, LR – Ranking.

UNIT IV VERBAL ABILITY – IV 10

Sentence Correction, Sentence Improvement, Completing Statements,
Sentence Formation, Paragraph Formation

UNIT V CREATIVITY ABILITY – IV 7

Dot Situation, Rule Detection, Embedded Images, Grouping Of Images, Image
Analysis
TOTAL : 45 PERIODS
REFERENCES:
1. Quantitative Aptitude for Competitive Exams by R. S. Agarwal
2. Quantum CAT by Sarvesh Verma
3. A Modern Approach to Logical Reasoning by R. S. Agarwal
4. Verbal Ability and Reading Comprehension by Arun sharma

138
 CSE Syllabus
PROBLEM SOLVING USING BASIC DATA STRUCTURES – MOBILE
APPLICATION DEVELOPMENT & ANDROID STUDIO - PHASE 2

COURSE OBJECTIVE:
l Familiarize students with basic data structures and their use in
fundamental algorithms.
l Understand and develop application using Android

UNIT I LINKED LIST, STACK, QUEUE & HEAP 10

Linked List - Doubly Linked List Traversal, Circular Linked List, Structure,
Node creation, Traversal Stack, Stack –Time Complexities of the Operations,
Infix to Postfix/Prefix Conversation, Histogram Problem, Implementation -
Using Array, Using Linked List, Queue Implementation - Queue using Stack

UNIT II BINARY TREE AND HASHING 10

Binary Tree - Types of Binary Tree,Balanced Tree, Degenerate or pathological
Tree, Binary Search Tree, Inorder , Preorder , PostOrder and LevelOrder
Traversal, Hashing, Linear Probing for Collision Handling, Union and
Intersection of two Linked Lists

UNIT III TREES AND GRAPH 10

AVL Tree -Right-Left Imbalance, Left and Right Rotation, - Red Black Tree,
Rules of coloring Left and Right Rotation,Graph terminology –Representation
of graphs –Path matrix –Graph Traversal –BFS (breadth first search) –DFS
(depth first search) –Minimum spanning Tree –Kruskal's Algorithm & Prim's
Algorithm –Warshall's algorithm (shortest path algorithm).

UNIT IV INTRODUCTION TO ANDROID STUDIO APPLICATION 8

Android Studio Development Kit - The Android Platform - Eclipse Installation-
Understanding the Anatomy of Android Application - Android Installation -
Building the First Android Application - Android Manifest File -Android
Technology - Android Application Design Essentials : Android Applications
Anatomy -Application- Activities, Context, Services, Intents -
Receiving and Broadcasting Intents - Using Intent Filter, Permissions -
Android Manifest File and common settings.

UNIT V ANDROID APPLICATION PROGRAMMING INTERFACES 7

Using Android Data and Storage APIs - Designing User Interfaces and Layouts -
Sharing Data between Applications with Content Providers - Managing Data
Using Sqlite - Using Android Networking APIs - Using Android Telephony APIs
- Using Android Web APIs - Deploying Android Application to the world -
139
 CSE
Syllabus
Testing Android Applications : Using Android PreferenceS - Publishing
Android Application- Managing Application Resources in a Hierarchy -
Drawing and working with Animation
TOTAL : 45 PERIODS

REFERENCES:
1. Weiss, Mark. A. (2012), Data structures and algorithm analysis in Java. 3
edition. Harlow, Essex : Pearson (632 p).
2. Zobel, Justin (2014), Writing for Computer Science. 3 edition. Springer
Verlag London Ltd (270 p).
3. Google Developer Training, "Android Developer Fundamentals Course –
Concept Reference”Google Developer Training Team, 2017
4. Erik Hellman, “Android Programming – Pushing the Limits”, 1st Edition,
Wiley India Pvt Ltd, 2014.
5. Dawn Griffiths and David Griffiths, “Head First Android Development”, 1st
Edition, O’Reilly SPD Publishers, 2015.
6. J F DiMarzio, “Beginning Android Programming with Android Studio”, 4th
Edition, Wiley India Pvt Ltd, 2016. ISBN-13: 978-8126565580
7. AnubhavPradhan, Anil V Deshpande, “ Composing Mobile Apps” using
Android, Wiley 2014, ISBN: 978-81-265-4660-2

WEB LINK :
1. https://www.gitbook.com/book/google-developer-training/android-
developerfundamentals- course-concepts/details (Download pdf file
from the above link)

COURSE OUTCOMES :
Upon completion of this course, the students should be able to:
1. Analyze the applications of linear data structure using Stack and Queue
implementation. (K4)
2. Define the various hash functions and its implementation. (K2)
3. Apply the basic concepts of the Non Linear Data Structure - Trees and
Graph. (K3)
4. Apply the components and structure of mobile application development
frameworks for Android studio and windows OS. (K3)
5. Analyze various Android Application Programming Interfaces.(K4)
6. Analyze and discover own mobile app for simple needs. (K4)

140
 Syllabus CSE
CO- PO & PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 - 2 - - - - - - - - - - -

CO2 3 - 2 - - - - - - - - - - -

CO3 3 2 2 2 - - - - - - - - - -

CO4 3 2 2 2 - - - - - - - - - -

CO5 1 1 3 2 3 2 3 1 - - - - - -

CO6 1 3 1 1 1 2 1 2 - - - - - -

141
 Syllabus CSE
SEMESTER - VII
20CSPC701 L T P C
BIG DATA ANALYTICS
SDG NO. 4 & 9 3 0 0 3
OBJECTIVES:
l To describe the basic concepts of Big Data Characteristics and Analytics
l To examine the Hadoop and MapReduce framework for processing large
volume of data sets
l To demonstrate Hive, Pig, MongoDB and Report generation
l To analyze the Big Data for useful Business applications and get familiarized
with the Visualization

UNIT I INTRODUCTION TO BIG DATA ANALYTICS 9

Classi ication of Digital Data - Introduction to Big Data: Characteristics –
Evolution – De inition - Challenges with Big Data - Other Characteristics of
Data - Why Big Data - Traditional Business Intelligence versus Big Data - Data
Warehouse and Hadoop Environment - Big Data Analytics: Classi ication of
Analytics – Challenges - Big Data Analytics importance - Data Science - Data
Scientist - Terminologies used in Big Data Environments - Basically Available
Soft State Eventual Consistency - Top Analytics Tools.

UNIT II HADOOP AND MAPREDUCE PROGRAMMING 9

Hadoop: Features – Advantages – Versions – Ecosystems – Distributions –
Hadoop Versus RDBMS - Distributed Computing Challenges – History -
Hadoop Overview - Use Case of Hadoop - Hadoop Distributors - Hadoop
Distributed File System - Processing Data with Hadoop - Managing Resources
and Applications with Hadoop YARN - Interacting with Hadoop Ecosystem –
MapReduce: Mapper – Reducer – Combiner – Partitioner – Searching – Sorting
– Compression.

UNIT III DATA PROCESSING SERVICES: HIVE & PIG 9

Hive: Introduction – Architecture - Data Types - File Formats - Hive Query
Language Statements – Partitions – Bucketing – Views - Sub-Query – Joins –
Aggregation - Group By and Having - RCFile Implementation - Hive User
De ined Function - Serialization and Deserialization - Hive Analytic Functions -
Pig: Introduction - History and Anatomy – Features – Philosophy - Use Case for
Pig - Pig Latin Overview - Pig Primitive Data Types - Running Pig - Execution
Modes of Pig - HDFS Commands - Relational Operators - Eval Function -
Complex Data Types - Piggy Bank - User-De ined Functions - Parameter
Substitution - Diagnostic Operator - Word Count Example using Pig - Pig at
Yahoo! - Pig Versus Hive.
142
 Syllabus CSE
UNIT IV NOSQL: MONGODB AND JASPER REPORTS 9
NoSQL Databases: Advantages - Usage - Vendors - New SQL - Comparison of
SQL, NoSQL and NewSQL - MongoDB: Why Mongo DB - Terms used in RDBMS
and MongoDB - Data Types - MongoDB Query Language Methods: Insert - Save
- Update - Remove - Find - NULL - Count - Limit - Sort - Skip - Arrays - Aggregate
- MapReduce - Cursors in MongoDB - Indexes - Import and Export - Jasper
Report using Jaspersoft - Connecting to MongoDB NOSQL Database.

UNIT V FRAMEWORKS AND VISUALIZATION 9

Apache Hbase - Architecture/Storage - Features - Data Model - Shell and
Implementation - Hbase Vs RDBMS - Zookeeper - Installation and
Con iguration - Running Zookeeper - Sqoop - Architecture - Import and Export
Data – Sqoop Job - Flume - Log Collection - Working with Twitter Stream -
Oozie - Simple and Complex Flow - Components - Service/Scheduler -
Work low - Apache Spark - Lambda Architecture - Spark Streaming - Spark
Processing - Apache Ka ka - Operations - Visualizations - Visual Data Analysis
Techniques - Interaction Techniques.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Seema Acharya, Subhashini Chellappan, "Big Data and Analytics", Wiley
Publications, First Edition, 2015.
2. TomWhite, "Hadoop:The De initive Guide", 3rd Edition, O'Reilly, 2012.

REFERENCES:
1. Seema Acharya, “Data Analytics using R”, McGraw Hill Publications, New
Edition, 2018.
2. Judith Huruwitz, Alan Nugent, Fern Halper, Marcia Kaufman, “Big data for
dummies”, John Wiley & Sons, Inc. , 2013.
3. Donald Miner, “Map Reduce Design Patterns: Building Effective
Algorithms and Analytics for Hadoop and Other Systems”, O'Reilly Media,
2012.
4. Vignesh Prajapati, “Big Data Analytics with R and Hadoop”, 1 st Edition,
Packet Publishing Limited, 2013.
5. Kyle Banker, “Mongo DB in Action”, Manning Publications Company, 2012.

WEB REFERENCES:
1. https://www.mongodb.org
2. https://hadoop.apache.org/
3. https://hive.apache.org/
4. https://pig.apache.org/
5. https://community.jaspersoft.com
143
 CSESyllabus
OUTCOMES:
Upon completion of the course, the students should be able to
1. Describe the characteristics and challenges of big data analytics.(K2)
2. Apply Hadoop and MapReduce framework for processing massive volume
of data.(K3)
3. Use Hive and Pig to demonstrate the structured and semi structured
data.(K3)
4. Illustrate CRUD operations using MongoDB and Report generation using
Jaspersoft studio.(K3)
5. Explore the usage of Hadoop and its integration tools to manage Big Data
and Use Visualization techniques.(K3)
6. Apply suitable frameworks and NoSQL Database to solve the real time
problems. (K3)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 - - - - - - - - - - 3 2

CO2 3 3 3 1 3 - - - - 3 - - 2 2

CO3 3 3 3 3 3 - - - 2 3 1 2 3 2

CO4 3 3 3 3 3 - - - - - - - 3 2

CO5 3 3 3 3 3 - - - - 2 2 2 3 2

CO6 3 3 3 3 3 - - - - 2 2 3 3 2

SEMESTER - VII
20CSPC702 L T P C
MACHINE LEARNING TECHNIQUES
SDG NO. 4 &11 3 0 0 3
OBJECTIVES:
l To understand the need for machine learning for various problem solving
l To study the various supervised, semi-supervised and unsupervised
learning algorithms in machine learning
l To understand the latest trends in machine learning
l To design appropriate machine learning algorithms for problem solving

144
 Syllabus CSE
UNIT I INTRODUCTION 9
Learning Problems – Perspectives and Issues – Concept Learning – Version
Spaces and Candidate Eliminations – Inductive bias – Decision Tree learning –
Representation – Algorithm – Heuristic Space Search.

UNIT II NEURAL NETWORKS AND GENETIC ALGORITHMS 9

Neural Network Representation – Problems – Perceptrons – Multilayer
Networks and Back Propagation Algorithms – Advanced Topics – Genetic
Algorithms – Hypothesis Space Search – Genetic Programming – Models of
Evaluation and Learning.

UNIT III BAYESIAN AND COMPUTATIONAL LEARNING 9

Bayes Theorem – Concept Learning – Maximum Likelihood – Minimum
Description Length Principle – Bayes Optimal Classi ier – Gibbs Algorithm –
Naıv̈e Bayes Classi ier – Bayesian Belief Network – EM Algorithm – Probability
Learning – Sample Complexity – Finite and In inite Hypothesis Spaces –
Mistake Bound Model.

UNIT IV INSTANT BASED LEARNING 9

K - Nearest Neighbour Learning – Locally weighted Regression – Radial
Basis Functions – Case Based Learning.

UNIT V ADVANCED LEARNING 9

Learning Sets of Rules – Sequential Covering Algorithm – Learning Rule Set –
First Order Rules – Sets of First Order Rules – Induction on Inverted Deduction
– Inverting Resolution – Analytical Learning – Perfect Domain Theories –
Explanation Base Learning – FOCL Algorithm – Reinforcement Learning –
Task – Q-Learning – Temporal Difference Learning
TOTAL: 45 PERIODS
TEXT BOOK:
1. Tom M. Mitchell, “Machine Learning”, McGraw-Hill Education (India)
Private Limited, 2017.
2. Marco Gori , “Machine Learning: A Constraint-Based Approach”, Morgan
Kaufmann. 2017

REFERENCES:
1. Ethem Alpaydin, “Introduction to Machine Learning (Adaptive
Computation and Machine Learning)”, The MIT Press 2004.
2. Stephen Marsland, “Machine Learning: An Algorithmic Perspective”, CRC
Press, 2009
3. Richard O. Duda, Peter E. Hart, David G. Stork, “Pattern Classi ication”,
Wiley, Second Edition.
145
 Syllabus CSE
4. Christopher Bishop, “Pattern Recognition and Machine Learning”,
illustrated Edition, Springer, 2006.
5. Peter Flach, “Machine Learning: The Art and Science of Algorithms that
Make Sense of Data”, First Edition, Cambridge University Press, 2012.

WEB REFERENCES:
1. https://towardsdatascience.com/best-resources-for-ai-machine-
learning-data-science-d72625d4689d
2. https://www.analyticsvidhya.com/resources-machine-learning-deep-
learning-neural-networks/
3. https://www.ritchieng.com/machine-learning-resources/
4. https://www.guru99.com/machine-learning-tutorial.html

OUTCOMES:
Upon completion of the course, the student should be able to
1. Gain knowledge about basic concepts of Machine Learning and
differentiate between supervised, unsupervised, semi-supervised
machine learning approaches. (K2)
2. Discuss and apply the back propagation algorithm and genetic algorithms
to various problems. (K2)
3. Discuss the Decision Tree algorithm, identity and overcome the problem
of over itting and apply the Bayesian concepts to Machine Learning. (K2)
4. Solve the problems using various Machine Learning techniques and apply
instant based learning techniques. (K3)
5. Analyze and suggest appropriate Machine Learning approaches for
various types of problems. (K4)
6. Demonstrate various machine learning algorithms in a range of real-world
applications (K3)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3 3 2 1 - 3 3 2 2 3 2

CO2 3 3 3 3 3 2 1 - 3 3 2 2 3 2

CO3 3 3 3 3 3 2 1 - 3 3 2 2 3 2

CO4 3 3 3 3 3 2 2 - 3 3 2 2 3 2

CO5 3 3 3 3 3 2 2 - 3 3 2 2 3 2

CO6 2 2 2 1 2 1 - - - - 1 2 2 2

146
 Syllabus CSE
SEMESTER - VII
20ITPC701 CRYPTOGRAPHY AND NETWORK L T P C
SDG NO. 4 &9 SECURITY 3 0 0 3

OBJECTIVES:
l To understand Cryptography Theories, Algorithms and Systems
l To understand necessary approaches and techniques to build protection
mechanisms in order to secure Computer Networks
l To know the Symmetric Cryptography Techniques
l To understand the Public Key Cryptography techniques

UNIT I INTRODUCTION 9
Security Trends - Legal- Ethical and Professional aspects of Security - Need for
Security at Multiple Levels - Security Policies - Model of Network Security –
Security Attacks - Services and Mechanisms – OSI Security Architecture –
Classical Encryption Techniques: Substitution Techniques - Transposition
Techniques - Steganography - Foundations of Modern Cryptography - Perfect
Security – Information Theory – Product Cryptosystem – Cryptanalysis.

UNIT II SYMMETRIC KEY CRYPTOGRAPHY 9

Mathematics of Symmetric Key Cryptography - Algebraic Structures - Modular
Arithmetic - Euclid’s Algorithm - Congruence and Matrices - Groups - Rings,
Fields - Finite Fields - Symmetric Key Ciphers - SDES – 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 9

Mathematics of Asymmetric 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 – Dif ie
Hellman Key Exchange - ElGamal Cryptosystem – Elliptic Curve Arithmetic -
Elliptic Curve Cryptography.

UNIT IV MESSAGE AUTHENTICATION AND KEY DISTRIBUTION 9

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.
147
 Syllabus CSE
UNIT V NETWORK AND INTERNET SECURITY 9
Electronic Mail Security – PGP-S/MIME – IP Security – Web Security – System
Security - Intruders – Malicious Software – Viruses – Firewalls - Network
Access Control and Cloud Security – Transport Level Security – Wireless
Network Security – Email Security.
TOTAL: 45 PERIODS
TEXT BOOK:
1. William Stallings, “Cryptography and Network Security: Principles and
Practice”, PHI 7th Edition (Global Edition), Pearson 2017.

REFERENCES:
1. C K Shyamala, N Harini and Dr. T R Padmanabhan: “Cryptography and
Network Security”, Wiley India Pvt. Ltd, 2011.
2. BehrouzA.Foruzan, “Cryptography and Network Security”, Tata McGraw
Hill, 2007.
3. Charlie Kaufman, Radia Perlman, and Mike Speciner, “Network Security:
Private Communication in a Public World”, Prentice Hall.

WEB REFERENCES:
1. https://nptel.ac.in/courses/106/105/106105162/
2. https://nptel.ac.in/courses/106/105/106105031/

ONLINE RESOURCES:
1. https://freevideolectures.com/course/4727/nptel-cryptography-and-
network-security
OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand the concepts of Network Security and Remember the various
mathematical techniques applied in Cryptography.(K2)
2. Discuss the mathematical formulas used to implement symmetric key
cryptography techniques.(K2)
3. Interpret the mathematical background to implement asymmetric key
cryptography techniques.(K2)
4. Apply the Symmetric and Asymmetric Cryptographic methods and design
Secure Applications to operate Digital Signature in Real World Situation
(K3)
5. Illustrate the various Message authentication schemes to simulate
different applications. (K3)
6. Apply Data authentication mechanisms for a web based and system level
application. (K3)

148
 Syllabus CSE
CO- PO, PSO MAPPING:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 2 2 - - - - - - 2 - 2 2 -

CO2 2 2 2 - - - - - - 2 - 2 2 -

CO3 2 2 2 - - - - - - 2 - 2 2 -

CO4 2 2 2 - - - - - - 2 - 2 2 -

CO5 2 2 2 - - - - - - 2 - 2 2 -

CO6 2 2 2 - - - - - - 2 - 2 2 -

SEMESTER - VII
20CSPL701 L T P C
DATA ANALYTICS LABORATORY
SDG NO. 4 & 9 0 0 3 1.5
OBJECTIVES:
l To implement MapReduce programs for processing Big Data
l To analyze Big Data using Hive and Pig
l To realize storage of Big Data using MongoDB and Hbase
l To develop Big Data applications for streaming data using Apache Spark

LIST OF EXPERIMENTS :
1. Install, con igure and run Hadoop and HDFS.
2. Implement word count / frequency programs using MapReduce.
3. Implement an MR program that processes a weather dataset.
4. Implement an application using Hive/Pig.
5. Visualize data using any plotting framework.
6. Implement an application that stores big data in Hbase / MongoDB using
Hadoop/R.
7. Install, deploy and con igure Apache Spark cluster. Run an application
using Apache Spark.
TOTAL: 45 PERIODS

LAB REQUIREMENTS :
1. Hadoop / R
2. Hive and Pig
3. Hbase
149
 Syllabus CSE
4. MongoDB
5. Apache Spark

OUTCOMES:
On completion of this laboratory course, the students should be able to
1. Demonstrate Big Data using Hadoop framework.(K3)
2. Implement Map Reduce framework for processing big data.(K3)
3. Perform Data Analysis using Hive/Pig.(K3)
4. Use NoSQL database to Store and retrieve the data.(K3)
5. Perform Graphical Data Analysis.(K3)
6. Apply Apache Spark to build big data applications.(K3)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 1 1 2 - 3 - - - - - - - 3 1

CO2 3 3 3 3 3 - - - - 2 - 1 2 2

CO3 1 3 3 3 3 - - - - 2 - 1 1 2

CO4 1 3 3 3 3 - - - - 2 - 1 3 2

CO5 1 1 1 1 3 - - - - 3 - 1 3 2

CO6 3 3 3 3 3 - - - - 3 - 1 3 2

SEMESTER - VII
20ITPL701 CRYPTOGRAPHY AND NETWORK L T P C
SDG NO. 4 SECURITY LABORATORY 0 0 3 1.5

OBJECTIVES:
l To learn different Substitution Techniques
l To learn different Transposition Techniques
l To implement the algorithms DES, RSA, MD5, SHA-1
l To use Network Security Tools and Vulnerability Assessment Tools

LIST OF EXPERIMENTS:
1. Perform encryption, decryption using the following substitution
techniques
i) Ceaser Cipher, (ii) Playfair Cipher iii) Hill Cipher iv) Vigenere Cipher

150
 Syllabus CSE
2. Perform encryption and decryption using following transposition
techniques.
i) Rail fence ii) Row & Column Transformation.
3. Implement DES algorithm for practical applications.
4. Implement AES algorithm for practical applications.
5. Implement RSA algorithm using HTML and JavaScript.
6. Implement the Dif ie-Hellman Key Exchange algorithm for a given
problem.
7. Calculate the Message Digest of a text using the SHA-1 algorithm.
8. Implement the Signature Scheme - Digital Signature Standard.
9. Demonstrate Intrusion Detection System (IDS) using any online tools.
10. Automated Attack and Penetration Tools
11. Defeating Malware
I) Building Trojans ii) Rootkit Hunter
TOTAL: 45 PERIODS
LAB REQUIREMENTS :
C / C++ / Java or equivalent compiler GnuPG, Snort, N-Stalker or Equivalent

OUTCOMES:
On completion of this laboratory course, the students should be able to
1. Develop code for Classical Encryption Techniques.(K3)
2. Build Cryptosystems by applying Symmetric Encryption algorithms.(K3)
3. Build Cryptosystems by applying Public Key Encryption algorithms.(K3)
4. Construct code for Authentication algorithms.(K3)
5. Develop a Signature scheme using Digital signature standard.(K3)
6. Demonstrate the Network security system using Open source tools.(K2)

CO - PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 2 - - - - - - 2 - 2 2 -

CO2 3 3 2 - - - - - - 2 - 3 2 -

CO3 3 3 2 - - - - - - 2 - 3 2 -

CO4 3 3 2 - - - - - - 3 - 3 2 -

CO5 3 3 2 - - - - - - 2 - 3 2 -

CO6 1 3 2 - 3 - - - - 2 - 3 2 -

151
 Syllabus CSE
SEMESTER - VII
20CSPJ701 L T P C
SDG NO. 4, 6,7,8, PROJECT PHASE - I
9,11,12,13 & 17 0 0 4 2
OBJECTIVES:
l Identify and describe the problem and scope of project
l Collect, analyze and present data into meaningful information using
relevant tools
l Select, plan and execute a proper methodology in problem solving, work
independently and ethically
l Present the results in written and oral format effectively and identify basic
entrepreneurship skills in project management

GUIDELINES TO BE FOLLOWED:
The students may be grouped into 2 to 3 and work under a project supervisor
and prepare a comprehensive project report after completing the work to the
satisfaction of the supervisor (faculty member). The progress of the project is
evaluated based on a minimum of three reviews. The review committee may be
constituted by the Head of the Department. A project report is required at the
end of the semester. The project work is evaluated based on oral presentation
and the project report jointly by External and Internal examiners constituted
by the Head of the Department. The Project Work Phase-I will have the
following sequence:
I. Problem Identi ication
1. A statement of system / process speci ications proposed to be
developed (Block Diagram / System Architecture / Process Flow)
2. Feasibility Study
3. List of possible solutions including alternatives and constraints
4. Time Line of activities

II. A report highlighting the design inalization [based on functional

requirements and standards (if any)]

III. A presentation including the following:

1. Literature survey on existing system
2. Implementation Phase (Hardware &Software)
3. Testing and Validation of the developed system
IV. Consolidated report preparation
TOTAL: 60 PERIODS
152
 Syllabus CSE
OUTCOMES:
Upon completion of the course, the students should be able to
1. Comprehend an industrial or real life problem and identify right/ real
issue with solution. (K2)
2. Analyze the necessary studies and review the literature, design a setup
of equipment, complete the analysis. (K3)
3. Compose a project report based on the indings. (K6)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 2 2 2 2 2 2 2 2 2 3 3 3

CO2 3 3 3 2 3 3 2 2 3 3 3 3 3 3

CO3 2 2 2 1 2 1 1 1 3 2 3 3 3 2

SEMESTER - VII
20CSTP701 L T P C
SKILL ENHANCEMENT
SDG NO. 4 0 0 2 1

APTITUDE REFRESHER & APTITUDE COMPANY SPECIFIC TRAINING

SKILLS – PHASE 1

OBJECTIVES:
l Enhance their quantitative ability.
l Enhance their reasoning ability
l Enhance their verbal ability.

UNIT I PRODUCT COMPANY SPECIFIC TRAINING – I 10

Product Specific Training for Amazon, Microsoft, IBM, ThoughtWorks,
Juspay, Paypal, Mu Sigma, Zoho Corporation, VM Ware, Directi, Oracle, Wells
Fargo, Goldman Sachs, Chargebee, Coda Global, Temenos, Freshworks,
Adobe Systems.

UNIT II PRODUCT COMPANY SPECIFIC TRAINING – II 10

Product Specific Training for Ernst and Young, BA Continuum, Standard
Chartered, AON Hewitt, Soliton Technologies, Payoda Technologies,
Infoview Technologies, Athena Health Technology.

153
 CSE
Syllabus
UNIT III SERVICE COMPANY SPECIFIC TRAINING - I 10
TCS, Wipro, TechMahindra, InfoView, RobertBosch, , NTT Data, Verizon,
Payoda Technologies.

UNIT IV SERVICE COMPANY SPECIFIC TRAINING - II 10

CTS, Accenture, MindTree, MPhasis, Odessa Technologies, Vuram
Technologies, Hewlett Packard, HCL.

UNIT V SERVICE COMPANY SPECIFIC TRAINING - III 5

Capgemini, Infosys, IBM, UGAM Solutions, Skava Systems, L&T Infotech,
Bahwan Cybertech, Dhyan Infotech.
TOTAL : 45 PERIODS
REFERENCES:
1. Quantitative Aptitude for Competitive Exams by R. S. Agarwal
2. Quantum CAT by Sarvesh Verma
3. A Modern Approach to Logical Reasoning by R. S. Agarwal
4. Verbal Ability and Reading Comprehension by Arun sharma

APTITUDE & TECHNICAL REFRESHER & COMPANY SPECIFIC TRAINING

& UNITY BASICS - PHASE 2

COURSE OBJECTIVE:
l Enhance their quantitative ability.
l Enhance their reasoning ability
l Enhance their verbal ability.

UNIT I PRODUCT COMPANY SPECIFIC TRAINING – I 10

Product Specific Training for Amazon, Microsoft, IBM, ThoughtWorks, Juspay,
Paypal, Mu Sigma, Zoho Corporation, VMWare, Directi, Oracle, Wells Fargo,
Goldman Sachs, Chargebee, Coda Global, Temenos, Freshworks, Adobe
Systems., Ernst and Young, BA Continuum, Standard Chartered, AON Hewitt,
Soliton Technologies, Payoda Technologies, Infoview Technologies,
AthenaHealth Technology.

UNIT II PRODUCT COMPANY SPECIFIC TRAINING – II 10

Product Specific Training for TCS,Wipro,TechMahindra, InfoView,
RobertBosch, , NTT Data, Verizon, Payoda Technologies. CTS, Accenture,
MindTree, MPhasis, Odessa Technologies, Vuram Technologies, Hewlett
Packard, HCL.

154
 CSE
Syllabus
UNIT III SERVICE COMPANY SPECIFIC TRAINING - I 10
Capgemini, Infosys, IBM, UGAM Solutions, Skava Systems, L&T Infotech,
Bahwan Cybertech, Dhyan Infotech.

UNIT IV UNITY INTRODUCTION 8

Downloading unity and Project setup, Unity Objects and Components -
Toolbar Tools, Toolbar Buttons, Project window, Scene view, Game View -
Hierarchy window, Inspector window, Customizing your workspace, Wrap up,
, Creating our own component, Unity Engine UI- Working with user interface
text, Creating a countdown Timer, Creating a Digital Clock, Unity UI – Images,
Buttons, Toggles, Sliders, Drop down.

UNIT V C# AND UNITY CODING 7

Introduction to C# with Unity, C# if-Else statement, While-do While, for loop,
for each loop, switch statement. Creating a simple calculator, creating a 2D side
scroller, 3D game development Animations –Introduction, Animation
Controller, Creating 2D Animations and 3D Animations, Triggering
Animations from script.
TOTAL : 45 PERIODS
REFERENCES:
1. Quantitative Aptitude for Competitive Exams by R. S. Agarwal.
2. Quantum CAT by Sarvesh Verma
3. A Modern Approach to Logical Reasoning by R. S. Agarwal
4. Verbal Ability and Reading Comprehension by Arun Sharma.
5. Jeremy Gibson Bond, “Introduction to Game Design, Prototyping, and
Development”, Latest Edition - Third, Publisher - Addison-Wesley
6. Alan Thorn, Unity Animation Essentials, Packt Publishing Limited, 24 June
2015.

WEB LINK :
1.https://docs.unity3d.com/560/Documentation/Manual/UnityBasics.html
2. https://unity.com/learn

COURSE OUTCOMES :
Upon completion of this course, the students should be able to:
1. Apply quantitative and reasoning skills.( K3)
2. Improve verbal ability (K6)
3. Recognize Unity Interface such as panels, Tools and Components. (K1)
4. Understand foundational language and theory of game development
technology(K2)

155
 CSE Syllabus
5. Define C# and its Role in Unity. (K1)
6. Apply problem solving, design and decision-making methodologies to
develop components, systems and processes to meet specified
requirements. (K3)

CO- PO & PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 2 3 2 2 1 - 2 1 - 2 1 -

CO2 - - - - 1 1 1 1 - 1 - 1 - -

CO3 3 2 2 3 2 2 1 - 2 1 - 2 2 -

CO4 3 2 2 3 2 2 1 - 2 1 - 2 2 -

CO5 3 2 2 3 3 2 1 - 1 1 - 2 2 -

CO6 3 2 2 3 3 2 1 - 2 1 - 2 2 -

156
 Syllabus CSE

SEMESTER - VIII
20CSPJ801
PROJECT PHASE-II L T P C
SDG NO. 4,6,7,
8, 9,11,12,13&17 0 0 8 4

OBJECTIVES:
l Identify and describe the problem and scope of project
l Collect, analyze and present data into meaningful information using
relevant tools
l Select, plan and execute a proper methodology in problem solving, work
independently and ethically
l Present the results in written and oral format effectively and identify basic
entrepreneurship skills in project management

GUIDELINES TO BE FOLLOWED:
The students may be grouped into 2 to 3 and work under a project supervisor
and prepare a comprehensive project report after completing the work to the
satisfaction of the supervisor (faculty member). The progress of the project is
evaluated based on a minimum of three reviews. The review committee may
be constituted by the Head of the Department. A project report is required at
the end of the semester. The project work is evaluated based on oral
presentation and the project report jointly by external and internal examiners
constituted by the Head of the Department. The Project Work Phase-II will
have the following Sequence:

I. Problem Identi ication

1. List of possible solutions including alternatives and constraints
2. Cost bene it analysis
3. Time Line of activities

II. A report highlighting the design inalization [based on functional,

non-functional requirements and standards (if any)]

III. A presentation including the following:

1. Implementation Phase (Hardware & Software)
2. Testing and Validation of the developed system
3. Learning in the Project and Future Enhancement

IV. Consolidated report preparation TOTAL: 60 PERIODS

157
 Syllabus CSE
OUTCOMES :
Upon completion of the course, the students should be able to
1. Comprehend an industrial or real life problem and identify right/ real
issue with solution. (K2)
2. Analyze the necessary studies and review the literature, design a setup of
equipment, complete the analysis. (K3)
3. Compose a project report based on the indings. (K6)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 2 2 2 2 2 2 3 2 2 3 3 3

CO2 3 3 3 2 3 3 2 2 3 3 3 3 3 3

CO3 2 2 2 1 2 1 1 1 3 2 3 3 3 2

158
 Syllabus CSE
PROFESSIONAL ELECTIVES - I
20CSEL501 DATA WAREHOUSING AND L T P C
SDG NO. 4 & 9 DATA MINING 3 0 0 3

OBJECTIVES:
l To understand Data Warehouse concepts, Architecture, Business Analysis
and Tools
l To understand Data Preprocessing and Data Visualization techniques
l To study algorithms for inding Hidden and Interesting patterns in Data
l To understand and apply various Classi ication and Clustering techniques

UNIT I DATA WAREHOUSING, BUSINESS ANALYSIS AND

ON-LINE ANALYTICAL PROCESSING 9
Basic Concepts – Data Warehousing Components – Building a Data Warehouse
– Database Architectures for Parallel Processing – Parallel DBMS Vendors –
Multidimensional Data Model – Data Warehouse Schemas for Decision
Support - Concept Hierarchies - Characteristics of OLAP Systems – Typical
OLAP Operations - OLAP and OLTP.

UNIT II INTRODUCTION TO DATA MINING 9

Introduction to Data Mining Systems – Knowledge Discovery Process – Data
Mining Techniques – Issues – Applications- Data Objects and Attribute Types -
Statistical Description of Data - Data Preprocessing – Cleaning - Integration -
Reduction - Transformation and Discretization - Data Visualization - Data
Similarity and Dissimilarity Measures.

UNIT III FREQUENT PATTERN ANALYSIS 9

Mining Frequent Patterns - Associations and Correlations – Mining Methods-
Pattern Evaluation Method – Pattern Mining in Multilevel - Multi Dimensional
Space – Constraint Based Frequent Pattern Mining - Classi ication Using
Frequent Patterns.

UNIT IV CLASSIFICATION AND CLUSTERING 9

Decision Tree Induction – Bayesian Classi ication – Rule Based Classi ication –
Classi ication by Back propagation – Support Vector Machines – Lazy Learners
– Model Evaluation and Selection - Techniques to improve Classi ication
Accuracy - Clustering Techniques – Cluster Analysis - Partitioning Methods –
Hierarchical Methods – Density Based Methods – Grid Based Methods –
Evaluation of Clustering – Clustering High Dimensional Data - Clustering with
Constraints - Outlier Analysis - Outlier Detection Methods.

159
 Syllabus CSE
UNIT V DATA ANALYSIS TOOL 9
Datasets – Introduction, Iris plants database, Breast cancer database, Auto
Imports Database - Introduction to WEKA - Explorer – Getting started,
Exploring the Explorer - Learning algorithms - Clustering algorithms -
Association–Rule Learners.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Jiawei Han and MichelineKamber, “Data Mining Concepts and Techniques”,
Third Edition, Elsevier, 2012.
2. Alex Berson and Stephen J.Smith, “Data Warehousing, Data Mining &
OLAP”, Tata McGraw – Hill Edition, 35th Reprint 2016.

REFERENCES:
1. K.P. Soman, ShyamDiwakar and V. Ajay, “Insight into Data Mining Theory
and Practice”, Eastern Economy Edition, Prentice Hall of India, 2006.
2. Ian H.Witten and Eibe Frank, “Data Mining: Practical Machine Learning
Tools and Techniques”, Elsevier, Second Edition, 2005.
3. Parteek Bhatia, “Data Mining and Data Warehousing: Principles and
Practical Techniques”, Cambridge University Press, 2019.
4. Pranjali Deshpande, Soudamini Patil, “Data Warehousing and Data
Mining”, First Edition, Technical Publications, 2020.
5. Dr. B. Shadaksharappa,Mr. P.Ramkumar,Dr. T.N. Prabakar, “ Data
Warehousing and Data Mining”, First Edition, Book Rivers, 2022.

WEB REFERENCES:
1. https://nptel.ac.in/courses/106/105/106105174/00
2. https://swayam.gov.in/nd1_noc20_cs12/preview
3. https://freevideolectures.com/course/3609/data-warehousing

ONLINE RESOURCES:
1. https://www.tutorialspoint.com/data_mining/index.htm
2. https://www.guru99.com/online-analytical-processing.html
3. https://www.cs.waikato.ac.nz/ml/weka/courses.html
4. https://www.tutorialspoint.com/weka/what_is_weka.htm

OUTCOMES:
Upon completion of the course, the student should be able to
1. Use a Data Warehouse system and perform Business Analysis with OLAP
Tools. (K3)

160
 Syllabus CSE
2. Recognize and identify suitable Pre-processing and Visualization
techniques for Data Analysis. (K1)
3. Apply frequent Pattern and Association Rule Mining techniques for Data
Analysis. (K3)
4. Apply appropriate Classi ication techniques for Data Analysis. (K3)
5. Apply appropriate Clustering techniques for Data Analysis.(K3)
6. Use WEKA tools for feature selection, classi ication and clustering for real
time data.(K3)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 3 3 2 2 1 1 - 2 2 2 2 3 3

CO2 3 3 3 2 2 2 1 - 2 2 2 3 3 2

CO3 3 3 3 3 2 1 1 - 2 2 2 3 3 3

CO4 3 3 3 3 2 2 1 - 2 3 3 3 2 2

CO5 3 2 3 2 3 2 2 - 2 2 2 3 2 3

CO6 3 2 3 2 3 2 2 - 2 2 2 3 2 3

PROFESSIONAL ELECTIVES - I
20CSEL502 L T P C
CYBER FORENSICS
SDG NO. 4&16 3 0 0 3
OBJECTIVES:
l To learn Computer Forensics
l To become familiar with Forensics tools
l To learn to analyze and validate Forensics data
l To study about Ethical Hacking

UNIT I INTRODUCTION TO COMPUTER FORENSICS 9

Introduction to Traditional Computer Crime, Traditional problems associated
with Computer Crime. Introduction to Identity Theft & Identity Fraud. Types
of CF techniques – Incident and incident response methodology – Forensic

161
 Syllabus CSE
duplication and investigation. Preparation for IR: Creating response tool kit
and IR team. – Forensics Technology and Systems – Understanding Computer
Investigation – Data Acquisition.

UNIT II EVIDENCE COLLECTION AND FORENSICS TOOLS 9

Processing Crime and Incident Scenes – Working with Windows and DOS
Systems. Current Computer Forensics Tools: Software/ Hardware Tools.

UNIT III ANALYSIS AND VALIDATION 9

Validating Forensics Data – Data Hiding Techniques – Performing Remote
Acquisition – Network Forensics – Email Investigations – Cell Phone and
Mobile Devices Forensics

UNIT IV ETHICAL HACKING 9

Introduction to Ethical Hacking – Footprinting and Reconnaissance –
Scanning Networks – Enumeration – System Hacking – Malware Threats –
Snif ing

UNIT V ETHICAL HACKING IN WEB 9

Introduction to Ethical Hacking – Common methods used in Ethical hacking –
Social Engineering - Vulnerability Analysis - Web Application Attacks - Cross-
Site Scripting –Injection Attacks – Path traversal – Denial of Service – Man in
the middle attack – Brute force attack – Phishing attack – Web Application
Penetration Testing.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Bill Nelson, Amelia Phillips, Frank En inger, Christopher Steuart,
“Computer Forensics and Investigations”, Cengage Learning, Pearson
India Edition, 2016.
2. “CEH of icial Certi ied Ethical Hacking Review Guide”, Wiley India
Edition, 2015.

REFERENCES:
1. John R.Vacca, “Computer Forensics”, Cengage Learning, 2005.
2. Marjie T.Britz, “Computer Forensics and Cyber Crime: An Introduction”,
Third Edition, Prentice Hall of India, 2013.
3. Ankit Fadia, “Ethical Hacking”, Second Edition, Macmillan India Ltd,
2006.
4. Kenneth C.Brancik, “Insider Computer Fraud Auerbach Publications”,
Taylor & Francis Group, 2008.

162
 Syllabus CSE
5. Marie-Helen Maras, “Computer Forensics: Cybercriminals, Laws, and
Evidence”, Jones & Bartlett Learning; 2nd Edition, 2014.

WEB REFERENCES:
1. https://www.cs.nmt.edu/~df/home.html
2. https://www.cs.nmt.edu/~df/lectures.html
3. https://swayam.gov.in/nd2_ugc19_hs25/preview

ONLINE RESOURCES:
1. https://freevideolectures.com/course/5045/udemy-course-network-
security-course

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand the basics of Computer Forensics. (K1)
2. Apply a number of different Computer Forensic tools to a given
scenario. (K2)
3. Analyze and validate Forensics data. (K3)
4. Describe the concept of Ethical Hacking in different ways. (K2)
5. Identify the Vulnerabilities in a given Network Infrastructure. (K2)
6. Implement Real-world hacking techniques to test System security. (K3)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 1 2 2 - 2 - - - - 2 2 3 1

CO2 2 1 3 3 - 2 - - - - 2 2 2 1

CO3 3 2 3 2 - 2 - - - - 2 2 3 2

CO4 3 2 2 2 1 - - 1 - 2 2 2 3 2

CO5 3 1 3 2 3 3 - - - - 2 2 3 1

CO6 3 1 2 2 3 2 - - 2 3 2 2 3 1

163
 Syllabus CSE
PROFESSIONAL ELECTIVES - I
20CSEL503 L T P C
DISTRIBUTED SYSTEMS
SDG NO. 4 3 0 0 3
OBJECTIVES:
l Understand the foundations of Distributed Systems
l Introduce the idea of Peer-to-Peer services and File System
l Understand in detail the system level and support required for Distributed
Systems
l Understand the issues involved in studying Process and Resource
Management

UNIT I INTRODUCTION 7
Examples Of Distributed Systems–Trends In Distributed Systems – Focus on
Resource Sharing – Challenges - Case Study: World Wide Web.

UNIT II COMMUNICATION IN DISTRIBUTED SYSTEM 10

System Model – Inter Process Communication - The API for Internet Protocols
– External Data Representation and Multicast Communication. Network
Virtualization: Overlay Networks. Case Study: MPI Remote Method Invocation
and Objects: Remote Invocation – Introduction - Request-Reply Protocols -
Remote Procedure Call - Remote Method Invocation. Case Study: Java RMI -
Group Communication - Publish-Subscribe Systems - Message Queues -
Shared Memory Approaches -Distributed Objects - Case Study: Enterprise Java
Beans - From Objects to Components.

UNIT III PEER TO PEER SERVICES AND FILE SYSTEM 10

Peer-to-Peer Systems – Introduction - Napster and Its Legacy - Peer-to-Peer –
Middleware - Routing Overlays. Overlay Case Studies: Pastry, Tapestry-
Distributed File Systems –Introduction - File Service Architecture – Andrew
File System. File System: Features-File Model -File Accessing Models - File
Sharing Semantics Naming: Identi iers, Addresses, Name Resolution – Name
Space Implementation – Name Caches – LDAP.

UNIT IV SYNCHRONIZATION AND REPLICATION 9

Introduction - Clocks, Events and Process States - Synchronizing Physical
Clocks- Logical Time and Logical Clocks - Global States – Coordination and
Agreement – Introduction - Distributed Mutual Exclusion – Elections –
Transactions and Concurrency Control– Transactions - Nested Transactions –
Locks – Optimistic Concurrency Control - Timestamp Ordering – Atomic
Commit Protocols -Distributed Deadlocks – Replication – Case Study – Coda.
164
 Syllabus CSE
UNIT V PROCESS & RESOURCE MANAGEMENT 9
Process Management: Process Migration: Features, Mechanism - Threads:
Models, Issues, Implementation - Resource Management: Introduction-
Features of Scheduling Algorithms – Task Assignment Approach – Load
Balancing Approach – Load Sharing Approach.
TOTAL: 45 PERIODS
TEXT BOOK:
1. George Coulouris, Jean Dollimore and Tim Kindberg, “Distributed Systems
Concepts and Design”, Fifth Edition, Pearson Education India, 2012.
2. Brendan Burns,”Designing Distributed Systems”, O’Reilly Media, 2018.

REFERENCES:
1. Andriy Luntovskyy,Josef Spillner, “Architectural Transformations in
Network Services and Distributed Systems”, Springer Fachmedien
Wiesbaden GmbH, 2017.
2. Pradeep K Sinha, “Distributed Operating Systems: Concepts and Design”,
Prentice Hall of India, 2007.
3. Maarten van Steen Andrew S. Tanenbaum., “Distributed Systems”,
Published by Maarten van Steen This book was previously published by:
Pearson Education, Inc. Edition: 3. Version: 02, 2018.
4. Ajay D. Kshemkalyani and Mukesh Singhal, “ Distributed Computing
Principles, Algorithms and Systems”, Cambridge University Press, 2008.
5. Sukumar Ghosh, “Distributed Systems: An Algorithmic Approach” , Second
Edition, Chapman & Hall/CRC Computer and Information Science Series,
2014.

WEB REFERENCES:
1. https://link.springer.com/book/10.1007/978-3-658-14842-3#about
2. https://www.udemy.com/course/distributed-systems-cloud-computing-
with-java/

ONLINE RESOURCES:
1. https://books.google.co.in/books?id=-bJ3DgAAQBAJ&pg=Pr4&source
=kp_read_button&redir_esc=y#v=onepage&q&f=false
2. https://books.google.co.in/books/about/Distributed_Computing.
html?id=G7SZ32dPuLgC&printsec=frontcover&source=kp_read_button&
redir_esc=y#v=onepage&q&f=false2.

165
 CSE Syllabus
OUTCOMES:
Upon completion of the course, the student should be able to
1. Outline the foundations and issues of distributed systems(K1)
2. Understand the clock synchronisation and message ordering (K2)
3. Analyse the various Group Communication Techniques (K3)
4. Illustrate the distributed mutex and deadlock detection (K2)
5. Evaluating the various recovery and consensus techniques in distributed
systems (K3)
6. Describe the concepts of P2P and distributed shared memory (K2)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 2 2 - 1 1 - - 1 1 2 3 2

CO2 2 3 1 2 - 1 2 - 1 2 1 1 2 3

CO3 3 3 2 2 - 1 1 - 1 2 2 3 3 3

CO4 3 2 1 - - 1 1 - 2 1 1 1 3 2

CO5 2 1 2 1 - 1 - - 2 2 1 2 2 1

CO6 3 3 2 1 - 1 1 - 2 1 2 1 3 3

PROFESSIONAL ELECTIVES - I
20CSEL504 L T P C
FOUNDATION OF DATA SCIENCE
SDG NO. 4 3 0 0 3
OBJECTIVES:
l Able to apply fundamental algorithmic ideas to process data.
l Learn to apply hypotheses and data into actionable predictions.
l Document and transfer the results and effectively communicate the indings
using visualization techniques.

UNIT I INTRODUCTION TO DATA SCIENCE 9

Data science process – roles, stages in data science project – working with data
from iles – working with relational databases – exploring data – managing
data – cleaning and sampling for modeling and validation – introduction to
NoSQL.

166
 Syllabus CSE
UNIT II MODELING METHOD 9
Choosing and evaluating models – mapping problems to machine learning,
evaluating clustering models, validating models – cluster analysis – K-means
algorithm, Naıv̈e Bayes – Memorization Methods – Linear and logistic
regression – unsupervised methods.

UNIT III INTRODUCTION TO R 9

Reading and getting data into R – ordered and unordered factors – arrays and
matrices – lists and data frames – reading data from iles – probability
distributions – statistical models in R - manipulating objects – data
distribution.

UNIT IV MAP REDUCE 9

Introduction – distributed ile system – algorithms using map reduce, Matrix-
Vector Multiplication by Map Reduce – Hadoop - Understanding the Map
Reduce architecture- Writing Hadoop Map Reduce Programs - Loading data
into HDFS - Executing the Map phase - Shuf ling and sorting - Reducing phase
execution.

UNIT V DELIVERING RESULTS 9

Documentation and deployment – producing effective presentations –
Introduction to graphical analysis – plot() function – displaying multivariate
data – matrix plots – multiple plots in one window - exporting graph - using
graphics parameters. Case studies
TOTAL: 45 PERIODS
TEXT BOOK:
1. Nina Zumel, John Mount, “Practical Data Science with R”, Manning
Publications, 2014.
2. Jure Leskovec, Anand Rajaraman, Jeffrey D. Ullman, “Mining of Massive
Datasets”, Cambridge University Press, 2014.

REFERENCES:
1. Mark Gardener, “Beginning R - The Statistical Programming Language”,
John Wiley &Sons, Inc., 2012.
2. W. N. Venables, D. M. Smith and the R Core Team, “An Introduction to R”,
Network Theory Ltd, Second Edition, 2013.
3. Tony Ojeda, Sean Patrick Murphy, Benjamin Bengfort, Abhijit Dasgupta,
“Practical DataScience Cookbook”, Packet Publishing Ltd., 2014.
4. Nathan Yau, “Visualize This: The FlowingData Guide to Design,
Visualization, andStatistics”, Wiley, 2011.
5. Boris lublinsky, Kevin t. Smith, Alexey Yakubovich, “Professional Hadoop
167
 Syllabus CSE
Solutions”,Wiley, ISBN: 9788126551071, 2015.

WEB REFERENCES:
1. http://www.johndcook.com/R_language_for_programmers.html
2. http://bigdatauniversity.com/
3. http://home.ubalt.edu/ntsbarsh/stat-data/topics.htm#rintroduction

ONLINE RESOURCES:
1. https://freevideolectures.com/search/foundation-of-data-science/
2. https://www.simplilearn.com/big-data-and-analytics/senior-data-
scientist-masters-program-training

OUTCOMES:
Upon completion of the course, the student should be able to
1. Develop to obtain, clean/process and transform data.(K1)
2. Analyze and interpret data using an ethically responsible approach.(K3)
3. Use appropriate models of analysis, assess the quality of input, derive
insight from results, and investigate potential issues.(K3)
4. Apply computing theory, languages and algorithms, as well as
mathematical and statistical models, and the principles of optimization to
appropriately formulate and use data analyses. (K3)
5. Formulate and use appropriate models of data analysis to solve hidden
solutions to business-related challenges.(K2)
6. Employ the techniques related to the area of data science in several
statistical analysis methods. (K3)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 1 2 2 - 2 - - - - 2 2 3 2

CO2 3 1 3 2 - 2 - - - - 2 2 3 2

CO3 3 1 3 2 - 2 - - - - 2 2 3 2

CO4 3 1 3 2 3 2 - - - - 2 2 3 2

CO5 3 1 3 2 3 2 - - 2 3 2 2 3 2

CO6 3 1 3 2 3 2 - - 2 3 2 2 3 2

168
 Syllabus CSE

PROFESSIONAL ELECTIVES - I
20CSEL505 L T P C
NOSQL DATABASE
SDG NO. 4 & 9 3 0 0 3
OBJECTIVES:
l To de ine, compare and use the four types of NoSQL Databases
l To demonstrate an understanding of the detailed architecture, de ine
objects, load data, query data and performance tune Column-oriented
NoSQL databases.
l To explain the detailed architecture, de ine objects, load data, query data
and performance tune Document-oriented NoSQL databases.

UNIT I INTRODUCTION TO NoSQL DATABASES 9

Overview of NoSQL Databases -Comparison of relational databases to new
NoSQL stores, MongoDB, Cassandra, HBASE, Neo4j use and deployment,
Application, RDBMS approach, Challenges NoSQL approach, Key-Value and
Document Data Models, Aggregate-Oriented Databases.

UNIT II DATABASE FOR MODERN WEB 9

Replication and sharding, Map Reduce on databases. Distribution Models,
Single Server, Sharding, Master-Slave Replication, Peer-to-Peer Replication,
Combining Sharding and Replication Document Databases ,Scaling, Suitable
Use Cases,Web Analytics or Real-Time Analytics, E-Commerce Applications,
Complex Transactions Spanning Different Operations, Queries against Varying
Aggregate Structure

UNIT III COLUMN- ORIENTED NOSQL DATABASES 9

Column- oriented NoSQL databases using Apache HBASE, Column-oriented
NoSQL databases using Apache Cassandra, Architecture of HBASE, Column-
Family Data Store, Features, Consistency, Transactions, Availability, Query
Features, Scaling, Suitable Use Cases, Event Logging, Content Management
Systems, Blogging Platfo rms, Counters, Expiring Usage.

UNIT IV KEY VALUE DATABASE DESIGNS 9

NoSQL Key/Value databases using Riak, Key-Value Databases, Key-Value Store,
Key-Value Store Features, Consistency, Transactions, Query Features,
Structure of Data, Scaling, Suitable Use Cases, Storing Session Information,
User Pro iles, Preferences, Shopping Cart Data, Relationships among Data,
Multi operation Transactions, Query by Data, Operations by Sets.

169
 Syllabus CSE
UNIT V GRAPH DATABASE DESIGN 9
Graph NoSQL databases using Neo4,NoSQL database development tools and
programming languages, Graph Databases, Features, Consistency,
Transactions, Availability, Query Features, Scaling, Suitable Use Cases,
Connected Data, Routing, Dispatch, and Location-Based Services,
Recommendation Engines.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Pramod J. Sadalage & Martin Fowler ,"NoSQL Distilled: A Brief Guide to the
Emerging World of Polyglot Persistence", Addison- Wesley, Fist Edition,
2013.
2. Andreas Meier & Michael Kaufmann, “SQL & NoSQL Databases: Models,
Languages, Consistency Options and Architectures for Big Data
Management”, Springer 2019.

REFERENCES:
1. Redmond, E. & Jim Wilson R . "A Guide to Modern Databases and the NoSQL
Movement Edition," Second Edition, 2018.
2. "MongoDB: The De initive Guide (2nd ed.). Upper Saddle River", NJ:
Pearson Education India, Inc. ISBN-13: 978-1449344689 ISBN-10:
1449344682.
3. Andreas Meier, Michael Kaufmann, “SQL & NoSQL Databases Models,
languages, Consistency options and architectures for big data
management”, Springer Vieweg, 2019.
4. Shashank Tiwari, “Professional NoSQL”, Wrox, 2011.
5. Dan Sullivan, “NoSQL for Mere Mortals”, Addison Wesley, 2015.

WEB REFERENCES:
1. https://www.mongodb.com/nosql-explained
2. https://en.wikipedia.org/wiki/NoSQL
3. h t t p s : / / d o c s . m i c r o s o f t . c o m / e n - u s / d o t n e t / a r c h i t e c t u r e /
microservices/microservice-dddcqrs-patterns/nosql-database-
persistence-infrastructure

ONLINE RESOURCES:
1. https://www.w3resource.com/mongodb/nosql.php
2. https://www.couchbase.com/resources/why-nosql

170
 Syllabus CSE
OUTCOMES:
Upon completion of the course, the student should be able to
1. Evaluate NoSQL database development tools and programming
languages.(K1)
2. Demonstrate an understanding of the detailed architecture, de ine
objects, load data, query data and performance tune Column-oriented
NoSQL databases.(K1)
3. De ine, compare and use the four types of NoSQL Databases (Document-
oriented, KeyValue Pairs, Column-oriented and Graph).(K3)
4. Perform hands-on NoSql database lab assignments by using the four
NoSQL database types via products such as Cassandra, Hadoop Hbase,
MongoDB, and Neo4J.(K3)
5. Perform CRUD operations (create, read, update and delete) on data in
NoSQL environment.(K5)
6. Explore the emergence, requirements and bene its of a NoSQL database.
(K4)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 2 2 - - - - - - - 3 2

CO2 3 3 2 2 3 - - - - 1 - - 3 3

CO3 3 3 3 2 3 1 - - 2 2 - - 2 2

CO4 3 3 3 3 3 2 - - - 3 - - 3 2

CO5 3 3 3 2 3 - - - - 1 - - 2 2

CO6 3 3 2 2 2 2 - - 2 3 - - 3 2

PROFESSIONAL ELECTIVES - I
20ITEL601 L T P C
SOFTWARE TESTING
SDG NO. 4 & 9 3 0 0 3
OBJECTIVES:
l To learn the criteria and design of Test Cases
l To learn the design of Test Cases
l To understand Test Management and Test Automation Techniques
l To apply Test Metrics and Measurements

171
 Syllabus CSE
UNIT I INTRODUCTION 9
Testing as an Engineering Activity – Testing as a Process – Testing Maturity
Model - Basic De initions – Software Testing Principles – The Tester's Role in a
Software Development Organization – Origins of Defects – Cost of Defects –
Defect Classes – The Defect Repository and Test Design – Defect Examples-
Developer/Tester Support of Developing a Defect Repository.

UNIT II TEST CASE DESIGN STRATEGIES 9

Test Case Design Strategies – Using Black Box Approach to Test Case Design –
Boundary Value Analysis – Equivalence Class Partitioning – State Based
Testing – Cause-Effect Graphing – Compatibility Testing – User
Documentation Testing – Domain Testing - Random Testing – Requirements
Based Testing – Using White Box Approach to Test design – Test Adequacy
Criteria – Static Testing Vs. Structural Testing – Code Functional Testing –
Coverage and Control Flow Graphs – Covering Code Logic – Paths – Code
Complexity Testing – Additional White Box Testing Approaches.

UNIT III LEVELS OF TESTING 9

The Need for Levels of Testing – Unit Test – Unit Test Planning – Designing the
Unit Tests – The Test Harness – Running the Unit Tests and Recording Results –
Integration Tests – Designing Integration Tests – Integration Test Planning –
Scenario Testing – Defect Bash Elimination System Testing – Acceptance
Testing – Performance Testing – Regression Testing – Internationalization
Testing – Ad Hoc Testing – Alpha, Beta Tests – Testing Object Oriented Systems
– Usability and Accessibility Testing – Con iguration Testing – Compatibility
Testing – Testing the Documentation – Website Testing.

UNIT IV TEST MANAGEMENT 9

People and Organizational Issues in Testing – Organization Structures for
Testing Teams – Testing Services – Test Planning – Test Plan Components –
Test Plan Attachments – Locating Test Items – Test Management – Test
Process – Reporting Test Results – Introducing the Test Specialist – Skills
Needed by a Test Specialist – Building a Testing Group- The Structure of
Testing Group - The Technical Training Program.

UNIT V TEST AUTOMATION 9

Software Test Automation – Skills needed for Automation – Scope of
Automation – Design and Architecture for Automation – Requirements for a
Test Tool – Challenges in Automation – Test Metrics and Measurements –
Project, Progress and Productivity Metrics.
TOTAL : 45 PERIODS

172
 Syllabus CSE
TEXT BOOKS:
1. Srinivasan Desikan and Gopalaswamy Ramesh, “Software Testing –
Principles and Practices”, Pearson Education, 2006.
2. Ron Patton, “Software Testing Second Edition”, Sams Publishing, Pearson
Education, 2007.

REFERENCES:
1. Ilene Burnstein, “Practical Software Testing”, Springer International
Edition, 2003.
2. Edward Kit, “Software Testing in the Real World – Improving the Process”,
Pearson Education, 1995.
3. Boris Beizer, “Software Testing Techniques” 2nd Edition, Van Nostrand
Reinhold, New York, 1990.
4. Aditya P. Mathur “Foundations of Software Testing - Fundamental
Algorithms and Techniques”, Dorling Kindersley (India) Pvt. Ltd., Pearson
Education, 2008.
5. Naresh chauhan-software testing principles and practices,2nd
edition,oxford University Press, 2017.

WEB REFERENCES :
1. https://nptel.ac.in/courses/106/105/106105150/

ONLINE RESOURCES:
1. https://www.javatpoint.com/software-testing-tutorial
2. https://www.toolsqa.com/software-testing-tutorial/

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand about the Software Testing Principles and Defect Classes(K2)
2. Apply test cases suitable for software development for different
domains(K3)
3. Discuss the various Levels of Testing (K2)
4. Identify suitable tests to be carried out.(K2)
5. Discuss the concepts of Test plan and its skill set(K2)
6. Apply automatic testing tools and discuss the various test metrics and
measurements.(K3)

173
 Syllabus CSE
CO- PO, PSO MAPPING:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 1 - - - - - - - - 2 - 2 3

CO2 2 3 3 - - - - - 2 - 1 - 3 3

CO3 2 3 3 - - - - - 3 - 1 2 3 3

CO4 2 3 3 - - - - - 3 - 3 3 3 3

CO5 - 2 1 - - - - - 2 - 2 - 3 3

CO6 3 2 2 - - - - - 1 2 2 2 3 3

PROFESSIONAL ELECTIVES - I
20ITEL706 L T P C
COMPUTER GRAPHICS AND MULTIMEDIA
SDG NO. 4 & 9 3 0 0 3

OBJECTIVES:
l To gain knowledge about Graphics Hardware Devices and Software used
l To understand the 2D/3D Graphics and their Transformations
l To get knowledge about various Object representation methods and Visible
Surface Detection methods
l To study the Multimedia concepts and various I/O technologies

UNIT I OUTPUT PRIMITIVES AND 2D GRAPHICS 9

Graphics Devices- Line − Curve and Ellipse Drawing Algorithms − Examples –
Applications – Attributes − Input Techniques - 2D Geometric Transformations
– 2D Clipping And Viewing.

UNIT II 3D GRAPHICS 9
3D Geometric and Modeling Transformations – Translation - Rotation -
Scaling- Composite Transformations - 3D Viewing – Viewing Pipeline -
Viewing Coordinates - Projections - Clipping - Visible Surface Detection
Methods.

UNIT III ILLUMINATION, COLOR MODELS AND ANIMATION 9

Light Sources - Basic Illumination Models – Halftone Patterns and Dithering
Techniques- Properties of Light - Standard Primaries and Chromaticity
Diagram; Intuitive Colour Concepts - RGB Colour Model - YIQ Colour Model -

174
 Syllabus CSE
CMY Colour Model - HSV Colour Model - HLS Colour Model - Colour Selection-
Virtual Reality - Animation.

UNIT IV MULTIMEDIA SYSTEMS DESIGN AND FILE HANDLING 9

Multimedia Basics − Multimedia Applications − Multimedia System
Architecture - De ining Objects for Multimedia Systems − Multimedia
Data Interface Standards − Multimedia Databases - Compression and
Decompression − Data and File Format Standards − Digital Voice and Audio −
Video Image and Animation − Full Motion Video − Storage and Retrieval
Technologies.

UNIT V HYPERMEDIA 9
Multimedia Authoring and User Interface - Hypermedia Messaging -Mobile
Messaging − Hypermedia Message Component − Creating Hypermedia
Message − Integrated Multimedia Message Standards − Integrated
Document Management − Distributed Multimedia Systems - Case Study:
Blender Graphics -Blender Fundamentals–Drawing Basic Shapes – Modelling
– Shading & Textures
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Donald Hearn and Pauline Baker M, “Computer Graphics", Prentice Hall,
New Delhi,2007
2. Andleigh, P. K and KiranThakrar, “Multimedia Systems and Design”, PHI,
2003.

REFERENCES:
1. Judith Jeffcoate, “Multimedia in practice: Technology and Applications”,
PHI, 1998.
2. Foley, Vandam, Feiner and Hughes, “Computer Graphics: Principles and
Practice”, 2nd Edition, Pearson Education, 2003.
3. Jeffrey McConnell, “Computer Graphics: Theory into Practice”, Jones and
Bartlett Publishers,2006.
4. Hill F S Jr., "Computer Graphics", Maxwell Macmillan , 1990.
5. Peter Shirley, Michael Ashikhmin, Michael Gleicher, Stephen R Marschner,
Erik Reinhard, KelvinSung, and AK Peters, “Fundamentals of Computer
Graphics”, CRC Press, 2010.
6. William M. Newman and Robert F.Sproull, “Principles of Interactive
Computer Graphics”, McGraw Hill 1978.

175
 Syllabus CSE
WEB REFERENCES:
1. https://www.blender.org/support/tutorials
2. http://www.doc.ic.ac.uk/~dfg/graphics/graphics.html
3. http://www.nptelvideos.in/2012/11/computer-graphics.html
4. http://cs.wellesley.edu/~cs110/lectures/M01-color/graphics.pdf

ONLINE RESOURCES:
1. www.scratchapixel.com
2. http://dl. inebook.ir/book/9e/11032.pdf
3. https://www.blender.org/support/tutorials

4. https://ocw.mit.edu/courses/electrical-engineering-and-computer-
science/6-837-computer-graphics-fall-2012/download-course-
materials

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand the concept of various Output Primitives,Illumination and
Color Models (K2)
2. Demonstrate 2D transformations, viewing and clipping techniques (K3)
3. Illustrate various 3D Object representations, transformations,Projections
and detect the Visible surfaces. (K3)
4. Understand Multimedia System Architecture, Data Interface standards
and Databases (K2)
5. Interpret various Multimedia design and File Formats. (K2)
6. Demonstrate basic 3D Scenes using Blender Graphics in hypermedia
messages. (K3)

CO-PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 - - - - - - - - - - - - -

CO2 2 2 - - - - - - - - - - - -

CO3 1 2 - - - 2 - - 1 1 - 1 - -

CO4 - - - - - - - - 2 2 1 2 - 1

CO5 - - 1 - - - - - 2 2 1 2 - 1

CO6 - 1 1 - 2 1 2 - 2 2 1 2 1 2
176
 Syllabus CSE

PROFESSIONAL ELECTIVES - I
20ITEL702 WIRELESS ADHOC AND SENSOR L T P C
SDG NO. 4,7&9 NETWORKS 3 0 0 3

OBJECTIVES:
l To introduce the concepts of Ad Hoc network
l To address the MAC protocol and its issues
l To explain the knowledge about Routing protocol and Transport layer
l To comprehend the concepts of WSN Routing and QoS

UNIT I INTRODUCTION 9
Fundamentals of Wireless Communication Technology - The Electromagnetic
Spectrum - Radio Propagation Mechanisms - Characteristics of the Wireless
Channel Mobile Ad Hoc Networks (MANETs) - 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 ADHOC WIRELESS NETWORKS 9

Issues in Designing a MAC Protocol - Issues in Designing a MAC Protocol for
Ad Hoc Wireless Networks - Design Goals of a MAC Protocol for Ad Hoc
Wireless Networks - Classi ication of MAC Protocols - Contention Based
Protocols - Contention Based Protocols with Reservation Mechanisms -
Contention Based Protocols with Scheduling Mechanisms - Multi Channel
MAC - IEEE 802.11.

UNIT III ROUTING PROTOCOLS AND TRANSPORT LAYER IN

AD HOC WIRELESS NETWORK 9
Routing Protocol: Issues in Designing a Routing Protocol for Ad Hoc Networks
- Classi ication- Proactive Routing - Reactive Routing (On-Demand)-
Hybridrouting-Transport Layer Protocol for Ad Hoc Networks - Design Goals
of a Transport Layer Protocol for Ad Hoc Wireless Networks - Classi ication of
Transport Layer Solutions - TCP over Ad Hoc Wireless - Network Security -
Security in Ad Hoc Wireless Networks - Network Security Requirements

UNIT IV WIRELESS SENSOR NETWORKS AND MAC PROTOCOLS 9

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.

177
 Syllabus CSE
UNIT V WSN ROUTING, LOCALIZATION AND QoS 9
Issues in WSN Routing – OLSR - Localization – Indoor and Sensor Network
Localization - Absolute and Relative Localization- Triangulation- QoS in WSN-
Energy Ef icient Design–Synchronization.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. C. Siva Ram Murthy, and B. S. Manoj, "Ad Hoc Wireless Networks:
Architectures and Protocols ", Pearson Education, 2008.
2. Labiod. H, “Wireless Ad Hoc and Sensor Networks”, Wiley, 2008.

REFERENCES:
1. Carlos De MoraisCordeiro, Dharma PrakashAgrawal “Ad Hoc & Sensor
Networks: Theory and Applications”, World Scienti ic Publishing
Company, 2nd edition, 2011.
2. Holger Karl and Andreas Willig “Protocols and Architectures for Wireless
Sensor Networks”, Wiley, 2005 .
3. Kazem Sohraby, Daniel Minoli & Taieb Znati, “Wireless Sensor Networks
Technology, Protocols and Application”, John Wiley,2007.
4. Li, X, “Wireless Ad Hoc and Sensor Networks: Theory and Applications”,
Cambridge University Press, 2008.

WEB REFERENCES:
1. www.wirelessnetworksonline.com
2. www.securityinwireless.com
3. www.ida.liu.se/~petel71/SN/lecture-notes/sn.pdf

ONLINE RESOURCES:
1. https://nptel.ac.in/courses/106105160/
2. https://www.classcentral.com/course/swayam-wireless-ad-hoc-and-
sensor-networks-7888

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand the fundamental concepts and applications of Ad Hoc and
wireless sensor networks. (K1)
2. Explain the MAC protocol of Ad Hoc networks. (K2)
3. Explain Routing protocols for Ad Hoc Wireless networks with respect to
TCP design issues. (K3)
4. Explain the concepts of Network architecture and MAC layer protocol for
WSN in different scenarios. (K3)
178
 Syllabus CSE
5. Explore the WSN routing issues by considering QoS measurements. (K3)
6. Apply Routing protocols in the different scenarios of WSN and compare
the performance metrics. (K3)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 2 1 - 1 - - - - 1 1 3 1

CO2 3 2 2 1 1 2 - - - - 2 1 3 1

CO3 3 2 2 2 1 1 - - - - 1 1 3 1

CO4 3 2 2 2 1 2 - - - - 1 1 3 1

CO5 3 2 2 2 1 1 - - - - 1 1 3 1

CO6 3 3 2 3 1 2 - - - - 1 1 3 1

PROFESSIONAL ELECTIVES - I
20ITEL804 L T P C
DIGITAL IMAGE PROCESSING
SDG NO. 4 & 9 3 0 0 3
OBJECTIVES:
l To get exposed to simple Image Enhancement techniques in Spatial and
Frequency domain
l To learn concepts of Degradation function and Restoration techniques
l To study the Image Segmentation and Representation techniques
l To become familiar with Image Compression and Recognition methods

UNIT I DIGITAL IMAGE FUNDAMENTALS 9

Steps in Digital Image Processing – Components – Elements of Visual
Perception – Image Sensing and Acquisition – Image Sampling and
Quantization – Relationships Between Pixels - Color Image Fundamentals -
RGB - HSI Models - Two Dimensional Mathematical Preliminaries - 2D
transforms - DFT- DCT.

UNIT II IMAGE ENHANCEMENT 9

Spatial Domain: Gray Level Transformations – Histogram Processing – Basics
of Spatial Filtering– Smoothing and Sharpening Spatial Filtering - Frequency
Domain: Introduction to Fourier Transform– Smoothing and Sharpening
Frequency Domain Filters – Ideal - Butterworth and Gaussian Filters -
Homomorphic Filtering - Color Image Enhancement.
179
 Syllabus CSE
UNIT III IMAGE RESTORATION 9
Image Restoration - Degradation Model - Properties - Noise Models – Mean
Filters – Order Statistics – Adaptive Filters – Band Reject Filters – Band Pass
Filters – Notch Filters – Optimum Notch Filtering – Inverse Filtering – Wiener
Filtering.

UNIT IV IMAGE SEGMENTATION 9

Edge Detection - Edge Linking Via Hough Transform – Thresholding - Region
Based Segmentation – Region Growing – Region Splitting and Merging –
Morphological Processing - Erosion and Dilation - Segmentation by
Morphological Watersheds – Basic Concepts – Dam Construction – Watershed
Segmentation Algorithm.

UNIT V IMAGE COMPRESSION AND RECOGNITION 9

Need For Data Compression - Huffman - Run Length Encoding - Shift Codes -
Arithmetic Coding - JPEG Standard - MPEG - Boundary Representation -
Boundary Description - Fourier Descriptor - Regional Descriptors –
Topological Feature, Texture - Patterns and Pattern Classes - Recognition
Based on Matching.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Rafael C. Gonzalez, Richard E. Woods, “Digital Image Processing”,
Pearson, Third Edition, 2010.
2. Anil K. Jain, “Fundamentals of Digital Image Processing”, Pearson, 2002

REFERENCES:
1. Kenneth R. Castleman, “Digital Image Processing” , Pearson, 2006.
2. Rafael C. Gonzalez, Richard E. Woods, Steven Eddins, “Digital Image
Processing using MATLAB”, Pearson Education, Inc., 2011.
3. D.E. Dudgeon and RM. Mersereau, “Multidimensional Digital Signal
Processing”, Prentice Hall Professional Technical Reference, 1990
4. Wlliam K. Pratt, “Digital Image Processing”, John Wiley, New York,2002
5. Milan Sonka, Vaclav Hlavac, Roger Boyle, "Image Processing, Analysis,
and Machine Vision", Fourth Edition, Cengage Learning, 2013.
6. S. Sridhar, “Digital Image Processing”, Oxford University Press, 2016.

WEB REFERENCES:
1. https://www.geeksforgeeks.org/digital-image-processing-basics/
2. https://towardsdatascience.com/introduction-to-images-
c9c7abe6bfd2

180
 Syllabus CSE
OUTCOMES:
Upon completion of the course, the student should be able to
1. Summarize the fundamentals of Digital Image Processing (K2)
2. Use spatial domain and frequency domain ilters for Image Enhancement
(K3)
3. Distinguish all the image restoration methods (K2)
4. Demonstrate various image segmentation algorithms (K3)
5. Interpret various image compression and recognition techniques (K3)
6. Experiment the real world images with all the digital image processing
techniques (K3)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 1 - - - - - - - - - 1 1 1

CO2 3 2 1 - - - - - - - - 1 1 2

CO3 2 1 - - - - - - - - 1 1 1 1

CO4 3 2 1 - - - - - - - - 1 1 2

CO5 3 2 1 - - - - - - - - 1 1 2

CO6 3 2 1 - 1 - - 1 - 1 1 1 1 2

PROFESSIONAL ELECTIVES - I
20ITEL709 L T P C
INTERNET OF THINGS
SDG NO. 4,9,11&12 3 0 0 3

OBJECTIVES:
l To understand Smart Objects, IoT Architectures and IoT protocols
l To build simple IoT Systems using Arduino and Raspberry Pi
l To understand Data Analytics and Cloud in the context of IoT
l To develop IoT infrastructure for popular applications

UNIT I FUNDAMENTALS OF INTERNET OF THINGS 9

Evolution of Internet of Things - Enabling Technologies – IoT Architectures:
oneM2M - IoT World Forum (IoTWF) and Alternative IoT models – Simpli ied
IoT Architecture and Core IoT Functional Stack - Fog, Edge and Cloud in IoT –
Functional Blocks of an IoT Ecosystem – Sensors - Actuators - Smart Objects
and Connecting Smart Objects.
181
 Syllabus CSE
UNIT II IOT PROTOCOLS 9
IoT Access Technologies - Physical and MAC Layers - Topology and
Security of IEEE 802.15.4,802.15.4g, 802.15.4e, 1901.2a, 802.11ah and
LoRaWAN – Network Layer - IP Versions - Constrained Nodes and Constrained
Networks – Optimizing IP for IoT - From 6LoWPAN to 6Lo - Routing Over Low
Power and Lossy Networks – Application Transport Methods - S u p e r v i s o r y
Control and Data Acquisition – Application Layer Protocols - CoAP and MQTT.

UNIT III DESIGN AND DEVELOPMENT 9

Design Methodology - Embedded Computing Logic - Microcontroller - System
on Chips - IoT System Building Blocks - Arduino - Board Details - IDE
Programming - Raspberry Pi - Interfaces and Raspberry Pi with Python
Programming.

UNIT IV DATA ANALYTICS AND SUPPORTING SERVICES 9

Structured Vs Unstructured Data and Data in Motion Vs Data in Rest – Role of
Machine Learning – No SQL Databases – Hadoop Ecosystem – Apache Ka ka,
Apache Spark – Edge Streaming Analytics and Network Analytics – Xively
Cloud for IoT, Python Web Application Framework – Django – AWS for IoT –
System Management with NETCONF-YANG

UNIT V CASE STUDIES/INDUSTRIAL APPLICATIONS 9

Cisco IoT System - IBM Watson IoT Platform – Manufacturing - Converged
Plantwide Ethernet Model (CPwE) – Power Utility Industry – GridBlocks
Reference Model - Smart and Connected Cities - Layered Architecture - Smart
Lighting - Smart Parking Architecture and Smart Traf ic Control
TOTAL: 45 PERIODS
TEXT BOOK:
1. David Hanes, Gonzalo Salgueiro, Patrick Grossetete, Rob Barton and
Jerome Henry, “IoT Fundamentals: Networking Technologies, Protocols
and Use Cases for Internet of Things”, Cisco Press, 2017.
2. Rajkamal,”Internet of Things: Architecture, Design Principles And
Applications”,McGraw Hill HigherEducation,2017.

REFERENCES:
1. ArshdeepBahga, VijayMadisetti, “Internet of Things – A Hands-on
approach”, Universities Press, 2011.
2. Olivier Hersent, David Boswarthick, Omar Elloumi, “The Internet of
Things – Key Applications and Protocols”, Wiley, 2012.
3. Jan Holler, Vlasios Tsiatsis, Catherine Mulligan, Stamatis, Karnouskos,
Stefan Avesand and David Boyle, "From Machine-to-Machine to the

182
 Syllabus CSE
Internet of Things and Introduction to a New Age of Intelligence",
Elsevier, 2014.
4. Dieter Uckelmann, Mark Harrison, Michahelles, Florian (Eds),
“Architecting the Internet of Things”, Springer, 2011.
5. Michael Margolis, Arduino Cookbook, “Recipes to Begin, Expand and
Enhance Your Projects, 2nd Edition, O'Reilly Media, 2011.

WEB REFERENCES:
1. https://www.arenasolutions.com/blog/10-valuable-iot-web-
resources/
2. https://nevonprojects.com/iot-projects/
3. https://www.sky ilabs.com/blog/list-of-latest-iot-projects-for-
engineering-students

ONLINE RESOURCES:
1. https://www.arenasolutions.com/blog/10-valuable-iot-web-
resources/
2. https://nevonprojects.com/iot-projects/

OUTCOMES:
Upon completion of the course, the student should be able to
1. Interpret the concept of IoT ,its Components and its architecture.(K2)
2. Learn the design methods of various protocols.(K2)
3. Build the design methodology for a IoT system using Raspberry.(K3)
4. Apply the Data analytics and Support servicing tool related to IoT.(K3)
5. Experiment the case study and application of IoT in real time
scenario.(K3)
6. Illustrate the solutions for various distributed applications using the Big
data technologies.(K3)

CO- PO,PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 3 1 2 1 0 0 0 0 0 2 3 2 2

CO2 2 3 1 2 1 0 0 0 0 0 2 3 2 2

CO3 3 2 3 0 3 0 0 0 0 0 2 1 3 3

CO4 2 3 2 3 2 0 0 0 0 0 1 1 3 3

CO5 2 3 3 3 2 2 2 2 1 2 1 2 3 3

CO6 2 3 3 3 3 2 3 2 1 2 1 2 3 3
183
 Syllabus CSE

PROFESSIONAL ELECTIVES - I
20MGEL707 L T P C
INTELLECTUAL PROPERTY RIGHTS
SDG NO. 4,8,9,12 3 0 0 3
OBJECTIVES:
l To get an introductory insight about the IPR in national and international
context.
l To understand the procedures for IPR, registration and its eforcement.

UNIT I INTRODUCTION 9
Intellectual property: Introduction, Meaning, Nature and significance types of
intellectual property, importance of intellectual property rights, Protection of
human innovations by IPR such as Patents, Trademarks, Copyright, Industrial
Designs Geographical Indications, and Trade Secrets

UNIT II AGREEMENTS AND TREATIES 9

International Treaties and Conventions on IPRs, TRIPS Agreement, PCT
Agreement, Patent Act of India, General agreement on trade and tariff (GATT),
Ben convention, Rome convention ,Role of WTO and WIPO

UNIT III PATENTS 9

Concept of Patent – Historical view of Patent system in India and International
Scenario, patent searching process, ownership rights and transfer,
compulsory licenses, Procedure for filing of patents, Grants of patent ,
Benchmarks for patentability of inventions, Recent key changes and
development.

UNIT IV TRADEMARKS AND COPYRIGHTS 9

Concept of Trademarks and copyrights – Rationale behind the protection-
Purpose, function and acquisition, ownership issues, Procedure for
Registration, Industrial design and integrated circuits, protection of
geographical indications and plant varieties, Recent Trends in copyrights and
Trademark., Trade secrets -liability for misappropriations of trade secrets

UNIT V LEGAL ASPECTS AND NEW DEVELOPMENTS 9

Infringements of patents– Criteria of Infringement – Modes of Infringement-
remedies and modification Protection against unfair competition,
enforcement of intellectual property rights, Intellectual property audits, New
developments of intellectual property, Impact of international instruments

184
 Syllabus CSE

relating to the protection of intellectual properties Future of IPR in National

and International levels.
TOTAL: 45 PERIODS

TEXT BOOKS:
1. S.V. Satarkar, Intellectual Property Rights and Copy Rights, Ess Ess
Publications, New Delhi, 2002.
2. V. Scople Vinod, Managing Intellectual Property, Prentice Hall of India
pvt Ltd, 2012
3. P.Narayanan, Intellectual property rights Eastern law house-2018 3rd
Edition (revised and updated)
4. Deborah, E. Bouchoux, Intellectual property right, Cengage learning-
2018 5th Edition

REFERENCES
1. Sterling, J. L. A., World copyright law, (2008) 3rd Edition, London, Sweet
& Maxwell
2. GP Reddy, Intellectual property rights & other laws, Gogia law agency
3. Barrett, Margreth, Intellectual Property, (2009) 3rd Edition, New York
Aspen publishers
4. Inventing the Future: An introduction to Patents for small and medium
sized Enterprises; WIPO publication
5. Cornish, William Intellectual Property: Patents, Copyright, Trademarks
and allied rights, (2010) 7th Edition, London Sweet & Maxwell.
6. Kankanala and Kalyan.C : Indian Patent Law and Practice (2010), India,
Oxford University Press

WEB RESOURCES:
1. https://www.wipo.int/edocs/lexdocs/laws/en/ws/ws020en.pdf
2. http://caaa.in/Image/34_Hb_on_IPR.pdf
3. http://www.ipindia.nic.in/patents.htm
4. http://www.ipindia.nic.in/trade-marks.htm
5. https://assets.publishing.service.gov.uk/government/uploads/
system/uploads/attachment_data/file/627956/IP-Rights-in-India.pdf
6. https://economictimes.indiatimes.com/small-biz/resources/startup-
handbook/intellectual-property-rights- registration/articleshow/
59126802.cms?from=mdr

185
ONLINE RESOURCES:
1. https://www.coursera.org/learn/introduction-intellectual-property
2. https://www.edx.org/course/intellectual-property-law-and-policy-
part-1
3. https://www.classcentral.com/tag/intellectual-property
4. https://swayam.gov.in/nd1_noc19_mg58/preview

OUTCOMES:
Upon completion of the course, the students will be able to:
1 Describe the concepts of Intellectual property rights. (K2)
2 Explain the agreements and treaties of Intellectual property rights. (K2)
3 Identify the needs and avenues for patents. (K2)
4 Discuss the necessity of Trade marks and Copy rights. (K2)
5 Explain the legal context and developments of Intellectual property
rights. (K2)

CO - PO, PSO MAPPING

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 1 1 1 - 1 1 1 1 1 - - 1 2 1

CO2 3 1 3 1 2 - 1 1 - - - 1 2 1

CO3 1 1 2 2 2 - 1 1 - - - 1 1 1

CO4 2 1 1 2 2 - 1 1 - - - 1 1 2

CO5 1 1 1 2 2 2 1 1 - - - 1 2 2
 Syllabus CSE

PROFESSIONAL ELECTIVES - II
20CSEL601 L T P C
SOFTWARE PROJECT MANAGEMENT
SDG NO. 4 3 0 0 3

OBJECTIVES:
l To understand the Software Project Planning and Evaluation techniques
l To plan and manage projects at each stage of the Software Development Life
Cycle (SDLC)
l To learn about the Activity Planning and Risk management principles
l To manage Software Projects and control Software deliverables

UNIT I PROJECT EVALUATION AND PROJECT PLANNING 9

Importance of Software Project Management – Activities - Methodologies –
Categorization of Software Projects – Setting Objectives – Management
Principles – Management Control – Project Portfolio Management – Cost-
Bene it Evaluation Technology – Risk Evaluation – Strategic Program
Management – Stepwise Project Planning.

UNIT II PROJECT LIFE CYCLE AND EFFORT ESTIMATION 9

Software Process and Process Models – Choice of Process Models - Rapid
Application Development – Agile Methods – Dynamic System Development
Method – Extreme Programming– Managing Interactive Processes – Basics of
Software Estimation – Effort and Cost Estimation Techniques – COSMIC Full
Function Points - COCOMO II - a Parametric Productivity Model.

UNIT III ACTIVITY PLANNING AND RISK MANAGEMENT 9

Objectives of Activity Planning – Project Schedules – Activities – Sequencing
and Scheduling – Network Planning Models – Formulating Network Model –
Forward Pass & Backward Pass Techniques – Critical Path (CPM) Method –
Risk Identi ication – Assessment – Risk Planning –Risk Management – PERT
Technique – Monte Carlo Simulation – Resource Allocation – Creation of
Critical paths – Cost Schedules.

UNIT IV PROJECT MANAGEMENT AND CONTROL 9

Framework for Management and Control – Collection of Data – Visualizing
Progress – Cost Monitoring – Earned Value Analysis – Prioritizing Monitoring –
Project Tracking – Change Control – Software Con iguration Management –
Managing Contracts – Contract Management.

187
 Syllabus CSE
UNIT V STAFFING IN SOFTWARE PROJECTS 9
Managing People – Organizational Behavior – Best Methods of Staff Selection
– Motivation – The Oldham – Hackman Job Characteristic Model – Stress –
Health and Safety – Ethical and Professional Concerns – Working in Teams –
Decision Making – Organizational Structures – Dispersed and Virtual Teams –
Communications Genres – Communication Plans – Leadership.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Bob Hughes, Mike Cotterell and Rajib Mall, “Software Project
Management”, Tata McGraw Hill, New Delhi, Fifth Edition, 2012.
2. Robert K. Wysocki, “Effective Software Project Management”, Wiley
Publication, 2011."

REFERENCES:
1. Walker Royce, “Software Project Management”, Addison-Wesley, 1998.
2. Gopalaswamy Ramesh, “Managing Global Software Projects”, McGraw
Hill Education (India), Fourteenth Reprint 2013.
3. Royce, “Software Project Management”, Pearson Education, 1999.
4. Jalote, “Software Project Manangement in Practive”, Pearson Education,
2002.
5. Shailesh Mehta, "Project Management and Tools & Technologies – An
overview ",SPD First Edition, 2017

WEB REFERENCES:
1. https://swayam.gov.in/nd2_cec20_mg07/preview
2. https://onlinecourses.nptel.ac.in/noc19_cs70/preview

ONLINE RESOURCES:
1. https://www.edx.org/learn/project-management
2. https://opentextbc.ca/projectmanagement/chapter/chapter-16-risk-
management-planning-project-management/

OUTCOMES:
Upon completion of the course, the students should be able to
1. Understand Project Management principles while developing software.
(K2)
2. Gain extensive knowledge about the basic project management concepts,
framework and the process models. (K3)
3. Obtain adequate knowledge about software process models and
software effort estimation techniques. (K3)
4. Estimate the risks involved in various project activities. (K3)
188
 CSE
Syllabus
5. De ine the checkpoints, project reporting structure, project progress and
tracking mechanisms using project management principles(K1)
6. Learn the staff selection process and the issues related to people
management and determine an appropriate project management
approach through an evaluation of the business context and scope of the
project.(K3)

CO-PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 1 - - - - 1 1 2 2 3 2

CO2 3 3 3 1 - - - - 1 1 2 2 3 2

CO3 3 3 3 2 - - - - 2 2 2 2 3 2

CO4 3 3 3 2 2 - - - 2 2 2 2 3 2

CO5 3 3 3 2 2 - - - 2 3 2 2 3 2

CO6 3 3 3 1 1 - - - 2 3 3 3 2 2

PROFESSIONAL ELECTIVES - II
20CSEL602 L T P C
DIGITAL FORENSICS
SDG NO. 4 3 0 0 3
OBJECTIVES:
l To learn the fundamental concepts of forensic science
l To understand the application of forensic science principles to digital
evidence examinations.
l To articulate the steps of the forensic process as applied to digital evidence
l To analyze and validate the computer forensics data

UNIT I INTRODUCTION 9
Introduction - Digital Forensics - Digital Evidence - Increasing Awareness of
Digital Evidence - Digital Forensics: Past, Present, and Future – Principles -
Challenging Aspects of Digital Evidence – Cyber trail - Language of Computer
Crime Investigation - Role of Computers in Crime

UNIT II EVIDENCE AND INVESTIGATIONS 9

Evidence in the Courtroom - Duty of Experts – Admissibility - Levels of
Certainty in Digital Forensics - Direct versus circumstantial evidence -
Scienti ic Evidence - Presenting Digital Evidence - Conducting Digital
189
 Syllabus CSE
Investigations - Digital Investigation Process Models - Scaffolding for Digital
Investigations - Applying the Scienti ic Method in Digital Investigations -
Investigative Scenario - Security Breach

UNIT III DISK AND FILE SYSTEM ANALYSIS 9

Imaging- Internet Artifacts- Browser & Mail Artifacts- File Analysis- Image-
Audio- Video- Archives- Documents- Graphical Investigation Environments-
PyFLAG- Fiwalk- Forensic Ballistics and Photography- Face, Iris and
Fingerprint Recognition.

UNIT IV LAWS AND ACTS 9

Laws and Ethics- Digital Evidence Controls- Evidence Handling Procedures-
Basics of Indian Evidence- ACT IPC and CrPC - Electronic Communication
Privacy ACT- Legal Policies.

UNIT V NETWORK FORENSICS 9

Network Basics for Digital Investigators- Applying Forensic Science to
Networks- Digital Evidence on the Internet- Digital Evidence on Physical and
Data-Link Layers- Digital Evidence at the Network and Transport Layers
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Eoghan Casey ,”Digital Evidence and Computer Crime, Forensic Science,
Computers, and the Internet”, Elsevier, 3rd Edition, 2011
2. Elsevier, 3rd Edition, 2011”Handbook of Digital Forensics and
Investigation”,Elsevier Publication, 2010

REFERENCES:
1. Adrian Farrel,” The Internet And Its Protocols”, Elsevier Publications,
2011.
2. Cory Altheide and Harlan Carvey,”Digital Forensics with Open Source
Tools” Elsevier publication, 3rd Edition, April 2011.
3. Kevin Mandia, Chris Prosise, Matt Pepe,”Incident Response and
Computer Forensics”, TataMcGraw -Hill, New Delhi, 2006.
4. Nelson Phillips and En inger Steuart, “Computer Forensics and
Investigations”, Cengage Learning, New Delhi, 2009
5. Robert M Slade,” Software Forensics”, Tata McGraw - Hill, New Delhi,
2005.

WEB REFERENCES:
1. https://www.forensicnotes.com/d ir-articles-software/
2. https://www.ncjrs.gov/app/publications/alphalist.aspx.
190
 Syllabus CSE
ONLINE RESOURCES:
1. https://resources.infosecinstitute.com/category/computerforensics/
introduction/online- resources/#gref.
2. https://www.classcentral.com/course/edx-computer-forensics-7857

OUTCOMES :
On completion of this laboratory course, the student should be able to
1. Understand the basics and Principles of digital forensics.(K2)
2. Apply the digital investigation process models to collect evidence.(K3)
3. Apply the Scienti ic Method in Digital Investigations.(K3)
4. Understand how to use the forensic concepts in an open platform.(K2)
5. Recall the Standard Operating Procedure.(K1)
6. Interpret the techniques and technologies in Network Forensics.(K2)

CO-PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 2 3 - - 2 3 3 2 3 3 3

CO2 3 3 3 2 3 - - 2 3 3 3 3 3 3

CO3 3 3 3 2 3 - - 2 3 3 3 3 3 3

CO4 3 3 3 2 3 - - 2 3 3 2 3 3 3

CO5 3 3 3 - 3 - 2 2 3 3 - 3 3 3

CO6 3 3 3 2 2 - - - 3 3 - 3 3 2

PROFESSIONAL ELECTIVES - II
20CSEL603 L T P C
VIRTUALIZATION TECHNOLOGIES
SDG NO. 4 3 0 0 3
OBJECTIVES:
l To acquire knowledge of Virtualization and its basic principles
l Ability to use commercial software for Virtualization
l Ability to set up virtual networks, provisioning the memory, and I/O
systems
l To apply the concepts of Virtualization techniques on applications

191
 Syllabus CSE
UNIT I INTRODUCTION 9
Overview: Why server virtualization –History and re-emergence – Classic
virtual machines; VMware, VSphere, KVM, Xen; Taxonomy and basic
principles, Architectures comparison - CPU virtualization -Privileged
instructions handling - Hypervisor – Para virtualization. Hardware-assisted
virtualization. Booting up. Time keeping. CPU scheduling. Commercial
examples.

UNIT II MEMORY MANAGEMENT IN VIRTUALIZATION 9

Memory management in virtualization: Virtual Storage, partitioning
–reclamation – ballooning. Memory sharing. OS-level virtualization
–VMWare–Red Hat Enterprise Virtualization.

UNIT III I/O VIRTUALIZATION 9

I/O virtualization: Virtualizing I/O devices -Monolithic model -virtual I/O
server. Virtual networking –Tunneling –overlay networks. Commercial
examples. Virtual storage: Granularity –Centralized and Distributed File
system, system level, Blocks level.

UNIT IV VIRTUALIZED COMPUTING 9

Virtualized computing: Virtual machine based distributed computing, Elastic
cloud computing, clustering, Cold and hot migration. Commercial examples.
Challenges and future trends.

UNIT V APPLICATIONS 9
Applications: In distributed computing: Grid and Cloud, Virtual Machine
Provisioning, Desktop Virtualization, Application Virtualization, Security for
virtualized environments, Business Continuity in virtual environments.
TOTAL: 45 PERIODS
TEXT BOOK:
1. Jim Smith, Ravi Nair, Morgan, Kaufmann, ”Virtual Machines: Versatile
Platforms for Systems and Processes “(1st Ed): (2005).
2. “Applied Virtualization Technology - Usage models for IT professionals
and Software Developers” (1st Ed): Sean Campbell Intel Press (2006).

REFERENCES:
1. Robert P. Goldberg, Proc. “Architecture of Virtual Machines”, Workshop on
Virtual Computer Systems, Cambridge, MA, 1973, pp 74-112.
2. Gerald J. Popek, Robert P. Goldberg, “Formal Requirements for
Virtualizable Third Generation Architectures”, Communications of the

192
 Syllabus CSE
ACM, 17(7), July 1974, pp 413-421.
3. Paul Barham, Boris Dragovic, Keir Fraser, Steven Hand, Tim Harris,Alex
Ho, Rolf Neugebauer, Ian Pratt and Andrew War ield -“Xen and the Art of
Virtualization”, Proceedings of the ACM Symposium on Operating
Systems Principles (SOSP), October 2003.
4. William von Hagen, “Professional Xen Virtualization”, Wrox Publications,
January, 2008.
5. Amy Newman, Kenneth Hess, “Practical Virtualization Solutions:
Virtualization from the Trenches”, Prentice Hall, October 2009.

WEB REFERENCES:
1. www.xenproject.org
2. https://nptel.ac.in/courses/106/106/106106144/

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand the basic concepts of server virtualization. (K2)
2. Recall the concepts of privileged instructions handling and
hypervisor.(K1)
3. Understand the concepts of virtual networks, memory provisioning.(K2)
4. De ine the concepts of Virtualized Computing.(K3)
5. Understand the concepts of I/O virtualization and Virtual Storage. (K2)
6. Apply the concepts of Virtualization techniques on applications. (K3)

CO-PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 1 - 2 - 1 - - - 2 3 2 1

CO2 3 2 2 - 1 - 1 - - - 1 3 2 1

CO3 3 2 2 - 1 - 1 - - - 2 3 2 1

CO4 3 2 2 - 1 - 1 - - 1 1 3 2 1

CO5 3 2 1 - 2 - 1 - 1 1 2 3 2 1

CO6 3 2 2 - 1 - 1 2 2 2 2 3 2 1

193
 Syllabus CSE

PROFESSIONAL ELECTIVES - II
20CSEL604 L T P C
BIO INFORMATICS
SDG NO. 4 & 15 3 0 0 3

OBJECTIVES:
l To analyze the need for Bioinformatics Technologies
l To be familiar with the modeling techniques
l To learn microarray analysis
l To implement Pattern Matching and Visualization

UNIT I INTRODUCTION 9
Need for Bioinformatics Technologies – Overview of Bioinformatics
Technologies - Structural Bioinformatics – Data Format and Processing –
Secondary Resources and Applications – Role of Structural Bioinformatics -
Biological Data Integration System.

UNIT II DATAWAREHOUSING AND DATAMINING IN BIOINFORMATICS 9

Bioinformatics Data – Data Warehousing Architecture – Data Quality –
Biomedical Data Analysis – DNA Data Analysis – Protein Data Analysis –
Machine Learning – Neural Network Architecture - Applications in
Bioinformatics.

UNIT III MODELING FOR BIOINFORMATICS 9

Hidden Markov Modeling for Biological Data Analysis – Sequence
Identi ication –Sequence Classi ication – Multiple Alignment Generation –
Comparative Modeling –Protein Modeling – Genomic Modeling – Probabilistic
Modeling – Bayesian Networks – Boolean Networks - Molecular Modeling –
Computer Programs for Molecular Modeling.

UNIT IV PATTERN MATCHING AND VISUALIZATION 9

Gene Regulation – Motif Recognition – Motif Detection – Strategies for Motif
Detection – Visualization – Fractal Analysis – DNA Walk Models – One
Dimension – Two Dimension – Higher Dimension – Game Representation of
Biological Sequences – DNA –Protein -Amino Acid Sequences.

UNIT V MICRO ARRAY ANALYSIS 9

Microarray Technology for Genome Expression Study – Image Analysis for
Data Extraction – Preprocessing – Segmentation – Gridding – Spot Extraction –
Normalization - Filtering – Cluster Analysis – Gene Network Analysis
194
 Syllabus CSE
–Scienti ic Data Management Systems – Cost Matrix – Evaluation Model -
Benchmark – Tradeoffs.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Yi-Ping Phoebe Chen (Ed), “BioInformatics Technologies”, First Indian
Reprint, Springer Verlag, 2007.
2. Jin Xiong, “Essential Bioinformatics”, Cambridge University Press, 2012.

REFERENCES:
1. Bryan Bergeron, “Bio Informatics Computing”, Second Edition, Pearson
Education India, 2003.
2. Arthur M Lesk, “Introduction to Bioinformatics”, Second Edition, Oxford
University Press, 2005.
3. David W.Mount, “Bioinformatics: Sequence and Genome Analysis”, Second
Edition, Cold Spring Harbor Laboratory Press,U.S., 2004.
4. Andreas D. Baxevanis, B. F. Francis Ouellette, “Bioinformatics: A Practical
Guide to the Analysis of Genes and Proteins”, Second Edition, Wiley
Interscience, 2001.
5. Mitchell L Model, “Bioinformatics Programming Using Python”, O'Reilly
Media, 2009.

ONLINE RESOURCES:
1. https://www.classcentral.com/subjects/bioinformatics
2. https://mooc-list.com/tags/bioinformatis?_cf_chi_jschi_tk
3. https://www.udemy.com/topic/bioinformatics/?utm_source=adwords?

OUTCOMES:
Upon completion of the course, the students should be able to
1. Understand the basic concepts of Bioinformatics and its signi icance in
biological data analysis.(K2)
2. Describe the history, scope and importance of Bioinformatics and role of
the internet in bioinformatics. (K1)
3. Elaborate the methods to characterize and manage the different types of
biological data.(K2)
4. Discuss the classi ication of biological databases.(K1)
5. Explore the basics of sequence alignment and analysis. (K3)
6. Describe how bioinformatics methods can be used to relate sequence,
structure and functions.(K3)

195
 Syllabus CSE
CO- PO, PSO MAPPING:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 2 2 1 1 2 1 - 1 - - 2 2 2

CO2 2 3 3 2 2 2 2 1 1 - 1 2 2 2

CO3 3 3 3 3 3 2 2 1 3 1 2 3 2 2

CO4 3 3 3 3 3 2 2 1 3 1 2 3 2 2

CO5 2 3 1 2 3 2 2 1 3 1 2 3 2 2

CO6 3 1 1 2 - - - - 1 2 - 1 2 1

PROFESSIONAL ELECTIVES - II
20CSEL605 L T P C
PREDICTIVE MODELING
SDG NO. 4 3 0 0 3
OBJECTIVES:
l To understand the terms and terminologies of predictive modeling.
l To study the various predictive models, their merits, demerits and
application.
l To get exposure to various analytical tools available for predictive modeling.
l To learn the predictive modeling markup language.
l To get familiar with the technologies in predictive modeling.

UNIT I INTRODUCTION TO PREDICTIVE MODELING 9

Core ideas in data mining - Supervised and unsupervised learning
Classi ication vs Prediction - Steps in data mining- SEMMA Approach -
Sampling -Pre-processing - Data cleaning - Data Partitioning - Building a
model Statistical models - Statistical models for predictive analytics.

UNIT II PREDICTIVE MODELING BASICS 9

Data splitting – Balancing- Over itting –Oversampling –Multiple Regression
Arti icial neural networks (MLP) - Variable importance- Pro it/loss/prior
probabilities - Model speci ication - Model selection - Multivariate Analysis.

UNIT III PREDICTIVE MODELS 9

Association Rules-Clustering Models –Decision Trees- Ruleset Models-
KNearest Neighbors – Naive Bayes - Neural Network Model – Regression

196
 Syllabus CSE
Models – Regression Trees – Classi ication & Regression Trees (CART) –
Logistic Regression - Multiple Linear Regression Scorecards – Support Vector
Machines – Time Series Models - Comparison between models - Lift chart
Assessment of a single model.

UNIT IV PREDICTIVE MODELING MARKUP LANGUAGE 9

Introduction to PMML – PMML Converter - PMML Structure – Data
Manipulation in PMML – PMML Modeling Techniques - Multiple Model
Support – Model Veri ication.

UNIT V TECHNOLOGIES AND CASE STUDIES 9

Weka – RapidMiner – IBM SPSS Statistics- IBM SPSS Modeler – SAS Enterprise
Miner – Apache Mahout – R Programming Language.-Real time case study with
modeling and analysis.
TOTAL: 45 PERIODS

TEXT BOOKS:
1. Kattamuri S. Sarma, “Predictive Modeling with SAS Enterprise Miner:
Practical Solutions for Business Applications”, 2nd Edition, SAS Publishing,
2007.
2. Alex Guazzelli, Wen-Ching Lin, Tridivesh Jena, James Taylor, “PMML in
Action Unleashing the Power of Open Standards for Data Mining and
Predictive Analytics”, 2nd Edition, Create Space Independent Publishing
Platform,2012.

REFERENCES:
1. Ian H. Witten, EibeFrank , “Data Mining: Practical Machine Learning Tools
and Techniques”, Morgan Kaufmann Series in Data Management Systems,
Morgan Kaufmann, 3rd Edition, 2011.
2. Eric Siegel , “Predictive Analytics: The Power to Predict Who Will Click, Buy,
Lie, or Die”, 1st Edition, Wiley, 2013
3. Conrad Carlberg, “Predictive Analytics: Microsoft Excel”, 1st Edition, Que
Publishing, 2012.
4. Jeremy Howard, Margit Zwemer, Mike Loukides, “Designing Great Data
Products- Inside the Drive train Approach, a Four-Step Process for Building
Data Products – Ebook”, 1st Edition, O'Reilly Media, March 2012.
5. Max Kuhn, Kjell Johnson, “Applied Predictive Modeling”, First Edition,
Springer, 2018.

197
WEB REFERENCES:
1. https://nptel.ac.in/courses/108108111/
2. https://www.coursera.org/learn/predictive-modeling-analytics

ONLINE RESOURCES:
1. https://bookdown.org/egarpor/PM-UC3M/
2. https://cics.nd.edu/research/applications/materials/

OUTCOMES:
Upon completion of the course, the student should be able to
1. Design and analyze appropriate predictive models. (K2)
2. De ine the predictive models using PMML. (K1)
3. Apply statistical tools for analysis.(K3)
4. Use various analytical tools available for predictive modeling.(K3)
5. Apply predictive modeling markup language in data manipulation. (K2)
6. Apply regression and classi ication model on applications for decision
making and evaluate the performance. (K3)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 1 1 2 - 1 - - - - 1 1 1 2

CO2 2 1 1 1 - 2 - - - - 2 2 1 2

CO3 2 2 1 2 - 2 - - - - 2 2 2 2

CO4 2 2 2 2 3 2 - - - - 2 2 2 2

CO5 2 2 3 2 3 2 - - 2 3 2 2 2 2

CO6 3 2 2 - 3 3 - - - - 1 1 1 2
 Syllabus CSE

PROFESSIONAL ELECTIVES - II
20CSEL606 IOT ARCHITECHTURE, NETWORK AND L T P C
SDG NO. 4 SECURITY 3 0 0 3
OBJECTIVES:
l Understand the fundamentals of the Internet of Things.
l Learn about the basics of IOT protocols.
l Build a small low cost embedded system using Raspberry Pi.
l Apply the concept of Internet of Things in the real world.

UNIT I INTRODUCTION TO IoT 9

Internet of Things - Physical Design- Logical Design- IoT Enabling
Technologies - IoT Levels & Deployment Templates - Domain Speci ic IoTs - IoT
and M2M - IoT System Management with NETCONF-YANG- IoT Platforms
Design Methodology.

UNIT II IoT ARCHITECTURE 9

M2M High-level ETSI Architecture - IETF Architecture for IoT - OGC
Architecture - IoT Reference Model - Domain Model - Information Model -
Functional Model - Communication Model - IoT Reference Architecture.

UNIT III IoT PROTOCOLS 9

Protocol Standardization for IoT – Efforts – M2M and WSN Protocols – SCADA
and RFID Protocols – Uni ied Data Standards – Protocols – IEEE 802.15.4 –
BACNet Protocol – Modbus– Zigbee Architecture – Network layer – 6LoWPAN -
CoAP – Security.

UNIT IV BUILDING IoT WITH RASPBERRY PI & ARDUINO 9

Building IOT with RASPBERRY PI- IoT Systems - Logical Design using Python
–IoT Physical Devices & Endpoints - IoT Device - Building blocks - Raspberry Pi
- Board - Linux on Raspberry Pi - Raspberry Pi Interfaces -Programming
Raspberry Pi with Python - Other IoT Platforms - Arduino.

UNIT V IOT REAL-WORLD APPLICATIONS AND TOOLS 9

Real World Design Constraints - Applications - Asset Management, Industrial
Automation, Smart Grid, Commercial Building Automation, Smart Cities -
Participatory Sensing - Data Analytics for IoT – Software & Management Tools
for IoT Cloud Storage Models & Communication APIs - Cloud for IoT - Amazon
Web Services for IoT.
TOTAL:45 PERIODS
199
 Syllabus CSE
TEXT BOOK:
1. David Hanes, Gonzalo Salgueiro, Patrick Grossetete, Rob Barton and
Jerome Henry, “ IoT Fundamentals: Networking Technologies, Protocols
and Use Cases for Internet of Things”, Cisco Press, 2017.
2. Arshdeep Bahga, Vijay Madisetti, “Internet of Things – A hands-on
approach” , WordPress, 2015

REFERENCES:
1. Olivier Hersent, David Boswarthick, Omar Elloumi , “The Internet of
Things – Key applications and Protocols”, Wiley, 2012 (for Unit 2).
2. Jan Ho¨ ller, Vlasios Tsiatsis , Catherine Mulligan, Stamatis , Karnouskos,
Stefan Avesand. David Boyle, "From Machine-to-Machine to the Internet
of Things - Introduction to a New Age of Intelligence'', Elsevier, 2014.
3. Honbo Zhou, “The Internet of Things in the Cloud: A Middleware
Perspective”,CRC Press, 2012.
4. Dieter Uckelmann, Mark Harrison, Michahelles, Florian (Eds),
“Architecting the Internet of Things”, Springer, 2011.
5. Michael Margolis, Arduino Cookbook, “Recipes to Begin, Expand, and
Enhance Your Projects”, 2nd Edition, O'Reilly Media, 2011.

ONLINE RESOURCES:
1. https://www.arduino.cc/
2. https://www.ibm.com/smarterplanet/us/en/?ca=v_smarterplanet
3. h t t p s : / / w w w. c i s c o . c o m / c / e n / u s / s o l u t i o n s / i n t e r n e t - o f -
things/resources/case-studies.html

OUTCOMES :
Upon completion of the course, the student should be able to
1. Understand the fundamentals of the Internet of Things (K2)
2. Discuss various networking protocols for IoT (K2)
3. Interpret web services to access/control IoT devices (K2)
4. Construct a small low cost embedded system using Raspberry Pi (K3)
5. Extend an IoT application and connect to the cloud (K2)
6. Demonstrate applications of IoT in real time scenarios (K3)

200
 Syllabus CSE
CO-PO, PSO MAPPING:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 2 2 1 - - - - - - - - - 1

CO2 2 2 2 1 - - - - - - - - - 1

CO3 3 2 2 1 1 - - - - - - - - 1

CO4 3 3 3 1 2 1 - - - - - - 1 2

CO5 3 3 3 1 2 1 - - - - - 1 2

CO6 3 3 3 2 2 1 1 1 1 1 1 1 1 2

PROFESSIONAL ELECTIVES - II
20CSEL607 L T P C
AGILE METHODOLOGIES
SDG NO. 4 & 16 3 0 0 3

OBJECTIVES:
l To provide students with a theoretical as well as practical understanding of
agile software development practices and how small teams can apply them
to create high-quality software
l To provide a good understanding of software design and a set of software
technologies and APIs
l To do a detailed examination and demonstration of Agile development and
testing techniques
l To understand Agile development and testing

UNIT I AGILE METHODOLOGY 9

Theories for Agile Management – Agile Software Development – Traditional
Model Vs Agile Model – Classi ication of Agile Methods – Agile Manifesto and
Principles – Agile Project Management – Agile Team Interactions – Ethics in
Agile Teams – Agility in Design - Testing – Agile Documentations – Agile
Drivers - Capabilities and Values.

UNIT II AGILE PROCESSES 9

Lean Production – SCRUM, Crystal - Feature Driven Development - Adaptive
Software Development – Extreme Programming - Method Overview –
Lifecycle – Work Products - Roles and Practices.

201
 Syllabus CSE
UNIT III AGILITY AND KNOWLEDGE MANAGEMENT 9
Agile Information Systems – Agile Decision Making – Earl’s Schools of KM –
Institutional Knowledge Evolution Cycle – Development - Acquisition -
Re inement - Distribution - Deployment - Leveraging – KM in Software
Engineering – Managing Software Knowledge – Challenges of Migrating to
Agile Methodologies – Agile Knowledge Sharing – Role of Story Cards – Story-
Card Maturity Model (SMM).

UNIT IV AGILITY AND REQUIREMENTS ENGINEERING 9

Impact of Agile Processes in RE–Current Agile Practices – Variance – Overview
of RE Using Agile – Managing Unstable Requirements – Requirements
Elicitation – Agile Requirements Abstraction Model – Requirements
Management in Agile Environment - Agile Requirements Prioritization – Agile
Requirements Modeling and Generation – Concurrency in Agile Requirements
Generation.

UNIT V AGILITY AND QUALITY ASSURANCE 9

Agile Product Development – Agile Metrics – Feature Driven Development
(FDD) – Financial and Production Metrics in FDD – Agile Approach to Quality
Assurance – Test Driven Development – Agile Approach in Global Software
Development.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. David J. Anderson and Eli Schragenheim, “Agile Management for Software
Engineering: Applying the Theory of Constraints for Business Results”,
Prentice Hall, 2003.
2. Hazza and Dubinsky, “Agile Software Engineering, Series: Undergraduate
Topics in Computer Science”, Springer, 2009.

REFERENCES:
1. Craig Larman, “Agile and Iterative Development: A Manager's Guide”,
Addison-Wesley, 2004.
2. Kevin C. Desouza, “Agile Information Systems: Conceptualization,
Construction, and Management”, Butterworth- Heinemann, 2007.
3. Jorgen Hesselberg, “Unlocking Agility: An Insider's Guide to Agile
Enterprise Transformation”, Addison – Wesley Signature Series, First
Edition, 2018.
4. Mike Cohn, “Agile Estimating & Planning “, Pearson Education India, First
Edition, 2006.
5. Roman Pichler, “Agile Product Management with Scrum”, Pearson
Education India, 2011

202
 Syllabus CSE
WEB REFERENCES:
1. http://www.umsl.edu/~sauterv/analysis/6840_f09_papers/Nat/
Agile.html
2. https://www.classcentral.com/help/section/edx
3. https://nptel.ac.in/courses/110/104/110104073/
4. https://www.coursera.org/learn/software-processes-and-agile-
practices

ONLINE RESOURCES:
1. https://www.udacity.com/course/software-development-process--
ud805
2. https://www.edx.org/course/agile-software-development

OUTCOMES:
Upon completion of the course, the students should be able to
1. Realize the importance of interacting with business stakeholders in
determining the requirements for a software system.(K3)
2. Perform iterative software development processes.(K2)
3. Point out the impact of social aspects on software development
success.(K2)
4. Develop techniques and tools for improving team collaboration and
software quality.(K3)
5. Perform Software process improvement as an ongoing task for
development teams.(K3)
6. Show how agile approaches can be scaled up to the enterprise level.(K2)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 2 2 1 - 1 1 - - - 1 2 2

CO2 2 2 1 2 2 - 3 1 - - - 1 2 2

CO3 2 2 3 2 2 1 1 2 - - - 1 2 3

CO4 1 1 3 2 2 - 1 1 - - 1 1 2 2

CO5 3 3 1 2 2 - 1 1 - - - 1 2 2

CO6 3 2 2 1 - - - 1 1 2 - 1 2 2

203
 Syllabus CSE
PROFESSIONAL ELECTIVES - II
20CSEL608 L T P C
SOFT COMPUTING
SDG NO. 4 3 0 0 3
OBJECTIVES:
l To classify the various Soft Computing Frameworks
l To learn the design of Neural Networks
l To understand about Fuzzy logic, Fuzzy systems and Decision making
l To be exposed to Hybrid Soft Computing systems and applications

UNIT I INTRODUCTION TO SOFT COMPUTING 9

Soft Computing Constituents - From Conventional AI to Computational
Intelligence - Arti icial Neural Network - Introduction - Characteristics-
Learning Methods – Taxonomy – Evolution of Neural Networks - Basic Models -
Important Technologies – Applications - Introduction to Fuzzy Logic –
Classical Sets – Fuzzy Sets – Introduction to Genetic Algorithm and Genetic
Programming - Traditional Optimization and Search Techniques.

UNIT II NEURAL NETWORKS 9

Mcculloch-Pitts Neuron - Linear Separability - Hebb Network - Supervised
Learning Network:Perceptron Networks - Adaptive Linear Neuron, Multiple
Adaptive Linear Neuron, BPN, RBF- Associative Memory Network: BAM,
Hop ield Networks – Unsupervised Learning Networks: Kohonen Self-
Organizing Feature Maps – CP Networks, ART Network.

UNIT III FUZZY LOGIC 9

Membership Functions: Features, Fuzzi ication, Methods of Membership
Value Assignments-Defuzzi ication: Lambda Cuts - Methods - Fuzzy
Arithmetic and Fuzzy Measures: Fuzzy Arithmetic - Fuzzy Measures -
Measures of Fuzziness - Fuzzy Integrals - Fuzzy Rule Base and Approximate
Reasoning : Truth Values and Tables, Fuzzy Propositions, Formation of Rules-
Decomposition of Rules, Aggregation of Fuzzy Rules, Fuzzy Reasoning-Fuzzy
Inference Systems Overview of Fuzzy Expert System-Fuzzy Decision Making.

UNIT IV GENETIC ALGORITHM 9

Genetic Algorithm- Genetic Basic Concepts - Operators – Encoding Scheme –
Fitness Evaluation – Crossover - Mutation - Genetic Programming – Multilevel
Optimization – Advances in GA.

204
 Syllabus CSE
UNIT V HYBRID SOFT COMPUTING TECHNIQUES & APPLICATIONS 9
Neuro-Fuzzy Hybrid Systems - Genetic Neuro Hybrid Systems - Genetic Fuzzy
Hybrid and Fuzzy Genetic Hybrid Systems - Applications: A Fusion Approach
of Multispectral Images with SAR, Optimization of Traveling Salesman
Problem using Genetic Algorithm Approach, Soft Computing Based Hybrid
Fuzzy Controllers.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. S.N.Sivanandam and S.N.Deepa, "Principles of Soft Computing", Wiley
India Pvt. Ltd, 2011.
2. J.S.R.Jang, C.T. Sun and E.Mizutani, “Neuro-Fuzzy and Soft Computing”,
PHI/ Pearson Education, 2004.

REFERENCES:
1. S.Rajasekaran and G.A.Vijayalakshmi Pai, "Neural Networks, Fuzzy Logic
and Genetic Algorithm: Synthesis & Applications", Prentice-Hall ofIndia
Pvt. Ltd., 2006.
2. David E. Goldberg, “Genetic Algorithm in Search Optimization and
Machine Learning”, Pearson Education India, 2013.
3. George J. Klir, Ute St. Clair, Bo Yuan, “Fuzzy Set Theory: Foundations and
Applications”, Prentice Hall, 1997.
4. Simon Haykin, “Neural Networks Comprehensive Foundation”, Second
Edition, Pearson Education, 2005.
5. B.K. Tripathy and J. Anuradha, “Soft Computing-Advances and
Applications”, First edition, Cengage Learning, 2015.

WEB REFERENCES:
1. https://nptel.ac.in/courses/106105173/

ONLINE RESOURCES:
1. https://cse.iitkgp.ac.in/~dsamanta/courses/sca/index.html

OUTCOMES:
Upon completion of the course, the student should be able to
1. Illustrate various soft computing concepts for practical applications.
(K2)
2. Apply suitable neural networks for real time problems. (K3)
3. Use fuzzy rules and reasoning to create decision making and an expert
system. (K3)
4. Explain the importance of optimization techniques and genetic

205
 Syllabus CSE
programming. (K2)
5. Develop suitable soft computing techniques for various applications.
(K3)
6. Classify the various hybrid soft computing techniques and apply in real
time problems. (K3)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 2 - - - - - - - - - - 3 2

CO2 2 3 3 - - - - - - 3 2

CO3 2 3 3 3 3 - - - - - - - 3 2

CO4 2 2 2 - - - - - - - - - 3 2

CO5 2 3 3 3 3 - - - 2 - - - 3 2

CO6 2 3 3 - 3 - - - - - - 3 2

PROFESSIONAL ELECTIVES - II
20ITEL607 L T P C
EMBEDDED SYSTEMS
SDG NO. 4 & 7 3 0 0 3
OBJECTIVES:
l To introduce the building blocks of Embedded System
l To Educate in various Embedded development strategies
l To Introduce bus communication in Processors, Input/Output interfacing
l To impart knowledge in various Processor Scheduling algorithms

UNIT I INTRODUCTION TO EMBEDDED SYSTEMS 9

Introduction to Embedded Systems – The Build Process for Embedded
Systems- Structural Units in Embedded Processor - Selection of Processor &
Memory Devices- DMA – Memory Management Methods- Timer and Counting
Devices - Watchdog Timer - Real Time Clock - In Circuit Emulator - Target
Hardware Debugging.

UNIT II EMBEDDED NETWORKING 9

Embedded Networking: Introduction - I/O Device Ports & Buses– Serial Bus
Communication Protocols – RS232 Standard – RS422 – RS485 – CAN Bus -
Serial Peripheral Interface (SPI) – Inter Integrated Circuits (I2C) – Need for
Device Drivers.
206
 Syllabus CSE
UNIT III EMBEDDED FIRMWARE DEVELOPMENT ENVIRONMENT 9
Embedded Product Development Life Cycle - Objectives - Different Phases of
EDLC - Modelling of EDLC - Issues in Hardware - Software Co-design - Data
Flow Graph - State Machine Model - Sequential Program Model - Concurrent
Model - Object Oriented Model.

UNIT IV RTOS BASED EMBEDDED SYSTEM DESIGN 9

Introduction to Basic Concepts of RTOS - Task - Process & Threads - Interrupt
Routines in RTOS - Multiprocessing and Multitasking - Preemptive and Non-
Preemptive Scheduling - Task Communication Shared Memory - Message
Passing - Inter Process Communication – Synchronization between Processes-
Semaphores - Mailbox - Pipes - Priority Inversion - Priority Inheritance.

UNIT V EMBEDDED SYSTEM APPLICATION AND DEVELOPMENT 9

Case Study of Washing Machine - Automotive Application - Smart Card System
Application-ATM Machine –Digital Camera.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Peckol, “Embedded System Design”, John Wiley & Sons, 2010.
2. Shibu. K.V, “Introduction to Embedded Systems”, Second Edition,
Mc Graw Hill, 2017.

REFERENCES:
1. Raj Kamal, “Embedded System-Architecture, Programming, Design”,
Mc Graw Hill, 2013.
2. Lyla B Das,” Embedded Systems - An Integrated Approach”, Pearson, 2013.
3. C.R.Sarma, “Embedded Systems Engineering”, University Press (India)
Pvt. Ltd, 2013.
4. Tammy Noergaard, “Embedded Systems Architecture”, Elsevier, 2006.
5. Han-Way Huang, “Embedded System Design Using C8051”, Cengage
Learning, 2009.

WEB REFERENCES:
1. https://nptel.ac.in/courses/108102045/

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand the Building Blocks of Embedded System and Networking
Concepts (K2)
2. Examine the various Embedded Development Environment (K4)
207
 Syllabus CSE
3. Explain the Basic Concepts of Realtime Operating System (K2)
4. Summarize the important aspects of multiprocessing and multitasking
(K2)
5. Examine the issues in Hardware and Software CoDesign (K4)
6. State the Embedded systems applications and Development in Real time
Applications (K1)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 1 1 1 - - - 1 - - 1 - 1 1 1

CO2 3 1 - - 3 3 3 - - - 3 1 3 1

CO3 2 2 2 - 2 2 2 - - 3 1 1 2 2

CO4 3 1 - 3 2 1 1 - 2 1 1 1 3 1

CO5 2 2 1 2 2 - 1 - 1 - 1 1 2 2

CO6 3 1 - 3 2 1 1 - 2 1 1 1 3 1

PROFESSIONAL ELECTIVES - II
20ITEL806 L T P C
PATTERN RECOGNITION TECHNIQUES
SDG NO. 4 3 0 0 3

OBJECTIVES:
l To understand about Unsupervised algorithms suitable for pattern
classi ication
l To familiarize with the Feature Selection algorithms and method of
implementing them in applications
l To learn about the basis of algorithm used for training and testing the
dataset
l To learn basic Fuzzy System and Neural Network architectures, for
applications in Pattern Recognition, Image Processing and Computer
Vision

UNIT I PATTERN CLASSIFIER 9

Overview of Pattern Recognition – Discriminant Functions – Supervised
Learning – Parametric Estimation – Maximum Likelihood Estimation – Bayes
Theorem – Bayesian Belief Network–Naive Bayesian Classi ier.

208
 Syllabus CSE
UNIT II CLUSTERING 9
Clustering Concept – Hierarchical Clustering Procedures – Partitional
Clustering – Clustering of Large Data Sets – EM Algorithm – Grid Based
Clustering– Density Based Clustering.

UNIT III FEATURE SELECTION AND GENERATION 9

Feature Selection-Introduction-Preprocessing -The Peaking Phenomenon-
Feature Selection Based on Statistical Hypothesis Testing-The Receiver
Operating Characteristics (ROC) Curve-Class Separability Measures-Feature
Subset Selection-Feature Generation - Introduction - Regional Features -
Features for Texture Characterization - Moments - Parametric Models-
Optimal Feature Generation.

UNIT IV HIDDEN MARKOV MODELS AND SUPPORT

VECTOR MACHINE 9
State Machines – Hidden Markov Models - Maximum Likelihood for the HMM,
Forward-Backward Algorithm - Sum and Product Algorithm for the HMM-
Scaling Factors - Viterbi Algorithm - Extensions of the Hidden Markov Model –
Support Vector Machines - Maximum Margin Classi iers - Relevance Vector
Machines.

UNIT V RECENT ADVANCES 9

Fuzzy Classi ication - Fuzzy Set Theory - Fuzzy and Crisp Classi ication - Fuzzy
Clustering - Fuzzy Pattern Recognition – Introduction to Neural Networks:
Elementary Neural Network for Pattern Recognition - Hebbnet - Perceptron -
ADALINE and Back Propagation.
TOTAL: 45 PERIODS
TEXT BOOKS :
1. R O Duda, P.E. Hart and D.G. Stork, “Pattern Classi ication and Scene
Analysis”, John Wiley, First Edition, 2000.
2. Rajasekaran, G. A. Vijayalakshmi Pai, "Neural Networks, Fuzzy Logic and
Genetic Algorithm: Synthesis and Applications", Prentice Hall, 2010.

REFERENCES:
1. C. M. Bishop, “Pattern Recognition and Machine Learning”, Springer, 2006.
2. M. Narasimha Murthy, V. Susheela Devi, “Pattern Recognition”, Springer,
2011.
3. Andrew Webb, “Statistical Pattern Recognition”, Arnold Publishers, 1999.
4. Robert J. Schalkoff, “Pattern Recognition : Statistical, Structural and Neural
Approaches”, John Wiley & Sons Inc., 2007.

209
 Syllabus CSE
5. S.Theodoridis and K.Koutroumbas, “Pattern Recognition”, Fourth Edition,
Academic Press, 2009.

WEB REFERENCES:
1. https://nptel.ac.in/courses/106106046
2. https://www.cse.iitm.ac.in/course_details.php?arg=Mjc=

ONLINE REFERENCES :
1. https://freevideolectures.com/course/3194/pattern-recognition

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand basic Pattern Classi ication algorithms (K2)
2. Discuss different types of Clustering techniques (K2)
3. Perceive the recent advancement in Pattern Recognition (K3)
4. Acquire knowledge about various Feature Extraction techniques (K2)
5. Apply SVM and HMM algorithms for Real time applications (K3)
6. Describe basic Fuzzy System and Neural Network architectures, for
applications in Pattern Recognition, Image Processing and Computer
Vision (K2)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3 1 1 1 - 1 - 1 - 2 2

CO2 3 3 3 3 3 1 1 - 2 - 1 - 2 2

CO3 3 3 3 3 3 1 1 - 2 - 1 - 2 2

CO4 3 3 3 3 3 1 1 - 2 - 1 - 2 2

CO5 3 3 3 3 3 1 1 1 2 3 1 - 2 2

CO6 3 3 2 3 3 2 - - - - - - 1 1

210
 Syllabus CSE

PROFESSIONAL ELECTIVES - II
20MGEL601 L T P C
TOTAL QUALITY MANAGEMENT
SDG NO. 4 & 9 3 0 0 3

OBJECTIVES:
l To understand the concepts and philosophies of Quality Management
l To know the impact and sigini icance of TQM principles on organizations
in recent times.

UNIT 1 INTRODUCTION 8
Need and Evolution of Quality, Quality-De initions, statements and
dimensions of product and service quality TQM-concepts, Elements and
Framework, Bene its & Obstacles of TQM , TQM-Culture, Stategic Quality
Management, Costs of Quality.

UNIT II CONTRIBUTIONS AND APPROACHES TO QUALITY

MANAGEMENT 9
Renowned quality gurus- Deming, Juran, Crosby and Ishikawa, Contributions
of Taguchi – Loss Function, Signal to Noise Ratio and design of experiments,
Kaizen -principles and practices-5 S tools, Poka Yoke-8Discipline
Methodology, Just in time, Continous process improvement-PDCA cycle and 5
why analysis

UNIT III CUSTOMER FOCUS AND TEAMWORK 8

Identifying Customer Needs, QFD - Process, Building HoQ, Customer
Satisfaction Measurement Techniques. Employee Involvement Practices.
Individual Participation - Suggestion Systems & Empowerment,
Motivation,Leadership, Partnerships - Cross-Functional Teams,
Supplier/Customer Partnerships, Problem -Solving Teams - Quality Circles.

UNIT IV STATISTICAL TOOLS & TECHNIQUES 11

SQC - Tools For Data Collection And Analysis – Seven tools(old and new
),Statistical Process Control (SPC) – Construction of Control Chart – Variables
and Attributes. Process Capability – concepts and measurement. Six Sigma
models ,Lean six sigma, BPR, TPM, FMEA and Benchmarking.

UNIT V QUALITY SYSTEMS AND STANDARDS 9

Need for ISO 9000- ISO 9001: 2015 quality system-guidelines and clausewise
requirements, Quality audits-types and responsibilities, ISO 14001:2004

211
 Syllabus CSE

EMS, ISO / TS 16949:2002, ISO 27001:2005 ISMS, SEI – CMMIand Awards -

Demings Prize, MBNQA and criteria.
TOTAL:45PERIODS
TEXT BOOKS:
1. Bester ield, Total Quality Management, 3rd Edition, Pearson India
2 Shridhara K Bhat, Total Quality Management. Himalaya Publishing
House, 2010.

REFERENCE BOOKS:
1. Bedi Kanishka, Quality Management, Oxford University Press
2. Kiran D.R., Total Quality Management - Key Concepts and Case Studies,
Butterworth-Heinemann, 2016.
3. Poornima M Charantimath, Total Quality Management. Pearson India,
2017
4. Sharma DD, Total Quality Management, Principles, Practice and Cases,
Sultan Chand and Sons.
5. Douglas C. Montgomory, Introduction to Statistical Quality Control, Wiley
Student Edition, 4 th Edition, Wiley India Pvt Limited, 2008

MOOC REFERENCES:
1. https://www.coursera.org/lecture/supply-chain-management/total-
quality-management-wLrvy
2. https://swayam.gov.in/nd1_noc20_mg34/preview
3. https://www.openlearning.com/courses/total-quality-management/
4. https://www.udemy.com/course/tqm-in-academics/

MOOC REFERENCES:
1. https://www.unido.org/sites/default/ iles/2009-04/A_roadmap_
to_quality_volume_1_0.pdf
2. https://www.investopedia.com/terms/t/total-quality-management-
tqm.asp
3. https://www.researchgate.net/publication/237006071_Total_
Quality_Management_in_Academic_Libraries_A_Study
4. https://www.isixsigma.com/methodology/total-quality-management-
tqm/introduction-and-implementation-total-quality-management-
tqm/
5. https://study.com/academy/lesson/ ive-principles-of-total-quality-
management-tqm.html

212
 Syllabus CSE

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand quality concepts and philosophies of TQM. (K2)
2. Apply TQM principles and concepts of continuous improvement. (K3)
3. Explain the quality tools, management tools and statistical fundamentals
to improve quality. (K2)
4. Demonstrate the various TQM tools as a means to improve quality. (K2)
5. Illustrate quality tools and procedures for better quality output. (K3)

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 1 3 1 - 1 - 1 1 - - - 1

CO2 3 3 3 2 2 - 1 1 - - - 1

CO3 3 3 2 2 2 - 1 1 - - - 1

CO4 2 2 3 2 2 - 1 1 - - - 1

CO5 3 3 3 2 2 2 1 1 - - - 1

213
 Syllabus CSE
PROFESSIONAL ELECTIVES - III
20CSEL701 L T P C
SOCIAL NETWORK ANALYSIS
SDG NO. 4 & 8 3 0 0 3
OBJECTIVES:
l To understand the concept of Semantic Web and related applications
l To learn knowledge representation using Ontology
l To understand human behaviour in social web and related communities
l To learn visualization of Social Networks

UNIT I INTRODUCTION 9
Introduction to Semantic Web - Limitations of Current Web – Development of
Semantic Web – Emergence of the Social Web – Social Network Analysis:
Development of Social Network Analysis – Key Concepts and Measures in
Network Analysis – Electronic Sources for Network Analysis: Electronic
Discussion Networks - Blogs and Online Communities – Web-based Networks
– Applications of Social Network Analysis.

UNIT II MODELLING, AGGREGATING AND KNOWLEDGE

REPRESENTATION 9
Ontology and their role in the Semantic Web - Ontology-based Knowledge
Representation – Ontology Languages for the Semantic Web - Resource
Description Framework – Web Ontology Language – Modelling and
Aggregating Social Network Data: State-of-the-art in Network Data
Representation – Ontological Representation of Social Individuals –
Ontological Representation of Social Relationships – Aggregating and
Reasoning with Social Network Data – Advanced Representations.

UNIT III EXTRACTION AND MINING COMMUNITIES IN

WEB SOCIAL NETWORKS 9
Web Archive – Detecting Communities in Social Networks – De inition of
Community – Evaluating Communities – Methods for Community Detection
and Mining – Applications of Community Mining Algorithms – Tools for
Detecting Communities Social Network Infrastructures and Communities –
Decentralized Online Social Networks – Multi-Relational characterization of
dynamic social network communities.

UNIT IV PREDICTING HUMAN BEHAVIOUR AND PRIVACY ISSUES 9

Understanding and Predicting Human Behaviour for Social Communities –
User Data Management – Inference and Distribution – Enabling New Human
Experiences – Reality Mining – Context – Awareness – Privacy in Online Social
214
 Syllabus CSE
Networks – Trust in Online Environment – Trust Models Based on Subjective
Logic – Trust Network Analysis – Trust Transitivity Analysis – Combining
Trust and Reputation – Trust Derivation based on Trust Comparisons – Attack
Spectrum and Counter Measures.

UNIT V VISUALIZATION AND APPLICATIONS OF SOCIAL NETWORKS 9

Graph Theory – Centrality – Clustering – Node-Edge Diagrams – Matrix
Representation – Visualizing Online Social Networks - Visualizing Social
Networks with Matrix-based Representations – Matrix and Node-Link
Diagrams – Hybrid Representations – Applications – Cover Networks –
Community Welfare – Collaboration Networks – Co-Citation Networks.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Peter Mika, “Social Networks and the Semantic Web”, First Edition,
Springer, 2007.
2. BorkoFurht, “Handbook of Social Network Technologies and Applications”,
1st Edition, Springer, 2010.

REFERENCES:
1. GuandongXu, Yanchun Zhang and Lin Li, “Web Mining and Social
Networking – Techniques and Applications”, First Edition, Springer, 2011.
2. Dion Goh and Schubert Foo, “Social information Retrieval Systems:
Emerging Technologies and Applications for Searching the Web
Effectively”, IGI Global Snippet, 2008.
3. Max Chevalier, Christine Julien and Chantal Soulé -Dupuy, “Collaborative
and Social Information Retrieval and Access: Techniques for Improved user
Modelling”, IGI Global Snippet, 2009.
4. John G. Breslin, Alexander Passant and Stefan Decker, “The Social Semantic
Web”, Springer, 2009.
5. Przemyslaw Kazienko, Nitesh Chawla, ”Applications of Social Media and
Social Network Analysis”, Springer, 2015.

WEB REFERENCES:
1. https://www.sagepub.com/sites/default/ iles/upm-binaries/
35208_Chapter1.pdf
2. http://www.orgnet.com/sna.html
3. http://www.analytictech.com/networks/whatis.htm

ONLINE RESOURCES:
1. http://www.mjdenny.com/workshops/SN_Theory_I.pdf

215
 CSE Syllabus
OUTCOMES:
Upon completion of the course, the students should be able to
1. Understand a broad range of Network concepts and theories. (K1)
2. Appreciate how Network analysis can contribute to increasing knowledge
about diverse aspects of society. (K1)
3. Use a relational approach to answer questions of interest to them (i.e. be
able to apply 'Network Thinking'). (K2)
4. Analyse Social Network data using various software packages. (K3)
5. Present results from Social Network Analysis, both orally and in writing.
(K2)
6. Use software to simulate the dynamics of networks based on social
network models.(K3)

CO- PO, PSO MAPPING

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 1 1 - - - - - 2 3 3 2

CO2 3 3 3 2 2 - - - - - 2 3 3 2

CO3 3 3 1 2 2 2 1 - - - 2 3 3 2

CO4 3 3 1 3 3 3 2 - - - 2 3 3 2

CO5 3 3 3 3 1 2 3 - - - 2 3 3 2

CO6 2 2 2 1 3 3 3 - - - 1 2 2 2

PROFESSIONAL ELECTIVES - III

20CSEL702 L T P C
SOFTWARE DEFINED NETWORKS
SDG NO. 4 3 0 0 3
OBJECTIVES:
l To appreciate the need for Software De ined Networks
l To learn working of Software De ined Networking
l To know the Open Flow Speci ications
l To know the applications of Software De ined Networking in Data Centers

UNIT I INTRODUCTION 9
Basic Packet Switching Terminology - The Modern Data Center - Traditional
Switch Architecture - Autonomous and Dynamic Forwarding Tables - Open
Source and Technological Shifts - SDN - Evolution of Switches - Control Planes -
216
 Syllabus CSE
Cost - SDN Implications for Research and Innovation - Data Center Innovation -
Data Center Needs.

UNIT II THE GENESIS OF SDN 9

The Evolution of Networking Technology - Sustaining SDN Interoperability -
Open Source Contributions - Legacy Mechanisms Evolve Toward SDN -
Network Virtualization - Fundamental Characteristics of SDN - SDN Operation
- SDN Devices - SDN Controller - SDN Applications - Alternate SDN Methods.

UNIT III THE OPENFLOW SPECIFICATION 9

OpenFlow Overview - OpenFlow 1.0-1.1-1.2-1.3 - OpenFlow - Limitations -
Alternative De initions of SDN - Potential Drawbacks of Open SDN - SDN via
APIs - SDN via Hypervisor - Based Overlays - SDN via Opening Up the Device -
Network Functions Virtualization - Alternatives Overlap and Ranking.

UNIT IV SDN IN THE DATA CENTER 9

Data Center De inition - Data Center Demands - Tunneling Technologies for
the Data Center, Path Technologies in the Data Center - Ethernet Fabrics in the
Data Center - SDN Use Cases in the Data Center - Open SDN versus Overlays in
the Data Center - Real-World Data Center Implementations.
SDN IN OTHER ENVIRONMENTS: Consistent Policy Con iguration - Global
Network View - Wide Area Networks - Service Provider and Carrier Networks -
Campus Networks - Hospitality Networks - Mobile Networks - In-Line
Network Functions - Optical Networks - SDN vs P2P/Overlay Networks.

UNIT V SDN APPLICATIONS 9

Reactive versus Proactive Applications - Reactive SDN Applications - Proactive
SDN Applications - Analyzing Simple SDN Applications - Creating Network
Virtualization Tunnels - Of loading Flows in the Data Center - Access Control
for the Campus - Traf ic Engineering for Service Providers.
SDN FUTURES: Potential Novel Applications of Open SDN - Applying
Programming Techniques to Networks - Security Applications - Hiding IP
Addresses - Segregating IPSec Traf ic in Mobile Networks - Roaming in Mobile
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Paul Goransson, Chuck Black, “Software De ined Networks - A
Comprehensive Approach”, Elsevier, 2014.
2. Siamak Azodolmolky, “Software De ined Networking with Open Flow”,
Second Edition, Packt Publishing, 2013.

217
 Syllabus CSE
REFERENCES:
1. Thomas D.Nadeau & Ken Gray, "SDN Software De ined Networks",
O'Reilly publishers, First edition, 2013.
2. Sreenivas Voruganti, Sriram Subramanian, “Software De ined
Networking (SDN) with Open Stack”, First Edition, Packt Publishing,
2016.
3. William Stallings, “Foundations of Modern Networking”, First Edition,
Pearson education limited, 2016.
4. Vivek Tiwari, “SDN and Open Flow for Beginners”, Amazon Digital
Services, Inc., 2013.
5. Fei Hu, Editor, “Network Innovation through Open Flow and SDN:
Principles and Design”, Chemical Rubber Company Press, 2014.

WEB REFERENCES:
1. h t t p s : / / u s e r s . c s . i u . e d u / ~ fo r t e g a / s t o ra g e / t c n 6 4 3 0 / S D N _
9780124166844.pdf
2. https://www.cs.rutgers.edu/~sn624/552-F18/papers/p4.pdf
3. https://www.cs.rutgers.edu/~sn624/552-F18/papers/road.pdf

ONLINE RESOURCES:
1. https://sdn.ieee.org/outreach/resources
2. https://www.coursera.org/learn/sdn

OUTCOMES:
Upon completion of the course, the student should be able to
1. Explain the key bene its of SDN by the separation of data and control
planes (K1)
2. Interpret the SDN data plane devices and Open low Protocols.(K2)
3. Implement the operation of SDN control plane with different
controllers.(K2)
4. Apply techniques that enable applications to control the underlying
network using SDN.(K3)
5. Appreciate the applications of Software De ined Networking in Data
Centers (K2)
6. Describe Network Functions Virtualization components and their roles
in SDN(K3)

218
 Syllabus CSE
CO- PO, PSO MAPPING
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 - 3 2 - 2 2 2 3 3 3 3 3 -

CO2 1 3 1 2 - 1 - 3 1 - 1 1 1 3

CO3 3 3 3 3 1 - - - 3 1 3 3 3 3

CO4 3 3 3 3 3 2 - 2 2 1 3 2 3 3

CO5 3 3 3 3 3 1 - - 1 1 3 2 3 3

CO6 3 3 3 2 3 2 - 2 2 1 3 2 3 3

PROFESSIONAL ELECTIVES - III

20CSEL703 INFORMATION RETRIEVAL L T P C
SDG NO. 4 &12 TECHNIQUES 3 0 0 3

OBJECTIVES:
l To understand the basics of Information Retrieval
l To apply Machine Learning techniques for Text Classi ication and
Clustering
l To implement various Search engine system operations
l To learn different techniques of Recommender system

UNIT I INTRODUCTION 9
Information Retrieval – Early Developments – The IR Problem – The Users
Task – Information Vs Data Retrieval - The IR System – The Software
Architecture of the IR System – The Retrieval and Ranking Processes - The Web
– The e-Publishing Era – How the Web Changed Search – Practical Issues on the
Web – How People Search – Search Interfaces Today – Visualization in Search
Interfaces.

UNIT II MODELING AND RETRIEVAL EVALUATION 9

Basic IR Models - Boolean Model - TF / IDF (Term Frequency/Inverse
Document Frequency) Weighting - Vector Model – Probabilistic Model – Latent
Semantic Indexing Model – Neural Network Model – Retrieval Evaluation –
Retrieval Metrics – Precision and Recall – Reference Collection – User-Based
Evaluation – Relevance Feedback and Query Expansion – Explicit Relevance
Feedback.

219
 Syllabus CSE
UNIT III TEXT CLASSIFICATION AND CLUSTERING 9
A Characterization of Text Classi ication – Unsupervised Algorithms -
Clustering – Naıv̈e Text Classi ication – Supervised Algorithms – Decision Tree
– KNN Classi ier – SVM Classi ier – Feature Selection or Dimensionality
Reduction – Evaluation Metrics – Accuracy and Error – Organizing the Classes
– Indexing and Searching – Inverted Indexes – Sequential Searching – Multi-
Dimensional Indexing.

UNIT IV WEB RETRIEVAL AND WEB CRAWLING 9

The Web – Search Engine Architectures – Cluster based Architecture –
Distributed Architectures – Search Engine Ranking – Link based Ranking –
Simple Ranking Functions – Learning to Rank – Evaluations - Search Engine
Ranking – Search Engine User Interaction – Browsing – Applications of a Web
Crawler – Taxonomy – Architecture and Implementation – Scheduling
Algorithms – Evaluation.

UNIT V RECOMMENDER SYSTEM 9

Recommender Systems Functions – Data and Knowledge Sources –
Recommendation Techniques – Basics of Content-Based Recommender
Systems – High Level Architecture – Advantages and Drawbacks of Content-
Based Filtering – Collaborative Filtering – Matrix factorization models –
Neighborhood models.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Ricardo Baeza-Yates and Berthier Ribeiro-Neto, “Modern Information
Retrieval: The Concepts and Technology behind Search”, Second Edition,
ACM Press Books, 2011.
2. Ricci, F, Rokach, L. Shapira, B.Kantor, “Recommender Systems Handbook”,
First Edition, 2011.

REFERENCES:
1. C. Manning, P. Raghavan, and H. Schü tze, “Introduction to Information
Retrieval”, Cambridge University Press, 2008.
2. Stefan Buettcher, Charles L. A. Clarke and Gordon V. Cormack, “Information
Retrieval: Implementing and Evaluating Search Engines”, The MIT Press,
2010.
3. ChengXiang Zhai, “Statistical Language Models for Information Retrieval
(Synthesis Lectures Series on Human Language Technologies)”, Morgan &
Claypool Publishers, 2008.
4. Gerald J. Kowalski, Mark T. Maybury, “Information Storage and Retrieval
Systems – Theory and Implementation”, Second Edition, Springer 2013.

220
5. Frakes, W.B., Ricardo Baeza-Yates, “Information Retrieval Data Structures
and Algorithms”, Prentice Hall, 2007.

WEB REFERENCES:
1. https://libguides.lamk. i/informationretrieval/techniques

ONLINE RESOURCES:
1. www.informationretrieval.org
2. https://nlp.stanford.edu/IR-book/html/htmledition/irbook.html

OUTCOMES:
Upon completion of the course, the students should be able to
1. Identify and design the various components of an Information Retrieval
system. (K1)
2. Use an open source Search engine framework and explore its capabilities.
(K3)
3. Apply appropriate method of Classi ication or Clustering. (K3)
4. Design and implement innovative features in a Search engine. (K2)
5. Design and implement a Recommender system. (K2)
6. Demonstrate Information visualization technologies like Cognition and
perception in the Internet or Web search engine.(K3)

CO-PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 2 3 1 1 1 2 1 1 2 1 2

CO2 3 3 3 3 3 1 2 2 3 2 1 2 1 2

CO3 3 3 3 3 3 1 1 1 1 2 1 2 1 2

CO4 3 3 3 2 3 1 2 2 2 2 1 2 2 2

CO5 3 3 3 3 3 1 2 2 3 3 2 2 2 2

CO6 3 3 2 2 1 1 2 2
 Syllabus CSE

PROFESSIONAL ELECTIVES - III

20CSEL704 L T P C
NATURAL LANGUAGE PROCESSING
SDG NO. 4 3 0 0 3

OBJECTIVES:
l To learn the techniques in natural language processing
l To be familiar with the natural language generation
l To be exposed to machine translation
l To understand the information retrieval techniques

UNIT I OVERVIEW AND LANGUAGE MODELING 9

Overview: Origins and Challenges of NLP-Language and Grammar - Processing
Indian Languages - NLP Applications - Information Retrieval - Language
Modeling - Various Grammar - Based Language Models-Statistical Language
Model.

UNIT II WORD LEVEL AND SYNTACTIC ANALYSIS 9

Word Level Analysis - Regular Expressions-Finite-State Automata-
Morphological Parsing-Spelling Error Detection and Correction-Words and
Word Classes-Part-of Speech Tagging - Syntactic Analysis - Context-Free
Grammar-Constituency- Parsing-Probabilistic Parsing.

UNIT III SEMANTIC ANALYSIS AND DISCOURSE PROCESSING 9

Semantic Analysis: Meaning Representation-Lexical Semantics - Ambiguity-
Word Sense Disambiguation - Discourse Processing - Cohesion-Reference
Resolution- Discourse Coherence and Structure.

UNIT IV NATURAL LANGUAGE GENERATION

AND MACHINE TRANSLATION 10
Natural Language Generation - Architecture of NLG Systems- Generation Tasks
and Representations- Application of NLG - Machine Translation - Problems in
Machine Translation - Characteristics of Indian Languages - Machine
Translation Approaches - Translation Involving Indian Languages.

UNIT V INFORMATION RETRIEVAL AND

LEXICAL RESOURCES 8
Information Retrieval - Design features of Information Retrieval Systems-
Classical - Non-classical - Alternative Models of Information Retrieval –
Valuation Lexical Resources - World Net-Frame Net- Stemmers - POS Tagger-

222
 Syllabus CSE
Research Corpora.
TOTAL: 45 PERIODS

TEXT BOOK:
1. Tanveer Siddiqui, U.S. Tiwary, “Natural Language Processing and
Information Retrieval”, Oxford University Press, 2008.
2. Steven Bird, Ewan Klein and Edward Loper, “Natural Language Processing
with Python”, First Edition, O‗Reilly Media, 2009.

REFERENCES:
1. DanielJurafsky and James H Martin, “Speech and Language Processing:
An introduction to Natural Language Processing, Computational
Linguistics and Speech Recognition”, 2nd Edition, Prentice Hall, 2008.
2. James Allen, “Natural Language Understanding”, 2nd edition, Benjamin /
Cummings publishing company, 1995.
3. Hobson lane, Cole Howard, Hannes Hapke, “Natural language processing
in action” MANNING Publications, 2019.
4. Alexander Clark, Chris Fox, Shalom Lappin, “The Handbook of
Computational Linguistics and Natural Language Processing”, Wiley-
Blackwell, 2012.
5. Anne Kao and Stephen R. Poteet (Eds), “Natural Language Processing and
Text Mining”, Springer-Verlag London Limited, 2007.

WEB REFERENCES:
1. https://www.tutorialspoint.com/natural_language_processing/
natural_language_processing_information_retrieval.htm
2. https://towardsdatascience.com/your-guide-to-natural-language-
processing-nlp-48ea2511f6e1
3. https://machinelearningmastery.com/natural-language-processing/
4. https://becominghuman.ai/a-simple-intr oduction-to-natural-language-
processing-ea66a1747b32

ONLINE RESOURCES:
1. https://www.coursera.org/learn/language-processing
2. https://www.youtube.com/playlist?list=PLoROMvodv4rOhcu
XMZkNm7j3fVwBBY42z

223
 Syllabus CSE
OUT COMES:
Upon completion of the course, the student should be able to
1. Learn the approaches of syntax and semantics in NLP. (K1)
2. Understand approaches to discourse, generation, dialogue and
summarization within NLP. (K1)
3. Implement current methods for statistical approaches to machine
translation. (K3)
4. Analyse machine learning techniques used in NLP. (K3)
5. Apply information retrieval techniques. (K2)
6. Develop a Statistical Methods for Real World Applications and explore
deep learning based NLP. (K3)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3 3 - - - 1 2 - 1 2 2

CO2 2 3 3 2 3 2 - 1 3 1 2 2 3 2

CO3 3 3 2 2 - - - 1 2 1 3 2 1 1

CO4 3 3 1 - 3 - - 2 1 1 - 1 2 1

CO5 3 3 3 3 3 - - 1 1 1 2 1 1 1

CO6 2 2 1 - 1 1 - - - - 1 1 2 2

PROFESSIONAL ELECTIVES - III

20CSEL705 L T P C
ETHICAL HACKING
SDG NO. 4 & 16 3 0 0 3

OBJECTIVES:
l To teach students how to think like a hacker providing them with a deep
understanding of security issues and concerns
l To provide the students with specialist knowledge and experience of
advanced hacking techniques and their countermeasures
l To critically evaluate the potential countermeasures to advanced hacking
techniques
l To analyze and critically evaluate techniques used to break into an insecure
web application and identify relevant countermeasures

224
 Syllabus CSE
UNIT I INTRODUCTION 9
Understanding the Importance of Security - Concept of Ethical Hacking and
Essential Terminologies-Threat - Attack - Vulnerabilities - Target of Evaluation
- Exploit - Phases Involved In Hacking - Foot Printing - Scanning - System
Hacking - Session Hijacking.

UNIT II BUFFER OVERFLOWS AND SNIFFERS 9

Signi icance of Buffer Over low Vulnerability - Why Programs/Applications is
Vulnerable - Reasons for Buffer Over low Attacks - Methods of Ensuring that
Buffer Over lows are Trapped - Sniffers - Active and Passive Snif ing - ARP
Poisoning and Counter measures - Man in the Middle Attacks - Spoo ing and
Snif ing Attacks - Snif ing Countermeasures.

UNIT III SQL INJECTION 9

Attacking SQL Servers - Snif ing - Brute Forcing and Finding Application
Con iguration Files - Input Validation Attacks - Preventive Measures - Web
Application Threats - Web Application Hacking - Cross Site Scripting / XSS
Flaws / Countermeasures Correct Web Application Set-up.

UNIT IV WEB APPLICATION SECURITY AND TECHNOLOGIES 9

Core Defence Mechanisms - Handling User Access - Authentication - Session
Management - Access Control - Web Application Technologies - HTTP Protocol
- Requests - Responses and Methods - Encoding Schemes - Server Side
Functionality Technologies (Java, ASP, PHP).

UNIT V ATTACKING AUTHENTICATION 9

Attacking Session Management - Design Flaws in Authentication Mechanisms
Attacking Forgotten Password Functionality - Attacking Password Change
Functions - Countermeasures to Authentication Attacks - Attacking Other
Users - Re lected XSS Vulnerabilities - Stored XSS Vulnerabilities - DOM-Based
XSS Vulnerabilities - HTTP Header Injection, Counter Measures to XSS.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Patrick Engebretson, “The Basics of Hacking and Penetration Testing”,
Elsevier, 2013.
2. Rajat Khare, “Network Security and Ethical Hacking”, Luniver Press, 2006.

REFERENCES:
1. AnkitFadia, Manu Zacharia, Thomson “Network Intrusion Alert: An
Ethical Hacking Guide to Intrusion Detection”, Course Technology PTR,
2007.
225
 CSE Syllabus
2. Thomas Mathew, “Ethical Hacking”, OSB Publisher, 2003.
3. Stuart McClure, Joel Scambray and George Kurtz, “Hacking Exposed:
Network Security Secrets & Solutions”, McGraw-Hill, 2005.
4. Jon Erickson, “Hacking: The Art of Exploitation”, Second Edition, No Starch
Press, 2008.
5. Dafydd Stuttard, “The Web Application Hacker’s Handbook”, Second
Edition, Wiley, 2011.

WEB REFERENCES:
1. https://swayam.gov.in/nd1_noc19_cs68/preview
2. https://nptel.ac.in/courses/106105217/
3. https://medium.com/quick-code/the-best-ethical-hacking-video-
tutorials-for-everyone-e0cbd465b03c

ONLINE RESOURCES:
1. h t t p s : / / w w w. o r e i l l y. c o m / l i b r a r y / v i e w / e t h i c a l - h a c k i n g /
9781491978375/
2. https://www.guru99.com/ethical-hacking-tutorials.html

OUTCOMES:
Upon completion of the course, the students should able to
1. Obtain knowledge about Ethical hacking and basics of web application
attacks(K3)
2. Learn about various types of attacks, attackers and security threats and
vulnerabilities present in the computer system.(K1)
3. Examine how social engineering can be done by attacker to gain access of
useful & sensitive information about the con idential data.(K2)
4. Review and practice computer and network etiquette and ethics found in
working environments.(K3)
5. Acquire knowledge of the tools, techniques and ethical issues likely to face
the domain of ethical hacking and ethical responsibilities(K3)
6. Evaluate best practices in security concepts to maintain con identiality,
integrity and availability of computer systems(K3)

226
 Syllabus CSE
CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 2 - 3 - - - - - - - 2 1

CO2 2 3 1 - 2 - - - - - 1 - 3 2

CO3 1 - 3 2 - - - - 1 - - - 3 2

CO4 1 - 2 3 - 3 - - - 2 - - 2 1

CO5 2 1 2 - - - 2 2 1 - - 3 2 3

CO6 3 2 2 1 - - - 1 1 2 - 1 2 2

PROFESSIONAL ELECTIVES - III

20CSEL706 MULTI-CORE ARCHITECTURES L T P C
SDG NO. 4 & 9 AND PROGRAMMING 3 0 0 3

OBJECTIVES:
l To understand the need for Multi-core processors and their architectures
l To understand the challenges in Parallel and Multi-threaded programming
l To learn about the various Parallel Programming paradigms
l To develop Multi-core programs and design parallel solutions

UNIT I MULTI-CORE PROCESSORS 9

Single core to Multi-core Architectures - SIMD and MIMD Systems-
Interconnection Networks-Symmetric and Distributed Shared Memory
Architectures- Cache Coherence - Performance Issues - Parallel Program
Design.

UNIT II PARALLEL PROGRAM CHALLENGES 9

Performance - Scalability - Synchronization and Data Sharing – Data Races -
Synchronization Primitives (Mutexes, Locks, Semaphores, Barriers) -
Deadlocks and LiveLocks - Communication between Threads (Condition
Variables - Signals - Message Queues and Pipes).

UNIT III SHARED MEMORY PROGRAMMING WITH OpenMP 9

OpenMP Execution Model - Memory Model - OpenMP Directives - Work-
sharing Constructs - Library functions - Handling Data and Functional
Parallelism - Handling Loops - Performance Considerations

227
 SyllabusCSE
UNIT IV DISTRIBUTED MEMORY PROGRAMMING WITH MPI 9
MPI Program Execution - MPI Constructs - Libraries - MPI Send and Receive -
Point-to-Point and Collective Communication - MPI Derived Data Types -
Performance Evaluation.

UNIT V PARALLEL PROGRAM DEVELOPMENT 9

Case studies - n-body Solvers - Tree Search - OpenMP and MPI
Implementations and Comparison.
TOTAL: 45 PERIODS

TEXT BOOKS:
1. Peter S. Pacheco, “An Introduction to Parallel Programming”, Morgan-
Kauffman/Elsevier, 2011.
2. Darryl Gove, “Multicore Application Programming for Windows, Linux,
and Oracle Solaris”, Pearson, 2011 (Unit 2).

REFERENCES:
1. Michael J Quinn, “Parallel programming in C with MPI and OpenMP”, Tata
McGraw Hill, 2003.
2. Shameem Akhter and Jason Roberts, “Multi-core Programming”, Intel
Press, 2006.
3. Yan Solihin, “Fundamentals of Parallel Multicore Architecture” CRC press,
2015.
4. John L. Hennessey and David A. Patterson, “ Computer Architecture – A
Quantitative Approach”, Morgan Kaufmann / Elsevier, 5th edition, 2012.
5. Richard Y. Kain, “Advanced Computer Architecture a Systems Design
Approach”, Prentice Hall, 2011.

WEB REFERENCES:
1. https://swayam.gov.in/nd1_noc19_cs45/preview

ONLINE RESOURCES:
1. https:// youtube.be/FauseE2FtUsY
2. https://slideplayer.com/slide/7106313/&9784375

OUTCOMES:
Upon completion of the course, the student should be able to:
1. Understand the basics of Multi-core Architectures. (K2)
2. Understand the challenges in Parallel and Multithreaded programming.
(K2)
228
 Syllabus CSE
3. Explain about the various Parallel Programming paradigms and
solutions.(K2)
4. Identify the issues in programming Parallel Processors.(K2)
5. Write programs using Open MP and MPI. (K3)
6. Compare and contrast programming for Serial Processors and
programming for Parallel Processors.(K2)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 2 1 2 2 1 2 - 1 2 - 1 3 1

CO2 2 3 1 2 2 1 2 - 1 2 - 1 3 1

CO3 2 1 2 2 2 1 1 1 1 1 2 2 3 1

CO4 3 2 1 1 2 1 - - 1 2 2 3 3 1

CO5 2 2 1 2 2 1 - - 1 2 2 3 3 1

CO6 2 2 - 1 2 1 - - 1 2 2 3 3 1

PROFESSIONAL ELECTIVES - III

20CSEL707 L T P C
WEB ANALYTICS
SDG NO. 4 3 0 0 3
OBJECTIVES:
l To know the importance of qualitative data, get insights and techniques.
l To develop customer-centric approach in dealing with data.
l To know the principles, tools and methods of web intelligence.
l To apply analytics for business situations.

UNIT I INTRODUCTION 9
Web Analytics – Basics – Traditional Ways – Expectations – Data Collection –
Click stream Data – Weblogs – Beacons – JavaScript Tags – Packet Snif ing –
Outcomes data – Competitive data – Search Engine Data.

UNIT II STRATEGIES FOR ANALYTICS 9

Qualitative Analysis – Customer Centricity – Site Visits – Surveys –
Questionnaires – Website Surveys – Post visits – Creating and Running-
Bene its of surveys – Critical components of successful strategy.

229
 Syllabus CSE
UNIT III CONCEPTS OF WEB ANALYTICS 9
Web Analytic concepts – URLS – Cookies – Time on site – Page views –
Understand standard reports – Website content quality – Navigation reports
(top pages, top destinations, site overlay). – Search Analytics – Internal search,
SEO and PPC – Measuring Email and Multichannel Marketing - Competitive
intelligence and Web 2.0 Analytics – Segmentation – Connectable reports.

UNIT IV GOOGLE ANALYTICS 9

Analytics - Cookies - Accounts vs Property - Tracking Code - Tracking Unique
Visitors - Demographics - Page Views & Bounce Rate Acquisitions - Custom
Reporting.

UNIT V ADVERTISING AND PROMOTION 9

Goals & Funnels – Filters - Ecommerce Tracking - Real Time Reports -
Customer Data Alert - Adwords Linking - Adsense Linking -Attribution
Modeling - Segmentation - Campaign Tracking - Multi-Channel Attribution.
TOTAL: 45 PERIODS

TEXT BOOKS:
1. Avinash Kaushik, “Web Analytics 2.0: The Art of Online Accountability and
Science Of Customer Centricity “, 1st edition, Sybex, 2009.
2. Jason Burby, Shane Atchison, Jim Sterne, “Actionable Web Analytics: Using
Data to Make Smart Business Decisions”, 1st edition, Sybex , 29 May 2007

REFERENCES:
1. Michael Beasley, “Practical Web Analytics for User Experience: How
Analytics can help you Understand your Users”, Morgan Kaufmann, 2013.
2. Magy Seif El-Nasr, Anders Drachen, Alessandro Canossa, eds., “Game
Analytics: Maximizing the Value of Player Data”, Springer, 2013.
3. Bing Liu, “Web Data Mining: Exploring Hyperlinks, Content, and Usage
Data”, 2nd Edition, Springer, 2011.
4. Justin Cutroni, “Google Analytics”, O’Reilly, 2010.
5. Eric Fettman, Shiraz Asif, FerasAlhlou , “Google Analytics Breakthrough”,
John Wiley & sons, 2016.

WEB REFERENCES:
1. https://www.simplilearn.com/web-analytics-guide-for-newbies-article
2. https://www.tutorialspoint.com/web_analytics/web_analytics_tutorial.
pdf

230
 CSE Syllabus
ONLINE RESOURCES:
1. https://www.techtarget.com/searchbusinessanalytics/de inition/Web-
analytics
2. https://www.optimizely.com/optimization-glossary/web-analytics/

OUTCOMES:
Upon completion of the course, the student should be able to:
1 Know the concepts and terminologies related to web analytics. (K1)
2 Explore various parameters used for web analytics and their impact. (K3)
3 Explore the use of tools and techniques of web analytics. (K3)
4 Get experience on websites, web data insights and conversions. (K2)
5 Find out the applications of IoT in real time scenario.(K3)
6 List the quanti iable and measurable data of your website with the aim of
understanding and optimizing the web usage.(K2)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 3 2 - - - - 2 - - 3 3 2

CO2 3 3 3 2 - - - - 2 - - 2 3 2

CO3 3 3 3 2 - 2 - - 2 - - 2 3 2

CO4 3 3 3 3 - - - - 2 - - 3 3 2

CO5 3 3 3 3 - - - - - - - - 3 2

CO6 3 3 3 3 - - - - - - - - 3 2

PROFESSIONAL ELECTIVES - III

20CSEL708 IT SECURITY COMPLIANCE AND L T P C
SDG NO. 4 FORENSICS 3 0 0 3
OBJECTIVES:
l To understand the current security landscape, including the nature of threat
and vulnerabilities
l To justify the need for appropriate strategies and processes for disaster
recovery and fault tolerance
l To Know about the emerging security solutions for Web and Email
l To assess the current information security compliance and network
forensics security tools, evidence and investigations

231
 Syllabus CSE
UNIT I INFORMATION SECURITY FUNDAMENTALS 9
Importance of Computer and Network Security – Con identiality – Integrity-
Av a i l a b i l i t y - A c c o u n t a b i l i t y – N o n - r e p u d i a t i o n - T h r e a t s a n d
Countermeasures- Policies and Standards – Authentication overview –
Authentication credentials & protocols – Authentication services : LDAP,
RADIUS, TACACS –Best practices for secure authentication – Authorization
and access control models – Implementing access control on Windows and
Unix

UNIT II NETWORK SECURITY & SERVER SECURITY 9

Best Practices for Network Security - Securing Network Transmission -
Analyzing Security Requirements for Network Traf ic- De ining Network
Perimeters - Data Transmission Protection Protocols - Server Roles and
Baselines - Securing Network Infrastructure Servers- Securing Domain
Controllers - Securing File , Print and Application Servers.

UNIT III A P P L I C AT I O N S E C U R I T Y A N D D I SA S T E R R E COV E RY

ASSURANCE 9
Web Browser Security - Email Security – Planning for the worst - Creating a
Backup Strategy - Designing for Fault Tolerance.

UNIT IV INFORMATION SECURITY COMPLIANCE 9

Develop an Information System Strategy - Integrate security into an
organization – Security compliance management and auditing – Information
security program metrics.

UNIT V FORENSICS AND SECURITY 9

Managing Updates - Auditing and Logging- Secure Remote Administration -
Intrusion Detection - Honeypots – Forensics: Understanding Evidence -
Gathering Evidence on a Live System - Preparing a Hard Drive Image -
Searching for Data on a Hard Drive – Forensic Laboratories – Forensics Tools
–Network Forensics : Network Security Tools – Incidence response – Network
evidence and investigation.
TOTAL : 45 PERIODS
TEXT BOOKS:
1. Cole, Eric, Rachelle Reese, Ronald L. Krutz, and James Conley, “Network
Security Fundamentals”, United Kingdom: Wiley, John Sons, 2008. (ISBN
No.:978- 0-470-10192-6).
2. Jason Andress, Mark Leary, “Building a Practical Information Security
Program”, Syngress Publication ,2017,

232
 Syllabus CSE
REFERENCES:
1. John Sommons, “The Basics of Digital Forensics - The Primer for Getting
Startedin Digital Forensics”, Syngress Publication , 2012.
2. Joshi, James, Bruce S. Davie, and Saurabh Bagchi, “Network Security:Know
It All” , United States: Morgan Kaufmann Publishers In, 2008.(ISBN No.:
978-0-12- 374463-0).
3. Ciampa, Mark. “Security Guide to Network Security Fundamentals”. 4th
edition, Boston, MA:Course Technology, Cengage Learning, 2011. (ISBN
No. : 978-1-111- 64012-5)
4. Thomas R, “Information Security Fundamentals”, 2nd edition, CRC
Press.Boca Raton, FL: Auerbach Publications, 2014. (ISBN No.: 978-1-
4398-1063-7)
5. V a c c a , J o h n R . , e d . “ N e t w o r k a n d S y s t e m S e c u r i t y ”
UnitedStates:SyngressMedia,U.S., 2010. (ISBN No. : 978-1-59749-535-6).

WEB REFERENCES :
1. https://www.google.com/search?q=information+security+fundamentals
+pdf&oq=INFORMATION+SECURITY+FUNDAMENTALS+&aqs=chrome.2.
69i57j0i512l9.21467j0j7&sourceid=chrome&ie=UTF-8
2. h t t p s : / / w w w. c g i . c o m / s i t e s / d e f a u l t / i l e s / 2 0 1 9 - 0 8 / c g i -
understandingcybersecurity-standards-white-paper.pdf
3. https://www.google.com/search?q=forensics+and+security&oq=FOREN
SICS+AND+SECURITY&aqs=chrome.0.0i512j0i22i30l7j0i22i30i457j0i22i
30.6488j1j7&sourceid=chrome&ie=UTF-8

OUTCOMES:
Upon completion of the course, the student should be able to
1. Remember various vulnerabilities of computer network systems, as well
as the different modes of attack. (K1)
2. Understand design techniques to prevent security attacks. (K2)
3. Summarize about the emerging security solutions for Web and Email.(K2)
4. Apply and Build disaster recovery and fault tolerance systems.(K3)
5. Identify the need for information security compliance, forensics and
security.(K3)
6. Understand Network Security Tools and Applications.(K2)

233
 Syllabus CSE
CO- PO,PSO MAPPING:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 1 1 1 3 2 - 2 1 - 1 3 2 2

CO2 3 2 1 1 3 2 - 1 1 - 1 3 3 1

CO3 3 3 3 3 3 3 - 2 3 - 3 3 3 3

CO4 3 3 3 3 3 3 - 2 3 - 3 3 3 3

CO5 3 1 2 2 3 2 - 2 1 - 2 3 2 2

CO6 3 1 2 1 3 2 - 2 1 - 1 3 3 2

PROFESSIONAL ELECTIVES - III

20MEPC702 L T P C
ROBOTICS AND APPLICATIONS
SDG NO. 4 & 9 3 0 0 3

OBJECTIVES:
l Learn the basics of Robotics and their applications
l Study the need for various Sensors and Drives in robotics
l Gain thorough knowledge about the Robot Kinematics and Path Planning
and different Trajectories
l Apply the programming of Robots in contemporary use

UNIT I INTRODUCTION TO ROBOTICS 9

Basics - Types - Mobility - Terrain - Components Classi ication and
Performance Characteristics.

UNIT II WORKING COMPONENTS FOR ROBOTS 9

Drives - Electric - Hydraulic and Pneumatic Drives - Tactile sensors - Proximity
and Range Sensors - Acoustic Sensors - Vision Sensor Systems - Image
Processing and Analysis - Image Data Reduction - Segmentation - Feature
Extraction - Object Recognition.

UNIT III ROBOT KINEMATICS AND DYNAMICS 9

Kinematics of Manipulators - Rotational - Translation and Transformation -
Homogeneous Transformations - Denavat Hartenberg Representation -
Inverse Kinematics - Linearization of Robot Dynamics, State Variable
Continuous and Discrete Models.

234
 Syllabus CSE
UNIT IV PATH PLANNING 9
Types of Trajectories - Trajectory Planning and Avoidance of Obstacles - Path
Planning - Skew Motion - Joint Integrated Motion and Straight Line Motion.

UNIT V APPLICATION OF ROBOTS 9

Industrial Automation - Robots for Nuclear - Thermal and Chemical Plants -
Remote Controlled Robots - Typical Examples of Automated Industries.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Mikell P. Groover, “Industrial Robotics: Technology, Programming and
Applications”, 2012, 2nd Edition, McGraw-Hill Publishers.
2. John J. Craig, “Introduction to Robotics, Mechanics and Control”, 2010, 3rd
Edition, Pearson Education.

REFERENCES:
1. M.W. Spong and M. Vidyasagar, “Robot Dynamics and Control,” 2nd Edition,
John Wiley & Sons, New York, 2012.
2. Lorenzo Sciavicco Bruno Siciliano, “Modelling and Control of Robot
Manipulators”, 1st Edition, Springer Science & Business Media, Berlin,
2012.
3. Deb.S.R and Sankha Deb, "Robotics Technology and Flexible Automation",
Tata McGraw Hill Publishing Company Limited, 2010.
4. Klafter.R.D, Chmielewski.T.A, and Noggin’s., “Robot Engineering: An
Integrated Approach”’, Prentice Hall of India Pvt. Ltd., 1994.

WEB REFERENCES:
1. https://nptel.ac.in/courses/112/105/112105249/
2. https://www.coursera.org/learn/mobile-robot

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand the necessity and basics of Robotics in real time
applications.(K2)
2. Explain the components and working principle in Robots. (K2)
3. Apply the use of Image Processing, Obstacle detection and Path planning
in Robotic applications. (K3)
4. Demonstrate the mathematical model of Robotic systems. (K3)
5. Apply mathematical modeling in Kinematic behavior. (K3)

235
 Syllabus CSE
CO- PO,PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 2 2 - 2 - - - - - 1 2 2

CO2 3 2 2 2 - - - - - - - 1 2 2

CO3 3 3 3 3 2 - - - - - - 1 3 2

CO4 3 3 3 3 1 - - - - - - 2 3 2

CO5 3 3 3 3 1 - - - - - - 1 2 2

PROFESSIONAL ELECTIVES - IV
20ITEL803 L T P C
INTRUSION DETECTION SYSTEMS
SDG NO. 4 & 9 3 0 0 3
OBJECTIVES:
l To Compare alternative tools and approaches for Intrusion Detection
through quantitative analysis
l To determine the best tool or approach to reduce risk from intrusion.
l To Identify and describe the parts of all intrusion detection systems and
characterize new
l To merge IDS technologies according to the basic capabilities all intrusion
detection systems share.

UNIT I INTRODUCTION 9
The state of threats against computers, and networked systems-Overview of
computer security solutions and why they fail-Vulnerability assessment,
irewalls, VPN’s -Overview of Intrusion Detectionand Intrusion Prevention,
Network and Host-based IDS

UNIT II CLASSES OF ATTACKS AND ITS LAYERS 9

Classes of attacks - Network layer: scans, denial of service, penetration
Application layer:software exploits, code injection-Human layer: identity
theft, root access-Classes of attackers-Kids/hackers/sopHesitated groups-
Automated: Drones, Worms, Viruses

UNIT III IDS MODELS 9

A General IDS model and taxonomy, Signature-based Solutions, Snort, Snort
rules, Evaluation of IDS,Cost sensitive IDS

236
 Syllabus CSE
UNIT IV DETECTION SYSTEMS AND VULNERABILITIES 9
Anomaly Detection Systems and Algorithms-Network Behaviour Based
Anomaly Detectors (ratebased)-Host-based Anomaly Detectors-Software
Vulnerabilities-State transition, Immunology, PayloadAnomaly Detection

UNIT V ATTACKS AND THREATS 9

Attack trees and Correlation of alerts- Autopsy of Worms and Botnets-
Malware detection -Obfuscation,polymorphism- Document vectors.Email/IM
security issues-Viruses/Spam-From signatures to thumbprints to zero day
detection-InsiderThreat issues-Taxonomy-Masquerade and Impersonation
Traitors, Decoys and Deception-Future:Collaborative Security
TOTAL: 45 PERIODS
TEXT BOOKS :
1. Peter Szor, “The Art of Computer Virus Research and Defense”, Symantec
Press,2005
2. Markus Jakobsson and Zul ikar Ramzan, “Crimeware, Understanding New
Attacks and Defenses”,2008

REFERENCES:
1. Saiful Hasan, “Intrusion Detection System, Kindle Edition”,2018
2. Ankit Fadia, “Intrusion Alert: An Ethical Hacking Guide to Intrusion
Detection”,2007
3. Ali A. Ghorbani, Wei Lu, “Network Intrusion Detection and
Prevention:Concepts and Techniques”, Springer, 2010.
4. Carl Enrolf, Eugene Schultz, Jim Mellander, “Intrusion detection and
Prevention”, McGraw Hill, 2004
5. Paul E. Proctor, “The Practical Intrusion Detection Handbook “,Prentice
Hall , 2001.

WEB REFERENCES:
1. https://www.intechopen.com/books/intrusion-detection-systems/
2. https://www.sans.org/course/intrusion-detection-in-depth
3. https://www.cybrary.it/skill-certi ication-course/ids-ips-certi ication-
raining-course

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand fundamental knowledge of Cyber Security.[K2]
2. Analyze various vulnerability and its implementation.[K2]
3. Understand basic and fundamental risk management principles as it
relates to Cyber Security and Mobile Computing.[K2]

237
 Syllabus CSE
4. Implement safer computing to safeguard information using Digital
Forensics. [K3]
5. Describe basic technical controls in use today, such as irewalls and
Intrusion Detection Systems. [K2]
6. Illustrate legal perspectives of Cyber Crimes and Cyber Security.[K3]

CO- PO, PSO MAPPING :

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 1 1 - - 3 2 - - - - - 2 3 3

CO2 2 2 2 2 3 1 - - - - - 2 3 3

CO3 2 2 2 2 3 1 - - - - - 2 3 3

CO4 2 2 2 2 3 2 - - - - - 2 3 3

CO5 2 2 2 2 3 2 2 2 1 - - 2 3 3

PROFESSIONAL ELECTIVES - III

20MGEL701 FOUNDATION SKILLS IN L T P C
SDG NO. 9 & 12 INTEGRATED PRODUCT DEVELOPMENT 3 0 0 3

OBJECTIVES:
l To understand the global trends and development methodologies of
various types of products and services.
l To conceptualize, prototype and develop product management plan for a
new product based on the type of the new product and development
methodology integrating the hardware, software, controls, electronics and
mechanical systems.
l To understand requirement engineering and know how to collect, analyze
and arrive at requirements for new product development and convert
them in to design speci ication.
l To understand system modeling for system, sub-system and their
interfaces and arrive at the optimum system speci ication and
characteristics.
l To develop documentation, test speci ications and coordinate with
various teams to validate and sustain up to the EoL (End of Life) support
activities for engineering customer.

238
 Syllabus CSE
UNIT I FUNDAMENTALS OF PRODUCT DEVELOPMENT 9
Global Trends Analysis and Product decision - Social Trends - Technical
Trends- Economical Trends - Environmental Trends - Political/Policy Trends -
Introduction to Product Development Methodologies and Management -
Overview of Products and Services - Types of Product Development -
Overview of Product Development methodologies - Product Life Cycle –
Product Development Planning and Management.

UNIT II REQUIREMENTS AND SYSTEM DESIGN 9

Requirement Engineering - Types of Requirements - Requirement
Engineering - traceability Matrix and Analysis - Requirement Management -
System Design & Modeling - Introduction to System Modeling - System
Optimization - System Speci ication - Sub-System Design - Interface Design.

UNIT III DESIGN AND TESTING 9

Conceptualization - Industrial Design and User Interface Design - Introduction
to Concept generation Techniques – Challenges in Integration of Engineering
Disciplines - Concept Screening & Evaluation - Detailed Design - Component
Design and Veri ication – Mechanical, Electronics and Software Subsystems -
High Level Design/Low Level Design of S/W Program - Types of Prototypes,
S/W Testing- Hardware Schematic, Component design, Layout and Hardware
Testing – Prototyping - Introduction to Rapid Prototyping and Rapid
Manufacturing - System Integration, Testing, Certi ication and Documentation

UNIT IV SUSTENANCE ENGINEERING AND END-OF-LIFE (EOL) SUPPORT 9

Introduction to Product veri ication processes and stages - Introduction to
Product Validation processes and stages - Product Testing Standards and
Certi ication - Product Documentation - Sustenance -Maintenance and Repair
– Enhancements - Product EoL - Obsolescence Management – Con iguration
Management - EoL Disposal.

UNIT V BUSINESS DYNAMICS – ENGINEERING SERVICES INDUSTRY 9

The Industry - Engineering Services Industry - Product Development in
Industry versus Academia –The IPD Essentials - Introduction to Vertical
Speci ic Product Development processes -Manufacturing/Purchase and
Assembly of Systems - Integration of Mechanical, Embedded and Software
Systems – Product Development Trade-offs - Intellectual Property Rights and
Con identiality – Security and Con iguration Management.
TOTAL: 45 PERIODS

239
 Syllabus CSE
TEXT BOOK:
1. Book specially prepared by NASSCOM as per the MoU.
2. Karl T Ulrich and Stephen D Eppinger, "Product Design and Development",
Tata McGraw Hill, 5th Edition, 2011.
3. John W Newstorm and Keith Davis, "Organizational Behavior", Tata
McGraw Hill, 11th Edition, 2005.

REFERENCES :
1. Hiriyappa B, “Corporate Strategy – Managing the Business”, Author House,
2013.
2. Peter F Drucker, “People and Performance”, Butterworth – Heinemann
[Elsevier], Oxford, 2004.
3. Vinod Kumar Garg and Venkita Krishnan N K, “Enterprise Resource
Planning – Concepts”, 2nd Edition, Prentice Hall, 2003.
4. Mark S Sanders and Ernest J McCormick, "Human Factors in Engineering
and Design", McGraw Hill Education, 7th Edition, 2013.

WEB REFERENCES:
1. https://www.udemy.com/course/strategic-product-management-and-
leadership/
2. https://www.udemy.com/course/building-insanely-great-products/
3. https://www.coursera.org/learn/customer-insights-orientation

ONLINE RESOURCES:
1. https://pursuite-production.s3-ap-southeast-1.amazonaws.com/
media/cms_page_media/162/FSIPD+OBF+-+2012+F0_1.pdf
2. https:// futureskillsnasscom. edcast. com/ pathways/ product-
management-primer-pathway/cards/5603673#

OUTCOMES:
Upon completion of the course, the students should be able to
1. Explain the basic essentials of product development. (K2)
2. Discuss the learnings to incorporate effective design for product
development. (K2)
3. Describe the various tools of innovation & product development process in
the Business context. (K2)
4. Identify the various process and choose the appropriate tools for
designing, development and testing. (K2)

240
 Syllabus CSE
5. Discuss disruptive models / process to manage a product development
from start to inish. (K2)

CO-PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 3 1 2 2 1 1 - - 2 - -

CO2 3 3 3 3 2 1 1 - 3 - 2 -

CO3 3 2 3 3 3 1 2 1 3 - 2 3

CO4 3 3 2 3 2 - - - - 2 - -

CO5 3 3 3 3 2 1 2 1 3 - 3 -

241
 Syllabus CSE

PROFESSIONAL ELECTIVES - IV
20CSEL801 L T P C
GREEN COMPUTING
SDG NO. 4 & 10 3 0 0 3

OBJECTIVES:
l To learn the fundamentals of Green Computing
l To analyze the Green computing Grid Framework
l To understand the issues related with Green compliance
l To study and develop various case studies

UNIT I FUNDAMENTALS 9
Green IT Fundamentals: Business - IT and the Environment – Green
Computing: Carbon Foot Print - Scoop on Power – Green IT Strategies - Drivers
- Dimensions and Goals – Environmentally Responsible Business - Policies -
Practices and Metrics

UNIT II GREEN ASSETS AND MODELING 9

Green Assets: Buildings - Data Centers - Networks and Devices – Green
Business Process Management - Modeling - Optimization and Collaboration –
Green Enterprise Architecture – Environmental Intelligence – Green Supply
Chains – Green Information Systems - Design and Development Models

UNIT III GRID FRAMEWORK 9

Virtualization of IT systems – Role of Electric Utilities - Telecommuting -
Teleconferencing and Teleporting – Materials recycling – Best ways for Green
PC – Green Data center – Green Grid framework

UNIT IV GREEN COMPLIANCE 9

Socio cultural aspects of Green IT – Green Enterprise Transformation
Roadmap – Green Compliance: Protocols - Standards and Audits – Emergent
Carbon Issues - Technologies and Future.

UNIT V CASE STUDIES 9

The Environmentally Responsible Business Strategies (ERBS) – Case Study
Scenarios for Trial Runs – Case Studies – Applying Green IT Strategies and
Applications to a Home - Hospital - Packaging Industry and Telecom Sector
TOTAL: 45 PERIODS

242
 CSE
Syllabus
TEXT BOOKS:
1. Bhuvan Unhelkar “Green IT Strategies and Applications” Using
Environmental Intelligence, CRC Press, June 2014.
2. Woody Leonhard, Katherine Murray “Green Home computing for
dummies”, August 2012.

REFERENCES:
1. Alin Gales, Michael Schaefer, Mike Ebbers, “Green Data Center: steps for
the Journey '', Shroff IBM/rebook, 2011.
2. John Lamb, “ The Greening of IT” Pearson Education, 2009.
3. Jason Harris “Green Computing and Green IT Best Practices on
regulations & industry”, Lulu.com, 2008
4. Carl Speshocky “Empowering Green Initiatives with IT” John Wiley &
Sons, 2010.
5. Wu Chun Feng (editor) “Green computing: Large Scale energy
ef iciency”, CRC Press

WEB REFERENCES:
1. https://www.tutorialspoint.com/environmental_studies/environmental_
studies_towards_sustainable_future.htm
2. https://www.javatpoint.com/green-computing

OUTCOMES:
Upon completion of the course, the students should be able to
1. Understand green computing fundamentals to minimize negative
impacts on the environment (K2)
2. Discuss Green Assets, Green Process Management towards optimization
and collaboration (K2)
3. Develop models that can reduce paper waste and carbon footprint for
Green Information System (K3)
4. Explain different ways towards green PC, green Data Centre and green
Grid (K2)
5. Summarize cultural aspects, protocols and standards of green
computing (K2)
6. Apply Green IT Strategies to various sectors to create green society (K3)

243
 Syllabus CSE
CO- PO, PSO MAPPING:
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 2 2 - 1 1 - - 1 1 2 3 2

CO2 2 3 1 2 - 1 2 - 1 2 1 1 2 2

CO3 3 3 2 2 - 1 1 - 1 2 2 3 2 1

CO4 3 2 1 - - 1 1 - 2 1 1 1 2 2

CO5 2 1 2 1 - 1 - - 2 2 1 2 1 1

CO6 3 3 2 1 - 1 1 - 2 1 2 1 3 2

PROFESSIONAL ELECTIVES - IV
20CSEL802 DEEP LEARNING PRINCIPLES L T P C
SDG NO. 4 & 9 AND PRACTICES 3 0 0 3

OBJECTIVES:
l To study the concepts of Deep Learning
l To introduce Dimensionality Reduction techniques
l To illustrate Deep Learning techniques to support Real-time
applications
l To examine the case studies of Deep Learning techniques

UNIT I INTRODUCTION 9
Introduction to Machine Learning-Linear Models - SVMs – Perceptrons -
Logistic Regression -Introduction to Neural Networks - Shallow Network -
Training a Network - Loss Functions - Back Propagation and Stochastic
Gradient Descent-Neural Networks as Universal Function.

UNIT II CONCEPTS OF DEEP LEARNING 9

History of Deep Learning - Probabilistic Theory of Deep Learning - Back
Propagation –Regularization –Batch Normalization-VC Dimension - Neural
Networks-Deep Vs Shallow Networks- Convolutional Networks-Generative
Adversarial Networks (GAN) - Semi-supervised Learning.

UNIT III METRIC LEARNING 9

Principle Component Analysis – Linear Discriminant Analysis- Manifolds -
Metric Learning -Auto Encoders -Dimensionality Reduction in Networks -
Introduction to Convolution Network - Architectures –AlexNet – Visual
Geometry Group –Inception– Residual Network.

244
 CSE
Syllabus
UNIT IV OPTIMIZATION 9
Optimization in Deep Learning–Non-Convex Optimization for Deep Networks-
Stochastic optimization-Generalization in Neural Networks-Spatial
Transformer Networks-Recurrent networks – Long Short Term Memory -
Recurrent Neural Network Language Models-Word Level.

UNIT V ADVANCED TECHNIQUES 9

ImageNet - Object Detection - Audio WaveNet - Natural Language Processing -
Word2Vec Model -Joint Detection-Bio Informatics-Face Recognition-Scene
Understanding-Gathering Image Captions.
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Cosma Rohilla Shalizi, “Advanced Data Analysis from an Elementary
Point of View”, Carnegie Mellon University, Cambridge University Press
(March 21, 2021); eBook.
2. Deng and Yu, “Deep Learning: Methods and Applications”, Now
Publishers, 2013.

REFERENCES:
1. Ethem Alpaydin, “Introduction to Machine Learning (Adaptive
Computation and Machine Learning)”, The MIT Press 2004.
2. Stephen Marsland, “Machine Learning: An Algorithmic Perspective”,
CRC Press, 2009.
3. Richard O. Duda, Peter E. Hart, David G. Stork, “Pattern Classi ication”,
Wiley, Second Edition.
4. Christopher Bishop, “Pattern Recognition and Machine Learning”,
illustrated Edition, Springer, 2006.
5. Ian Goodfellow and Yoshua Bengio and Aaron Courville, "Deep
Learning (Adaptive Computation and Machine Learning series)", An
MIT Press book, 2016.

WEB REFERENCES:
1. https://nptel.ac.in/courses/106105215/
2. https://nptel.ac.in/courses/106106201/
3. https://www.coursera.org/specializations/deep-learning

ONLINE RESOURCES:
1. https://www.simplilearn.com/deep-learning-tutorial
2. https://www.tutorialspoint.com/machine_learning/deep_machine_
learning.htm

245
 Syllabus CSE
OUTCOMES:
Upon completion of the course, the students should be able to
1. Differentiate various learning approaches and to interpret the
concepts of Machine Learning. (K2)
2. Understand the history of Deep Learning and theory behind Deep
Learning techniques and analyze it.(K2)
3. Compare the different Dimensionality Reduction techniques and study
about Convolution network technique.(K2)
4. Illustrate the working of Optimization techniques in Deep
Learning.(K3)
5. Identify the case studies in Deep Learning and identify its applicability
in real life problems.(K3)
6. Examine advanced techniques in Deep Learning like image detection,
Bio Informatics-Face Recognition.(K3)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 - 1 - 2 - - - 2 1 - 3 3 1

CO2 2 - 1 - 3 - - - 2 1 - 2 3 1

CO3 3 - 1 - 2 - - - 2 1 - 3 3 1

CO4 3 - 1 - 2 - - - 2 1 - 2 3 1

CO5 3 - 1 - 3 - - - 2 1 - 2 3 1

CO6 3 - 1 - 2 - - - 2 1 - 2 2 1

PROFESSIONAL ELECTIVES - IV
20CSEL803 BLOCK CHAIN AND CRYPTO CURRENCY L T P C
SDG NO. 4&9 TECHNOLOGIES 3 0 0 3
OBJECTIVES:
l Understand how Block Chain systems (Bitcoin and Ethereum) work
l To securely interact with them
l Design, build, deploy Smart Contracts and Distributed applications
l Integrate ideas from Block Chain technology into their own projects

246
 Syllabus CSE
UNIT I BASICS 9
Distributed Database - Two General Problem - Byzantine GeneralProblem and
Fault Tolerance - Hadoop Distributed File System - Distributed Hash Table -
ASIC Resistance - Turing Complete - Cryptography - Hash Function - Digital
Signature - ECDSA – MemoryHardAlgorithm-ZeroKnowledgeProof.

UNIT II BLOCKCHAIN 9
Introduction, Advantage Over Conventional Distributed Database - Block
Chain Network - MiningMechanism – DistributedConsensusMerkle Patricia
Tree - Gas Limit - Transactions and Fee - Anonymity - Reward - Chain Policy
- Life of Block Chain Application - Soft & Hard Fork - Private and Public
Block Chain.

UNIT III DISTRIBUTED CONSENSUS 9

Nakamoto Consensus - Proof of Work - Proof of Stake - Proof of Burn - Dif iculty
Level- Sybil Attack - Energy Utilization and Alternate.

UNIT IV CRYPTOCURRENCY 9
Crypto Currency: History - Distributed Ledger - Bit coin Protocols - Mining
Strategy and Rewards - Ethereum - Construction, - DAO - Smart Contract -
GHOST - Vulnerability - Attacks - Side Chain, Name coin

UNIT V CRYPTO CURRENCY REGULATION AND BLOCK CHAIN

APPLICATIONS 9
Crypto Currency Regulation: Stakeholders - Roots of Bit coin- Legal Aspects
- Crypto Currency Exchange-Black Market and Global Economy-Block
chainApplications: Internet of Things-Medical Record Management System-
Domain Name Service - Future of Block Chain.
TOTAL: 45 PERIODS
TEXT BOOK:
1. Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller and
Steven Goldfeder, “Bitcoin and Crypto Currency Technologies: A
Comprehensive Introduction”, Princeton UniversityPress(July 19,2016).
2. Narayanan et al., “Bit coin and Crypto currency Technologies: A
Comprehensive Introduction,” Princeton University Press, 2016.

REFERENCES:
1. Antonopoulos, “Mastering Bit coin: Unlocking Digital Crypto currencies”,
O’Reilly Media Inc., 2015.
2. Dr. Gavin Wood, “ETHEREUM: A Secure Decentralized Transaction
Ledger,”Yellowpaper, 2014.
247
3. Mastering Bitcoin: Unlocking Digital Crypto currencies, by Andreas M
Antonopoulos 2018.
4. Henning Diedrich, Ethereum: Block chains, Digital Assets, Smart
Contracts, and Decentralized Autonomous Organizations-2016.
5. Don and Alex Tapscott, “Block chain Revolution”. Portfolio Penguin 2016.

WEB REFERENCES:
1. https://www.blockchain.com/

ONLINE RESOURCES:
1. https://www.pwc.com/us/en/industries/ inancial-services/ intech/
bitcoin-blockchain-cryptocurrency.html
2. https://www.investopedia.com/terms/b/blockchain.asp

OUTCOMES:
Upon completion of the course, the student should be able to
1 Understand Design principles of Bit coin and Ethereum. (K2)
2 Ability to extract the knowledge of Nakamoto consensus. (K2)
3 List and describe differences between proof-of-work and proof-of-stake
consensus. (K1)
4 Design, build and deploy a Distributed application. (K3)
5 Ability to analyze the algorithms developed for bit coin mining. (K2)
6 Identify the security, privacy and ef iciency of a given Block Chain
system.(K1)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 2 2 2 2 - - 1 - 2 3 3 2

CO2 3 2 3 2 - 2 - - - - 3 2 3 2

CO3 3 1 3 2 1 2 - - - - 2 3 3 2

CO4 3 2 2 2 3 2 - - 1 - 2 2 3 2

CO5 3 1 2 2 3 2 - - 2 3 2 2 3 2

CO6 3 2 2 1 2 2 - - 1 - 2 3 3 2
 Syllabus CSE

PROFESSIONAL ELECTIVES - IV
20CSEL804 L T P C
SOFTWARE QUALITY ASSURANCE
SDG NO. 4 & 9 3 0 0 3

OBJECTIVES:
l Understand the basic tenets of software quality and quality factors.
l Be exposed to the Software Quality Assurance (SQA) architecture and the
details of SQA components.
l Understand how the SQA components can be integrated into the project life
cycle.
l Be familiar with the software quality infrastructure and exposed to the
management components of software quality.

UNIT I INTRODUCTION TO SOFTWARE QUALITY &

ARCHITECTURE 9
Need for Software quality – Quality Challenges – Software Quality Assurance
(SQA) – De inition and Objectives – Software Quality Factors- McCall’s Quality
Model – SQA System and Architecture – Software Project Life Cycle
Components – Pre Project Quality Components – Development and Quality
Plans.

UNIT II SQA COMPONENTS AND PROJECT LIFE CYCLE 9

Software Development Methodologies – Quality Assurance Activities in the
Development Process- Veri ication & Validation – Reviews – Software Testing
– Software Testing Implementations – Quality of Software Maintenance – Pre-
Maintenance of Software Quality Components – Quality Assurance Tools –
CASE Tools for Software Quality – Software Maintenance Quality – Project
Management.

UNIT III SOFTWARE QUALITY INFRASTRUCTURE 9

Procedures and work instructions – Templates – Checklists – 3S
Developmenting – Staff Training and Certi ication Corrective and Preventive
Actions – Con iguration Management – Software Change Control –
Con iguration Management Audit - Documentation Control – Storage and
Retrieval.

UNIT IV SOFTWARE QUALITY MANAGEMENT & METRICS 9

Project Process Control – Computerized Tools - Software Quality Metrics –
Objectives of Quality Measurement – Process Metrics – Product Metrics –

249
 Syllabus CSE
Implementation – Limitations of Software Metrics – Cost of Software Quality –
Classical Quality Cost Model – Extended Model – Application of Cost Model.

UNIT V STANDARDS, CERTIFICATIONS & ASSESSMENTS 9

Quality Management Standards – ISO 9001 and ISO 9000-3 – Capability
Maturity Models – CMM and CMMI Assessment Methodologies - Bootstrap
Methodology – SPICE Project – SQA Project Process Standards – IEEE st 1012 &
1028 – Organization of Quality Assurance – Department Management
Responsibilities – Project Management Responsibilities – SQA Units and Other
Actors in SQA Systems.
TOTAL: 45 PERIODS

TEXT BOOK:
1. Daniel Galin, “Software Quality Assurance”, Pearson Publication, 2009.
2. Alan C. Gillies, “Software Quality: Theory and Management”, International
Thomson Computer Press, 1997.

REFERENCES:
1. Alan C. Gillies, “Software Quality: Theory and Management”, International
Thomson Computer Press, 1997.
2. Milind Limaye, “Software Quality Assurance”, TMH ,New Delhi, 2011
3. Claude Y. Laporte , Alain April, “Software Quality Assurance” , Wiley-IEEE
Computer Society Pr, 1st Edition (January 4, 2018)
4. G. Gordon Schulmeyer, James I. McManus, “Handbook of Software Quality
Assurance”, Prentice Hall, 3rd Edition (8 September 1998).
5. R. Chopra , “Software Quality Assurance: A Self-Teaching Introduction” ,
Mercury Learning & Information, Illustrated Edition (13 April 2018)

WEB REFERENCES:
1. https://nptel.ac.in/courses/110105039/
2. https://nptel.ac.in/courses/106105087/

ONLINE RESOURCES :
1. http://www.softwareqatest.com/
2. https://www.tutorialride.com/software-testing/software-quality-
assurance.html

250
 Syllabus CSE
OUTCOMES:
Upon completion of the course, the students should be able to
1. Utilize the concepts in software development life cycle.(K3)
2. Demonstrate their capability to adopt quality standards.(K2)
3. Estimate the quality of software products.(K3)
4. Apply the concepts in preparing the quality plan & documents.(K3)
5. Understand standards and certi ications.(K2)
6. Apply techniques of quality assurance for typical applications(K3)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 1 2 1 1 2 - - - - 2 2 3 2

CO2 3 1 3 2 2 2 - - - 1 2 2 2 2

CO3 3 1 2 2 1 2 - - 1 1 1 2 3 2

CO4 3 1 2 2 2 2 - - - - 2 2 3 3

CO5 2 1 2 2 2 2 - - 1 2 2 3 3 2

CO6 2 1 2 2 2 2 - - - - 2 2 3 3

PROFESSIONAL ELECTIVES - IV
20CSEL805 L T P C
SPEECH PROCESSING
SDG NO. 4 & 10 3 0 0 3

OBJECTIVES:
l To understand the fundamentals of Speech Processing
l To explore the various Speech Models, Phonetics and Pronunciation
l To perform Wavelet analysis of Speech
l To understand the concepts of Speech Recognition

UNIT I INTRODUCTION 9
Introduction – Knowledge in Speech and Language Processing – Ambiguity –
Models and Algorithms – Language – Thought – Understanding – Regular
Expression And Automata – Words & Transducers – N Grams.

251
 Syllabus CSE
UNIT II SPEECH MODELLING 9
Word Classes and Part of Speech Tagging – Hidden Markov Model - Computing
Likelihood: The Forward Algorithm – Training Hidden Markov Model –
Maximum Entropy Model – Transformation – Based Tagging – Evaluation and
Error Analysis – Issues in Part of Speech Tagging – Noisy Channel Model for
Spelling.

UNIT III SPEECH PRONUNCIATION AND SIGNAL PROCESSING 9

Phonetics – Speech Sounds and Phonetic Transcription – Articulatory
Phonetics – Phonological Categories and Pronunciation Variation – Acoustic
Phonetics and Signals.

UNIT IV SPEECH IDENTIFICATION 9

Speech Synthesis – Text Normalization - Phonetic Analysis – Prosodic Analysis
– Diphone Waveform Synthesis – Unit Selection Waveform Synthesis –
Evaluation.

UNIT V SPEECH RECOGNITION 9

Automatic Speech Recognition – Architecture – Applying Hidden Markov
Model – Feature Extraction: Mfcc Vectors – Computing Acoustic Likelihoods –
Search And Decoding – Embedded Training – Multipass Decoding: N-best Lists
And Lattices – A*('stack') Decoding – Context-dependent Acoustic Models:
Triphones –discriminative Training – Speech Recognition By Humans.
TOTAL:45 PERIODS
TEXT BOOK:
1. Daniel Jurafsky and James H.Martin, “Speech and Language Processing:
An Introduction to Natural Language Processing , Computational
Linguistics and Speech Recognition”, Pearson Education, 2013.
2. Rabiner/Yegnararayana, “Fundamentals of Speech Recognition”,
Pearson India, 1st Edition, 2008.

REFERENCES:
1. Kai-Fu Lee, “Automatic Speech Recognition”, The Springer International
Series in Engineering and Computer Science, 1999.
2. Himanshu Chaurasiya, “Soft Computing Implementation of Automatic
Speech Recognition”, LAP Lambert Academic Publishing, 2010.
3. Claudio Becchetti, Klucio PrinaRicotti, “Speech Recognition: Theory and
C++ implementation”, Wiley publications 2008.

252
4. Ikrami Eldirawy, Wesam Ashour, “Visual Speech Recognition”, Wiley
publications, 2011.
5. Thomas F.Quatieri, “Discrete-Time Speech Signal Processing: Principles
and Practice”, Pearson India, 1st Edition, 2003.

WEB REFERENCES:
1. https://www.sciencedirect.com/topics/neuroscience/speech-
processing
2. https://nptel.ac.in/courses/117105145/

ONLINE RESOURCES:
1. https://www.cse.iitb.ac.in/~pjyothi/cs753/index.html
2. https://link.springer.com/chapter/10.1007/978-3-540-49127-9_1

OUTCOMES:
Upon completion of the course, the student should be able to
1. Understand the basic concepts in for Speech Processing.(K2)
2. Illustrate the various approaches in modeling the speech.(K3)
3. Describe the terms in language Phonetic. (K2)
4. Illustrate the wavelet approaches of Speech.(K3)
5. Enumerate the basics of Speech Recognition System.(K3)
6. Explain the decoding aspects of Speech Processing and Recognition. (K2)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 - - - - - 2 3 - - 3 2

CO2 3 2 3 2 2 - - - 2 3 2 - 2 3

CO3 2 1 3 - - - - - - - - - 2 2

CO4 3 3 3 2 2 - - - 2 2 2 - 3 2

CO5 3 2 2 - - - - - 2 2 - - 2 3

CO6 2 1 2 1 - - - - 1 - 1 - 2 2
 Syllabus CSE

PROFESSIONAL ELECTIVES - IV
20CSEL806 L T P C
COGNITIVE SCIENCE
SDG NO. 4 3 0 0 3

OBJECTIVES:
l To learn about theories, methods and discoveries in cognitive science, the
historical context and the philosophical roots that allowed the rising of this
multidisciplinary ield of studies.
l To help students develop general scienti ic thinking and study skills that will
be an important requirement for all the master courses
l To help students understand cognitive science application to real world
artefacts.
l To help students to develop a critical approach to scienti ic research and
literature

UNIT I INTRODUCTION TO COGNITIVE SCIENCE, PSYCHOLOGY,

NERVOUS SYSTEM AND BRAIN 9
Introduction to the study of cognitive sciences. A brief history of cognitive
science. Methodological concerns in philosophy, arti icial intelligence and
psychology. Structure and constituents of the brain; Brief history of
neuroscience; Mathematical models; Looking at brain signals.

UNIT II BRAIN AND SENSORY MOTOR INFORMATION,

REPRESENTATION OF SENSORY INFORMATION FROM
SENSATION TO COGNITION AND ROOTS OF COGNITIVE
SCIENCE 9
Processing of sensory information in the brain; Neural Network Models;
Processing of sensory information in the brain; motor and sensory areas;
Brain Imaging, fMRI, MEG, PET, EEG, Multisensory integration in cortex;
information fusion; from sensation to cognition, cybernetics; From physics to
meaning; Analog vs. Digital: Code duality

UNIT III LANGUAGE AND EMBODIMENT 9

What is language?; Linguistic knowledge: Syntax, semantics, (and
pragmatics); Generative linguistics;Brain and language; Language disorders;
Lateralization; The great past tense debate. Cognitivist and emergent
standpoints; A robotic perspective

254
 Syllabus CSE
UNIT IV AFFORDANCE IN BIOLOGICAL AND ARTIFICIAL SYSTEM AND
COGNITIVE DEVELOPMENT, ATTENTION 9
Affordances, direct perception, Ecological Psychology, affordance learning in
robotics, Development, child and robotic development, Attention and related
concepts; Human visual attention; Computational models of attention;
Applications of computational models of attention.

UNIT V LEARNING –MEMORY AND REASONING 9

Categories and concepts; Concept learning; Logic ; Machine learning,
Constructing memories; Explicit vs. implicit memory; Information processing
(three-boxes) model of memory; Sensory memory; Short term memory; Long
term memory, Rationality; Bounded rationality; Prospect theory ; Heuristics
and biases; Reasoning in computers
TOTAL: 45 PERIODS

TEXT BOOKS:
1. Gardner, The Mind’s New Science, Gardner, Howard E, “The mind's new
science: A history of the cognitive revolution”, Basic books, 2008.
2. José Luis Bermú dez, “Cognitive Science: An Introduction to the Science
of the Mind”, Cambridge University Press, New York, 2014.

REFERENCES:
1. Michael I Posner, “The Foundations of Cognitive Science”, MIT Press,
Prentice October 1993
2. José Luis Bermú dez, “Cognitive Science: An Introduction to the Science
of the Mind”, Cambridge University Press, August 2010.
3. Gilbert Ryle, “The Concept of Mind”, Cambridge University Press, 2003.
4. Pranjali Deshpande, Soudamini Patil, “Evolution of the Brain and
Intelligence”, Cambridge University Press, 2003.
5. Miller, Earl K., and Jonathan D. Cohen. “An Integrative Theory of
Prefrontal Cortex Function.” Annu Rev Neurosci 24 (2001): 167-202.
6. Bermudez Wallace, Mark T., and Barry E. Stein. "Sensory organization
of the superior colliculus in cat and monkey." Progress in brain research
112 (1996): 301-311.

WEB REFERENCES:
1. https://onlinecourses.nptel.ac.in/noc21_hs105/preview

255
 Syllabus CSE
2. https://onlinecourses.nptel.ac.in/noc20_hs29/preview

ONLINE RESOURCES:
1. https://en.wikipedia.org/wiki/Cognitive_science
2. https://plato.stanford.edu/entries/cognitive-science/
3. https://cognitivesciencesociety.org/
4. https://www.forcepoint.com/cyber-edu/cognitive-science

OUTCOMES:
On Successful completion of the course, students will be able to:
1. Compare and contrast different philosophical views on the nature of
mind.(K3)
2. Apply basic Arti icial Intelligence techniques to solve some simple
problems.(K3)
3. Interpret indings from cognitive psychology and cognitive
neuroscience.(K3)
4. Discuss social, evolutionary, and other ecological aspects of
cognition.(K2)
5. Promote cognitive science.(K1)
6. Understand the concept of memory.(K1)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 1 1 1 1 2 1 1 - 2 1 2 2 2

CO2 3 1 1 2 - 1 2 - 1 - 2 2 2 1

CO3 2 1 3 1 - 2 1 2 - 2 2 2 2 1

CO4 3 1 2 2 2 1 - 1 1 - 2 1 3 2

CO5 2 1 3 1 2 2 1 - 2 3 2 2 3 2

CO6 3 1 3 1 2 2 1 - 2 3 2 2 3 2

256
 Syllabus CSE

PROFESSIONAL ELECTIVES - IV
20CSEL807 L T P C
COMPUTER VISION
SDG NO. 4 & 9 3 0 0 3

OBJECTIVES:
l To review image processing techniques for Computer Vision
l To understand shape and region analysis
l To understand Hough Transform and its applications to detect lines, circles,
ellipses
l To understand three-dimensional Image Analysis & Motion Analysis
techniques

UNIT I IMAGE PROCESSING FOUNDATIONS 9

Review of Image Processing Techniques – Classical Filtering Operations –
Thresholding Techniques – Edge Detection Techniques – Corner and Interest
Point Detection – Mathematical Morphology – Texture.

UNIT II SHAPES AND REGIONS 9

Binary Shape Analysis – Connectedness – Object Labeling and Counting – Size
Filtering – Distance Functions – Skeletons and Thinning – Deformable Shape
Analysis – Boundary Tracking Procedures – Active Contours – Shape Models
And Shape Recognition – Centroidal Pro iles – Handling Occlusion – Boundary
Length Measures – Boundary Descriptors – Chain Codes – Fourier Descriptors
– Region Descriptors – Moments.

UNIT III HOUGH TRANSFORM 9

Line Detection – Hough Transform (HT) for Line Detection – Foot-of-normal
Method – Line Localization – Line Fitting – Ransac for Straight Line Detection –
HT Based Circular Object Detection – Accurate Center Location – Speed
Problem – Ellipse Detection – Case Study: Human Iris Location– Hole
Detection – Generalized Hough Transform (GHT) – Spatial Matched Filtering –
GHT for Ellipse Detection – Object Location – GHT for Feature Collation.

UNIT IV 3D VISION AND MOTION 9

Methods for 3D Vision – Projection Schemes – Shape from Shading –
Photometric Stereo – Shape from Texture – Shape from Focus – Active Range
Finding – Surface Representations – Point-based Representation – Volumetric
Representations – 3D Object Recognition – 3D Reconstruction – Introduction
to Motion – Triangulation – Bundle Adjustment – Translational Alignment –
Parametric Motion – Spline-based Motion – Optical Flow – Layered Motion.
257
 Syllabus CSE
UNIT V APPLICATIONS 9
Application: Photo Album – Face Detection – Face Recognition – Eigen Faces –
Active Appearance And 3D Shape Models of Faces Application: Surveillance –
Foreground - Background Separation – Particle Filters – Chamfer Matching -
Tracking - and Occlusion – Combining Views From Multiple Cameras – Human
Gait Analysis Application - In-vehicle Vision System - Locating Roadway – Road
Markings – Identifying Road Signs – Locating Pedestrians.
TOTAL: 45 PERIODS
TEXT BOOK:
1. E. R. Davies, “Computer & Machine Vision”, Fourth Edition, Academic
Press, 2017.
2. R. Szeliski, “Computer Vision: Algorithms and Applications”, Springer
2011.

REFERENCES:
1. D. L. Baggio et al., “Mastering OpenCV with Practical Computer Vision
Projects”, Packt Publishing, 2012.
2. Jan Erik Solem, “Programming Computer Vision with Python: Tools
and algorithms for analyzing images”, O'Reilly Media, 2012.
3. Mark Nixon and Alberto S. Aquado, “Feature Extraction & Image
Processing for Computer Vision”, Third Edition, Academic Press, 2012.
4. Simon J. D. Prince, “Computer Vision: Models, Learning and
Inference”, Cambridge University Press, 2012.
5. David Forsyth and Jean Ponce ," Computer Vision: A Modern Approach",
Second Edition, Pearson, 2011

WEB REFERENCES:
1. https://nptel.ac.in/courses/106105216/
2. https://nptel.ac.in/courses/106105032/
3. https://swayam.gov.in/nd1_noc19_cs58/preview
4. http://www.cse.iitd.ernet.in/~suban/vision/index.html
5. http://www.cse.iitm.ac.in/~vplab/courses/CV_DIP/PDF/INTRO_CV.pdf

ONLINE RESOURCES:
1. https://youtu.be/715uLCHt4jE
2. https://www.coursera.org/lecture/deep-learning-in-computer-
vision/introduction-to-video-analysis-alApg
3. https://www.coursera.org/lecture/introduction-computer-vision-
watson-opencv/applications-of-computer-vision-EEDvi
4. https://www.analyticsvidhya.com/blog/2020/01/computer-vision-
learning-path-2020/

258
 Syllabus CSE
OUTCOMES:
Upon completion of the course, the student should be able to
1. Implement fundamental image processing techniques required for
computer vision.(K3)
2. Perform shape analysis, Implement boundary tracking techniques & Apply
chain codes and other region descriptors.(K3)
3. Apply Hough Transform for line, circle, and ellipse detections.(K3)
4. Apply 3D vision techniques.(K3)
5. Design of a computer vision system for identi ication and recognition of
objects.(K4)
6. Implement motion related techniques & Develop applications using
computer vision techniques.(K3)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3 3 2 1 1 1 2 2 3 3 3

CO2 3 3 3 3 3 - - - - - - - 2 2

CO3 3 3 3 3 3 - - - - - - - 2 2

CO4 3 3 3 3 3 2 2 2 2 2 1 3 2 2

CO5 3 3 3 3 3 3 3 2 2 2 2 3 3 3

CO6 3 3 3 3 3 3 3 2 2 2 2 3 3 3

PROFESSIONAL ELECTIVES - IV
20CSEL808 SCIENTIFIC VISUALIZATION L T P C
SDG NO. 4 TECHNIQUES 3 0 0 3
OBJECTIVES:
l To understand the various types of Data
l To apply and evaluate the principles of Data Visualization.
l To acquire skills to apply Visualization Techniques to a problem and its
associated dataset.
l To apply structured approach to create effective visualizations thereby
building visualization dashboard to support decision making.

259
 Syllabus CSE
UNIT I INTRODUCTION TO DATA VISUALIZATION 9
Overview of Data Visualization - Data Abstraction -Analysis: Four Levels for
Validation- Task Abstraction - Analysis: Four Levels for Validation.

UNIT II VISUALIZATION TECHNIQUES 9

Scalar and Point Techniques Color Maps Contouring Height Plots - Vector
Visualization Techniques - Vector Properties – Vector Glyphs - Vector Color
Coding - Stream Objects.

UNIT III VISUAL ANALYTICS 9

Visual Variables - Networks and Trees - Map Color and Other Channels-
Manipulate View - Arrange Tables - Geo Spatial data - Reduce Items and
Attributes.

UNIT IV VISUALIZATION TOOLS AND TECHNIQUES 9

Introduction to Data Visualization Tools- Tableau - Visualization Using R-
Time- Series Data Visualization - Text Data Visualization -Multivariate Data
Visualization and Case Studies.

UNIT V VISUALIZATION DASHBOARD CREATIONS 9

Dashboard Creation Using Visualization Tools for the Use Cases: Finance-
Marketing-Insurance Healthcare-Service and Support- Human Resources -
Management -Procurement -IT
TOTAL: 45 PERIODS
TEXT BOOKS:
1. Tamara Munzer, “Visualization Analysis and Design” (AK Peters
Visualization Series), CRC Press 2014.
2. Alexandru Telea, “Data Visualization Principles and Practice”, CRC Press
2014.

REFERENCES:
1. Brodlie, K.W., Carpenter, L.A., Earnshaw, R.A., Gallop, J.R., Hubbold, R.J.,
Mumford, A.M., Osland, C.D., Quarendon, P, “Scienti ic Visualization”,
Springer, 1992.
2. Foley, Van Dam, Feiner and Hughes, “Computer Graphics Principles &
practice”, second edition in C, Pearson Education, July 2013.
3. Helen Wright , “Introduction to Scienti ic Visualization Paperback –
Illustrated”, Springer, 29 November 2006
4. N.M Patrikalakis, Scienti ic Visualization of Physical Phenomena,
Springer-Verlag.

260
 Syllabus CSE
5. Claus O. Wilke, Fundamentals of Data Visualization: A Primer on Making
Informative and Compelling Figures, March 2019, Oreilly.

WEB REFERENCES:
1. https://www.coursera.org/lecture/data-visualization-science-
communication/introduction-to-scienti ic-visualization-vniPb
2. https://www.edx.org/course/data-science-visualization

ONLINE RESOURCES:
1. https://web.cse.ohio-state.edu/~craw is.3/cis694L/index.html.
2. https://engineering.purdue.edu/online/courses/introduction-
scienti ic-isualization
3. https://www.heavy.ai/technical-glossary/scienti ic-visualization

OUTCOMES:
Upon completion of the course, the student should be able to
1 Identify the different data types, attributes, identify and create various
Visualizations for geospatial and table data.(K1)
2 Interpret the categorical, quantitative and text data. (K3)
3 Illustrate the integration of Visualization tools with Hadoop. (K3)
4 Design visualization dashboard to support the decision-making on large
scale data. (K3)
5 Match the knowledge gained with the industries latest technologies and
ability to create and interpret plots using R/Python. (K3)
6 Understand the characteristics and methods that are needed for the
visualization of geospatial data. (K2)

CO- PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3 1 2 1 - 1 - 3 1 1 2

CO2 3 3 3 3 2 2 2 1 1 - 3 2 1 2

CO3 3 3 3 3 3 2 2 1 3 1 3 2 - 2

CO4 3 3 3 3 3 2 2 1 3 1 3 1 - 2

CO5 3 3 3 3 - 1 2 2 - - 3 3 1 3

CO6 3 3 3 - 2 - - - - - - - 1 1

261
 Syllabus CSE

PROFESSIONAL ELECTIVES - IV
20CSEL809 L T P C
GAME PROGRAMMING
SDG NO. 4 3 0 0 3

OBJECTIVES:
l To Understand the concepts of Game design and development
l To Learn the processes, mechanics and issues in Game Design
l To be exposed to the Core architectures of Game Programming
l To know about Game programming platforms, frame works and engines

UNIT I 3D GRAPHICS FOR GAME PROGRAMMING 9

3D Transformations, Quaternions, 3D Modeling and Rendering - Ray Tracing -
Shader Models - Lighting - Color - Texturing - Camera and Projections - Culling
and Clipping - Character Animation - Physics - Based Simulation - Scene
Graphs.

UNIT II GAME ENGINE DESIGN 9

Game Engine Architecture - Engine Support Systems - Resources and File
Systems - Game Loop and Real-time Simulation - Human Interface Devices -
Collision and Rigid Body Dynamics - Game Pro iling.

UNIT III GAME PROGRAMMING APPLICATION 9

Application Layer - Game Logic - Game Views - Managing Memory - Controlling
the Main Loop - Loading and Caching Game Data - User Interface Management
- Game Event Management.
UNIT IV GAMING PLATFORMS AND FRAMEWORKS 9
2D and 3D Game Development Using Flash - DirectX - Java - Python - Game
Engines - Unity - DX Studio.

UNIT V GAME DEVELOPMENT 9

Developing 2D and 3D Interactive Games Using DirectX or Python – Isometric
and Tile Based Games - Puzzle Games - Single Player Games - Multi-Player
Games.
TOTAL: 45 PERIODS.

TEXT BOOKS:
1. Mike Mc Shaffrfy and David Graham, “Game Coding Complete”, Fourth
Edition, Cengage Learning, PTR, 2012.
2. Jason Gregory, “Game Engine Architecture”, CRC Press / A K Peters, 2009.
262
 Syllabus CSE
REFERENCES:
1. Eric Lengyel, “Mathematics for 3D Game Programming and Computer
Graphics”, 3rd Edition, Course Technology PTR, 2011.
2. David H. Eberly, “3D Game Engine Design - A Practical Approach to Real-
Time Computer Graphics”, Second Edition, Morgan Kaufmann, 2006.
3. Ernest Adams and Andrew Rollings, “Fundamentals of Game Design”,
2nd Edition, Prentice Hall /NewRiders,2009.
4. Jesse Schell, “The Art of Game Design: A book of lenses”, First Edition,
CRC Press, 2008.
5. Rod Afshar, Cliff Jones, Duke Banerjee, "Advergaming Developer's Guide:
Using Macromedia Flash MX 2004 and Director MX (Game Development
Series)", Charles River Media, Feb, 2004.

ONLINE RESOURCES:
1. https://www.youtube.com/watch?v=GfwpRU0cT10

OUTCOMES:
Upon completion of the course, the student should be able to
1 Understand the concepts of Game design and development (K2).
2 Design the processes and use mechanics for game development (K3).
3 Study the Core architectures of Game Programming (K1).
4 Implement Game programming platforms, frameworks and engines
(K3).
5 Develop Interactive Games(K3).
6 Apply design and development principles in the construction of two-
dimensional (2D) and Three-dimensional (3D) computer and mobile
games(K3).

CO - PO, PSO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 2 3 1 3 - - - 1 2 - 1 2 2

CO2 2 3 3 2 1 3 - 1 3 1 1 2 3 3

CO3 3 - 2 2 - 3 - 1 2 1 1 2 1 1

CO4 2 1 1 - 3 3 - 2 1 1 - 1 2 1

CO5 2 1 3 - 3 3 - 2 1 1 - 1 2 1

CO6 2 1 3 - 3 - - 1 1 1 2 1 1 1

263
 Syllabus CSE

PROFESSIONAL ELECTIVES - IV
20ITEL802 L T P C
VIRTUAL AND AUGMENTED REALITY
SDG NO. 4 & 9 3 0 0 3

OBJECTIVES:
l To introduce Virtual Reality, Input and Output devices
l To acquire knowledge on Computing architectures and modelling
l To explore VR programming and human factors
l To learn various application of Virtual and Augmented reality

UNIT I INTRODUCTION TO VIRTUAL REALITY AND INPUT

AND OUTPUT DEVICES 9
Introduction - The Three I's of Virtual Reality - A Short History of Early Virtual
Reality - Early Commercial VR Technology - VR becomes an Industry - The Five
Classic Components of a VR System. Input Devices - Three-Dimensional
Position Trackers - Tracker Performance Parameters - Ultrasonic Trackers -
Optical Trackers - Navigation and Manipulation Interfaces - Gesture Interfaces
- Output Devices - Graphics Displays - Large - Volume Displays - Sound
Displays.

UNIT II COMPUTING ARCHITECTURES AND MODELING

OF VR SYSTEM 9
Computing Architectures for VR - The Rendering Pipeline - The Graphics
Rendering Pipeline - The Haptics Rendering Pipeline - PC Graphics
Architecture - PC Graphics Accelerators - Graphics Benchmarks - Distributed
VR Architectures - Multipipeline Synchronization - Colocated Rendering
Pipelines - Modeling - Geometric Modeling - Kinematics Modeling - Physical
and Behavior Modeling.

UNIT III VR PROGRAMMING AND HUMAN FACTORS 9

Toolkits and Scene Graphs - World Tool Kit - Model Geometry and Appearance -
The WTK Scene Graph - Sensors and Action Functions - WTK Networking - Java
3D - Model Geometry and Appearance - Java 3D Scene Graph - Sensors and
Behaviors - Java 3D Networking - WTK and Java 3D Performance Comparison
Methodology and Terminology - User Performance Studies - VR Health and
Safety Issues - VR and Society.

UNIT IV APPLICATIONS OF VR 9
Medical Applications of VR - Virtual Anatomy - Triage and Diagnostic - Surgery
- VR in Education - VR and the Arts - Entertainment Applications of VR -
264
 Syllabus CSE
Military VR Applications - Army Use of VR - VR Applications in the Navy - Air
Force use of VR - Applications of VR in Robotics - Robot programming - Robot
Teleoperation.

UNIT V AUGMENTED REALITY 9

Augmented Reality - An overview - Introduction - History - Augmented Reality
Technologies – Computer Vision Methods in AR - AR Devices - AR Interfaces -
AR Systems - Visualization Techniques for Augmented Reality - Data
Integration - Depth Perception - Augmenting Pictorial Depth Cues - Occlusion
Handling - Image Based X-ray Visualization - Scene Manipulation -
Rearranging Real World Objects - Space - Distorting Visualization - AR in
Healthcare.
TOTAL: 45 PERIODS

TEXT BOOKS:
1. Grigore C. Burdea, Philippe Coiffet, “Virtual Reality Technology”, Wiley,
Second Edition, 2006
2. BorkoFurht, “Handbook of Augmented Reality”, Springer, 2011.

REFERENCE:
1. Sherman, William R & Craig, Alan B, “Understanding Virtual Reality”,
Elsevier India Private Limited, Noida, 2008.

WEB REFERENCE:
1. http://www.cs.upc.edu/~virtual/RVA/CourseSlides/03.%20VR%
20Input%20H

OUTCOMES:
Upon completion of the course, the student should be able to
1. Summarize the basics of virtual reality and IO devices. (K2)
2. Associate the computing architectures and rendering pipelines used. (K2)
3. Demonstrate the virtual reality system using various toolkits and scene
graphs. (K3)
4. Infer various applications of virtual reality systems. (K2)
5. Summarize the basics of augmented reality, IO devices and visualization
techniques. (K2)
6. Construct augmented reality applications for various real time problems.
(K3)

265
 Syllabus CSE
CO- PO, PSO MAPPING :
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 2 1 - - - - - - - - - 1 - 1

CO2 2 1 - - - - - - - - 1 - 1

CO3 3 2 1 - 1 - - 1 - 1 1 1 2 1

CO4 2 1 - - - - - - - - - 1 - 1

CO5 2 1 - - - - - - - - - 1 - 1

CO6 3 2 1 - 1 - - 1 - 1 1 1 2 1

PROFESSIONAL ELECTIVES - IV
20HSMG301 L T P C
SDG NO. 3,4,5,8,10, PROFESSIONAL ETHICS AND VALUES
13,14,15,16 3 0 0 3

OBJECTIVES:
The objectives of this course are to provide students of engineering with:
l An understanding of their duties and responsibilities as professionals
through gaining knowledge of the philosophies of ethics, professional
practice, and world culture.
l Basic knowledge to make informed ethical decisions when confronted with
problems in the working environment.
l Improved awareness of potential ethical issues within an engineering
context.
l Team skills through working in teams on assignments and in-class
assignments.
l Subjective analytical skills through investigation and evaluation of ethical
problems in engineering settings using accepted tests for moral problem
solving.
l An understanding of how societal morals vary with culture and its influence
on ethical thought and action.
l Improved communications skills with regard to ethical and professional
issues in engineering.
l Know some of the classic cases as well as contemporary issues in
engineering ethics.

266
UNIT I HUMAN VALUES
Morals, Values, and Ethics – Integrity –Trustworthiness – Work Ethics –
Service-Learning – Civic Virtue – Respect for others – Living Peacefully –
Caring – Sharing – Honesty –Courage – Value Time – Co-operation –
Commitment – Empathy – Self-confidence – Spirituality- Character.

UNIT II PRINCIPLES FOR HARMONY

Truthfulness – Customs and Traditions -Value Education – Human Dignity –
Human Rights – Fundamental Duties – Aspirations and Harmony (I, We &
Nature) – Gender Bias – Emotional Intelligence – Salovey – Mayer Model –
Emotional Competencies – Conscientiousness.

UNIT III ENGINEERING ETHICS AND SOCIAL EXPERIMENTATION

History of Ethics – Need of Engineering Ethics – Senses of Engineering Ethics-
Profession and Professionalism ––Self Interest – Moral Autonomy –
Utilitarianism – Virtue Theory – Uses of Ethical Theories – Deontology- Types
of Inquiry –Kohlberg's Theory – Gilligan's Argument – Heinz's Dilemma –
Comparison with Standard Experiments –– Learning from the Past –
Engineers as Managers – Consultants and Leaders – Balanced Outlook on Law
– Role of Codes – Codes and Experimental Nature of Engineering.

UNIT IV ENGINEERS' RESPONSIBILITIES TOWARDS SAFETY AND RISK

The concept of Safety – Safety and Risk – Types of Risks – Voluntary
v/sInvoluntary Risk – Consequences – Risk Assessment –Accountability –
Liability – Reversible Effects – Threshold Levels of Risk – Delayed
v/sImmediate Risk – Safety and the Engineer – Designing for Safety – Risk-
Benefit Analysis-Accidents.

UNIT V ENGINEERS' DUTIES AND RIGHTS

Concept of Duty – Professional Duties – Collegiality – Techniques for Achieving
Collegiality – Senses of Loyalty – Consensus and Controversy – Professional
and Individual Rights – Confidential and Proprietary Information – Conflict of
Interest-Ethical egoism – Collective Bargaining – Confidentiality – Gifts and
Bribes – Problem solving-Occupational Crimes- Industrial Espionage- Price
Fixing-Whistle Blowing.

UNIT VI GLOBAL ISSUES

Globalization and MNCs –Cross Culture Issues – Business Ethics – Media Ethics
– Environmental Ethics – Endangering Lives – Bio Ethics – Computer Ethics –
War Ethics – Research Ethics -Intellectual Property Rights.

TEXT BOOKS:
1. M.Govindarajan, S.Natarajan and V.S.SenthilKumar, “Engineering Ethics
& Human Values”, PHI Learning Pvt. Ltd., 2009.
2. Mike W. Martin and Roland Schinzinger, “Ethics in Engineering”, Tata
McGraw-Hill – 2003

REFERENCE BOOKS:
1. Sekhar, R.C., “Ethical Choices in Business Response Books”, New Delhi,
Sage Publications, 1997.
2. Kitson, Alan and Campebell, Robert, “The Ethical Organisation”, Great
Britain Macmillan Press Ltd., 1996.
3. Pinkus, Rosa Lyun B., Larry J Shulman, Norman Phummon, Harvey Wolfe,
“Engineering Ethics”,New York, Cambridge Uty., Press, 1997.
4. R. Subramaniam, “Professional Ethics”, Oxford Publications, New Delhi.
5. Mike W. Martin and Roland Schinzinger, “Ethics in Engineering”, Tata
McGraw-Hill – 2003.
6. Prof.A.R.Aryasri, Dharanikota Suyodhana, “Professional Ethics and
Morals” Maruthi Publications.
7. Harris, Pritchard, and Rabins, “Engineering Ethics”, Cengage Learning,
New Delhi.
8. S. B. Gogate, “Human Values & Professional Ethics”, Vikas Publishing House
Pvt. Ltd., Noida.
9. A. Alavudeen, R.Kalil Rahman and M. Jayakumaran, “Professional Ethics
and Human Values”, University Science Press.
10. Prof.D.R.Kiran, “Professional Ethics and Human Values” Tata McGraw-Hill
– 2013.
11. Jayshree Suresh and B. S. Raghavan, “Human Values and Professional
Ethics”, S.Chand Publications.

WEB RESOURCES:
1. Ethos Education provides a concise guide on developing a code of ethics
for primary and secondary schools.
2. The Ethics Resource Center has a toolkit available for use. When used for
commercial purposes, a nominal license fee is required.
3. Creating A Code Of Ethics for Your Organization, with many suggested
books, by Chris MacDonald
4. The Deloitte Center for Corporate Governance offers a variety of
resources for those who are active in governance, including a variety of
 resources and a set of suggested guidelines for writing a code of ethics or
a code of conduct.

MOOC REFERENCES:
1. https://www.udemy.com/course/worlplace-ethics-and-attitude/
2. https://www.udemy.com/course/business-ethics-how-to-create-an-
ethical-organization/
3. https://nptel.ac.in/courses/110/105/110105097/Ethics in
Engineering Practice
4. https://nptel.ac.in/courses/109/104/109104068/Human Values
5. https://www.coursera.org/learn/ethics-technology-engineering
6. https://www.classcentral.com/course/ethics-technology-engineering-
10485

OUTCOMES:
Upon completion of the corse, the students will be able to
1. Classify between ethical and non-ethical situations. (K2)
2. Discuss and practice moral judgment in conditions of dilemma. (K2)
3. Explain and relate the code of ethics to social experimentation and real
world scenarios. (K2)
4. Describe risk and safety measures in various engineering fields. (K2)
5. Explain the impact of engineering solutions in a global/societal /
professional context. (K2)

CO- PO MAPPING:

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 2 2 3 2 2 3 3 3 3 3 1 3

CO2 2 3 2 2 2 3 3 3 3 3 2 3

CO3 3 2 3 2 2 3 3 3 3 3 1 3

CO4 3 3 3 3 3 3 3 3 3 3 3 3

CO5 2 2 2 2 2 3 3 3 3 3 1 3
Imagine the Future and
Make it happen!

Together let’s build a better world where there is NO POVERTY and ZERO HUNGER.

We have GOOD HEALTH AND WELL BEING QUALITY EDUCATION and full GENDER EQUALITY everywhere.
There is CLEAN WATER AND SANITATION for everyone. AFFORDABLE AND CLEAN ENERGY
which will help to create DECENT WORK AND ECONOMIC GROWTH. Our prosperity shall be fuelled

by investments in INDUSTRY, INNOVATION AND INFRASTRUCTURE that will help us to

REDUCE INEQUALITIES by all means. We will live in SUSTAINABLE CITIES AND COMMUNITIES.
RESPONSIBLE CONSUMPTION AND PRODUCTION will help in healing our planet.

CLIMATE ACTION will reduce global warming and we will have abundant,

flourishing LIFE BELOW WATER , rich and diverse LIFE ON LAND.

We will enjoy PEACE AND JUSTICE through STRONG INSTITUTIONS

and will build long term PARTNERSHIPS FOR THE GOALS.

For the goals to be reached,

everyone needs to do their part:
Together we can...
governments, the private sector,
civil society and People like you.
S CEO - Sairam Institutions
We build a Better nation
through Quality education.

College Campus
Sri Sai Leo Nagar, West Tambaram,

SAI RAM
Chennai - 600 044. Ph : 044-2251 2111

Administrative Office
“Sai Bhavan”, 31B, Madley Road, T.Nagar,
INSTITUTE OF TECHNOLOGY Chennai - 600 017. Ph : 044-4226 7777
An Autonomous Institution
Afliated to Anna University & Approved by AICTE, New Delhi e-mail : sairam@sairamgroup.in
Accredited by NBA and NAAC “A+”
ISO 9001:2015 Certified and MHRD NIRF ranked institutions www.sairamgroup.in