Department of Computer Science and Engineering

Curriculum and Syllabi

Regulations-2022

Dr. N.G.P. INSTITUTE OF TECHNOLOGY

(An Autonomous Institution)
(Approved by AICTE, New Delhi & Affiliated to Anna University,
Chennai),
Recognized by UGC, NewDelhi & Accredited by NAAC with ‘A+’ Grade and NBA
(BME, CSE, ECE, EEE & Mechanical)

Dr. N. G. P. NAGAR, KALAPATTI MAIN ROAD

 Dr. N.G.P. Institute of Technology, Coimbatore – 641048
(An Autonomous Institution)
Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai
Recognized by UGC & Accredited by NAAC with A+ Grade and
NBA (BME, CSE, ECE, EEE and Mechanical)

Dr.N.G.P. Institute of Technology, established in the year 2007 by Dr. Nalla G Palaniswami, is
anAutonomousInstitutionaccreditedbyNAACwithA+Grade.TheInstitutionoffers9Undergraduate
Programmes and 4 Post Graduate Programmes in Engineering and Technologyin addition to MBA.
Undergraduate Programmes (BME, CSE, ECE, EEE &Mech) have been accredited and reaccredited by
the National Board of Accreditation, NewDelhi.

Distinct/Salient Features

1. Choice Based Credit System

2. Industry Driven curriculum
3. Project-based learning
4. Competency enhancement through one credit courses
5. International collaborations with Universities abroad

Vision and Mission of the Institute

Vision
To empower the students for succeeding in a changing world to become productive engineers and
responsible citizens.

Mission
The stated vision of the institution will be achieved by:
MI1: Producing graduates with sound technical knowledge and skills in diverse engineering
disciplines.
MI2: Adopting innovative teaching and experiential learning practices by competent faculty.
MI3: Enhancing knowledge and skills in cutting edge technologies through alliances with industry and
research organizations.
MI4: Creating conducive learning environment with state-of-art infrastructure and laboratories.
MI5: Inculcating ethical standards among students, both societal and personal through outreach
programs.
Department of Computer Science and Engineering

The Department of Computer Science and Engineering was established in year 2007.The department
prepares engineers and researchers through an intensely personal engagement in a set of research
activities that span the development of fundamental knowledge about computational processes, the
design of new computing systems and methods, and the creation of novel applications that benefit
society at large. This program consists of a carefully designed computer science core, surrounded by
an extensive array of challenging technical elective courses. Over the years the department has
developed to become a centre of excellence providing in-depth technical knowledge and opportunities
for innovation and research with well equipped computer facilities and dedicated faculty. The
Department has various industry collaborative centers and MOU signed with ORACLE Workforce
Development Program Centre, CISCO Networking Academy, IBM Centre of Excellence, EMC² Academic
Alliance, AOSTA Technology Incubation Center, Lakhshya Cyber Security Center which aids the
students to meet the global challenges of the Engineering Industries.

Vision and Mission of the Department

Vision

To produce the technically competent Computer Science and Engineering professionals to meet the
technological needs of the society.

Mission

The stated vision of the Department of Computer Science and Engineering will be achieved by:

M1: Imparting technical skills in Computer Science and Engineering through innovative teaching-
learning methods.

M2: Collaborating with Corporate, Research Organizations and Professional Societies to enhance
Research activities.

M3: Establishing modern computing facilities and Industry supported centres for Skill Enrichment.

M4: Inculcating ethical values, social awareness and responsibility among staff and students to serve
the society.
Program Educational Objectives (PEOs)

The graduates of Computer Science and Engineering programme will

PEO1: Have successful career as Software Engineer, Technocrat, Network Administrator with
knowledge in emerging technologies of computer science and engineering.

PEO2: Formulate, analyse and provide innovative solutions to real world problems in computer
science and engineering.

PEO3: Exhibit lifelong learning, team work and ethical behaviour in their chosen profession.

Program Outcomes and Program Specific Outcomes (PO and PSO)

Program Outcomes as stated by NBA:
After the successful completion of B.E program in Computer Science and Engineering, students will be
able to:
PO1: Engineering Knowledge: Apply the knowledge of mathematics, science, engineering
fundamentals, and an engineering specialization to the solution of complex engineering problems.
PO2: Problem Analysis: Identify, formulate, review research literature, and analyze complex
engineering problems reaching substantiated conclusions using first principles of mathematics,
natural sciences and engineering sciences.
PO3: Design / Development of solutions: Design solutions for complex engineering problems and
design system components or processes that meet the specified needs with appropriate consideration
for the public health and safety, and the cultural, societal, and environmental considerations.
PO4: Conduct investigations of complex problems: Use research-based knowledge and research
methods including design of experiments, analysis and interpretation of data, and synthesis of the
information to provide valid conclusions.
PO5: Modern tool usage: Create, select and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modeling to complex engineering activities with an
understanding of the limitations.
PO6: The engineer and society: Apply reasoning informed by the contextual knowledge to assess
societal, health, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice.
PO7: Environment and sustainability: Understand the impact of the professional engineering
solutions in societal and environmental contexts and demonstrate the knowledge of and need for
sustainable development.
PO8: Ethics: Apply ethical principles and commit to professional ethics and responsibilities and
norms of the engineering practice.
PO9: Individual and team work: Function effectively as an individual, and as a member or leader in
diverse teams, and in multidisciplinary settings.
PO10: Communication: Communicate effectively in complex engineering activities with the
engineering community and with society at large, such as, being able to comprehend and write
effective reports and design documentation, make effective presentations, and give and receive clear
instructions.
PO11: Project management and finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one's own work, as a member and leader
in a team, to manage projects and in multidisciplinary environments.
PO12: Life-long learning: Recognize the need for, and have the preparation and ability to engage in
independent and life-long learning in the broadest context of technological change.

Program Specific Outcomes

After the successful completion of BE Programme in Computer Science and Engineering, the students
will be able to
PSO1: Design and develop hardware and software based systems, evaluate and recognize potential
risks and provide creative solutions
PSO2: Analyze and formulate solutions to real world and socially relevant problems over multi
disciplinary domains by using latest technologies.
PSO3: Be a technically competent employee, researcher, and entrepreneur, excel in competitive exams
and zest for higher studies.
 Category wise distribution of credits

S. No. Category Credits

Humanities and Social Science including

1. 13
Management Courses(HS)

2. Basic Science Courses(BS) 23

3. Engineering Sciences Courses (ES) 27

4. Professional Core Courses(PC) 60

5. Professional Elective Courses(PE) 18

6. Open Elective Courses(OE) 9

Project Work, Seminar and Internship in

7.
Industry(EEC) 15

8. Mandatory Courses(Non-Credit) Non-credit

Total 165
 R2022 – CURRICULUM
Humanities and Social Sciences (HS)

COURSE
COURSETITLE L T P C CA ES Total
CODE
22UEN101 Communicative English 3 0 0 3 40 60 100

22UEN201 Technical English 3 0 0 3 40 60 100

22UOC103 Heritage of Tamil 1 0 0 1 100 - 100

22UOC203 Tamils and Technology 1 0 0 1 100 - 100

22UOC204 Professional Ethics 1 0 0 1 100 - 100

Interpersonal Skills &
22UEN301 0 0 2 1 60 40 100
Personality Development
Project and Finance
Management/ Principles of
Management/ Business and 3 0 0 3 40 60 100
Corporate Social
Responsibility

Basic Sciences (BS)

COURSE
COURSE TITLE L T P C CA ES Total
CODE
22UMA101 Matrices and Calculus 3 1 0 4 40 60 100
22UPH101 Engineering Physics 2 0 0 2 40 60 100
22UCH101 Engineering Chemistry 2 0 0 2 40 60 100
22UOC101/
22UOC201/ Biology for Engineers 1 0 0 1 100 - 100
22UOC301
22UBS102 Basic Science Laboratory 0 0 2 1 60 40 100
Complex Variables and
22UMA201 3 1 0 4 40 60 100
Transforms
Physics for information
22UPH201 2 0 0 2 40 60 100
Science
Environmental Science and
22UBS201 2 0 0 0 100 - 100
Engineering
22UMA301 Discrete Structures 3 0 0 3 40 60 100
22UOC102/
22UOC202/ Design Thinking 1 0 0 1 100 - 100
22UOC302
22UMA402 Probability and Statistics 3 0 0 3 40 60 100
Engineering Sciences(ES)

COURSE
COURSE TITLE L T P C CA ES Total
CODE
22UCS101 Programming in C 3 0 0 3 40 60 100
Basics of Electrical and
22UEE102 2 0 0 2 40 60 100
Electronics Engineering

PC Hardware and
22UCS103 0 0 2 1 60 40 100
Troubleshooting laboratory

Programming in C
22UCS102 0 0 2 1 60 40 100
Laboratory
Computer Organization And
22UCS201 3 0 0 3 40 60 100
Architecture
22UIT201 Python Programming 3 0 0 3 40 60 100
Digital Principles And
22UIT202 2 0 2 3 50 50 100
System Design
22UME203 Engineering Graphics 2 0 2 3 50 50 100
Python Programming
22UIT203 0 0 2 1 60 40 100
Laboratory
22UIT302 Java Programming 3 0 2 4 40 60 100
Microprocessor and
22UEE408 2 0 2 1 50 50 100
Microcontroller
Professional Core (PC)

COURSE
COURSE TITLE L T P C CA ES Total
CODE

22UCS301 Data Structures Concepts 3 0 0 3 40 60 100

Formal Languages And

22UCS302 3 1 0 4 40 60 100
Automata Theory

22UCS303 Data Science for Engineers 2 0 0 2 40 60 100

Data Structures Concepts

22UCS304 0 0 4 2 60 40 100
Laboratory
22UCS401 Operating Systems 3 0 0 3 40 60 100
Database Management
22UCS402 3 0 0 3 40 60 100
System
22UCS403 Compiler Design 3 1 0 4 40 60 100
Design And Analysis Of
22UCS404 2 0 2 3 50 50 100
Algorithms
Operating Systems
22UCS405 0 0 4 2 60 40 100
Laboratory
Database Management
22UCS406 0 0 4 2 60 40 100
Systems Laboratory
22UCS501 Computer Networks 3 0 0 3 40 60 100

22UCS502 Machine Learning 3 0 0 3 40 60 100

22UIT501 Web Programming 3 0 0 3 40 60 100

Object Oriented Software
22UCS503 2 0 2 3 50 50 100
Engineering
22UIT506 Web Programming Lab 0 0 4 2 60 40 100

22UCS504 Computer Networks Lab 0 0 4 2 60 40 100

22UCS601 Artificial Intelligence 3 0 0 3 40 60 100

Cryptography And Network

22UCS602 3 0 0 3 40 60 100
Security

22UCS603 Cloud Computing 3 0 0 3 40 60 100

22UCS604 Internet Of Things 2 0 2 3 50 50 100

Cloud Computing
22UCS605 0 0 4 2 60 40 100
Laboratory

22UCS606 Network Security Laboratory 0 0 4 2 60 40 100

Professional Electives (PE)

COURSE
COURSE TITLE L T P C CA ES Total
CODE
Computational Statistics and
3 0 0 3 40 60 100
Inference Theory

Business Analytics 3 0 0 3 40 60 100

Mining of Massive Datasets 3 0 0 3 40 60 100

Web Mining 3 0 0 3 40 60 100

Time Series Analysis and
3 0 0 3 40 60 100
Forecasting
Social Network Analytics 3 0 0 3 40 60 100
Computer Vision 3 0 0 3 40 60 100

Big data Analytics 3 0 0 3 40 60 100

Web Technologies 3 0 0 3 40 60 100

App Development 3 0 0 3 40 60 100

Cloud Services Management 3 0 0 3 40 60 100
Software Testing and
3 0 0 3 40 60 100
Automation

Web Application Security 3 0 0 3 40 60 100

Dev-Ops 3 0 0 3 40 60 100
Principles of Programming
3 0 0 3 40 60 100
Languages

Virtualization 3 0 0 3 40 60 100

Cloud Services Management 3 0 0 3 40 60 100

Network Protocols and

3 0 0 3 40 60 100
Programming

Software Defined Networks 3 0 0 3 40 60 100

Storage Area Networks 3 0 0 3 40 60 100

Data Warehousing and Data

3 0 0 3 40 60 100
Mining

Stream Processing 3 0 0 3 40 60 100

Digital Currency
3 0 0 3 40 60 100
Programming
Crypto currency and
3 0 0 3 40 60 100
Blockchain Technologies
Social Networking and
3 0 0 3 40 60 100
Security

Security and Privacy in Cloud 3 0 0 3 40 60 100

Augmented Reality / Virtual

3 0 0 3 40 60 100
Reality

Multimedia and Animation 3 0 0 3 40 60 100

Video creation and Editing 3 0 0 3 40 60 100

UI and UX Design 3 0 0 3 40 60 100

Digital Marketing 3 0 0 3 40 60 100

Visual Effects 3 0 0 3 40 60 100

Game Development 3 0 0 3 40 60 100

Multimedia Data
3 0 0 3 40 60 100
Compression and Storage

Knowledge Engineering 3 0 0 3 40 60 100

Bayesian Machine Learning 3 0 0 3 40 60 100

Neural Networks and Deep

3 0 0 3 40 60 100
Learning

Text and Speech Analysis 3 0 0 3 40 60 100

Optimization Techniques 3 0 0 3 40 60 100

Information Retrieval 3 0 0 3 40 60 100

Cognitive Science 3 0 0 3 40 60 100

Open Electives (OE)

COURSE
COURSE TITLE L T P C CA ES Total
CODE
Hospital Waste
22OBM101 3 0 0 3 40 60 100
Management

22OBM102 Holistic Nutrition 3 0 0 3 40 60 100

Biometric and its

22OBM103 3 0 0 3 40 60 100
Applications
Biotechnology in Health
22OBM104 3 0 0 3 40 60 100
Care

22OCE101 Solid Waste Management 3 0 0 3 40 60 100

22OCE102 Disaster Management 3 0 0 3 40 60 100

Smart Materials And Smart

22OCE103 3 0 0 3 40 60 100
Structures

22OEC101 Telemedicine 3 0 0 3 40 60 100

22OEC102 Vehicle Infotronics 3 0 0 3 40 60 100

Transducers and
22OEC103 3 0 0 3 40 60 100
Instrumentation

22OEE101 Renewable Energy Systems 3 0 0 3 40 60 100

22OEE102 E-Mobility 3 0 0 3 40 60 100

22OEE103 Electronics In Automobiles 3 0 0 3 40 60 100

Energy Conservation And

22OEE104 3 0 0 3 40 60 100
Audit
Smart Sensors for Industrial
22OEE105 3 0 0 3 40 60 100
Applications
Product Design And
22OME101 3 0 0 3 40 60 100
Development

22OME102 3D Printing Technology 3 0 0 3 40 60 100

22OME103 Robotics 3 0 0 3 40 60 100

Fundamentals Of Drone
22OME104 3 0 0 3 40 60 100
Technology
Nanomaterials And
22OPH101 3 0 0 3 40 60 100
Applications
Laser Systems And
22OPH102 3 0 0 3 40 60 100
Applications
Corrosion Science And
22OCH101 3 0 0 3 40 60 100
Engineering

22OCH102 Green Technology 3 0 0 3 40 60 100

One Credit Courses

COURSE
COURSE TITLE L T P C CA ES Total
CODE

22UOC007 UI/UX 1 0 0 1 100 - 100

22UOC008 Devops 3 0 0 3 40 60 100

22UOC009 React node JS 3 0 0 3 40 60 100

22UOC010 Kubernetes 3 0 0 3 40 60 100

Machine Learning with

22UOC020 3 0 0 3 40 60 100
Tensorflow
Full stack development and
22UOC021 3 0 0 3 40 60 100
Server Handling

22UOC022 Drone Technologies 3 0 0 3 40 60 100

IT infrastructure and
22UOC023 3 0 0 3 40 60 100
operations
Business and E-Commerce
22UOC024 3 0 0 3 40 60 100
Website
Business Communication
22UOC025 3 0 0 3 40 60 100
and Etiquette
22UOC026 Digital Marketing 3 0 0 3 40 60 100

Automation in Industry 4.0

22UOC027 3 0 0 3 40 60 100
using Python

22UOC028 Data Analytics using Python 3 0 0 3 40 60 100

22UOC029 JavaScript Fundamentals 3 0 0 3 40 60 100

22UOC030 React JS 3 0 0 3 40 60 100

 DEPARTMENTOFCOMPUTER SCIENCE AND ENGINEERING
B.E. COMPUTER SCIENCE AND ENGINEERING
R2022- CURRICULUM AND SYLLABUS
Minimum Credits to be Earned:165

SEMESTER I

Maximum Marks
Hours/
CodeNo. Course L T P C Category
Week
CA ES Total

Theory

22UEN101 Communicative English 3 0 0 3 3 40 60 100 HS

22UMA101 Matrices And Calculus 3 1 0 4 4 40 60 100 BS

22UPH101 Engineering Physics 2 0 0 2 2 40 60 100 BS

22UCH101 Engineering Chemistry 2 0 0 2 2 40 60 100 BS

22UCS101 Programming In C 3 0 0 3 3 40 60 100 ES

Basics Of Electrical and

22UEE102 2 0 0 2 2 40 60 100 ES
Electronics Engineering

One credit courses

Liberal Arts- Heritage of

22UOC103 1 0 0 1 1 100 - 100 HS
Tamil**

22UOC204 Professional Ethics 1 0 0 0 1 - - - HS

Practicals

22UBS102 Basic Science Laboratory 0 0 2 1 2 60 40 100 BS

Programming In C
22UCS102 0 0 2 1 2 60 40 100 ES
Laboratory
PC Hardware and
22UCS103 Troubleshooting 0 0 2 1 2 60 40 100 ES
Laboratory
Total 17 1 6 20 24 -
 SEMESTER II

Maximum Marks
Hours
CodeNo. Course L T P C Category
/Week
CA ES Total

Theory
22UEN201 Technical English 3 0 0 3 3 40 60 100 HS
Complex Variables and
22UMA201 3 1 0 4 4 40 60 100 BS
Transforms
Physics For Information
22UPH201 2 0 0 2 2 40 60 100 BS
Science
Computer Organization
22UCS201 3 0 0 3 3 40 60 100 ES
and Architecture

22UIT201 Python Programming 3 0 0 3 3 40 60 100 ES

22UME203 Engineering Graphics 2 0 2 3 4 40 60 100 ES

Theory cum laboratory course

Digital Principles and

22UIT202 2 0 2 3 4 50 50 100 ES
System Design

Practicals

Python Programming
22UIT203 0 0 2 1 2 60 40 100 ES
Laboratory

22UOC205 STEM Project 0 0 2 1 2 100 - 100 EEC

One credit courses

Liberal Arts- Tamils and

22UOC203 1 0 0 1 1 100 - 100 HS
Technology**

22UOC204 Professional Ethics 1 0 0 1 1 50 - 50 HS

Non credit mandatory course

Environmental Science
22UBS201 2 0 0 0 2 100 - 100 BS
and Engineering

Total 22 1 6 25 31 -

** As per the guidelines of Center for Academic courses - Anna University-Chennai, Heritage of
Tamils & Tamils and Technology courses will be offered in II and III semesters respectively for the
students admitted in the academic year 2022-2023.
 SEMESTER III

Hours Maximum Marks

Code No. Course L T P C
/Week Category
CA ES Total
Theory
22UMA301 Discrete Structures 3 0 0 3 3 40 60 100 BS
Data Structures
22UCS301 3 0 0 3 3 40 60 100 PC
Concepts
Formal Languages and
22UCS302 3 1 0 4 4 40 60 100 PC
Automata Theory
22UCS303 Data Science Essentials 2 0 0 2 2 40 60 100 PC

Open Elective-I 3 0 0 3 3 40 60 100 OE

Theory cum laboratory course

Microprocessors and
22UEE408 2 0 2 3 4 50 50 100 ES
Micro Controllers

22UIT304 Java Programming 3 0 2 4 5 40 60 100 ES

Practicals

Data Structures
22UCS304 0 0 4 2 4 60 40 100 ES
Concepts Laboratory

22UCS305 Idea Sprint 0 0 2 0 2 - - - EEC

One credit courses

22UOC301/ Biology for Engineers/

1 0 0 1 1 100 - 100 BS
22UOC302 Design Thinking

Interpersonal Skills &

22UEN301 Personality 0 0 2 1 2 60 40 100 HS
Development
Total 20 1 12 26 33 -
 SEMESTER IV

Maximum Marks
Hours
Code No. Course L T P C Category
/Week
CA ES Total

Theory

22UMA402 Probability and Statistics 3 0 0 3 3 40 60 100 BS

22UCS401 Operating Systems 3 0 0 3 3 40 60 100 PC

Database Management
22UCS402 3 0 0 3 3 40 60 100 PC
System
22UCS403 Compiler Design 3 1 0 4 4 40 60 100 PC

Open Elective II 3 0 0 3 3 40 60 100 OE

Theory cum laboratory course

Design And Analysis Of
22UCS404 2 0 2 3 4 50 50 100 PC
Algorithms
Practicals
Operating Systems
22UCS405 0 0 4 2 4 60 40 100 PC
Laboratory
Database Management
22UCS406 0 0 4 2 4 60 40 100 PC
System Laboratory
22UCS407 Design Sprint 0 0 2 2 2 60 40 100 EEC

One credit course

22UOC301/ Biology for Engineers/
1 0 0 1 1 100 - 100 BS
22UOC302 Design Thinking
Non credit mandatory course

Integrated Aptitude Skill I 2 0 0 0 2 100 - 100 EEC

Total 18 1 12 26 32 -
 SEMESTER V

Hours Maximum Marks

Code No. Course L T P C Category
/Week CA ES Total

Theory

22UCS501 Computer Networks 3 0 0 3 3 40 60 100 PC

22UCS502 Machine Learning 3 0 0 3 3 40 60 100 PC

22UIT501 Web Technology 3 0 0 3 3 40 60 100 PC

Professional Elective I 3 0 0 3 3 40 60 100 PE

Open Elective – III 3 0 0 3 3 40 60 100 OE

Theory cum laboratory course

Object Oriented Software
22UCS503 2 0 2 3 4 50 50 100 ES
Engineering
Practicals

22UIT506 Web Technology Lab 0 0 4 2 2 60 40 100 PC

22UCS504 Computer Networks Lab 0 0 4 2 2 60 40 100 PC

22UCS505 Code Sprint 0 0 2 0 2 - - - EEC

Mandatory course
Internship/Industrial
0 0 0 1 0 60 40 100 EEC
Training
Non credit mandatory course

Integrated Aptitude Skill II 2 0 0 0 2 40 60 100 EEC

Total 19 0 12 23 27 -
 SEMESTER VI

Maximum Marks
Hours/
Code No. Course L T P C Category
Week
CA ES Total

Theory

22UCS601 Artificial Intelligence 3 0 0 3 3 40 60 100 PC

Cryptography And Network
22UCS602 3 0 0 3 3 40 60 100 PC
Security
22UCS603 Cloud Computing 3 0 0 3 3 40 60 100 PC
Project And Finance
Management/ Principles Of
Management/ Business And 3 0 0 3 3 40 60 100 HS
Corporate Social
Responsibility
Professional Elective II 3 0 0 3 3 40 60 100 PE

Theory cum laboratory course

22UCS604 Internet Of Things 2 0 2 3 4 50 50 100 PC

Practicals

22UCS605 Cloud Computing Laboratory 0 0 4 2 2 60 40 100 PC

22UCS606 Network Security Laboratory 0 0 4 2 2 60 40 100 PC

22UCS607 Sprint Retrospective 0 0 2 2 2 60 40 100 EEC

Total 17 0 12 24 25 -
 SEMESTER VII

Hours Maximum Marks

Code No. Course L T P C Category
/Week CA ES Total

Theory

Professional Elective III 3 0 0 3 3 40 60 100 PE

Professional Elective IV 3 0 0 3 3 40 60 100 PE

Professional Elective V 3 0 0 3 3 40 60 100 PE

Professional Elective VI 3 0 0 3 3 40 60 100 PE

Total 12 0 0 12 12 -

SEMESTER VIII

Hours Maximum Marks Categ

Code No. Course L T P C /Week CA ES Total ory

22UCS801 Project Work 0 0 18 9 18 40 60 100 EEC

Total 0 0 18 9 18 -
SEMESTER–I
 L T P C Hours
22UEN101 COMMUNICATIVE ENGLISH
3 0 0 3 45
Common to All Branches of B. E/B. Tech.
Prerequisites: Basic Knowledge in Language usage
Course objectives: This Course aims to
❖ Enhance learners’ listening skills in general and technical contexts.
❖ Improve learners’ speaking skills and make them to be fluent in real time communicative
contexts.
❖ Develop learners’ basic reading abilities to comprehend information.
❖ Impart training on writing skills to make learners understand different styles of writing for
different contexts.
❖ Enrich learners’ vocabulary and to make them familiar with basic grammar.
UNIT I INTERPERSONAL EXCHANGE AND LANGUAGE DEVELOPMENT 9
Listening: Listening to short conversations or monologues – Speaking: Formal greetings and ways of
introducing oneself – Reading: Life and achievements of a famous personality– Writing: Autobiographical
Writing – Vocabulary: Prefixes and Suffixes, Different forms of words, Grammar: Nouns, Pronouns,
Adjectives, Verbs, Tenses.
UNIT II INFORMATION PROCESSING AND INFORMAL COMMUNICATION 9
Listening: Listening for specific information:providing information – Speaking: Making requests and
giving responses, Inviting, Accepting, Declining Invitations – Reading: Reading aloud to practice
Pronunciation and Intonation, Writing: Personal Letters and Emails – Vocabulary: Prefixes and Suffixes,
Different forms of words - Grammar: Prepositions, Adverbs and Conjunction.
UNIT III LANGUAGE USE IN PROFESSIONAL COMMUNICATION 9
Listening: Listening to TED, INK Talks, Podcasts and participating in discussions – Speaking: Real time
communication, Role Play (telephone calls to client, describing a product) – Reading: Reading
Comprehension and predicting the content – Writing: Business letters and Emails – Vocabulary:
Synonyms and Antonyms - Grammar : Tenses, Articles.
UNIT IV CONVERSATIONAL SKILLS ACQUISITION 9
Listening: Telephonic Conversations, Etiquette – Speaking: Narrating a Short Story/ Event/ Experience
and seeking suggestions– Reading: Reading a Short Story/ Incident - Writing- Describing Visuals –
Vocabulary: Single word substitutes and collocations - Grammar: Conditionals, Active Passive Voice.
LANGUAGE COGNIZANCE FOR SPECIFIC DOMAIN AND SOCIAL
UNIT V 9
CONTEXT
Listening: Listening to News, Domain Specific Information – Speaking: SWOC analysis – Reading: Sports,
travel experiences,– Writing: Writing etiquette for social media – Vocabulary: Idioms and Phrases -
Grammar: Yes or no Questions, Wh – Questions.
Course outcomes:
At the end of the course students will be able to:
CO 1: Use appropriate technical vocabulary in speaking and writing to express technical concepts
CO 2: Interpret written Discourse with greater felicity using register
CO 3: Construct effective professional correspondence
CO 4: Manipulate and prioritize the full repertoire of language skills
CO 5: Infer cognizance of effective professional environment
Text Book:
[1] Kumar Sanjay and PushpLata, “Communication Skills”, NewDelhi, Oxford University Press, 2018. CD
Supplement: Communication Skills: Oxford- Videos, Audios and Text Supplements.
Reference Books:
[1] Jack C Richards, “Interchange Level 2”, Cambridge University Press, 4th Edition, NewDelhi, 2012.
[2] Norman Lewis, “Word Power Made Easy”, W. R. Goyal Publishers, New Delhi, 2020.
[3] R. P Sinha, “Oxford Current English Grammar and Usage with Composition”, Oxford University Press,
New Delhi, 2005.
Web references:
https://learnenglish.britishcouncil.org/
https://www.cambridgeenglish.org/learning-english/activities-for-learners/
https://www.usingenglish.com
COURSE ARTICULATION MATRIX
PROGRAM OUTCOMES
Course
Outcomes PO1 PO1
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO12
0 1
CO1 - - - - - 1 - 1 2 3 - 2
CO2 - - - - - 1 - 1 2 3 - 2
CO3 - - - - - 1 - 2 2 3 - 2
CO4 - - - - - 1 - 1 2 2 - 2
CO5 - - - - - 1 - 2 1 3 - 2
Average - - - - - 1 - 1.4 1.8 3 2
1. Slight (Low) 2. Moderate (Medium) 3. Substantial (High)
 L T P C Hours
22UMA101 MATRICES AND CALCULUS
3 1 0 4 60
Common to All Branches of B.E. / B.Tech.
Prerequisites :Knowledge in basic Calculus.
Course Objectives :The course aims to
❖ Understand the concept of Matrices to solve eigenvalue problems
❖ Understand the concept of Differential Calculus
❖ Study the Calculus techniques in several variables
❖ Know the single variable and multi-variable calculus of integration
❖ Develop the mathematical skills to solve the ordinary differential equations
UNIT I MATRICES 12
Eigen values and Eigen vectors of a real matrix – Characteristic equation – Properties of Eigen values and
Eigen vectors – Statement and applications of Cayley-Hamilton Theorem – Diagonalization of matrices
(Orthogonal Transformation) – Reduction of a quadratic form to canonical form by orthogonal
transformation – Nature of quadratic forms.
UNIT II DIFFERENTIAL CALCULUS 12
Representation of functions – Limit of a function – Continuity – Derivatives – Differentiation rules:
Polynomials, exponential functions, product and quotient rules, Trigonometric functions, chain rule,
implicit functions, logarithmic functions – Maxima and Minima of functions of one variable.
UNIT III INTEGRAL CALCULUS 12
Definite and Indefinite integrals – Substitution rule – Techniques of Integration: Integration by parts,
Trigonometric substitutions – Integration of rational functions by partial fraction, Improper integrals
(test the convergence).
UNIT IV ORDINARY DIFFERENTIAL EQUATIONS 12
Higher order linear differential equations with constant coefficients – Method of variation of parameters
– Homogeneous equation of Euler’s and Legendre’s type – System of simultaneous linear differential
equations with constant coefficients.
UNIT V FUNCTIONS OF SEVERAL VARIABLES 12
Partial differentiation –Homogeneous functions and Euler’s theorem –Total derivative –Jacobians –
Taylor’s series for functions of two variables – Maxima and Minima of functions of two variables –
Lagrange’s method of undetermined multipliers.
Course Outcomes: At the end of the course, students will be able to
CO1: Apply the appropriate methods of transformation for finding eigen values and eigenvectors of
matrices
CO 2: Utilize the fundamentals of calculus in one variable
CO 3: Apply the calculus techniques in elementary problems for several variables
CO 4: Compute the definite and indefinite integrals
CO 5: Solve higher order linear differential equations with constant coefficients
Text Books :
[1] Grewal BS, "Higher Engineering Mathematics", Khanna Publishers, New Delhi,44th Edition,
2018.
[2] Joel Hass, Christopher Heil and Maurice DWeir, "Thomas' Calculus", Pearson, NewDelhi,14th Edition,
2018.
[3]James Stewart, "Calculus: Early Transcendentals", Cengage Learning, 7th Edition, New
Delhi, 2015.
Reference Books:
[1] Kreyszig Erwin, "Advanced Engineering Mathematics", John Wiley and Sons (Asia) Limited, New
Delhi,10th Edition, 2016.
[2] Jain RK. and Iyengar SRK., "Advanced Engineering Mathematics", Narosa Publications, New Delhi,5th
Edition, 2017.
[3] Kandasamy P, Thilagavathy K and Gunavathy K, "Engineering Mathematics", SChandand Company
Limited, New Delhi, 2017.
Web References:
[1]https://onlinecourses.nptel.ac.in/noc22_ma49/previewSS
[2]https://onlinecourses.nptel.ac.in/noc22_ma75/preview
[3]https://onlinecourses.nptel.ac.in/noc21_ma16/preview

COURSE ARTICULATION MATRIX

Programme Outcomes/Programme Specific Outcomes (POs/PSOs)

Course
PO1 PO1 PO1
Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
0 1 2
CO1 3 3 2 - - - - - - - - 2
CO2 3 3 2 - - - - - - - - 2
CO3 2 3 2 - - - - - - - - 2
CO4 2 3 1 - - - - - - - - 2
CO5 2 3 1 - - - - - - - - 2
Average 2.4 3 1.6 - - - - - - - - 2
 L T P C Hours
22UPH101 ENGINEERING PHYSICS
2 0 0 2 30
Common to All branches of B.E. / B. Tech.
Prerequisite: Higher Secondary Physics
Course objectives: The Course aims to
❖ Understand towards the applications of Laser.
❖ Acquire the basic knowledge of waves and optics.
❖ Gain knowledge of thermal properties of materials.
❖ Inculcate the fundamentals of mechanics.
❖ Understand basics of semiconductor and Nano materials.
UNIT I LASER 6
Introduction – Spontaneous and stimulated emission – Population inversion – Pumping methods –
Einstein’s A & B Coefficients – Types of Lasers –Nd-YAG Laser – Semiconductor diode Laser –
Applications: 3D Profiling, Material Processing.
UNIT II WAVES AND OPTICS 6
Simple harmonic motion – Displacement, amplitude, frequency, phase and resonance – Waves on a
string – Standing waves –Traveling waves – Energy transfer of a wave –Interference – Theory of air
wedge and experiment– Michelson Interferometer.
UNIT III THERMAL PHYSICS 6
Modes of heat transfer – Thermal expansion – Bimetallic strips –Thermal conductivity – Determination
of thermal conductivity of bad conductor: Lee’s disc method – Thermal insulation – Applications: Heat
exchangers, Refrigerators and Solar water heaters.
UNIT IV MECHANICS 6
Introduction – Center of mass (CM) – CM in one and two dimensions – Rotation of rigid bodies:
Rotational kinematics – Rotational kinetic energy – Moment, couple and torque –Conservation of
angular momentum – Rotational energy state of a rigid diatomic molecule – Gyroscope.
UNIT V SEMICONDUCTORS AND NANOMATERIALS 6
Semiconductors: Definition – Properties – Energy band diagram – Direct and indirect band gap
semiconductors – Intrinsic Semiconductors – Extrinsic semiconductors and its types.
Nano materials: Introduction – Preparation: Pulsed Laser Deposition – Ball milling – Properties and
applications.
Course Outcomes: At the end of the course, Students will be able to
CO1: Understand the types of lasers for various industrial and medical applications.
CO2: Acquire the basic knowledge in waves and optics.
CO3: Understand the thermal properties of materials and apply to the field of engineering.
CO4: Infer the dynamics of the objects in motion.
CO5: Summarize the properties of semiconductors and nano materials.
Text Books:
[1] D. Kleppner and R.Kolenkow, “An Introduction to Mechanics”, McGraw Hill Education, New Delhi
(Indian Edition), 2017.
[2] Bhattacharya D K. and Poonam Tandon, “Engineering Physics”, Oxford HED, New Delhi,2017
[3] Kittel. C., “Introduction to Solid State Physics”,Wiley, New Delhi, 2019.
Reference Books:
[1] H C Verma, “Concepts of Physics”, Vol I & II, BharathiBhawan Publishers & Distributors, New Delhi,
2020.
[2] R K Gaur and S L Gupta, “Engineering Physics”, Dhanpat Rai Publications, 2012.
[3] Halliday and Resnick, “Fundamentals of Physics”, John Wiley and Sons, New Delhi, 2013.
Web references:
[1] https://onlinecourses.nptel.ac.in/noc17_ph01/preview
[2] https://onlinecourses.nptel.ac.in/noc17_ae04/preview
[3] http://www.physicsclassroom.com/class/thermal.
COURSE ARTICULATION MATRIX
Course Programme Outcomes/Programme Specific Outcomes (POs/PSOs)
Outcome
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
s
CO1 3 1 – – – – – – – – – 1
CO2 3 1 – – – – – – – – – 1
CO3 3 1 – – – – – – – – – 1
CO4 3 1 – – – – – – – – – 1
CO5 3 1 – – – – – – – – – 1
Average 3 1 – – – – – – – – – 1
 L T P C Hours
22UCH101 ENGINEERING CHEMISTRY
2 0 0 2 30
Common to All Branches of B.E. / B.Tech.
Prerequisite: NIL
Course objectives: The course aims to
❖ Learn boiler feed water requirements, and water treatment techniques.
❖ Learn corrosion control and protective techniques.
❖ Acquire the knowledge about the fuels and properties of energy storage devices.
❖ Understand the basic concepts of engineering materials and its applications.
❖ Acquaint with the basics of nanoparticles, properties and applications.
UNIT I WATER AND ITS TREATMENT 6
Water: Sources and impurities, hardness and its types. Municipal water treatment: primary treatment
and disinfection (UV, Ozonation, break-point chlorination). Desalination of brackish water: Reverse
Osmosis. Boiler troubles: Scale and sludge. Treatment of boiler feed water: Internal treatment -
phosphate, colloidal, sodium aluminate and calgon conditioning and External treatment – Ion exchange
demineralization and zeolite process.
UNIT II CORROSION AND CORROSION CONTROL 6
Chemical corrosion – Pilling – Bedworth rule – electrochemical corrosion – different types – galvanic
corrosion – differential aeration corrosion – factors influencing corrosion – corrosion control –
sacrificial anode and impressed cathodic current methods – corrosion inhibitors – protective coatings –
paints – constituents and functions – metallic coatings – electroplating (Au) and electroless (Ni) plating.
UNIT III ENERGY SOURCES AND STORAGE DEVICES 6
Fuels: Calorific value - Gross and net calorific values - Classification of fuels -Petroleum and Diesel-
Manufacture of synthetic petrol (Bergius process), Knocking - octane number, diesel oil - cetane
number - Solar energy conversion - Principle, working and applications of solar cells - Recent
developments in solar cell materials. Batteries - Types of batteries, Primary battery - Dry cell,
Secondary battery –lead-acid battery and lithium-ionbattery - Fuel cells - H2-O2 fuel cell.
UNIT IV ENGINEERING MATERIALS 6
Refractories – classification – acidic, basic and neutral refractories – properties (refractoriness,
refractoriness under load, dimensional stability, porosity, thermal spalling) – manufacture of alumina,
magnesite and zirconia bricks.
Lubricants – mechanism of lubrication, liquid lubricants, - properties – viscosity index, flash and fire
points, cloud and pour points, oiliness) – solid lubricants – graphite and molybdenum sulphide.
UNIT V NANO CHEMISTRY 6
Basics: Distinction between molecules, nanomaterials and bulk materials - Size-dependent properties
(optical, electrical, mechanical and magnetic) - Types of nanomaterials - Definition and uses of
nanoparticle, nanocluster, nanorod, nanowire and nanotube. Preparation of nanomaterials - sol-gel,
electrodeposition and chemical vapour deposition. Applications of nanomaterials in medicine,
agriculture, energy, electronics and catalysis.
Course outcomes: At the end of the course, students will be able to
CO1:Outline water treatment methods for domestic and industrial purposes.
CO2: Outline different types of corrosion and its treatment methods.
CO3: Categorize the effective utilization of various energy sources and storage devices.
CO4: Infer the role of engineering materials for engineering requirements.
CO5: Synthesize nanomaterials using the basic concepts of Nanoscience and technology for engineering
applications.
Text Books:
[1] Jain P C and Monica Jain, “EngineeringChemistry”,17thEdition, DhanpatRaiPublishing Co.,2018.
[2] Sivasankar B., “Engineering Chemistry”, Tata McGraw-Hill Publishing Company Ltd, New Delhi,
2017.
[3] S.S. Dara, “A Textbook of Engineering Chemistry”, S. Chand Publishing, 12th Edition, 2018.
Reference Books:
[1] B. S. Murty, P. Shankar, Baldev Raj, B. B. Rath and James Murday, “Textbook of nanoscience and
nanotechnology”, Universities Press-IIM Series in Metallurgy and Materials Science, 2018.
[2] O.G. Palanna, “Engineering Chemistry” McGraw Hill Education (India) Private Limited, 2 nd Edition,
2017.
[3] Friedrich Emich, “Engineering Chemistry”, Scientific International Pvt, Ltd, New Delhi, 2017.
[4] Shikha Agarwal, “Engineering Chemistry-Fundamentals and Applications”, Cambridge University
Press, Delhi, Second Edition, 2019.
Web References:
1. https://nptel.ac.in/courses/105107207
2. https://nptel.ac.in/courses/113108051/
3. https://nptel.ac.in/courses/103103206/
4. https://archive.org/details/NPTEL-MetalMtrlSci-Fuels_Refractory_and_Furnace
5. https://nptel.ac.in/courses/118102003/
COURSE ARTICULATION MATRIX
Course Programme Outcomes/Programme Specific Outcomes (POs/PSOs)
Outcome
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
s
CO1 3 - - - - - 2 - - - - 1
CO2 3 - - - - - 2 - - - - 1
CO3 3 - - - - - 2 - - - - 1
CO4 3 - - - - - 2 - - - - 1
CO5 3 - - - - - 2 - - - - 1
Average 3 - - - - - 2 - - - - 1
 L T P C Hours
22UCS101 PROGRAMMING IN C
3 0 0 3 45
Pre-requisite: -
Course Objectives : The students will be able to
● Understand various algorithmic techniques for solving problems.
● Understand the various constructs of a programming language viz. conditional and iteration
● Understand arrays and strings, and functions
● Understand pointers and structures
● Understand File concept
Unit 1 PROBLEM SOLVING USING ALGORITHMS 9
Algorithm Implementation - Top down design - Simple strategies for developing algorithms - Iteration -
Recursion - Fundamental algorithms - Anticipating and Dealing with Errors–Scratch tool.
Unit 2 BASICS OF C PROGRAMMING 8
Introduction to C programming - C Program Structure - Program Compilation & Execution -Character Set
- Keywords - Data Types - Library functions - Control Statements: Branching and Looping.
Unit 3 ARRAYS AND FUNCTIONS 11
One dimensional array –Two dimensional arrays –Multidimensional Array-Strings: Defining, initializing
of strings, Processing strings, Array of Strings- Introduction to functions- Storage Classes - Scope Rules -
Built-in and user defined functions –Passing Arrays to Function - Call by value – Call by reference -
Recursion
Unit 4 POINTERS AND STRUCTURES 11
Pointer Declaration - Operations on Pointer - - Pointers and One-Dimensional, two-dimensional Array -
Array of Pointers -Structure – Nested structures - Array of structures - Pointer and Structures - Self-
referential structures - Union- Dynamic memory allocation – typedef
Unit 5 FILE PROCESSING 6
Files — Basic file handling functions - Types of file processing: Sequential access file - Random access file
– Transaction processing using random access files — Command line arguments – Macros and Pre-
processor directives.
Course Outcome:
CO1: Recollect various programming constructs and to develop C programs
CO2:Develop simple applications in C using basic constructs, decision making and looping
CO3:Implement different Operations on arrays, strings and functions
CO4:Implement Programs with Structures and pointers
CO5:Demonstrate the use of sequential and random access file processing with thehelp of programs
Text Books :
[1] ReemaThareja, ―Programming in C, Oxford University Press, Second Edition, 2016.
[2] R.G. Dromey, “How to solve it by Computer”, Pearson Education, 2008
[3] Kernighan, B.W and Ritchie,D.M, ―The C Programming language, Second Edition, Pearson Education,
2006
Reference Books :
[1] H. M. Deitel, P. J. Deitel "C How to Program", Pearson Education., New Delhi, 2013, 7th edition.
[2] Byron S. Gottfried, Jitendar Kumar Chhabra “Programming with C”, Tata McGraw Hill Publishing
Company., New Delhi,2018, fourth edition
[3] Herbert Schildt“C – The Complete Reference”, Tata McGraw Hill Publishing Company., New Delhi,
2010, fourth edition.
[4] Yashavant P. Kanetkar "Let Us C", BPB Publications., 2017 , 16th edition
Web references:
● https://onlinecourses.nptel.ac.in/noc22_cs40/preview
Course Articulation Matrix
CO vs PO mapping
P
PO/ PO PO PO PO PO PO PO PO PO O PO PO PSO PSO PSO
CO 1 2 3 4 5 6 7 8 9 1 11 12 1 2 3
0
CO1 2 2 3 3 1 1 2 2
CO2 2 2 3 3 1 1 2 2
CO3 2 2 3 3 1 1 2 2
CO4 2 2 3 3 1 1 2 2
CO5 2 2 3 3 1 1 2 2
Avg 2 2 3 3 1 1 2 2
 BASIC ELECTRICAL AND ELECTRONICS L T P C Hours
22UEE102 ENGINEERING
(For CSE, AIDS, CSBS & IT) 2 0 0 2 30
Prerequisite: -
Course Objectives:This course aims to
● Introduce the basic concepts of electrical circuits
● Impart knowledge on electronic circuit and its applications
● Introduce the functional elements and working of measuring instruments
● Educate on the fundamental working of sensors and transducers
● Introduce the basics of UPS, SMP Sand drives
Unit1 Basics of Electrical Circuits 6
Review of circuit elements-Ohm’sLaw-Resistors in series and parallel circuits–Kirchoffs laws –current and
voltage division rule-source transformation-Mesh and nodal analysis.
Unit2 Basics of Electronic Circuits 6
Types of semiconductor devices-PN junction and Zenerdiodes–structure, operation and V-I
characteristics- Avalanche and Zener break down–Applications of PN junction and Zener diodes.
Unit3 Measurements and instrumentation 6
Functional elements of an instrument-Standards and calibration-Operating Principle-types - Moving Coil
and Moving Iron instruments–induction type watt meter and Energy Meter.
Unit4 Sensors and Transducers 6
Transducers: Strain Gauge-LVDT-RTD-Thermistor
Sensors: Ultrasonic Sensors-Temperature sensors-Pressure sensors-Image sensors-Infrared (IR)sensors-
Application of the sensors in IoT(Qualitative analysis only)
Unit5 Basics of power converters and Drives 6
Power converters for Uninterruptable Power Supply(UPS)-Block diagram of Switched Mode Power
Supply(SMPS)-Stepper Motor and Servo motor(Construction and Operation)-Applications

Course Outcome: After the completion course, students will be able to

CO1: Understand the basic concepts of electrical circuits.

CO2: Illustrate the structure and characteristics of various electronic circuits.
CO3: Describe the operating principles of measuring instruments.
CO4: Explain the structure and operation of different Sensors and Transducers.
CO5: Outline the Construction and working principle of UPS, SMPS, stepper motor and servo motor.

Text Books:

[1].KothariDP and I.JNagrath, “Basic Electrical and Electronics Engineering”,Second Edition, Mc Graw
Hill Education, 2020
[2].SedhaR.S.,“A text book of Applied Electronics”,S.Chand&Co.,2008
 Reference books:
[1].A.K.Sawhney,PuneetSawhney‘ A Course in Electrical & Electronic Measurements & Instrumentation’,
Dhanpat Raiand Co,2015
[2].Albert Malvino,David Bates, ‘Electronic Principles, McGraw Hill Education;7th edition,
2017
[3].Oliver and Cage,“Electronic Measurements and Instrumentation”, TMH, 2009.
Course Articulation Matrix
CO vs PO mapping
P
P
PO/ PO PO PO PO PO PO PO PO O PO PO PSO PSO PSO
O
CO 1 2 4 5 6 7 8 9 1 11 12 1 2 3
3
0
CO1 2 2 3 3 1 1
CO2 2 2 3 3 1 1
CO3 2 2 3 3 1 1
CO4 2 2 3 3 1 1
CO5 2 2 3 3 1 1
Avg 2 2 3 3 1 1
 L T P C Hours
22UOC204 Professional Ethics
1 0 0 0 15
Prerequisite: -
Course Objectives:This course aims
● To enable the students to imbibe and internalize the importance of values in one’s personal life
Unit1 Personal Values 3
Understanding self – Managing individual differences – power of perception and attitude; personality –
definition and types; character – Etiquette and Manners
Unit2 Family Values 3
Value of family system – power of family relationships; love compassion and respect towards family
members – impact of family values on society – behaviour modification.
Unit3 Social Values 3
Citizenship behaviour – role of values and ethics in society. Education and its impact on society
development. Religious tolerance and its merits. Science and society.
Unit4 National Values 3
Indian culture and its significance; impact of youth on national development. Basic duties and
responsibilities of a citizen; Science and Environment. Our role in protecting our global planet.

Unit5 Human Values 3

Moral values and ethics; Technology and Human values; understanding values in human relationships;
Characteristics of Values. Role of Emotional Intelligence and Social Intelligence.

Total Hours: 15
Course Outcome: After the completion course, students will be able to
CO1:Understand the importance of values and ethics in their personal lives
Reference Books:
1. R. S. Naagarazan, A text book on professional Ethics and Human Values, New Aage International
(p) Limited Publishers 2006
2. Engineering Ethics, Concepts cases: Charles E Harris Jr., Michael S Pritchard, Michael J Rabis, 4e,
Cenage learning, 2015
3. Business Ethics Concepts & Cases: Manuel G Velasquez, 6e, PHI, 2008
4. Lester Parrott: Values and Ethics in Social Work Practice, 2nd edition, Learning Matters Ltd. 2010
5. JosepTàpies and John L. Ward: Family Values and Value Creation, 1st Edition, Palgrave Macmillan,
2010
 L T P C Hours
22UBS102 BASIC SCIENCE LABORATORY
0 0 2 1 30
Common to All Branches of B.E. / B.Tech.
Prerequisite: Nil
Course objectives: The course aims to
❖ 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.
❖ To make the student to acquire practical skills in the determination of water quality parameters
through volumetric analysis and to determine the amount of metal ion and strength of acids by
instrumental analysis.

PHYSICS - LIST OF EXPERIMENTS (Any 5 Experiments)

1. Determination of Rigidity modulus – Torsion pendulum.

2. Determination of Young’s modulus by Non-Uniform bending method.
3. Determination of wavelength and particle size using Laser.
4. Determination of thermal conductivity of a bad conductor – Lee’s Disc method.
5. Determination of velocity of sound and compressibility of liquid– Ultrasonic Interferometer
6. Determination of thickness of a thin wire – Air wedge method.
7. Determination of bandgap of a semiconductor diode.
CHEMISTRY- LIST OF EXPERIMENTS (Any 5 Experiments)
1. Determination of alkalinity in water sample.
2. Determination of total, temporary & permanent hardness of water by EDTA method.
3. Estimation of corrosion in mild steel by weight loss method.
4. Determination of strength of given hydrochloric acid using pH meter.
5. Determination of strength of acids in a mixture of acids using conductivity meter.
6. Estimation of iron content of the given solution using potentiometer.
7. Conductometric precipitation titration of BaCl2vs Na2SO4.

Total Hours 30
Course outcomes: At the end of the course, students will be able to
CO1:Interpret the physical properties of materials like elasticity, compressibility and optical
properties ofmaterials such as diffraction, interference.
CO2:Estimate the thermal and electrical properties such as conductivity and bandgap.
CO3:Characterize the quality of water samples with respect to their acidity, alkalinity, and hardness.
CO4:Estimate the strength of acids using pH and conductivity meter, the amount of iron using calomel
electrode for the given solution.
COURSE ARTICULATION MATRIX

Course Programme Outcomes/Programme Specific Outcomes (POs/PSOs)

Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 - - - - - - - - - - -
CO2 3 - - - - - - - - - - -
CO3 3 - - - - - - - - - - -
CO4 3 - - - - - - - - - - -
Average 3 - - - - - - - - - - -
 L T P C Hours
22UCS102 PROGRAMMING IN C LABORATORY
0 0 2 1 30
Prerequisite :
Course Objectives : The students will be able
● Understand the logic for a given problem
● Understand the syntax and construction of C programming code.
● Understand the different data-structures like arrays, pointers, structures and files.
● Understand proper use of user defined functions
● Identify the alternative ways of providing solution to a given problem.
List Of Experiments :
1. Program comprising of I/O statements, operators and expressions.
2. Program to demonstrate Conditional statements.
3. Program to demonstrate Looping constructs.
4. Program to demonstrate different types of Arrays
5. Program using strings.
6. Program using functions
7. Program using recursive functions
8. Program using pointers.
9. Program using structures.
10. Program to demonstrate the different operations in file handling.
Course Outcome:
CO1: Illustrate and explain the basic computer concepts and programming principles of C language
CO2: Develop programs to solve simple engineering problems using branching and looping constructs
CO3:Develop programs to demonstrate the applications of derived data types such as arrays, pointers,
strings and functions.
CO4:Develop programs to demonstrate the applications structures and pointers
CO5 :Implement programs to demonstrate the difference operations in file handling
Software Requirements :
● Windows: 7 or newer
● MAC: OS X v10.7 or higher
● Linux: Ubuntu
Hardware Requirements:
● Processor: Minimum 1 GHz; Recommended 2GHz or more
● Ethernet connection (LAN) OR a wireless adapter (Wi-Fi)
● Hard Drive: Minimum 32 GB; Recommended 64 GB or more
● Memory (RAM): Minimum 1 GB; Recommended 4 GB or above
● Sound card w/speakers
● Some classes require a camera and microphone
Course Articulation Matrix
CO vs PO mapping

P
PO
PO PO PO PO PO PO PO PO PO O PO PO PSO PSO
/ PSO2
1 2 3 4 5 6 7 8 9 1 11 12 1 3
CO
0
CO
2 2 3 3 1 1 2 2
1
CO
2 2 3 3 1 1 2 2
2
CO
2 2 3 3 1 1 2 2
3
CO
2 2 3 3 1 1 2 2
4
CO
2 2 3 3 1 1 2 2
5
Av
2 2 3 3 1 1 2 2
g
 L T P C Hours
22UCS103 PC Hardware and Trouble Shooting
0 0 2 1 15
Pre-requisite :
Course Objectives : The students will be able to
● know the basic hardware components and its interfaces
● Understand the installation of components and its maintenance activities.
● Gain knowledge about the troubleshooting process
List of experiments
1. Install and configure computer drivers and system components
2. Disk formatting, partitioning and Disk operating system commands
3. Install, upgrade and configure Windows/Linux operating systems
4. Installation of Antivirus and configure the antivirus, printer and scanner software.
5. Assembly and Disassembly of hardware.
6. Troubleshooting and Managing Systems
7. Recovering the root file system after corruption
8. Remote desktop connections and file sharing.
9. Establish network connections, Configure IP address and Domain name system
10. Install two different kinds of network cards and connect two computers to campus LAN and
download a file from a computer on the LAN
Course Outcome:
CO1: Describe the components of a computer system
CO2: Install and configure hardware and software packages with drivers
CO3: Apply various methods for troubleshooting the system related problems
Course Articulation Matrix
CO vs PO mapping

P P P P
PO/ PO PO PO PO PO PO PO PO PSO PSO PSO
O O O O
CO 2 3 4 5 6 7 8 9 1 2 3
1 10 11 12
CO1 2 2 3 3 1 1
CO2 2 2 3 3 1 1
CO3 2 2 3 3 1 1
Avg 2 2 3 3 1 1
Course Code Course Title L T P C Hours

தநிமர் நபபு 1 0 0 1 15

Common to அனைத்து இளநினை பட்டப் படிப்புகள்

அ஬கு I மநொமிநற்றும்இ஬க்கினம் 3
இந்தின மநொமிக்குடும்஧ங்கள் – திபொயிட மநொமிகள் – தநிழ் ஑ரு மெம்மநொமி – தநிழ்
மெவ்யி஬க்கினங்கள் – ெங்க இ஬க்கினத்தின் ெநனச்ெொர் ஧ற்஫ தன்மந ெங்க இ஬க்கினத்தில் ஧கிர்தல்
அ஫ம் – திருக்கு஫஭ில் மந஬ொண்மநக்கருத்துக்கள் தநிழ்க்கொப்஧ினங்கள், தநிமகத்தில் ெநண ம஧ௌத்த
ெநனங்க஭ின் தொக்கம்- பக்தி இ஬க்கினம், ஆழ்யொர்கள் நற்றும் ஥ொனன்நொர்கள் ெிற்஫ி஬க்கினங்கள் –
தநிமில் ஥வீ஦ இ஬க்கினத்தின் ய஭ர்ச்ெி – தநிழ் இ஬க்கின ய஭ர்ச்ெினில் ஧ொபதினொர் நற்றும்
஧ொபதிதொென் ஆகிமனொொின் ஧ங்க஭ிப்பு.
நபபு – ஧ொம஫ ஒயினங்கள் முதல் ஥வீ஦ ஒயினங்கள் யமப-
அ஬கு || 3
ெிற்஧க்கம஬
஥டுகல் முதல் ஥வீ஦ ெிற்஧ங்கள் யமப – ஐம்ம஧ொன் ெிம஬கள் – ஧மங்குடினி஦ர் நற்றும் அயர்கள்
தனொொிக்கும் மகயிம஦ப்ம஧ொருட்கள், ம஧ொம்மநகள்-மதர் மெய்ம௄ம் கம஬சுடுநண் ெிற்஧ங்கள்
஥ொட்டுப்பு஫த்மதய்யங்கள் குநொி மும஦னில் திருயள்ளுயர்ெிம஬ – இமெக்கருயிகள் நிருதங்கம், ஧ம஫,
வீமண, னொழ், ஥ொதஸ்யபம் –தநிமர்க஭ின் ெமூக ம஧ொரு஭ொதொப யொழ்யில் மகொயில்க஭ின் ஧ங்கு.
அ஬கு III ஥ொட்டுப்பு஫க்கம஬கள் நற்றும் வீப யிம஭னொட்டுகள் 3
மதருக்கூத்து, கபகொட்டம், யில்லுப்஧ொட்டு, கணினொன்கூத்து, ஑னி஬ொட்டம், மதொல்஧ொமயக்கூத்து,
ெி஬ம்஧ொட்டம், ய஭ொி, புலினொட்டம், தநிமர்க஭ின் யிம஭னொட்டுகள்,

அ஬கு IV தநிமர்க஭ின் திமணக்மகொட்஧ொடுகள் 3

தநிமகத்தின் தொயபங்களும், யி஬ங்குகளும் – மதொல்கொப்஧ினம் நற்றும் ெங்க இ஬க்கினத்தில் அகம்
நற்றும் பு஫க்மகொட்஧ொடுகள் –தநிமர்கள் ம஧ொற்஫ின அ஫க்மகொட்஧ொடு – ெங்ககொ஬த்தில் தநிமகத்தில்
எழுத்த஫ிவும், கல்யிம௄ம் ெங்ககொ஬ ஥கபங்களும் தும஫முகங்களும் –ெங்ககொ஬த்தில் ஏற்றுநதி நற்றும்
இருக்குநதி – கடல் கடந்த ஥ொடுக஭ில் மெொமர்க஭ின் மயற்஫ி.
இந்தின மதெின இனக்கம் நற்றும் இந்தின
அ஬கு V 3
஧ண்஧ொட்டிற்குத்தநிமர்க஭ின் ஧ங்க஭ிப்பு
இந்தின யிடுதம஬ப்ம஧ொொில் தநிமர்க஭ின் ஧ங்கு இந்தினொயின் – ஧ி஫ப்஧குதிக஭ில்
தநிழ்ப்஧ண்஧ொட்டின் தொக்கம் – சுனநொினொமத இனக்கம் இந்தின நருத்துயத்தில், ெித்த நருத்துயத்தின்
஧ங்கு -கல்மயட்டுகள், மகமனழுத்துப்஧டிகள் – தநிழ்ப்புத்தகங்க஭ின் அச்சு யப஬ொறு.
TEXT-CUM-REFERENCE BOOKS
1. தநிமகயப஬ொறு – நக்களும் ஧ண்஧ொடும் - மக.மக. ஧ிள்ம஭ (மய஭ிம௃டு:தநிழ்஥ொடு ஧ொடத௄ல்
நற்றும் கல்யினினல் ஧ணிகள்கமகம்).
2. கணி஦ித்தநிழ் - மும஦யர்இ஬. சுந்தபம். (யிகடன்஧ிபசுபம்).
3. கீமடி – மயமக ஥திக்கமபனில் ெங்ககொ஬ ஥கப ஥ொகொிகம் (மதொல்லினல் தும஫மய஭ிம௃டு)
4. ம஧ொரும஥ – ஆற்஫ங்கமப ஥ொகொிகம். (மதொல்லினல் தும஫ மய஭ிம௃டு)
5. Social Life of Tamils (Dr.K.K.Pillay) A joint publication of TNTB & ESC and RMRL - (in print)
6. Social Life of the Tamils The Classical Period (Dr.S.Singaravelu) (Published International
 Institute of Tamil Studies
7. Historical Heritage of the Tamils (Dr.S.V.Subatamanian, Dr.K.D. Thirunavukkarasu)
(Published by: International Institute of Tamil Studies).
8. The Contributions of the Tamils to Indian Culture (Dr.M.Valarmathi) (Published
by:International Institute of Tamil Studies.)
9. Keeladi - 'Sangam City Civilization on the banks of river Vaigai" (Jointly Published by:
Department of Archaeology & Tamil Nadu Text Book and Educational Services Corporation,
Tamil Nadu)
10. Studies in the History of India with Special Reference to Tamil Nadu (Dr.K.K.Pillay)
(Publishedby. The Author)
11. Porunal Civilization (Jointly Published by: Department of Archaeology & Tamil Nadu Text
Bookand Educational Services Corporation, Tamil Nadu)
12. Journey of Civilization Indus to Vaigai (R.Balakrishnan) (Published by: RMRL) –
Reference Book.
SEMESTER – II
 L T P C Hours
22UEN201 TECHNICAL ENGLISH
3 0 0 3 45
Commonto All Branches of B. E/B. Tech.
Prerequisites: Basic Knowledge in Language usage
Course objectives: This Course aims to
❖ Enhance learners’ listening skills in technical and professional contexts.
❖ Develop learners’ confidence in speaking at formal situations.
❖ Cultivate reading strategies and skills to enhance their ability in scientific/technical reading.
❖ Improve learners’ technical and professional writing skills.
❖ Impart appropriate technical vocabulary and advanced grammatical understanding.
UNIT I TECHNICAL COMMUNICATION 9
Listening and Speaking: Developing effective listening skills in public - Reading: Scientific Reading for
Comprehension– Writing: Process Description, Interpretation of Info and graphics – Vocabulary:
Connotations and Misspelt words - Grammar: Sequence words and Discourse markers.
UNIT II LANGUAGE FOR COMMUNICATIVE PERFORMANCE 9
Listening and Speaking: Listening for clear pronunciation, different accents, Common Errors in
Pronunciation and practice – Reading: Reading Technical documents - Writing: Checklists, Invitation,
Acceptance, Declining, Feedback and complaint letters – Vocabulary: Homonyms and Homophones -
Grammar:Forming questions using auxiliary and modal verbs.
UNIT III INTERPERSONAL SKILLS 9
Listening and Speaking: Listening to formal and informal conversations, product advertisements and
product description – Reading: Reading advertisements, reading company profile for industrial visit –
Writing: Content writing, Recommendations, and Instructions – Vocabulary: Compound words and
numerical adjectives - Grammar: Impersonal passive voice and Direct and Indirect Speech.
UNIT IV EFFECTIVE BUSINESS COMMUNICATION 9
Listening and Speaking: Listening to formal speeches, welcome address and vote of thanks – Reading:
Reading and analyzing annual reports of organizations and memos - Writing- Proposals, Report writing,
Minutes of Meeting – Vocabulary: Fixed and semi fixed expressions, Verbal analogies -Grammar –
Purpose statements.
UNIT V LANGUAGE DEVELOPMENT FOR EMPLOYMENT 9
Listening and Speaking: Listening to online discussions on current issues and role play activities –
Reading: Reading and analyzing job advertisements, business environment and ethics – Writing: Job
application and Resume – Vocabulary: Jargon and Register, Definitions - Grammar: Cause and effect
expressions and Common Errors.
Course outcomes: At the end of the course students will be able to
CO 1: Understand vocabulary and syntax with accuracy and clarity.
CO 2: Use appropriate grammar and technical parlance in a range of academic scenarios.
CO 3: Interpret and evaluate discourses related to functional English
CO 4: Infer critical text leading to academic articulation.
CO 5: Associate professional information through appropriate means of communication.
Text Book:
[1] Kumar Sanjay and PushpLata, “Communication Skills”, Oxford University Press, New Delhi, 2018.
CD Supplement: Communication Skills: Oxford- Videos, Audios and Text Supplements
Reference Books:
[1] Jack C Richards, “Interchange Level 3”, Cambridge University Press. 4th Edition, New Delhi, 2012.
[2] Rizvi M. Ashraf, “Effective Technical Communication”, Tata Mac Graw Hill Publishing Compan
Limited, 4th Edition, New Delhi, 2010.
[3] Gerson Sharon. J, Steven M Gerson, “Technical Writing- Process and Product”, Pearson Education Pvt.
Ltd. 3rd Edition, New Delhi, 2009.
[4] KiranmaiDutt. P and GeethaRajeevan, “Basic Communication Skills”, Cambridge University Press,
New Delhi, 2007.
Web references:
● https://learnenglish.britishcouncil.org/
● https://www.cambridgeenglish.org/learning-english/activities-for-learners/

COURSE ARTICULATION MATRIX

Course PROGRAM OUTCOMES
Outcome PO1 PO1
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO12
s 0 1
CO1 - - - - - 1 - 1 2 3 - 2
CO2 - - - - - 1 - 1 1 3 - 2
CO3 - - - - - 1 - 1 1 3 - 2
CO4 - - - - - 1 - 1 1 3 - 2
CO5 - - - - - 1 - 1 1 3 - 2
Average - - - - - 1 - 1 1.2 3 - 2
 L T P C Hours
22UMA201 COMPLEX VARIABLES AND TRANSFORMS
3 1 0 4 60
Common to AI&DS,CSE,IT,ECE,BME,EEE,CIVIL and MECH
Prerequisite : Knowledge in Complex variables, Differential equations and Integration.
Course objectives: This Course aims to
❖ Understand the concept of analytic functions and its properties
❖ Study the techniques of residues and Contour integration
❖ Know the basics of vector calculus and its applications
❖ Understand the procedure to solve partial differential equations
❖ Solve ordinary differential equations using Laplace Transform
UNIT I ANALYTIC FUNCTION 12
Functions of a complex variable – Analytic functions: Necessary conditions – Cauchy – Riemann
equations and sufficient conditions (excluding proofs) – Harmonic and orthogonal properties of analytic
function (excluding proofs) – Harmonic conjugate – Construction of analytic functions – Conformal
1
mapping: 𝑤 = 𝑧 + 𝑘 , 𝑘𝑧 , 𝑧 and bilinear transformation.
UNIT II COMPLEXINTEGRATION 12
Cauchy’s integral theorem (Statement) and Cauchy’s integral formula – Laurent’s series expansions –
Singular points – Residues – Cauchy’s residue theorem – Evaluation of real definite integrals as contour
integrals around unit circle.
UNIT III VECTOR CALCULUS 12
Gradient, divergence and curl –Irrotational and solenoidal vector fields (Definition only) –Vector
integration – Green’s theorem in a plane, Gauss divergence theorem and Stoke’s theorem (excluding
proofs) – Simple applications involving cubes and rectangular parallelepipeds.
UNIT IV PARTIAL DIFFERENTIAL EQUATIONS 12
Formation of partial differential equations by eliminating arbitrary constants – Singular integrals –
Solutions of standard types of first order partial differential equations (Type I and Type II) – Lagrange’s
linear equation – Linear partial differential equations of second and higher order with constant
coefficients of homogeneous type.
UNIT V LAPLACE TRANSFORM 12
Laplace transform – Sufficient condition for existence – Transform of elementary functions – Basic
properties – Transforms of derivatives and integrals of functions – Derivatives and integrals of
transforms – Transforms of unit-step function and impulse function – Transform of periodic functions.
Inverse Laplace transform – Statement of Convolution theorem – Initial and final value theorems –
Solution of linear ODE of second order with constant coefficients using Laplace transformation
techniques.
Course outcomes:At the end of the course students will be able to
CO1:Examine the standard techniques of complex variable, analytic function andconformal mapping
CO2:Illustrate a contour integral with an integrand which has singularities in the closed region
CO3: Interpret the line, surface and volume integral
CO4: Compute the solutions of first and higher order partial differential equations
CO5:Apply the concept of Laplace transform to find the solution of linear ordinarydifferential
equationswith constant coefficients
Text Books:
[1] Grewal B.S, "Higher Engineering Mathematics", Khanna Publishers, NewDelhi, 44th Edition, 2018.
[2] Kreyszig Erwin, "Advanced Engineering Mathematics", John Wiley and Sons, NewDelhi, 10th Edition,
2016.
Reference Books:
[1] Ramana B.V, "Higher Engineering Mathematics", Tata McGraw Hill CompanyLimited,
NewDelhi, 11th Reprint 2018.
[2] Bali N, Goyal M and Watkins C, "Advanced Engineering Mathematics", FirewallMedia(An
imprint of Lakshmi Publications Private Limited),NewDelhi, 7th Edition, 2015.
[3] O’Neil P.V, "Advanced Engineering Mathematics", Cengage Learning India Private Limited,New
Delhi, 7thEdition, 2012.
[4] Sastry S.S, "Engineering Mathematics :Volume I", PHI Learning Private Limited, NewDelhi, 4th
Edition, 2014.
Web References:
[1] https://onlinecourses.nptel.ac.in/noc22_ma73/preview
[2] https://onlinecourses.nptel.ac.in/noc22_ma62/preview
COURSE ARTICULATION MATRIX
Programme Outcomes/Programme Specific Outcomes (POs/PSOs)
Course
PO1 PO1 PO1
Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
0 1 2
CO1 2 3 1 - - - - - - - - 2
CO2 2 3 1 - - - - - - - - 2
CO3 2 3 1 - - - - - - - - 2
CO4 2 3 2 - - - - - - - - 2
CO5 2 3 2 - - - - - - - - 2
Average 2 3 1.4 - - - - - - - - 2
 L T P C Hours
22UPH201 PHYSICS FOR INFORMATION SCIENCE
2 0 0 2 30
Common to AIDS, CSE, CSBS & IT
Prerequisite: Engineering Physics
Course Objectives: The Course aims to
❖ Understand the essential principles of optical fiber.
❖ Become proficient in photonic materials and devices.
❖ Study the properties and applications of magnetic materials.
❖ Understand the concept of quantum structures.
❖ Understand the principles of data storage devices.
UNIT I FIBER OPTICS 6
Principle, Numerical aperture and acceptance angle – Types of optical fiber (material, refractive index
and mode) –Attenuation mechanism in optical fibers –Applications: Fiber optic communication –Fiber
optic sensor: Pressure and Displacement.
UNIT II PHOTONIC MATERIALS 6
Classification of optical materials – Carrier generation and recombination processes – Absorption
emission and scattering of light in metals, insulators and semiconductors (concepts only) – Photo current
in a P-N diode – Solar cell – LED – Organic LED.
UNIT III MAGNETIC MATERIALS 6
Basic definitions – Origin of magnetic moment – Classification of magnetic materials (Dia, Para & Ferro) –
Domain theory of ferromagnetism – Hysteresis of ferromagnetic materials – Soft and hard magnetic
materials – Giant Magneto Resistance (GMR) effect.
UNIT IV QUANTUM DEVICES AND QUANTUM COMPUTING 6
Quantum confinement – Quantum structures: quantum wells, wires and dots – Tunnelling: Resonant
Tunnelling Diode (RTD) – Quantum system for information processing – Classical bits – Quantum bits
(or) qubits –CNOT gate – Advantage of quantum computing over classical computing.
UNIT V DATA STORAGE DEVICES 6
Computer Data storage, Types of Storage, Primary Storage– RAM, ROM, Cache– Secondary Storage –Hard
disk, Tertiary Storage – Magnetic tape, Compact disc, Digital versatile disc, Blue-ray –Off-line Storage –
USB Flash drive, memory card.
Course outcomes: At the end of the course, Students will be able to
CO1: Classify the fiber optic cable and study its engineering applications.
CO2: Understand the concept of optical properties of materials.
CO3: Gain knowledge on magnetic properties of materials and their applications.
CO4: Appreciate the importance of quantum computing.
CO5: Understand various data storage devices.
Text Books:
[1] KittelC., “Introduction to Solid State Physics”,Wiley, New Delhi, 2019.
[2] HansonG.W, “Fundamentals of Nanoelectronics”, Pearson Education, New Delhi, 2009.
[3] KasapS.O., “Principles of Electronic Materials and Devices”, McGraw-Hill Education, New Delhi, 2015.
Reference Books:
[1] Pallab Bhattacharya, “Semiconductor Opto-Electronic Devices”, PHI Learning Private Limited, New
Delhi, 2017.
[2] Garcia N. & Damask, A,“Physics for Computer Science Students”, Springer-Verlag, 2012.
[3] Rogers B., Adams, J. &Pennathur, S, “Nanotechnology: Understanding Small Systems”, CRC Press,
New York, 2014.
Web references:
[1] https://nptel.ac.in/courses/1151070951
[2] https://onlinecourses.nptel.ac.in/noc22_ee106/preview
[3] https://onlinecourses.nptel.ac.in/noc21_cs103/preview
COURSE ARTICULATION MATRIX
Course Programme Outcomes/Programme Specific Outcomes (POs/PSOs)
Outcomes PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 1 – – – – – – – – – 1
CO2 3 1 – – – – – – – – – 1
CO3 3 1 – – – – – – – – – 1
CO4 3 1 – – – – – – – – – 1
CO5 3 1 – – – – – – – – – 1
Average 3 1 – – – – – – – – – 1
 L T P C Hours
22UCS201 COMPUTER ORGANIZATION AND ARCHITECTURE
3 0 0 3 45
Prerequisite:
Course Objectives: This course aims to
● Make students understand the basic structure and operation of digital computer
● Familiarize the students with arithmetic and logic unit and implementation of fixed point and
floating-point arithmetic operations
● Expose the students to the concept of pipelining
● Understand parallelism and multi-core processors
● Understand the memory hierarchies, cache memories and virtual memories
Unit 1 Basic Structure of Computers 9
Functional units, Basic operational concepts, Performance, Instructions, Operations and Operands,
representing instructions, Logical operations, Control operations, MIPS addressing, RISC, CISC.
Unit 2 Arithmetic for Computers 9
ALU, Addition and Subtraction, Multiplication, Division, Floating point representation, Floating point
operations, Sub word parallelism.
Unit 3 Processor and Control Unit 9
Basic MIPS implementation, Hardwired control, Micro programmed control, Pipelining, Pipelined data
path and control, Handling Data Hazards & Control Hazards – Exception Handling.
Unit 4 Parallelism 9
Parallel processing challenges, Flynn‘s classification – SISD, MIMD, SIMD, SPMD, Vector architectures,
Hardware multithreading, Multi-core processors, Introduction to Graphics Processing units, Clusters,
Warehouse scale computers.
Unit 5 Memory and I/O Systems 9
Memory hierarchy, Memory technologies, Cache basics, Measuring and improving cache performance,
Virtual memory, TLBs, Input/output system, programmed I/O, DMA and interrupts, I/O processors.
Course Outcome:
CO1: Explain the basics of organizational and architectural issues of a digital computer and Classify and
compute the performance of machines, Machine Instructions.
CO2: Elucidate arithmetic operations performed in the ALU
CO3:Understand the theory and architecture of central processing unit.
CO4:Summarize the concepts of parallel processing, pipelining and interprocessor communication.
CO5 :Exemplify in a better way the I/O and memory organization.
Text Books:
[1] David A. Patterson and John L. Hennessy, “Computer Organization and Design: The
Hardware/Software Interface”, 5th Edition, Morgan Kaufmann / Elsevier, 2014.
[2] Carl Hamacher, Zvonko Vranesic, Safwat Zaky and Naraig Manjikian, “Computer Organization and
Embedded Systems”, 6th Edition, Tata McGraw Hill, 2012.
Reference Books:
[1] William Stallings, “Computer Organization and Architecture – Designing for
Performance”, 8th Edition, Pearson Education, 2010.
[2]John P. Hayes, “Computer Architecture and Organization”, 3rd Edition, Tata McGraw Hill, 2012.
[3] John L. Hennessey and David A. Patterson, “Computer Architecture – A Quantitative Approach”, 5th
Edition, Morgan Kaufmann / Elsevier Publishers, 2012.
Web references:
● https://onlinecourses.nptel.ac.in/noc12_ma73/preview
Course Articulation Matrix: CO vs PO mapping
P
PO/ PO PO PO PO PO PO PO PO PO O PO PO PSO PSO PSO
CO 1 2 3 4 5 6 7 8 9 1 11 12 1 2 3
0
CO1 2 1 - - - - - - - - - 1 2 1 -
CO2 2 1 - - - - - - - - - 1 2 1 -
CO3 2 1 - - - - - - - - - - 2 1 -
CO4 2 1 1 1 - - - - - - - - 2 1 -
CO5 2 1 - - - - - - - - - - 2 1 -
Avg 2 1 1 1 - - - - - - - 1 2 1 -
 L T P C Hours
22UIT201 Python Programming
3 0 0 3 45
Common to : IT,CSE,AI&DS,CSBS
Prerequisite(s): Nil
Course objectives: This course aims to
● Understand the basics of object-oriented concepts and python programming.
● Solve problems using flow control and conditional blocks.
● Implement functions and use string manipulation to solve problems.
● Use collections – lists, tuples, dictionaries and sets to represent complex data
● Input/output with files in python.
Unit 1 Introduction to Python 9
Introduction to OOPs – Class and Object, Methods, Inheritance, Polymorphism, Basics of Python
Programming - Python variables, Python basic Operators, Understanding python blocks. Python Data
Types, Declaring and using Numeric data types: int, float etc.
Unit 2 Flow Control & Conditional blocks 9
Selective statements – if, if-else, nested if, if –elif ladder statements. Iterative statements - while, for,
Nested loops, else in loops, Loop manipulation using break, continue and pass statements.
Unit 3 Functions & Strings 9
Functions: Function definition, function call, flow of execution, parameters and arguments, return values,
local and global scope, recursion. Strings: Formatting, Comparison, Slicing, Splitting, Stripping, Negative
indices, String functions.
Unit 4 Collections 9
List: Create, Access, Slicing, Negative Indices, List Methods, and comprehensions. Tuples: Create Indexing
and Slicing, Operations on tuples. Dictionary: Create, add, and replacevalues, operations on dictionaries.
Sets: Create and operations on set.
Unit 5 Files, Exceptions and Packages 9
Python File Operations: Reading files, Writing files in python, Understanding read functions, read(),
readline(), readlines(). Understanding write functions, write() and writelines(), using file operations.
Command line arguments, Errors and Exceptions, Handling exceptions. Libraries: TensorFlow, Pandas,
Numpy, SciPy, Keras
Course outcome(s): After the completion of this course, students will be able to:
1. Develop simple computational python program using object oriented concepts.
2. Write simple python programs using flow control and conditional blocks.
3. Implement python programs using functions and strings.
4. Represent compound data using Python lists, tuples, dictionaries and sets.
5. Read and write data from/to files and handle exceptions in python programs.
Text Book(s):
1. E Balagurusamy,” Object Oriented Programming with C++”, 8th Edition, McGraw Hill,2020
2. Allen B. Downey, Think Python: How to Think Like a Computer Scientist, 2nd edition, Updated for
Python 3, Shroff/O’Reilly Publishers, 2016.
3. Jeeva Jose &P.SojanLal, “Introduction to Computing and Problem Solving with PYTHON”, Khanna
Publishers, New Delhi, 2016
4. Karl Beecher, “Computational Thinking: A Beginners Guide to Problem Solving and programming”,
1st Edition, BCS Learning &Development Limited, 2017.
Reference books:
1. Gowrishankar S, Veena A, ―Introduction to Python Programming, 1st Edition, CRC Press/Taylor &
Francis, 2018
2. Eric Matthes, Python Crash Course: A Hands-On, Project-Based Introduction to Programming, 2nd
Edition, No starch Press, 2019.
3. Martin C. Brown, “Python: The Complete Reference”, 4th Edition, Mc-Graw Hill, 2018
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.
Web references:
1. www. mhhe.com/kamthane/python
2. https://www.edx.org/course/computing-in-python
3. http://greenteapress.com/wp/think-python/
Course Articulation Matrix
CO vs PO mapping

PO PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO

CO 1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO1 2 1 - - - - - - - - - - 1 1 -
CO2 2 2 - 2 - - - - - - - - 1 2 -
CO3 1 3 - - 1 - - - - - - - 1 2 -
CO4 - 2 1 - 2 - - - - - - - 2 3 -
CO5 - - 2 2 - - - - - - - - 2 1 -
Average 1 2 1 1 1 - - - - - - - 2 2 -
 L T P C Hours
22UME203 ENGINEERING GRAPHICS
2 0 2 3 60
Common to Prerequisite(s): Nil
Course objectives: this Course aims to

 Draw the plane curves and orthographic projections.

 Draw the projections of points, lines and plane surfaces.
 Draw the projections of solids.

 Understand the principle of sectioned solids and development of surfaces.

 To understand the principle of isometric and perspective projections.
Concepts and Conventions (Not for Examination)
Importance of graphics in engineering applications — Use of drafting instruments — BIS conventions
and specifications — Size, layout and folding of drawing sheets — Scaling, Lettering and
dimensioning(Not for Examination)
Unit 1 Plane Curves and Free hand sketching 6+9
Engineering Curves: Conics — Construction of ellipse, parabola and hyperbola by eccentricity method —
Construction of cycloid — construction of involutes of square and circle-Drawing of tangents and normal
to the above curves. Orthographic Projections - Freehand sketching of multiple views from pictorial
views of objects.
Unit 2 Projection of Points, Lines and Plane Surface 6+9
Projection of points- Projections of straight lines located in first quadrant - determination of true length
and true inclinations. Projections of plane surfaces - polygonal lamina and circular lamina, located in first
quadrant and inclined to one reference plane.
Unit 3 Projection of Solids 6+9
Projection of simple solids - prism, pyramid, cylinder and cone. Drawing views when the axis of the solid
is inclined to one reference plane. Practicing three dimensional modeling of simple objects by CAD
Software(Not for examination)
Unit 4 Projection of Sectioned Solids and Development of 6+9
Surfaces
Sectioning of simple solids - prisms, pyramids, cylinder and cone. Obtaining sectional views and true
shape when the axis of the solid is vertical and cutting plane inclined to one reference plane.
Development of lateral surfaces of truncated prisms, pyramids cylinders and cones. Practicing three
dimensional modeling of simple objects by CAD Software (Not for examination)
Unit 5 Isometric and Perspective Projections 6+9
Isometric projections of simple solids and truncated solids - Prisms, pyramids, cylinders, cones.
Perspective projection of simple solids-Prisms, pyramids and cylinders by visual ray method.Practicing
three dimensional modeling of isometric projection of simple objects by CAD Software(Not for
examination).
Course outcome(s): At the end of the course student will be able to
CO1: Draw the Projection of points and lines.
CO2: Project simple regular polyhedral and truncated solids.
CO3: Section the solids to obtain true shape of the section.
CO4: Develop the lateral surfaces of simple solid.
CO5: Draw multiple views from pictorial views of objects.
Text Book(s):
1. Natarajan K.V., A Text Book of Engineering Graphics, Dhanalakshmi Publishers, Chennai, 2018.
2. Venugopal K. and Prabhu Raja V., “Engineering Graphics”, 15th Edition, New Age International Pvt.
Ltd., New Delhi, 2018.
Reference books:
1. Bhatt N.D. and Panchal V.M., ―Engineering Drawing‖, Charotar Publishing House, 50th Edition,
2019.
2. Basant Agrawal, Agrawal C.M., “Engineering Drawing”, 2nd Edition, McGraw Hill Education, 2019.
3. Gopalakrishna K.R., ―Engineering Drawing (Vol. I&II combined), Subhas Publications, Bangalore,
2017.
Web references:
1. http://www.nptel.ac.in/courses/112103019
2. http://www.nptel.ac.in/courses/105104148
3. http://www.sonaversity.org/Product/Engineering_Graphics_and_Drawing.htm
Course Articulation Matrix
CO vs PO mapping
CO / PO PO PO PO PSO PSO PSO
PO1 PO3 PO4 PO5 PO6 PO7 PO8 PO9
PO 2 10 11 12 1 2 3
CO 1 3 2 2 - 2 - - - 2 - 1 2 - -

CO 2 3 2 2 - 2 - - - 2 - 1 2 - -

CO 3 3 2 2 - 2 - - - 2 - 1 2 - -

CO 4 3 2 2 - 2 - - - 2 - 1 2 - -

CO 5 3 2 2 - 2 - - - 2 - 1 2 - -

Avg 3 2 2 - 2 - - - 2 - 1 2 - -
 DIGITAL PRINCIPLES AND SYSTEM L T P C Hours
22UIT202 DESIGN
(For CSE, AIDS, CSBS & IT) 2 0 2 3 60
Prerequisite: -
Course Objectives: This course aims to
● Study various number systems and to deduce the mathematical expressions Using Boolean
functions.
● Introduce the fundamentals of combinational and sequential digital circuit.
● Study the design of various Sequential Circuits.
● Acquire the basic knowledge of Memories and logic families.
● Introduce digital simulation techniques for development of application-oriented logic circuit.
Unit1 BOOLEAN ALGEBRA AND LOGIC GATES 6

NumberSystems–ArithmeticOperations–BinaryCodes-BooleanAlgebraandLogicGates– Theorems and

Properties of Boolean Algebra–Simplification of Boolean Functions using Karnaugh Map upto 4variables.

6
Unit2 COMBINATIONAL LOGIC CIRCUIT
Combinational Circuits–Analysis and Design Procedures–Binary Adder-Subtractor–Multiplexers-
Demultiplexers -Encoder –Decoder-code converters

Unit3 SYNCHRONOUS SEQUENTIAL LOGIC 6

Sequential Circuits–Storage Elements:Latches, Flip-Flops-SR, D, JK and T–Analysis of Clocked Sequential

Circuits-Introduction of Asynchronous Sequential Circuits
Unit4 MEMORYANDPROGRAMMABLELOGIC 6
ROM,RAM,EEPROM–Programmable Logic Array–Programmable Array Logic-introduction to FPGA- TTL
and CMOS families
Unit5 HDL 6
Digital design process flow using HDL-Modules and ports-compiler directives-data types and operators–
Introduction to VHDL-modeling styles.
List of Experiments
1. Implementation of Boolean equations
2. Implementation of Arithmetic Circuits
3. Implementation of Multiplexer and de-Multiplexer circuits
4. Implementation of Encoder and Decoder circuit
5. Implementation of Latches and Flip-Flops
6. Basic Logic circuits using VHDL
Course Outcome: After the completion course, students will be able to
CO1: Summarize various number systems and techniques to simplify the given Boolean expressions.
CO2: Explain the implementation of various combinational circuits.
CO3: Design various synchronous using Flip Flops
CO4: Describe the various Memories and programmable logic devices.
CO5: Summarize various steps involved to write VHDL coding for logic circuits.
Text Books:
[1].James W. Bignel, Digital Electronics, Cengage learning, 5th Edition, 2007.
[2].M. Morris Mano, ‘Digital Design with an introduction to the VHDL’, Pearson Education, 2013
Reference Books:
[1]. Comer “Digital Logic & State Machine Design, Oxford, 2012
[2]. Mandal, “Digital Electronics Principles & Application, McGraw Hill Edu, 2013
[3]. William Keitz, Digital Electronics-A Practical Approach with VHDL, Pearson, 2013.
[4]. Thomas L.Floyd, ‘Digital Fundamentals’, 11th edition, Pearson Education, 2015.
[5]. Charles H.Roth, Jr, LizyLizy Kurian John, ‘Digital System Design using VHDL, Cengage,
2013
[6]. D.P.Kothari, J.S.Dhillon, ‘Digital circuits and Design’, Pearson Education, 2016.
CO-PO Mapping
Course Articulation Matrix: CO vs PO mapping
P
PO/ PO PO PO PO PO PO PO PO PO O PO PO PSO PSO PSO
CO 1 2 3 4 5 6 7 8 9 1 11 12 1 2 3
0
CO1 2 2 3 3 1 1 2 2
CO2 2 2 3 3 1 1 2 2
CO3 2 2 3 3 1 1 2 2
CO4 2 2 3 3 1 1 2 2
CO5 2 2 3 3 1 1 2 2
Avg 2 2 3 3 1 1 2 2
 L T P C Hours
22UBS201 ENVIRONMENTAL SCIENCE AND ENGINEERING
2 0 0 0 30
Common to All Branches of B.E. / B.Tech.
Prerequisite: Nil
Course objectives: The course aims to
❖ Study the interrelationship between living organism and environment
❖ Assess the environmental pollution and its impact.
❖ Understand the significance of natural resources and their conservation.
❖ Identify and implement scientific, economic and political solutions to environmental
problems.
❖ Understand the influence of human population on environmental issues and role of
information technology as a tool to minimize the environmental problems.
UNIT I ECOSYSTEMS AND BIODIVERSITY 6
Definition, scope and importance of environment - concept of an ecosystem - structure and function
of an ecosystem - food chains, food webs and ecological pyramids - Introduction to biodiversity-
definition: genetic, species and ecosystem diversity - value of biodiversity - threats to biodiversity-
conservation of biodiversity.Case study of simple ecosystems – pond, river, hill slopes, etc.
UNIT II ENVIRONMENTAL POLLUTION 6
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 – 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. Case study of local polluted site – Urban / Rural / Industrial / Agricultural.
UNIT III NATURAL RESOURCES 6
Forest resources - Use and over-exploitation, deforestation - Water resources - Use and over-
utilization of surface and ground water, floods, drought, conflicts over water, dams-benefits and
problems –Food resources- Changes caused by agriculture and overgrazing, effects of modern
agriculture, fertilizer-pesticide problems, water logging, salinity-Role of an individual in
conservation of natural resources.
UNIT IV SOCIAL ISSUES AND THE ENVIRONMENT 6
Unsustainable to sustainable development-water conservation, rain water harvesting, watershed
management – Resettlement and rehabilitation of people - its problems and concerns -
environmental ethics: Issues and possible solutions – climate change, global warming, acid rain,
ozone layer depletion– environment protection act – Air (Prevention and Control of Pollution) act –
Water (Prevention and control of Pollution) act.
 UNIT V HUMAN POPULATION AND THE ENVIRONMENT 6
Population growth, variation among nations – population explosion – family welfare programme –
environment and human health – human rights – value education – Pandemic issues and
management – women and child welfare – Role of information technology in environment and
human health – Case studies.
Course outcomes: At the end of the course, students will be able to
CO1: Infer the importance of ecosystem and biodiversity.
CO2: Identify the causes, effects and control measures of different types of pollution.
CO3: Interpret the importance of various natural resources and its sustainable use.
CO4: Outline various environmentally related social issues and their solutions.
CO5: Explore the methods of waste management and resource recovery.
Text Books:
[1] Benny Joseph, “Environmental Science and Engineering”, Tata McGrawHill, New Delhi, 2017.
[2] Gilbert M.Masters, “Introduction to Environmental Engineering and Science”, 2nd Edition,
Pearson Education, 2016.
[3] George Tchobanoglous, Frank Kreith, “Handbook of Solid Waste Management” (McGrawHill
Handbooks), McGraw-Hill Education, 2ndEdition July 2017.
Reference Books:
[1] R.K. Trivedi, “Handbook of Environmental Laws, Rules, Guidelines, Compliances and
Standards”, Vol. I and II, Enviro Media. 2015.
[2] ErachBharucha, “Textbook of Environmental Studies”, Universities Press(I) Private Limited,
Hydrabad, 2015.
[3] Rajagopalan R, “Environmental Studies-From Crisis to Cure”, Oxford University Press, 2005.
Web References:
1. https://archive.nptel.ac.in/courses/102/104/102104068/
2. https://archive.nptel.ac.in/courses/105/103/105103205/
3. https://nptel.ac.in/courses/105104103
4. https://nptel.ac.in/courses/105101010
5. https://archive.nptel.ac.in/courses/109/104/109104150/
Course Articulation Matrix
Course Programme Outcomes/Programme Specific Outcomes (POs/PSOs)
Outcome
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
s
CO1 2 - - - - 1 3 1 2 - - 1
CO2 2 - - - - 1 3 1 2 - - 1
CO3 2 - - - - 1 3 1 2 - - 1
CO4 2 - - - - 1 3 1 2 - - 1
CO5 2 - - - - 1 3 1 2 - - 1
Average 2 - - - - 1 3 1 2 - - 1
 L T P C Hours
22UOC204 Professional Ethics
1 0 0 1 15
Course Objective:
Objective To enable the students to imbibe and internalize the importance of ethics in one’s
professional life
Course Outcome: At the end of the course the students will be able to
CO Understand the importance of values and ethics in their professional lives
Unit1 Professional 3
Definition, professional qualities – integrity, self-awareness, managing complexity and others.
Multiple intelligences for an engineer. The nature of engineering profession. Success and failure
stories of professionals. Role of self-regulation.
Unit2 Work Ethics and Culture 3
Awareness on work dimensions. Teambuilding in work environments. Understanding role,
responsibilities and work ethics. Knowledge on work space behaviour – understanding relevant
competencies relating to work – Role of professional ethics in organisation.
Unit3 Engineering Profession 3
Ethical issues in engineering practice. Social and Ethical responsibilities of an engineer. Knowledge
on psychological dimensions of an engineer. Engineers as managers.
Unit4 Global values 3
Global Issues in professional Ethics – managing the Eco Systems: Role of an engineer; Knowledge of
different cultures in global setting. Increasing international competencies for engineers.
Unit5 Science and Spirituality 3
Role of spirituality in human performance. Various dimensions of spirituality in scientific
development. Balancing productivity and Eco system. Merits and demerits of science and technology.
Role of spirituality in professional ethics of Engineers.
TotalHours: 15
References:
R. S. Naagarazan, A text book on professional Ethics and Human Values, New Aage International (p)
Limited Publishers 2006
Engineering Ethics, Concepts cases: Charles E Harris Jr., Michael S Pritchard, Michael J Rabis, 4e,
Cenage learning, 2015
Business Ethics Concepts & Cases: Manuel G Velasquez, 6e, PHI, 2008
Lester Parrott: Values and Ethics in Social Work Practice, 2nd edition, Learning Matters Ltd. 2010
JosepTàpies and John L. Ward: Family Values and Value Creation, 1st Edition, Palgrave Macmillan,
2010
 L T P C Hours
22UIT203 Python Programming Laboratory
0 0 2 1 45
Common to IT,CSE, AI&DS,CSBS
Prerequisite(s): Nil
Course objectives:
● To perform problems using expressions and operators
● To learn the basic programming concepts using conditionals and loops.
● To use python data structures – lists, tuples, dictionaries.
● To do input/output operations with files in python.
● To handle exceptions using python programming
1. Implement programs using Expression and Operators
2. Scientific programs using Conditional and Iterative loops
3. Implement programs using Functions
4. Practice various String operations using python
5. Implement programs using List &Tuples
6. Develop python programs using Sets
7. Implement various operations in Dictionaries
8. Implement real-time/technical applications using File Handling
9. Develop a python code to handle exceptions
10. Develop a python code using Numpy, Panda and Matplotlib
Course outcome(s):
After the completion of this course, students will be able to:
1. Write simple python programs using operators and expressions.
2. Implement python programs using conditionals and loops for solving problems.
3. Develop python programs using various string handling functions.
4. Analyze compound data using python data structures.
5. Use python file handling operations and exception handling in various real time applications.

Text Book(s):
1. Allen B. Downey, Think Python: How to Think Like a Computer Scientist, 2nd edition, Updated for
Python 3, Shroff/O’Reilly Publishers, 2016.
2. Karl Beecher, “Computational Thinking: A Beginners Guide to Problem Solving and programming”,
1st Edition, BCS Learning & Development Limited, 2017.
Reference books:
1. Gowrishankar S, Veena A, ―Introduction to Python Programming‖, 1st Edition, CRC Press/Taylor
& Francis, 2018
2. Martin C. Brown, “Python: The Complete Reference”, 4th Edition, Mc-Graw Hill, 2018.
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.
Web references:
1. www. mhhe.com/kamthane/python
2. https://www.edx.org/course/computing-in-python
3. http://greenteapress.com/wp/think-python/
Course Articulation Matrix
CO vs PO mapping
PO P
PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
CO O
2 3 4 5 6 7 8 9 0 1 2 1 2 3
1
CO1 2 1 - - - - - - - - - - 1 - -
CO2 2 2 - 2 - - - - - - - - 2 - -
CO3 1 2 - - 1 - - - - - - - 2 - -
CO4 - 2 1 - 2 - - - - - - - 2 3 -
CO5 1 2 2 2 - - - - - - - - 2 3 -
Average 1 2 1 1 1 - - - - - - - 2 1 -
Course Code Course Title L T P C Hours

தநிமரும்மதொமில்த௃ட்஧மும் 1 0 0 1 15

Common to All
அ஬கு I ம஥ெவு நற்றும் ஧ொம஦த்மதொமில்த௃ட்஧ம் 3
ெங்ககொ஬த்தில் ம஥ெவுத்மதொமில் - ஧ொம஦த்மதொமில்த௃ட்஧ம் – கருப்பு ெியப்பு ஧ொண்டங்கள் –
஧ொண்டங்க஭ில் கீ஫ல் கு஫ிம௃டுகள்.
அ஬கு || யடியமநப்பு நற்றும் கட்டிடத்மதொமில்த௃ட்஧ம் 3
ெங்ககொ஬த்தில் யடியமநப்பு நற்றும் கட்டுநொ஦ங்கள் & ெங்ககொ஬த்தில் வீட்டுப்ம஧ொருட்க஭ில்
யடியமநப்பு – ெங்ககொ஬த்தில் கட்டுநொ஦ ம஧ொருட்களும் ஥டுகல்லும் ெி஬ப்஧திகொபத்தில் மநமட
அமநப்பு ஧ற்஫ின யியபங்கள் - நொநல்஬புபச்ெிற்஧ங்களும், மகொயில்களும்-
மெொமர்கொ஬த்துப்ம஧ருங்மகொனில்கள் நற்றும் ஧ி஫ யமி஧ொட்டுத்த஬ங்கள் – ஥ொனக்கர் கொ஬க்மகொனில்கள்
நொதிொி கட்டமநப்புகள் ஧ற்஫ி அ஫ிதல், நதுமப நீ஦ொட்ெி அம்நன் ஆ஬னம் நற்றும் திருநம஬
஥ொனக்கர்நஹொல் – மெட்டி஥ொ ட்டுவீடுகள் – ஧ிொிட்டிஷ் கொ஬த்தில் மென்ம஦னில் இந்மதொ-ெொமபொ
மெ஦ிக்கட்டிடக்கம஬,
அ஬கு III மய஭ொண்மந மதொமில்த௃ட்஧ம் நற்றும் உற்஧த்தித்மதொமில்த௃ட்஧ம் 3
அமண, ஏொி, கு஭ங்கள். நதகு – மெொமர்கொ஬க்கு முமித்தூம் ஧ின் முக்கினத்துயம் – கொல்஥மட ஧பொநொிப்பு
– கொல் ஥மடகளுக்கொக யடியமநக்கப்஧ட்ட கிணறுகள் – மய஭ொண்மந நற்றும் மய஭ொண்மநச்ெொர்த்த
மெனல்஧ொடுகள் – கடல்ெொர் அ஫ிவு - நீன்ய஭ம் – முத்து நற்றும் முத்துக்கு஭ித்தல் ம஧ருங்கடல் கு஫ித்த
஧ண்மடன அ஫ிவு அ஫ிவு ெொர்ெமூகம். யப஬ொற்று ஥ொணனங்கள் கப்஧ல் கட்டும்கம஬ - உம஬ொகயினல் -
இரும்புத்மதொமிற்ெொம஬ – இரும்ம஧ உருக்குதல், எஃகு ெொன்றுக஭ொக மெம்பு நற்றும் தங்க
஥ொணனங்கள் அச்ெடித்தல் – நணி உருயொக்கும் மதொமிற்ெொம஬கள் - கல்நணிகள், கண்ணொடிநணிகள் -
சுடுநண்நணிகள் - ெங்குநணிகள் - எலும்புத்துண்டுகள் - மதொல்லினல்ெொன்றுகள்- ெி஬ப்஧திகொபத்தில்
நணிக஭ின்யமககள்
அ஬கு IV அ஫ியினல் தநிழ் 3
அ஫ியினல் தநிமின் மதொற்஫ம் - ய஭ர்ச்ெி - யப஬ொறு – ஧஬தும஫ அ஫ியினல் தநிழ் த௄ல்கள் உருயொகி
ய஭ர்ந்தமந – தநிமில் அ஫ியினல் இதழ்கள் – ெங்க இ஬க்கினத்தில் அ஫ியினல் கூறுகள் கம஬ச்மெொல்
யி஭க்கம் – தநிமில்கம஬ச்மெொல்஬ொக்க ம஥஫ிகள்
அ஬கு V கணித்தநிழ் 3
கணித்தநிழ் ய஭ர்ச்ெி –தநிழ்த௄ல்கம஭ நின் ஧திப்பு மெய்தல் – தநிழ் மநன்ம஧ொருட்கள் உருயொக்கம் –
தநிழ் இமணனக்கல் யிக்கமகம் – தநிழ் நின்த௄஬கம் – இமணனத்தில் தநிழ் அகபொதிகள் -
மெொற்குமயத்திட்டம்
TEXT- CUM - REFERENCE BOOKS

1. தநிமக யப஬ொறு – நக்களும் ஧ண்஧ொடும் - மக. மக. ஧ிள்ம஭ (மய஭ிம௃டு தநிழ்஥ொடு

஧ொடத௄ல் நற்றும் கல்யினினல் ஧ணிகள்கமகம்).
2. கணி஦ித்தநிழ் -மும஦யர்இ஬. சுந்தபம் (யிகடன்஧ிபசுபம்).கீமடி – ஐயமக ஥திக்கமபனில்
ெங்ககொ஬ ஥ொகொிகம்(மதொல்லினல்தும஫ மய஭ிம௃டு).
3. ம஧ொரும஥ ஆற்஫ங்கமப ஥ொகொிகம், (மதொல்லினல்தும஫ மய஭ிம௃டு).
4. கம஬ச்மெொல்஬ொக்கம் – மும஦யர் இபொ தொ மெல்஬ப்஧ன் (க஦ினமுதம்மய஭ிம௃டு)
5. Social Life of Tamils (Dr. K. K. Pillay) A joint publication of TNTB & ESC and RMRL - (in
print).
6. Social Life of the Tamils - The Classical Period (Dr. S. Singaravelu) (Publishedby:
International Institute of Tamil Studies).
7. Historical Heritage of the Tamils (Dr. S. V. Subatamanian, DR. K. D. Thirunavukkarasy)
(Published by: International Institute of Tamil studies).
8. The Contributors of the Tamils to Indian Culture (Dr. M. Valarmathi) (Published
by:International Institute of Tamil studies).
9. Keeladi Sangam City Civilization on the banks of river Vaigai' (Jointy Published by:
Department of Archaeology & Tamil Nadu Text Book and Educational Services Corporation,
Tamil Nadu).
10. Studies in the History of India with Special Reference to Tamil Nadu (Dr. K.K.Pillay)
(Published by: The Author)
11. Porunai Civilization (Jointy Published by: Department of Archaeology & Tamil Nadu Text
Book and Educational Services Corporation, Tamil Nadu)
SEMESTER III
 L T P C Hours
22UMA302 DISCRETE STRUCTURES
3 0 0 3 45
Common to CSBS, CSE & IT
Prerequisites : Knowledge in Basic Algebra
Course Objectives :The course aims to
 Understand the concepts of Logic, rules of Inference and Quantifiers
 Familiarize the basic terminologies and concepts of Combinatorics
 Introduce the concepts of Graphs and Trees
 Impart the knowledge on Algebraic Structures
 Elaborate the concepts of Lattices and Boolean Algebra
UNIT 1 LOGIC AND EQUIVALENCES 9
Propositional logic – Propositional equivalences – Normal Forms – Predicates and quantifiers –
Rules of inference (Direct & Indirect) – Verbal arguments.
UNIT 2 COMBINATORICS 9
Mathematical induction – Well ordering – The basics of counting : sum & product rules –
Permutations and Combinations – Generating functions.
UNIT 3 GRAPHS AND TREES 9
Graphs – Basic Definitions –Subgraphs – Isomorphism – Eulerian and Hamiltonian Paths : Dirac’s
Theorem , Euler’s Theorem – Trees and their properties.
UNIT 4 ALGEBRAIC STRUCTURES 9
Algebraic systems – Groups – Subgroups – Cayley’s theorem – Fundamental theorem on
Homomorphism – Lagrange’s theorem.
UNIT 5 LATTICES AND BOOLEAN ALGEBRA 9
Partial ordering – Posets – Lattices as posets – Properties of Lattices – Lattices as Algebraic systems
– Sub lattices – Boolean Algebra.
Course Outcomes: At the end of the course, students will be able to
CO1: Write mathematical arguments and test the validity of arguments using logic equivalences.
CO2: Prove mathematical statements using induction techniques, generating functions and basics of
counting principle.
CO3: Explain the concepts of graph isomorphism, Eulerian , Hamiltonian paths and properties of
trees
CO4: Illustrate various algebraic structures and their properties
CO5: Determine the concepts of lattices as algebraic system associated with Boolean algebra.
Text Books :
[1] Rosen KH, "Discrete Mathematics and its Applications", Tata McGraw Hill PublicationCompany
Limited, NewDelhi, Special Indian Edition, 8th Edition, 2019.
[2] Tremblay JP and Manohar R, "Discrete Mathematical Structures with Applications to
Computer Science", Tata McGraw Hill Publication Company Limited,NewDelhi, 30th
Reprint, 2011.
Reference Books:
[1]NarsinghDeo, "Graph Theory with Applications to Engineering and Computer Science",
Prentice Hall Inc., Englewood Cliffs N.J, 2nd Edition, 2016.
[2]Grimaldi RP, "Discrete and Combinatorial Mathematics: An Applied Introduction",
Pearson Education, Asia, 5th Edition, New Delhi, 2019.
[3] Susanna S. Epp,“Discrete Mathematics with Applications”, 5th Edition, Cengage., USA, 2019.
[4]Bondy JA and MurtyUSR,"Graph Theory with Applications", Elsevier Science Publishing Co., Inc.,
5th Edition, 1982.
Web References:
[1]https://onlinecourses.nptel.ac.in/noc22_cs123/preview
[2]https://onlinecourses.nptel.ac.in/noc22_ma67/preview
COURSE ARTICULATION MATRIX

Course PROGRAM OUTCOMES

Outcome
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
s
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
Average 3 3 2 1 - - - - - - - 1
 L T P C Hours
22UCS301 DATA STRUCTURES CONCEPTS
3 0 0 3 45
Prerequisite: 22UCS101 Programming In C
Course Objectives: The course aims to
 To understand the concepts of ADTs
 To Learn linear data structures stacks, and queues
 To implement nonlinear data structure - tree
 To Learn nonlinear data structures -graph
 To understand sorting, searching and hashing algorithms
Unit 1 Introduction to data structures and Linked Lists 9
Introduction to Data Structures, abstract data types, Linear list – singly linked list implementation, insertion,
deletion and searching operations on linear list, circular linked list implementation, Double linked list
implementation, insertion, deletion and searching operations. Applications of linked lists
Unit 2 Stacks and Queues 9
Stacks-Operations, array and linked representations of stacks, stack applications -infix to postfix conversion,
postfix expression evaluation, recursion implementation. Queues-operations, array and linked
representations. Circular Queue operations, Dequeues, priority queue-applications of queues.
Unit 3 Trees 9
Tree ADT – Tree traversals – Left child right sibling data structures for general trees – Binary Tree ADT –
Expression trees –Binary search tree ADT- AVL trees – B-Tree – Heaps – Binary heaps – Applications of trees.
Unit 4 Graph and Algorithms 9
Definitions – Representation of Graphs – Traversal- Topological sort – Shortest path algorithms: Dijkstra’s
algorithm– Minimum spanning tree: Prim’s and Kruskal’s algorithm.
Unit 5 Sorting , Searching and Hashing 9
Sorting: Insertion sort –Shell sort – Merge sort – Quick sort – Searching: Linear search – Binary search.
Hashing - Hash table methods, Collision techniques.
Course Outcomes: At the end of the course, students will be able to
CO1 : Define linear and non-linear data structures.
CO2: Implement stack and queue data structure operations
CO3: Use appropriate tree data structure operations for solving a given problem.
CO4: Apply appropriate graph algorithms for graph applications.
CO5: Analyze the various searching and sorting algorithms..
Text Books:
[1] Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2nd Edition, Pearson Education, 2005.
[2] Kamthane, Introduction to Data Structures in C, 1st Edition, Pearson Education, 2007
Reference Books:
[1] Langsam, Augenstein and Tanenbaum, Data Structures Using C and C++, 2nd Edition, Pearson Education,
2015.
[2] Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, Introduction to Algorithms",
Fourth Edition, Mcgraw Hill/ MIT Press, 2022.
[3] Alfred V. Aho, Jeffrey D. Ullman,John E. Hopcroft ,Data Structures and Algorithms, 1st edition, Pearson,
2002.
[4] Kruse, Data Structures and Program Design in C, 2nd Edition, Pearson Education, 2006.
Web links:
[1]. https://nptel.ac.in/courses/106102064
[2] https://www.udemy.com/course/datastructurescncpp
[3]. https://www.edx.org/learn/data-structures
Course Articulation Matrix
CO vs PO mapping
PO/ PO PO PO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PSO1 PSO2 PSO3
CO 10 11 12
CO1 2 1 - - - - - - - - - - 1 1 -
CO2 3 2 1 - - - - - - - - - 1 1 -
CO3 3 2 1 - - - - - - - - - 1 1 -
CO4 3 2 1 - - - - - - - - - 1 2 -
CO5 3 2 1 - - - - - - - - - 1 1 -
Avg 3 2 1 - - - - - - - - - 1 1 -
 L T P C Hours
22UCS302 FORMAL LANGUAGES AND AUTOMATA THEORY
3 1 0 4 60
Prerequisite :
Course Objectives : The course aims to
 To understand the language hierarchy
 To construct automata for any given pattern and find its equivalent regular expressions
 To design a context free grammar for any given language
 To understand Turing machines and their capability
 To understand undecidable problems and NP class problems
Unit 1 Fundamentals of Finite Automata 9+3
Introduction to formal proof – Additional forms of Proof – Inductive Proofs –Finite Automata – Deterministic
Finite Automata – Non-deterministic Finite Automata – Finite Automata with Epsilon Transitions –
Equivalence of DFA and NFA
Unit 2 Regular Expressions And Languages 9+3
Regular Expressions – FA and Regular Expressions – Proving Languages not to be regular – Closure
Properties of Regular Languages – Equivalence and Minimization of Automata.
Unit 3 Grammars 9+3
Grammar Introduction– Types of Grammar - Context Free Grammars and Languages– Derivations and
Languages – Ambiguity- Relationship between derivation and derivation trees – Simplification of CFG–
Greiback Normal form –Chomsky normal form – Problems related to CNF and GNF.
Unit 4 Pushdown Automata 9+3
Pushdown Automata- Definitions – Moves – Instantaneous descriptions – Deterministic pushdown automata
– Equivalence of Pushdown automata and CFL - pumping lemma for CFL – problems based on pumping
Lemma.
Unit 5 Turing Machine and Undecidability 9+3
Turing Machines (TM) – Programming Techniques – Non Recursive Enumerable Language – Undecidable
Problems with RE – Undecidable Problems about TM – Post’s Correspondence Problem – RICE theorem- The
Class P and NP.
Course Outcomes: At the end of the course, students will be able to
CO1: Construct automata, regular expression for any pattern.
CO2: Write Context free grammar for any construct.
CO3: Design Turing machines for any language.
CO4: Propose computation solutions using Turing machines.
CO5: Derive whether a problem is decidable or not.
Text Books :
[1]John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, “Introduction to AutomataTheory, Languages and
Computation”, 3/E, Pearson Education, 2009.
[2]J.Martin, ―Introduction to Languages and the Theory of Computation‖, Third Edition, TMH, 2003.
Reference Books :
[1]KamalaKrithivasan, Rama R, “Introduction to Formal Languages, AutomataTheory and Computation”,
Pearson, 2009
[2]Dr. B. N. Srinivasa Murthy, “Formal Languages and Automata Theory”, SanguinePublishers, 2006.
[3]Jeffrey D Ullman, John E Hopcroft, Introduction to Automata Theory and Languages, Addison-Wesley ,
1979.
Web Links:
[1]. https://archive.nptel.ac.in/courses/111/103/111103016/
[2]. https://www.udemy.com/course/formal-languages-and-automata-theory-e/
[3]. https://online.stanford.edu/courses/soe-ycsautomata-automata-theory
Course Articulation Matrix
CO vs PO mapping
PO/ PO PO PO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PSO1 PSO2 PSO3
CO 10 11 12
CO1 2 1 - - - - - - - - - - 2 1 -
CO2 2 1 - - - - - - - - - - 2 1 -
CO3 3 2 1 - - - - - - - - - 2 1 -
CO4 3 2 1 - - - - - - - - - 2 2 -
CO5 3 2 1 - - - - - - - - - 2 1 -
Avg 3 2 1 - - - - - - - - - 1 1 -
 L T P C Hours
22UCS303 DATA SCIENCE ESSENTIALS
2 0 0 2 30
Common to
Pre-requisite: 22UIT201 Python Programming
Course Objectives: The course aims to
 Describe about the various types of data
 Discuss about the data science process
 Describe Data with using various statistical techniques
 Understand the pandas and NumPy arrays
 Understand Plotting functions
UNIT I INTRODUCTION TO DATA SCIENCE 6
Introduction to Data Science - Benefits and uses of data science and big data - facts of data: Structured data,
Unstructured data, Natural Language, Machine generated data, Audio, Image and video streaming data.

UNIT II THE DATA SCIENCE PROCESS 6

Overview of the data science process- defining research goals and creating project charter, retrieving data,
cleansing, integrating and transforming data, exploratory data analysis, Build the models, presenting findings and
building application on top of them.
UNIT III DESCRIBING DATA 6
Types of Data - Types of Variables -Describing Data with Tables and Graphs– Outliers, Relative Frequency ,
Distributions , Cumulative Frequency Distributions, Frequency Distributions For Qualitative (Nominal) Data,
Graphs For Quantitative Data, Histogram, frequency polygon, Stem And Leaf Display , Typical shapes, A Graph
For Qualitative (Nominal) Data , Describing Data with Averages, Mode, Median, Mean
UNIT IV DATA MANIPULATION AND IMPLEMENTATION 6
Basics of NumPy Arrays - Computation on NumPy Arrays, Aggregation: Min, Max. Operating on Data in Pandas,
Handling Missing Data. Implementation basic regression analysis
UNIT V DATA VISUALIZATION WITH MATPLOTLIB 6
General Matplotlib Tips, Simple Line Plots, Simple Scatter Plots, Visualizing Errors Density and Contour Plots,
Histograms, Binnings, and Density, Customizing Plot Legends Customizing Colorbars, Multiple Subplots, Text and
Annotation, Customizing Ticks Customizing Matplotlib: Configurations and Stylesheets.
Course outcomes: At the end of the course, students will be able to
CO1: Identify phases involved in the life cycle of Data Science.
CO2: Apply the Data Science process on real time scenario.
CO3: Realize the various data analytics techniques for labeled/columnar Data using Python Pandas.
CO4: Explore a flexible range of data visualizations approaches in Python.
CO5: Analyze various Machine learning algorithms for data modeling with Python.
Text Books:
[1]Python Data Science Handbook-Essential Tools for Working with Data, Jake Vander Plas, O'Reilly Media, 2nd
edition, 2022.
[2] Data Science from Scratch: First Principles with Python, Joel Grus, O'Reilly, 2nd edition, 2019.
Reference Books:
[1] Python for Data Analysis, Wes Mckinney, O'Reilly Media, 2nd edition, 2017.
[2] Field Cady, “Data Science Hand Book”, John Wiley & Sons, 2017.
[3]Fundamentals of Data Science, Samuel Burns, Amazon KDP printing and Publishing, 2019.
[4] Doing Data Science, Straight Talk From The Frontline, Cathy O'Neil and Rachel Schutt. O'Reilly. 2014.
Web references:
[1]https://onlinecourses.nptel.ac.in/noc18_cs28/
[2] http://bigdatauniversity.com/
[3] http://home.ubalt.edu/ntsbarsh/stat-data/topics.htm#rintroduction
Course Articulation Matrix
CO vs PO mapping
P
PO/ PO PO PO PO PO PO PO PO PO O PO PO PSO
PSO1 PSO2
CO 1 2 3 4 5 6 7 8 9 1 11 12 3
0
CO1 2 2 3 1 1 1 2 1
CO2 3 2 2 2 1 1 2 1
CO3 3 3 2 3 2 1 2 2
CO4 3 2 2 2 2 1 2 2
CO5 3 2 2 2 2 2 2 2
Avg 3 2 2 2 2 1 2 2
 L T P C Hours
22UEE408 MICROPROCESSOR AND MICROCONTROLLER
2 0 2 3 45

Prerequisite: 22UIT202 Digital Principles and System Design

Course Objectives: The Course aims to
 Understand the Architecture of 8086 microprocessor.
 Learn the design aspects of I/O and Memory Interfacing circuits. Along with supporting
chips.
 Study the Architecture of 8051 microcontroller.
 Design a microcontroller-based system.
 Understand the hardware features of RISC-based Architecture.
UNIT I THE 8086 MICROPROCESSOR AND BUS STRUCTURE 6
Introduction to 8086 – Microprocessor architecture – 8086 signals – Basic configurations – System
bus timing –System design using 8086 – System Bus Structure – Multiprocessor
configurations – Coprocessor, closely coupled and loosely Coupled configurations - Interrupts and
interrupt service routines
UNIT II 8086 PROGRAMMING 6
Assembly language programming - Instruction set - Addressing modes -assembler directives -
Modular Programming: Linking, Relocation, Stacks, Procedures and Macros –Parallel
communication interface – Serial communication interface – D/A and A/D Interface - DMA
controller
UNIT III 8051 MICROCONTROLLER 6
Architecture of 8051 – Memory Organization and Special Function Registers (SFRs) - I/O Ports–
Instruction set - Addressing modes – Timer – Serial Communication – Interrupts.
UNIT IV MICROCONTROLLER INTERFACING 6
Programming 8051 Timers - Serial Port Programming - Interrupts Programming – LCD &
Keyboard Interfacing – Stepper Motor - ADC, DAC & Sensor Interfacing.
UNIT V INTRODUCTIONTO RISC-BASED ARCHITECTURE 6
PIC16 /18 architecture - Memory organization – Addressing modes – Instruction set -– Timers –
I/O ports – Interrupt – Basic Programming.
Course Outcomes :At the end of the course, Students will be able to
CO1: Explain the architecture of 8086 and Illustrate the system bus structures, multiprocessor
configuration of 8086.
CO2: Develop assembly level programs to interfacing various I/O modules with 8086.
CO3: Acquire knowledge about the architecture, programming of microcontroller 8051.
CO4: Develop assembly level programs to configure various hardware features in 8051.
CO5 : Explain the architecture of PIC controller along with the program model.
List of Experiments:
1. PROGRAMMING EXERCISES / EXPERIMENTS WITH µP8086:
1. Simple arithmetic and Logic operations using 8086
2. Programming with control instructions: Ascending /Descending order/Maximum / Minimum of
numbers.
3. Interface Experiments: A/D Interfacing. D/A Interfacing.
2. PROGRAMMING EXERCISES / EXPERIMENTS WITH µC8051:
4. Simple arithmetic and Logical operations with 8051
5. Programming with control instructions: Ascending /Descending order/Maximum / Minimum of
numbers
6. Stepper motor controller and Keyboard and Display Controller interface.
7. PIC Programming with software tools.
Text Books:
1. Yu-Cheng Liu, Glenn A. Gibson, ―Microcomputer Systems: The 8086 / 8088 Family -
Architecture, Programming and Design, Second Edition, Prentice Hall of India, 2007.
2. Mohamed Ali Mazidi, Janice GillispieMazidi, Rolin McKinley, ―The 8051 Microcontroller and
Embedded Systems: Using Assembly and C, Second Edition, Pearson education, 2011.
Reference Books:
1. Muhammad Ali Mazidi& Janice GilliMazidi, ‘The PIC Micro Controller and Embedded Systems,
2010.
2. Doughlas V. Hall, ―Microprocessors and Interfacing, Programming and Hardware,
TMH,2012.
3. A.K. Ray, K.M. Bhurchandi, Advanced Microprocessors and Peripherals ―3rd edition,
TataMcGrawHill, 2012.
4. Kenneth Ayala, ‘The 8051 Microcontroller’, Thomson, 3rd Edition 2004.
Online Resources:
1. https://onlinecourses.nptel.ac.in/noc22_ee12/preview
Course Articulation Matrix COvsPO mapping
PO/C PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
O 1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3
CO1 3 - - - - - - - - - - - - - -
CO2 3 2 - - - - - - - - 2 2 - - -
CO3 3 - - - - - - - - - - - - - -
CO4 3 2 - - - - - - - - 2 2 - - -
CO5 3 - - - 2 - - - - - - 2 - - -
Avera
3 2 - - 2 - - - - - - 2 - - -
ge
 L T P C Hours
22UIT302 JAVA PROGRAMMING
3 0 2 4 60
Common to CSE, CSBS& IT
Pre-requisite: C Programming
Course Objectives: The course aims to
 Understand the basic features of OOP in Java
 Apply the types of Inheritance, Packages and Interfaces supported by Java
 Recognize the exception Handling and Multithreading process supported by Java
 Understand and apply I/O file operations, Generics and String Handling.
 Identify the fundamental concepts of collection framework.
UNIT I Introduction to Java 9

An overview of Java- Data Types, Variables, and Arrays - Operators-Control Statements – Classes – Methods –
access specifies – static members – Constructor- Destructor
UNIT II Inheritance and Packages 9
Overloading Methods – Objects as Parameters – Returning Objects –Static, Nested and Inner Classes.
Inheritance: Basics– Types of Inheritance -Super keyword -Method Overriding – Dynamic Method Dispatch –
Abstract Classes – final with Inheritance. Packages and Interfaces: Packages–Importing Packages – Interfaces.
UNIT III Exception Handling and Multi-Threading 9
Exception Handling fundamentals – Multiple catch Clauses – Nested try Statements – Java’s Built-in Exceptions
– User defined Exception. Multithreaded Programming: Java Thread Model–Creating a Thread and Multiple
Threads – Thread Priorities – Synchronization – Inter Thread Communication- Suspending –Resuming, and
Stopping Threads –Multithreading. Wrappers – Auto boxing.
UNIT IV I/O and String Handling 9
I/O Basics – Reading and Writing Console I/O – Reading and Writing Files. Generics: Generic Programming –
Generic classes – Generic Methods – Bounded Types. Strings: Basic String class, methods and String Buffer
Class.
UNIT V Collection Framework 9
Collection overview- List Interface -ArrayList, Linked List, Set Interface-HashSet, Linked HashSet, Queue
Interface -Priority Queue – Deque Interface – ArrayDeque-Accessing a collection via an Iterator- Working with
Maps- Comparators-Collection Algorithms- Introduction to Java Advanced features.
List of Experiments: 15 Hours
1. Implementing a usecase using arrays.
2. Implementation of Inheritance, Interfaces and Packages
3. Implementation of Multithreaded Programming and string methods.
4. Implementation of Exception handling mechanisms
5. Implement real-time/technical applications using File Handling
6. Implementing a usecase using Java Collection framework

Course outcomes: At the end of the course, students will be able to

CO1: Apply the concepts of classes and objects to solve simple problems
CO2: Develop programs using inheritance, polymorphism, interfaces and packages.
CO3: Make use of exception handling mechanisms and multithreaded model to solve real world problems
CO4: Build Java applications with files and Strings handling.
CO5: Design java applications using collection framework.
Text Books:
[1] Herbert Schildt, “Java The complete reference”, 12th Edition, McGraw Hill Education, 2022.
[2] Sachin Malhotra, Saurabh Choudhary, “Programming in Java”, Revised Second Edition, Oxford, 2018.

Reference Books:
[1] Deitel&Deitel, “Java How to Program”, Prentice Hall of India, 2010
[2] Gary Cornell and Cay S.Horstmann, “Core Java” Vol.1 and Vol.2, Sun Microsystems Press, 2008
[3] E.Balaguruswamy,“Programming with Java- A Primer”, Fifth Edition, TMH, Reprint 2015.
[4] Cay S. Horstmann, “Core Java Fundamentals”, Volume 1, 11 th Edition, Prentice Hall, 2018.

Web references:
[1]https://www.tutorialspoint.com/java/index.htm
[2] https://www.javatpoint.com/java-tutorial
[3] https://www.w3schools.com/java/
[4] https://www.geeksforgeeks.org/java/

COURSE ARTICULATION MATRIX

Programme Outcomes/Programme Specific Outcomes (POs/PSOs)
Course
Outcomes PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 1 2 - - - - - - - - 2 2 - -
CO2 3 2 2 - - - - - - - - 2 2 - -
CO3 3 2 3 - - - - - - - - 2 2 - -
CO4 3 2 3 - - - - - - - - 2 2 - -
CO5 2 1 2 - - - - - - - - 2 2 - -
Average 3 2 3 - - - - - - - - 2 2 - -
 L T P C Hours
22UCS304 DATA STRUCTURES CONCEPTS LABORATORY
0 0 4 2 60
Prerequisite: 22UCS101 Programming In C
Course Objectives : The course aims to
 To implement linear data structures
 To implement non-linear data structures
 To understand the different operations of search trees
 To implement graph traversal algorithms
 To get familiarized to sorting and searching algorithms
List Of Experiments:
1. Implementation of Linked List
2. Applications of Linked List
3. Implementation Stack and queue
4. Applications of Stack
5. Operations on Binary Search Trees
6. Applications of Binary Search Tree
7. Graphs - Depth First Search and Breadth First Search
8. Hashing and Collision Resolution
9. Sorting algorithms
10. Searching algorithms
Total Hours : 60 Hours
Course Outcome: At the end of the course, students will be able to
CO1: Implement linear data structures using arrays and Linked Lists
CO2: Implement linear stack and queue data structures
CO3: Implement Nonlinear data structures using tree data structure
CO4: Implement graph and its applications
CO5: Implement various sorting and hashing Techniques
Software Requirements :
 Software Required – TURBOC version 3 or GCC version 3.3.4.
 Operating System – WINDOWS 2000 / XP / NT OR LINUX
Hardware Requirements:
Computers Required – 30 Nos. (Minimum Requirement: Pentium III or Pentium IV with 256 RAM and 40 GB
harddisk)
Course Articulation Matrix
CO vs PO mapping
PO/ PO PO PO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PSO1 PSO2 PSO3
CO 10 11 12
CO1 3 2 2 2 2 2
CO2 3 2 2 2 2 2
CO3 3 2 2 2 2 2
CO4 3 2 2 2 2 2
CO5 3 2 2 2 2 2
Avg 3 2 2 2 2 2
 INTERPERSONAL SKILLS & PERSONALITY L T P C Hours
22UEN301
DEVELOPMENT 0 0 2 1 30
Common to All UG Branches
Prerequisites: Basic Knowledge in Language usage
Course objectives:
 Augment the Employability and Career Skills of students to enhance their prospect of
placement
 Enhance their communicative competence.
 Equip them with soft skills.
 Orient the students towards grooming as a professional
 Develop the confidence to attend interviews effectively
UNIT 1 INTRODUCTION 6
Introduction to Soft Skills– Hard skills & soft skills – employability and career Skills—Grooming as a
professional with values—Time Management—General awareness of Current Affairs
UNIT 2 COMMUNICATION SKILLS 6
Verbal and nonverbal communication -Self-Introduction-organizing the material – Introducing
oneself to the audience – introducing the topic – answering questions – individual presentation
practice– presenting the visuals effectively – 5 minutes presentations- JAM
UNIT 3 TEAMWORK SKILLS 6
Introduction to Group Discussion— participating in group discussions – understanding group
dynamics – brainstorming the topic -– questioning and clarifying –GD strategies- activities to
improve GD skills – Role plays
UNIT 4 PROFESSIONAL SKILLS 6
Interview etiquette – dress code – body language – attending interviews– telephone/online
interview -one to one interview &panel interview – FAQs related to job interviews- cover letter –
resume – emails – letters – memos – reports – blogs – writing for publications.
UNIT 5 EMOTIONAL AND SOCIAL SKILLS 6
Multiple intelligences – emotional intelligence – spiritual quotient (ethics) – intercultural
communication – creative and critical thinking – Art of Negotiation and Persuasion
Course outcomes:
CO 1: Develop the hard and soft skills with professional grooming
CO 2: Improve self-introduction and presentation skills.

CO 3: Orient Group discussion tactics and making students understand group dynamics
CO 4: Enhance Career oriented Skills.
CO 5:Acquire adequate Soft Skills required for the workplace
Textbooks:
[1] Robert M Sherfieldet al., “Developing Soft Skills”, 4th edition, New Delhi, Pearson Education,
2009.
[2] Raman, Meenakshi and Sangeeta Sharma, “Professional Communication”, Oxford University
Press, Oxford, 2014.
Reference books:
[1] Butterfield, Jeff, “Soft Skills for Everyone”, Cengage Learning, New Delhi, 2015.
[2] E. Suresh Kumar et al. “Communication for Professional Success”, Orient Blackswan, Hyderabad,
 2015.
[3] Interact English Lab Manual for Undergraduate Students, Orient Blackswan, Hyderabad, 2016.
[4] S. Hariharan et.al.,“Soft Skills”, MJP Publishers, Chennai, 2010.
Web references:
https://learnenglish.britishcouncil.org/
https://www.cambridgeenglish.org/learning-english/activities-for-learners/
MAPPING OF COs with POs
Course PROGRAM OUTCOMES
Outcome PO1 PO1
s PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO12
0 1
CO1 - - - - - 2 - - 3 2 - 1
CO2 - - - - - 2 - - 3 2 - 1
CO3 - - - - - 2 - - 3 2 - 1
CO4 - - - - - 2 - - 3 2 - 1
CO5 - - - - - 2 - - 3 2 - 1
Averag
- - - - - 2 - - 3 2 - 1
e
 DESIGNTHINKING L T P C Hours
22UOC102
(Common to All Branches) 1 0 0 1 15
Prerequisite: Nil
Course Objectives: This course aims
● To impart knowledge on design thinking process for understanding complex designs.
● To provide design skills to analyze design thinking issues and apply the tools and techniques
of design.
Module:I Overview of Design Thinking Process 7
Introduction to design thinking: Definition, Origin of design thinking, Importance of design thinking,
Problem solving, Understanding design thinking and its process model, Design thinking tools,
Human Cantered Design(HCD)process-Karmic design thinking process.
Module:II Design Thinking Practice 8
Empathize-Role of empathy in design thinking, customer journey mapping, How might we
questions, Analyze Or Define - Root cause analysis, conflict of interest, Solve Or Ideate –Silent
brainstorming, introduction to TRIZ, Test(Prototyping and Validation)–Prototyping, Validation in
the market.
Course Outcome: After the completion course, students will be able to
CO1: Demonstrate knowledge of design thinking process.
CO2: Apply human centered design(HCD)methodology for productor service design

Reference Books:
1. Dr.Bala Ramadurai,“Karmic Design Thinking”,FirstEdition,2020.
2. RobertACuredale,Design Thinking Process & amp; Methods 4th Edition,December 2017,
Design Community College Inc.
3. 101 Design Methods:A Structured Approach for Driving Innovation in Your Organization by
VijayKumar
4. Human-Centered Design Toolkit: AnOpen-Source Toolkit To Inspire New Solutions in the
Developing World by IDEO
5. This is Service Design Thinking: Basics, Tools, Cases by Marc Stickdorn and Jakob Schneider
6. Ulrich, Kar lT.Design: Creation of artifacts in society.KarlT.Ulrich,2011.
SEMESTER IV
 L T P C Hours
22UMA402 PROBABILITY AND STATISTICS
3 0 0 3 45

Common to AI&DS (III SEMESTER) , CSBS,IT and CSE (IV SEMESTER)

Prerequisites : Knowledge ofbasic Probability.
Course Objectives : The course aims to

 Learn the basic concepts of Random Variables and Distributions

 Understand the ideas of Two-Dimensional Random Variables
 Make use of the Statistical Methods to solve real-life problems
 Understand the principles of the Design of Experiments and perform an Analysis of Variance
 Study the concept of statistical techniques to solve quality control problems

UNIT I PROBABILITY AND RANDOM VARIABLES 9

Probability - Conditional Probability -_Baye’s theorem-Discrete and Continuous Random Variables -
Moment generating functions (Definition only) – Binomial, Poisson, Uniform, Exponential and
Normal distributions.
UNIT II TWO - DIMENSIONAL RANDOM VARIABLES 9
Discrete and Continuous Random Variables: Joint distributions – Marginal and Conditional
distributions – Covariance – Correlation.
UNIT III TESTING OF HYPOTHESIS 9
Sampling distributions – Estimation of parameters – Statistical hypothesis – Large sample tests
based on Normal distribution for single mean – Small sample tests based on t, Chi–square and F
distributions.
UNIT IV DESIGN OF EXPERIMENTS 9
One way and Two way classifications – Completely randomized design – Randomized block design –
Latin square design.
UNIT V STATISTICAL QUALITY CONTROL 9
 
Control charts for measurements: Mean chart X and range chart R  – Control charts for attributes
( p , c and np charts).
Course Outcomes: At the end of the course, students will be able to
CO1: Apply the concepts of random variables and distributions
CO 2: Use correlation techniques to study the properties of two-dimensional random
variables
CO 3: Solve different types of large and small sample problems by testing of hypothesis
CO 4: Utilize the analysis of variance for experimental designs
CO 5: Solve the quality control problems using statistical techniques
Text Books :
[1] Johnson RA, Miller I and Freund J, "Miller and Freund’s Probability and Statistics for
Engineers", Pearson Education, Asia, New Delhi, 9th Edition, 2017.
[2] Gupta S.P, “Statistical Methods”, Sultan Chand &sons ,New Delhi , 46th Edition, 2021.
Reference Books:
[1] Devore JL, "Probability and Statistics for Engineering and the Sciences", Cengage Learning, New
Delhi, 9th Edition, 2017.
[2] Papoulis A and Unnikrishnapillai S, "Probability, Random Variables and Stochastic Processes",
McGraw Hill Education India, New Delhi, 4th Edition, 2010.
[3] Ross SM, "Introduction to Probability and Statistics for Engineers and Scientists", Elsevier, 6th
Edition, 2020.
[4]Veerarajan T, “Probability Statistics and Random Process”, Tata McGraw-Hill Education Private
limited,New Delhi, 2007.
Web References:
[1]https://onlinecourses.nptel.ac.in/noc22_bt44/preview
[2]https://onlinecourses.nptel.ac.in/noc22_ma81/preview
COURSE ARTICULATION MATRIX

Course PROGRAM OUTCOMES

Outcom PO PO PO PO PO PO PO PO PO PO1 PO1
PO12
es 1 2 3 4 5 6 7 8 9 0 1
CO1 3 2 1 - - - - - - - - 1
CO2 3 2 1 - - - - - - - - 1
CO3 3 2 1 - - - - - - - - 1
CO4 3 2 1 - - - - - - - - 1
CO5 3 2 1 - - - - - - - - 1
Average 3 2 1 - - - - - - - - 1
 L T P C Hours
22UCS401 OPERATING SYSTEMS
3 0 0 3 45
Prerequisite : 22UCS101 Programming In C
Course Objectives : The course aims to
 To understand the basic concepts and functions of operating systems, processes and threads.
 To analyze Scheduling algorithms and deadlocks
 To understand the concept of memory management schemes
 To understand I/O management and File systems.
 To be familiar with the basics of Linux system and Mobile OS like iOS and Android.
Unit 1 Operating System Overview 7
Computer System Overview – Basic Elements – Instruction Execution – Interrupts – Memory Hierarchy –
Cache Memory – Direct Memory Access – Operating System Overview – Objectives and functions – System
calls – System Programs – OS Generation and System boot.
Unit 2 Process Management 11
Processes - Process Concept - Process Scheduling - Operations on Processes - Inter-process Communication;
CPU Scheduling - Scheduling criteria - Scheduling algorithms: Threads - Multithread Models – Threading
issues; Process Synchronization - The Critical-Section problem - Synchronization hardware – Semaphores –
Mutex - Classical problems of synchronization - Monitors; Deadlock - Methods for handling deadlocks,
Deadlock prevention, Deadlock avoidance, Deadlock detection, Recovery from deadlock.
Unit 3 Memory Management 9
Main Memory - Swapping - Contiguous Memory Allocation – Paging - Structure of the Page Table -
Segmentation, Segmentation with paging; Virtual Memory - Demand Paging – Copy on Write - Page
Replacement - Allocation of Frames –Thrashing.
Unit 4 Storage Management 9
Mass Storage system – Disk Scheduling and 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; I/O Systems – I/O Hardware, Application I/O interface, Kernel I/O subsystem
Unit 5 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.
Course Outcomes: At the end of the course, students will be able to
CO1: Analyze various scheduling algorithms.
CO2: Understand deadlock, prevention and avoidance algorithms.
CO3: Compare and contrast various memory management schemes.
CO4: Understand the functionality of mass storage and file systems.
CO5: Perform administrative tasks on Linux Servers.
Text Books :
[1]Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, ―Operating System Concepts‖, 9th Edition, John
Wiley and Sons Inc., 2012.
[2]Ramaz Elmasri, A. Gil Carrick, David Levine, ―Operating Systems – A Spiral Approach‖, Tata McGraw Hill
Edition, 2010.
Reference Books :
[1]AchyutS.Godbole, Atul Kahate, ―Operating Systems‖, McGraw Hill Education, 2016.
[2]Andrew S. Tanenbaum, ―Modern Operating Systems‖, Second Edition, Pearson Education, 2004.
[3]Gary Nutt, ―Operating Systems‖, Third Edition, Pearson Education, 2004.
web References:
[1]. https://nptel.ac.in/courses/106105214
[2]. https://www.udacity.com/course/introduction-to-operating-systems--ud923
[3]. https://www.mygreatlearning.com/operating-system/free-courses
Course Articulation Matrix
CO vs PO mapping
PO/ PO PO PO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PSO1 PSO2 PSO3
CO 10 11 12
CO1 3 2 - - - - - - - - - - 1 - -
CO2 3 2 2 - - - - - - - - - 1 - -
CO3 3 2 2 - - - - - - - - - 1 - -
CO4 3 2 2 - - - - - - - - - - - -
CO5 3 2 - - - - - - - - - - 1 - -
Avg 3 2 2 - - - - - - - - - 1 - -
 DATABASE MANAGEMENT SYSTEMS L T P C Hours
22UCS402
(Common to CSE,IT,AIDS & CSBS) 3 0 0 3 45
Prerequisite: -
Course Objective: The course aims to
 Learn fundamentals of Database Management Systems and Relational Algebra.
 Gain knowledge on the data models and data retrieval.
 Understand normalization techniques.
 Understand the essential concepts of transaction processing and concurrency control
 Study the file system, indexing hashing and query processing

Unit 1 Database Fundamentals 9

Introduction – Database System Applications – Views of data – Data models – Database languages –
Database system architecture – Introduction to relational databases – Relational Model – Structure of
Relational Databases – Database Schema – Keys – Relational Query Languages – Relational algebra.
Unit 2 ENTITY RELATIONSHIP MODELING AND SQL 9
Database Design Process – ER model – ER diagrams – Enhanced ER Model – ER to Relational Mapping –
SQL Basic Structure – Set Operations – Aggregate Functions – Sub queries – Nested Sub queries – Joins –
Views– Index – Integrity Constraints – SQL data types and schemas – Authorization –Triggers.
Unit 3 RELATIONAL DATABASE DESIGN 9
Functional dependency – Decomposition using functional dependencies – Canonical Cover– First Normal
Form – Second Normal Form – Third Normal Form – Boyce Codd Normal Form – Fourth Normal Form –
Fifth Normal Form.
Unit 4 TRANSACTION AND CONCURRENCY CONTROL 9
Transaction Concept – ACID properties – Transaction States – Serializability – Conflict serializability –
View Serializability – Testing Serializability - Concurrency Control – Lock Based Protocols – Deadlocks –
Multiple Granularity – Time stamp Based Protocols – Validation Based Protocols – Recovery System –
Failure Classification – Storage – Recovery and Atomicity – Log based Recovery Algorithm.
Unit 5 IMPLEMENTATION TECHNIQUES AND QUERY PROCESSING 9
RAID – File organization – Organization of records in files – Data dictionary Storage – Indexing and hashing
– Ordered indices – B+ Tree index files – B Tree index files – Static hashing – Dynamic hashing. Query
Processing: Measures of Query Cost – Selection – Join Operation – Query Optimization.
Course Outcomes: At the end of the course, students will be able to
CO1: Explain architecture and evolution of database management systems and relational algebra.
CO2: Design database using ER model.
CO3: Design relational databases using normalization methods for a given application.
CO4: Assess different types of scheduling and recovery techniques for concurrent transactions.
CO5: Describe the indexing strategies and query processing.
Text Books:
[1]AbrahamSilberschatz, Henry F. Korth and Sudharshan S., “Database System Concepts”, Seventh Edition,
Tata McGraw Hill, 2020.
[2] RamezElmasri and Shamkant B. Navathe, “Fundamentals of Database Systems”, 7th Edition, Pearson
Education, 2017.
Reference Books:
[1]Raghu Ramakrishnan, “Database Management Systems”, 4th Edition, McGraw-Hill
Publications, 2015.
[2]Date C. J, Kannan A and Swamynathan S, “An Introduction to Database Systems”, 8th Edition, Pearson
Education, 2012.
[3] Gupta G.K., “Database Management Systems”, Tata Mc Graw Hill, 2011.
[4] Thomas Cannolly and Carolyn Begg, “Database Systems, A Practical Approach to Design,
Implementation andManagement”, Pearson Education, Fifth Edition, 2012.

web links:
[1]. https://onlinecourses.nptel.ac.in/noc22_cs91/preview
[2]. https://www.classcentral.com/course/swayam-data-base-management-system-9914
[3]. https://www.edx.org/learn/databases
Course Articulation Matrix
CO vs PO mapping
PO/ PO PO PO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PSO1 PSO2 PSO3
CO 10 11 12
CO1 3 3 3 3 - - - - 1 - 3 1 2 3 2
CO2 2 2 3 2 - - - - 1 - 3 1 2 1 2
CO3 3 3 2 1 - - - - 1 - 1 1 2 3 3
CO4 1 3 3 3 - - - - 1 - 3 1 3 1 3
CO5 3 2 1 1 - - - - 2 - 3 2 3 1 2
Avg 2 3 2 2 - - - - 1 - 3 1 2 2 2
 L T P C Hours
22UCS403 COMPILER DESIGN
3 1 0 4 60
Prerequisite : 22UCS302 Formal Languages and Automata Theory

Course Objectives : The course aims to

 Acquire knowledge in different phases of a Compiler and its applications
 Understand the categorization of tokens using lexical analyzer and pattern recognition using parsers
 To understand intermediate code generation and run-time environment.
 To learn to implement front-end of the compiler
 Familiar with the code generation schemes and optimization methods.
Unit 1 Introduction to Compiler 7+2
Language processors - Structure of a compiler - Grouping of phases into passes- Compiler construction tools -
Applications of compiler technology: Implementation of high-level programming languages - Optimizations
for computer architectures-Design of new computer architecture - Program Translations- Software
productivity tools.
Unit 2 Lexical Analysis 9+4
Lexical Analysis: Role of Lexical Analyzer - Input Buffering - Lexical Errors - Specification of tokens -
Recognition of Tokens - Finite automata - Regular expression to finite automation- Optimization of DFA
based Pattern Matchers-LEX-Design of Lexical Analyzer for a sample Language
Unit 3 Syntax Analysis 9+5
Introduction-Role of the parser - Context-Free Grammars -Writing a Grammar-Top Down parsing - Recursive
Descent Parsing - Nonrecursive Predictive Parsing - Bottom-up parsing - Shift Reduce Parsing- LR Parsers:
Simple LR Parser - Canonical LR Parser - LALR Parser - Error Handling and Recovery in Syntax Analyzer-
YACC-Design of a syntax Analyzer for a Sample Language.
Unit 4 Semantic Analysis 9+3
Syntax Directed Translation - Construction of Syntax Tree - Variants of Syntax Trees -Three-Address Code -
Types and Declarations - Translation of Expressions - Control Flow - Backpatching - Switch- Statements -
Intermediate Code for Procedures.
Unit 5 Code Optimization and Generation 9+3
The Principle Sources of Optimization -Loop Optimization - The DAG representation of Basic Blocks Global
data flow analysis- Reducible flow graphs - Loop invariant computations - Induction variable elimination -
Other loop optimizations. Issues in Code generation - A simple code generator - Register allocation and
assignment - Code generation from DAG's - Peephole optimization.
Course Outcomes: On the completion of course, students should be able to
CO1: Analyze the output generated in each phase of the compiler
CO2: Design a lexical analyzer for a sample language.
CO3: Apply different parsing algorithms to develop the parsers for a given grammar.
CO4: Generate intermediate code for programming constructs
CO5: Apply optimization techniques in code generation and analyze the issues in code generation.
Text Books :
[1] Alfred V. Aho, Ravi Sethi and Jeffrey D. Ullman Compilers: Principles, Techniques and Tools , 2nd Edition,
Pearson, 2012.
Reference Books :
[1] V. Raghavan, Principles of Compiler Designǁ, Tata McGraw Hill Education Publishers, 2010.
[2] Allen I. Holub, Compiler Design in C, Prentice Hall of India, 2003.
web References:
[1] https://nptel.ac.in/courses/106105190
[2] https://online.stanford.edu/courses/soe-ycscs1-compilers
[3] https://www.classcentral.com/course/swayam-compiler-design-12926
Course Articulation Matrix
CO vs PO mapping
PO/ PO PO PO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PSO1 PSO2 PSO3
CO 10 11 12
CO1 3 - - - 2 - - 1 1 1 2 1 2
CO2 2 1 3 2 3 - - 1 1 3 2 1 3 2 1
CO3 3 - - - 3 - - 1 1 1 1 1 1 1
CO4 2 3 - 3 - - - - - - - 1 - - 1
CO5 2 - - 3 - - - - - - 1 - - 1
Avg 2 2 3 3 3 - - 1 1 2 1 1 2 1 1
 L T P C Hours
22UCS404 DESIGN AND ANALYSIS OF ALGORITHMS
2 0 2 3 60
Prerequisite: 22UCS301 Data Structures Concepts
Course Objectives : The course aims to
 To understand and apply the algorithm analysis techniques.
 To critically analyze the efficiency of alternative algorithmic solutions for the same problem
 To learn various searching and sorting algorithms.
 To understand different algorithm design techniques.
 To understand the limitations of Algorithmic power.
Unit 1 Introduction to Algorithms 6
Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important Problem Types –
Fundamentals of the Analysis of Algorithmic Efficiency –Asymptotic Notations and their properties. Analysis
Framework - Mathematical analysis for Recursive and Non-recursive algorithms.
Unit 2 Divide-And-Conquer 6
Divide and Conquer Methodology – Binary Search – Merge sort – Quick sort –strassens matrix multiplication-
Multiplication of Large Integers.
Unit 3 Dynamic Programming Technique 6
Dynamic programming – Principle of optimality – All pairs shortest path (Floyd’s & Warshalls
algorithm) –Optimal Binary Search Trees – Knapsack Problem and Memory functions.
Unit 4 Iterative Improvement 6
The Simplex Method - The Maximum-Flow Problem – Maximum Matching in Bipartite Graphs, Stable
marriage Problem.
Unit 5 Coping With The Limitations of Algorithm Power 6
Backtracking – N-Queens Problem – Hamiltonian Circuit problem-graph coloring-P, NP, NP complete and
hard problems.
List of Experiments:

1. Design and implement an algorithm towers of hanoi

2. Sort a given set of elements using the Quicksort method and determine the time required to sort the
elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and
plot a graph of the time taken versus n. The elements can be read from a file or can be generated using the
random number generator.
3. Implement a parallelized Merge Sort algorithm to sort a given set of elements and determine the time
required to sort the elements. Repeat the experiment for different values of n, the number of elements in the
list to be sorted and plot a graph of the time taken versus n. The elements can be read from a file or can be
generated using the random number generator.
4. Implement All-Pairs Shortest Paths Problem using Floyd's algorithm. Parallelize this algorithm, implement
it determine the speed-up achieved.
5. Implement N Queen's problem using Back Tracking.

Course Outcomes: At the end of the course, students will be able to

CO1: Apply the fundamental concepts of algorithmic problem-solving types.

CO2:Analyze the fundamentals of the algorithm efficiency for real world problems.
CO3: Examine the searching and sorting techniques in the analysis of algorithms.
CO4: Implement the graph algorithms with dynamic programming.
CO5:Apply the algorithm design techniques for P and NP problems.
Text Books :
[1]Anany Levitin, ―Introduction to the Design & Analysis of Algorithms‖, Prentice Hall of India Pearson
Education, New Delhi, 2019.
[2]Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms/ C++, Second Edition,
Universities Press, 2007.
Reference Books :
[1]Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, ―Introduction to Algorithms‖,
Third Edition, PHI Learning Private Limited, 2012.
[2]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, 2015.
Web references:
[1]. https://onlinecourses.nptel.ac.in/noc19_cs47/preview
[2]. https://ocw.mit.edu/courses/6-046j-design-and-analysis-of-algorithms-spring-2015/
[3] https://online.stanford.edu/courses/soe-ycsalgorithms1-algorithms-design-and-analysis-part-1
Course Articulation Matrix
CO vs PO mapping
PO/ PO PO PO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PSO1 PSO2 PSO3
CO 10 11 12
CO1 1 3 3 3 2 1 1 1 2 2
CO2 1 3 3 3 2 1 1 2 3 2
CO3 1 3 3 3 2 1 1 1 1 1
CO4 1 3 3 3 2 1 1 2 2 2
CO5 1 3 3 3 2 1 1 2 1 2
Avg 1 3 3 3 2 1 1 2 2 2

L T P C Hours
22UCS405 OPERATING SYSTEMS LABORATORY
0 0 4 2 60
Prerequisite: 22UCS101 Programming In C
Course Objectives: The course aims to
 To learn Unix commands and shell programming
 To implement various CPU Scheduling Algorithms
 To implement Process Creation and Inter Process Communication
 To implement Deadlock Avoidance, Deadlock Detection Algorithms and Page Replacement
Algorithms.
 To implement File Organization and File Allocation Strategies
List of Experiments :
1. Simulation of UNIX commands and system calls
2. Shell programming- Simple functions, Basic tests, Loops, Patterns, Expansions, Substitutions.
3. Process Scheduling- FCFS, SJF, Priority and Round robin.
4. Synchronization using semaphores
5. Implementation of Interprocess Communication.
6. Implementation of memory management schemes –first fit, Best fit, worst fit and page replacement
algorithms.
7. Implementation of Deadlock Avoidance.
8. Implementation of Multi threaded and Multi process applications.
9. Implementation of the following Page Replacement Algorithms - a) FIFO b) LRU c) LFU
10. Implementation of disk scheduling
Total Hours : 60 Hours
Course Outcomes: At the end of the course, students will be able to
CO1: Compare the performance of various CPU Scheduling Algorithms
CO2: Implement Deadlock avoidance and Detection Algorithms
CO3: Implement Semaphores, create processes and implement IPC
CO4: Analyze the performance of the various Page Replacement Algorithms
CO5: Implement File Organization and File Allocation Strategies
Software and Hardware Requirements :
 C Compiler, Turbo C++ , Java
 Standalone desktops with C / C++ / Java / Equivalent complier 30 Nos. (or)Server with C /
C++ / Java / Equivalent complier supporting 30 terminals
Course Articulation Matrix
CO vs PO mapping
PO/ PO PO PO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PSO1 PSO2 PSO3
CO 10 11 12
CO1 3 2 - - - - - - - - - - 1 - -
CO2 3 2 2 - - - - - - - - - 1 - -
CO3 3 2 2 - - - - - - - - - 1 - -
CO4 3 2 2 - - - - - - - - - - - -
CO5 3 2 - - - - - - - - - - 1 - -
Avg 3 2 2 - - - - - - - - - 1 - -
1.Slight (Low) 2.Moderate (Medium) 3.Substantial (High)
 DATABASE MANAGEMENT SYSTEMS LABORATORY L T P C Hours
22UCS406
(Common to CSE,IT,AIDS and CSBS) 0 0 4 2 60
Prerequisite:
Course Objectives : The course aims to
 Learn data definition and data manipulation commands
 Be familiar with query language
 Comprehend function, triggers and procedures
 Learn the use of front end tool
 Be exposed to implementation of database applications
List Of Experiments:
1. Data Definition 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
3. Creation of Views, Sequences, Synonyms
4. High level programming language extensions (Control structures, Procedures and Functions).
5. Implicit and Explicit Cursors
6. Creation of database triggers
7. Implementation of Exception Handling
8. Designing Forms
9. Database Connectivity with Front End Tools
10. Mini project for real time applications.
Total Hours : 60 Hours
Course Outcome: At the end of the course, students will be able to
CO1: Use typical data definitions and manipulation commands
CO2: Design applications to test Nested and Join Queries
CO3: Implement simple applications that use Views
CO4: Implement applications that require a Front-end Tool
CO5:Critically analyze the use of Tables, Views, Functions and Procedures
Software Requirements :
 Front end: Python/JAVA
Back end: Oracle / SQL / MySQL/ PostGress / DB2 or Equivalent
Hardware Requirements:
Computers Required – 30 Nos. (Minimum Requirement: Pentium III or Pentium IV with 256 RAM and 40 GB
harddisk)
Course Articulation Matrix
CO vs PO mapping
PO/ PO PO PO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PSO1 PSO2 PSO3
CO 10 11 12
CO1 3 3 3 3 - - - - 1 - 3 1 2 3 2
CO2 2 2 3 2 - - - - 1 - 3 1 2 1 2
CO3 3 3 2 1 - - - - 1 - 1 1 2 3 3
CO4 1 3 3 3 - - - - 1 - 3 1 3 1 3
CO5 3 2 1 1 - - - - 2 - 3 2 3 1 2
Avg 2 3 2 2 - - - - 1 - 3 1 2 2 2
 L T P C Hours
22UOC201 BIOLOGY FOR ENGINEERS
1 0 0 1 15
Common to All Branches
Prerequisite(s): -
Course objectives:
● To understand the basics of biology.
● To understand the essential response of the living system
● To learn the engineering and biological relationship.
● To learn evolutionary theory and artificial neural systems and learning algorithms
● To understand collective systems such as ACO, PSO
Unit 1 BASICS OF BIOLOGY FOR ENGINEERING 3
Introduction to science of engineering, principles of biology, biological hierarchy, basics of genetics.
Unit 2 RESPONSES OF LIVING SYSTEMS 3
Biological unit and environment, activities through communication, emotional satisfaction and
intellectual stimulation.
Unit 3 UTILIZATION OF LIVING SYSTEMS 3
Basic system approach: Relationship between engineering and biology, bionics/ hybrid system,
biomimetics, solution to biological problems.
Unit 4 EVOLUTIONARY AND NEURAL SYSTEMS 3
Foundations of evolutionary theory, biological nervous systems, artificial neural networks –
overview of unsupervised learning, supervised learning and reinforcement learning algorithms-case
study.
Unit 5 BIO-INSPIRED ALGORITHM 3
Biological self-organization, Lagrangian algorithm, Particle Swarm Optimization (PSO), applications.
Course outcome(s): On completion of this course the student will be able to
CO1: Describe the basic characteristics and approaches in the field of biology
CO2: Understand the key function of Living system
CO3: Infer the relationship between biological problems with engineering solution.
CO4: Understand the evolution of life, artificial neural systems and learning algorithms
CO5: Explain the collective systems its applications.
Text Book(s):
[1]. Arthur J Jhonson, ‘Biology for Engineers’, CRC Press, 2ndedition, 2018
[2]. BibekanandMallick, ‘Biology for Engineers’, McGraw Hill,1st edition, 2021
Reference books:
[1]. Nancy Arana-Daniel, Carlos Lopez-Franco, Alma Y. Alanis, ‘Bio-inspired Algorithms for
Engineering’, Butterworth-Heinemann, 1st edition, 2018
[2]. S. Rajasekaran, G.A. VijayalakshmiPai, ‘Neural Networks, Fuzzy Systems and Evolutionary
Algorithms: Synthesis and Applications’, PHI Learning, 2nd edition, 2017
Web references:
● https://onlinecourses.nptel.ac.in/noc19_ge31/preview
Course Articulation Matrix
CO vs PO mapping
P
PO/ PO PO PO PO PO PO PO PO PO PO PO PSO PSO
O PSO3
CO 2 3 4 5 6 7 8 9 10 11 12 1 2
1
CO1 3 1 - - - - - - - - - 1 2 - -
CO2 2 1 - - - - - - - - - 1 2 - -
CO3 3 1 - - - - - - - - - 1 2 - -
CO4 2 1 - - - - - - - - - 1 2 - -
CO5 2 1 - - - - - - - - - 1 2 - -
Avg 2 1 - - - - - - - - - 1 2 - -
 INTEGRATED APTITUDE SKILLS-I Hours
22UIT403
(Common to All Branches) 45
Prerequisite: Nil
Unit –I: Number system 11
Introduction; Number system - Types of numbers, BODMAS rule, Approximation, Divisibility rule,
Unit digit, cyclic rule, squares and square root, Cubes and cube root, LCM & HCF, co-primes , Indices
and surds; Percentage – Percentage to fraction convertion, fraction to percentage convertion,
Percentage of a number, Salary increment and decrement, , Election based questions, Marks based
questions, Population based questions, Successive increase or decrease, Demand and Consumption,
Comparitive percentage and Misc; Syllogism: Introduction to statement and conclusion, Difference
between either and neither, Problem solving methods.
Unit- II: Average 10
Average: Introduction to averages, Average of consecutive numbers, Nature of average, Average on
random numbers, Men replacement, Values misread, Cricket based problems, Comparing two
averages; Ratio and Proportion: Difference between Ratio and Proportion, Types of Ratio,
Combining two ratios, Compendo Didendo, Comparing ratio with numbers, Coins, Income and
Expenditure, Partnership; Blood Relation: Introduction to relations, Family tree, Pointing to a
person/ photograph, Coded Problems.
Unit-III: Profit, Loss and Discount 11
Profit, Loss & Discount: Terms, Profit/Loss percentage, Same SP/CP when Profit/Loss changes,
Consecutive selling, Cheating merchant, Profit/Loss with MP& Discount; Seating Arrangement:
Linear, Parallel, Circular, Square; Puzzle: Floor based, 2 variables, 3 variables, Data based problems.
Unit-IV: SI & CI 7
SI & CI: Problems on SI & CI – Calculation on Monthly, Quarterly, Half yearly and annually,
Difference between SI & CI; Ages: Comparing ages in ratio, Statement based problems; Coding and
Decoding: Letter coding, Number coding, symbolic coding, Chinese coding and Alpha numeric
coding.
Unit –V: Time & work 6
Time and Work: Efficiency based problems, alternate days, Joining and leaving, Chain rule, Group
based problems, Work and wages; Pipes and cistern: Problems on Pipes and Pipes and cistern;
Number series: Missing number and Wrong number out.
Reference Books and Online platforms:
1.R.S Agarwal, Quantitative Aptitude for Competitive Examinations, S Chand Publication, 2022.
2.Dinesh Khattar, The pearson Guide Quantitative Aptitude for competitive Examinations, Pearson
Publication 3rd Edition, 2018.
3.https://www.indiabix.com/
4.https://prepinsta.com/
5.https://www.fresherslive.com/
 ANNA UNIVERSITY, CHENNAI
NON - AUTONOMOUS AFFILIATED COLLEGES
REGULATIONS 2021
CHOICE BASED CREDIT SYSTEM

B.E. COMPUTER SCIENCE AND ENGINEERING

I. PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

Graduates can
 Apply their technical competence in computer science to solve real world problems, with
technical and people leadership.
 Conduct cutting edge research and develop solutions on problems of social relevance.
 Work in a business environment, exhibiting team skills, work ethics, adaptability and lifelong
learning.

II. PROGRAM OUTCOMES (POs)

1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering

fundamentals, and an engineering specialization to the solution of complex engineering
problems.
2 Problem analysis: Identify, formulate, review research literature, and analyze complex
engineering problems reaching substantiated conclusions using first principles of
mathematics, natural sciences, and engineering sciences.
3 Design/development of solutions: Design solutions for complex engineering problems and
design system components or processes that meet the specified needs with appropriate
consideration for the public health and safety, and the cultural, societal, and environmental
considerations.
4 Conduct investigations of complex problems: Use research-based knowledge and
research methods including design of experiments, analysis and interpretation of data, and
synthesis of the information to provide valid conclusions.
5 Modern tool usage: Create, select, and apply appropriate techniques, resources, and
modern engineering and IT tools including prediction and modeling to complex engineering
activities with an understanding of the limitations.
6 The engineer and society: Apply reasoning informed by the contextual knowledge to
assess societal, health, safety, legal and cultural issues and the consequent responsibilities
relevant to the professional engineering practice.
7 Environment and sustainability: Understand the impact of the professional engineering
solutions in societal and environmental contexts, and demonstrate the knowledge of, and need
for sustainable development.
8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and
norms of the engineering practice.
9 Individual and team work: Function effectively as an individual, and as a member or
leader in diverse teams, and in multidisciplinary settings.
10 Communication: Communicate effectively on complex engineering activities with the

1
 engineering community and with society at large, such as, being able to comprehend and write
effective reports and design documentation, make effective presentations, and give and receive
clear instructions.
11 Project management and finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one’s own work, as a member and
leader in a team, to manage projects and in multidisciplinary environments.

12 Life-long learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context of technological change.

III. PROGRAM SPECIFIC OUTCOMES (PSOs)

The Students will be able to

 Exhibit design and programming skills to build and automate business solutions using cutting
edge technologies.
 Strong theoretical foundation leading to excellence and excitement towards research, to
provide elegant solutions to complex problems.
 Ability to work effectively with various engineering fields as a team to design, build and
develop system applications.

2
 Mapping of Course Outcome and Programme Outcome

Year Sem Course name PO PSO

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
Induction Programme
I I
Professional English - I 1.6 2.2 1.8 2.2 1.5 3 3 3 1.6 3 3 3 - - -
Matrices and Calculus 3 3 1 1 0 0 0 0 2 0 2 3 - - -
Engineering Physics 3 3 1.6 1.2 1.8 1 - - - - - 1 - - -
Engineering Chemistry 2.8 1.3 1.6 1 - 1.5 1.8 - - - 1.5 - - -
Problem Solving and
2 3 3 3 2 - - - - - 2 2 3 3
Python Programming
தமிழர் மரபு
/Heritage of Tamils
Problem Solving and
Python Programming 2 3 3 3 2 - - - - - 2 2 3 3 -
Laboratory
Physics and Chemistry 3 2.4 2.6 1 1
Laboratory
2.6 1.3 1.6 1 1 1.4 1.8 - - - - 1.3 - - -

English Laboratory $ 3 3 3 3 1 3 3 3 3 3 3 3 - - -

II Professional English - II 3 3 3 3 2.75 3 3 3 2.2 3 3 3 - - -

Statistics and
3 3 1 1 1 0 0 0 2 0 2 3 - - -
Numerical Methods
Physics for Information
3 1.3 2 1.3 2.3 1 1.3 - - - - 2 - - -
Science
Basic Electrical and 2 1.8 1 - - - - 1 - - - 2 - - 1
Electronics Engineering
Engineering Graphics 3 1 2 - 2 - - - - 3 - 2 2 2 -

Programming in C 2 2 2 1 2 1 1 1 2 - 3 2 2 2 -

தமிழரும்
ததொழில் நுட்பமும்
/Tamils and
Technology
Engineering Practices 3 2 - - 1 1 1 - - - - 2 2 1 1
Laboratory
Programming in C 2 2 3 2 1 2 - - 2 1 2 2 2 2
Laboratory
Communication
2.4 2.8 3 3 1.8 3 3 3 3 3 3 3 - - -
Laboratory / Foreign
$
Language
1 3 2 1 - - - - - 1 - - - - -
II III Discrete Mathematics
Digital Principles and
3 3 3 3 1.8 1.6 1 1 1 1 1.6 2.6 1.4 2.6 1.6
Computer Organization
Foundations of Data
2 2 1 2 2 1 1 - 1 1 1 2 2 2 2
Science
Data Structures 2 2 1 2 2 1 1 - 1 1 1 2 2 2 2

3
 Object Oriented
2 1 2 2 2 - - - 2 2 1 2 3 2 2
Programming
Data Structures
2 2 2 1 2 - - - 2 2 2 2 2 2 3
Laboratory
Object Oriented
Programming 2 2 2 2 2 - - - 2 2 2 2 2 2 2
Laboratory
Data Science
2 2 2 2 1 - - - 2 2 2 2 2 3 2
Laboratory
Professional
Development$
IV Theory of Computation 2 2 2 2 1 - - - 1 2 2 2 2 2 2
Artificial Intelligence
2 1 2 2 1 - - - 2 2 2 3 2 2 2
and Machine Learning
Database Management
2 2 3 2 1 - - - 2 2 2 2 2 2 3
Systems
Algorithms 2.67 1.8 3 1 1.33 1 1 1
Introduction to
2 2 2 2 1 - - - 2 2 2 2 1 2 2
Operating Systems
Environmental
Sciences and 2.8 1.8 1 1 - 2.2 2.4 - - - - 1.8 - - -
Sustainability
Operating Systems
2 2 2 2 2 - - - 2 2 2 2 2 2 2
Laboratory
Database Management
2 3 2 2 1 - - - 2 1 3 2 2 2 2
Systems Laboratory
Computer Networks - 1 - - 1 - - - - 1 - - - 1 1
III V
Compiler Design 2.8
3.00 2.60 2.20 2.00 - - - 2.60 2.00 1.60 2.40 1.80 1.80 2.00
0
Cryptography and
3 2.6 2.6 2.6 2.8 - - - 2 - - 1.2 2.8 2.8 3
Cyber Security
Distributed Computing 1.8 2.4 1.8 2.4 2 - - - 2.6 2.2 2.2 1.6 2 1.8 1.6
Object Oriented 2 2 1 2 2 - - - - 1 1 2 2 2 1
VI
Software Engineering
Embedded Systems
2.6 2 3 2.4 1.5 - - - 1 2.2 2.2 2.4 2.2 1.6 2.6
and IoT
Human Values and
IV VII Ethics

Summer internship
Project Work /
VIII Internship
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

4
 ANNA UNIVERSITY, CHENNAI
NON- AUTONOMOUS AFFILIATED COLLEGES
REGULATIONS 2021
B. E. COMPUTER SCIENCE AND ENGINEERING
CHOICE BASED CREDIT SYSTEM
CURRICULUM AND SYLLABI FOR SEMESTERS I TO VIII
SEMESTER I
PERIODS PER TOTAL
S. COURSE CATE-
COURSE TITLE WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. IP3151 Induction Programme - - - - - 0
THEORY
2. HS3152 Professional English - I HSMC 3 0 0 3 3
3. MA3151 Matrices and Calculus BSC 3 1 0 4 4
4. PH3151 Engineering Physics BSC 3 0 0 3 3
5. CY3151 Engineering Chemistry BSC 3 0 0 3 3
Problem Solving and Python
6. GE3151 ESC 3 0 0 3 3
Programming
7. GE3152 தமிழர் மரபு /Heritage of Tamils HSMC 1 0 0 1 1
PRACTICALS
8. Problem Solving and Python
GE3171 ESC 0 0 4 4 2
Programming Laboratory
9. BS3171 Physics and Chemistry Laboratory BSC 0 0 4 4 2
$
10. GE3172 English Laboratory EEC 0 0 2 2 1
TOTAL 16 1 10 27 22
$ Skill Based Course
SEMESTER II
PERIODS PER TOTAL
S. COURSE CATE-
COURSE TITLE WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
THEORY
1. HS3252 Professional English - II HSMC 2 0 0 2 2
2. MA3251 Statistics and Numerical Methods BSC 3 1 0 4 4
3. PH3256 Physics for Information Science BSC 3 0 0 3 3
Basic Electrical and Electronics
4. BE3251 ESC 3 0 0 3 3
Engineering
5. GE3251 Engineering Graphics ESC 2 0 4 6 4
6. CS3251 Programming in C PCC 3 0 0 3 3
தமிழரும் ததொழில் நுட்பமும் HSMC 1 0 0 1 1
7. GE3252
/Tamils and Technology
8. NCC Credit Course Level 1# - 2 0 0 2 2#
PRACTICALS
9. GE3271 Engineering Practices Laboratory ESC 0 0 4 4 2
10. CS3271 Programming in C Laboratory PCC 0 0 4 4 2
Communication Laboratory / Foreign
11. GE3272 EEC 0 0 4 4 2
Language $
TOTAL 17 1 16 34 26
# NCC Credit Course level 1 is offered for NCC students only. The grades earned by the students will be recorded
in the Mark Sheet, however the same shall not be considered for the computation of CGPA.
$ Skill Based Course

5
 SEMESTER III
PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
THEORY
1. MA3354 Discrete Mathematics BSC 3 1 0 4 4
2. Digital Principles and
CS3351 ESC 3 0 2 5 4
Computer Organization
3. Foundations of Data
CS3352 PCC 3 0 0 3 3
Science
4. CS3301 Data Structures PCC 3 0 0 3 3
5. Object Oriented
CS3391 PCC 3 0 0 3 3
Programming
PRACTICALS
6. CS3311 Data Structures Laboratory PCC 0 0 3 3 1.5
7. Object Oriented 0 0 3 3
CS3381 PCC 1.5
Programming Laboratory
8. CS3361 Data Science Laboratory PCC 0 0 4 4 2
$
9. GE3361 Professional Development EEC 0 0 2 2 1
TOTAL 15 1 14 30 23
$
Skill Based Course
SEMESTER IV
PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
THEORY
1. CS3452 Theory of Computation PCC 3 0 0 3 3
2. Artificial Intelligence and
CS3491 PCC 3 0 2 5 4
Machine Learning
3. Database Management
CS3492 PCC 3 0 0 3 3
Systems
4. CS3401 Algorithms PCC 3 0 2 5 4
5. Introduction to Operating
CS3451 PCC 3 0 0 3 3
Systems
6. Environmental Sciences and
GE3451 BSC 2 0 0 2 2
Sustainability
7. NCC Credit Course Level 2# 3 0 0 3 3#
PRACTICALS
8. CS3461 Operating Systems Laboratory PCC 0 0 3 3 1.5
9. Database Management
CS3481 PCC 0 0 3 3 1.5
Systems Laboratory
TOTAL 20 0 10 30 22
#
NCC Credit Course level 2 is offered for NCC students only. The grades earned by the
students will be recorded in the Mark Sheet, however the same shall not be considered for
the computation of CGPA.

6
 SEMESTER V
PERIODS PER TOTAL
S. COURSE CATE
COURSE TITLE WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
THEORY
1. CS3591 Computer Networks PCC 3 0 2 5 4
2. CS3501 Compiler Design PCC 3 0 2 5 4
3. Cryptography and Cyber
CB3491 PCC 3 0 0 3 3
Security
4. CS3551 Distributed Computing PCC 3 0 0 3 3
5. Professional Elective I PEC - - - - 3
6. Professional Elective II PEC - - - - 3
7. Mandatory Course-I& MC 3 0 0 3 0
TOTAL - - - - 20
&
Mandatory Course-I is a Non-credit Course (Student shall select one course from the list
given under Mandatory Course-I)

SEMESTER VI
PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
THEORY
1. Object Oriented Software
CCS356 PCC 3 0 2 5 4
Engineering
2. CS3691 Embedded Systems and IoT PCC 3 0 2 5 4
3. Open Elective – I* OEC 3 0 0 3 3
4. Professional Elective III PEC - - - - 3
5. Professional Elective IV PEC - - - - 3
6. Professional Elective V PEC - - - - 3
7. Professional Elective VI PEC - - - - 3
8. Mandatory Course-II & MC 3 0 0 3 0
9. NCC Credit Course Level 3# 3 0 0 3 3#
TOTAL - - - - 23
*Open Elective – I Shall be chosen from the list of open electives offered by other
Programmes

&
Mandatory Course-II is a Non-credit Course (Student shall select one course from the list
given under Mandatory Course-II)

#
NCC Credit Course level 3 is offered for NCC students only. The grades earned by the
students will be recorded in the Mark Sheet, however the same shall not be considered for
the computation of CGPA

7
 SEMESTER VII / VIII*
PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
THEORY
1. GE3791 Human Values and Ethics HSMC 2 0 0 2 2
2. Elective - Management# HSMC 3 0 0 3 3
3. Open Elective – II** OEC 3 0 0 3 3
4. Open Elective – III** OEC 3 0 0 3 3
5. Open Elective – IV** OEC 3 0 0 3 3
PRACTICALS
6. CS3711 Summer internship EEC 0 0 0 0 2
TOTAL 14 0 0 14 16
*If students undergo internship in Semester VII, then the courses offered during semester VII
will be offered during semester VIII.
** Open Elective II - IV (Shall be chosen from the list of open electives offered by other
Programmes).
#
Elective - Management shall be chosen from the Elective Management courses.

SEMESTER VIII /VII*

S. PERIODS TOTAL
COURSE CATE
NO COURSE TITLE PER WEEK CONTACT CREDITS
CODE GORY
. L T P PERIODS
PRACTICALS
1. CS3811 Project Work/Internship EEC 0 0 20 20 10
TOTAL 0 0 20 20 10
*If students undergo internship in Semester VII, then the courses offered during semester VII
will be offered during semester VIII.
TOTAL CREDITS: 162

ELECTIVE – MANAGEMENT COURSES

PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PERWEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. GE3751 Principles of Management HSMC 3 0 0 3 3
2. GE3752 Total Quality Management HSMC 3 0 0 3 3
3. Engineering Economics and
GE3753 HSMC 3 0 0 3 3
Financial Accounting
4. Human Resource
GE3754 HSMC 3 0 0 3 3
Management
5. GE3755 Knowledge Management HSMC 3 0 0 3 3
6. GE3792 Industrial Management HSMC 3 0 0 3 3

8
 MANDATORY COURSES I

PERIODS TOTAL
S. CATE
COURSE COURSE TITLE PER WEEK CONTACT CREDITS
NO. GORY
CODE L T P PERIODS
1. Introduction to Women
MX3081 MC 3 0 0 3 0
and Gender Studies
2. MX3082 Elements of Literature MC 3 0 0 3 0
3. MX3083 Film Appreciation MC 3 0 0 3 0
4. Disaster Risk Reduction
MX3084 MC 3 0 0 3 0
and Management

MANDATORY COURSES II
PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. Well Being with
Traditional Practices -
MX3085 MC 3 0 0 3 0
Yoga, Ayurveda and
Siddha
2. History of Science and
MX3086 MC 3 0 0 3 0
Technology in India
3. Political and Economic
MX3087 Thought for a Humane MC 3 0 0 3 0
Society
4. State, Nation Building
MX3088 MC 3 0 0 3 0
and Politics in India
5. MX3089 Industrial Safety MC 3 0 0 3 0

9
 PROFESSIONAL ELECTIVE COURSES: VERTICALS

Vertical III Vertical VII

Vertical II Vertical IV Vertical VI
Vertical I Cloud Computing and Vertical V Artificial
Full Stack Cyber Security and Emerging
Data Science Data Center Creative Media Intelligence and
Development Data Privacy Technologies
Technologies Machine Learning
Augmented Augmented
Exploratory Data Knowledge
Web Technologies Cloud Computing Ethical Hacking Reality/Virtual Reality/Virtual
Analysis Engineering
Reality Reality
Recommender Digital and Mobile Multimedia and Robotic Process
App Development Virtualization Soft Computing
Systems Forensics Animation Automation
Cloud Services
Neural Networks Cloud Services Social Network Video Creation Neural Networks Neural Networks
Management
and Deep Learning Management Security and Editing and Deep Learning and Deep Learning

Text and Text and

UI and UX Design Data Warehousing Modern Cryptography UI and UX Design Cyber security
Speech Analysis Speech Analysis
Software Testing Engineering Secure Quantum Optimization
Business Analytics Storage Technologies Digital marketing
and Automation Software Systems Computing Techniques
Cryptocurrency and Cryptocurrency and
Image and Video Web Application Software Defined
Blockchain Visual Effects Blockchain Game Theory
Analytics Security Networks
Technologies Technologies
Game Game
Computer Vision DevOps Stream Processing Network Security Cognitive Science
Development Development
Principles of Multimedia Data
Security and Privacy in Security and Privacy in 3D Printing and
Big Data Analytics Programming Compression and Ethics And AI
Cloud Cloud Design
Languages Storage
Registration of Professional Elective Courses from Verticals:
Professional Elective Courses will be registered in Semesters V and VI. These courses are listed in groups called verticals that represent a particular area
of specialisation / diversified group. Students are permitted to choose all the Professional Electives from a particular vertical or from different
verticals. Further, only one Professional Elective course shall be chosen in a semester horizontally (row-wise). However, two courses are permitted from
the same row, provided one course is enrolled in Semester V and another in semester VI.
The registration of courses for B.E./B.Tech (Honours) or Minor degree shall be done from Semester V to VIII. The procedure for registration of courses
explained above shall be followed for the courses of B.E/B.Tech (Honours) or Minor degree also. For more details on B.E./B.Tech (Honours) or Minor
degree refer to the Regulations 2021, Clause 4.10 (Amendments).

10
 PROFESSIONAL ELECTIVE COURSES: VERTICALS

VERTICAL 1: DATA SCIENCE

PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. CCS346 Exploratory Data Analysis PEC 2 0 2 4 3
2. CCS360 Recommender Systems PEC 2 0 2 4 3
3. Neural Networks and Deep
CCS355 PEC 2 0 2 4 3
Learning
4. CCS369 Text and Speech Analysis PEC 2 0 2 4 3
5. CCW331 Business Analytics PEC 2 0 2 4 3
6. CCS349 Image and Video Analytics PEC 2 0 2 4 3
7. CCS338 Computer Vision PEC 2 0 2 4 3
8. CCS334 Big Data Analytics PEC 2 0 2 4 3

VERTICAL 2: FULL STACK DEVELOPMENT

PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. CCS375 Web Technologies PEC 2 0 2 4 3
2. CCS332 App Development PEC 2 0 2 4 3
3. Cloud Services
CCS336 PEC 2 0 2 4 3
Management
4. CCS370 UI and UX Design PEC 2 0 2 4 3
5. Software Testing and
CCS366 PEC 2 0 2 4 3
Automation
6. CCS374 Web Application Security PEC 2 0 2 4 3
7. CCS342 DevOps PEC 2 0 2 4 3
8. Principles of Programming
CCS358 PEC 3 0 0 3 3
Languages

11
 VERTICAL 3: CLOUD COMPUTING AND DATA CENTER TECHNOLOGIES

PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. CCS335 Cloud Computing PEC 2 0 2 4 3
2. CCS372 Virtualization PEC 2 0 2 4 3
3. Cloud Services
CCS336 PEC 2 0 2 4 3
Management
4. CCS341 Data Warehousing PEC 2 0 2 4 3
5. CCS367 Storage Technologies PEC 3 0 0 3 3
6. CCS365 Software Defined Networks PEC 2 0 2 4 3
7. CCS368 Stream Processing PEC 2 0 2 4 3
8. Security and Privacy in
CCS362 PEC 2 0 2 4 3
Cloud

VERTICAL 4: CYBER SECURITY AND DATA PRIVACY

PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. CCS344 Ethical Hacking PEC 2 0 2 4 3
2. Digital and Mobile
CCS343 PEC 2 0 2 4 3
Forensics
3. CCS363 Social Network Security PEC 2 0 2 4 3
4. CCS351 Modern Cryptography PEC 2 0 2 4 3
5. Engineering Secure
CB3591 PEC 2 0 2 4 3
Software Systems
6. Cryptocurrency and
CCS339 PEC 2 0 2 4 3
Blockchain Technologies
7. CCS354 Network Security PEC 2 0 2 4 3
8. Security and Privacy in
CCS362 PEC 2 0 2 4 3
Cloud

12
 VERTICAL 5: CREATIVE MEDIA

PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. Augmented Reality/Virtual
CCS333 PEC 2 0 2 4 3
Reality
2. CCS352 Multimedia and Animation PEC 2 0 2 4 3
3. CCS371 Video Creation and Editing PEC 2 0 2 4 3
4. CCS370 UI and UX Design PEC 2 0 2 4 3
5. CCW332 Digital marketing PEC 2 0 2 4 3
6. CCS373 Visual Effects PEC 2 0 2 4 3
7. CCS347 Game Development PEC 2 0 2 4 3
8. Multimedia Data
CCS353 PEC 2 0 2 4 3
Compression and Storage

VERTICAL 6: EMERGING TECHNOLOGIES

PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. Augmented Reality/Virtual
CCS333 PEC 2 0 2 4 3
Reality
2. Robotic Process
CCS361 PEC 2 0 2 4 3
Automation
3. Neural Networks and Deep
CCS355 PEC 2 0 2 4 3
Learning
4. CCS340 Cyber security PEC 2 0 2 4 3
5. CCS359 Quantum Computing PEC 2 0 2 4 3
6. Cryptocurrency and
CCS339 PEC 2 0 2 4 3
Blockchain Technologies
7. CCS347 Game Development PEC 2 0 2 4 3
8. CCS331 3D Printing and Design PEC 2 0 2 4 3

13
 VERTICAL 7: ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

PERIODS TOTAL
SL. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. CCS350 Knowledge Engineering PEC 2 0 2 4 3
2. CCS364 Soft Computing PEC 2 0 2 4 3
3. Neural Networks and Deep
CCS355 PEC 2 0 2 4 3
Learning
4. CCS369 Text and Speech Analysis PEC 2 0 2 4 3
5. CCS357 Optimization Techniques PEC 2 0 2 4 3
6. CCS348 Game Theory PEC 2 0 2 4 3
7. CCS337 Cognitive Science PEC 2 0 2 4 3
8. CCS345 Ethics And AI PEC 2 0 2 4 3

OPEN ELECTIVES
(Students shall choose the open elective courses, such that the course contents are not
similar to any other course contents/title under other course categories).

OPEN ELECTIVES – I
PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. OAS351 Space Science OEC 3 0 0 3 3
2. Introduction to Industrial
OIE351 OEC 3 0 0 3 3
Engineering
3. OBT351 Food, Nutrition and Health OEC 3 0 0 3 3
4. Environment and Social
OCE351 OEC 3 0 0 3 3
Impact Assessment
5. Renewable Energy
OEE351 OEC 3 0 0 3 3
System
6. Introduction to Industrial
OEI351 Instrumentation and OEC 3 0 0 3 3
Control
7. OMA351 Graph Theory OEC 3 0 0 3 3

14
 OPEN ELECTIVES – II

COURSE PERIODS TOTAL

SL. CATE
CODE COURSE TITLE PER WEEK CONTACT CREDITS
NO. GORY
L T P PERIODS
1. Resource Management
OIE352 OEC 3 0 0 3 3
Techniques
2. OMG351 Fintech Regulation OEC 3 0 0 3 3
3. OFD351 Holistic Nutrition OEC 3 0 0 3 3
4. AI3021 IT in Agricultural System OEC 3 0 0 3 3
5. Introduction to Control
OEI352 OEC 3 0 0 3 3
Engineering
6. Pharmaceutical
OPY351 OEC 3 0 0 3 3
Nanotechnology
7. OAE351 Aviation Management OEC 3 0 0 3 3

OPEN ELECTIVES – III

COURSE PERIODS TOTAL

SL. CATE
CODE COURSE TITLE PER WEEK CONTACT CREDITS
NO. GORY
L T P PERIODS
1. English for Competitive
OHS351 OEC 3 0 0 3 3
Examinations
2. NGOs and Sustainable
OMG352 OEC 3 0 0 3 3
Development
3. Democracy and Good
OMG353 OEC 3 0 0 3 3
Governance
4. Renewable Energy
CME365 OEC 3 0 0 3 3
Technologies
5. OME354 Applied Design Thinking OEC 3 0 0 3 3
6. MF3003 Reverse Engineering OEC 3 0 0 3 3
7. OPR351 Sustainable Manufacturing OEC 3 0 0 3 3
8. AU3791 Electric and Hybrid Vehicles OEC 3 0 0 3 3
9. OAS352 Space Engineering OEC 3 0 0 3 3
10. OIM351 Industrial Management OEC 3 0 0 3 3
11. OIE354 Quality Engineering OEC 3 0 0 3 3
12. OSF351 Fire Safety Engineering OEC 3 0 0 3 3
13. Introduction to Non-destructive
OML351 OEC 3 0 0 3 3
Testing
14. OMR351 Mechatronics OEC 3 0 0 3 3
15. ORA351 Foundation of Robotics OEC 3 0 0 3 3
16. Fundamentals of Aeronautical
OAE352 OEC 3 0 0 3 3
Engineering
17. OGI351 Remote Sensing Concepts OEC 3 0 0 3 3
15
18. OAI351 Urban Agriculture OEC 3 0 0 3 3
19. Drinking Water Supply and
OEN351 OEC 3 0 0 3 3
Treatment
20. OEE352 Electric Vehicle Technology OEC 3 0 0 3 3
21. Introduction to PLC
OEI353 OEC 3 0 0 3 3
Programming
22. OCH351 Nano Technology OEC 3 0 0 3 3
23. OCH352 Functional Materials OEC 3 0 0 3 3
24. OFD352 Traditional Indian Foods OEC 3 0 0 3 3
25. OFD353 Introduction to food processing OEC 3 0 0 3 3
26. OPY352 IPR for Pharma Industry OEC 3 0 0 3 3
27. OTT351 Basics of Textile Finishing OEC 3 0 0 3 3
28. Industrial Engineering for
OTT352 OEC 3 0 0 3 3
Garment Industry
29. OTT353 Basics of Textile Manufacture OEC 3 0 0 3 3
30. Introduction to Petroleum
OPE351 OEC 3 0 0 3 3
Refining and Petrochemicals
31. Energy Conservation and
CPE334 OEC 3 0 0 3 3
Management
32. OPT351 Basics of Plastics Processing OEC 3 0 0 3 3
33. OEC351 Signals and Systems OEC 3 0 0 3 3
34. Fundamentals of Electronic
OEC352 OEC 3 0 0 3 3
Devices and Circuits
35. Foundation Skills in Integrated
CBM348 OEC 3 0 0 3 3
Product Development
36. CBM333 Assistive Technology OEC 3 0 0 3 3
37. OMA352 Operations Research OEC 3 0 0 3 3
38. OMA353 Algebra and Number Theory OEC 3 0 0 3 3
39. OMA354 Linear Algebra OEC 3 0 0 3 3
40. Lean Concepts, Tools and
OCE353 OEC 3 0 0 3 3
Practices
41. Basics of Microbial
OBT352 OEC 3 0 0 3 3
Technology
42. OBT353 Basics of Biomolecules OEC 3 0 0 3 3
43. Fundamentals of Cell and
OBT354 OEC 3 0 0 3 3
Molecular Biology

16
 OPEN ELECTIVES – IV
COURSE PERIODS TOTAL
SL. CATE
CODE COURSE TITLE PER WEEK CONTACT CREDITS
NO. GORY
L T P PERIODS
1. OHS352 Project Report Writing OEC 3 0 0 3 3
2. Advanced Numerical
OMA355 OEC 3 0 0 3 3
Methods
3. OMA356 Random Processes OEC 3 0 0 3 3
4. Queuing and Reliability
OMA357 OEC 3 0 0 3 3
Modelling
5. Production and Operations
OMG354 Management for OEC 3 0 0 3 3
Entrepreneurs
6. OMG355 Multivariate Data Analysis OEC 3 0 0 3 3
7. OME352 Additive Manufacturing OEC 3 0 0 3 3
8. CME343 New Product Development OEC 3 0 0 3 3
9. Industrial Design & Rapid
OME355 OEC 3 0 0 3 3
Prototyping Techniques
10. Micro and Precision
MF3010 OEC 3 0 0 3 3
Engineering
11. Cost Management of
OMF354 OEC 3 0 0 3 3
Engineering Projects
12. Batteries and Management
AU3002 OEC 3 0 0 3 3
system
13. AU3008 Sensors and Actuators OEC 3 0 0 3 3
14. OAS353 Space Vehicles OEC 3 0 0 3 3
15. OIM352 Management Science OEC 3 0 0 3 3
16. Production Planning and
OIM353 OEC 3 0 0 3 3
Control
17. OIE353 Operations Management OEC 3 0 0 3 3
18. OSF352 Industrial Hygiene OEC 3 0 0 3 3
19. OSF353 Chemical Process Safety OEC 3 0 0 3 3
20. Electrical, Electronic and
OML352 OEC 3 0 0 3 3
Magnetic materials
21. Nanomaterials and
OML353 OEC 3 0 0 3 3
Applications
22. OMR352 Hydraulics and Pneumatics OEC 3 0 0 3 3
23. OMR353 Sensors OEC 3 0 0 3 3
24. ORA352 Concepts in Mobile Robots OEC 3 0 0 3 3
25. MV3501 Marine Propulsion OEC 3 0 0 3 3
26. OMV351 Marine Merchant Vessels OEC 3 0 0 3 3
27. Elements of Marine
OMV352 OEC 3 0 0 3 3
Engineering
28. CRA332 Drone Technologies OEC 3 0 0 3 3
17
29. Geographical Information
OGI352 OEC 3 0 0 3 3
System
30. Agriculture Entrepreneurship
OAI352 OEC 3 0 0 3 3
Development
31. OEN352 Biodiversity Conservation OEC 3 0 0 3 3
32. Introduction to control
OEE353 OEC 3 0 0 3 3
systems
33. Introduction to Industrial
OEI354 OEC 3 0 0 3 3
Automation Systems
34. OCH353 Energy Technology OEC 3 0 0 3 3
35. OCH354 Surface Science OEC 3 0 0 3 3
36. Fundamentals of Food
OFD354 OEC 3 0 0 3 3
Engineering
37. Food safety and Quality
OFD355 OEC 3 0 0 3 3
Regulations
38. OPY353 Nutraceuticals OEC 3 0 0 3 3
39. OTT354 Basics of Dyeing and Printing OEC 3 0 0 3 3
40. FT3201 Fibre Science OEC 3 0 0 3 3
41. Garment Manufacturing
OTT355 OEC 3 0 0 3 3
Technology
42. OPE353 Industrial safety OEC 3 0 0 3 3
43. Unit Operations in Petro
OPE354 OEC 3 0 0 3 3
Chemical Industries
44. Plastic Materials for
OPT352 OEC 3 0 0 3 3
Engineers
45. Properties and Testing of
OPT353 OEC 3 0 0 3 3
Plastics
46. OEC353 VLSI Design OEC 3 0 0 3 3
47. CBM370 Wearable Devices OEC 3 0 0 3 3
48. CBM356 Medical Informatics OEC 3 0 0 3 3
49. Basics of Integrated Water
OCE354 OEC 3 0 0 3 3
Resources Management
50. Biotechnology for Waste
OBT355 OEC 3 0 0 3 3
Management
51. OBT356 Lifestyle Diseases OEC 3 0 0 3 3
52. OBT357 Biotechnology in Health Care OEC 3 0 0 3 3

18
 SUMMARY

Name of the Programme: B.E. Computer Science and Engineering

Subject Area Credits per Semester Total

S.No
Credits
I II III IV V VI VII/VIII VIII/VII
1 HSMC 4 3 5 12
2 BSC 12 7 4 2 25
3 ESC 5 9 4 18
4 PCC 5 14 20 14 8 61
5 PEC 6 12 18
6 OEC 3 9 12
7 EEC 1 2 1 2 10 16

Non-Credit
8 √ √
/(Mandatory)

Total 22 26 23 22 20 23 16 10 162

ENROLLMENT FOR B.E. / B. TECH. (HONOURS) / MINOR DEGREE (OPTIONAL)

A student can also optionally register for additional courses (18 credits) and become eligible for the
award of B.E. / B. Tech. (Honours) or Minor Degree.

For B.E. / B. Tech. (Honours), a student shall register for the additional courses (18 credits) from
semester V onwards. These courses shall be from the same vertical or a combination of different
verticals of the same programme of study only.

For minor degree, a student shall register for the additional courses (18 credits) from semester V
onwards. All these courses have to be in a particular vertical from any one of the other programmes,
Moreover, for minor degree the student can register for courses from any one of the following verticals
also.
Complete details are available in clause 4.10 (Amendments) of Regulations 2021.

19
 VERTICALS FOR MINOR DEGREE
(In addition to all the verticals of other programmes)

Vertical I Vertical III Vertical IV Vertical V

Vertical II
Fintech and Public Business Data Environment and
Entrepreneurship
Block Chain Administration Analytics Sustainability
Financial Sustainable
Foundations of Principles of Public Statistics for
Management infrastructure
Entrepreneurship Administration Management
Development
Team Building & Datamining for Sustainable
Fundamentals
Leadership Constitution of Business Agriculture and
of Investment
Management for India Intelligence Environmental
Business Management
Banking, Human
Public Personnel Sustainable Bio
Financial Creativity & Innovation Resource
Administration Materials
Services and in Entrepreneurship Analytics
Insurance
Introduction to Marketing and
Principles of Marketing Administrative Materials for
Blockchain Social Media
Management for Theories Energy
and its Web Analytics
Business Sustainability
Applications
Fintech Human Resource Operation and
Indian
Personal Management for Supply Chain Green Technology
Administrative
Finance and Entrepreneurs Analytics
System
Payments
Introduction to Financing New Public Policy Financial Environmental
Fintech Business Ventures Administration Analytics Quality Monitoring
and Analysis
Integrated Energy
Planning for
- - - -
Sustainable
Development
Energy Efficiency
- - - - for Sustainable
Development

20
 (choice of courses for Minor degree is to be made from any one vertical of other
programmes or from anyone of the following verticals)

VERTICAL 1: FINTECH AND BLOCK CHAIN

PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. CMG331 Financial Management PEC 3 0 0 3 3
2. Fundamentals of
CMG332 PEC 3 0 0 3 3
Investment
3. Banking, Financial
CMG333 PEC 3 0 0 3 3
Services and Insurance
4. Introduction to
CMG334 Blockchain and its PEC 3 0 0 3 3
Applications
5. Fintech Personal
CMG335 PEC 3 0 0 3 3
Finance and Payments
6. CMG336 Introduction to Fintech PEC 3 0 0 3 3

VERTICAL 2: ENTREPRENEURSHIP

PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. Foundations of
CMG337 PEC 3 0 0 3 3
Entrepreneurship
2. Team Building &
CMG338 Leadership Management PEC 3 0 0 3 3
for Business
3. Creativity & Innovation in
CMG339 PEC 3 0 0 3 3
Entrepreneurship
4. Principles of Marketing
CMG340 Management For PEC 3 0 0 3 3
Business
5. Human Resource
CMG341 Management for PEC 3 0 0 3 3
Entrepreneurs
6. Financing New
CMG342 PEC 3 0 0 3 3
Business Ventures

21
 VERTICAL 3: PUBLIC ADMINISTRATION

PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. Principles of Public
CMG343 PEC 3 0 0 3 3
Administration
2. CMG344 Constitution of India PEC 3 0 0 3 3
3. Public Personnel
CMG345 PEC 3 0 0 3 3
Administration
4. CMG346 Administrative Theories PEC 3 0 0 3 3
5. Indian Administrative
CMG347 PEC 3 0 0 3 3
System
6. Public Policy
CMG348 PEC 3 0 0 3 3
Administration

VERTICAL 4: BUSINESS DATA ANALYTICS

PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. Statistics for
CMG349 PEC 3 0 0 3 3
Management
2. Datamining For
CMG350 PEC 3 0 0 3 3
Business Intelligence
3. Human Resource
CMG351 PEC 3 0 0 3 3
Analytics
4. Marketing and Social
CMG352 PEC 3 0 0 3 3
Media Web Analytics
5. Operation and Supply
CMG353 PEC 3 0 0 3 3
Chain Analytics
6. CMG354 Financial Analytics PEC 3 0 0 3 3

22
 VERTICAL 5: ENVIRONMENT AND SUSTAINABILITY

PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. Sustainable infrastructure
CES331 PEC 3 0 0 3 3
Development
2. Sustainable Agriculture
CES332 and Environmental PEC 3 0 0 3 3
Management
3. CES333 Sustainable Bio Materials PEC 3 0 0 3 3
4. Materials for Energy
CES334 PEC 3 0 0 3 3
Sustainability
5. CES335 Green Technology PEC 3 0 0 3 3
6. Environmental Quality
CES336 PEC 3 0 0 3 3
Monitoring and Analysis
7. Integrated Energy
CES337 Planning for Sustainable PEC 3 0 0 3 3
Development
8. Energy Efficiency for
CES338 Sustainable PEC 3 0 0 3 3
Development

23
IP3151 INDUCTION PROGRAMME

This is a mandatory 2 week programme to be conducted as soon as the students enter the institution.
Normal classes start only after the induction program is over.

The induction programme has been introduced by AICTE with the following objective:

“Engineering colleges were established to train graduates well in the branch/department of

admission, have a holistic outlook, and have a desire to work for national needs and beyond. The
graduating student must have knowledge and skills in the area of his/her study. However, he/she
must also have a broad understanding of society and relationships. Character needs to be nurtured
as an essential quality by which he/she would understand and fulfill his/her responsibility as an
engineer, a citizen and a human being. Besides the above, several meta-skills and underlying values
are needed.”

“One will have to work closely with the newly joined students in making them feel comfortable, allow
them to explore their academic interests and activities, reduce competition and make them work for
excellence, promote bonding within them, build relations between teachers and students, give a
broader view of life, and build character.”

Hence, the purpose of this programme is to make the students feel comfortable in their new
environment, open them up, set a healthy daily routine, create bonding in the batch as well as
between faculty and students, develop awareness, sensitivity and understanding of the self, people
around them, society at large, and nature.

The following are the activities under the induction program in which the student would be fully
engaged throughout the day for the entire duration of the program.

(i) Physical Activity

This would involve a daily routine of physical activity with games and sports, yoga, gardening, etc.

(ii) Creative Arts

Every student would choose one skill related to the arts whether visual arts or performing arts.
Examples are painting, sculpture, pottery, music, dance etc. The student would pursue it everyday
for the duration of the program. These would allow for creative expression. It would develop a sense
of aesthetics and
also enhance creativity which would, hopefully, grow into engineering design later.

(iii) Universal Human Values

This is the anchoring activity of the Induction Programme. It gets the student to explore oneself and
allows one to experience the joy of learning, stand up to peer pressure, make decisions with
courage, be aware of relationships with colleagues and supporting stay in the hostel and
department, be sensitive to others, etc. A module in Universal Human Values provides the base.
Methodology of teaching this content is extremely important. It must not be through do's and don'ts,
but get students to explore and think by engaging them in a dialogue. It is best taught through group
discussions and real life activities rather than lecturing.

24
Discussions would be conducted in small groups of about 20 students with a faculty
mentor each. It would be effective that the faculty mentor assigned is also the faculty advisor for the
student for the full duration of the UG programme.

(iv) Literary Activity

Literary activity would encompass reading, writing and possibly, debating, enacting a play etc.

(v) Proficiency Modules

This would address some lacunas that students might have, for example, English, computer
familiarity etc.

(vi) Lectures by Eminent People

Motivational lectures by eminent people from all walks of life should be arranged to give the students
exposure to people who are socially active or in public life.

(vii) Visits to Local Area

A couple of visits to the landmarks of the city, or a hospital or orphanage could be organized. This
would familiarize them with the area as well as expose them to the underprivileged.

(viii) Familiarization to Dept./Branch & Innovations

They should be told about what getting into a branch or department means what role it plays in
society, through its technology. They should also be shown the laboratories, workshops & other
facilities.

(ix) Department Specific Activities

About a week can be spent in introducing activities (games, quizzes, social interactions, small
experiments, design thinking etc.) that are relevant to the particular branch of Engineering /
Technology / Architecture that can serve as a motivation and kindle interest in building things
(become a maker) in that particular field. This can be conducted in the form of a workshop. For
example, CSE and IT students may be introduced to activities that kindle computational thinking,
and get them to build simple games. ECE students may be introduced to building simple circuits as
an extension of their knowledge in Science, and so on. Students may be asked to build stuff using
their knowledge of science.

Induction Programme is totally an activity based programme and therefore there shall be no
tests / assessments during this programme.

References:
Guide to Induction program from AICTE

25
HS3152 PROFESSIONAL ENGLISH I LTPC
3 003
COURSE OBJECTIVES:
 To improve the communicative competence of learners
 To learn to use basic grammatic structures in suitable contexts
 To acquire lexical competence and use them appropriately in a sentence and understand
their meaning in a text
 To help learners use language effectively in professional contexts
 To develop learners’ ability to read and write complex texts, summaries, articles, blogs,
definitions, essays and user manuals.
UNIT I INTRODUCTION TO EFFECTIVE COMMUNICATION 1
What is effective communication? (Explain using activities) Why is communication critical for
excellence during study, research and work? What are the seven C’s of effective communication?
What are key language skills? What is effective listening? What does it involve? What is effective
speaking? What does it mean to be an excellent reader? What should you be able to do? What is
effective writing? How does one develop language and communication skills? What does the course
focus on? How are communication and language skills going to be enhanced during this course?
What do you as a learner need to do to enhance your English language and communication skills
to get the best out of this course?

INTRODUCTION TO FUNDAMENTALS OF COMMUNICATION 8

Reading - Reading brochures (technical context), telephone messages / social media messages
relevant to technical contexts and emails. Writing - Writing emails / letters introducing oneself.
Grammar - Present Tense ( simple and progressive); Question types: Wh/ Yes or No/ and Tags.
Vocabulary - Synonyms; One word substitution; Abbreviations & Acronyms (as used in technical
contexts).

UNIT II NARRATION AND SUMMATION 9

Reading - Reading biographies, travelogues, newspaper reports, Excerpts from literature, and travel
& technical blogs. Writing - Guided writing-- Paragraph writing Short Report on an event (field trip
etc.) Grammar –Past tense (simple); Subject-Verb Agreement; and Prepositions. Vocabulary - Word
forms (prefixes& suffixes); Synonyms and Antonyms. Phrasal verbs.

UNIT III DESCRIPTION OF A PROCESS / PRODUCT 9

Reading – Reading advertisements, gadget reviews; user manuals. Writing - Writing definitions;
instructions; and Product /Process description. Grammar - Imperatives; Adjectives; Degrees of
comparison; Present & Past Perfect Tenses. Vocabulary - Compound Nouns, Homonyms; and
Homophones, discourse markers (connectives & sequence words).

UNIT IV CLASSIFICATION AND RECOMMENDATIONS 9

Reading – Newspaper articles; Journal reports –and Non Verbal Communcation ( tables, pie charts
etc,. ). Writing – Note-making / Note-taking (*Study skills to be taught, not tested); Writing
recommendations; Transferring information from non verbal ( chart , graph etc, to verbal mode)
Grammar – Articles; Pronouns - Possessive & Relative pronouns. Vocabulary - Collocations; Fixed
/ Semi fixed expressions.

UNIT V EXPRESSION 9
Reading – Reading editorials; and Opinion Blogs; Writing – Essay Writing (Descriptive or narrative).
Grammar – Future Tenses, Punctuation; Negation (Statements & Questions); and Simple,
26
 Compound & Complex Sentences. Vocabulary - Cause & Effect Expressions – Content vs Function
words.
TOTAL : 45 PERIODS
COURSE OUTCOMES :
At the end of the course, learners will be able
CO1:To use appropriate words in a professional context
CO2:To gain understanding of basic grammatic structures and use them in right context.
CO3:To read and infer the denotative and connotative meanings of technical texts
CO4:To write definitions, descriptions, narrations and essays on various topics

TEXT BOOKS :
1. English for Engineers & Technologists Orient Blackswan Private Ltd. Department of
English, Anna University, (2020 edition)
2. English for Science & Technology Cambridge University Press, 2021.
Authored by Dr. Veena Selvam, Dr. Sujatha Priyadarshini, Dr. Deepa Mary Francis, Dr. KN.
Shoba, and Dr. Lourdes Joevani, Department of English, Anna University.

REFERENCES:
1. Technical Communication – Principles And Practices By Meenakshi Raman & Sangeeta
Sharma, Oxford Univ. Press, 2016, New Delhi.
2. A Course Book On Technical English By Lakshminarayanan, Scitech Publications (India)
Pvt. Ltd.
3. English For Technical Communication (With CD) By Aysha Viswamohan, Mcgraw Hill
Education, ISBN : 0070264244.
4. Effective Communication Skill, Kulbhusan Kumar, RS Salaria, Khanna Publishing House.
5. Learning to Communicate – Dr. V. Chellammal, Allied Publishing House, New Delhi,2003.

ASSESSMENT PATTERN

Two internal assessments and an end semester examination to test students’ reading and writing
skills along with their grammatical and lexical competence.

CO’s-PO’s & PSO’s MAPPING

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 1 1 1 1 1 3 3 3 1 3 - 3 - - -
2 1 1 1 1 1 3 3 3 1 3 - 3 - - -
3 2 3 2 3 2 3 3 3 2 3 3 3 - - -
4 2 3 2 3 2 3 3 3 2 3 3 3 - - -
5 2 3 3 3 - 3 3 3 2 3 - 3 - - -
AVg. 1.6 2.2 1.8 2.2 1.5 3 3 3 1.6 3 3 3 - - -

1 - low, 2 - medium, 3 - high, ‘-' - no correlation

27
MA3151 MATRICES AND CALCULUS L T P C
3 1 0 4

COURSE OBJECTIVES:
 To develop the use of matrix algebra techniques that are needed by engineers for practical
applications.
 To familiarize the students with differential calculus.
 To familiarize the student with functions of several variables. This is needed in many
branches of engineering.
 To make the students understand various techniques of integration.
 To acquaint the student with mathematical tools needed in evaluating multiple integrals and
their applications.
UNIT I MATRICES 9+3
Eigenvalues and Eigenvectors of a real matrix – Characteristic equation – Properties of Eigenvalues
and Eigenvectors – Cayley - Hamilton theorem – Diagonalization of matrices by orthogonal
transformation – Reduction of a quadratic form to canonical form by orthogonal transformation –
Nature of quadratic forms – Applications: Stretching of an elastic membrane.

UNIT II DIFFERENTIAL CALCULUS 9+3

Representation of functions - Limit of a function - Continuity - Derivatives - Differentiation rules (sum,
product, quotient, chain rules) - Implicit differentiation - Logarithmic differentiation - Applications:
Maxima and Minima of functions of one variable.

UNIT III FUNCTIONS OF SEVERAL VARIABLES 9+3

Partial differentiation – Homogeneous functions and Euler’s theorem – Total derivative – Change of
variables – Jacobians – Partial differentiation of implicit functions – Taylor’s series for functions of
two variables – Applications: Maxima and minima of functions of two variables and Lagrange’s
method of undetermined multipliers.

UNIT IV INTEGRAL CALCULUS 9+3

Definite and Indefinite integrals - Substitution rule - Techniques of Integration: Integration by parts,
Trigonometric integrals, Trigonometric substitutions, Integration of rational functions by partial
fraction, Integration of irrational functions - Improper integrals - Applications: Hydrostatic force and
pressure, moments and centres of mass.

UNIT V MULTIPLE INTEGRALS 9+3

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 – Applications: Moments and centres of mass, moment of inertia.
TOTAL: 60 PERIODS
COURSE OUTCOMES:
At the end of the course the students will be able to
CO1:Use the matrix algebra methods for solving practical problems.
CO2:Apply differential calculus tools in solving various application problems.
CO3:Able to use differential calculus ideas on several variable functions.
CO4:Apply different methods of integration in solving practical problems.
CO5:Apply multiple integral ideas in solving areas, volumes and other practical problems.
28
 TEXT BOOKS :
1. Kreyszig.E, "Advanced Engineering Mathematics", John Wiley and Sons,
10th Edition, New Delhi, 2016.
2. Grewal.B.S., “Higher Engineering Mathematics”, Khanna Publishers, New Delhi,
44th Edition , 2018.
3. James Stewart, " Calculus: Early Transcendentals", Cengage Learning, 8th Edition, New
Delhi, 2015. [For Units II & IV - Sections 1.1, 2.2, 2.3, 2.5, 2.7 (Tangents problems only),
2.8, 3.1 to 3.6, 3.11, 4.1, 4.3, 5.1 (Area problems only), 5.2, 5.3, 5.4 (excluding net change
theorem), 5.5, 7.1 - 7.4 and 7.8 ].

REFERENCES:
1. Anton. H, Bivens. I and Davis. S, "Calculus", Wiley, 10th Edition, 2016
2. Bali. N., Goyal. M. and Watkins. C., “Advanced Engineering Mathematics”, Firewall
Media (An imprint of Lakshmi Publications Pvt., Ltd.,), New Delhi, 7th Edition, 2009.
3. Jain . R.K. and Iyengar. S.R.K., “Advanced Engineering Mathematics”, Narosa
Publications, New Delhi, 5th Edition, 2016.
4. Narayanan. S. and Manicavachagom Pillai. T. K., “Calculus" Volume I and II,
S. Viswanathan Publishers Pvt. Ltd., Chennai, 2009.
5. Ramana. B.V., "Higher Engineering Mathematics", McGraw Hill Education Pvt. Ltd,
New Delhi, 2016.
6. Srimantha Pal and Bhunia. S.C, “Engineering Mathematics" Oxford University Press, 2015.
7. Thomas. G. B., Hass. J, and Weir. M.D, "Thomas Calculus", 14th Edition, Pearson India,
2018.
CO’s-PO’s & PSO’s MAPPING
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 1 1 0 0 0 0 2 0 2 3 - - -
CO2 3 3 1 1 0 0 0 0 2 0 2 3 - - -
CO3 3 3 1 1 0 0 0 0 2 0 2 3 - - -
CO4 3 3 1 1 0 0 0 0 2 0 2 3 - - -
CO5 3 3 1 1 0 0 0 0 2 0 2 3 - - -
Avg 3 3 1 1 0 0 0 0 2 0 2 3 - - -
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

PH3151 ENGINEERING PHYSICS L T P C

3 0 0 3
COURSE OBJECTIVES:
 To make the students effectively achieve an understanding of mechanics.
 To enable the students to gain knowledge of electromagnetic waves and its applications.
 To introduce the basics of oscillations, optics and lasers.
 Equipping the students to successfully understand the importance of quantum physics.
 To motivate the students towards the applications of quantum mechanics.

UNIT I MECHANICS 9
Multi-particle dynamics: Center of mass (CM) – CM of continuous bodies – motion of the CM –
kinetic energy of the system of particles. Rotation of rigid bodies: Rotational kinematics – rotational
kinetic energy and moment of inertia - theorems of M .I –moment of inertia of continuous bodies –

29
M.I of a diatomic molecule - torque – rotational dynamics of rigid bodies – conservation of angular
momentum – rotational energy state of a rigid diatomic molecule - gyroscope - torsional pendulum
– double pendulum –Introduction to nonlinear oscillations.

UNIT II ELECTROMAGNETIC WAVES 9

The Maxwell’s equations - wave equation; Plane electromagnetic waves in vacuum, Conditions on
the wave field - properties of electromagnetic waves: speed, amplitude, phase, orientation and
waves in matter - polarization - Producing electromagnetic waves - Energy and momentum in EM
waves: Intensity, waves from localized sources, momentum and radiation pressure - Cell-phone
reception. Reflection and transmission of electromagnetic waves from a non-conducting medium-
vacuum interface for normal incidence.

UNIT III OSCILLATIONS, OPTICS AND LASERS 9

Simple harmonic motion - resonance –analogy between electrical and mechanical oscillating
systems - waves on a string - standing waves - traveling waves - Energy transfer of a wave - sound
waves - Doppler effect. Reflection and refraction of light waves - total internal reflection - interference
–Michelson interferometer –Theory of air wedge and experiment. Theory of laser - characteristics
- Spontaneous and stimulated emission - Einstein’s coefficients - population inversion - Nd-YAG
laser, CO2 laser, semiconductor laser –Basic applications of lasers in industry.

UNIT IV BASIC QUANTUM MECHANICS 9

Photons and light waves - Electrons and matter waves –Compton effect - The Schrodinger equation
(Time dependent and time independent forms) - meaning of wave function - Normalization –Free
particle - particle in a infinite potential well: 1D,2D and 3D Boxes- Normalization, probabilities and
the correspondence principle.

UNIT V APPLIED QUANTUM MECHANICS 9

The harmonic oscillator(qualitative)- Barrier penetration and quantum tunneling(qualitative)-
Tunneling microscope - Resonant diode - Finite potential wells (qualitative)- Bloch’s theorem for
particles in a periodic potential –Basics of Kronig-Penney model and origin of energy bands.

TOTAL : 45 PERIODS
COURSE OUTCOMES:
After completion of this course, the students should be able to
CO1:Understand the importance of mechanics.
CO2:Express their knowledge in electromagnetic waves.
CO3:Demonstrate a strong foundational knowledge in oscillations, optics and lasers.
CO4:Understand the importance of quantum physics.
CO5:Comprehend and apply quantum mechanical principles towards the formation of energy bands.
TEXT BOOKS:
1. D.Kleppner and R.Kolenkow. An Introduction to Mechanics. McGraw Hill Education (Indian
Edition), 2017.
2. E.M.Purcell and D.J.Morin, Electricity and Magnetism, Cambridge Univ.Press, 2013.
3. Arthur Beiser, Shobhit Mahajan, S. Rai Choudhury, Concepts of Modern Physics, McGraw-
Hill (Indian Edition), 2017.
REFERENCES:
1. R.Wolfson. Essential University Physics. Volume 1 & 2. Pearson Education (Indian Edition),
2009.
30
 2. Paul A. Tipler, Physic – Volume 1 & 2, CBS, (Indian Edition), 2004.
3. K.Thyagarajan and A.Ghatak. Lasers: Fundamentals and Applications, Laxmi Publications,
(Indian Edition), 2019.
4. D.Halliday, R.Resnick and J.Walker. Principles of Physics, Wiley (Indian Edition), 2015.
5. N.Garcia, A.Damask and S.Schwarz. Physics for Computer Science Students. Springer-
Verlag, 2012.
CO’s-PO’s & PSO’s MAPPING
CO PO PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 3
1 3 2 1 1 1 - - - - - - - - -
2 3 3 2 1 2 1 - - - - - - - - -
3 3 3 2 2 2 1 - - - - - 1 - - -
4 3 3 1 1 2 1 - - - - - - - -
5 3 3 1 1 2 1 - - - - - - - - -
AV 3 3 1.6 1.2 1.8 1 - - - - - 1 - - -
G 1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CY3151 ENGINEERING CHEMISTRY L T P C

3 0 0 3
COURSE OBJECTIVES:
 To inculcate sound understanding of water quality parameters and water treatment
techniques.
 To impart knowledge on the basic principles and preparatory methods of nanomaterials.
 To introduce the basic concepts and applications of phase rule and composites.
 To facilitate the understanding of different types of fuels, their preparation, properties and
combustion characteristics.
 To familiarize the students with the operating principles, working processes and applications
of energy conversion and storage devices.

UNIT I WATER AND ITS TREATMENT 9

Water: Sources and impurities, Water quality parameters: Definition and significance of-color, odour,
turbidity, pH, hardness, alkalinity, TDS, COD and BOD, fluoride and arsenic. Municipal water
treatment: primary treatment and disinfection (UV, Ozonation, break-point chlorination).
Desalination of brackish water: Reverse Osmosis. Boiler troubles: Scale and sludge, Boiler
corrosion, Caustic embrittlement, Priming & foaming. Treatment of boiler feed water: Internal
treatment (phosphate, colloidal, sodium aluminate and calgon conditioning) and External treatment
– Ion exchange demineralization and zeolite process.

UNIT II NANOCHEMISTRY 9
Basics: Distinction between molecules, nanomaterials and bulk materials; Size-dependent
properties (optical, electrical, mechanical and magnetic); Types of nanomaterials: Definition,
properties and uses of – nanoparticle, nanocluster, nanorod, nanowire and nanotube. Preparation
of nanomaterials: sol-gel, solvothermal, laser ablation, chemical vapour deposition, electrochemical
deposition and electro spinning. Applications of nanomaterials in medicine, agriculture, energy,
electronics and catalysis.

UNIT III PHASE RULE AND COMPOSITES 9

Phase rule: Introduction, definition of terms with examples. One component system - water system;
Reduced phase rule; Construction of a simple eutectic phase diagram - Thermal analysis; Two
31
component system: lead-silver system - Pattinson process.
Composites: Introduction: Definition & Need for composites; Constitution: Matrix materials (Polymer
matrix, metal matrix and ceramic matrix) and Reinforcement (fiber, particulates, flakes and
whiskers). Properties and applications of: Metal matrix composites (MMC), Ceramic matrix
composites and Polymer matrix composites. Hybrid composites - definition and examples.

UNIT IV FUELS AND COMBUSTION 9

Fuels: Introduction: Classification of fuels; Coal and coke: Analysis of coal (proximate and ultimate),
Carbonization, Manufacture of metallurgical coke (Otto Hoffmann method). Petroleum and Diesel:
Manufacture of synthetic petrol (Bergius process), Knocking - octane number, diesel oil - cetane
number; Power alcohol and biodiesel.
Combustion of fuels: Introduction: Calorific value - higher and lower calorific values, Theoretical
calculation of calorific value; Ignition temperature: spontaneous ignition temperature, Explosive
range; Flue gas analysis - ORSAT Method. CO2 emission and carbon footprint.

UNIT V ENERGY SOURCES AND STORAGE DEVICES 9

Stability of nucleus: mass defect (problems), binding energy; Nuclear energy: light water nuclear
power plant, breeder reactor. Solar energy conversion: Principle, working and applications of solar
cells; Recent developments in solar cell materials. Wind energy; Geothermal energy; Batteries:
Types of batteries, Primary battery - dry cell, Secondary battery - lead acid battery and lithium-ion-
battery; Electric vehicles - working principles; Fuel cells: H2-O2 fuel cell, microbial fuel cell;
Supercapacitors: Storage principle, types and examples.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
At the end of the course, the students will be able:
CO1:To infer the quality of water from quality parameter data and propose suitable treatment
methodologies to treat water.
CO2:To identify and apply basic concepts of nanoscience and nanotechnology in designing the
synthesis of nanomaterials for engineering and technology applications.
CO3:To apply the knowledge of phase rule and composites for material selection requirements.
CO4:To recommend suitable fuels for engineering processes and applications.
CO5:To recognize different forms of energy resources and apply them for suitable applications in
energy sectors.

TEXT BOOKS:
1. P. C. Jain and Monica Jain, “Engineering Chemistry”, 17th Edition, Dhanpat Rai Publishing
Company (P) Ltd, New Delhi, 2018.
2. Sivasankar B., “Engineering Chemistry”, Tata McGraw-Hill Publishing Company Ltd, New
Delhi, 2008.
3. S.S. Dara, “A Text book of Engineering Chemistry”, S. Chand Publishing, 12th Edition,
2018
REFERENCES:
1. B. S. Murty, P. Shankar, Baldev Raj, B. B. Rath and James Murday, “Text book of
nanoscience and nanotechnology”, Universities Press-IIM Series in Metallurgy and Materials
Science, 2018.
2. O.G. Palanna, “Engineering Chemistry” McGraw Hill Education (India) Private Limited, 2nd
Edition, 2017.

32
 3. Friedrich Emich, “Engineering Chemistry”, Scientific International PVT, LTD, New Delhi,
2014.
4. ShikhaAgarwal, “Engineering Chemistry-Fundamentals and Applications”, Cambridge
University Press, Delhi, Second Edition, 2019.
5. O.V. Roussak and H.D. Gesser, Applied Chemistry-A Text Book for Engineers and
Technologists, Springer Science Business Media, New York, 2nd Edition, 2013.

CO’s-PO’s & PSO’s MAPPING

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 3 2 2 1 - 1 1 - - - - 1 - - -
2 2 - - 1 - 2 2 - - - - - - - -
3 3 1 - - - - - - - - - - - - -
4 3 1 1 - - 1 2 - - - - - - - -
5 3 1 2 1 - 2 2 - - - - 2 - - -
CO 2.8 1.3 1.6 1 - 1.5 1.8 - - - 1.5 - - -
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

GE3151 PROBLEM SOLVING AND PYTHON PROGRAMMING L T P C

3 0 0 3

COURSE OBJECTIVES:
● To understand the basics of algorithmic problem solving.
● To learn to solve problems using Python conditionals and loops.
● To define Python functions and use function calls to solve problems.
● To use Python data structures - lists, tuples, dictionaries to represent complex data.
● To do input/output with files in Python.

UNIT I COMPUTATIONAL THINKING AND PROBLEM SOLVING 9

Fundamentals of Computing – Identification of Computational Problems -Algorithms, building blocks
of algorithms (statements, state, control flow, functions), notation (pseudo
code, flow chart, programming language), algorithmic problem solving, simple strategies for
developing algorithms (iteration, recursion). Illustrative problems: find minimum in a list, insert a card
in a list of sorted cards, guess an integer number in a range, Towers of Hanoi.

UNIT II DATA TYPES, EXPRESSIONS, STATEMENTS 9

Python interpreter and interactive mode,debugging; values and types: int, float, boolean, string
, and list; variables, expressions, statements, tuple assignment, precedence of operators,
comments; Illustrative programs: exchange the values of two variables, circulate the values of n
variables, distance between two points.

UNIT III CONTROL FLOW, FUNCTIONS, STRINGS 9

Conditionals:Boolean values and operators, conditional (if), alternative (if-else),chained conditional
(if-elif-else);Iteration: state, while, for, break, continue, pass; Fruitful functions: return
values,parameters, local and global scope, function composition, recursion; Strings:
string slices,immutability, string functions and methods, string module; Lists as arrays.
Illustrative programs: square root, gcd, exponentiation, sum an array of numbers, linear search,
binary search.

33
 UNIT IV LISTS, TUPLES, DICTIONARIES 9
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; Illustrative programs: simple sorting, histogram,
Students marks statement, Retail bill preparation.

UNIT V FILES, MODULES, PACKAGES 9

Files and exceptions: text files, reading and writing files, format operator; command line arguments,
errors and exceptions, handling exceptions, modules, packages; Illustrative programs: word count,
copy file, Voter’s age validation, Marks range validation (0-100).
TOTAL : 45 PERIODS
COURSE OUTCOMES:
Upon completion of the course, students will be able to
CO1: Develop algorithmic solutions to simple computational problems.
CO2: Develop and execute simple Python programs.
CO3: Write simple Python programs using conditionals and loops for solving problems.
CO4: Decompose a Python program into functions.
CO5: Represent compound data using Python lists, tuples, dictionaries etc.
CO6: Read and write data from/to files in Python programs.

TEXT BOOKS:
1. Allen B. Downey, “Think Python: How to Think like a Computer Scientist”, 2nd Edition,
O’Reilly Publishers, 2016.
2. Karl Beecher, “Computational Thinking: A Beginner's Guide to Problem Solving and
Programming”, 1st Edition, BCS Learning & Development Limited, 2017.

REFERENCES:
1. Paul Deitel and Harvey Deitel, “Python for Programmers”, Pearson Education, 1st Edition,
2021.
2. G Venkatesh and Madhavan Mukund, “Computational Thinking: A Primer for Programmers
and Data Scientists”, 1st Edition, Notion Press, 2021.
3. John V Guttag, "Introduction to Computation and Programming Using Python: With
Applications to Computational Modeling and Understanding Data”, Third Edition, MIT Press,
2021
4. Eric Matthes, “Python Crash Course, A Hands - on Project Based Introduction to
Programming”, 2nd Edition, No Starch Press, 2019.
5. https://www.python.org/
6. Martin C. Brown, “Python: The Complete Reference”, 4th Edition, Mc-Graw Hill, 2018.
CO’s-PO’s & PSO’s MAPPING
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 3 3 3 3 2 - - - - - 2 2 3 3 -
2 3 3 3 3 2 - - - - - 2 2 3 - -
3 3 3 3 3 2 - - - - - 2 - 3 - -
4 2 2 - 2 2 - - - - - 1 - 3 - -
5 1 2 - - 1 - - - - - 1 - 2 - -
6 2 2 - - 2 - - - - - 1 - 2 -
AVg. 2 3 3 3 2 - - - - - 2 2 3 3 -
1 - low, 2 - medium, 3 - high, ‘-' - no correlation
34
GE3152 HERITAGE OF TAMILS L T P C
1 0 0 1

UNIT I LANGUAGE AND LITERATURE 3

Language Families in India - Dravidian Languages – Tamil as a Classical Language - Classical
Literature in Tamil – Secular Nature of Sangam Literature – Distributive Justice in Sangam Literature
- Management Principles in Thirukural - Tamil Epics and Impact of Buddhism & Jainism in Tamil
Land - Bakthi Literature Azhwars and Nayanmars - Forms of minor Poetry - Development of Modern
literature in Tamil - Contribution of Bharathiyar and Bharathidhasan.

UNIT II HERITAGE - ROCK ART PAINTINGS TO MODERN ART – SCULPTURE 3

Hero stone to modern sculpture - Bronze icons - Tribes and their handicrafts - Art of temple car
making - - Massive Terracotta sculptures, Village deities, Thiruvalluvar Statue at Kanyakumari,
Making of musical instruments - Mridhangam, Parai, Veenai, Yazh and Nadhaswaram - Role of
Temples in Social and Economic Life of Tamils.

UNIT III FOLK AND MARTIAL ARTS 3

Therukoothu, Karagattam, Villu Pattu, Kaniyan Koothu, Oyillattam, Leather puppetry, Silambattam,
Valari, Tiger dance - Sports and Games of Tamils.

UNIT IV THINAI CONCEPT OF TAMILS 3

Flora and Fauna of Tamils & Aham and Puram Concept from Tholkappiyam and Sangam Literature
- Aram Concept of Tamils - Education and Literacy during Sangam Age - Ancient Cities and Ports of
Sangam Age - Export and Import during Sangam Age - Overseas Conquest of Cholas.

UNIT V CONTRIBUTION OF TAMILS TO INDIAN NATIONAL MOVEMENT AND INDIAN

CULTURE 3
Contribution of Tamils to Indian Freedom Struggle - The Cultural Influence of Tamils over the other
parts of India – Self-Respect Movement - Role of Siddha Medicine in Indigenous Systems of
Medicine – Inscriptions & Manuscripts – Print History of Tamil Books.

TOTAL : 15 PERIODS
TEXT-CUM-REFERENCE BOOKS
1. தமிழக வரலொறு – மக்களும் பண்பொடும் – கக.கக. பிள் ளள (தவளியீடு:
தமிழ் நொடு பொடநூல் மற் றும் கல் வியியல் பணிகள் கழகம் ).
2. கணினித் தமிழ் – முளனவர் இல. சுந்தரம் . (விகடன் பிரசுரம் ).
3. கீழடி – ளவளக நதிக்களரயில் சங் ககொல நகர நொகரிகம் (ததொல் லியல் துளற
தவளியீடு)
4. தபொருளந – ஆற் றங் களர நொகரிகம் . (ததொல் லியல் துளற தவளியீடு)
5. Social Life of Tamils (Dr.K.K.Pillay) A joint publication of TNTB & ESC and RMRL – (in print)
6. Social Life of the Tamils - The Classical Period (Dr.S.Singaravelu) (Published by:
International Institute of Tamil Studies.
7. Historical Heritage of the Tamils (Dr.S.V.Subatamanian, Dr.K.D. Thirunavukkarasu)
(Published by: International Institute of Tamil Studies).
8. The Contributions of the Tamils to Indian Culture (Dr.M.Valarmathi) (Published by:
International Institute of Tamil Studies.)
9. Keeladi - ‘Sangam City C ivilization on the banks of river Vaigai’ (Jointly Published by:
Department of Archaeology & Tamil Nadu Text Book and Educational Services Corporation,
35
 Tamil Nadu)
10. Studies in the History of India with Special Reference to Tamil Nadu (Dr.K.K.Pillay)
(Published by: The Author)
11. Porunai Civilization (Jointly Published by: Department of Archaeology & Tamil Nadu Text
Book and Educational Services Corporation, Tamil Nadu)
12. Journey of Civilization Indus to Vaigai (R.Balakrishnan) (Published by: RMRL) – Reference
Book.

GE3152 தமிழர் மரபு L T PC

1 0 0 1

அலகு I மமொழி மற் றும் இலக்கியம் : 3

இந்திய தமொழிக் குடும் பங் கள் – திரொவிட தமொழிகள் – தமிழ் ஒரு தசம் தமொழி –
தமிழ் தசவ் விலக்கியங் கள் - சங் க இலக்கியத்தின் சமயச் சொர்பற் ற தன் ளம – சங் க
இலக்கியத்தில் பகிர்தல் அறம் – திருக்குறளில் கமலொண்ளமக் கருத்துக்கள் –
தமிழ் க் கொப் பியங் கள் , தமிழகத்தில் சமண தபௌத்த சமயங் களின் தொக்கம் - பக்தி
இலக்கியம் , ஆழ் வொர்கள் மற் றும் நொயன்மொர்கள் – சிற் றிலக்கியங் கள் – தமிழில்
நவீன இலக்கியத்தின் வளர்ச்சி – தமிழ் இலக்கிய வளர்ச்சியில் பொரதியொர் மற் றும்
பொரதிதொசன் ஆகிகயொரின் பங் களிப் பு.

அலகு II மரபு – பொறற ஓவியங் கள் முதல் நவீன ஓவியங் கள் வறர –
சிற் பக் கறல: 3
நடுகல் முதல் நவீன சிற் பங் கள் வளர – ஐம் தபொன் சிளலகள் – பழங் குடியினர்
மற் றும் அவர்கள் தயொரிக்கும் ளகவிளனப் தபொருட்கள் , தபொம் ளமகள் – கதர்
தசய் யும் களல – சுடுமண் சிற் பங் கள் – நொட்டுப் புறத் ததய் வங் கள் –
குமரிமுளனயில் திருவள் ளுவர் சிளல – இளசக் கருவிகள் – மிருதங் கம் , பளற,
வீளண, யொழ் , நொதஸ்வரம் – தமிழர்களின் சமூக தபொருளொதொர வொழ் வில்
ககொவில் களின் பங் கு.

அலகு III நொட்டுப் புறக் கறலகள் மற் றும் வீர விறளயொட்டுகள் : 3

ததருக்கூத்து, கரகொட்டம் , வில் லுப் பொட்டு, கணியொன் கூத்து, ஒயிலொட்டம் ,
கதொல் பொளவக் கூத்து, சிலம் பொட்டம் , வளரி, புலியொட்டம் , தமிழர்களின்
விளளயொட்டுகள் .

அலகு IV தமிழர்களின் திறைக் ககொட்பொடுகள் : 3

தமிழகத்தின் தொவரங் களும் , விலங் குகளும் – ததொல் கொப் பியம் மற் றும் சங் க
இலக்கியத்தில் அகம் மற் றும் புறக் ககொட்பொடுகள் – தமிழர்கள் கபொற் றிய
அறக்ககொட்பொடு – சங் ககொலத்தில் தமிழகத்தில் எழுத்தறிவும் , கல் வியும் –
சங் ககொல நகரங் களும் துளற முகங் களும் – சங் ககொலத்தில் ஏற் றுமதி மற் றும்
இறக்குமதி – கடல் கடந்த நொடுகளில் கசொழர்களின் தவற் றி.

36
 அலகு V இந் திய கதசிய இயக்கம் மற் றும் இந் திய பை்பொட்டிற் குத்
தமிழர்களின் பங் களிப் பு: 3
இந்திய விடுதளலப்கபொரில் தமிழர்களின் பங் கு – இந்தியொவின் பிறப் பகுதிகளில்
தமிழ் ப் பண்பொட்டின் தொக்கம் – சுயமரியொளத இயக்கம் – இந்திய மருத்துவத்தில் ,
சித்த மருத்துவத்தின் பங் கு – கல் தவட்டுகள் , ளகதயழுத்துப் படிகள் - தமிழ் ப்
புத்தகங் களின் அச்சு வரலொறு.
TOTAL : 15 PERIODS

TEXT-CUM-REFERENCE BOOKS
1. தமிழக வரலொறு – மக்களும் பண்பொடும் – கக.கக. பிள் ளள (தவளியீடு:
தமிழ் நொடு பொடநூல் மற் றும் கல் வியியல் பணிகள் கழகம் ).
2. கணினித் தமிழ் – முளனவர் இல. சுந்தரம் . (விகடன் பிரசுரம் ).
3. கீழடி – ளவளக நதிக்களரயில் சங் ககொல நகர நொகரிகம் (ததொல் லியல் துளற
தவளியீடு)
4. தபொருளந – ஆற் றங் களர நொகரிகம் . (ததொல் லியல் துளற தவளியீடு)
5. Social Life of Tamils (Dr.K.K.Pillay) A joint publication of TNTB & ESC and RMRL – (in print)
6. Social Life of the Tamils - The Classical Period (Dr.S.Singaravelu) (Published by:
International Institute of Tamil Studies.
7. Historical Heritage of the Tamils (Dr.S.V.Subatamanian, Dr.K.D. Thirunavukkarasu)
(Published by: International Institute of Tamil Studies).
8. The Contributions of the Tamils to Indian Culture (Dr.M.Valarmathi) (Published by:
International Institute of Tamil Studies.)
9. Keeladi - ‘Sangam City C ivilization on the banks of river Vaigai’ (Jointly Published by:
Department of Archaeology & Tamil Nadu Text Book and Educational Services Corporation,
Tamil Nadu)
10. Studies in the History of India with Special Reference to Tamil Nadu (Dr.K.K.Pillay)
(Published by: The Author)
11. Porunai Civilization (Jointly Published by: Department of Archaeology & Tamil Nadu Text
Book and Educational Services Corporation, Tamil Nadu)
12. Journey of Civilization Indus to Vaigai (R.Balakrishnan) (Published by: RMRL) – Reference
Book.

GE3171 PROBLEM SOLVING AND PYTHON PROGRAMMING LABORATORY L T P C

0 0 4 2
COURSE OBJECTIVES:
 To understand the problem solving approaches.
 To learn the basic programming constructs in Python.
 To practice various computing strategies for Python-based solutions to real world
problems.
 To use Python data structures - lists, tuples, dictionaries.
 To do input/output with files in Python.

37
EXPERIMENTS:
Note: The examples suggested in each experiment are only indicative. The lab instructor is
expected to design other problems on similar lines. The Examination shall not be restricted
to the sample experiments listed here.

1. Identification and solving of simple real life or scientific or technical problems, and developing
flow charts for the same. (Electricity Billing, Retail shop billing, Sin series, weight of a
motorbike, Weight of a steel bar, compute Electrical Current in Three Phase AC Circuit, etc.)
2. Python programming using simple statements and expressions (exchange the values of two
variables, circulate the values of n variables, distance between two points).
3. Scientific problems using Conditionals and Iterative loops. (Number series, Number Patterns,
pyramid pattern)
4. Implementing real-time/technical applications using Lists, Tuples. (Items present in a
library/Components of a car/ Materials required for construction of a building –operations of
list & tuples)
5. Implementing real-time/technical applications using Sets, Dictionaries. (Language,
components of an automobile, Elements of a civil structure, etc.- operations of Sets &
Dictionaries)
6. Implementing programs using Functions. (Factorial, largest number in a list, area of shape)
7. Implementing programs using Strings. (reverse, palindrome, character count, replacing
characters)
8. Implementing programs using written modules and Python Standard Libraries (pandas,
numpy. Matplotlib, scipy)
9. Implementing real-time/technical applications using File handling. (copy from one file to
another, word count, longest word)
10. Implementing real-time/technical applications using Exception handling. (divide by zero
error, voter’s age validity, student mark range validation)
11. Exploring Pygame tool.
12. Developing a game activity using Pygame like bouncing ball, car race etc.

TOTAL: 60 PERIODS
COURSE OUTCOMES:
On completion of the course, students will be able to:
CO1: Develop algorithmic solutions to simple computational problems
CO2: Develop and execute simple Python programs.
CO3: Implement programs in Python using conditionals and loops for solving problems.
CO4: Deploy functions to decompose a Python program.
CO5: Process compound data using Python data structures.
CO6: Utilize Python packages in developing software applications.

TEXT BOOKS:
1. Allen B. Downey, “Think Python: How to Think like a Computer Scientist”, 2nd Edition,
O’Reilly Publishers, 2016.
2. Karl Beecher, “Computational Thinking: A Beginner's Guide to Problem Solving and
Programming”, 1st Edition, BCS Learning & Development Limited, 2017.

38
 REFERENCES:
1. Paul Deitel and Harvey Deitel, “Python for Programmers”, Pearson Education, 1st Edition,
2021.
2. G Venkatesh and Madhavan Mukund, “Computational Thinking: A Primer for Programmers
and Data Scientists”, 1st Edition, Notion Press, 2021.
3. John V Guttag, "Introduction to Computation and Programming Using Python: With
Applications to Computational Modeling and Understanding Data”, Third Edition, MIT Press,
2021.
4. Eric Matthes, “Python Crash Course, A Hands - on Project Based Introduction to
Programming”, 2nd Edition, No Starch Press, 2019.
5. https://www.python.org/
6. Martin C. Brown, “Python: The Complete Reference”, 4th Edition, Mc-Graw Hill, 2018.

CO’s-PO’s & PSO’s MAPPING

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 3 3 3 3 2 - - - - - 2 2 3 3 -
2 3 3 3 3 2 - - - - - 2 2 3 - -
3 3 3 3 3 2 - - - - - 2 - 3 - -
4 2 2 - 2 2 - - - - - 1 - 3 - -
5 1 2 - - 1 - - - - - 1 - 2 - -
6 2 2 - - 2 - - - - - 1 - 2 -
AVg. 2 3 3 3 2 - - - - - 2 2 3 3 -
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

BS3171 PHYSICS AND CHEMISTRY LABORATORY L T P C

0 0 4 2
PHYSICS LABORATORY : (Any Seven Experiments)

COURSE OBJECTIVES:

 To learn the proper use of various kinds of physics laboratory equipment.

 To learn how data can be collected, presented and interpreted in a clear and concise manner.
 To learn problem solving skills related to physics principles and interpretation of experimental
data.
 To determine error in experimental measurements and techniques used to minimize such
error.
 To make the student an active participant in each part of all lab exercises.

1. Torsional pendulum - Determination of rigidity modulus of wire and moment of inertia of

regular and irregular objects.
2. Simple harmonic oscillations of cantilever.
3. Non-uniform bending - Determination of Young’s modulus
4. Uniform bending – Determination of Young’s modulus
5. Laser- Determination of the wavelength of the laser using grating
6. Air wedge - Determination of thickness of a thin sheet/wire
7. a) Optical fibre -Determination of Numerical Aperture and acceptance angle
b) Compact disc- Determination of width of the groove using laser.
39
 8. Acoustic grating- Determination of velocity of ultrasonic waves in liquids.
9. Ultrasonic interferometer – determination of the velocity of sound and compressibility of
liquids
10. Post office box -Determination of Band gap of a semiconductor.
11. Photoelectric effect
12. Michelson Interferometer.
13. Melde’s string experiment
14. Experiment with lattice dynamics kit.
TOTAL: 30 PERIODS
COURSE OUTCOMES:
Upon completion of the course, the students should be able to
CO1:Understand the functioning of various physics laboratory equipment.
CO2:Use graphical models to analyze laboratory data.
CO3:Use mathematical models as a medium for quantitative reasoning and describing physical
reality.
CO4:Access, process and analyze scientific information.
CO5:Solve problems individually and collaboratively.

CO’s-PO’s & PSO’s MAPPING

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 3 2 3 1 1 - - - - - - - - - -
2 3 3 2 1 1 - - - - - - - - - -
3 3 2 3 1 1 - - - - - - - - - -
4 3 3 2 1 1 - - - - - - - - - -
5 3 2 3 1 1 - - - - - - - - - -
AVG 3 2.4 2.6 1 1 - - - - - - - - - -
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CHEMISTRY LABORATORY: (Any seven experiments to be conducted)

COURSE OBJECTIVES:
 To inculcate experimental skills to test basic understanding of water quality parameters,
such as, acidity, alkalinity, hardness, DO, chloride and copper.
 To induce the students to familiarize with electroanalytical techniques such as, pH metry,
potentiometry and conductometry in the determination of impurities in aqueous solutions.
 To demonstrate the analysis of metals and alloys.
 To demonstrate the synthesis of nanoparticles

1. Preparation of Na2CO3 as a primary standard and estimation of acidity of a water sample

using the primary standard
2. Determination of types and amount of alkalinity in a water sample.
- Split the first experiment into two
3. Determination of total, temporary & permanent hardness of water by EDTA method.
4. Determination of DO content of water sample by Winkler’s method.
5. Determination of chloride content of water sample by Argentometric method.
6. Estimation of copper content of the given solution by Iodometry.
7. Estimation of TDS of a water sample by gravimetry.
8. Determination of strength of given hydrochloric acid using pH meter.

40
 9. Determination of strength of acids in a mixture of acids using conductivity meter.
10. Conductometric titration of barium chloride against sodium sulphate (precipitation
titration)
11. Estimation of iron content of the given solution using potentiometer.
12. Estimation of sodium /potassium present in water using a flame photometer.
13. Preparation of nanoparticles (TiO2/ZnO/CuO) by Sol-Gel method.
14. Estimation of Nickel in steel
15. Proximate analysis of Coal
TOTAL : 30 PERIODS
COURSE OUTCOMES:
CO1:To analyse the quality of water samples with respect to their acidity, alkalinity, hardness and
DO.
CO2:To determine the amount of metal ions through volumetric and spectroscopic techniques
CO3:To analyse and determine the composition of alloys.
CO4:To learn simple method of synthesis of nanoparticles
CO5:To quantitatively analyse the impurities in solution by electroanalytical techniques

TEXT BOOKS :
1. J. Mendham, R. C. Denney, J.D. Barnes, M. Thomas and B. Sivasankar, Vogel’s Textbook
of Quantitative Chemical Analysis (2009).

CO’s-PO’s & PSO’s MAPPING

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 3 - 1 - - 2 2 - - - - 2 - - -
2 3 1 2 - - 1 2 - - - - 1 - - -
3 3 2 1 1 - - 1 - - - - - - - -
4 2 1 2 - - 2 2 - - - - - - - -
5 2 1 2 - 1 2 2 - - - - 1 - - -
Avg. 2.6 1.3 1.6 1 1 1.4 1.8 - - - - 1.3 - - -
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

GE3172 ENGLISH LABORATORY L T P C

0 0 2 1
COURSE OBJECTIVES:
 To improve the communicative competence of learners
 To help learners use language effectively in academic /work contexts
 To develop various listening strategies to comprehend various types of audio materials
like lectures, discussions, videos etc.
 To build on students’ English language skills by engaging them in listening, speaking and
grammar learning activities that are relevant to authentic contexts.
 To use language efficiently in expressing their opinions via various media.

UNIT I INTRODUCTION TO FUNDAMENTALS OF COMMUNICATION 6

Listening for general information-specific details- conversation: Introduction to classmates - Audio /
video (formal & informal); Telephone conversation; Listening to voicemail & messages; Listening
and filling a form. Speaking - making telephone calls-Self Introduction; Introducing a friend; -
41
politeness strategies- making polite requests, making polite offers, replying to polite requests and
offers- understanding basic instructions( filling out a bank application for example).

UNIT II NARRATION AND SUMMATION 6

Listening - Listening to podcasts, anecdotes / stories / event narration; documentaries and interviews
with celebrities. Speaking - Narrating personal experiences / events-Talking about current and
temporary situations & permanent and regular situations* - describing experiences and feelings-
engaging in small talk- describing requirements and abilities.

UNIT III DESCRIPTION OF A PROCESS / PRODUCT 6

Listening - Listen to product and process descriptions; a classroom lecture; and advertisements
about products. Speaking – Picture description- describing locations in workplaces- Giving
instruction to use the product- explaining uses and purposes- Presenting a product- describing
shapes and sizes and weights- talking about quantities(large & small)-talking about precautions.

UNIT IV CLASSIFICATION AND RECOMMENDATIONS 6

Listening – Listening to TED Talks; Listening to lectures - and educational videos. Speaking – Small
Talk; discussing and making plans-talking about tasks-talking about progress- talking about
positions and directions of movement-talking about travel preparations- talking about
transportation-

UNIT V EXPRESSION 6
Listening – Listening to debates/ discussions; different viewpoints on an issue; and panel
discussions. Speaking –making predictions- talking about a given topic-giving opinions-
understanding a website-describing processes

TOTAL : 30 PERIODS
COURSE OUTCOMES:
At the end of the course, learners will be able
CO1:To listen to and comprehend general as well as complex academic information
CO2:To listen to and understand different points of view in a discussion
CO3:To speak fluently and accurately in formal and informal communicative contexts
CO4:To describe products and processes and explain their uses and purposes clearly and
accurately
CO5:To express their opinions effectively in both formal and informal discussions

CO’s-PO’s & PSO’s MAPPING

PO PSO
CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 3 3 1 3 3 3 3 3 3 3 - - -
2 3 3 3 3 1 3 3 3 3 3 3 3 - - -
3 3 3 3 3 1 3 3 3 3 3 3 3 - - -
4 3 3 3 3 1 3 3 3 3 3 3 3 - - -
5 3 3 3 3 1 3 3 3 3 3 3 3 - - -
AVg. 3 3 3 3 1 3 3 3 3 3 3 3 - - -
1 - low, 2 - medium, 3 - high, ‘-' - no correlation
Note: The average value of this course to be used for program articulation matrix.

42
ASSESSMENT PATTERN
 One online / app based assessment to test listening /speaking
 End Semester ONLY listening and speaking will be conducted online.
 Proficiency certification is given on successful completion of listening and speaking internal
test and end semester exam.

HS3252 PROFESSIONAL ENGLISH - II L T P C

2 00 2

COURSE OBJECTIVES :
 To engage learners in meaningful language activities to improve their reading and writing
skills
 To learn various reading strategies and apply in comprehending documents in professional
context.
 To help learners understand the purpose, audience, contexts of different types of writing
 To develop analytical thinking skills for problem solving in communicative contexts
 To demonstrate an understanding of job applications and interviews for internship and
placements

UNIT I MAKING COMPARISONS 6

Reading - Reading advertisements, user manuals, brochures; Writing – Professional emails, Email
etiquette - Compare and Contrast Essay; Grammar – Mixed Tenses, Prepositional phrases

UNIT II EXPRESSING CAUSAL RELATIONS IN SPEAKING AND WRITING 6

Reading - Reading longer technical texts– Cause and Effect Essays, and Letters / emails of
complaint, Writing - Writing responses to complaints. Grammar - Active Passive Voice
transformations, Infinitive and Gerunds

UNIT III PROBLEM SOLVING 6

Reading - Case Studies, excerpts from literary texts, news reports etc. Writing – Letter to the Editor,
Checklists, Problem solution essay / Argumentative Essay. Grammar – Error correction; If
conditional sentences

UNIT IV REPORTING OF EVENTS AND RESEARCH 6

Reading –Newspaper articles; Writing – Recommendations, Transcoding, Accident Report, Survey
Report Grammar – Reported Speech, Modals Vocabulary – Conjunctions- use of prepositions

UNIT V THE ABILITY TO PUT IDEAS OR INFORMATION COGENTLY 6

Reading – Company profiles, Statement of Purpose, (SOP), an excerpt of interview with
professionals; Writing – Job / Internship application – Cover letter & Resume; Grammar – Numerical
adjectives, Relative Clauses.
TOTAL : 30 PERIODS
COURSE OUTCOMES:
At the end of the course, learners will be able
CO1:To compare and contrast products and ideas in technical texts.
CO2:To identify and report cause and effects in events, industrial processes through technical texts

43
 CO3:To analyse problems in order to arrive at feasible solutions and communicate them in the
written format.
CO4:To present their ideas and opinions in a planned and logical manner
CO5:To draft effective resumes in the context of job search.

TEXT BOOKS :
1. English for Engineers & Technologists (2020 edition) Orient Blackswan Private Ltd.
Department of English, Anna University.
2. English for Science & Technology Cambridge University Press 2021.
3. Authored by Dr. Veena Selvam, Dr. Sujatha Priyadarshini, Dr. Deepa Mary Francis, Dr. KN.
Shoba, and Dr. Lourdes Joevani, Department of English, Anna University.

REFERENCES:
1. Raman. Meenakshi, Sharma. Sangeeta (2019). Professional English. Oxford university press.
New Delhi.
2. Improve Your Writing ed. V.N. Arora and Laxmi Chandra, Oxford Univ. Press, 2001,
NewDelhi.
3. Learning to Communicate – Dr. V. Chellammal. Allied Publishers, New Delhi, 2003
4. Business Correspondence and Report Writing by Prof. R.C. Sharma & Krishna Mohan, Tata
McGraw Hill & Co. Ltd., 2001, New Delhi.
5. Developing Communication Skills by Krishna Mohan, Meera Bannerji- Macmillan India Ltd.
1990, Delhi.

ASSESSMENT PATTERN
Two internal assessments and an end semester examination to test students’ reading and writing
skills along with their grammatical and lexical competence.

CO’s-PO’s & PSO’s MAPPING

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 3 3 3 3 3 3 3 3 2 3 3 3 - - -
2 3 3 3 3 3 3 3 3 2 3 3 3 - - -
3 3 3 3 3 3 3 3 3 2 3 3 3 - - -
4 3 3 3 3 2 3 3 3 2 3 3 3 - - -
5 - - - - - - - - 3 3 3 3 - - -
AVg. 3 3 3 3 2.75 3 3 3 2.2 3 3 3 - - -
1 - low, 2 - medium, 3 - high, ‘-' - no correlation
Note: The average value of this course to be used for program articulation matrix.

MA3251 STATISTICS AND NUMERICAL METHODS L T P C

3 1 0 4
COURSE OBJECTIVES:
● This course aims at providing the necessary basic concepts of a few statistical and
numerical methods and give procedures for solving numerically different kinds of
problems occurring in engineering and technology.
● To acquaint the knowledge of testing of hypothesis for small and large samples which
plays an important role in real life problems.
● To introduce the basic concepts of solving algebraic and transcendental equations.

44
 ● To introduce the numerical techniques of interpolation in various intervals and numerical
techniques of differentiation and integration which plays an important role in engineering
and technology disciplines.
● To acquaint the knowledge of various techniques and methods of solving ordinary
differential equations.

UNIT I TESTING OF HYPOTHESIS 9+3

Sampling distributions - Tests for single mean, proportion and difference of means (Large and small
samples) – Tests for single variance and equality of variances – Chi square test for goodness of fit
– Independence of attributes.

UNIT II DESIGN OF EXPERIMENTS 9+3

One way and two way classifications - Completely randomized design – Randomized block design
– Latin square design - 22 factorial design.

UNIT III SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS 9+3

Solution of algebraic and transcendental equations - Fixed point iteration method – Newton Raphson
method- Solution of linear system of equations - Gauss elimination method – Pivoting - Gauss
Jordan method – Iterative methods of Gauss Jacobi and Gauss Seidel - Eigenvalues of a matrix by
Power method and Jacobi’s method for symmetric matrices.

UNIT IV INTERPOLATION, NUMERICAL DIFFERENTIATION AND NUMERICAL

INTEGRATION 9 +3
Lagrange’s and Newton’s divided difference interpolations – Newton’s forward and backward
difference interpolation – Approximation of derivates using interpolation polynomials – Numerical
single and double integrations using Trapezoidal and Simpson’s 1/3 rules.

UNIT V NUMERICAL SOLUTION OF ORDINARY DIFFERENTIAL EQUATIONS 9 +3

Single step methods: Taylor’s series method - Euler’s method - Modified Euler’s method - Fourth
order Runge-Kutta method for solving first order differential equations - Multi step methods: Milne’s
and Adams - Bash forth predictor corrector methods for solving first order differential equations.
TOTAL: 60 PERIODS
COURSE OUTCOMES:
Upon successful completion of the course, students will be able to:
CO1:Apply the concept of testing of hypothesis for small and large samples in real life problems.
CO2:Apply the basic concepts of classifications of design of experiments in the field of agriculture.
CO3:Appreciate the numerical techniques of interpolation in various intervals and apply the
numerical techniques of differentiation and integration for engineering problems.
CO4:Understand the knowledge of various techniques and methods for solving first and second
order ordinary differential equations.
CO5:Solve the partial and ordinary differential equations with initial and boundary conditions by
using certain techniques with engineering applications.

TEXT BOOKS:
1. Grewal, B.S., and Grewal, J.S., "Numerical Methods in Engineering and Science", Khanna
Publishers, 10th Edition, New Delhi, 2015.
2. Johnson, R.A., Miller, I and Freund J., “Miller and Freund’s Probability and Statistics for
Engineers", Pearson Education, Asia, 8th Edition, 2015.

45
 REFERENCES:
1. Burden, R.L and Faires, J.D, "Numerical Analysis”, 9th Edition, Cengage Learning, 2016.
2. Devore. J.L., "Probability and Statistics for Engineering and the Sciences”, Cengage
Learning, New Delhi, 8th Edition, 2014.
3. Gerald. C.F. and Wheatley. P.O. "Applied Numerical Analysis” Pearson Education, Asia,
New Delhi, 7th Edition, 2007.
4. Gupta S.C. and Kapoor V. K., “Fundamentals of Mathematical Statistics”, Sultan Chand &
Sons, New Delhi, 12th Edition, 2020.
5. Spiegel. M.R., Schiller. J. and Srinivasan. R.A., "Schaum’s Outlines on Probability and
Statistics ", Tata McGraw Hill Edition, 4th Edition, 2012.
6. Walpole. R.E., Myers. R.H., Myers. S.L. and Ye. K., “Probability and Statistics for Engineers
and Scientists", 9th Edition, Pearson Education, Asia, 2010.
CO’s-PO’s & PSO’s MAPPING
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 1 1 1 0 0 0 2 0 2 3 - - -
CO2 3 3 1 1 1 0 0 0 2 0 2 3 - - -
CO3 3 3 1 1 1 0 0 0 2 0 2 3 - - -
CO4 3 3 1 1 1 0 0 0 2 0 2 3 - - -
CO5 3 3 1 1 1 0 0 0 2 0 2 3 - - -
Avg 3 3 1 1 1 0 0 0 2 0 2 3 - - -
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

PH3256 PHYSICS FOR INFORMATION SCIENCE L T P C

3 0 0 3
COURSE OBJECTIVES:
 To make the students understand the importance in studying electrical properties of
materials.
 To enable the students to gain knowledge in semiconductor physics
 To instill knowledge on magnetic properties of materials.
 To establish a sound grasp of knowledge on different optical properties of materials, optical
displays and applications
 To inculcate an idea of significance of nano structures, quantum confinement, ensuing nano
device applications and quantum computing.

UNIT I ELECTRICAL PROPERTIES OF MATERIALS 9

Classical free electron theory - Expression for electrical conductivity – Thermal conductivity,
expression - Wiedemann-Franz law – Success and failures - electrons in metals – Particle in a
three dimensional box – 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 PHYSICS 9

Intrinsic Semiconductors – Energy band diagram – direct and indirect band gap semiconductors –
Carrier concentration in intrinsic semiconductors – extrinsic semiconductors - 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:

46
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 classification: diamagnetism – paramagnetism – ferromagnetism –
antiferromagnetism – ferrimagnetism – Ferromagnetism: origin and exchange interaction- saturation
magnetization and Curie temperature – Domain Theory- M versus H behaviour – Hard and soft
magnetic materials – examples and uses-– Magnetic principle in computer data storage – Magnetic
hard disc (GMR sensor).

UNIT IV OPTICAL PROPERTIES OF MATERIALS 9

Classification of optical materials – carrier generation and recombination processes - Absorption
emission and scattering of light in metals, insulators and semiconductors (concepts only) - photo
current in a P-N diode – solar cell - LED – Organic LED – Laser diodes – Optical data storage
techniques.

UNIT V NANODEVICES AND QUANTUM COMPUTING 9

Introduction - quantum confinement – quantum structures: quantum wells, wires and dots –– band
gap of nanomaterials. Tunneling – Single electron phenomena: Coulomb blockade - resonant-
tunneling diode – single electron transistor – quantum cellular automata - Quantum system for
information processing - quantum states – classical bits – quantum bits or qubits –CNOT gate -
multiple qubits – Bloch sphere – quantum gates – advantage of quantum computing over classical
computing.
TOTAL :45 PERIODS
COURSE OUTCOMES:
At the end of the course, the students should be able to
CO1:gain knowledge on classical and quantum electron theories, and energy band structures
CO2:acquire knowledge on basics of semiconductor physics and its applications in various devices
CO3:get knowledge on magnetic properties of materials and their applications in data storage,
CO4:have the necessary understanding on the functioning of optical materials for optoelectronics
CO5:understand the basics of quantum structures and their applications and basics of quantum
computing

TEXT BOOKS:
1. Jasprit Singh, “Semiconductor Devices: Basic Principles”, Wiley (Indian Edition), 2007.
2. S.O. Kasap. Principles of Electronic Materials and Devices, McGraw-Hill Education (Indian
Edition), 2020.
3. Parag K. Lala, Quantum Computing: A Beginner's Introduction, McGraw-Hill Education (Indian
Edition), 2020.

REFERENCES:
1. Charles Kittel, Introduction to Solid State Physics, Wiley India Edition, 2019.
2. Y.B.Band and Y.Avishai, Quantum Mechanics with Applications to Nanotechnology and
3. Information Science, Academic Press, 2013.
4. V.V.Mitin, V.A. Kochelap and M.A.Stroscio, Introduction to Nanoelectronics, Cambridge
Univ.Press, 2008.
5. G.W. Hanson, Fundamentals of Nanoelectronics, Pearson Education (Indian Edition) 2009.

47
6. B.Rogers, J.Adams and S.Pennathur, Nanotechnology: Understanding Small Systems, CRC
Press, 2014.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 - - - - - - - - - - - - -
2 3 1 2 - - - - - - - - - - - -
3 3 - - 1 2 1 1 - - - - - - - -
4 3 - 2 1 3 - 1 - - - - - - - -
5 3 2 2 2 2 1 2 - - - - 2 - - -
AVG 3 1.3 2 1.3 2.3 1 1.3 - - - - 2 - - -
1-Low,2-Medium,3-High,”-“-no correlation
Note: the average value of this course to be used for program articulation matrix.

BE3251 BASIC ELECTRICAL AND ELECTRONICS ENGINEERING L T P C

3 0 0 3
COURSE OBJECTIVES:
 To introduce the basics of electric circuits and analysis
 To impart knowledge in the basics of working principles and application of electrical
machines
 To introduce analog devices and their characteristics
 To educate on the fundamental concepts of digital electronics
 To introduce the functional elements and working of measuring instruments

UNIT I ELECTRICAL CIRCUITS 9

DC Circuits: Circuit Components: Conductor, Resistor, Inductor, Capacitor – Ohm’s Law - Kirchhoff’s
Laws –Independent and Dependent Sources – Simple problems- Nodal Analysis, Mesh analysis
with Independent sources only (Steady state)
Introduction to AC Circuits and Parameters: Waveforms, Average value, RMS Value, Instantaneous
power, real power, reactive power and apparent power, power factor – Steady state analysis of RLC
circuits (Simple problems only)

UNIT II ELECTRICAL MACHINES 9

Construction and Working principle- DC Separately and Self excited Generators, EMF equation,
Types and Applications. Working Principle of DC motors, Torque Equation, Types and Applications.
Construction, Working principle and Applications of Transformer, Three phase Alternator,
Synchronous motor and Three Phase Induction Motor.

UNIT III ANALOG ELECTRONICS 9

Resistor, Inductor and Capacitor in Electronic Circuits- Semiconductor Materials: Silicon
&Germanium – PN Junction Diodes, Zener Diode –Characteristics Applications – Bipolar Junction
Transistor-Biasing, JFET, SCR, MOSFET,IGBT – Types, I-V Characteristics and Applications,
Rectifier and Inverters

48
 UNIT IV DIGITAL ELECTRONICS 9
Review of number systems, binary codes, error detection and correction codes, Combinational logic
- representation of logic functions-SOP and POS forms, K-map representations - minimization using
K maps (Simple Problems only).

UNIT V MEASUREMENTS AND INSTRUMENTATION 9

Functional elements of an instrument, Standards and calibration, Operating Principle, types -Moving
Coil and Moving Iron meters, Measurement of three phase power, Energy Meter, Instrument
Transformers-CT and PT, DSO- Block diagram- Data acquisition.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
After completing this course, the students will be able to
CO1: Compute the electric circuit parameters for simple problems
CO2: Explain the working principle and applications of electrical machines
CO3: Analyze the characteristics of analog electronic devices
CO4: Explain the basic concepts of digital electronics
CO5: Explain the operating principles of measuring instruments

TEXT BOOKS:
1. Kothari DP and I.J Nagrath, “Basic Electrical and Electronics Engineering”, Second Edition,
McGraw Hill Education, 2020
2. S.K.Bhattacharya “Basic Electrical and Electronics Engineering”, Pearson Education, Second
Edition, 2017.
3. Sedha R.S., “A textbook book of Applied Electronics”, S. Chand & Co., 2008
4. James A .Svoboda, Richard C. Dorf, “Dorf’s Introduction to Electric Circuits”, Wiley, 2018.
5. A.K. Sawhney, Puneet Sawhney ‘A Course in Electrical & Electronic Measurements &
Instrumentation’, Dhanpat Rai and Co, 2015.

REFERENCES:
1. Kothari DP and I.J Nagrath, “Basic Electrical Engineering”, Fourth Edition, McGraw Hill
2. Education, 2019.
3. Thomas L. Floyd, ‘Digital Fundamentals’, 11th Edition, Pearson Education, 2017.
4. 4. Albert Malvino, David Bates, ‘Electronic Principles, McGraw Hill Education; 7th edition,
2017.
5. Mahmood Nahvi and Joseph A. Edminister, “Electric Circuits”, Schaum’ Outline Series, McGraw
Hill, 2002.
6. H.S. Kalsi, ‘Electronic Instrumentation’, Tata McGraw-Hill, New Delhi, 2010

CO’s-PO’s & PSO’s MAPPING

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 2 2 1 - - - - 1 - - - 2 - - 1
2 2 2 1 - - - - 1 - - - 2 - - 1
3 2 1 1 - - - - 1 - - - 2 - - 1
4 2 2 1 - - - - 1 - - - 2 - - 1
5 2 2 1 - - - - 1 - - - 2 - - 1
CO 2 1.8 1 - - - - 1 - - - 2 - - 1
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

49
GE3251 ENGINEERING GRAPHICS L T P C
2 0 4 4
COURSE OBJECTIVES:
The main learning objective of this course is to prepare the students for:
• Drawing engineering curves.
• Drawing a freehand sketch of simple objects.
• Drawing orthographic projection of solids and section of solids.
• Drawing development of solids
• Drawing isometric and perspective projections of simple solids.

CONCEPTS AND CONVENTIONS (Not for Examination)

Importance of graphics in engineering applications — Use of drafting instruments — BIS
conventions and specifications — Size, layout and folding of drawing sheets — Lettering and
dimensioning.

UNIT I PLANE CURVES 6+12

Basic Geometrical constructions, Curves used in engineering practices: Conics — Construction of
ellipse, parabola and hyperbola by eccentricity method — Construction of cycloid — construction of
involutes of square and circle — Drawing of tangents and normal to the above curves.

UNIT II PROJECTION OF POINTS, LINES AND PLANE SURFACE 6+12

Orthographic projection- principles-Principal planes-First angle projection-projection of points.
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 and traces. Projection of
planes (polygonal and circular surfaces) inclined to both the principal planes by rotating object
method.

UNIT III PROJECTION OF SOLIDS AND FREEHAND SKETCHING 6+12

Projection of simple solids like prisms, pyramids, cylinder, cone and truncated solids when the axis
is inclined to one of the principal planes and parallel to the other by rotating object method.
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.
Practicing three dimensional modeling of simple objects by CAD Software (Not for examination)

UNIT IV PROJECTION OF SECTIONED SOLIDS AND DEVELOPMENT OF

SURFACES 6 +12
Sectioning of above solids 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 sectioned solids — Prisms, pyramids cylinders and cones.
Practicing three dimensional modeling of simple objects by CAD Software (Not for examination)

UNIT V ISOMETRIC AND PERSPECTIVE PROJECTIONS 6+12

Principles of isometric projection — isometric scale — isometric projections of simple solids and
truncated solids - Prisms, pyramids, cylinders, cones- combination of two solid objects in simple
vertical positions - Perspective projection of simple solids - Prisms, pyramids and cylinders by visual
ray method.

50
Practicing three dimensional modeling of isometric projection of simple objects by CAD Software
(Not for examination)
TOTAL: (L=30+P=60) 90 PERIODS
COURSE OUTCOMES:
On successful completion of this course, the student will be able to
CO1:Use BIS conventions and specifications for engineering drawing.
CO2:Construct the conic curves, involutes and cycloid.
CO3:Solve practical problems involving projection of lines.
CO4:Draw the orthographic, isometric and perspective projections of simple solids.
CO5:Draw the development of simple solids.

TEXT BOOK:
1. Bhatt N.D. and Panchal V.M., “Engineering Drawing”, Charotar Publishing House, 53rd
Edition, 2019.
2. Natarajan K.V., “A Text Book of Engineering Graphics”, Dhanalakshmi Publishers, Chennai,
2018.
3. Parthasarathy, N. S. and Vela Murali, “Engineering Drawing”, Oxford University Press, 2015

REFERENCES:
1. Basant Agarwal and Agarwal C.M., “Engineering Drawing”, McGraw Hill, 2nd Edition, 2019.
2. Gopalakrishna K.R., “Engineering Drawing” (Vol. I&II combined), Subhas Publications,
Bangalore, 27th Edition, 2017.
3. 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.
4. Parthasarathy N. S. and Vela Murali, “Engineering Graphics”, Oxford University, Press, New
Delhi, 2015.
5. Shah M.B., and Rana B.C., “Engineering Drawing”, Pearson Education India, 2nd Edition,
2009.
6. Venugopal K. and Prabhu Raja V., “Engineering Graphics", New Age International (P)
Limited, 2008.

Publication of Bureau of Indian Standards:

1. IS 10711 — 2001: Technical products Documentation — Size and layout of drawing sheets.
2. IS 9609 (Parts 0 & 1) — 2001: Technical products Documentation — Lettering.
3. IS 10714 (Part 20) — 2001 & SP 46 — 2003: Lines for technical drawings.
4. IS 11669 — 1986 & SP 46 —2003: Dimensioning of Technical Drawings.
5. IS 15021 (Parts 1 to 4) — 2001: Technical drawings — Projection Methods.

Special points applicable to University Examinations on Engineering Graphics:

1. There will be five questions, each of either or type covering all units of the syllabus.
2. All questions will carry equal marks of 20 each making a total of 100.
3. The answer paper shall consist of drawing sheets of A3 size only. The students will be
permitted to use appropriate scale to fit a solution within A3 size.
4. The examination will be conducted in appropriate sessions on the same day

51
 CO’s-PO’s & PSO’s MAPPING
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 3 1 2 - 2 - - - - 3 - 2 2 2 -
2 3 1 2 - 2 - - - - 3 - 2 2 2 -
3 3 1 2 - 2 - - - - 3 - 2 2 2 -
4 3 1 2 - 2 - - - - 3 - 2 2 2 -
5 3 1 2 - 2 - - - - 3 - 2 2 2 -
CO 3 1 2 - 2 - - - - 3 - 2 2 2 -
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CS3251 PROGRAMMING IN C L T P C
3 0 0 3
COURSE OBJECTIVES:
 To understand the constructs of C Language.
 To develop C Programs using basic programming constructs
 To develop C programs using arrays and strings
 To develop modular applications in C using functions
 To develop applications in C using pointers and structures
 To do input/output and file handling in C
UNIT I BASICS OF C PROGRAMMING 9
Introduction to programming paradigms – Applications of C Language - Structure of C program - C
programming: Data Types - Constants – Enumeration Constants - Keywords – Operators:
Precedence and Associativity - Expressions - Input/Output statements, Assignment statements –
Decision making statements - Switch statement - Looping statements – Preprocessor directives -
Compilation process

UNIT II ARRAYS AND STRINGS 9

Introduction to Arrays: Declaration, Initialization – One dimensional array –Two dimensional
arrays - String operations: length, compare, concatenate, copy – Selection sort, linear and binary
search.

UNIT III FUNCTIONS AND POINTERS 9

Modular programming - Function prototype, function definition, function call, Built-in functions (string
functions, math functions) – Recursion, Binary Search using recursive functions –Pointers –
Pointer operators – Pointer arithmetic – Arrays and pointers – Array of pointers – Parameter passing:
Pass by value, Pass by reference.

UNIT IV STRUCTURES AND UNION 9

Structure - Nested structures – Pointer and Structures – Array of structures – Self referential
structures – Dynamic memory allocation - Singly linked list – typedef – Union - Storage classes and
Visibility.

UNIT V FILE PROCESSING 9

Files – Types of file processing: Sequential access, Random access – Sequential access file -
Random access file - Command line arguments.

52
 COURSE OUTCOMES:
Upon completion of the course, the students will be able to
CO1: Demonstrate knowledge on C Programming constructs
CO2: Develop simple applications in C using basic constructs
CO3: Design and implement applications using arrays and strings
CO4: Develop and implement modular applications in C using functions.
CO5: Develop applications in C using structures and pointers.
CO6: Design applications using sequential and random access file processing.
TOTAL : 45 PERIODS
TEXT BOOKS:
1. ReemaThareja, “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, 2015.
REFERENCES:
1. Paul Deitel and Harvey Deitel, “C How to Program with an Introduction to C++”, Eighth edition,
Pearson Education, 2018.
2. Yashwant Kanetkar, Let us C, 17th Edition, BPB Publications, 2020.
3. Byron S. Gottfried, “Schaum’s Outline of Theory and Problems of Programming with C”,
McGraw-Hill Education, 1996.
4. Pradip Dey, Manas Ghosh, “Computer Fundamentals and Programming in C”, Second
5. Edition, Oxford University Press, 2013.
6. Anita Goel and Ajay Mittal, “Computer Fundamentals and Programming in C”, 1st Edition,
Pearson Education, 2013.

CO’s-PO’s & PSO’s MAPPING

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 1 2 2 1 2 1 1 1 2 - 3 2 1 2 -
2 2 2 2 1 2 1 1 1 2 - 3 3 2 2 -
3 2 3 2 1 2 1 1 1 2 - 3 2 2 2 -
4 3 2 2 1 3 1 1 1 2 - 3 3 2 2 -
5 2 3 3 1 2 1 2 1 2 - 3 2 2 3 -
6 2 2 3 2 1 2 - - 2 1 2 2 2 2
CO 2 2 2 1 2 1 1 1 2 - 3 2 2 2 -

1 - low, 2 - medium, 3 - high, ‘-' - no correlation

53
GE3252 TAMILS AND TECHNOLOGY L T PC
1 0 01

UNIT I WEAVING AND CERAMIC TECHNOLOGY 3

Weaving Industry during Sangam Age – Ceramic technology – Black and Red Ware Potteries
(BRW) – Graffiti on Potteries.

UNIT II DESIGN AND CONSTRUCTION TECHNOLOGY 3

Designing and Structural construction House & Designs in household materials during Sangam
Age - Building materials and Hero stones of Sangam age – Details of Stage Constructions in
Silappathikaram - Sculptures and Temples of Mamallapuram - Great Temples of Cholas and other
worship places - Temples of Nayaka Period - Type study (Madurai Meenakshi Temple)- Thirumalai
Nayakar Mahal - Chetti Nadu Houses, Indo - Saracenic architecture at Madras during British
Period.

UNIT III MANUFACTURING TECHNOLOGY 3

Art of Ship Building - Metallurgical studies - Iron industry - Iron smelting, steel -Copper and gold-
Coins as source of history - Minting of Coins – Beads making-industries Stone beads -Glass beads
- Terracotta beads -Shell beads/ bone beats - Archeological evidences - Gem stone types
described in Silappathikaram.

UNIT IV AGRICULTURE AND IRRIGATION TECHNOLOGY 3

Dam, Tank, ponds, Sluice, Significance of Kumizhi Thoompu of Chola Period, Animal Husbandry
- Wells designed for cattle use - Agriculture and Agro Processing - Knowledge of Sea - Fisheries –
Pearl - Conche diving - Ancient Knowledge of Ocean - Knowledge Specific Society.

UNIT V SCIENTIFIC TAMIL & TAMIL COMPUTING 3

Development of Scientific Tamil - Tamil computing – Digitalization of Tamil Books – Development
of Tamil Software – Tamil Virtual Academy – Tamil Digital Library – Online Tamil Dictionaries –
Sorkuvai Project.
TOTAL : 15 PERIODS

TEXT-CUM-REFERENCE BOOKS
1. தமிழக வரலொறு – மக்களும் பண்பொடும் – கக.கக. பிள் ளள (தவளியீடு:
தமிழ் நொடு பொடநூல் மற் றும்
கல் வியியல் பணிகள் கழகம் ).
2. கணினித் தமிழ் – முளனவர் இல. சுந்தரம் . (விகடன் பிரசுரம் ).
3. கீழடி – ளவளக நதிக்களரயில் சங் ககொல நகர நொகரிகம் (ததொல் லியல் துளற
தவளியீடு)
4. தபொருளந – ஆற் றங் களர நொகரிகம் . (ததொல் லியல் துளற தவளியீடு)
5. Social Life of Tamils (Dr.K.K.Pillay) A joint publication of TNTB & ESC and RMRL – (in print)
6. Social Life of the Tamils - The Classical Period (Dr.S.Singaravelu) (Published by: International
Institute of Tamil Studies.
7. Historical Heritage of the Tamils (Dr.S.V.Subatamanian, Dr.K.D. Thirunavukkarasu)
(Published by: International Institute of Tamil Studies).
8. The Contributions of the Tamils to Indian Culture (Dr.M.Valarmathi) (Published by: International

54
 Institute of Tamil Studies.)
9. Keeladi - ‘Sangam City C ivilization on the banks of river Vaigai’ (Jointly Published by:
Department of Archaeology & Tamil Nadu Text Book and Educational Services Corporation,
Tamil Nadu)
10. Studies in the History of India with Special Reference to Tamil Nadu (Dr.K.K.Pillay) (Published
by: The Author)
11. Porunai Civilization (Jointly Published by: Department of Archaeology & Tamil Nadu Text Book
and Educational Services Corporation, Tamil Nadu)
12. Journey of Civilization Indus to Vaigai (R.Balakrishnan) (Published by: RMRL) – Reference
Book.

GE3252 தமிழரும் மதொழில் நுட்பமும் L T PC

1 0 0 1

அலகு I மநசவு மற் றும் பொறனத் மதொழில் நுட்பம் : 3

சங் க கொலத்தில் தநசவுத் ததொழில் – பொளனத் ததொழில் நுட்பம் - கருப் பு சிவப்பு
பொண்டங் கள் – பொண்டங் களில் கீறல் குறியீடுகள் .

அலகு II வடிவறமப் பு மற் றும் கட்டிடத் மதொழில் நுட்பம் : 3

சங் க கொலத்தில் வடிவளமப் பு மற் றும் கட்டுமொனங் கள் & சங் க கொலத்தில் வீட்டுப்
தபொருட்களில் வடிவளமப் பு- சங் க கொலத்தில் கட்டுமொன தபொருட்களும் நடுகல் லும்
– சிலப் பதிகொரத்தில் கமளட அளமப் பு பற் றிய விவரங் கள் - மொமல் லபுரச்
சிற் பங் களும் , ககொவில் களும் – கசொழர் கொலத்துப் தபருங் ககொயில் கள் மற் றும் பிற
வழிபொட்டுத் தலங் கள் – நொயக்கர் கொலக் ககொயில் கள் - மொதிரி கட்டளமப் புகள்
பற் றி அறிதல் , மதுளர மீனொட்சி அம் மன் ஆலயம் மற் றும் திருமளல நொயக்கர்
மஹொல் – தசட்டிநொட்டு வீடுகள் – பிரிட்டிஷ் கொலத்தில் தசன்ளனயில் இந்கதொ-
சொகரொதசனிக் கட்டிடக் களல.

அலகு III உற் பத்தித் மதொழில் நுட்பம் : 3

கப் பல் கட்டும் களல – உகலொகவியல் – இரும் புத் ததொழிற் சொளல – இரும் ளப
உருக்குதல் , எஃகு – வரலொற் றுச் சொன்றுகளொக தசம் பு மற் றும் தங் க நொணயங் கள் –
நொணயங் கள் அச்சடித்தல் – மணி உருவொக்கும் ததொழிற் சொளலகள் – கல் மணிகள் ,
கண்ணொடி மணிகள் – சுடுமண் மணிகள் – சங் கு மணிகள் – எலும் புத்துண்டுகள் –
ததொல் லியல் சொன்றுகள் – சிலப் பதிகொரத்தில் மணிகளின் வளககள் .

அலகு IV கவளொை்றம மற் றும் நீ ர்ப்பொசனத் மதொழில் நுட்பம் : 3

அளண, ஏரி, குளங் கள் , மதகு – கசொழர்கொலக் குமுழித் தூம் பின் முக்கியத்துவம் –
கொல் நளட பரொமரிப் பு – கொல் நளடகளுக்கொக வடிவளமக்கப் பட்ட கிணறுகள் –
கவளொண்ளம மற் றும் கவளொண்ளமச் சொர்ந்த தசயல் பொடுகள் – கடல் சொர் அறிவு –
மீன்வளம் – முத்து மற் றும் முத்துக்குளித்தல் – தபருங் கடல் குறித்த பண்ளடய
அறிவு – அறிவுசொர் சமூகம் .

55
அலகு V அறிவியல் தமிழ் மற் றும் கைித்தமிழ் : 3
அறிவியல் தமிழின் வளர்ச்சி –கணித்தமிழ் வளர்ச்சி - தமிழ் நூல் களள மின்பதிப்பு
தசய் தல் – தமிழ் தமன்தபொருட்கள் உருவொக்கம் – தமிழ் இளணயக் கல் விக்கழகம்
– தமிழ் மின் நூலகம் – இளணயத்தில் தமிழ் அகரொதிகள் – தசொற் குளவத் திட்டம் .
TOTAL : 15 PERIODS

TEXT-CUM-REFERENCE BOOKS
1. தமிழக வரலொறு – மக்களும் பண்பொடும் – கக.கக. பிள் ளள (தவளியீடு:
தமிழ் நொடு பொடநூல் மற் றும்
கல் வியியல் பணிகள் கழகம் ).
2. கணினித் தமிழ் – முளனவர் இல. சுந்தரம் . (விகடன் பிரசுரம் ).
3. கீழடி – ளவளக நதிக்களரயில் சங் ககொல நகர நொகரிகம் (ததொல் லியல் துளற
தவளியீடு)
4. தபொருளந – ஆற் றங் களர நொகரிகம் . (ததொல் லியல் துளற தவளியீடு)
5. Social Life of Tamils (Dr.K.K.Pillay) A joint publication of TNTB & ESC and RMRL – (in print)
6. Social Life of the Tamils - The Classical Period (Dr.S.Singaravelu) (Published by: International
Institute of Tamil Studies.
7. Historical Heritage of the Tamils (Dr.S.V.Subatamanian, Dr.K.D. Thirunavukkarasu)
(Published by: International Institute of Tamil Studies).
8. The Contributions of the Tamils to Indian Culture (Dr.M.Valarmathi) (Published by: International
Institute of Tamil Studies.)
9. Keeladi - ‘Sangam City C ivilization on the banks of river Vaigai’ (Jointly Published by:
Department of Archaeology & Tamil Nadu Text Book and Educational Services Corporation,
Tamil Nadu)
10. Studies in the History of India with Special Reference to Tamil Nadu (Dr.K.K.Pillay) (Published
by: The Author)
11. Porunai Civilization (Jointly Published by: Department of Archaeology & Tamil Nadu Text Book
and Educational Services Corporation, Tamil Nadu)
Journey of Civilization Indus to Vaigai (R.Balakrishnan) (Published by: RMRL) – Reference
Book.

56
NX3251 NCC Credit Course Level 1*
(ARMY WING)
NCC Credit Course Level - I L T P C
2 0 0 2

NCC GENERAL 6
NCC 1 Aims, Objectives & Organization of NCC 1
NCC 2 Incentives 2
NCC 3 Duties of NCC Cadet 1
NCC 4 NCC Camps: Types & Conduct 2

NATIONAL INTEGRATION AND AWARENESS 4

NI 1 National Integration: Importance & Necessity 1
NI 2 Factors Affecting National Integration 1
NI 3 Unity in Diversity & Role of NCC in Nation Building 1
NI 4 Threats to National Security 1

PERSONALITY DEVELOPMENT 7
Self-Awareness, Empathy, Critical & Creative Thinking,
PD 1 2
Decision Making and Problem Solving
PD 2 Communication Skills 3
PD 3 Group Discussion: Stress & Emotions 2

LEADERSHIP 5
Leadership Capsule: Traits, Indicators, Motivation, Moral
L1 3
Values, Honour Code
L2 Case Studies: Shivaji, Jhasi Ki Rani 2

SOCIAL SERVICE AND COMMUNITY DEVELOPMENT 8

Basics, Rural Development Programmes, NGOs, Contribution
SS 1 3
of Youth
SS 4 Protection of Children and Women Safety 1
SS 5 Road / Rail Travel Safety 1
SS 6 New Initiatives 2
SS 7 Cyber and Mobile Security Awareness 1

TOTAL: 30 PERIODS

57
NX3252 NCC Credit Course Level 1*
(NAVAL WING)
NCC Credit Course Level - I L T P C
2 0 0 2
NCC GENERAL 6
NCC 1 Aims, Objectives & Organization of NCC 1
NCC 2 Incentives 2
NCC 3 Duties of NCC Cadet 1
NCC 4 NCC Camps: Types & Conduct 2

NATIONAL INTEGRATION AND AWARENESS 4

NI 1 National Integration: Importance & Necessity 1
NI 2 Factors Affecting National Integration 1
NI 3 Unity in Diversity & Role of NCC in Nation Building 1
NI 4 Threats to National Security 1

PERSONALITY DEVELOPMENT 7
Self-Awareness, Empathy, Critical & Creative Thinking, Decision
PD 1 2
Making and Problem Solving
PD 2 Communication Skills 3
PD 3 Group Discussion: Stress & Emotions 2

LEADERSHIP 5
Leadership Capsule: Traits, Indicators, Motivation, Moral Values,
L1 3
Honour Code
L2 Case Studies: Shivaji, Jhasi Ki Rani 2

SOCIAL SERVICE AND COMMUNITY DEVELOPMENT 8

Basics, Rural Development Programmes, NGOs, Contribution of
SS 1 3
Youth
SS 4 Protection of Children and Women Safety 1
SS 5 Road / Rail Travel Safety 1
SS 6 New Initiatives 2
SS 7 Cyber and Mobile Security Awareness 1

TOTAL : 30 PERIODS

58
NX3253 NCC Credit Course Level 1*
(AIR FORCE WING)
NCC Credit Course Level - I L T P C
2 0 0 2
NCC GENERAL 6
NCC 1 Aims, Objectives & Organization of NCC 1
NCC 2 Incentives 2
NCC 3 Duties of NCC Cadet 1
NCC 4 NCC Camps: Types & Conduct 2

NATIONAL INTEGRATION AND AWARENESS 4

NI 1 National Integration: Importance & Necessity 1
NI 2 Factors Affecting National Integration 1
NI 3 Unity in Diversity & Role of NCC in Nation Building 1
NI 4 Threats to National Security 1

PERSONALITY DEVELOPMENT 7
PD 1 Self-Awareness, Empathy, Critical & Creative Thinking, Decision
2
Making and Problem Solving
PD 2 Communication Skills 3
PD 3 Group Discussion: Stress & Emotions 2

LEADERSHIP 5
Leadership Capsule: Traits, Indicators, Motivation, Moral Values,
L1 3
Honour Code
L2 Case Studies: Shivaji, Jhasi Ki Rani 2

SOCIAL SERVICE AND COMMUNITY DEVELOPMENT 8

Basics, Rural Development Programmes, NGOs, Contribution of
SS 1 3
Youth
SS 4 Protection of Children and Women Safety 1
SS 5 Road / Rail Travel Safety 1
SS 6 New Initiatives 2
SS 7 Cyber and Mobile Security Awareness 1

TOTAL : 30 PERIODS

59
GE3271 ENGINEERING PRACTICES LABORATORY LTPC
0 042

COURSE OBJECTIVES:
The main learning objective of this course is to provide hands on training to the
students in:
1. Drawing pipe line plan; laying and connecting various pipe fittings used in common
household plumbing work; Sawing; planing; making joints in wood materials used in
commonhousehold wood work.

2. Wiring various electrical joints in common household electrical wire work.

3. Welding various joints in steel plates using arc welding work; Machining various
simple processes like turning, drilling, tapping in parts; Assembling simple mechanical
assembly of common household equipments; Making a tray out of metal sheet using
sheet metal work.

4. Soldering and testing simple electronic circuits; Assembling and testing simple
electronic components on PCB.

GROUP – A (CIVIL & ELECTRICAL)

PART I CIVIL ENGINEERING PRACTICES 15

PLUMBING WORK:
a) Connecting various basic pipe fittings like valves, taps, coupling, unions,
reducers,elbows and other components which are commonly used in
household.

b) Preparing plumbing line sketches.

c) Laying pipe connection to the suction side of a pump

d) Laying pipe connection to the delivery side of a pump.

e) Connecting pipes of different materials: Metal, plastic and flexible pipes

used inhousehold appliances.

WOOD WORK:
a) Sawing,

b) Planing and

c) Making joints like T-Joint, Mortise joint and Tenon joint and Dovetail joint.

Wood Work Study:

a) Studying joints in door panels and wooden furniture

b) Studying common industrial trusses using models.

60
PART II ELECTRICAL ENGINEERING PRACTICES 15

a) Introduction to switches, fuses, indicators and lamps - Basic switch board

wiring with lamp, fan and three pin socket
b) Staircase wiring
c) Fluorescent Lamp wiring with introduction to CFL and LED types.
d) Energy meter wiring and related calculations/ calibration
e) Study of Iron Box wiring and assembly
f) Study of Fan Regulator (Resistor type and Electronic type using
Diac/Triac/quadrac)
g) Study of emergency lamp wiring/Water heater

GROUP – B (MECHANICAL AND ELECTRONICS)

PART III MECHANICAL ENGINEERING PRACTICES 15

WELDING WORK:
a) Welding of Butt Joints, Lap Joints, and Tee Joints using arc welding.

b) Practicing gas welding.

BASIC MACHINING WORK:

a) (simple)Turning.

b) (simple)Drilling.

c) (simple)Tapping.

ASSEMBLY WORK:
a) Assembling a centrifugal pump.

b) Assembling a household mixer.

c) Assembling an airconditioner.

SHEET METAL WORK:

a) Making of a square tray

FOUNDRY WORK:
a) Demonstrating basic foundry operations.

PART IV ELECTRONIC ENGINEERING PRACTICES 15

SOLDERING WORK:
a) Soldering simple electronic circuits and checking continuity.

ELECTRONIC ASSEMBLY AND TESTING WORK:

a) Assembling and testing electronic components on a small PCB.

61
 ELECTRONIC EQUIPMENT STUDY:
a) Study an elements of smart phone..

b) Assembly and dismantle of LED TV.

c) Assembly and dismantle of computer/ laptop

TOTAL : 60 PERIODS
COURSE OUTCOMES:
Upon completion of this course, the students will be able to:
CO1:Draw pipe line plan; lay and connect various pipe fittings used in common household plumbing
work; Saw; plan; make joints in wood materials used in common household wood work.
CO2:Wire various electrical joints in common household electrical wire work.
CO3:Weld various joints in steel plates using arc welding work; Machine various simple processes
like turning, drilling, tapping in parts; Assemble simple mechanical assembly of common household
equipments; Make a tray out of metal sheet using sheet metal work.
CO4:Solder and test simple electronic circuits; Assemble and test simple electronic components on
PCB.
CO’s-PO’s & PSO’s MAPPING
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 3 2 - - 1 1 1 - - - - 2 2 1 1
2 3 2 - - 1 1 1 - - - - 2 2 1 1
3 3 2 - - 1 1 1 - - - - 2 2 1 1
CO 3 2 - - 1 1 1 - - - - 2 2 1 1

1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CS3271 PROGRAMMING IN C LABORATORY LT P C

0 0 4 2
COURSE OBJECTIVES:
 To familiarise with C programming constructs.
 To develop programs in C using basic constructs.
 To develop programs in C using arrays.
 To develop applications in C using strings, pointers, functions.
 To develop applications in C using structures.
 To develop applications in C using file processing.

LIST OF EXPERIMENTS:
Note: The lab instructor is expected to design problems based on the topics listed. The
Examination shall not be restricted to the sample experiments designed.
1. I/O statements, operators, expressions
2. decision-making constructs: if-else, goto, switch-case, break-continue
3. Loops: for, while, do-while
4. Arrays: 1D and 2D, Multi-dimensional arrays, traversal
5. Strings: operations
6. Functions: call, return, passing parameters by (value, reference), passing arrays to function.
7. Recursion
62
 8. Pointers: Pointers to functions, Arrays,Strings, Pointers to Pointers, Array of Pointers
9. Structures: Nested Structures, Pointers to Structures, Arrays of Structures and Unions.
10. Files: reading and writing, File pointers, file operations, random access, processor directives.
TOTAL: 60 PERIODS
COURSE OUTCOMES:
Upon completion of the course, the students will be able to
CO1: Demonstrate knowledge on C programming constructs.
CO2: Develop programs in C using basic constructs.
CO3: Develop programs in C using arrays.
CO4: Develop applications in C using strings, pointers, functions.
CO5: Develop applications in C using structures.
CO6: Develop applications in C using file processing.

TEXT BOOKS:
1. ReemaThareja, “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, 2015.

REFERENCES:
1. Paul Deitel and Harvey Deitel, “C How to Program with an Introduction to C++”, Eighth
edition, Pearson Education, 2018.
2. Yashwant Kanetkar, Let us C, 17th Edition, BPB Publications, 2020.
3. Byron S. Gottfried, "Schaum's Outline of Theory and Problems of Programming with C",
McGraw-Hill Education, 1996.
4. Pradip Dey, Manas Ghosh, “Computer Fundamentals and Programming in C”, Second
5. Edition, Oxford University Press, 2013.
6. Anita Goel and Ajay Mittal, “Computer Fundamentals and Programming in C”, 1st
Edition, Pearson Education, 2013.
CO’s-PO’s & PSO’s MAPPING
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 1 3 3 1 1 1 - - 2 1 2 2 2 2
2 2 3 3 2 1 1 - - 2 1 2 2 2 3
3 2 2 2 1 1 2 - - 2 - 2 2 2 2
4 2 2 2 2 1 2 - - 3 - 3 3 3 2
5 2 2 3 2 3 2 - - 3 - 3 3 3 3
6 2 2 3 2 1 2 - - 2 1 2 2 2 2
Avg 2 2 3 2 1 2 - - 2 1 2 2 2 2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

GE3272 COMMUNICATION LABORATORY LT P C

0 0 4 2
COURSE OBJECTIVES
 To identify varied group discussion skills and apply them to take part in effective discussions
in a professional context.
 To analyse concepts and problems and make effective presentations explaining them clearly
and precisely.
 To be able to communicate effectively through formal and informal writing.
63
  To be able to use appropriate language structures to write emails, reports and essays
 To give instructions and recommendations that are clear and relevant to the context
UNIT I 12
Speaking-Role Play Exercises Based on Workplace Contexts, - talking about competition-
discussing progress toward goals-talking about experiences- talking about events in life- discussing
past events-Writing: writing emails ( formal & semi-formal).

UNIT II 12
Speaking: discussing news stories-talking about frequency-talking about travel problems-
discussing travel procedures- talking about travel problems- making arrangements-describing
arrangements-discussing plans and decisions- discussing purposes and reasons- understanding
common technology terms-Writing: - writing different types of emails.

UNIT III 12
Speaking: discussing predictions-describing the climate-discussing forecasts and scenarios- talking
about purchasing-discussing advantages and disadvantages- making comparisons- discussing likes
and dislikes- discussing feelings about experiences-discussing imaginary scenarios Writing: short
essays and reports-formal/semi-formal letters.

UNIT IV 12
Speaking: discussing the natural environment-describing systems-describing position and
movement- explaining rules-( example- discussing rental arrangements)- understanding technical
instructions-Writing: writing instructions-writing a short article.

UNIT V 12
Speaking: describing things relatively-describing clothing-discussing safety issues (making
recommendations) talking about electrical devices-describing controlling actions- Writing:
job application( Cover letter + Curriculum vitae)-writing recommendations.
TOTAL: 60 PERIODS
COURSE OUTCOMES
CO1:Speak effectively in group discussions held in a formal/semi formal contexts.
CO2:Discuss, analyse and present concepts and problems from various perspectives to arrive at
suitable solutions
CO3:Write emails, letters and effective job applications.
CO4:Write critical reports to convey data and information with clarity and precision
CO5:Give appropriate instructions and recommendations for safe execution of tasks
Assessment Pattern
 One online / app based assessment to test speaking and writing skills
 Proficiency certification is given on successful completion of speaking and writing.
CO’s-PO’s & PSO’s MAPPING
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 2 3 3 3 1 3 3 3 3 3 3 3 - - -
2 2 3 3 3 1 3 3 3 3 3 3 3 - - -
3 2 2 3 3 1 3 3 3 3 3 3 3 - - -
4 3 3 3 3 3 3 3 3 3 3 3 3 - - -
5 3 3 3 3 3 3 3 3 3 3 3 3 - - -
AVg. 2.4 2.8 3 3 1.8 3 3 3 3 3 3 3 - - -
1 - low, 2 - medium, 3 - high, ‘-' - no correlation
Note: The average value of this course to be used for program articulation matrix.
64
MA3354 DISCRETE MATHEMATICS L T P C
3 1 0 4
COURSE OBJECTIVES:
 To extend student’s logical and mathematical maturity and ability to deal with abstraction.
 To introduce most of the basic terminologies used in computer science courses and
application of ideas to solve practical problems.
 To understand the basic concepts of combinatorics and graph theory.
 To familiarize the applications of algebraic structures.
 To understand the concepts and significance of lattices and boolean algebra which are
widely used in computer science and engineering.

UNIT I LOGIC AND PROOFS 9+3

Propositional logic – Propositional equivalences - Predicates and quantifiers – Nested quantifiers –
Rules of inference - Introduction to proofs – Proof methods and strategy.

UNIT II COMBINATORICS 9+3

Mathematical induction – Strong induction and well ordering – The basics of counting – The
pigeonhole principle – Permutations and combinations – Recurrence relations – Solving linear
recurrence relations – Generating functions – Inclusion and exclusion principle and its applications.

UNIT III GRAPHS 9+3

Graphs and graph models – Graph terminology and special types of graphs – Matrix representation
of graphs and graph isomorphism – Connectivity – Euler and Hamilton paths.

UNIT IV ALGEBRAIC STRUCTURES 9+3

Algebraic systems – Semi groups and monoids - Groups – Subgroups – Homomorphism’s – Normal
subgroup and cosets – Lagrange’s theorem – Definitions and examples of Rings and Fields.

UNIT V LATTICES AND BOOLEAN ALGEBRA 9+3

Partial ordering – Posets – Lattices as posets – Properties of lattices - Lattices as algebraic systems
– Sub lattices – Direct product and homomorphism – Some special lattices – Boolean algebra – Sub
Boolean Algebra – Boolean Homomorphism.
TOTAL: 60 PERIODS
COURSE OUTCOMES:
At the end of the course, students would :
CO1:Have knowledge of the concepts needed to test the logic of a program.
CO2:Have an understanding in identifying structures on many levels.
CO3:Be aware of a class of functions which transform a finite set into another finite set which
relates to input and output functions in computer science.
CO4:Be aware of the counting principles.
CO5:Be exposed to concepts and properties of algebraic structures such as groups, rings and
fields.
TEXT BOOKS:
1. Rosen. K.H., "Discrete Mathematics and its Applications", 7th Edition, Tata McGraw
Hill Pub. Co. Ltd., New Delhi, Special Indian Edition, 2017.
2. Tremblay. J.P. and Manohar. R, "Discrete Mathematical Structures with Applications to
Computer Science", Tata McGraw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011.

65
 REFERENCES:
1. Grimaldi. R.P. "Discrete and Combinatorial Mathematics: An Applied Introduction",
5thEdition, Pearson Education Asia, Delhi, 2013.
2. Koshy. T. "Discrete Mathematics with Applications", Elsevier Publications, 2006.
3. Lipschutz. S. and Mark Lipson., "Discrete Mathematics", Schaum’s Outlines, Tata McGraw
Hill Pub. Co. Ltd., New Delhi, 3rd Edition, 2010.
CO’s-PO’s & PSO’s MAPPING
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 3 3 2 - - - - - - - - 2 - - -
2 3 3 - - - - - - - - - - - - -
3 - 3 2 - - 2 - - - 3 - - - - -
4 - 2 2 2 - - - - - - - - - - -
5 - 2 2 2 - - - - - 2 - - - - -
AVg. 1 3 2 1 - - - - - 1 - - - - -
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CS3351 DIGITAL PRINCIPLES AND COMPUTER ORGANIZATION L T PC

3 0 2 4
COURSE OBJECTIVES:
 To analyze and design combinational circuits.
 To analyze and design sequential circuits
 To understand the basic structure and operation of a digital computer.
 To study the design of data path unit, control unit for processor and to familiarize with the
hazards.
 To understand the concept of various memories and I/O interfacing.

UNIT I COMBINATIONAL LOGIC 9

Combinational Circuits – Karnaugh Map - Analysis and Design Procedures – Binary Adder –
Subtractor – Decimal Adder - Magnitude Comparator – Decoder – Encoder – Multiplexers -
Demultiplexers

UNIT II SYNCHRONOUS SEQUENTIAL LOGIC 9

Introduction to Sequential Circuits – Flip-Flops – operation and excitation tables, Triggering of FF,
Analysis and design of clocked sequential circuits – Design – Moore/Mealy models, state
minimization, state assignment, circuit implementation - Registers – Counters.

UNIT III COMPUTER FUNDAMENTALS 9

Functional Units of a Digital Computer: Von Neumann Architecture – Operation and Operands of
Computer Hardware Instruction – Instruction Set Architecture (ISA): Memory Location, Address
and Operation – Instruction and Instruction Sequencing – Addressing Modes, Encoding of Machine
Instruction – Interaction between Assembly and High Level Language.

UNIT IV PROCESSOR 9
Instruction Execution – Building a Data Path – Designing a Control Unit – Hardwired Control,
Microprogrammed Control – Pipelining – Data Hazard – Control Hazards.

66
 UNIT V MEMORY AND I/O 9
Memory Concepts and Hierarchy – Memory Management – Cache Memories: Mapping and
Replacement Techniques – Virtual Memory – DMA – I/O – Accessing I/O: Parallel and Serial
Interface – Interrupt I/O – Interconnection Standards: USB, SATA
45 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Verification of Boolean theorems using logic gates.
2. Design and implementation of combinational circuits using gates for arbitrary functions.
3. Implementation of 4-bit binary adder/subtractor circuits.
4. Implementation of code converters.
5. Implementation of BCD adder, encoder and decoder circuits
6. Implementation of functions using Multiplexers.
7. Implementation of the synchronous counters
8. Implementation of a Universal Shift register.
9. Simulator based study of Computer Architecture

COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1 : Design various combinational digital circuits using logic gates
CO2 : Design sequential circuits and analyze the design procedures
CO3 : State the fundamentals of computer systems and analyze the execution of an instruction
CO4 : Analyze different types of control design and identify hazards
CO5 : Identify the characteristics of various memory systems and I/O communication
TOTAL: 75 PERIODS
TEXT BOOKS:
1. M. Morris Mano, Michael D. Ciletti, “Digital Design : With an Introduction to the Verilog HDL,
VHDL, and System Verilog”, Sixth Edition, Pearson Education, 2018.
2. David A. Patterson, John L. Hennessy, “Computer Organization and Design, The
Hardware/Software Interface”, Sixth Edition, Morgan Kaufmann/Elsevier, 2020.

REFERENCES:
1. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Naraig Manjikian, “Computer Organization and
Embedded Systems”, Sixth Edition, Tata McGraw-Hill, 2012.
2. William Stallings, “Computer Organization and Architecture – Designing for Performance”,
Tenth Edition, Pearson Education, 2016.
3. M. Morris Mano, “Digital Logic and Computer Design”, Pearson Education, 2016.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 3 3 3 2 1 1 1 1 2 3 2 3 3
2 3 3 3 3 2 1 1 1 1 1 2 3 1 2 2
3 3 3 3 3 2 2 1 1 1 1 2 3 2 3 1
4 3 3 3 3 1 1 1 1 1 1 1 2 1 3 1
5 3 3 3 3 1 2 1 1 1 1 1 2 1 2 1
AVg. 3 3 3 3 1.8 1.6 1 1 1 1 1.6 2.6 1.4 2.6 1.6
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

67
CS3352 FOUNDATIONS OF DATA SCIENCE L T P C
3 0 0 3
COURSE OBJECTIVES:
 To understand the data science fundamentals and process.
 To learn to describe the data for the data science process.
 To learn to describe the relationship between data.
 To utilize the Python libraries for Data Wrangling.
 To present and interpret data using visualization libraries in Python

UNIT I INTRODUCTION 9
Data Science: Benefits and uses – facets of data - Data Science Process: Overview – Defining
research goals – Retrieving data – Data preparation - Exploratory Data analysis – build the model–
presenting findings and building applications - Data Mining - Data Warehousing – Basic Statistical
descriptions of Data

UNIT II DESCRIBING DATA 9

Types of Data - Types of Variables -Describing Data with Tables and Graphs –Describing Data
with Averages - Describing Variability - Normal Distributions and Standard (z) Scores

UNIT III DESCRIBING RELATIONSHIPS 9

Correlation –Scatter plots –correlation coefficient for quantitative data –computational formula for
correlation coefficient – Regression –regression line –least squares regression line – Standard
error of estimate – interpretation of r2 –multiple regression equations –regression towards the mean

UNIT IV PYTHON LIBRARIES FOR DATA WRANGLING 9

Basics of Numpy arrays –aggregations –computations on arrays –comparisons, masks, boolean
logic – fancy indexing – structured arrays – Data manipulation with Pandas – data indexing and
selection – operating on data – missing data – Hierarchical indexing – combining datasets –
aggregation and grouping – pivot tables

UNIT V DATA VISUALIZATION 9

Importing Matplotlib – Line plots – Scatter plots – visualizing errors – density and contour plots –
Histograms – legends – colors – subplots – text and annotation – customization – three dimensional
plotting - Geographic Data with Basemap - Visualization with Seaborn.

COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Define the data science process
CO2: Understand different types of data description for data science process
CO3: Gain knowledge on relationships between data
CO4: Use the Python Libraries for Data Wrangling
CO5: Apply visualization Libraries in Python to interpret and explore data
TOTAL:45 PERIODS
TEXT BOOKS
1. David Cielen, Arno D. B. Meysman, and Mohamed Ali, “Introducing Data Science”, Manning
Publications, 2016. (Unit I)
2. Robert S. Witte and John S. Witte, “Statistics”, Eleventh Edition, Wiley Publications, 2017.
(Units II and III)

68
 3. Jake VanderPlas, “Python Data Science Handbook”, O’Reilly, 2016. (Units IV and V)

REFERENCES:
1. Allen B. Downey, “Think Stats: Exploratory Data Analysis in Python”, Green Tea Press,2014.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 1 2 2 - - - 1 1 1 2 2 2 2
2 2 1 - 1 1 - - - 2 1 1 2 2 3 1
3 2 2 1 2 2 1 1 - 1 2 1 3 2 2 3
4 3 2 2 1 2 - - - 1 1 2 2 3 3 2
5 2 2 1 2 2 - - - 1 1 1 2 2 2 2
AVg. 2 2 1 2 2 1 1 - 1 1 1 2 2 2 2
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3301 DATA STRUCTURES L T P C

3 0 0 3
COURSE OBJECTIVES:
 To understand the concepts of ADTs.
 To Learn linear data structures – lists, stacks, and queues.
 To understand non-linear data structures – trees and graphs.
 To understand sorting, searching and hashing algorithms.
 To apply Tree and Graph structures.

UNIT I LISTS 9
Abstract Data Types (ADTs) – List ADT – Array-based implementation – Linked list implementation
– Singly linked lists – Circularly linked lists – Doubly-linked lists – Applications of lists – Polynomial
ADT – Radix Sort – Multilists.

UNIT II STACKS AND QUEUES 9

Stack ADT – Operations – Applications – Balancing Symbols – Evaluating arithmetic expressions-
Infix to Postfix conversion – Function Calls – Queue ADT – Operations – Circular Queue – DeQueue
– Applications of Queues.

UNIT III TREES 9

Tree ADT – Tree Traversals - Binary Tree ADT – Expression trees – Binary Search Tree ADT – AVL
Trees – Priority Queue (Heaps) – Binary Heap.

UNIT IV MULTIWAY SEARCH TREES AND GRAPHS 9

B-Tree – B+ Tree – Graph Definition – Representation of Graphs – Types of Graph - Breadth-first
traversal – Depth-first traversal –– Bi-connectivity – Euler circuits – Topological Sort – Dijkstra's
algorithm – Minimum Spanning Tree – Prim's algorithm – Kruskal's algorithm

69
UNIT V SEARCHING, SORTING AND HASHING TECHNIQUES 9
Searching – Linear Search – Binary Search. Sorting – Bubble sort – Selection sort – Insertion
sort – Shell sort –. Merge Sort – Hashing – Hash Functions – Separate Chaining – Open
Addressing –Rehashing – Extendible Hashing.

COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Define linear and non-linear data structures.
CO2: Implement linear and non–linear data structure operations.
CO3: Use appropriate linear/non–linear data structure operations for solving a given problem.
CO4: Apply appropriate graph algorithms for graph applications.
CO5: Analyze the various searching and sorting algorithms.
TOTAL:45 PERIODS
TEXT BOOKS
1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2nd Edition, Pearson
Education, 2005.
2. Kamthane, Introduction to Data Structures in C, 1st Edition, Pearson Education, 2007

REFERENCES
1. Langsam, Augenstein and Tanenbaum, Data Structures Using C and C++, 2nd Edition,
Pearson Education, 2015.
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, Introduction to
Algorithms", Fourth Edition, Mcgraw Hill/ MIT Press, 2022.
3. Alfred V. Aho, Jeffrey D. Ullman,John E. Hopcroft ,Data Structures and Algorithms, 1st
edition, Pearson, 2002.
4. Kruse, Data Structures and Program Design in C, 2nd Edition, Pearson Education, 2006.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 3 1 2 2 1 1 - 1 2 1 3 2 1 3
2 1 2 1 2 2 - - - 1 1 1 2 2 2 2
3 2 3 1 2 3 - - - 1 1 1 2 2 1 2
4 2 1 - 1 1 - - - 2 1 1 2 2 3 1
5 1 2 1 2 2 1 1 - 1 2 1 3 2 2 3
AVg. 2 2 1 2 2 1 1 - 1 1 1 2 2 2 2
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3391 OBJECT ORIENTED PROGRAMMING L T P C

3 0 0 3
COURSE OBJECTIVES:
 To understand Object Oriented Programming concepts and basics of Java programming
language
 To know the principles of packages, inheritance and interfaces
 To develop a java application with threads and generics classes
 To define exceptions and use I/O streams
 To design and build Graphical User Interface Application using JAVAFX
70
UNIT I INTRODUCTION TO OOP AND JAVA 9
Overview of OOP – Object oriented programming paradigms – Features of Object Oriented
Programming – Java Buzzwords – Overview of Java – Data Types, Variables and Arrays –
Operators – Control Statements – Programming Structures in Java – Defining classes in Java –
Constructors-Methods -Access specifiers - Static members- Java Doc comments

UNIT II INHERITANCE, PACKAGES AND INTERFACES 9

Overloading Methods – Objects as Parameters – Returning Objects –Static, Nested and Inner
Classes. Inheritance: Basics– Types of Inheritance -Super keyword -Method Overriding – Dynamic
Method Dispatch –Abstract Classes – final with Inheritance. Packages and Interfaces: Packages –
Packages and Member Access –Importing Packages – Interfaces.

UNIT III EXCEPTION HANDLING AND MULTITHREADING 9

Exception Handling basics – Multiple catch Clauses – Nested try Statements – Java’s Built-in
Exceptions – User defined Exception. Multithreaded Programming: Java Thread Model–Creating a
Thread and Multiple Threads – Priorities – Synchronization – Inter Thread Communication-
Suspending –Resuming, and Stopping Threads –Multithreading. Wrappers – Auto boxing.

UNIT IV I/O, GENERICS, STRING HANDLING 9

I/O Basics – Reading and Writing Console I/O – Reading and Writing Files. Generics: Generic
Programming – Generic classes – Generic Methods – Bounded Types – Restrictions and
Limitations. Strings: Basic String class, methods and String Buffer Class.

UNIT V JAVAFX EVENT HANDLING, CONTROLS AND COMPONENTS 9

JAVAFX Events and Controls: Event Basics – Handling Key and Mouse Events. Controls:
Checkbox, ToggleButton – RadioButtons – ListView – ComboBox – ChoiceBox – Text Controls –
ScrollPane. Layouts – FlowPane – HBox and VBox – BorderPane – StackPane – GridPane. Menus
– Basics – Menu – Menu bars – MenuItem.

COURSE OUTCOMES:
On completion of this course, the students will be able to
CO1:Apply the concepts of classes and objects to solve simple problems
CO2:Develop programs using inheritance, packages and interfaces
CO3:Make use of exception handling mechanisms and multithreaded model to solve real world
problems
CO4:Build Java applications with I/O packages, string classes, Collections and generics concepts
CO5:Integrate the concepts of event handling and JavaFX components and controls for developing
GUI based applications
TOTAL:45 PERIODS
TEXT BOOKS:
1. Herbert Schildt, “Java: The Complete Reference”, 11 th Edition, McGraw Hill Education, New
Delhi, 2019
2. Herbert Schildt, “Introducing JavaFX 8 Programming”, 1 st Edition, McGraw Hill Education, New
Delhi, 2015

REFERENCE:
1. Cay S. Horstmann, “Core Java Fundamentals”, Volume 1, 11 th Edition, Prentice Hall,
2018.

71
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 1 1 3 1 3 - - - 3 2 2 2 3 1 2
2 2 1 3 2 1 - - - 2 1 1 3 3 3 2
3 3 3 1 2 2 - - - 3 2 1 2 3 1 3
4 3 1 2 2 2 - - - 1 2 1 3 3 1 1
5 1 1 2 3 2 - - - 3 2 1 2 3 3 3
AVg. 2 1 2 2 2 - - - 2 2 1 2 3 2 2
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3311 DATA STRUCTURES LABORATORY L T P C

0 0 3 1.5

COURSE OBJECTIVES:
 To demonstrate array implementation of linear data structure algorithms.
 To implement the applications using Stack.
 To implement the applications using Linked list
 To implement Binary search tree and AVL tree algorithms.
 To implement the Heap algorithm.
 To implement Dijkstra’s algorithm.
 To implement Prim’s algorithm
 To implement Sorting, Searching and Hashing algorithms.

LIST OF EXERCISES:
1. Array implementation of Stack, Queue and Circular Queue ADTs
2. Implementation of Singly Linked List
3. Linked list implementation of Stack and Linear Queue ADTs
4. Implementation of Polynomial Manipulation using Linked list
5. Implementation of Evaluating Postfix Expressions, Infix to Postfix conversion
6. Implementation of Binary Search Trees
7. Implementation of AVL Trees
8. Implementation of Heaps using Priority Queues
9. Implementation of Dijkstra’s Algorithm
10. Implementation of Prim’s Algorithm
11. Implementation of Linear Search and Binary Search
12. Implementation of Insertion Sort and Selection Sort
13. Implementation of Merge Sort
14. Implementation of Open Addressing (Linear Probing and Quadratic Probing)
TOTAL:45 PERIODS
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Implement Linear data structure algorithms.
CO2: Implement applications using Stacks and Linked lists
CO3: Implement Binary Search tree and AVL tree operations.
CO4: Implement graph algorithms.
CO5: Analyze the various searching and sorting algorithms.
72
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 1 2 2 1 - - - - 2 1 2 2 2 2 3
2 3 3 1 1 - - - - 1 1 1 3 1 2 2
3 2 1 3 1 - - - - 1 1 2 3 3 3 3
4 3 1 3 3 - - - - 1 2 3 3 2 1 2
5 3 2 1 1 2 - - - 3 3 3 1 3 1 3
AVg. 2 2 2 1 2 - - - 2 2 2 2 2 2 3
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3381 OBJECT ORIENTED PROGRAMMING LABORATORY L T P C

0 0 3 1.5
COURSE OBJECTIVES:
 To build software development skills using java programming for real-world applications.
 To understand and apply the concepts of classes, packages, interfaces, inheritance,
exception handling and file processing.
 To develop applications using generic programming and event handling
LIST OF EXPERIMENTS:
1. Solve problems by using sequential search, binary search, and quadratic sorting algorithms
(selection, insertion)
2. Develop stack and queue data structures using classes and objects.
3. Develop a java application with an Employee class with Emp_name, Emp_id, Address,
Mail_id, Mobile_no as members. Inherit the classes, Programmer, Assistant Professor,
Associate Professor and Professor from employee class. Add Basic Pay (BP) as the
member of all the inherited classes with 97% of BP as DA, 10 % of BP as HRA, 12% of
BP as PF, 0.1% of BP for staff club funds. Generate pay slips for the employees with their
gross and net salary.
4. Write a Java Program to create an abstract class named Shape that contains two integers
and an empty method named printArea(). Provide three classes named Rectangle, Triangle
and Circle such that each one of the classes extends the class Shape. Each one of the
classes contains only the method printArea( ) that prints the area of the given shape.
5. Solve the above problem using an interface.
6. Implement exception handling and creation of user defined exceptions.
7. Write a java program that implements a multi-threaded application that has three
threads. First thread generates a random integer every 1 second and if the value is even,
the second thread computes the square of the number and prints. If the value is odd, the
third thread will print the value of the cube of the number.
8. Write a program to perform file operations.
9. Develop applications to demonstrate the features of generics classes.
10. Develop applications using JavaFX controls, layouts and menus.
11. Develop a mini project for any application using Java concepts.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
On completion of this course, the students will be able to
CO1 : Design and develop java programs using object oriented programming concepts
CO2 : Develop simple applications using object oriented concepts such as package, exceptions
73
CO3: Implement multithreading, and generics concepts
CO4 : Create GUIs and event driven programming applications for real world problems
CO5: Implement and deploy web applications using Java
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 1 2 1 - - - - 1 2 2 2 1 2 3
2 2 1 3 1 - - - - 2 3 3 2 1 3 1
3 2 2 1 2 1 - - - 1 2 1 3 2 3 2
4 2 2 1 3 - - - - 3 1 1 1 2 1 2
5 1 3 3 1 3 - - - 1 1 1 1 2 1 2
AVg. 2 2 2 2 2 - - - 2 2 2 2 2 2 2
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3361 DATA SCIENCE LABORATORY L T P C

0 0 4 2
COURSE OBJECTIVES:
 To understand the python libraries for data science
 To understand the basic Statistical and Probability measures for data science.
 To learn descriptive analytics on the benchmark data sets.
 To apply correlation and regression analytics on standard data sets.
 To present and interpret data using visualization packages in Python.

LIST OF EXPERIMENTS:
1. Download, install and explore the features of NumPy, SciPy, Jupyter, Statsmodels and
Pandas packages.
2. Working with Numpy arrays
3. Working with Pandas data frames
4. Reading data from text files, Excel and the web and exploring various commands for doing
descriptive analytics on the Iris data set.
5. Use the diabetes data set from UCI and Pima Indians Diabetes data set for performing the
following:
a. Univariate analysis: Frequency, Mean, Median, Mode, Variance, Standard Deviation,
Skewness and Kurtosis.
b. Bivariate analysis: Linear and logistic regression modeling
c. Multiple Regression analysis
d. Also compare the results of the above analysis for the two data sets.
6. Apply and explore various plotting functions on UCI data sets.
a. Normal curves
b. Density and contour plots
c. Correlation and scatter plots
d. Histograms
e. Three dimensional plotting
7. Visualizing Geographic Data with Basemap
TOTAL: 60 PERIODS

74
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Make use of the python libraries for data science
CO2: Make use of the basic Statistical and Probability measures for data science.
CO3: Perform descriptive analytics on the benchmark data sets.
CO4: Perform correlation and regression analytics on standard data sets
CO5: Present and interpret data using visualization packages in Python.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 1 1 - - - - 1 3 3 3 1 3 2
2 3 2 2 3 1 - - - 3 1 3 2 1 3 3
3 3 2 1 3 1 - - - 2 1 1 1 3 2 3
4 2 3 1 3 - - - - 2 3 2 3 3 3 1
5 1 2 3 1 1 - - - 2 1 3 1 1 3 3
AVg. 2 2 2 2 1 - - - 2 2 2 2 2 3 2
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

GE3361 PROFESSIONAL DEVELOPMENT LTPC

0 021

COURSE OBJECTIVES:

To be proficient in important Microsoft Office tools: MS WORD, EXCEL, POWERPOINT.

 To be proficient in using MS WORD to create quality technical documents, by using standard

templates, widely acceptable styles and formats, variety of features to enhance the
presentability and overall utility value of content.
 To be proficient in using MS EXCEL for all data manipulation tasks including the common
statistical, logical, mathematical etc., operations, conversion, analytics, search and explore,
visualize,interlink, and utilizing many more critical features offered

 To be able to create and share quality presentations by using the features of MS PowerPoint,
including: organization of content, presentability, aesthetics, using media elements and
enhance the overall quality of presentations.
MS WORD: 10 Hours

Create and format a document

Working with tables

Working with Bullets and Lists

Working with styles, shapes, smart art, charts

Inserting objects, charts and importing objects from other office tools

Creating and Using document templates

Inserting equations, symbols and special characters

75
Working with Table of contents and References, citations

Insert and review comments

Create bookmarks, hyperlinks, endnotes footnote

Viewing document in different modes

Working with document protection and security

Inspect document for accessibility

MS EXCEL: 10 Hours

Create worksheets, insert and format data

Work with different types of data: text, currency, date, numeric etc.

Split, validate, consolidate, Convert data

Sort and filter data

Perform calculations and use functions: (Statistical, Logical, Mathematical, date, Time etc.,)

Work with Lookup and reference formulae

Create and Work with different types of charts

Use pivot tables to summarize and analyse data

Perform data analysis using own formulae and functions

Combine data from multiple worksheets using own formulae and built-in functions to generate
results

Export data and sheets to other file formats

Working with macros

Protecting data and Securing the workbook

MS POWERPOINT: 10 Hours

Select slide templates, layout and themes

Formatting slide content and using bullets and numbering

Insert and format images, smart art, tables, charts

Using Slide master, notes and handout master

Working with animation and transitions

Organize and Group slides

Import or create and use media objects: audio, video, animation

Perform slideshow recording and Record narration and create presentable videos

TOTAL: 30 PERIODS

76
COURSE OUTCOMES:
On successful completion the students will be able to

CO1:Use MS Word to create quality documents, by structuring and organizing content for their day
to day technical and academic requirements
CO2:Use MS EXCEL to perform data operations and analytics, record, retrieve data as per
requirements and visualize data for ease of understanding
CO3:Use MS PowerPoint to create high quality academic presentations by including common
tables, charts, graphs, interlinking other elements, and using media objects.

CS3452 THEORY OF COMPUTATION L T P C

3 0 0 3
COURSE OBJECTIVES:
 To understand foundations of computation including automata theory
 To construct models of regular expressions and languages.
 To design context free grammar and push down automata
 To understand Turing machines and their capability
 To understand Undecidability and NP class problems

UNIT I AUTOMATA AND REGULAR EXPRESSIONS 9

Need for automata theory - Introduction to formal proof – Finite Automata (FA) – Deterministic Finite
Automata (DFA) – Non-deterministic Finite Automata (NFA) – Equivalence between NFA and DFA
– Finite Automata with Epsilon transitions – Equivalence of NFA and DFA- Equivalence of NFAs
with and without ε-moves- Conversion of NFA into DFA – Minimization of DFAs.

UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9

Regular expression – Regular Languages- Equivalence of Finite Automata and regular expressions
– Proving languages to be not regular (Pumping Lemma) – Closure properties of regular languages.

UNIT III CONTEXT FREE GRAMMAR AND PUSH DOWN AUTOMATA 9

Types of Grammar - Chomsky‘s hierarchy of languages -Context-Free Grammar (CFG) and
Languages – Derivations and Parse trees – Ambiguity in grammars and languages – Push Down
Automata (PDA): Definition – Moves - Instantaneous descriptions -Languages of pushdown
automata – Equivalence of pushdown automata and CFG-CFG to PDA-PDA to CFG – Deterministic
Pushdown Automata.

UNIT IV NORMAL FORMS AND TURING MACHINES 9

Normal forms for CFG – Simplification of CFG- Chomsky Normal Form (CNF) and Greibach Normal
Form (GNF) – Pumping lemma for CFL – Closure properties of Context Free Languages –Turing
Machine : Basic model – definition and representation – Instantaneous Description – Language
acceptance by TM – TM as Computer of Integer functions – Programming techniques for Turing
machines (subroutines).

UNIT V UNDECIDABILITY 9
Unsolvable Problems and Computable Functions –PCP-MPCP- Recursive and recursively
enumerable languages – Properties - Universal Turing machine -Tractable and Intractable problems

77
- P and NP completeness – Kruskal’s algorithm – Travelling Salesman Problem- 3-CNF SAT
problems.

COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Construct automata theory using Finite Automata
CO2: Write regular expressions for any pattern
CO3: Design context free grammar and Pushdown Automata
CO4: Design Turing machine for computational functions
CO5: Differentiate between decidable and undecidable problems
TOTAL:45 PERIODS
TEXT BOOKS:
1. Hopcroft J.E., Motwani R. & Ullman J.D., "Introduction to Automata Theory, Languages and
Computations", 3rd Edition, Pearson Education, 2008.
2. John C Martin , "Introduction to Languages and the Theory of Computation", 4th Edition,
Tata McGraw Hill, 2011.

REFERENCES:
1. Harry R Lewis and Christos H Papadimitriou , "Elements of the Theory of Computation", 2nd
Edition, Prentice Hall of India, 2015.
2. Peter Linz, "An Introduction to Formal Language and Automata", 6th Edition, Jones & Bartlett,
2016.
3. K.L.P.Mishra and N.Chandrasekaran, “Theory of Computer Science: Automata Languages and
Computation”, 3rd Edition, Prentice Hall of India, 2006.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 1 3 2 3 - - - - 1 1 2 3 1 3 2
2 2 2 3 2 1 - - - 3 3 2 3 3 1 2
3 2 2 3 2 1 - - - 1 3 1 2 1 2 2
4 2 2 2 1 - - - - 1 3 3 2 1 3 2
5 2 2 2 1 1 - - - 1 1 3 2 3 1 3
AVg. 2 2 2 2 1 - - - 1 2 2 2 2 2 2
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3491 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING L T P C

3 0 2 4
COURSE OBJECTIVES:
The main objectives of this course are to:
 Study about uninformed and Heuristic search techniques.
 Learn techniques for reasoning under uncertainty
 Introduce Machine Learning and supervised learning algorithms
 Study about ensembling and unsupervised learning algorithms
 Learn the basics of deep learning using neural networks

78
UNIT I PROBLEM SOLVING 9
Introduction to AI - AI Applications - Problem solving agents – search algorithms – uninformed
search strategies – Heuristic search strategies – Local search and optimization problems –
adversarial search – constraint satisfaction problems (CSP)

UNIT II PROBABILISTIC REASONING 9

Acting under uncertainty – Bayesian inference – naïve bayes models. Probabilistic reasoning –
Bayesian networks – exact inference in BN – approximate inference in BN – causal networks.

UNIT III SUPERVISED LEARNING 9

Introduction to machine learning – Linear Regression Models: Least squares, single & multiple
variables, Bayesian linear regression, gradient descent, Linear Classification Models: Discriminant
function – Probabilistic discriminative model - Logistic regression, Probabilistic generative model –
Naive Bayes, Maximum margin classifier – Support vector machine, Decision Tree, Random forests

UNIT IV ENSEMBLE TECHNIQUES AND UNSUPERVISED LEARNING 9

Combining multiple learners: Model combination schemes, Voting, Ensemble Learning - bagging,
boosting, stacking, Unsupervised learning: K-means, Instance Based Learning: KNN, Gaussian
mixture models and Expectation maximization

UNIT V NEURAL NETWORKS 9

Perceptron - Multilayer perceptron, activation functions, network training – gradient descent
optimization – stochastic gradient descent, error backpropagation, from shallow networks to deep
networks –Unit saturation (aka the vanishing gradient problem) – ReLU, hyperparameter tuning,
batch normalization, regularization, dropout.
45 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Implementation of Uninformed search algorithms (BFS, DFS)
2. Implementation of Informed search algorithms (A*, memory-bounded A*)
3. Implement naïve Bayes models
4. Implement Bayesian Networks
5. Build Regression models
6. Build decision trees and random forests
7. Build SVM models
8. Implement ensembling techniques
9. Implement clustering algorithms
10. Implement EM for Bayesian networks
11. Build simple NN models
12. Build deep learning NN models

COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Use appropriate search algorithms for problem solving
CO2: Apply reasoning under uncertainty
CO3: Build supervised learning models
CO4: Build ensembling and unsupervised models
CO5: Build deep learning neural network models
TOTAL:75 PERIODS
79
TEXT BOOKS:
1. Stuart Russell and Peter Norvig, “Artificial Intelligence – A Modern Approach”, Fourth
Edition, Pearson Education, 2021.
2. Ethem Alpaydin, “Introduction to Machine Learning”, MIT Press, Fourth Edition, 2020.

REFERENCES:
1. Dan W. Patterson, “Introduction to Artificial Intelligence and Expert Systems”, Pearson
Education,2007
2. Kevin Night, Elaine Rich, and Nair B., “Artificial Intelligence”, McGraw Hill, 2008
3. Patrick H. Winston, "Artificial Intelligence", Third Edition, Pearson Education, 2006
4. Deepak Khemani, “Artificial Intelligence”, Tata McGraw Hill Education, 2013
(http://nptel.ac.in/)
5. Christopher M. Bishop, “Pattern Recognition and Machine Learning”, Springer, 2006.
6. Tom Mitchell, “Machine Learning”, McGraw Hill, 3rd Edition,1997.
7. Charu C. Aggarwal, “Data Classification Algorithms and Applications”, CRC Press, 2014
8. Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar, “Foundations of Machine
Learning”, MIT Press, 2012.
9. Ian Goodfellow, Yoshua Bengio, Aaron Courville, “Deep Learning”, MIT Press, 2016
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 3 3 - - - - 1 3 3 3 1 2 2
2 1 1 1 3 1 - - - 1 2 1 3 2 3 2
3 2 1 2 1 1 - - - 2 1 1 3 1 1 1
4 3 1 3 1 - - - - 2 1 2 1 2 2 2
5 3 1 1 2 2 - - - 3 1 2 3 2 1 2
AVg. 2 1 2 2 1 - - - 2 2 2 3 2 2 2
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3492 DATABASE MANAGEMENT SYSTEMS L T P C

3 0 0 3
COURSE OBJECTIVES:
 To learn the fundamentals of data models, relational algebra and SQL
 To represent a database system using ER diagrams and to learn normalization techniques
 To understand the fundamental concepts of transaction, concurrency and recovery
processing
 To understand the internal storage structures using different file and indexing techniques
which will help in physical DB design
 To have an introductory knowledge about the Distributed databases, NOSQL and database
security

UNIT I RELATIONAL DATABASES 10

Purpose of Database System – Views of data – Data Models – Database System Architecture –
Introduction to relational databases – Relational Model – Keys – Relational Algebra – SQL
fundamentals – Advanced SQL features – Embedded SQL– Dynamic SQL

80
UNIT II DATABASE DESIGN 8
Entity-Relationship model – E-R Diagrams – Enhanced-ER Model – ER-to-Relational Mapping –
Functional Dependencies – Non-loss Decomposition – First, Second, Third Normal Forms,
Dependency Preservation – Boyce/Codd Normal Form – Multi-valued Dependencies and Fourth
Normal Form – Join Dependencies and Fifth Normal Form

UNIT III TRANSACTIONS 9

Transaction Concepts – ACID Properties – Schedules – Serializability – Transaction support in SQL
– Need for Concurrency – Concurrency control –Two Phase Locking- Timestamp – Multiversion –
Validation and Snapshot isolation– Multiple Granularity locking – Deadlock Handling – Recovery
Concepts – Recovery based on deferred and immediate update – Shadow paging – ARIES
Algorithm
UNIT IV IMPLEMENTATION TECHNIQUES 9
RAID – File Organization – Organization of Records in Files – Data dictionary Storage – Column
Oriented Storage– Indexing and Hashing –Ordered Indices – B+ tree Index Files – B tree Index Files
– Static Hashing – Dynamic Hashing – Query Processing Overview – Algorithms for Selection,
Sorting and join operations – Query optimization using Heuristics - Cost Estimation.

UNIT V ADVANCED TOPICS 9

Distributed Databases: Architecture, Data Storage, Transaction Processing, Query processing and
optimization – NOSQL Databases: Introduction – CAP Theorem – Document Based systems – Key
value Stores – Column Based Systems – Graph Databases. Database Security: Security issues –
Access control based on privileges – Role Based access control – SQL Injection – Statistical
Database security – Flow control – Encryption and Public Key infrastructures – Challenges

COURSE OUTCOMES:
Upon completion of this course, the students will be able to
CO1: Construct SQL Queries using relational algebra
CO2: Design database using ER model and normalize the database
CO3: Construct queries to handle transaction processing and maintain consistency of the
database
CO4: Compare and contrast various indexing strategies and apply the knowledge to tune the
performance of the database
CO5: Appraise how advanced databases differ from Relational Databases and find a suitable
database for the given requirement.
TOTAL:45 PERIODS
TEXT BOOKS:
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, “Database System Concepts”, Seventh
Edition, McGraw Hill, 2020.
2. Ramez Elmasri, Shamkant B. Navathe, “Fundamentals of Database Systems”, Seventh
Edition, Pearson Education, 2017

REFERENCES:
1. C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database Systems”, Eighth Edition,
Pearson Education, 2006.

81
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 3 2 1 - - - 2 1 1 1 2 1 3
2 3 1 1 1 1 - - - 2 3 3 3 3 1 2
3 3 2 3 2 1 - - - 2 1 1 2 2 3 3
4 1 2 3 2 - - - - 3 2 3 3 1 2 3
5 1 1 3 3 2 - - - 1 3 3 1 2 2 2
AVg. 2 2 3 2 1 - - - 2 2 2 2 2 2 3
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3401 ALGORITHMS L T P C
3 0 2 4
COURSE OBJECTIVES:
 To understand and apply the algorithm analysis techniques on searching and sorting
algorithms
 To critically analyze the efficiency of graph algorithms
 To understand different algorithm design techniques
 To solve programming problems using state space tree
 To understand the concepts behind NP Completeness, Approximation algorithms and
randomized algorithms.

UNIT I INTRODUCTION 9
Algorithm analysis: Time and space complexity - Asymptotic Notations and its properties Best
case, Worst case and average case analysis – Recurrence relation: substitution method - Lower
bounds – searching: linear search, binary search and Interpolation Search, Pattern search: The
naïve string-matching algorithm - Rabin-Karp algorithm - Knuth-Morris-Pratt algorithm. Sorting:
Insertion sort – heap sort

UNIT II GRAPH ALGORITHMS 9

Graph algorithms: Representations of graphs - Graph traversal: DFS – BFS - applications -
Connectivity, strong connectivity, bi-connectivity - Minimum spanning tree: Kruskal’s and Prim’s
algorithm- Shortest path: Bellman-Ford algorithm - Dijkstra’s algorithm - Floyd-Warshall algorithm
Network flow: Flow networks - Ford-Fulkerson method – Matching: Maximum bipartite matching

UNIT III ALGORITHM DESIGN TECHNIQUES 9

Divide and Conquer methodology: Finding maximum and minimum - Merge sort - Quick sort
Dynamic programming: Elements of dynamic programming — Matrix-chain multiplication - Multi
stage graph — Optimal Binary Search Trees. Greedy Technique: Elements of the greedy strategy
- Activity-selection problem –- Optimal Merge pattern — Huffman Trees.

UNIT IV STATE SPACE SEARCH ALGORITHMS 9

Backtracking: n-Queens problem - Hamiltonian Circuit Problem - Subset Sum Problem – Graph
colouring problem Branch and Bound: Solving 15-Puzzle problem - Assignment problem -
Knapsack Problem - Travelling Salesman Problem

82
UNIT V NP-COMPLETE AND APPROXIMATION ALGORITHM 9
Tractable and intractable problems: Polynomial time algorithms – Venn diagram representation -
NP-algorithms - NP-hardness and NP-completeness – Bin Packing problem - Problem reduction:
TSP – 3-CNF problem. Approximation Algorithms: TSP - Randomized Algorithms: concept and
application - primality testing - randomized quick sort - Finding kth smallest number

45 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
Searching and Sorting Algorithms
1. Implement Linear Search. Determine the time required to search for an element. Repeat the
experiment for different values of n, the number of elements in the list to be searched and
plot a graph of the time taken versus n.
2. Implement recursive Binary Search. Determine the time required to search an element.
Repeat the experiment for different values of n, the number of elements in the list to be
searched and plot a graph of the time taken versus n.
3. Given a text txt [0...n-1] and a pattern pat [0...m-1], write a function search (char pat [ ], char
txt [ ]) that prints all occurrences of pat [ ] in txt [ ]. You may assume that n > m.
4. Sort a given set of elements using the Insertion sort and Heap sort methods and determine
the time required to sort the elements. Repeat the experiment for different values of n, the
number of elements in the list to be sorted and plot a graph of the time taken versus n.

Graph Algorithms
1. Develop a program to implement graph traversal using Breadth First Search
2. Develop a program to implement graph traversal using Depth First Search
3. From a given vertex in a weighted connected graph, develop a program to find the shortest
paths to other vertices using Dijkstra’s algorithm.
4. Find the minimum cost spanning tree of a given undirected graph using Prim’s algorithm.
5. Implement Floyd’s algorithm for the All-Pairs- Shortest-Paths problem.
6. Compute the transitive closure of a given directed graph using Warshall's algorithm.

Algorithm Design Techniques

1. Develop a program to find out the maximum and minimum numbers in a given list of n
numbers using the divide and conquer technique.
2. Implement Merge sort and Quick sort methods to sort an array of elements and determine
the time required to sort. Repeat the experiment for different values of n, the number of
elements in the list to be sorted and plot a graph of the time taken versus n.

State Space Search Algorithms

1. Implement N Queens problem using Backtracking.
Approximation Algorithms Randomized Algorithms
1. Implement any scheme to find the optimal solution for the Traveling Salesperson problem
and then solve the same problem instance using any approximation algorithm and determine
the error in the approximation.
2. Implement randomized algorithms for finding the kth smallest number.
The programs can be implemented in C/C++/JAVA/ Python.
TOTAL:75 PERIODS
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Analyze the efficiency of algorithms using various frameworks

83
CO2: Apply graph algorithms to solve problems and analyze their efficiency.
CO3: Make use of algorithm design techniques like divide and conquer, dynamic programming
and greedy techniques to solve problems
CO4: Use the state space tree method for solving problems.
CO5: Solve problems using approximation algorithms and randomized algorithms

TEXT BOOKS:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, "Introduction to
Algorithms", 3rd Edition, Prentice Hall of India, 2009.
2. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran “Computer Algorithms/C++” Orient
Blackswan, 2nd Edition, 2019.

REFERENCES:
1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, 3rd Edition, Pearson
Education, 2012.
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, "Data Structures and Algorithms",
Reprint Edition, Pearson Education, 2006.
3. S. Sridhar, “Design and Analysis of Algorithms”, Oxford university press, 2014.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 - - - 1 - - - - 1 - 1 -
2 2 3 - - - - 1 - - - - 1 - 1 -
3 1 2 3 1 - - 2 - - - - - - 1 1
4 1 1 - - - - - - - - - - - - -
5 1 1 - - - - - - - - - - - - -
AVg. 2.67 1.8 3 1 - - 1.33 - - - - 1 - 1 1
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3451 INTRODUCTION TO OPERATING SYSTEMS L T P C

3 0 0 3
COURSE OBJECTIVES:
 To understand the basics and functions of operating systems.
 To understand processes and threads
 To analyze scheduling algorithms and process synchronization.
 To understand the concept of deadlocks.
 To analyze various memory management schemes.
 To be familiar with I/O management and file systems.
 To be familiar with the basics of virtual machines and Mobile OS like iOS and Android.

UNIT I INTRODUCTION 7
Computer System - Elements and organization; Operating System Overview - Objectives and
Functions - Evolution of Operating System; Operating System Structures – Operating System
Services - User Operating System Interface - System Calls – System Programs - Design and
Implementation - Structuring methods.

84
UNIT II PROCESS MANAGEMENT 11
Processes - Process Concept - Process Scheduling - Operations on Processes - Inter-process
Communication; CPU Scheduling - Scheduling criteria - Scheduling algorithms: Threads -
Multithread Models – Threading issues; Process Synchronization - The Critical-Section problem -
Synchronization hardware – Semaphores – Mutex - Classical problems of synchronization -
Monitors; Deadlock - Methods for handling deadlocks, Deadlock prevention, Deadlock avoidance,
Deadlock detection, Recovery from deadlock.

UNIT III MEMORY MANAGEMENT 10

Main Memory - Swapping - Contiguous Memory Allocation – Paging - Structure of the Page Table -
Segmentation, Segmentation with paging; Virtual Memory - Demand Paging – Copy on Write - Page
Replacement - Allocation of Frames –Thrashing.

UNIT IV STORAGE MANAGEMENT 10

Mass Storage system – Disk Structure - Disk Scheduling and 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; I/O Systems – I/O Hardware,
Application I/O interface, Kernel I/O subsystem.

UNIT V VIRTUAL MACHINES AND MOBILE OS 7

Virtual Machines – History, Benefits and Features, Building Blocks, Types of Virtual Machines and
their Implementations, Virtualization and Operating-System Components; Mobile OS - iOS and
Android.

TOTAL:45 PERIODS
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1 : Analyze various scheduling algorithms and process synchronization.
CO2 : Explain deadlock prevention and avoidance algorithms.
CO3 : Compare and contrast various memory management schemes.
CO4 : Explain the functionality of file systems, I/O systems, and Virtualization
CO5 : Compare iOS and Android Operating Systems.

TEXT BOOKS:
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”‖,
10th Edition, John Wiley and Sons Inc., 2018.
2. Andrew S Tanenbaum, "Modern Operating Systems", Pearson, 5th Edition, 2022 New Delhi.
REFERENCES:
1. Ramaz Elmasri, A. Gil Carrick, David Levine, “ Operating Systems – A Spiral Approach”,
Tata McGraw Hill Edition, 2010.
2. William Stallings, "Operating Systems: Internals and Design Principles", 7th Edition,
Prentice Hall, 2018.
3. Achyut S.Godbole, Atul Kahate, “Operating Systems”, McGraw Hill Education, 2016.

85
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 2 2 - - - - 3 2 3 1 1 2 2
2 2 2 3 1 1 - - - 2 1 1 2 2 1 2
3 1 3 2 2 1 - - - 2 2 1 1 1 2 2
4 1 3 3 3 - - - - 1 2 1 2 1 3 2
5 3 1 2 1 1 - - - 3 2 3 2 2 2 1
AVg. 2 2 2 2 1 - - - 2 2 2 2 1 2 2
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

GE3451 ENVIRONMENTAL SCIENCES AND SUSTAINABILITY L T P C

2 0 0 2
COURSE OBJECTIVES:
 To introduce the basic concepts of environment, ecosystems and biodiversity and emphasize
on the biodiversity of India and its conservation.
 To impart knowledge on the causes, effects and control or prevention measures of
environmental pollution and natural disasters.
 To facilitate the understanding of global and Indian scenario of renewable and nonrenewable
resources, causes of their degradation and measures to preserve them.
 To familiarize the concept of sustainable development goals and appreciate the
interdependence of economic and social aspects of sustainability, recognize and analyze
climate changes, concept of carbon credit and the challenges of environmental
management.
 To inculcate and embrace sustainability practices and develop a broader understanding on
green materials, energy cycles and analyze the role of sustainable urbanization.

UNIT I ENVIRONMENT AND BIODIVERSITY 6

Definition, scope and importance of environment – need for public awareness. Eco-system and
Energy flow– ecological succession. Types of biodiversity: genetic, species and ecosystem
diversity– values of biodiversity, India as a mega-diversity nation – hot-spots of biodiversity – threats
to biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts – endangered and endemic
species of India – conservation of biodiversity: In-situ and ex-situ.

UNIT II ENVIRONMENTAL POLLUTION 9

Causes, Effects and Preventive measures of Water, Soil, Air and Noise Pollutions.
Solid, Hazardous and E-Waste management. Case studies on Occupational Health and Safety
Management system (OHASMS). Environmental protection, Environmental protection acts .

UNIT III RENEWABLE SOURCES OF ENERGY 6

Energy management and conservation, New Energy Sources: Need of new sources. Different types
new energy sources. Applications of- Hydrogen energy, Ocean energy resources, Tidal energy
conversion. Concept, origin and power plants of geothermal energy.

UNIT IV SUSTAINABILITY AND MANAGEMENT 6

Development , GDP ,Sustainability- concept, needs and challenges-economic, social and aspects
of sustainability-from unsustainability to sustainability-millennium development goals, and protocols-

86
Sustainable Development Goals-targets, indicators and intervention areas Climate change- Global,
Regional and local environmental issues and possible solutions-case studies. Concept of Carbon
Credit, Carbon Footprint. Environmental management in industry-A case study.

UNIT V SUSTAINABILITY PRACTICES 6

Zero waste and R concept, Circular economy, ISO 14000 Series, Material Life cycle assessment,
Environmental Impact Assessment. Sustainable habitat: Green buildings, Green materials, Energy
efficiency, Sustainable transports. Sustainable energy: Non-conventional Sources, Energy Cycles-
carbon cycle, emission and sequestration, Green Engineering: Sustainable urbanization- Socio-
economical and technological change.
TOTAL: 30 PERIODS
COURSE OUTCOMES:
CO1:To recognize and understand the functions of environment, ecosystems and biodiversity and
their conservation.
CO2:To identify the causes, effects of environmental pollution and natural disasters and contribute
to the preventive measures in the society.
CO3:To identify and apply the understanding of renewable and non-renewable resources and
contribute to the sustainable measures to preserve them for future generations.
CO4:To recognize the different goals of sustainable development and apply them for suitable
technological advancement and societal development.
CO5:To demonstrate the knowledge of sustainability practices and identify green materials, energy
cycles and the role of sustainable urbanization.

TEXT BOOKS:
1. Anubha Kaushik and C. P. Kaushik’s “Perspectives in Environmental Studies”, 6th Edition,
New Age International Publishers ,2018.
2. Benny Joseph, ‘Environmental Science and Engineering’, Tata McGraw-Hill, New Delhi,
2016.
3. Gilbert M.Masters, ‘Introduction to Environmental Engineering and Science’, 2nd edition,
Pearson Education, 2004.
4. Allen, D. T. and Shonnard, D. R., Sustainability Engineering: Concepts, Design and Case
Studies, Prentice Hall.
5. Bradley. A.S; Adebayo, A.O., Maria, P. Engineering applications in sustainable design and
development, Cengage learning.
6. Environment Impact Assessment Guidelines, Notification of Government of India, 2006.
7. Mackenthun, K.M., Basic Concepts in Environmental Management, Lewis Publication,
London, 1998.

REFERENCES :
1. R.K. Trivedi, ‘Handbook of Environmental Laws, Rules, Guidelines, Compliances and
Standards’, Vol. I and II, Enviro Media. 38 . edition 2010.
2. Cunningham, W.P. Cooper, T.H. Gorhani, ‘Environmental Encyclopedia’, Jaico Publ., House,
Mumbai, 2001.
3. Dharmendra S. Sengar, ‘Environmental law’, Prentice hall of India PVT. LTD, New Delhi, 2007.
4. Rajagopalan, R, ‘Environmental Studies-From Crisis to Cure’, Oxford University Press, Third
Edition, 2015.
5. Erach Bharucha “Textbook of Environmental Studies for Undergraduate Courses” Orient
Blackswan Pvt. Ltd. 2013.
87
 CO’s-PO’s & PSO’s MAPPING
CO PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 1 - - - 2 3 - - - - 2 - - -
2 3 2 - - - 3 3 - - - - 2 - - -
3 3 - 1 - - 2 2 - - - - 2 - - -
4 3 2 1 1 - 2 2 - - - - 2 - - -
5 3 2 1 - - 2 2 - - - - 1 - - -
Avg. 2.8 1.8 1 1 - 2.2 2.4 - - - - 1.8 - - -
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CS3461 OPERATING SYSTEMS LABORATORY L T P C

0 0 3 1.5
COURSE OBJECTIVES:
 To install windows operating systems.
 To understand the basics of Unix command and shell programming.
 To implement various CPU scheduling algorithms.
 To implement Deadlock Avoidance and Deadlock Detection Algorithms
 To implement Page Replacement Algorithms
 To implement various memory allocation methods.
 To be familiar with File Organization and File Allocation Strategies.

LIST OF EXPERIMENTS:
1. Installation of windows operating system
2. Illustrate UNIX commands and Shell Programming
3. Process Management using System Calls : Fork, Exit, Getpid, Wait, Close
4. Write C programs to implement the various CPU Scheduling Algorithms
5. Illustrate the inter process communication strategy
6. Implement mutual exclusion by Semaphore
7. Write C programs to avoid Deadlock using Banker's Algorithm
8. Write a C program to Implement Deadlock Detection Algorithm
9. Write C program to implement Threading
10. Implement the paging Technique using C program
11. Write C programs to implement the following Memory Allocation Methods
a. First Fit b. Worst Fit c. Best Fit
12. Write C programs to implement the various Page Replacement Algorithms
13. Write C programs to Implement the various File Organization Techniques
14. Implement the following File Allocation Strategies using C programs
a. Sequential b. Indexed c. Linked
15. Write C programs for the implementation of various disk scheduling algorithms

88
 16. Install any guest operating system like Linux using VMware.
TOTAL:45 PERIODS
COURSE OUTCOMES:
At th end of this course, the students will be able to:
CO1 : Define and implement UNIX Commands.
CO2 : Compare the performance of various CPU Scheduling Algorithms.
CO3 : Compare and contrast various Memory Allocation Methods.
CO4 :Define File Organization and File Allocation Strategies.
CO5 : Implement various Disk Scheduling Algorithms.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 3 1 1 - - - 1 3 3 3 2 1 3
2 3 1 1 2 2 - - - 3 2 1 1 3 1 2
3 3 3 2 1 2 - - - 3 3 1 2 2 2 2
4 1 2 2 3 2 - - - 3 1 3 1 1 2 1
5 2 2 1 1 3 - - - 1 2 2 3 1 3 3
AVg. 2 2 2 2 2 - - - 2 2 2 2 2 2 2
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3481 DATABASE MANAGEMENT SYSTEMS LABORATORY L T P C

0 0 3 1.5
COURSE OBJECTIVES:
 To learn and implement important commands in SQL.
 To learn the usage of nested and joint queries.
 To understand functions, procedures and procedural extensions of databases.
 To understand design and implementation of typical database applications.
 To be familiar with the use of a front end tool for GUI based application development.

LIST OF EXPERIMENTS:
1. Create a database table, add constraints (primary key, unique, check, Not null), insert rows,
update and delete rows using SQL DDL and DML commands.
2. Create a set of tables, add foreign key constraints and incorporate referential integrity.
3. Query the database tables using different ‘where’ clause conditions and also implement
aggregate functions.
4. Query the database tables and explore sub queries and simple join operations.
5. Query the database tables and explore natural, equi and outer joins.
6. Write user defined functions and stored procedures in SQL.
7. Execute complex transactions and realize DCL and TCL commands.
8. Write SQL Triggers for insert, delete, and update operations in a database table.
9. Create View and index for database tables with a large number of records.
10. Create an XML database and validate it using XML schema.
11. Create Document, column and graph based data using NOSQL database tools.
12. Develop a simple GUI based database application and incorporate all the above-
mentioned features
13. Case Study using any of the real life database applications from the following list
89
 a) Inventory Management for a EMart Grocery Shop
b) Society Financial Management
c) Cop Friendly App – Eseva
d) Property Management – eMall
e) Star Small and Medium Banking and Finance
● Build Entity Model diagram. The diagram should align with the business and functional
goals stated in the application.
● Apply Normalization rules in designing the tables in scope.
● Prepared applicable views, triggers (for auditing purposes), functions for enabling
enterprise grade features.
● Build PL SQL / Stored Procedures for Complex Functionalities, ex EOD Batch
Processing for calculating the EMI for Gold Loan for each eligible Customer.
● Ability to showcase ACID Properties with sample queries with appropriate settings
TOTAL: 45 PERIODS
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Create databases with different types of key constraints.
CO2: Construct simple and complex SQL queries using DML and DCL commands.
CO3: Use advanced features such as stored procedures and triggers and incorporate in GUI based
application development.
CO4: Create an XML database and validate with meta-data (XML schema).
CO5: Create and manipulate data using NOSQL database.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 3 3 - - - - 3 1 3 2 2 3 2
2 2 2 3 2 2 - - - 1 2 3 3 2 1 2
3 3 3 2 1 1 - - - 1 1 1 3 2 3 3
4 1 3 3 3 1 - - - 1 1 3 2 3 1 3
5 3 2 1 1 1 - - - 2 2 3 1 3 1 2
AVg. 2 3 2 2 1 - - - 2 1 3 2 2 2 2
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3591 COMPUTER NETWORKS L T PC

3 0 2 4
COURSE OBJECTIVES:
 To understand the concept of layering in networks.
 To know the functions of protocols of each layer of TCP/IP protocol suite.
 To visualize the end-to-end flow of information.
 To learn the functions of network layer and the various routing protocols
 To familiarize the functions and protocols of the Transport layer

90
UNIT I INTRODUCTION AND APPLICATION LAYER 10
Data Communication - Networks – Network Types – Protocol Layering – TCP/IP Protocol suite –
OSI Model – Introduction to Sockets - Application Layer protocols: HTTP – FTP – Email protocols
(SMTP - POP3 - IMAP - MIME) – DNS – SNMP
UNIT II TRANSPORT LAYER 9
Introduction - Transport-Layer Protocols: UDP – TCP: Connection Management – Flow control -
Congestion Control - Congestion avoidance (DECbit, RED) – SCTP – Quality of Service

UNIT III NETWORK LAYER 7

Switching : Packet Switching - Internet protocol - IPV4 – IP Addressing – Subnetting - IPV6, ARP,
RARP, ICMP, DHCP

UNIT IV ROUTING 7
Routing and protocols: Unicast routing - Distance Vector Routing - RIP - Link State Routing – OSPF
– Path-vector routing - BGP - Multicast Routing: DVMRP – PIM.

UNIT V DATA LINK AND PHYSICAL LAYERS 12

Data Link Layer – Framing – Flow control – Error control – Data-Link Layer Protocols – HDLC –
PPP - Media Access Control – Ethernet Basics – CSMA/CD – Virtual LAN – Wireless LAN
(802.11) - Physical Layer: Data and Signals - Performance – Transmission media- Switching –
Circuit Switching.
45 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Learn to use commands like tcpdump, netstat, ifconfig, nslookup and traceroute. Capture
ping and trace route PDUs using a network protocol analyzer and examine.
2. Write a HTTP web client program to download a web page using TCP sockets.
3. Applications using TCP sockets like: a) Echo client and echo server b) Chat
4. Simulation of DNS using UDP sockets.
5. Use a tool like Wireshark to capture packets and examine the packets
6. Write a code simulating ARP /RARP protocols.
7. Study of Network simulator (NS) and Simulation of Congestion Control Algorithms using NS.
8. Study of TCP/UDP performance using Simulation tool.
9. Simulation of Distance Vector/ Link State Routing algorithm.
10. Simulation of an error correction code (like CRC)

COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO 1: Explain the basic layers and its functions in computer networks.
CO 2: Understand the basics of how data flows from one node to another.
CO 3: Analyze routing algorithms.
CO 4: Describe protocols for various functions in the network.
CO 5: Analyze the working of various application layer protocols.
TOTAL:75 PERIODS
TEXT BOOKS
1. James F. Kurose, Keith W. Ross, Computer Networking, A Top-Down Approach Featuring the
Internet, Eighth Edition, Pearson Education, 2021.
2. Behrouz A. Forouzan, Data Communications and Networking with TCP/IP Protocol Suite, Sixth
Edition TMH, 2022
91
REFERENCES
1. Larry L. Peterson, Bruce S. Davie, Computer Networks: A Systems Approach, Fifth Edition,
Morgan Kaufmann Publishers Inc., 2012.
2. William Stallings, Data and Computer Communications, Tenth Edition, Pearson Education,
2013.
3. Nader F. Mir, Computer and Communication Networks, Second Edition, Prentice Hall, 2014.
4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source
Approach”, McGraw Hill, 2012.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 - 2 - - - - - - - - - 3 - -
2 - 1 - - 2 - - - - - - 2 - 2 -
3 - 2 - - 3 - - - - - - - - 3 -
4 - - 1 2 - - - - 3 - - - - -
5 - 3 2 - - - - - - - - - - - 3
AVg. - 1 - - 1 - - - - 1 - - - 1 1
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3501 COMPILER DESIGN LTPC

3 024

COURSE OBJECTIVES:
 To learn the various phases of compiler.
 To learn the various parsing techniques.
 To understand intermediate code generation and run-time environment.
 To learn to implement the front-end of the compiler.
 To learn to implement code generator.
 To learn to implement code optimization.

UNIT I INTRODUCTION TO COMPILERS & LEXICAL ANALYSIS 8

Introduction- Translators- Compilation and Interpretation- Language processors -The Phases of

Compiler – Lexical Analysis – Role of Lexical Analyzer – Input Buffering – Specification of Tokens
– Recognition of Tokens – Finite Automata – Regular Expressions to Automata NFA, DFA –
Minimizing DFA - Language for Specifying Lexical Analyzers – Lex tool.

UNIT II SYNTAX ANALYSIS 11

Role of Parser – Grammars – Context-free grammars – Writing a grammar Top Down Parsing -
General Strategies - Recursive Descent Parser Predictive Parser-LL(1) - Parser-Shift Reduce
Parser-LR Parser- LR (0)Item Construction of SLR Parsing Table - Introduction to LALR Parser -
Error Handling and Recovery in Syntax Analyzer-YACC tool - Design of a syntax Analyzer for a
Sample Language

92
UNIT III SYNTAX DIRECTED TRANSLATION & INTERMEDIATE CODE GENERATION 9

Syntax directed Definitions-Construction of Syntax Tree-Bottom-up Evaluation of S-Attribute

Definitions- Design of predictive translator - Type Systems-Specification of a simple type Checker-
Equivalence of Type Expressions-Type Conversions. Intermediate Languages: Syntax Tree, Three
Address Code, Types and Declarations, Translation of Expressions, Type Checking, Back
patching.

UNIT IV RUN-TIME ENVIRONMENT AND CODE GENERATION 9

Runtime Environments – source language issues – Storage organization – Storage Allocation

Strategies: Static, Stack and Heap allocation - Parameter Passing-Symbol Tables - Dynamic
Storage Allocation - Issues in the Design of a code generator – Basic Blocks and Flow graphs -
Design of a simple Code Generator - Optimal Code Generation for Expressions– Dynamic
Programming Code Generation.

UNIT V CODE OPTIMIZATION 8

Principal Sources of Optimization – Peep-hole optimization - DAG- Optimization of Basic Blocks -
Global Data Flow Analysis - Efficient Data Flow Algorithm – Recent trends in Compiler Design.
45 PERIODS
LIST OF EXPERIMENTS:

1. Using the LEX tool, Develop a lexical analyzer to recognize a few patterns in C. (Ex.
identifiers, constants, comments, operators etc.). Create a symbol table, while recognizing
identifiers.
2. Implement a Lexical Analyzer using LEX Tool
3. Generate YACC specification for a few syntactic categories.

a. Program to recognize a valid arithmetic expression that uses operator +, -, * and /.

b. Program to recognize a valid variable which starts with a letter followed by any
number of letters or digits.
c. Program to recognize a valid control structures syntax of C language (For loop,
while loop, if-else, if-else-if, switch-case, etc.).
d. Implementation of calculator using LEX and YACC

4. Generate three address code for a simple program using LEX and YACC.
5. Implement type checking using Lex and Yacc.
6. Implement simple code optimization techniques (Constant folding, Strength reduction and
Algebraic transformation)
7. Implement back-end of the compiler for which the three address code is given as input and
the 8086 assembly language code is produced as output.
30 PERIODS
TOTAL: 75 PERIODS
COURSE OUTCOMES:
On Completion of the course, the students should be able to:

CO1:Understand the techniques in different phases of a compiler.

CO2:Design a lexical analyser for a sample language and learn to use the LEX tool.
CO3:Apply different parsing algorithms to develop a parser and learn to use YACC tool
CO4:Understand semantics rules (SDT), intermediate code generation and run-time environment.
93
CO5:Implement code generation and apply code optimization techniques.

TEXT BOOK:

1. Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman, “Compilers: Principles,
Techniques and Tools”, Second Edition, Pearson Education, 2009.

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. V. Raghavan, Principles of Compiler Design‖, Tata McGraw Hill Education Publishers, 2010.
5. Allen I. Holub, Compiler Design in C‖, Prentice-Hall Software Series, 1993.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 3 3 - - - - 3 3 1 3 2 3 2
2 3 3 3 3 3 - - - 3 2 3 2 2 1 2
3 3 3 2 2 3 - - - 3 1 1 1 2 2 3
4 3 2 2 1 1 - - - 2 3 2 3 1 2 1
5 3 3 3 2 1 - - - 2 1 1 3 2 1 2
AVg. 3.00 2.80 2.60 2.20 2.00 - - - 2.60 2.00 1.60 2.40 1.80 1.80 2.00
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CB3491 CRYPTOGRAPHY AND CYBER SECURITY L T P C

3 0 0 3
COURSE OBJECTIVES:
 Learn to analyze the security of in-built cryptosystems.
 Know the fundamental mathematical concepts related to security.
 Develop cryptographic algorithms for information security.
 Comprehend the various types of data integrity and authentication schemes
 Understand cyber crimes and cyber security.

UNIT I INTRODUCTION TO SECURITY 9

Computer Security Concepts – The OSI Security Architecture – Security Attacks – Security Services
and Mechanisms – A Model for Network Security – Classical encryption techniques: Substitution
techniques, Transposition techniques, Steganography – Foundations of modern cryptography:
Perfect security – Information Theory – Product Cryptosystem – Cryptanalysis.

UNIT II SYMMETRIC CIPHERS 9

Number theory – Algebraic Structures – Modular Arithmetic - Euclid‘s algorithm – Congruence and
matrices – Group, Rings, Fields, Finite Fields

94
SYMMETRIC KEY CIPHERS: SDES – Block Ciphers – DES, Strength of DES – Differential and
linear cryptanalysis – Block cipher design principles – Block cipher mode of operation – Evaluation
criteria for AES – Pseudorandom Number Generators – RC4 – Key distribution.

UNIT III ASYMMETRIC 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 – Diffie
Hellman key exchange -– Elliptic curve arithmetic – Elliptic curve cryptography.

UNIT IV INTEGRITY AND AUTHENTICATION ALGORITHMS 9

Authentication requirement – Authentication function – MAC – Hash function – Security of hash
function: HMAC, CMAC – SHA – Digital signature and authentication protocols – DSS – Schnorr
Digital Signature Scheme – ElGamal cryptosystem – Entity Authentication: Biometrics, Passwords,
Challenge Response protocols – Authentication applications – Kerberos
MUTUAL TRUST: Key management and distribution – Symmetric key distribution using symmetric
and asymmetric encryption – Distribution of public keys – X.509 Certificates.

UNIT V CYBER CRIMES AND CYBER SECURITY 9

Cyber Crime and Information Security – classifications of Cyber Crimes – Tools and Methods –
Password Cracking, Keyloggers, Spywares, SQL Injection – Network Access Control – Cloud
Security – Web Security – Wireless Security

TOTAL:45 PERIODS

COURSE OUTCOMES:
CO1: Understand the fundamentals of networks security, security architecture, threats and
vulnerabilities
CO2: Apply the different cryptographic operations of symmetric cryptographic algorithms
CO3: Apply the different cryptographic operations of public key cryptography
CO4: Apply the various Authentication schemes to simulate different applications.
CO5: Understand various cyber crimes and cyber security.

TEXT BOOKS
1. William Stallings, "Cryptography and Network Security - Principles and Practice", Seventh
Edition, Pearson Education, 2017.
2. Nina Godbole, Sunit Belapure, “Cyber Security: Understanding Cyber crimes, Computer
Forensics and Legal Perspectives”, First Edition, Wiley India, 2011.

REFERENCES
1. Behrouz A. Ferouzan, Debdeep Mukhopadhyay, "Cryptography and Network Security", 3rd
Edition, Tata Mc Graw Hill, 2015.
2. Charles Pfleeger, Shari Pfleeger, Jonathan Margulies, "Security in Computing", Fifth Edition,
Prentice Hall, New Delhi, 2015.

95
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 1 2 2 - - - 1 - - 1 2 3 3
2 3 3 3 3 3 - - - 2 - - 1 3 3 3
3 3 3 3 3 3 - - - 2 - - 1 3 3 3
4 3 3 3 3 3 - - - 2 - - 1 3 3 3
5 3 2 3 2 3 - - - 3 - - 2 3 2 3
AVg. 3 2.6 2.6 2.6 2.8 - - - 2 - - 1.2 2.8 2.8 3
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3551 DISTRIBUTED COMPUTING L T P C

3 0 0 3
COURSE OBJECTIVES:
 To introduce the computation and communication models of distributed systems
 To illustrate the issues of synchronization and collection of information in distributed systems
 To describe distributed mutual exclusion and distributed deadlock detection techniques
 To elucidate agreement protocols and fault tolerance mechanisms in distributed systems
 To explain the cloud computing models and the underlying concepts

UNIT I INTRODUCTION 8
Introduction: Definition-Relation to Computer System Components – Motivation – Message -Passing
Systems versus Shared Memory Systems – Primitives for Distributed Communication –
Synchronous versus Asynchronous Executions – Design Issues and Challenges; A Model of
Distributed Computations: A Distributed Program – A Model of Distributed Executions – Models of
Communication Networks – Global State of a Distributed System.

UNIT II LOGICAL TIME AND GLOBAL STATE 10

Logical Time: Physical Clock Synchronization: NTP – A Framework for a System of Logical Clocks
– Scalar Time – Vector Time; Message Ordering and Group Communication: Message Ordering
Paradigms – Asynchronous Execution with Synchronous Communication – Synchronous Program
Order on Asynchronous System – Group Communication – Causal Order – Total Order; Global
State and Snapshot Recording Algorithms: Introduction – System Model and Definitions – Snapshot
Algorithms for FIFO Channels.

UNIT III DISTRIBUTED MUTEX AND DEADLOCK 10

Distributed Mutual exclusion Algorithms: Introduction – Preliminaries – Lamport’s algorithm – Ricart-
Agrawala’s Algorithm –– Token-Based Algorithms – Suzuki-Kasami’s Broadcast Algorithm;
Deadlock Detection in Distributed Systems: Introduction – System Model – Preliminaries – Models
of Deadlocks – Chandy-Misra-Haas Algorithm for the AND model and OR Model.

UNIT IV CONSENSUS AND RECOVERY 10

Consensus and Agreement Algorithms: Problem Definition – Overview of Results – Agreement in a
Failure-Free System(Synchronous and Asynchronous) – Agreement in Synchronous Systems with
Failures; Checkpointing and Rollback Recovery: Introduction – Background and Definitions – Issues
in Failure Recovery – Checkpoint-based Recovery – Coordinated Checkpointing Algorithm -
- Algorithm for Asynchronous Checkpointing and Recovery
96
UNIT V CLOUD COMPUTING 7
Definition of Cloud Computing – Characteristics of Cloud – Cloud Deployment Models – Cloud
Service Models – Driving Factors and Challenges of Cloud – Virtualization – Load Balancing –
Scalability and Elasticity – Replication – Monitoring – Cloud Services and Platforms: Compute
Services – Storage Services – Application Services

COURSE OUTCOMES:
Upon the completion of this course, the student will be able to
CO1: Explain the foundations of distributed systems (K2)
CO2: Solve synchronization and state consistency problems (K3)
CO3 Use resource sharing techniques in distributed systems (K3)
CO4: Apply working model of consensus and reliability of distributed systems (K3)
CO5: Explain the fundamentals of cloud computing (K2)
TOTAL:45 PERIODS
TEXT BOOKS
1. Kshemkalyani Ajay D, Mukesh Singhal, “Distributed Computing: Principles, Algorithms and
Systems”, Cambridge Press, 2011.
2. Mukesh Singhal, Niranjan G Shivaratri, “Advanced Concepts in Operating systems”, Mc-
Graw Hill Publishers, 1994.

REFERENCES
1. George Coulouris, Jean Dollimore, Time Kindberg, “Distributed Systems Concepts and
Design”, Fifth Edition, Pearson Education, 2012.
2. Pradeep L Sinha, “Distributed Operating Systems: Concepts and Design”, Prentice Hall of
India, 2007.
3. Tanenbaum A S, Van Steen M, “Distributed Systems: Principles and Paradigms”, Pearson
Education, 2007.
4. Liu M L, “Distributed Computing: Principles and Applications”, Pearson Education, 2004.
5. Nancy A Lynch, “Distributed Algorithms”, Morgan Kaufman Publishers, 2003.
6. Arshdeep Bagga, Vijay Madisetti, “ Cloud Computing: A Hands-On Approach”, Universities
Press, 2014.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 3 3 1 - - - 2 1 3 3 2 1 1
2 1 3 2 1 2 - - - 2 2 2 2 1 3 2
3 2 2 1 3 3 - - - 3 2 1 1 1 2 1
4 1 2 2 3 1 - - - 3 3 2 1 3 1 1
5 3 3 1 2 3 - - - 3 3 3 1 3 2 3
AVg. 1.8 2.4 1.8 2.4 2 - - - 2.6 2.2 2.2 1.6 2 1.8 1.6
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

97
CCS356 OBJECT ORIENTED SOFTWARE ENGINEERING LTPC
3 024
COURSE OBJECTIVES:
 To understand Software Engineering Lifecycle Models
 To Perform software requirements analysis
 To gain knowledge of the System Analysis and Design concepts using UML.
 To understand software testing and maintenance approaches
 To work on project management scheduling using DevOps

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-Case Study.

UNIT II REQUIREMENTS ANALYSIS AND SPECIFICATION 9

Requirement analysis and specification – Requirements gathering and analysis – Software
Requirement Specification – Formal system specification – Finite State Machines – Petrinets –
Object modelling using UML – Use case Model – Class diagrams – Interaction diagrams – Activity
diagrams – State chart diagrams – Functional modelling – Data Flow Diagram- CASE TOOLS.

UNIT III SOFTWARE DESIGN 9

Software design – Design process – Design concepts – Coupling – Cohesion – Functional
independence – Design patterns – Model-view-controller – Publish-subscribe – Adapter – Command
– Strategy – Observer – Proxy – Facade – Architectural styles – Layered - Client Server - Tiered -
Pipe and filter- User interface design-Case Study.

UNIT IV SOFTWARE TESTING AND MAINTENANCE 9

Testing – Unit testing – Black box testing– White box testing – Integration and System testing–
Regression testing – Debugging - Program analysis – Symbolic execution – Model Checking-Case
Study

UNIT V PROJECT MANAGEMENT 9

Software Project Management- Software Configuration Management - Project Scheduling- DevOps:
Motivation-Cloud as a platform-Operations- Deployment Pipeline:Overall Architecture Building and
Testing-Deployment- Tools- Case Study

COURSE OUTCOMES:
CO1: Compare various Software Development Lifecycle Models
CO2: Evaluate project management approaches as well as cost and schedule estimation
strategies.
CO3: Perform formal analysis on specifications.
CO4: Use UML diagrams for analysis and design.
CO5: Architect and design using architectural styles and design patterns, and test the system
45 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
LIST OF EXPERIMENTS:
1. Identify a software system that needs to be developed.
2. Document the Software Requirements Specification (SRS) for the identified system.
3. Identify use cases and develop the Use Case model.
98
 4. Identify the conceptual classes and develop a Domain Model and also derive a Class
Diagram from that.
5. Using the identified scenarios, find the interaction between objects and represent them using
UML Sequence and Collaboration Diagrams
6. Draw relevant State Chart and Activity Diagrams for the same system.
7. Implement the system as per the detailed design
8. Test the software system for all the scenarios identified as per the usecase diagram
9. Improve the reusability and maintainability of the software system by applying appropriate
design patterns.
10. Implement the modified system and test it for various scenarios.

SUGGESTED DOMAINS FOR MINI-PROJECT:

1. Passport automation system.
2. Book bank
3. Exam registration
4. Stock maintenance system.
5. Online course reservation system
6. Airline/Railway reservation system
7. Software personnel management system
8. Credit card processing
9. e-book management system
10. Recruitment system
11. Foreign trading system
12. Conference management system
13. BPO management system
14. Library management system
15. Student information system
TOTAL:75 PERIODS
TEXT BOOKS
1. Bernd Bruegge and Allen H. Dutoit, “Object-Oriented Software Engineering: Using UML,
Patterns and Java”, Third Edition, Pearson Education, 2009.
2. Roger S. Pressman, Object-Oriented Software Engineering: An Agile Unified Methodology,
First Edition, Mc Graw-Hill International Edition, 2014.

REFERENCES
1. Carlo Ghezzi, Mehdi Jazayeri, Dino Mandrioli, Fundamentals of Software Engineering, 2nd
edition, PHI Learning Pvt. Ltd., 2010.
2. Craig Larman, Applying UML and Patterns, 3rd ed, Pearson Education, 2005.
3. Len Bass, Ingo Weber and Liming Zhu, “DevOps: A Software Architect‘s Perspective”,
Pearson Education, 2016
4. Rajib Mall, Fundamentals of Software Engineering, 3rd edition, PHI Learning Pvt. Ltd., 2009.
5. Stephen Schach, Object-Oriented and Classical Software Engineering, 8th ed, McGraw-Hill,
2010.

99
 CO’s-PO’s & PSO’s MAPPING
PO’s PSO’s
CO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 1 2 2 - - - - 1 1 2 2 2 1
2 2 3 2 3 2 - - - 2 2 3 2 3 2 1
3 2 3 2 1 1 - - - 2 2 3 2 2 3 1
4 2 3 2 2 3 - - - 2 2 3 2 2 3 1
5 2 3 1 2 2 - - - - - - 1 3 2 2
AVg. 2 2 1 2 2 - - - - 1 1 2 2 2 1
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CS3691 EMBEDDED SYSTEMS AND IOT L T P C

3 0 2 4
COURSE OBJECTIVES:
 To learn the internal architecture and programming of an embedded processor.
 To introduce interfacing I/O devices to the processor.
 To introduce the evolution of the Internet of Things (IoT).
 To build a small low-cost embedded and IoT system using Arduino/Raspberry Pi/ open
platform.
 To apply the concept of Internet of Things in real world scenario.

UNIT I 8-BIT EMBEDDED PROCESSOR 9

8-Bit Microcontroller – Architecture – Instruction Set and Programming – Programming Parallel Ports
– Timers and Serial Port – Interrupt Handling.

UNIT II EMBEDDED C PROGRAMMING 9

Memory And I/O Devices Interfacing – Programming Embedded Systems in C – Need For RTOS –
Multiple Tasks and Processes – Context Switching – Priority Based Scheduling Policies.

UNIT III IOT AND ARDUINO PROGRAMMING 9

Introduction to the Concept of IoT Devices – IoT Devices Versus
Computers – IoT Configurations – Basic Components – Introduction to Arduino – Types of Arduino
– Arduino Toolchain – Arduino Programming Structure – Sketches – Pins – Input/Output From Pins
Using Sketches – Introduction to Arduino Shields – Integration of Sensors and Actuators with
Arduino.

UNIT IV IOT COMMUNICATION AND OPEN PLATFORMS 9

IoT Communication Models and APIs – IoT Communication Protocols – Bluetooth – WiFi – ZigBee
– GPS – GSM modules – Open Platform (like Raspberry Pi) – Architecture – Programming –
Interfacing – Accessing GPIO Pins – Sending and Receiving Signals Using GPIO Pins – Connecting
to the Cloud.

UNIT V APPLICATIONS DEVELOPMENT 9

Complete Design of Embedded Systems – Development of IoT Applications – Home Automation –
Smart Agriculture – Smart Cities – Smart Healthcare.

45 PERIODS
100
 PRACTICAL EXERCISES: 30 PERIODS
1. Write 8051 Assembly Language experiments using simulator.
2. Test data transfer between registers and memory.
3. Perform ALU operations.
4. Write Basic and arithmetic Programs Using Embedded C.
5. Introduction to Arduino platform and programming
6. Explore different communication methods with IoT devices (Zigbee, GSM, Bluetooth)
7. Introduction to Raspberry PI platform and python programming
8. Interfacing sensors with Raspberry PI
9. Communicate between Arduino and Raspberry PI using any wireless medium
10. Setup a cloud platform to log the data
11. Log Data using Raspberry PI and upload to the cloud platform
12. Design an IOT based system

COURSE OUTCOMES:
CO1: Explain the architecture of embedded processors.
CO2: Write embedded C programs.
CO3: Design simple embedded applications.
CO4: Compare the communication models in IOT
CO5: Design IoT applications using Arduino/Raspberry Pi /open platform.
TOTAL :75 PERIODS
TEXTBOOKS
1. Muhammed Ali Mazidi, Janice Gillispie Mazidi, Rolin D. McKinlay, “The 8051 Microcontroller
and Embedded Systems”, Pearson Education, Second Edition, 2014
2. Robert Barton, Patrick Grossetete, David Hanes, Jerome Henry, Gonzalo Salgueiro, “IoT
Fundamentals: Networking Technologies, Protocols, and Use Cases for the Internet of
Things”, CISCO Press, 2017.

REFERENCES
1. Michael J. Pont, “Embedded C”, Pearson Education, 2007.
2. Wayne Wolf, “Computers as Components: Principles of Embedded Computer System
Design”, Elsevier, 2006.
3. Andrew N Sloss, D. Symes, C. Wright, “Arm System Developer's Guide”, Morgan Kauffman/
Elsevier, 2006.
4. Arshdeep Bahga, Vijay Madisetti, “Internet of Things – A hands-on approach”, Universities
Press, 2015

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 3 3 - - - - 1 2 3 3 2 1 3
2 2 1 3 2 2 - - - 1 2 2 3 3 1 3
3 3 1 3 3 1 - - - 1 2 1 1 1 3 3
4 3 2 3 2 1 - - - 1 2 2 3 2 2 1
5 2 3 3 2 2 - - - 1 3 3 2 3 1 3
AVg. 2.6 2 3 2.4 1.5 - - - 1 2.2 2.2 2.4 2.2 1.6 2.6
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

101
CS3711 SUMMER INTERNSHIP LTPC
0 00 2
COURSE OBJECTIVES:
To enable the students to
 Get connected with reputed industry/ laboratory/academia / research institute
 Get practical knowledge on Product Development / Services and operations / Software
Design and Development / Testing / Analytics/ research/ startups/ professionalism / business
processes and insights / domain knowledge/ Industry Practices/ and other related aspects
and develop skills to solve related problems
 Develop technical, soft, team skills to cater to the needs of the industry / academia /
businesses / research / organizations in the core aspects of Automation, Digitalization

The students individually undergo training in reputed firms/ research institutes / laboratories for the
specified duration. After the completion of training, a detailed report should be submitted within ten
days from the commencement of next semester. The students will be evaluated as per the
Regulations.

No. of Weeks: 04

COURSE OUTCOMES:
On completion of the course, the student will know about
CO1: Industry Practices, Processes,Techniques, technology, automation and other core
aspects of software industry
CO2: Analyze, Design solutions to complex business problems
CO3: Build and deploy solutions for target platform
CO4: Preparation of Technical reports and presentation.

CS3811 PROJECT WORK/ INTERNSHIP# L T P C

0 0 20 10
COURSE OBJECTIVES:
To train the students
 For gaining domain knowledge, and technical skills to solve potential business / research
problems
 Gather requirements and Design suitable software solutions and evaluate
 alternatives
 To work in small teams and understand the processes and practices in the ‘industry.
 Implement, Test and deploy solutions for target platforms
 Preparing project reports and presentation

The students shall individually / or as group work on business/research domains and related
problems approved by the Department / organization that offered the internship / project.

The student can select any topic which is relevant to his/her specialization of the programme. The
student should continue the work on the selected topic as per the formulated methodology. At the
end of the semester, after completing the work to the satisfaction of the supervisor and review
102
committee, a detailed report which contains clear definition of the identified problem, detailed
literature review related to the area of work and methodology for carrying out the work, results and
discussion, conclusion and references should be prepared as per the format prescribed by the
University and submitted to the Head of the department. The students will be evaluated based on
the report and viva-voce examination by a panel of examiners as per the Regulations.

TOTAL: 300 PERIODS

COURSE OUTCOMES:
At the end of the project, the student will be able to
CO1: Gain Domain knowledge and technical skill set required for solving industry /
research problems
CO2: Provide solution architecture, module level designs, algorithms
CO3: Implement, test and deploy the solution for the target platform
CO4: Prepare detailed technical report, demonstrate and present the work

103
 VERTICALS

CCS346 EXPLORATORY DATA ANALYSIS LTPC

2 023
COURSE OBJECTIVES:
 To outline an overview of exploratory data analysis.
 To implement data visualization using Matplotlib.
 To perform univariate data exploration and analysis.
 To apply bivariate data exploration and analysis.
 To use Data exploration and visualization techniques for multivariate and time series data.

UNIT I EXPLORATORY DATA ANALYSIS 6

EDA fundamentals – Understanding data science – Significance of EDA – Making sense of data –
Comparing EDA with classical and Bayesian analysis – Software tools for EDA - Visual Aids for
EDA- Data transformation techniques-merging database, reshaping and pivoting, Transformation
techniques.

UNIT II EDA USING PYTHON 6

Data Manipulation using Pandas – Pandas Objects – Data Indexing and Selection – Operating on
Data – Handling Missing Data – Hierarchical Indexing – Combining datasets – Concat, Append,
Merge and Join – Aggregation and grouping – Pivot Tables – Vectorized String Operations.

UNIT III UNIVARIATE ANALYSIS 6

Introduction to Single variable: Distribution Variables - Numerical Summaries of Level and Spread -
Scaling and Standardizing – Inequality.

UNIT IV BIVARIATE ANALYSIS 6

Relationships between Two Variables - Percentage Tables - Analysing Contingency Tables -
Handling Several Batches - Scatterplots and Resistant Lines.

UNIT V MULTIVARIATE AND TIME SERIES ANALYSIS 6

Introducing a Third Variable - Causal Explanations - Three-Variable Contingency Tables and
Beyond – Fundamentals of TSA – Characteristics of time series data – Data Cleaning – Time-based
indexing – Visualizing – Grouping – Resampling.
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Install the data Analysis and Visualization tool: R/ Python /Tableau Public/ Power BI.
2. Perform exploratory data analysis (EDA) with datasets like email data set. Export all your
emails as a dataset, import them inside a pandas data frame, visualize them and get different
insights from the data.
3. Working with Numpy arrays, Pandas data frames , Basic plots using Matplotlib.
4. Explore various variable and row filters in R for cleaning data. Apply various plot features in
R on sample data sets and visualize.
5. Perform Time Series Analysis and apply the various visualization techniques.
6. Perform Data Analysis and representation on a Map using various Map data sets with Mouse
Rollover effect, user interaction, etc..

104
 7. Build cartographic visualization for multiple datasets involving various countries of the world;
states and districts in India etc.
8. Perform EDA on Wine Quality Data Set.
9. Use a case study on a data set and apply the various EDA and visualization techniques and
present an analysis report.

COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Understand the fundamentals of exploratory data analysis.
CO2: Implement the data visualization using Matplotlib.
CO3: Perform univariate data exploration and analysis.
CO4: Apply bivariate data exploration and analysis.
CO5: Use Data exploration and visualization techniques for multivariate and time series data.
TOTAL: 60 PERIODS
TEXT BOOKS:
1. Suresh Kumar Mukhiya, Usman Ahmed, “Hands-On Exploratory Data Analysis with Python”,
Packt Publishing, 2020. (Unit 1)
2. Jake Vander Plas, "Python Data Science Handbook: Essential Tools for Working with Data",
First Edition, O Reilly, 2017. (Unit 2)
3. Catherine Marsh, Jane Elliott, “Exploring Data: An Introduction to Data Analysis for Social
Scientists”, Wiley Publications, 2nd Edition, 2008. (Unit 3,4,5)

REFERENCES:
1. Eric Pimpler, Data Visualization and Exploration with R, GeoSpatial Training service, 2017.
2. Claus O. Wilke, “Fundamentals of Data Visualization”, O’reilly publications, 2019.
3. Matthew O. Ward, Georges Grinstein, Daniel Keim, “Interactive Data Visualization:
Foundations, Techniques, and Applications”, 2nd Edition, CRC press, 2015.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 3 3 3 - - - 2 2 3 2 3 3 2
2 2 2 2 3 3 - - - 3 2 2 2 1 2 3
3 2 3 2 2 3 - - - 2 2 2 1 2 3 1
4 2 2 2 2 3 - - - 3 2 2 1 2 2 2
5 2 2 3 2 1 - - - 1 2 2 1 2 2 3
AVg. 2.2 2.2 2.4 2.4 2.6 - - - 2.2 2 2.2 1.4 2 2.4 2.2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS360 RECOMMENDER SYSTEMS LTPC

2 023
COURSE OBJECTIVES:
 To understand the foundations of the recommender system.
 To learn the significance of machine learning and data mining algorithms for
Recommender systems
 To learn about collaborative filtering
 To make students design and implement a recommender system.

105
  To learn collaborative filtering.

UNIT I INTRODUCTION 6
Introduction and basic taxonomy of recommender systems - Traditional and non-personalized
Recommender Systems - Overview of data mining methods for recommender systems- similarity
measures- Dimensionality reduction – Singular Value Decomposition (SVD)

Suggested Activities:

 Practical learning – Implement Data similarity measures.

 External Learning – Singular Value Decomposition (SVD) applications

Suggested Evaluation Methods:

 Quiz on Recommender systems.

 Quiz of python tools available for implementing Recommender systems

UNIT II CONTENT-BASED RECOMMENDATION SYSTEMS 6

High-level architecture of content-based systems - Item profiles, Representing item profiles,
Methods for learning user profiles, Similarity-based retrieval, and Classification algorithms.

Suggested Activities:
 Assignment on content-based recommendation systems
 Assignment of learning user profiles

Suggested Evaluation Methods:

 Quiz on similarity-based retrieval.
 Quiz of content-based filtering

UNIT III COLLABORATIVE FILTERING 6

A systematic approach, Nearest-neighbor collaborative filtering (CF), user-based and item-based
CF, components of neighborhood methods (rating normalization, similarity weight computation, and
neighborhood selection

Suggested Activities:
● Practical learning – Implement collaborative filtering concepts
● Assignment of security aspects of recommender systems
Suggested Evaluation Methods:
● Quiz on collaborative filtering
● Seminar on security measures of recommender systems

UNIT IV ATTACK-RESISTANT RECOMMENDER SYSTEMS 6

Introduction – Types of Attacks – Detecting attacks on recommender systems – Individual attack –
Group attack – Strategies for robust recommender design - Robust recommendation algorithms.

Suggested Activities:
● Group Discussion on attacks and their mitigation
● Study of the impact of group attacks
106
 ● External Learning – Use of CAPTCHAs

Suggested Evaluation Methods:

● Quiz on attacks on recommender systems
● Seminar on preventing attacks using the CAPTCHAs

UNIT V EVALUATING RECOMMENDER SYSTEMS 6

Evaluating Paradigms – User Studies – Online and Offline evaluation – Goals of evaluation design
– Design Issues – Accuracy metrics – Limitations of Evaluation measures

Suggested Activities:
● Group Discussion on goals of evaluation design
● Study of accuracy metrics

Suggested Evaluation Methods:

● Quiz on evaluation design
● Problems on accuracy measures 30 PERIODS
PRACTICAL EXERCISES 30 PERIODS
1. Implement Data similarity measures using Python
2. Implement dimension reduction techniques for recommender systems
3. Implement user profile learning
4. Implement content-based recommendation systems
5. Implement collaborative filter techniques
6. Create an attack for tampering with recommender systems
7. Implement accuracy metrics like Receiver Operated Characteristic curves
TOTAL: 60 PERIODS
COURSE OUTCOMES:
On completion of the course, the students will be able to:
CO1:Understand the basic concepts of recommender systems.
CO2:Implement machine-learning and data-mining algorithms in recommender systems data sets.
CO3:Implementation of Collaborative Filtering in carrying out performance evaluation of
recommender systems based on various metrics.
CO4:Design and implement a simple recommender system.
CO5:Learn about advanced topics of recommender systems.
CO6:Learn about advanced topics of recommender systems applications

TEXTBOOKS:
1. Charu C. Aggarwal, Recommender Systems: The Textbook, Springer, 2016.
2. Dietmar Jannach , Markus Zanker , Alexander Felfernig and Gerhard Friedrich ,
Recommender Systems: An Introduction, Cambridge University Press (2011), 1st ed.
3. Francesco Ricci , Lior Rokach , Bracha Shapira , Recommender Sytems Handbook, 1st ed,
Springer (2011),
4. Jure Leskovec, Anand Rajaraman, Jeffrey David Ullman, Mining of massive datasets, 3 rd
edition, Cambridge University Press, 2020.

107
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 1 2 1 - - - 1 - - 1 - - -
2 1 2 - - 1 - - - - - - 1 - - -
3 2 3 1 - 1 - - - 2 - - - - - -
4 3 2 2 2 1 - - - 2 - - 2 - - -
5 1 1 - 2 1 - - - - - - 1 - - -
6 2 2 1 1 1 - - - - - - 1 - - -
AVg 1.83 2 0.83 1.16 1 - - - 0.83 - - 1 - - -
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS355 NEURAL NETWORKS AND DEEP LEARNING L T PC

2 0 2 3
COURSE OBJECTIVES:
 To understand the basics in deep neural networks
 To understand the basics of associative memory and unsupervised learning networks
 To apply CNN architectures of deep neural networks
 To analyze the key computations underlying deep learning, then use them to build and train
deep neural networks for various tasks.
 To apply autoencoders and generative models for suitable applications.

UNIT I INTRODUCTION 6
Neural Networks-Application Scope of Neural Networks-Artificial Neural Network: An Introduction-
Evolution of Neural Networks-Basic Models of Artificial Neural Network- Important Terminologies of
ANNs-Supervised Learning Network.

UNIT II ASSOCIATIVE MEMORY AND UNSUPERVISED LEARNING NETWORKS 6

Training Algorithms for Pattern Association-Autoassociative Memory Network-Heteroassociative
Memory Network-Bidirectional Associative Memory (BAM)-Hopfield Networks-Iterative
Autoassociative Memory Networks-Temporal Associative Memory Network-Fixed Weight
Competitive Nets-Kohonen Self-Organizing Feature Maps-Learning Vector Quantization-Counter
propagation Networks-Adaptive Resonance Theory Network.

UNIT III THIRD-GENERATION NEURAL NETWORKS 6

Spiking Neural Networks-Convolutional Neural Networks-Deep Learning Neural Networks-Extreme
Learning Machine Model-Convolutional Neural Networks: The Convolution Operation – Motivation –
Pooling – Variants of the basic Convolution Function – Structured Outputs – Data Types – Efficient
Convolution Algorithms – Neuroscientific Basis – Applications: Computer Vision, Image Generation,
Image Compression.

UNIT IV DEEP FEEDFORWARD NETWORKS 6

History of Deep Learning- A Probabilistic Theory of Deep Learning- Gradient Learning – Chain Rule
and Backpropagation - Regularization: Dataset Augmentation – Noise Robustness -Early Stopping,
Bagging and Dropout - batch normalization- VC Dimension and Neural Nets.
108
UNIT V RECURRENT NEURAL NETWORKS 6
Recurrent Neural Networks: Introduction – Recursive Neural Networks – Bidirectional RNNs – Deep
Recurrent Networks – Applications: Image Generation, Image Compression, Natural Language
Processing. Complete Auto encoder, Regularized Autoencoder, Stochastic Encoders and Decoders,
Contractive Encoders.

30 PERIODS
LAB EXPERIMENTS: 30 PERIODS
1. Implement simple vector addition in TensorFlow.
2. Implement a regression model in Keras.
3. Implement a perceptron in TensorFlow/Keras Environment.
4. Implement a Feed-Forward Network in TensorFlow/Keras.
5. Implement an Image Classifier using CNN in TensorFlow/Keras.
6. Improve the Deep learning model by fine tuning hyper parameters.
7. Implement a Transfer Learning concept in Image Classification.
8. Using a pre trained model on Keras for Transfer Learning
9. Perform Sentiment Analysis using RNN
10. Implement an LSTM based Autoencoder in TensorFlow/Keras.
11. Image generation using GAN
Additional Experiments:
12. Train a Deep learning model to classify a given image using pre trained model
13. Recommendation system from sales data using Deep Learning
14. Implement Object Detection using CNN
15. Implement any simple Reinforcement Algorithm for an NLP problem
TOTAL: 60 PERIODS
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Apply Convolution Neural Network for image processing.
CO2: Understand the basics of associative memory and unsupervised learning networks.
CO3: Apply CNN and its variants for suitable applications.
CO4: Analyze the key computations underlying deep learning and use them to build and train deep
neural networks for various tasks.
CO5: Apply autoencoders and generative models for suitable applications.

TEXT BOOKS:
1. Ian Goodfellow, Yoshua Bengio, Aaron Courville, “Deep Learning”, MIT Press, 2016.
2. Francois Chollet, “Deep Learning with Python”, Second Edition, Manning Publications,
2021.

REFERENCES:
1. Aurélien Géron, “Hands-On Machine Learning with Scikit-Learn and TensorFlow”, Oreilly,
2018.
2. Josh Patterson, Adam Gibson, “Deep Learning: A Practitioner’s Approach”, O’Reilly Media,
2017.
109
 3. Charu C. Aggarwal, “Neural Networks and Deep Learning: A Textbook”, Springer
International Publishing, 1st Edition, 2018.
4. Learn Keras for Deep Neural Networks, Jojo Moolayil, Apress,2018
5. Deep Learning Projects Using TensorFlow 2, Vinita Silaparasetty, Apress, 2020
6. Deep Learning with Python, FRANÇOIS CHOLLET, MANNING SHELTER ISLAND,2017.
7. S Rajasekaran, G A Vijayalakshmi Pai, “Neural Networks, FuzzyLogic and Genetic
Algorithm, Synthesis and Applications”, PHI Learning, 2017.
8. Pro Deep Learning with TensorFlow, Santanu Pattanayak, Apress,2017
9. James A Freeman, David M S Kapura, “Neural Networks Algorithms, Applications, and
Programming Techniques”, Addison Wesley, 2003.
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 3 2 3 1 - - 2 1 - - 2 2 1
2 3 1 2 1 - - - - - 1 2 2 - 1 -
3 3 3 3 3 3 1 - - 2 1 - - 2 2 1
4 3 3 3 3 3 - - - 2 - 2 3 2 2 2
5 1 1 3 2 3 - - - 2 - - - 1 1 -
AVg. 2.6 2 2.8 2.2 2.4 0.4 0 0 1.6 0.6 0.8 1 1.4 1.6 0.8
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS369 TEXT AND SPEECH ANALYSIS L T PC

2 0 2 3
COURSE OBJECTIVES:
 Understand natural language processing basics
 Apply classification algorithms to text documents
 Build question-answering and dialogue systems
 Develop a speech recognition system
 Develop a speech synthesizer

UNIT I NATURAL LANGUAGE BASICS 6

Foundations of natural language processing – Language Syntax and Structure- Text Preprocessing
and Wrangling – Text tokenization – Stemming – Lemmatization – Removing stop-words – Feature
Engineering for Text representation – Bag of Words model- Bag of N-Grams model – TF-IDF model

Suggested Activities
● Flipped classroom on NLP
● Implementation of Text Preprocessing using NLTK
● Implementation of TF-IDF models

Suggested Evaluation Methods

 Quiz on NLP Basics
 Demonstration of Programs

110
UNIT II TEXT CLASSIFICATION 6
Vector Semantics and Embeddings -Word Embeddings - Word2Vec model – Glove model –
FastText model – Overview of Deep Learning models – RNN – Transformers – Overview of Text
summarization and Topic Models

Suggested Activities
 Flipped classroom on Feature extraction of documents
 Implementation of SVM models for text classification
 External learning: Text summarization and Topic models

Suggested Evaluation Methods

 Assignment on above topics
 Quiz on RNN, Transformers
 Implementing NLP with RNN and Transformers

UNIT III QUESTION ANSWERING AND DIALOGUE SYSTEMS 9

Information retrieval – IR-based question answering – knowledge-based question answering –
language models for QA – classic QA models – chatbots – Design of dialogue systems -–
evaluating dialogue systems

Suggested Activities:
 Flipped classroom on language models for QA
 Developing a knowledge-based question-answering system
 Classic QA model development

Suggested Evaluation Methods

 Assignment on the above topics
 Quiz on knowledge-based question answering system
 Development of simple chatbots

UNIT IV TEXT-TO-SPEECH SYNTHESIS 6

Overview. Text normalization. Letter-to-sound. Prosody, Evaluation. Signal processing -
Concatenative and parametric approaches, WaveNet and other deep learning-based TTS
systems

Suggested Activities:
 Flipped classroom on Speech signal processing
 Exploring Text normalization
 Data collection
 Implementation of TTS systems
Suggested Evaluation Methods
 Assignment on the above topics
 Quiz on wavenet, deep learning-based TTS systems
 Finding accuracy with different TTS systems

UNIT V AUTOMATIC SPEECH RECOGNITION 6

Speech recognition: Acoustic modelling – Feature Extraction - HMM, HMM-DNN systems

Suggested Activities:
 Flipped classroom on Speech recognition.
111
  Exploring Feature extraction

Suggested Evaluation Methods

 Assignment on the above topics
 Quiz on acoustic modelling
30 PERIODS
PRACTICAL EXERCISES 30 PERIODS
1. Create Regular expressions in Python for detecting word patterns and tokenizing text
2. Getting started with Python and NLTK - Searching Text, Counting Vocabulary, Frequency
Distribution, Collocations, Bigrams
3. Accessing Text Corpora using NLTK in Python
4. Write a function that finds the 50 most frequently occurring words of a text that are not stop
words.
5. Implement the Word2Vec model
6. Use a transformer for implementing classification
7. Design a chatbot with a simple dialog system
8. Convert text to speech and find accuracy
9. Design a speech recognition system and find the error rate
TOTAL: 60 PERIODS
COURSE OUTCOMES:
On completion of the course, the students will be able to
CO1:Explain existing and emerging deep learning architectures for text and speech processing
CO2:Apply deep learning techniques for NLP tasks, language modelling and machine translation
CO3:Explain coreference and coherence for text processing
CO4:Build question-answering systems, chatbots and dialogue systems
CO5:Apply deep learning models for building speech recognition and text-to-speech systems

TEXTBOOK
1. Daniel Jurafsky and James H. Martin, “Speech and Language Processing: An Introduction
to Natural Language Processing, Computational Linguistics, and Speech Recognition”,
Third Edition, 2022.
REFERENCES:
1. Dipanjan Sarkar, “Text Analytics with Python: A Practical Real-World approach to Gaining
Actionable insights from your data”, APress,2018.
2. Tanveer Siddiqui, Tiwary U S, “Natural Language Processing and Information Retrieval”,
Oxford University Press, 2008.
3. Lawrence Rabiner, Biing-Hwang Juang, B. Yegnanarayana, “Fundamentals of Speech
Recognition” 1st Edition, Pearson, 2009.
4. Steven Bird, Ewan Klein, and Edward Loper, “Natural language processing with Python”,
O’REILLY.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 3 1 3 - - - 1 2 1 2 1 1 1
2 3 1 2 1 3 - - - 2 2 1 3 3 2 1
3 2 2 1 3 1 - - - 3 3 1 2 3 3 1
4 2 1 1 1 2 - - - 2 1 2 2 3 1 1
112
 5 1 3 2 2 1 - - - 3 2 1 1 2 3 1
AVg. 2.2 1.8 1.8 1.6 2 - - - 2.2 2 1.2 2 2.4 2 1
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCW331 BUSINESS ANALYTICS L T PC

2 0 2 3
COURSE OBJECTIVES:
 To understand the Analytics Life Cycle.
 To comprehend the process of acquiring Business Intelligence
 To understand various types of analytics for Business Forecasting
 To model the supply chain management for Analytics.
 To apply analytics for different functions of a business

UNIT I INTRODUCTION TO BUSINESS ANALYTICS 6

Analytics and Data Science – Analytics Life Cycle – Types of Analytics – Business Problem
Definition – Data Collection – Data Preparation – Hypothesis Generation – Modeling – Validation
and Evaluation – Interpretation – Deployment and Iteration

UNIT II BUSINESS INTELLIGENCE 6

Data Warehouses and Data Mart - Knowledge Management –Types of Decisions - Decision Making
Process - Decision Support Systems – Business Intelligence –OLAP – Analytic functions

UNIT III BUSINESS FORECASTING 6

Introduction to Business Forecasting and Predictive analytics - Logic and Data Driven Models –Data
Mining and Predictive Analysis Modelling –Machine Learning for Predictive analytics.

UNIT IV HR & SUPPLY CHAIN ANALYTICS 6

Human Resources – Planning and Recruitment – Training and Development - Supply chain network
- Planning Demand, Inventory and Supply – Logistics – Analytics applications in HR & Supply Chain
- Applying HR Analytics to make a prediction of the demand for hourly employees for a year.

UNIT V MARKETING & SALES ANALYTICS 6

Marketing Strategy, Marketing Mix, Customer Behaviour –selling Process – Sales Planning –
Analytics applications in Marketing and Sales - predictive analytics for customers' behaviour in
marketing and sales.

30 PERIODS
LIST OF EXPERIMENTS:
Use MS-Excel and Power-BI to perform the following experiments using a Business data set, and
make presentations.
Students may be encouraged to bring their own real-time socially relevant data set.

I Cycle – MS Excel
1. Explore the features of Ms-Excel.
2. (i) Get the input from user and perform numerical operations (MAX, MIN, AVG, SUM,
SQRT, ROUND)
ii) Perform data import/export operations for different file formats.

113
 3. Perform statistical operations - Mean, Median, Mode and Standard deviation, Variance,
Skewness, Kurtosis
4. Perform Z-test, T-test & ANOVA
5. Perform data pre-processing operations i) Handling Missing data ii) Normalization
6. Perform dimensionality reduction operation using PCA, KPCA & SVD
7. Perform bivariate and multivariate analysis on the dataset.
8. Apply and explore various plotting functions on the data set.

II Cycle – Power BI Desktop

9. Explore the features of Power BI Desktop
10. Prepare & Load data
11. Develop the data model
12. Perform DAX calculations
13. Design a report
14. Create a dashboard and perform data analysis
15. Presentation of a case study
30 PERIODS
COURSE OUTCOMES:
CO1: Explain the real world business problems and model with analytical solutions.
CO2: Identify the business processes for extracting Business Intelligence
CO3 : Apply predictive analytics for business fore-casting
CO4: Apply analytics for supply chain and logistics management
CO5: Use analytics for marketing and sales.
TOTAL :60 PERIODS
TEXT BOOKS
1. R. Evans James, Business Analytics, 2nd Edition, Pearson, 2017
2. R N Prasad, Seema Acharya, Fundamentals of Business Analytics, 2nd Edition, Wiley,
2016
3. Philip Kotler and Kevin Keller, Marketing Management, 15th edition, PHI, 2016
4. VSP RAO, Human Resource Management, 3rd Edition, Excel Books, 2010.
5. Mahadevan B, “Operations Management -Theory and Practice”,3rd Edition,
Pearson Education,2018.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 3 1 1 - - - 1 2 1 1 3 2 1
2 3 3 3 2 3 - - - 1 2 2 2 3 1 2
3 2 2 3 3 2 - - - 3 1 1 3 3 1 2
4 2 1 1 2 2 - - - 3 3 2 1 1 3 1
5 2 3 2 3 2 - - - 3 3 1 3 3 1 1
AVg. 2.2 2.2 2.4 2.2 2 - - - 2.2 2.2 1.4 2 2.6 1.6 1.4
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

114
CCS349 IMAGE AND VIDEO ANALYTICS L T P C
2 0 2 3
COURSE OBJECTIVES:
 To understand the basics of image processing techniques for computer vision.
 To learn the techniques used for image pre-processing.
 To discuss the various object detection techniques.
 To understand the various Object recognition mechanisms.
 To elaborate on the video analytics techniques.
UNIT I INTRODUCTION 6
Computer Vision – Image representation and image analysis tasks - Image representations –
digitization – properties – color images – Data structures for Image Analysis - Levels of image data
representation - Traditional and Hierarchical image data structures.

UNIT II IMAGE PRE-PROCESSING 6

Local pre-processing - Image smoothing - Edge detectors - Zero-crossings of the second derivative
- Scale in image processing - Canny edge detection - Parametric edge models - Edges in multi-
speralct images - Local pre-processing in the frequency domain - Line detection by local pre-
processing operators - Image restoration.

UNIT III OBJECT DETECTION USING MACHINE LEARNING 6

Object detection– Object detection methods – Deep Learning framework for Object detection–
bounding box approach-Intersection over Union (IoU) –Deep Learning Architectures-R-CNN-Faster
R-CNN-You Only Look Once(YOLO)-Salient features-Loss Functions-YOLO architectures

UNIT IV FACE RECOGNITION AND GESTURE RECOGNITION 6

Face Recognition-Introduction-Applications of Face Recognition-Process of Face Recognition-
DeepFace solution by Facebook-FaceNet for Face Recognition- Implementation using FaceNet-
Gesture Recognition.
UNIT V VIDEO ANALYTICS 6
Video Processing – use cases of video analytics-Vanishing Gradient and exploding gradient problem-
RestNet architecture-RestNet and skip connections-Inception Network-GoogleNet architecture-
Improvement in Inception v2-Video analytics-RestNet and Inception v3.

30 PERIODS
LIST OF EXERCISES 30 PERIODS

1. Write a program that computes the T-pyramid of an image.

2. Write a program that derives the quad tree representation of an image using the homogeneity
criterion of equal intensity
3. Develop programs for the following geometric transforms: (a) Rotation (b) Change of scale
(c) Skewing (d) Affine transform calculated from three pairs of corresponding points (e)
Bilinear transform calculated from four pairs of corresponding points.
4. Develop a program to implement Object Detection and Recognition
5. Develop a program for motion analysis using moving edges, and apply it to your image
sequences.
6. Develop a program for Facial Detection and Recognition
7. Write a program for event detection in video surveillance system

TOTAL: 60 PERIODS
115
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Understand the basics of image processing techniques for computer vision and video analysis.
CO2: Explain the techniques used for image pre-processing.
CO3: Develop various object detection techniques.
CO4: Understand the various face recognition mechanisms.
CO5: Elaborate on deep learning-based video analytics.

TEXT BOOK:
1. Milan Sonka, Vaclav Hlavac, Roger Boyle, “Image Processing, Analysis, and Machine
Vision”, 4nd edition, Thomson Learning, 2013.
2. Vaibhav Verdhan,(2021, Computer Vision Using Deep Learning Neural Network
Architectures with Python and Keras,Apress 2021(UNIT-III,IV and V)
REFERENCES
1. Richard Szeliski, “Computer Vision: Algorithms and Applications”, Springer Verlag London
2. Limited,2011.
3. Caifeng Shan, FatihPorikli, Tao Xiang, Shaogang Gong, “Video Analytics for Business
Intelligence”, Springer, 2012.
4. D. A. Forsyth, J. Ponce, “Computer Vision: A Modern Approach”, Pearson Education, 2003.
5. E. R. Davies, (2012), “Computer & Machine Vision”, Fourth Edition, Academic Press.
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 2 2 2 - - - 3 3 2 1 2 1 3
2 2 2 3 3 3 - - - 3 2 1 1 2 2 1
3 1 2 2 2 3 - - - 1 2 1 2 1 1 3
4 1 2 3 2 3 - - - 2 2 2 3 2 2 2
5 3 2 1 3 2 - - - 2 1 1 3 3 2 1
AVg. 2 1.8 2.2 2.4 2.6 - - - 2.2 2 1.4 2 2 1.6 2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS338 COMPUTER VISION LT P C

2 0 2 3
COURSE OBJECTIVES:
 To understand the fundamental concepts related to Image formation and processing.
 To learn feature detection, matching and detection
 To become familiar with feature based alignment and motion estimation
 To develop skills on 3D reconstruction
 To understand image based rendering and recognition

UNIT I INTRODUCTION TO IMAGE FORMATION AND PROCESSING 6

Computer Vision - Geometric primitives and transformations - Photometric image formation - The
digital camera - Point operators - Linear filtering - More neighborhood operators - Fourier transforms
- Pyramids and wavelets - Geometric transformations - Global optimization.

116
UNIT II FEATURE DETECTION, MATCHING AND SEGMENTATION 6
Points and patches - Edges - Lines - Segmentation - Active contours - Split and merge - Mean shift
and mode finding - Normalized cuts - Graph cuts and energy-based methods.

UNIT III FEATURE-BASED ALIGNMENT & MOTION ESTIMATION 6

2D and 3D feature-based alignment - Pose estimation - Geometric intrinsic calibration - Triangulation
- Two-frame structure from motion - Factorization - Bundle adjustment - Constrained structure and
motion - Translational alignment - Parametric motion - Spline-based motion - Optical flow - Layered
motion.

UNIT IV 3D RECONSTRUCTION 6
Shape from X - Active rangefinding - Surface representations - Point-based representations-
Volumetric representations - Model-based reconstruction - Recovering texture maps and albedosos.

UNIT V IMAGE-BASED RENDERING AND RECOGNITION 6

View interpolation Layered depth images - Light fields and Lumigraphs - Environment mattes -
Video-based rendering-Object detection - Face recognition - Instance recognition - Category
recognition - Context and scene understanding- Recognition databases and test sets.
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
LABORATORY EXPERIMENTS:
Software needed:
OpenCV computer vision Library for OpenCV in Python / PyCharm or C++ / Visual Studio or or
equivalent

 OpenCV Installation and working with Python

 Basic Image Processing - loading images, Cropping, Resizing, Thresholding, Contour
analysis, Bolb detection
 Image Annotation – Drawing lines, text circle, rectangle, ellipse on images
 Image Enhancement - Understanding Color spaces, color space conversion, Histogram
equialization, Convolution, Image smoothing, Gradients, Edge Detection
 Image Features and Image Alignment – Image transforms – Fourier, Hough, Extract ORB
Image features, Feature matching, cloning, Feature matching based image alignment
 Image segmentation using Graphcut / Grabcut
 Camera Calibration with circular grid
 Pose Estimation
 3D Reconstruction – Creating Depth map from stereo images
 Object Detection and Tracking using Kalman Filter, Camshift

1. docs.opencv.org
2. https://opencv.org/opencv-free-course/

TOTAL : 60 PERIODS

117
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1:To understand basic knowledge, theories and methods in image processing and computer
vision.
CO2:To implement basic and some advanced image processing techniques in OpenCV.
CO3:To apply 2D a feature-based based image alignment, segmentation and motion estimations.
CO4:To apply 3D image reconstruction techniques
CO5:To design and develop innovative image processing and computer vision applications.

TEXT BOOKS:
1. Richard Szeliski, “Computer Vision: Algorithms and Applications”, Springer- Texts in
Computer Science, Second Edition, 2022.
2. Computer Vision: A Modern Approach, D. A. Forsyth, J. Ponce, Pearson Education, Second
Edition, 2015.
REFERENCES:
1. Richard Hartley and Andrew Zisserman, Multiple View Geometry in Computer Vision,
Second Edition, Cambridge University Press, March 2004.
2. Christopher M. Bishop; Pattern Recognition and Machine Learning, Springer, 2006
3. E. R. Davies, Computer and Machine Vision, Fourth Edition, Academic Press, 2012.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 1 1 1 - - - 2 1 3 2 2 1 1
2 3 3 3 2 3 - 1 - 2 1 2 2 3 1 2
3 3 3 2 2 3 - - - 1 1 2 2 3 2 2
4 2 3 3 2 3 - - - 2 1 2 3 2 2 3
5 2 3 3 2 2 2 - - 3 1 2 3 3 3 3
AVg. 2.6 2.6 2.4 1.8 2.4 0.4 0.25 0 2 1 2.2 2.4 2.6 1.8 2.2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS334 BIG DATA ANALYTICS L T PC

2 0 23
COURSE OBJECTIVES:
 To understand big data.
 To learn and use NoSQL big data management.
 To learn mapreduce analytics using Hadoop and related tools.
 To work with map reduce applications
 To understand the usage of Hadoop related tools for Big Data Analytics

UNIT I UNDERSTANDING BIG DATA 5

Introduction to big data – convergence of key trends – unstructured data – industry examples of big
data – web analytics – big data applications– big data technologies – introduction to Hadoop – open

118
source technologies – cloud and big data – mobile business intelligence – Crowd sourcing analytics
– inter and trans firewall analytics.

UNIT II NOSQL DATA MANAGEMENT 7

Introduction to NoSQL – aggregate data models – key-value and document data models –
relationships – graph databases – schemaless databases – materialized views – distribution models
– master-slave replication – consistency - Cassandra – Cassandra data model – Cassandra
examples – Cassandra clients

UNIT III MAP REDUCE APPLICATIONS 6

MapReduce workflows – unit tests with MRUnit – test data and local tests – anatomy of MapReduce
job run – classic Map-reduce – YARN – failures in classic Map-reduce and YARN – job scheduling
– shuffle and sort – task execution – MapReduce types – input formats – output formats.

UNIT IV BASICS OF HADOOP 6

Data format – analyzing data with Hadoop – scaling out – Hadoop streaming – Hadoop pipes –
design of Hadoop distributed file system (HDFS) – HDFS concepts – Java interface – data flow –
Hadoop I/O – data integrity – compression – serialization – Avro – file-based data structures -
Cassandra – Hadoop integration.

UNIT V HADOOP RELATED TOOLS 6

Hbase – data model and implementations – Hbase clients – Hbase examples – praxis.
Pig – Grunt – pig data model – Pig Latin – developing and testing Pig Latin scripts.
Hive – data types and file formats – HiveQL data definition – HiveQL data manipulation – HiveQL
queries.
30 PERIODS
COURSE OUTCOMES:
After the completion of this course, students will be able to:
CO1:Describe big data and use cases from selected business domains.
CO2:Explain NoSQL big data management.
CO3:Install, configure, and run Hadoop and HDFS.
CO4:Perform map-reduce analytics using Hadoop.
CO5:Use Hadoop-related tools such as HBase, Cassandra, Pig, and Hive for big data analytics.

LIST OF EXPERIMENTS: 30 PERIODS

1. Downloading and installing Hadoop; Understanding different Hadoop modes. Startup scripts,
Configuration files.
2. Hadoop Implementation of file management tasks, such as Adding files and directories,
retrieving files and Deleting files
3. Implement of Matrix Multiplication with Hadoop Map Reduce
4. Run a basic Word Count Map Reduce program to understand Map Reduce Paradigm.
5. Installation of Hive along with practice examples.
7. Installation of HBase, Installing thrift along with Practice examples
8. Practice importing and exporting data from various databases.

Software Requirements:
Cassandra, Hadoop, Java, Pig, Hive and HBase.
TOTAL:60 PERIODS
119
TEXT BOOKS:
1. Michael Minelli, Michelle Chambers, and AmbigaDhiraj, "Big Data, Big Analytics:
Emerging Business Intelligence and Analytic Trends for Today's Businesses", Wiley,
2013.
2. Eric Sammer, "Hadoop Operations", O'Reilley, 2012.
3. Sadalage, Pramod J. “NoSQL distilled”, 2013

REFERENCES:
1. E. Capriolo, D. Wampler, and J. Rutherglen, "Programming Hive", O'Reilley, 2012.
2. Lars George, "HBase: The Definitive Guide", O'Reilley, 2011.
3. Eben Hewitt, "Cassandra: The Definitive Guide", O'Reilley, 2010.
4. Alan Gates, "Programming Pig", O'Reilley, 2011.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 3 3 3 - - - 2 2 3 1 1 3 3
2 3 3 2 3 2 - - - 2 2 3 3 2 3 2
3 3 3 3 2 3 - - - 2 2 1 2 2 3 3
4 2 3 3 3 3 - - - 2 2 3 2 3 3 2
5 3 3 3 3 3 - - - 3 1 3 2 3 2 3
AVg. 2.8 3 2.8 2.8 2.8 - - - 2.2 1.8 2.6 2 2.2 2.8 2.6
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS375 WEB TECHNOLOGIES L T P C

2 0 2 3
COURSE OBJECTIVES:
 To understand different Internet Technologies
 To learn java-specific web services architecture
 To Develop web applications using frameworks

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

Web Essentials: Clients, Servers and Communication – The Internet – World wide web – HTTP
Request Message – HTTP Response Message – Web Clients – Web Servers – HTML5 – Tables –
Lists – Image – HTML5 control 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. Bootstrap
Framework

UNIT II CLIENT SIDE PROGRAMMING 6

Java Script: An introduction to JavaScript–JavaScript DOM Model-Exception Handling-Validation-
Built-in objects-Event Handling- DHTML with JavaScript- JSON introduction – Syntax – Function
Files.

UNIT III SERVER SIDE PROGRAMMING 5

Servlets: Java Servlet Architecture- Servlet Life Cycle- Form GET and POST actions- Session
Handling- Understanding Cookies- DATABASE CONNECTIVITY: JDBC.

120
UNIT IV PHP and XML 6
An introduction to PHP: PHP- Using PHP- Variables- Program control- Built-in functions- Form
Validation. XML: Basic XML- Document Type Definition- XML Schema, XML Parsers and Validation,
XSL ,

UNIT V INTRODUCTION TO ANGULAR and WEB APPLICATIONS FRAMEWORKS 6

Introduction to AngularJS, MVC Architecture, Understanding ng attributes, Expressions and data
binding, Conditional Directives, Style Directives, Controllers, Filters, Forms, Routers, Modules,
Services; Web Applications Frameworks and Tools – Firebase- Docker- Node JS- React- Django-
UI & UX.

COURSE OUTCOMES:
CO1: Construct a basic website using HTML and Cascading Style Sheets
CO2: Build dynamic web page with validation using Java Script objects and by applying different
event handling mechanisms.
CO3: Develop server side programs using Servlets and JSP.
CO4: Construct simple web pages in PHP and to represent data in XML format.
CO5: Develop interactive web applications.
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
List Of Experiments:
1. Create a web page with the following using HTML.
• To embed an image map in a web page.
• To fix the hot spots.
• Show all the related information when the hot spots are clicked.
2. Create a web page with all types of Cascading style sheets.
3. Client Side Scripts for Validating Web Form Controls using DHTML.
4. Installation of Apache Tomcat web server.
5. Write programs in Java using Servlets:
● To invoke servlets from HTML forms.
● Session Tracking.
6. Write programs in Java to create three-tier applications using JSP and Databases
● 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.
7. Programs using XML – Schema – XSLT/XSL.
TOTAL:60 PERIODS
TEXTBOOKS
1. Deitel and Deitel and Nieto, Internet and World Wide Web - How to Program, Prentice Hall, 5th
Edition, 2011.
2. Jeffrey C and Jackson, Web Technologies A Computer Science Perspective, Pearson
Education, 2011.
3. Angular 6 for Enterprise-Ready Web Applications, Doguhan Uluca, 1st edition, Packt
Publishing
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.
121
 3. Gopalan N.P. and Akilandeswari J., “Web Technology”, Prentice Hall of India, 2011.
4. UttamK.Roy, “Web Technologies”, Oxford University Press, 2011.
5. Angular: Up and Running: Learning Angular, Step by Step, Shyam Seshadri, 1st edition,
O′Reilly

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 3 3 3 - - - 1 3 3 1 3 2 3
2 2 2 2 1 2 - - - 2 2 1 3 2 2 2
3 1 1 3 2 3 - - - 1 2 1 1 1 2 1
4 2 3 3 1 2 - - - 3 1 2 2 2 2 2
5 1 2 3 2 2 - - - 2 1 3 1 1 1 2
AVg. 1.8 2 2.8 1.8 2.4 - - - 1.8 1.8 2 1.6 1.8 1.8 2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS332 APP DEVELOPMENT L T P C

2 0 2 3
COURSE OBJECTIVES:
 To learn development of native applications with basic GUI Components
 To develop cross-platform applications with event handling
 To develop applications with location and data storage capabilities
 To develop web applications with database access

UNIT I FUNDAMENTALS OF MOBILE & WEB APPLICATION DEVELOPMENT 6

Basics of Web and Mobile application development, Native App, Hybrid App, Cross-platform App,
What is Progressive Web App, Responsive Web design,

UNIT II NATIVE APP DEVELOPMENT USING JAVA 6

Native Web App, Benefits of Native App, Scenarios to create Native App, Tools for creating Native
App, Cons of Native App, Popular Native App Dev elopment Frameworks, Java & Kotlin for
Android, Swift & Objective-C for iOS, Basics of React Native, Native Components, JSX, State, Props

UNIT III HYBRID APP DEVELOPMENT 6

Hybrid Web App, Benefits of Hybrid App, Criteria for creating Native App, Tools for creating
Hybrid App, Cons of Hybrid App, Popular Hybrid App Development Frameworks, Ionic, Apache
Cordova,

UNIT IV CROSS-PLATFORM APP DEVELOPMENT USING REACT-NATIVE 6

What is Cross-platform App, Benefits of Cross-platform App, Criteria for creating Cross-platform
App, Tools for creating Cross-platform App, Cons of Cross-platform App, Popular Cross-
platform App Development Frameworks, Flutter, Xamarin, React-Native, Basics of React Native,
Native Components, JSX, State, Props

UNIT V NON-FUNCTIONAL CHARACTERISTICS OF APP FRAMEWORKS 6

Comparison of different App frameworks, Build Performance, App Performance, Debugging
capabilities, Time to Market, Maintainability, Ease of Development, UI/UX, Reusability

122
COURSE OUTCOMES:
CO1:Develop Native applications with GUI Components.
CO2:Develop hybrid applications with basic event handling.
CO3: Implement cross-platform applications with location and data storage capabilities.
CO4: Implement cross platform applications with basic GUI and event handling.
CO5:Develop web applications with cloud database access.
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Using react native, build a cross platform application for a BMI calculator.
2. Build a cross platform application for a simple expense manager which allows entering
expenses and income on each day and displays category wise weekly income and expense.
3. Develop a cross platform application to convert units from imperial system to metric system
( km to miles, kg to pounds etc.,)
4. Design and develop a cross platform application for day to day task (to-do) management.
5. Design an android application using Cordova for a user login screen with username,
password, reset button and a submit button. Also, include header image and a label. Use
layout managers.
6. Design and develop an android application using Apache Cordova to find and display the
current location of the user.
7. Write programs using Java to create Android application having Databases
● For a simple library application.
● For displaying books available, books lend, book reservation. Assume that student
information is available in a database which has been stored in a database server.
TOTAL:60 PERIODS
TEXT BOOKS
1. Head First Android Development, Dawn Griffiths, O’Reilly, 1st edition
2. Apache Cordova in Action, Raymond K. Camden, Manning. 2015
3. Full Stack React Native: Create beautiful mobile apps with JavaScript and React Native,
Anthony Accomazzo, Houssein Djirdeh, Sophia Shoemaker, Devin Abbott, FullStack
publishing
REFERENCES
1. Android Programming for Beginners, John Horton, Packt Publishing, 2nd Edition
2. Native Mobile Development by Shaun Lewis, Mike Dunn
3. Building Cross-Platform Mobile and Web Apps for Engineers and Scientists: An Active
Learning Approach, Pawan Lingras, Matt Triff, Rucha Lingras
4. Apache Cordova 4 Programming, John M Wargo, 2015
5. React Native Cookbook, Daniel Ward, Packt Publishing, 2nd Edition
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 1 2 3 - - - 1 1 2 1 2 3 3
2 2 1 3 2 2 - - - 3 2 2 3 3 2 1
3 2 2 2 1 2 - - - 1 1 1 1 1 1 2
4 1 3 1 1 3 - - - 1 1 3 2 1 3 1
5 1 1 3 1 3 - - - 1 1 2 1 3 2 1
AVg. 1.6 1.8 2 1.4 2.6 - - - 1.4 1.2 2 1.6 2 2.2 1.6
1 - low, 2 - medium, 3 - high, ‘-' - no correlation
123
CCS336 CLOUD SERVICES MANAGEMENT L T P C
2 0 2 3
COURSE OBJECTIVES:
 Introduce Cloud Service Management terminology, definition & concepts
 Compare and contrast cloud service management with traditional IT service management
 Identify strategies to reduce risk and eliminate issues associated with adoption of cloud
services
 Select appropriate structures for designing, deploying and running cloud-based services in
a business environment
 Illustrate the benefits and drive the adoption of cloud-based services to solve real world
problems

UNIT I CLOUD SERVICE MANAGEMENT FUNDAMENTALS 6

Cloud Ecosystem, The Essential Characteristics, Basics of Information Technology Service
Management and Cloud Service Management, Service Perspectives, Cloud Service Models, Cloud
Service Deployment Models

UNIT II CLOUD SERVICES STRATEGY 6

Cloud Strategy Fundamentals, Cloud Strategy Management Framework, Cloud Policy, Key Driver
for Adoption, Risk Management, IT Capacity and Utilization, Demand and Capacity matching,
Demand Queueing, Change Management, Cloud Service Architecture

UNIT III CLOUD SERVICE MANAGEMENT 6

Cloud Service Reference Model, Cloud Service LifeCycle, Basics of Cloud Service Design, Dealing
with Legacy Systems and Services, Benchmarking of Cloud Services, Cloud Service Capacity
Planning, Cloud Service Deployment and Migration, Cloud Marketplace, Cloud Service Operations
Management

UNIT IV CLOUD SERVICE ECONOMICS 6

Pricing models for Cloud Services, Freemium, Pay Per Reservation, Pay per User, Subscription
based Charging, Procurement of Cloud-based Services, Capex vs Opex Shift, Cloud service
Charging, Cloud Cost Models

UNIT V CLOUD SERVICE GOVERNANCE & VALUE 6

IT Governance Definition, Cloud Governance Definition, Cloud Governance Framework, Cloud
Governance Structure, Cloud Governance Considerations, Cloud Service Model Risk Matrix,
Understanding Value of Cloud Services, Measuring the value of Cloud Services, Balanced
Scorecard, Total Cost of Ownership

COURSE OUTCOMES:
CO1:Exhibit cloud-design skills to build and automate business solutions using cloud technologies.
CO2: Possess Strong theoretical foundation leading to excellence and excitement towards adoption
of cloud-based services
CO3: Solve the real world problems using Cloud services and technologies
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Create a Cloud Organization in AWS/Google Cloud/or any equivalent Open Source cloud
softwares like Openstack, Eucalyptus, OpenNebula with Role-based access control
124
 2. Create a Cost-model for a web application using various services and do Cost-benefit
analysis
3. Create alerts for usage of Cloud resources
4. Create Billing alerts for your Cloud Organization
5. Compare Cloud cost for a simple web application across AWS, Azure and GCP and suggest
the best one
TOTAL:60 PERIODS
TEXT BOOKS
1. Cloud Service Management and Governance: Smart Service Management in Cloud Era by
Enamul Haque, Enel Publications
2. Cloud Computing: Concepts, Technology & Architecture by Thomas Erl, Ricardo Puttini,
Zaigham Mohammad 2013
3. Cloud Computing Design Patterns by Thomas Erl, Robert Cope, Amin Naserpour

REFERENCES
1. Economics of Cloud Computing by Praveen Ayyappa, LAP Lambert Academic Publishing
2. Mastering Cloud Computing Foundations and Applications Programming Rajkumar Buyya,
Christian Vechhiola, S. Thamarai Selvi

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 1 1 1 - - - 2 1 3 2 2 1 3
2 3 1 2 3 2 - - - 1 2 3 1 2 2 2
3 1 1 3 1 3 - - - 3 3 1 1 3 2 1
4 1 1 1 2 3 - - - 2 3 3 1 1 1 1
5 1 3 3 2 2 - - - 1 3 1 2 1 3 2
AVg. 1.8 1.8 2 1.8 2.2 - - - 1.8 2.4 2.2 1.4 1.8 1.8 1.8
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS370 UI AND UX DESIGN L T P C

2 0 2 3
COURSE OBJECTIVES:
 To provide a sound knowledge in UI & UX
 To understand the need for UI and UX
 To understand the various Research Methods used in Design
 To explore the various Tools used in UI & UX
 Creating a wireframe and prototype

UNIT I FOUNDATIONS OF DESIGN 6

UI vs. UX Design - Core Stages of Design Thinking - Divergent and Convergent Thinking -
Brainstorming and Game storming - Observational Empathy

UNIT II FOUNDATIONS OF UI DESIGN 6

Visual and UI Principles - UI Elements and Patterns - Interaction Behaviors and Principles –
Branding - Style Guides

125
UNIT III FOUNDATIONS OF UX DESIGN 6
Introduction to User Experience - Why You Should Care about User Experience - Understanding
User Experience - Defining the UX Design Process and its Methodology - Research in User
Experience Design - Tools and Method used for Research - User Needs and its Goals - Know about
Business Goals

UNIT IV WIREFRAMING, PROTOTYPING AND TESTING 6

Sketching Principles - Sketching Red Routes - Responsive Design – Wireframing - Creating
Wireflows - Building a Prototype - Building High-Fidelity Mockups - Designing Efficiently with Tools
- Interaction Patterns - Conducting Usability Tests - Other Evaluative User Research Methods -
Synthesizing Test Findings - Prototype Iteration

UNIT V RESEARCH, DESIGNING, IDEATING, & INFORMATION ARCHITECTURE 6

Identifying and Writing Problem Statements - Identifying Appropriate Research Methods - Creating
Personas - Solution Ideation - Creating User Stories - Creating Scenarios - Flow Diagrams - Flow
Mapping - Information Architecture
30 PERIODS
LIST OF EXPERIMENTS 30 PERIODS
1. Designing a Responsive layout for an societal application
2. Exploring various UI Interaction Patterns
3. Developing an interface with proper UI Style Guides
4. Developing Wireflow diagram for application using open source software
5. Exploring various open source collaborative interface Platform
6. Hands on Design Thinking Process for a new product
7. Brainstorming feature for proposed product
8. Defining the Look and Feel of the new Project
9. Create a Sample Pattern Library for that product (Mood board, Fonts, Colors based on
UI principles)
10. Identify a customer problem to solve
11. Conduct end-to-end user research - User research, creating personas, Ideation
process (User stories, Scenarios), Flow diagrams, Flow Mapping
12. Sketch, design with popular tool and build a prototype and perform usability testing and
identify improvements
TOTAL: 60 PERIODS
COURSE OUTCOMES:
On completion of the course, the students will be able to:
CO1:Build UI for user Applications
CO2:Evaluate UX design of any product or application
CO3:Demonstrate UX Skills in product development
CO4:Implement Sketching principles
CO5:Create Wireframe and Prototype
TEXT BOOKS
1. Joel Marsh, “UX for Beginners”, O’Reilly , 2022
2. Jon Yablonski, “Laws of UX using Psychology to Design Better Product & Services” O’Reilly
2021

126
REFERENCES
1. Jenifer Tidwell, Charles Brewer, Aynne Valencia, “Designing Interface” 3 rd Edition , O’Reilly
2020
2. Steve Schoger, Adam Wathan “Refactoring UI”, 2018
3. Steve Krug, “Don't Make Me Think, Revisited: A Commonsense Approach to Web &
Mobile”, Third Edition, 2015
4. https://www.nngroup.com/articles/
5. https://www.interaction-design.org/literature.
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 1 3 1 - - - 3 3 2 1 3 3 1
2 2 3 1 3 2 - - - 1 2 2 2 1 2 2
3 1 3 3 2 2 - - - 2 3 1 2 1 3 3
4 1 2 3 3 1 - - - 3 2 1 3 3 3 3
5 1 2 3 2 1 - - - 2 1 1 1 3 2 2
AVg. 1.6 2.2 2.2 2.6 1.4 - - - 2.2 2.2 1.4 1.8 2.2 2.6 2.2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS366 SOFTWARE TESTING AND AUTOMATION L T PC

2 0 2 3
COURSE OBJECTIVES:
 To understand the basics of software testing
 To learn how to do the testing and planning effectively
 To build test cases and execute them
 To focus on wide aspects of testing and understanding multiple facets of testing
 To get an insight about test automation and the tools used for test automation

UNIT I FOUNDATIONS OF SOFTWARE TESTING 6

Why do we test Software?, Black-Box Testing and White-Box Testing, Software Testing Life Cycle,
V-model of Software Testing, Program Correctness and Verification, Reliability versus Safety,
Failures, Errors and Faults (Defects), Software Testing Principles, Program Inspections, Stages of
Testing: Unit Testing, Integration Testing, System Testing

UNIT II TEST PLANNING 6

The Goal of Test Planning, High Level Expectations,Intergroup Responsibilities, Test Phases, Test
Strategy, Resource Requirements, Tester Assignments, Test Schedule, Test Cases, Bug Reporting,
Metrics and Statistics.

UNIT III TEST DESIGN AND EXECUTION 6

Test Objective Identification, Test Design Factors, Requirement identification, Testable
Requirements, Modeling a Test Design Process, Modeling Test Results, Boundary Value Testing,
Equivalence Class Testing, Path Testing, Data Flow Testing, Test Design Preparedness Metrics,
Test Case Design Effectiveness, Model-Driven Test Design, Test Procedures, Test Case
Organization and Tracking, Bug Reporting, Bug Life Cycle.

127
UNIT IV ADVANCED TESTING CONCEPTS 6
Performance Testing: Load Testing, Stress Testing, Volume Testing, Fail-Over Testing, Recovery
Testing, Configuration Testing, Compatibility Testing, Usability Testing, Testing the Documentation,
Security testing, Testing in the Agile Environment, Testing Web and Mobile Applications.

UNIT V TEST AUTOMATION AND TOOLS 6

Automated Software Testing, Automate Testing of Web Applications, Selenium: Introducing Web
Driver and Web Elements, Locating Web Elements, Actions on Web Elements, Different Web
Drivers, Understanding Web Driver Events, Testing: Understanding Testing.xml, Adding Classes,
Packages, Methods to Test, Test Reports.
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Develop the test plan for testing an e-commerce web/mobile application (www.amazon.in).
2. Design the test cases for testing the e-commerce application
3. Test the e-commerce application and report the defects in it.
4. Develop the test plan and design the test cases for an inventory control system.
5. Execute the test cases against a client server or desktop application and identify the defects.
6. Test the performance of the e-commerce application.
7. Automate the testing of e-commerce applications using Selenium.
8. Integrate TestNG with the above test automation.
9. Mini Project:
a) Build a data-driven framework using Selenium and TestNG
b) Build Page object Model using Selenium and TestNG
c) Build BDD framework with Selenium, TestNG and Cucumber

COURSE OUTCOMES:
CO1: Understand the basic concepts of software testing and the need for software testing
CO2: Design Test planning and different activities involved in test planning
CO3: Design effective test cases that can uncover critical defects in the application
CO4: Carry out advanced types of testing
CO5: Automate the software testing using Selenium and TestNG
TOTAL:60 PERIODS
TEXTBOOKS
1. Yogesh Singh, “Software Testing”, Cambridge University Press, 2012
2. Unmesh Gundecha, Satya Avasarala, "Selenium WebDriver 3 Practical Guide" - Second
Edition 2018
REFERENCES
1. Glenford J. Myers, Corey Sandler, Tom Badgett, The Art of Software Testing, 3rd Edition,
2012, John Wiley & Sons, Inc.
2. Ron Patton, Software testing, 2nd Edition, 2006, Sams Publishing
3. Paul C. Jorgensen, Software Testing: A Craftsman’s Approach, Fourth Edition, 2014, Taylor
& Francis Group.
4. Carl Cocchiaro, Selenium Framework Design in Data-Driven Testing, 2018, Packt
Publishing.
5. Elfriede Dustin, Thom Garrett, Bernie Gaurf, Implementing Automated Software Testing,
2009, Pearson Education, Inc.
6. Satya Avasarala, Selenium WebDriver Practical Guide, 2014, Packt Publishing.
7. Varun Menon, TestNg Beginner's Guide, 2013, Packt Publishing.
128
 CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 2 1 2 - - - 1 1 3 2 3 2 3
2 2 3 1 1 1 - - - 2 2 1 2 1 2 3
3 2 2 1 3 1 - - - 1 3 1 2 2 3 2
4 2 1 3 2 1 - - - 1 1 1 2 3 1 2
5 2 2 1 3 1 - - - 1 3 2 1 2 1 3
AVg. 2.2 2.2 1.6 2 1.2 - - - 1.2 2 1.6 1.8 2.2 1.8 2.6
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS374 WEB APPLICATION SECURITY L T PC

2 0 2 3
COURSE OBJECTIVES:
 To understand the fundamentals of web application security
 To focus on wide aspects of secure development and deployment of web applications
 To learn how to build secure APIs
 To learn the basics of vulnerability assessment and penetration testing
 To get an insight about Hacking techniques and Tools

UNIT I FUNDAMENTALS OF WEB APPLICATION SECURITY 6

The history of Software Security-Recognizing Web Application Security Threats, Web Application
Security, Authentication and Authorization, Secure Socket layer, Transport layer Security, Session
Management-Input Validation

UNIT II SECURE DEVELOPMENT AND DEPLOYMENT 5

Web Applications Security - Security Testing, Security Incident Response Planning,The Microsoft
Security Development Lifecycle (SDL), OWASP Comprehensive Lightweight Application Security
Process (CLASP), The Software Assurance Maturity Model (SAMM)

UNIT III SECURE API DEVELOPMENT 6

API Security- Session Cookies, Token Based Authentication, Securing Natter APIs: Addressing
threats with Security Controls, Rate Limiting for Availability, Encryption, Audit logging, Securing
service-to-service APIs: API Keys , OAuth2, Securing Microservice APIs: Service Mesh, Locking
Down Network Connections, Securing Incoming Requests.

UNIT IV VULNERABILITY ASSESSMENT AND PENETRATION TESTING 6

Vulnerability Assessment Lifecycle, Vulnerability Assessment Tools: Cloud-based vulnerability
scanners, Host-based vulnerability scanners, Network-based vulnerability scanners, Database-
based vulnerability scanners, Types of Penetration Tests: External Testing, Web Application
Testing, Internal Penetration Testing, SSID or Wireless Testing, Mobile Application Testing.

UNIT V HACKING TECHNIQUES AND TOOLS 7

Social Engineering, Injection, Cross-Site Scripting(XSS), Broken Authentication and Session
Management, Cross-Site Request Forgery, Security Misconfiguration, Insecure Cryptographic

129
Storage, Failure to Restrict URL Access, Tools: Comodo, OpenVAS, Nexpose, Nikto, Burp Suite,
etc.
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Install wireshark and explore the various protocols
a. Analyze the difference between HTTP vs HTTPS
b. Analyze the various security mechanisms embedded with different protocols.
2. Identify the vulnerabilities using OWASP ZAP tool
3. Create simple REST API using python for following operation
. GET
a. PUSH
b. POST
c. DELETE
4. Install Burp Suite to do following vulnerabilities:
. SQL injection
a. cross-site scripting (XSS)
5. Attack the website using Social Engineering method
COURSE OUTCOMES:
CO1: Understanding the basic concepts of web application security and the need for it
CO2: Be acquainted with the process for secure development and deployment of web applications
CO3: Acquire the skill to design and develop Secure Web Applications that use Secure APIs
CO4: Be able to get the importance of carrying out vulnerability assessment and penetration testing
CO5: Acquire the skill to think like a hacker and to use hackers tool sets
TOTAL :60 PERIODS
TEXT BOOKS
1. Andrew Hoffman, Web Application Security: Exploitation and Countermeasures for Modern
Web Applications, First Edition, 2020, O’Reilly Media, Inc.
2. Bryan Sullivan, Vincent Liu, Web Application Security: A Beginners Guide, 2012, The McGraw-
Hill Companies.
3. Neil Madden, API Security in Action, 2020, Manning Publications Co., NY, USA.

REFERENCES
1. Michael Cross, Developer’s Guide to Web Application Security, 2007, Syngress Publishing,
Inc.
2. Ravi Das and Greg Johnson, Testing and Securing Web Applications, 2021, Taylor & Francis
Group, LLC.
3. Prabath Siriwardena, Advanced API Security, 2020, Apress Media LLC, USA.
4. Malcom McDonald, Web Security for Developers, 2020, No Starch Press, Inc.
5. Allen Harper, Shon Harris, Jonathan Ness, Chris Eagle, Gideon Lenkey, and Terron Williams
Grey Hat Hacking: The Ethical Hacker’s Handbook, Third Edition, 2011, The McGraw-Hill
Companies.

130
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 1 2 2 1 3 - - - - - - 1 - - -
2 2 1 2 1 3 - - - - - - - - - -
3 1 1 1 2 3 - - - - - - 1 - - -
4 1 2 1 1 2 - - - - - - - - - -
5 1 2 2 2 2 - - - - - - 1 - - -
AVg. 1.2 1.6 1.6 1.4 2.6 - - - - - - 0.6 - - -
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS342 DEVOPS L T PC
2 0 2 3
COURSE OBJECTIVES:
 To introduce DevOps terminology, definition & concepts
 To understand the different Version control tools like Git, Mercurial
 To understand the concepts of Continuous Integration/ Continuous Testing/ Continuous
Deployment)
 To understand Configuration management using Ansible
 Illustrate the benefits and drive the adoption of cloud-based Devops tools to solve real
world problems

UNIT I INTRODUCTION TO DEVOPS 6

Devops Essentials - Introduction To AWS, GCP, Azure - Version control systems: Git and Github.

UNIT II COMPILE AND BUILD USING MAVEN & GRADLE 6

Introduction, Installation of Maven, POM files, Maven Build lifecycle, Build phases(compile build,
test, package) Maven Profiles, Maven repositories(local, central, global),Maven plugins, Maven
create and build Artificats, Dependency management, Installation of Gradle, Understand build using
Gradle

UNIT III CONTINUOUS INTEGRATION USING JENKINS 6

Install & Configure Jenkins, Jenkins Architecture Overview, Creating a Jenkins Job, Configuring a
Jenkins job, Introduction to Plugins, Adding Plugins to Jenkins, Commonly used plugins (Git Plugin,
Parameter Plugin, HTML Publisher, Copy Artifact and Extended choice parameters). Configuring
Jenkins to work with java, Git and Maven, Creating a Jenkins Build and Jenkins workspace.

UNIT IV CONFIGURATION MANAGEMENT USING ANSIBLE 6

Ansible Introduction, Installation, Ansible master/slave configuration, YAML basics, Ansible
modules, Ansible Inventory files, Ansible playbooks, Ansible Roles, adhoc commands in ansible

UNIT V BUILDING DEVOPS PIPELINES USING AZURE 6

Create Github Account, Create Repository, Create Azure Organization, Create a new pipeline, Build
a sample code, Modify azure-pipelines.yaml file

COURSE OUTCOMES:
CO1: Understand different actions performed through Version control tools like Git.

131
 CO2: Perform Continuous Integration and Continuous Testing and Continuous Deployment
using Jenkins by building and automating test cases using Maven & Gradle.
CO3: Ability to Perform Automated Continuous Deployment
CO4: Ability to do configuration management using Ansible
CO5: Understand to leverage Cloud-based DevOps tools using Azure DevOps

30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Create Maven Build pipeline in Azure
2. Run regression tests using Maven Build pipeline in Azure
3. Install Jenkins in Cloud
4. Create CI pipeline using Jenkins
5. Create a CD pipeline in Jenkins and deploy in Cloud
6. Create an Ansible playbook for a simple web application infrastructure
7. Build a simple application using Gradle
8. Install Ansible and configure ansible roles and to write playbooks
TOTAL:60 PERIODS
TEXT BOOKS
1. Roberto Vormittag, “A Practical Guide to Git and GitHub for Windows Users: From Beginner
to Expert in Easy Step-By-Step Exercises”, Second Edition, Kindle Edition, 2016.
2. Jason Cannon, “Linux for Beginners: An Introduction to the Linux Operating System and
Command Line”, Kindle Edition, 2014

REFERENCES
1. Hands-On Azure Devops: Cicd Implementation For Mobile, Hybrid, And Web Applications
Using Azure Devops And Microsoft Azure: CICD Implementation for ... DevOps and
Microsoft Azure (English Edition) Paperback – 1 January 2020
2. by Mitesh Soni
3. Jeff Geerling, “Ansible for DevOps: Server and configuration management for humans”, First
Edition, 2015.
4. David Johnson, “Ansible for DevOps: Everything You Need to Know to Use Ansible for
DevOps”, Second Edition, 2016.
5. Mariot Tsitoara, “Ansible 6. Beginning Git and GitHub: A Comprehensive Guide to Version
Control, Project Management, and Teamwork for the New Developer”, Second Edition, 2019.
6. https://www.jenkins.io/user-handbook.pdf
7. https://maven.apache.org/guides/getting-started/

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 3 2 3 - - - - - - - 2 2 2
2 3 3 3 2 3 - - - - - - - 2 2 2
3 3 3 3 2 3 - - - - - - - 2 2 2
4 3 3 3 2 3 - - - - - - - 2 2 2
5 3 3 3 2 3 - - - - - - - 2 2 2
AVg. 3 3 3 2 3 - - - - - - - 2 2 2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

132
CCS358 PRINCIPLES OF PROGRAMMING LANGUAGES LTPC
3 003
COURSE OBJECTIVES:
 To understand and describe syntax and semantics of programming languages
 To understand data, data types, and basic statements
 To understand call-return architecture and ways of implementing them
 To understand object-orientation, concurrency, and event handling in programming
languages
 To develop programs in non-procedural programming paradigms
UNIT I SYNTAX AND SEMANTICS 9
Evolution of programming languages – describing syntax – context-free grammars – attribute
grammars – describing semantics – lexical analysis – parsing – recursive-descent – bottom up
parsing

UNIT II DATA, DATA TYPES, AND BASIC STATEMENTS 9

Names – variables – binding – type checking – scope – scope rules – lifetime and garbage
collection – primitive data types – strings – array types – associative arrays – record types –
union types – pointers and references – Arithmetic expressions – overloaded operators –
type conversions – relational and boolean expressions – assignment statements – mixed mode
assignments – control structures – selection – iterations – branching – guarded statements

UNIT III SUBPROGRAMS AND IMPLEMENTATIONS 9

Subprograms – design issues – local referencing – parameter passing – overloaded
methods – generic methods – design issues for functions – semantics of call and return –
implementing simple subprograms – stack and dynamic local variables – nested
subprograms – blocks – dynamic scoping

UNIT IV OBJECT-ORIENTATION, CONCURRENCY, AND EVENT HANDLING 9

Object-orientation – design issues for OOP languages – implementation of object-oriented
constructs – concurrency – semaphores – monitors – message passing – threads –
statement level concurrency – exception handling – event handling

UNIT V FUNCTIONAL AND LOGIC PROGRAMMING LANGUAGES 9

Introduction to lambda calculus – fundamentals of functional programming languages –
Programming with Scheme – Programming with ML – Introduction to logic and logic
programming – Programming with Prolog – multi-paradigm languages
TOTAL: 45 PERIODS
COURSE OUTCOMES:
CO1: Describe syntax and semantics of programming languages
CO2: Explain data, data types, and basic statements of programming languages
CO3: Design and implement subprogram constructs
CO4: Apply object-oriented, concurrency, and event handling programming constructs
and Develop programs in Scheme, ML, and Prolog
CO5: Understand and adopt new programming languages

TEXT BOOKS
1. Robert W. Sebesta, “Concepts of Programming Languages”, Twelfth Edition (Global
Edition), Pearson, 2022.
2. Michael L. Scott, “Programming Language Pragmatics”, Fourth Edition, Elsevier, 2018.
133
 3. R. Kent Dybvig, “The Scheme programming language”, Fourth Edition, Prentice Hall, 2011.
4. Jeffrey D. Ullman, “Elements of ML programming”, Second Edition, Pearson, 1997.
5. W. F. Clocksin and C. S. Mellish, “Programming in Prolog: Using the ISO Standard”, Fifth
Edition, Springer, 2003.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 3 2 1 - - - - - - 3 2 3 -
2 3 3 3 2 2 - - - - - - 3 2 3 -
3 3 3 3 2 2 - - - - - - 3 2 3 -
4 3 3 3 3 2 2 - - - - - - 3 2 -
5 3 3 3 3 3 3 2 2 1 3 1 3 3 3 -
AVg. 2.8 2.8 3 2.4 2 2.5 2 2 1 3 1 3 2.4 2.8 -
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS335 CLOUD COMPUTING L T PC

2 0 2 3
COURSE OBJECTIVES:
 To understand the principles of cloud architecture, models and infrastructure.
 To understand the concepts of virtualization and virtual machines.
 To gain knowledge about virtualization Infrastructure.
 To explore and experiment with various Cloud deployment environments.
 To learn about the security issues in the cloud environment.

UNIT I CLOUD ARCHITECTURE MODELS AND INFRASTRUCTURE 6

Cloud Architecture: System Models for Distributed and Cloud Computing – NIST Cloud Computing
Reference Architecture – Cloud deployment models – Cloud service models; Cloud Infrastructure:
Architectural Design of Compute and Storage Clouds – Design Challenges

UNIT II VIRTUALIZATION BASICS 6

Virtual Machine Basics – Taxonomy of Virtual Machines – Hypervisor – Key Concepts –
Virtualization structure – Implementation levels of virtualization – Virtualization Types: Full
Virtualization – Para Virtualization – Hardware Virtualization – Virtualization of CPU, Memory and
I/O devices.

UNIT III VIRTUALIZATION INFRASTRUCTURE AND DOCKER 7

Desktop Virtualization – Network Virtualization – Storage Virtualization – System-level of Operating
Virtualization – Application Virtualization – Virtual clusters and Resource Management – Containers
vs. Virtual Machines – Introduction to Docker – Docker Components – Docker Container – Docker
Images and Repositories.

UNIT IV CLOUD DEPLOYMENT ENVIRONMENT 6

Google App Engine – Amazon AWS – Microsoft Azure; Cloud Software Environments – Eucalyptus
– OpenStack.

134
UNIT V CLOUD SECURITY 5
Virtualization System-Specific Attacks: Guest hopping – VM migration attack – hyperjacking. Data
Security and Storage; Identity and Access Management (IAM) - IAM Challenges - IAM Architecture
and Practice.
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Install Virtualbox/VMware/ Equivalent open source cloud Workstation with different flavours
of Linux or Windows OS on top of windows 8 and above.
2. Install a C compiler in the virtual machine created using a virtual box and execute Simple
Programs
3. Install Google App Engine. Create a hello world app and other simple web applications using
python/java.
4. Use the 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 files from one virtual machine to another virtual machine.
7. Install Hadoop single node cluster and run simple applications like wordcount.
8. Creating and Executing Your First Container Using Docker.
9. Run a Container from Docker Hub
COURSE OUTCOMES:
CO1: Understand the design challenges in the cloud.
CO2: Apply the concept of virtualization and its types.
CO3: Experiment with virtualization of hardware resources and Docker.
CO4: Develop and deploy services on the cloud and set up a cloud environment.
CO5: Explain security challenges in the cloud environment.
TOTAL:60 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. James Turnbull, “The Docker Book”, O’Reilly Publishers, 2014.
3. Krutz, R. L., Vines, R. D, “Cloud security. A Comprehensive Guide to Secure Cloud
Computing”, Wiley Publishing, 2010.
REFERENCES
1. James E. Smith, Ravi Nair, “Virtual Machines: Versatile Platforms for Systems and
Processes”, Elsevier/Morgan Kaufmann, 2005.
2. Tim Mather, Subra Kumaraswamy, and Shahed Latif, “Cloud Security and Privacy: an
enterprise perspective on risks and compliance”, O’Reilly Media, Inc., 2009.
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 1 1 1 - - - 2 3 1 3 2 1 3
2 3 1 2 2 1 - - - 1 2 1 3 2 2 1
3 2 3 2 3 1 - - - 3 1 1 3 1 1 1
4 1 2 3 3 3 - - - 3 3 1 2 1 3 3
5 2 3 3 1 3 - - - 2 2 1 2 2 2 3
AVg. 2.2 2.2 2.2 2 1.8 - - - 2.2 2.2 1 2.6 1.6 1.8 2.2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

135
CCS372 VIRTUALIZATION L T PC
2 0 2 3
COURSE OBJECTIVES:
 To Learn the basics and types of Virtualization
 To understand the Hypervisors and its types
 To Explore the Virtualization Solutions
 To Experiment the virtualization platforms

UNIT I INTRODUCTION TO VIRTUALIZATION 7

Virtualization and cloud computing - Need of virtualization – cost, administration, fast deployment,
reduce infrastructure cost – limitations- Types of hardware virtualization: Full virtualization - partial
virtualization - Paravirtualization-Types of Hypervisors

UNIT II SERVER AND DESKTOP VIRTUALIZATION 6

Virtual machine basics- Types of virtual machines- Understanding Server Virtualization- types of
server virtualization- Business Cases for Server Virtualization – Uses of Virtual Server Consolidation
– Selecting Server Virtualization Platform-Desktop Virtualization-Types of Desktop Virtualization

UNIT III NETWORK VIRTUALIZATION 6

Introduction to Network Virtualization-Advantages- Functions-Tools for Network Virtualization-
VLAN-WAN Architecture-WAN Virtualization

UNIT IV STORAGE VIRTUALIZATION 5

Memory Virtualization-Types of Storage Virtualization-Block, File-Address space Remapping-Risks
of Storage Virtualization-SAN-NAS-RAID

UNIT V VIRTUALIZATION TOOLS 6

VMWare-Amazon AWS-Microsoft HyperV- Oracle VM Virtual Box - IBM PowerVM- Google
Virtualization- Case study.
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1.Create type 2 virtualization in VMWARE or any equivalent Open Source Tool. Allocate memory
and storage space as per requirement. Install Guest OS on that VMWARE.

2.
a.Shrink and extend virtual disk
b. Create, Manage, Configure and schedule snapshots
c. Create Spanned, Mirrored and Striped volume
d. Create RAID 5 volume
3.
a.Desktop Virtualization using VNC
b.Desktop Virtualization using Chrome Remote Desktop

4.Create type 2 virtualization on ESXI 6.5 server

5.Create a VLAN in CISCO packet tracer
6.Install KVM in Linux
7.Create Nested Virtual Machine(VM under another VM)

136
COURSE OUTCOMES:
CO1: Analyse the virtualization concepts and Hypervisor
CO2: Apply the Virtualization for real-world applications
CO3: Install & Configure the different VM platforms
CO4: Experiment with the VM with various software
TOTAL:60 PERIODS
TEXT BOOKS
1. Cloud computing a practical approach - Anthony T.Velte , Toby J. Velte Robert Elsenpeter,
TATA McGraw- Hill , New Delhi – 2010
2. Cloud Computing (Principles and Paradigms), Edited by Rajkumar Buyya, James Broberg,
Andrzej Goscinski, John Wiley & Sons, Inc. 2011
3. David Marshall, Wade A. Reynolds, Advanced Server Virtualization: VMware and Microsoft
Platform in the Virtual Data Center, Auerbach
4. Chris Wolf, Erick M. Halter, “Virtualization: From the Desktop to the Enterprise”, APress,
2005.
5. James E. Smith, Ravi Nair, “Virtual Machines: Versatile Platforms for Systems and
Processes”, Elsevier/Morgan Kaufmann, 2005.
6. David Marshall, Wade A. Reynolds, “Advanced Server Virtualization: VMware and Microsoft
Platform in the Virtual Data Center”, Auerbach Publications, 2006.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 1 3 1 3 2 - - - 1 1 3 1 2 3 2
2 3 2 2 1 2 - - - 1 2 2 3 3 2 1
3 3 2 1 3 1 - - - 2 2 1 3 3 3 2
4 1 1 2 3 3 - - - 3 3 1 1 3 2 2
5 1 3 2 3 1 - - - 2 1 3 3 1 1 2
AVg. 1.8 2.2 1.6 2.6 1.8 - - - 1.8 1.8 2 2.2 2.4 2.2 1.8
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS341 DATA WAREHOUSING L T P C

2 0 2 3
COURSE OBJECTIVES:
 To know the details of data warehouse Architecture
 To understand the OLAP Technology
 To understand the partitioning strategy
 To differentiate various schema
 To understand the roles of process manager & system manager

UNIT I INTRODUCTION TO DATA WAREHOUSE 5

Data warehouse Introduction - Data warehouse components- operational database Vs data
warehouse – Data warehouse Architecture – Three-tier Data Warehouse Architecture - Autonomous
Data Warehouse- Autonomous Data Warehouse Vs Snowflake - Modern Data Warehouse

137
UNIT II ETL AND OLAP TECHNOLOGY 6
What is ETL – ETL Vs ELT – Types of Data warehouses - Data warehouse Design and Modeling -
Delivery Process - Online Analytical Processing (OLAP) - Characteristics of OLAP - Online
Transaction Processing (OLTP) Vs OLAP - OLAP operations- Types of OLAP- ROLAP Vs MOLAP
Vs HOLAP.

UNIT III META DATA, DATA MART AND PARTITION STRATEGY 7

Meta Data – Categories of Metadata – Role of Metadata – Metadata Repository – Challenges for
Meta Management - Data Mart – Need of Data Mart- Cost Effective Data Mart- Designing Data
Marts- Cost of Data Marts- Partitioning Strategy – Vertical partition – Normalization – Row Splitting
– Horizontal Partition

UNIT IV DIMENSIONAL MODELING AND SCHEMA 6

Dimensional Modeling- Multi-Dimensional Data Modeling – Data Cube- Star Schema- Snowflake
schema- Star Vs Snowflake schema- Fact constellation Schema- Schema Definition - Process
Architecture- Types of Data Base Parallelism – Datawarehouse Tools

UNIT V SYSTEM & PROCESS MANAGERS 6

Data Warehousing System Managers: System Configuration Manager- System Scheduling
Manager - System Event Manager - System Database Manager - System Backup Recovery
Manager - Data Warehousing Process Managers: Load Manager – Warehouse Manager- Query
Manager – Tuning – Testing
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Data exploration and integration with WEKA
2. Apply weka tool for data validation
3. Plan the architecture for real time application
4. Write the query for schema definition
5. Design data ware house for real time applications
6. Analyse the dimensional Modeling
7. Case study using OLAP
8. Case study using OTLP
9. Implementation of warehouse testing.

COURSE OUTCOMES:
At the end of the course the students should be able to
CO1: Design data warehouse architecture for various Problems
CO2: Apply the OLAP Technology
CO3: Analyse the partitioning strategy
CO4: Critically analyze the differentiation of various schema for given problem
CO5: Frame roles of process manager & system manager
TOTAL: 60 PERIODS
TEXT BOOKS
1. Alex Berson and Stephen J. Smith “Data Warehousing, Data Mining & OLAP”, Tata
McGraw – Hill Edition, Thirteenth Reprint 2008.
2. Ralph Kimball, “The Data Warehouse Toolkit: The Complete Guide to Dimensional
Modeling”, Third edition, 2013.

138
REFERENCES
1. Paul Raj Ponniah, “Data warehousing fundamentals for IT Professionals”, 2012.
2. K.P. Soman, ShyamDiwakar and V. Ajay “Insight into Data mining Theory and Practice”,
Easter Economy Edition, Prentice Hall of India, 2006.

CO’s-PO’s & PSO’s MAPPING

PO
CO
1 2 3 4 5 6 7 8 9 10 11 12
1 3 3 3 2 2 - - - 3 - - 3
2 3 2 2 2 3 - - - 2 - 2 2
3 3 3 3 3 - - - - - - - 3
4 3 3 3 3 - - - - - - - 3
5 3 2 2 2 - 2 - - - - 2 2
AVg. 3 2.6 2.6 1.2 2.5 1 - - 2.5 - 2 2.6
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS367 STORAGE TECHNOLOGIES LT P C

3 0 0 3

COURSE OBJECTIVES:

 Characterize the functionalities of logical and physical components of storage

 Describe various storage networking technologies
 Identify different storage virtualization technologies
 Discuss the different backup and recovery strategies
 Understand common storage management activities and solutions

UNIT I STORAGE SYSTEMS 9

Introduction to Information Storage: Digital data and its types, Information storage, Key
characteristics of data center and Evolution of computing platforms. Information Lifecycle
Management. Third Platform Technologies: Cloud computing and its essential characteristics, Cloud
services and cloud deployment models, Big data analytics, Social networking and mobile computing,
Characteristics of third platform infrastructure and Imperatives for third platform transformation. Data
Center Environment: Building blocks of a data center, Compute systems and compute virtualization
and Software-defined data center.

UNIT II INTELLIGENT STORAGE SYSTEMS AND RAID 5

Components of an intelligent storage system, Components, addressing, and performance of hard
disk drives and solid-state drives, RAID, Types of intelligent storage systems, Scale-up and scale-
out storage
Architecture.

UNIT III STORAGE NETWORKING TECHNOLOGIES AND VIRTUALIZATION 13

Block-Based Storage System, File-Based Storage System, Object-Based and Unified Storage. Fibre
Channel SAN: Software-defined networking, FC SAN components and architecture, FC SAN
topologies, link aggregation, and zoning, Virtualization in FC SAN environment. Internet Protocol
SAN: iSCSI protocol, network components, and connectivity, Link aggregation, switch aggregation,
and VLAN, FCIP protocol,

139
connectivity, and configuration. Fibre Channel over Ethernet SAN: Components of FCoE SAN,
FCoE SAN connectivity, Converged Enhanced Ethernet, FCoE architecture.

UNIT IV BACKUP, ARCHIVE AND REPLICATION 12

Introduction to Business Continuity, Backup architecture, Backup targets and methods, Data
deduplication, Cloud-based and mobile device backup, Data archive, Uses of replication and its
characteristics, Compute based, storage-based, and network-based replication, Data migration,
Disaster Recovery as a Service
(DRaaS).

UNIT V SECURING STORAGE INFRASTRUCTURE 6

Information security goals, Storage security domains, Threats to a storage infrastructure, Security
controls to protect a storage infrastructure, Governance, risk, and compliance, Storage infrastructure
management functions, Storage infrastructure management processes.

COURSE OUTCOMES:
CO1: Demonstrate the fundamentals of information storage management and various models of
Cloud infrastructure services and deployment
CO2: Illustrate the usage of advanced intelligent storage systems and RAID
CO3: Interpret various storage networking architectures - SAN, including storage subsystems and
virtualization
CO4: Examine the different role in providing disaster recovery and remote replication technologies
CO5: Infer the security needs and security measures to be employed in information storage
management
TOTAL:45 PERIODS

TEXTBOOKS
1. EMC Corporation, Information Storage and Management, Wiley, India
2. Jon Tate, Pall Beck, Hector Hugo Ibarra, Shanmuganathan Kumaravel and Libor Miklas,
Introduction to Storage Area Networks, Ninth Edition, IBM - Redbooks, December 2017
3. Ulf Troppens, Rainer Erkens, Wolfgang Mueller-Friedt, Rainer Wolafka, Nils Haustein
,Storage Networks Explained, Second Edition, Wiley, 2009

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 1 2 1 3 3 - - - 1 1 1 3 1 2 1
2 3 1 2 3 3 - - - 3 2 3 2 2 3 1
3 1 1 3 2 2 - - - 3 1 1 2 2 3 3
4 3 2 1 2 2 - - - 1 1 3 1 3 2 1
5 1 3 2 1 2 - - - 1 2 3 1 3 2 1
AVg. 1.8 1.8 1.8 2.2 2.4 - - - 1.8 1.4 2.2 1.8 2.2 2.4 1.4
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

140
CCS365 SOFTWARE DEFINED NETWORKS L T PC
2 0 23
COURSE OBJECTIVES:
 To understand the need for SDN and its data plane operations
 To understand the functions of control plane
 To comprehend the migration of networking functions to SDN environment
 To explore various techniques of network function virtualization
 To comprehend the concepts behind network virtualization

UNIT I SDN: INTRODUCTION 6

Evolving Network Requirements – The SDN Approach – SDN architecture - SDN Data Plane ,
Control plane and Application Plane

UNIT II SDN DATA PLANE AND CONTROL PLANE 6

Data Plane functions and protocols - OpenFLow Protocol - Flow Table - Control Plane
Functions - Southbound Interface, Northbound Interface – SDN Controllers - Ryu, OpenDaylight,
ONOS - Distributed Controllers

UNIT III SDN APPLICATIONS 6

SDN Application Plane Architecture – Network Services Abstraction Layer – Traffic Engineering –
Measurement and Monitoring – Security – Data Center Networking

UNIT IV NETWORK FUNCTION VIRTUALIZATION 6

Network Virtualization - Virtual LANs – OpenFlow VLAN Support - NFV Concepts – Benefits and
Requirements – Reference Architecture

UNIT V NFV FUNCTIONALITY 6

NFV Infrastructure – Virtualized Network Functions – NFV Management and Orchestration – NFV
Use cases – SDN and NFV
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1) Setup your own virtual SDN lab
i) Virtualbox/Mininet Environment for SDN - http://mininet.org
ii) https://www.kathara.org
iii) GNS3
2) Create a simple mininet topology with SDN controller and use Wireshark to capture and
visualize the OpenFlow messages such as OpenFlow FLOW MOD, PACKET IN, PACKET
OUT etc.
3) Create a SDN application that uses the Northbound API to program flow table rules on the
switch for various use cases like L2 learning switch, Traffic Engineering, Firewall etc.
4) Create a simple end-to-end network service with two VNFs using vim-emu
https://github.com/containernet/vim-emu
5) Install OSM and onboard and orchestrate network service.

COURSE OUTCOMES:
After the successful completion of this course, the student will be able to
CO1: Describe the motivation behind SDN
CO2: Identify the functions of the data plane and control plane

141
CO3: Design and develop network applications using SDN
CO4: Orchestrate network services using NFV
CO5: Explain various use cases of SDN and NFV
TOTAL :60 PERIODS
TEXTBOOKS:
1. William Stallings, “Foundations of Modern Networking: SDN, NFV, QoE, IoT and Cloud”,
Pearson Education, 1st Edition, 2015.
REFERENCES:
1. Ken Gray, Thomas D. Nadeau, “Network Function Virtualization”, Morgan Kauffman, 2016.
2. Thomas D Nadeau, Ken Gray, “SDN: Software Defined Networks”, O’Reilly Media, 2013.
3. Fei Hu, “Network Innovation through OpenFlow and SDN: Principles and Design”, 1st Edition,
CRC Press, 2014.
4. Paul Goransson, Chuck Black Timothy Culver, “Software Defined Networks: A
Comprehensive Approach”, 2nd Edition, Morgan Kaufmann Press, 2016.
5. Oswald Coker, Siamak Azodolmolky, “Software-Defined Networking with OpenFlow”, 2nd
Edition, O’Reilly Media, 2017.
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 1 2 3 1 3 - - - 2 3 1 3 1 2 1
2 2 1 2 2 3 - - - 2 2 2 2 1 3 2
3 2 2 2 3 3 - - - 3 1 1 2 1 3 3
4 2 2 2 3 1 - - - 1 3 1 2 2 2 2
5 3 3 1 1 3 - - - 1 2 1 2 2 1 3
AVg. 2 2 2 2 2.6 - - - 1.8 2.2 1.2 2.2 1.4 2.2 2.2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS368 STREAM PROCESSING LTPC

2 023
COURSE OBJECTIVES:
 Introduce Data Processing terminology, definition & concepts
 Define different types of Data Processing
 Explain the concepts of Real-time Data processing
 Select appropriate structures for designing and running real-time data services in a
business environment
 Illustrate the benefits and drive the adoption of real-time data services to solve real world
problems
UNIT I FOUNDATIONS OF DATA SYSTEMS 6
Introduction to Data Processing, Stages of Data processing, Data Analytics, Batch Processing,
Stream processing, Data Migration, Transactional Data processing, Data Mining, Data Management
Strategy, Storage, Processing, Integration, Analytics, Benefits of Data as a Service, Challenges

UNIT II REAL-TIME DATA PROCESSING 6

Introduction to Big data, Big data infrastructure, Real-time Analytics, Near real-time solution,
Lambda architecture, Kappa Architecture, Stream Processing,Understanding Data Streams,
Message Broker, Stream Processor, Batch & Real-time ETL tools, Streaming Data Storage

142
UNIT III DATA MODELS AND QUERY LANGUAGES 6
Relational Model, Document Model, Key-Value Pairs, NoSQL, Object-Relational Mismatch, Many-
to-One and Many-to-Many Relationships, Network data models, Schema Flexibility, Structured
Query Language, Data Locality for Queries, Declarative Queries, Graph Data models, Cypher Query
Language, Graph Queries in SQL, The Semantic Web, CODASYL, SPARQL

UNIT IV EVENT PROCESSING WITH APACHE KAFKA 6

Apache Kafka, Kafka as Event Streaming platform, Events, Producers, Consumers, Topics,
Partitions, Brokers, Kafka APIs, Admin API, Producer API, Consumer API, Kafka Streams API,
Kafka Connect API.

UNIT V REAL-TIME PROCESSING USING SPARK STREAMING 6

Structured Streaming, Basic Concepts, Handling Event-time and Late Data, Fault-tolerant
Semantics, Exactly-once Semantics, Creating Streaming Datasets, Schema Inference, Partitioning
of Streaming datasets, Operations on Streaming Data, Selection, Aggregation, Projection,
Watermarking, Window operations, Types of Time windows, Join Operations, Deduplication
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Install MongoDB
2. Design and Implement Simple application using MongoDB
3. Query the designed system using MongoDB
4. Create a Event Stream with Apache Kafka
5. Create a Real-time Stream processing application using Spark Streaming
6. Build a Micro-batch application
7. Real-time Fraud and Anomaly Detection,
8. Real-time personalization, Marketing, Advertising

COURSE OUTCOMES:
CO1:Understand the applicability and utility of different streaming algorithms.
CO2:Describe and apply current research trends in data-stream processing.
CO3:Analyze the suitability of stream mining algorithms for data stream systems.
CO4:Program and build stream processing systems, services and applications.
CO5:Solve problems in real-world applications that process data streams.
TOTAL:60 PERIODS
TEXT BOOKS
1. Streaming Systems: The What, Where, When and How of Large-Scale Data Processing by
Tyler Akidau, Slava Chemyak, Reuven Lax, O’Reilly publication
2. Designing Data-Intensive Applications by Martin Kleppmann, O’Reilly Media
3. Practical Real-time Data Processing and Analytics : Distributed Computing and Event
Processing using Apache Spark, Flink, Storm and Kafka, Packt Publishing
REFERENCES
1. https://spark.apache.org/docs/latest/streaming-programming-guide.html
2. Kafka.apache.org

143
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 2 3 1 - - - 2 3 1 2 1 3 3
2 2 1 1 2 2 - - - 3 2 2 3 1 2 1
3 3 1 2 3 3 - - - 2 2 1 1 2 2 1
4 2 1 3 3 3 - - - 3 3 1 1 1 2 1
5 3 3 1 2 2 - - - 3 3 2 3 2 3 2
AVg. 2.6 1.8 1.8 2.6 2.2 - - - 2.6 2.6 1.4 2 1.4 2.4 1.6
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS362 SECURITY AND PRIVACY IN CLOUD LT P C

2 0 2 3
COURSE OBJECTIVES:
 To Introduce Cloud Computing terminology, definition & concepts
 To understand the security design and architectural considerations for Cloud
 To understand the Identity, Access control in Cloud
 To follow best practices for Cloud security using various design patterns
 To be able to monitor and audit cloud applications for security

UNIT I FUNDAMENTALS OF CLOUD SECURITY CONCEPTS 7

Overview of cloud security- Security Services - Confidentiality, Integrity, Authentication, Non-
repudiation, Access Control - Basic of cryptography - Conventional and public-key cryptography,
hash functions, authentication, and digital signatures.

UNIT II SECURITY DESIGN AND ARCHITECTURE FOR CLOUD 6

Security design principles for Cloud Computing - Comprehensive data protection - End-to-end
access control - Common attack vectors and threats - Network and Storage - Secure Isolation
Strategies - Virtualization strategies - Inter-tenant network segmentation strategies - Data Protection
strategies: Data retention, deletion and archiving procedures for tenant data, Encryption, Data
Redaction, Tokenization, Obfuscation, PKI and Key

UNIT III ACCESS CONTROL AND IDENTITY MANAGEMENT 6

Access control requirements for Cloud infrastructure - User Identification - Authentication and
Authorization - Roles-based Access Control - Multi-factor authentication - Single Sign-on, Identity
Federation - Identity providers and service consumers - Storage and network access control options
- OS Hardening and minimization - Verified and measured boot - Intruder Detection and prevention

UNIT IV CLOUD SECURITY DESIGN PATTERNS 6

Introduction to Design Patterns, Cloud bursting, Geo-tagging, Secure Cloud Interfaces, Cloud
Resource Access Control, Secure On-Premise Internet Access, Secure External Cloud

UNIT V MONITORING, AUDITING AND MANAGEMENT 5

Proactive activity monitoring - Incident Response, Monitoring for unauthorized access, malicious
traffic, abuse of system privileges - Events and alerts - Auditing – Record generation, Reporting and
Management, Tamper-proofing audit logs, Quality of Services, Secure Management, User
management, Identity management, Security Information and Event Management

144
 30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Simulate a cloud scenario using Cloud Sim and run a scheduling algorithm not present in
Cloud Sim
2. simulate resource management using cloud sim
3. simulate log forensics using cloud sim
4. simulate a secure file sharing using a cloud sim
5. Implement data anonymization techniques over the simple dataset (masking, k-
anonymization, etc)
6. Implement any encryption algorithm to protect the images
7. Implement any image obfuscation mechanism
8. Implement a role-based access control mechanism in a specific scenario
9. implement an attribute-based access control mechanism based on a particular scenario
10. Develop a log monitoring system with incident management in the cloud

COURSE OUTCOMES:
CO1: Understand the cloud concepts and fundamentals.
CO2: Explain the security challenges in the cloud.
CO3: Define cloud policy and Identity and Access Management.
CO4: Understand various risks and audit and monitoring mechanisms in the cloud.
CO5: Define the various architectural and design considerations for security in the cloud.
TOTAL:60 PERIODS
TEXTBOOKS
1. Raj Kumar Buyya , James Broberg, andrzejGoscinski, “Cloud Computing:‖, Wiley 2013
2. Dave shackleford, “Virtualization Security‖, SYBEX a wiley Brand 2013.
3. Mather, Kumaraswamy and Latif, “Cloud Security and Privacy‖, OREILLY 2011
REFERENCES
1. Mark C. Chu-Carroll “Code in the Cloud‖,CRC Press, 2011
2. Mastering Cloud Computing Foundations and Applications Programming RajkumarBuyya,
Christian Vechhiola, S. ThamaraiSelvi

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 3 1 2 - - - 1 1 1 3 3 1 2
2 1 3 2 3 1 - - - 2 2 3 2 3 1 2
3 3 2 2 3 2 - - - 3 1 1 2 2 3 1
4 2 1 2 3 3 - - - 3 2 3 3 1 1 2
5 1 3 3 1 1 - - - 2 3 3 2 2 3 2
AVg. 2 2.4 2.4 2.2 1.8 - - - 2.2 1.8 2.2 2.4 2.2 1.8 1.8
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

145
CCS344 ETHICAL HACKING L T PC
2 0 23
COURSE OBJECTIVES:
 To understand the basics of computer based vulnerabilities.
 To explore different foot printing, reconnaissance and scanning methods.
 To expose the enumeration and vulnerability analysis methods.
 To understand hacking options available in Web and wireless applications.
 To explore the options for network protection.
 To practice tools to perform ethical hacking to expose the vulnerabilities.

UNIT I INTRODUCTION 6
Ethical Hacking Overview - Role of Security and Penetration Testers .- Penetration-Testing
Methodologies- Laws of the Land - Overview of TCP/IP- The Application Layer - The Transport
Layer - The Internet Layer - IP Addressing .- Network and Computer Attacks - Malware - Protecting
Against Malware Attacks.- Intruder Attacks - Addressing Physical Security

UNIT II FOOT PRINTING, RECONNAISSANCE AND SCANNING NETWORKS 6

Footprinting Concepts - Footprinting through Search Engines, Web Services, Social Networking
Sites, Website, Email - Competitive Intelligence - Footprinting through Social Engineering -
Footprinting Tools - Network Scanning Concepts - Port-Scanning Tools - Scanning Techniques -
Scanning Beyond IDS and Firewall

UNIT III ENUMERATION AND VULNERABILITY ANALYSIS 6

Enumeration Concepts - NetBIOS Enumeration – SNMP, LDAP, NTP, SMTP and DNS
Enumeration - Vulnerability Assessment Concepts - Desktop and Server OS Vulnerabilities -
Windows OS Vulnerabilities - Tools for Identifying Vulnerabilities in Windows- Linux OS
Vulnerabilities- Vulnerabilities of Embedded Oss

UNIT IV SYSTEM HACKING 6

Hacking Web Servers - Web Application Components- Vulnerabilities - Tools for Web Attackers and
Security Testers Hacking Wireless Networks - Components of a Wireless Network – Wardriving-
Wireless Hacking - Tools of the Trade –

UNIT V NETWORK PROTECTION SYSTEMS 6

Access Control Lists. - Cisco Adaptive Security Appliance Firewall - Configuration and Risk Analysis
Tools for Firewalls and Routers - Intrusion Detection and Prevention Systems - Network-Based and
Host-Based IDSs and IPSs - Web Filtering - Security Incident Response Teams – Honeypots.
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Install Kali or Backtrack Linux / Metasploitable/ Windows XP
2. Practice the basics of reconnaissance.
3. Using FOCA / SearchDiggity tools, extract metadata and expanding the target
list.
4. Aggregates information from public databases using online free tools like
Paterva’s Maltego.
5. Information gathering using tools like Robtex.
6. Scan the target using tools like Nessus.
7. View and capture network traffic using Wireshark.
146
 8. Automate dig for vulnerabilities and match exploits using Armitage
FOCA : http://www.informatica64.com/foca.aspx.
Nessus : http://www.tenable.com/products/nessus.
Wireshark : http://www.wireshark.org.
Armitage : http://www.fastandeasyhacking.com/.
Kali or Backtrack Linux, Metasploitable, Windows XP

COURSE OUTCOMES:
At the end of this course, the students will be able:
CO1: To express knowledge on basics of computer based vulnerabilities
CO2: To gain understanding on different foot printing, reconnaissance and scanning methods.
CO3: To demonstrate the enumeration and vulnerability analysis methods
CO4: To gain knowledge on hacking options available in Web and wireless applications.
CO5: To acquire knowledge on the options for network protection.
CO6: To use tools to perform ethical hacking to expose the vulnerabilities.
TOTAL:60 PERIODS
TEXTBOOKS
1. Michael T. Simpson, Kent Backman, and James E. Corley, Hands-On Ethical Hacking and
Network Defense, Course Technology, Delmar Cengage Learning, 2010.
2. The Basics of Hacking and Penetration Testing - Patrick Engebretson, SYNGRESS,
Elsevier, 2013.
3. The Web Application Hacker’s Handbook: Finding and Exploiting Security Flaws, Dafydd
Stuttard and Marcus Pinto, 2011.

REFERENCES
1. Black Hat Python: Python Programming for Hackers and Pentesters, Justin Seitz , 2014.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 2 3 2 1 - - - 1 2 2 1 1 2 3
2 1 2 1 2 1 - - - 2 2 1 1 1 2 2
3 2 2 3 3 1 - - - 1 2 1 2 2 3 1
4 2 1 1 2 1 - - - 1 3 3 3 3 2 1
5 2 3 1 1 2 - - - 2 1 1 1 1 1 3
AVg. 1.8 2 1.8 2 1.2 - - - 1.4 2 1.6 1.6 1.6 2 2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS343 DIGITAL AND MOBILE FORENSICS L T P C

2 0 2 3
COURSE OBJECTIVES:
 To understand basic digital forensics and techniques.
 To understand digital crime and investigation.
 To understand how to be prepared for digital forensic readiness.
 To understand and use forensics tools for iOS devices.
 To understand and use forensics tools for Android devices.

147
UNIT I INTRODUCTION TO DIGITAL FORENSICS 6
Forensic Science – Digital Forensics – Digital Evidence – The Digital Forensics Process –
Introduction – The Identification Phase – The Collection Phase – The Examination Phase – The
Analysis Phase – The Presentation Phase

UNIT II DIGITAL CRIME AND INVESTIGATION 6

Digital Crime – Substantive Criminal Law – General Conditions – Offenses – Investigation Methods
for Collecting Digital Evidence – International Cooperation to Collect Digital Evidence

UNIT III DIGITAL FORENSIC READINESS 6

Introduction – Law Enforcement versus Enterprise Digital Forensic Readiness – Rationale for Digital
Forensic Readiness – Frameworks, Standards and Methodologies – Enterprise Digital Forensic
Readiness – Challenges in Digital Forensics

UNIT IV iOS FORENSICS 6

Mobile Hardware and Operating Systems - iOS Fundamentals – Jailbreaking – File System –
Hardware – iPhone Security – iOS Forensics – Procedures and Processes – Tools – Oxygen
Forensics – MobilEdit – iCloud

UNIT V ANDROID FORENSICS 6

Android basics – Key Codes – ADB – Rooting Android – Boot Process – File Systems – Security –
Tools – Android Forensics – Forensic Procedures – ADB – Android Only Tools – Dual Use Tools –
Oxygen Forensics – MobilEdit – Android App Decompiling

COURSE OUTCOMES:
On completion of the course, the students will be able to:
CO1: Have knowledge on digital forensics.
CO2: Know about digital crime and investigations.
CO3: Be forensic ready.
CO4: Investigate, identify and extract digital evidence from iOS devices.
CO5: Investigate, identify and extract digital evidence from Android devices.
30 PERIODS
LAB EXPERIMENTS:
1. Installation of Sleuth Kit on Linux. List all data blocks. Analyze allocated as well as unallocated
blocks of a disk image.
2. Data extraction from call logs using Sleuth Kit.
3. Data extraction from SMS and contacts using Sleuth Kit.
4. Install Mobile Verification Toolkit or MVT and decrypt encrypted iOS backups.
5. Process and parse records from the iOS system.
6. Extract installed applications from Android devices.
7. Extract diagnostic information from Android devices through the adb protocol.
8. Generate a unified chronological timeline of extracted records,
30 PERIODS
TOTAL : 60 PERIODS
TEXT BOOK:
1. Andre Arnes, “Digital Forensics”, Wiley, 2018.
2. Chuck Easttom, “An In-depth Guide to Mobile Device Forensics”, First Edition, CRC
Press, 2022.
148
REFERENCES
1. Vacca, J, Computer Forensics, Computer Crime Scene Investigation, 2nd Ed, Charles
River Media, 2005, ISBN: 1-58450-389.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 3 2 1 - - - 1 1 3 3 1 3 1
2 3 3 3 3 3 - - - 2 2 1 2 1 3 1
3 3 3 2 3 1 - - - 3 2 1 1 3 2 3
4 3 1 2 2 3 - - - 1 3 3 2 1 3 3
5 1 3 2 3 2 - - - 2 3 2 3 1 2 1
AVg. 3 2 2 3 2 - - - 2 2 2 2 1 3 2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS363 SOCIAL NETWORK SECURITY L T P C

2 0 2 3
COURSE OBJECTIVES:
 To develop semantic web related simple applications
 To explain Privacy and Security issues in Social Networking
 To explain the data extraction and mining of social networks
 To discuss the prediction of human behavior in social communities
 To describe the Access Control, Privacy and Security management of social networks

UNIT I FUNDAMENTALS OF SOCIAL NETWORKING 6

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, Historical overview of privacy and security, Major
paradigms, for understanding privacy and security

UNIT II SECURITY ISSUES IN SOCIAL NETWORKS 6

The evolution of privacy and security concerns with networked technologies, Contextual influences
on privacy attitudes and behaviors, Anonymity in a networked world

UNIT III EXTRACTION AND MINING IN SOCIAL NETWORKING DATA 6

Extracting evolution of Web Community from a Series of Web Archive, Detecting communities in
social networks, Definition of community, Evaluating communities, Methods for community detection
and mining, Applications of community mining algorithms, Tools for detecting communities social
network infrastructures and communities, Big data and Privacy

UNIT IV PREDICTING HUMAN BEHAVIOR AND PRIVACY ISSUES 6

Understanding and predicting human behavior for social communities, User data Management,
Inference and Distribution, Enabling new human experiences, Reality mining, Context, Awareness,
Privacy in online social networks, Trust in online environment, What is Neo4j, Nodes, Relationships,
Properties.

149
UNIT V ACCESS CONTROL, PRIVACY AND IDENTITY MANAGEMENT 6
Understand the access control requirements for Social Network, Enforcing Access Control
Strategies, Authentication and Authorization, Roles-based Access Control, Host, storage and
network access control options, Firewalls, Authentication, and Authorization in Social Network,
Identity & Access Management, Single Sign-on, Identity Federation, Identity providers and service
consumers, The role of Identity provisioning

COURSE OUTCOMES:
CO1: Develop semantic web related simple applications
CO2 : Address Privacy and Security issues in Social Networking
CO3: Explain the data extraction and mining of social networks
CO4: Discuss the prediction of human behavior in social communities
CO5: Describe the applications of social networks
30 PERIODS
PRACTICALEXERCISES: 30 PERIODS
1. Design own social media application
2. Create a Network model using Neo4j
3. Read and write Data from Graph Database
4. Find “Friend of Friends” using Neo4j
5. Implement secure search in social media
6. Create a simple Security & Privacy detector
TOTAL:60 PERIODS
TEXT BOOKS
1. Peter Mika, Social Networks and the Semantic Web, First Edition, Springer 2007.
2. BorkoFurht, Handbook of Social Network Technologies and Application, First Edition,
Springer, 2010.
3. Learning Neo4j 3.x Second Edition By Jérôme Baton, Rik Van Bruggen, Packt publishing
4. David Easley, Jon Kleinberg, Networks, Crowds, and Markets: Reasoning about a Highly
Connected World‖, First Edition, Cambridge University Press, 2010.

REFERENCES
1. Easley D. Kleinberg J., Networks, Crowds, and Markets – Reasoning about a Highly
Connected World‖, Cambridge University Press, 2010.
2. Jackson, Matthew O., Social and Economic Networks‖, Princeton University Press, 2008.
3. GuandongXu ,Yanchun Zhang and Lin Li, ―Web Mining and Social Networking –
Techniques and applications‖, First Edition, Springer, 2011.
4. Dion Goh and Schubert Foo, Social information Retrieval Systems: Emerging Technologies
and Applications for Searching the Web Effectively‖, IGI Global Snippet, 2008.
5. Max Chevalier, Christine Julien and Chantal Soulé-Dupuy, Collaborative and Social
Information Retrieval and Access: Techniques for Improved user Modeling‖, IGI Global
Snippet, 2009.
6. John G. Breslin, Alexander Passant and Stefan Decker, The Social Semantic Web‖,
Springer, 2009.

150
 CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 2 3 2 - - - 3 2 1 2 3 3 2
2 2 2 2 3 3 - - - 1 2 2 3 3 3 2
3 2 1 1 3 2 - - - 1 2 1 1 1 3 3
4 3 3 3 3 2 - - - 1 1 1 1 2 1 3
5 1 3 2 2 2 - - - 1 1 3 1 2 3 3
AVg. 2.2 2 2 2.8 2.2 - - - 1.4 1.6 1.6 1.6 2.2 2.6 2.6
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS351 MODERN CRYPTOGRAPHY L T PC

2 0 23
COURSE OBJECTIVES:
 To learn about Modern Cryptography.
 To focus on how cryptographic algorithms and protocols work and how to use them.
 To build a Pseudorandom permutation.
 To construct Basic cryptanalytic techniques.
 To provide instruction on how to use the concepts of block ciphers and message
authentication codes.

UNIT I INTRODUCTION 6
Basics of Symmetric Key Cryptography, Basics of Asymmetric Key Cryptography, Hardness of
Functions. Notions of Semantic Security (SS) and Message Indistinguishability (MI): Proof of
Equivalence of SS and MI, Hard Core Predicate, Trap-door permutation, Goldwasser-Micali
Encryption. Goldreich-Levin Theorem: Relation between Hardcore Predicates and Trap-door
permutations.

UNIT II FORMAL NOTIONS OF ATTACKS 6

Attacks under Message Indistinguishability: Chosen Plaintext Attack (IND-CPA), Chosen Ciphertext
Attacks (IND-CCA1 and IND-CCA2), Attacks under Message Non-malleability: NM-CPA and NM-
CCA2, Inter-relations among the attack model

UNIT III RANDOM ORACLES 6

Provable Security and asymmetric cryptography, hash functions. One-way functions: Weak and
Strong one-way functions. Pseudo-random Generators (PRG): Blum-Micali-Yao Construction,
Construction of more powerful PRG, Relation between One-way functions and PRG, Pseudo-
random Functions (PRF)

UNIT IV BUILDING A PSEUDORANDOM PERMUTATION 6

The LubyRackoff Construction: Formal Definition, Application of the LubyRackoff Construction to
the construction of Block Ciphers, The DES in the light of LubyRackoff Construction.

UNIT V MESSAGE AUTHENTICATION CODES 6

Left or Right Security (LOR). Formal Definition of Weak and Strong MACs, Using a PRF as a MAC,
Variable length MAC. Public Key Signature Schemes: Formal Definitions, Signing and Verification,
Formal Proofs of Security of Full Domain Hashing. Assumptions for Public Key Signature Schemes:
151
One-way functions Imply Secure One-time Signatures. Shamir's Secret Sharing Scheme. Formally
Analyzing Cryptographic Protocols. Zero Knowledge Proofs and Protocols.
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Implement Feige-Fiat-Shamir identification protocol.
2. Implement GQ identification protocol.
3. Implement Schnorr identification protocol.
4. Implement Rabin one-time signature scheme.
5. Implement Merkle one-time signature scheme.
6. Implement Authentication trees and one-time signatures.
7. Implement GMR one-time signature scheme.

COURSE OUTCOMES:
CO1: Interpret the basic principles of cryptography and general cryptanalysis.
CO2: Determine the concepts of symmetric encryption and authentication.
CO3: Identify the use of public key encryption, digital signatures, and key establishment.
CO4: Articulate the cryptographic algorithms to compose, build and analyze simple cryptographic
solutions.
CO5: Express the use of Message Authentication Codes.
TOTAL:60 PERIODS
TEXT BOOKS:
1. Hans Delfs and Helmut Knebl, Introduction to Cryptography: Principles and Applications,
Springer Verlag.
2. Wenbo Mao, Modern Cryptography, Theory and Practice, Pearson Education (Low Priced
Edition)
REFERENCES:
1. ShaffiGoldwasser and MihirBellare, Lecture Notes on Cryptography, Available at
http://citeseerx.ist.psu.edu/.
2. OdedGoldreich, Foundations of Cryptography, CRC Press (Low Priced Edition Available),
Part 1 and Part 23
3. William Stallings, “Cryptography and Network Security: Principles and Practice”, PHI 3rd
Edition, 2006.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 3 3 1 - - - 2 1 1 2 2 1 1
2 1 3 2 1 2 - - - 3 2 2 2 2 1 3
3 1 1 2 3 2 - - - 1 1 1 3 1 1 3
4 3 1 2 1 3 - - - 3 2 1 2 3 2 1
5 2 3 3 3 3 - - - 3 1 1 1 2 1 1
AVg. 2 2.2 2.4 2.2 2.2 - - - 2.4 1.4 1.2 2 2 1.2 1.8
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

152
CB3591 ENGINEERING SECURE SOFTWARE SYSTEMS L T PC
2 0 23
COURSE OBJECTIVES:
 Know the importance and need for software security.
 Know about various attacks.
 Learn about secure software design.
 Understand risk management in secure software development.
 Know the working of tools related to software security.

UNIT I NEED OF SOFTWARE SECURITY AND LOW-LEVEL ATTACKS 6

Software Assurance and Software Security - Threats to software security - Sources of software
insecurity - Benefits of Detecting Software Security - Properties of Secure Software – Memory-
Based Attacks: Low-Level Attacks Against Heap and Stack - Defense Against Memory-Based
Attacks

UNIT II SECURE SOFTWARE DESIGN 7

Requirements Engineering for secure software - SQUARE process Model - Requirements
elicitation and prioritization- Isolating The Effects of Untrusted Executable Content - Stack
Inspection – Policy Specification Languages – Vulnerability Trends – Buffer Overflow – Code
Injection - Session Hijacking. Secure Design - Threat Modeling and Security Design Principles

UINT III SECURITY RISK MANAGEMENT 5

Risk Management Life Cycle – Risk Profiling – Risk Exposure Factors – Risk Evaluation and
Mitigation – Risk Assessment Techniques – Threat and Vulnerability Management

UNIT IV SECURITY TESTING 8

Traditional Software Testing – Comparison - Secure Software Development Life Cycle - Risk
Based Security Testing – Prioritizing Security Testing With Threat Modeling – Penetration Testing
– Planning and Scoping - Enumeration – Remote Exploitation – Web Application Exploitation -
Exploits and Client Side Attacks – Post Exploitation – Bypassing Firewalls and Avoiding Detection
- Tools for Penetration Testing

UNIT V SECURE PROJECT MANAGEMENT 4

Governance and security - Adopting an enterprise software security framework - Security and
project management - Maturity of Practice
30 PERIODS
PRACTICAL EXERCISES
1. Implement the SQL injection attack.
2. Implement the Buffer Overflow attack.
3. Implement Cross Site Scripting and Prevent XSS.
4. Perform Penetration testing on a web application to gather information about the system, then
initiate XSS and SQL injection attacks using tools like Kali Linux.
5. Develop and test the secure test cases
6. Penetration test using kali Linux
30 PERIODS
COURSE OUTCOMES:
Upon completion of the course, the student will be able to
CO1: Identify various vulnerabilities related to memory attacks.
153
CO2: Apply security principles in software development.
CO3: Evaluate the extent of risks.
CO4: Involve selection of testing techniques related to software security in the testing phase of
software development.
CO5: Use tools for securing software.
TOTAL: 60 PERIODS
TEXT BOOKS:
1. Julia H. Allen, “Software Security Engineering”, Pearson Education, 2008
2. Evan Wheeler, “Security Risk Management: Building an Information Security Risk Management
Program from the Ground Up”, First edition, Syngress Publishing, 2011
3. Chris Wysopal, Lucas Nelson, Dino Dai Zovi, and Elfriede Dustin, “The Art of Software Security
Testing: Identifying Software Security Flaws (Symantec Press)”, Addison-Wesley Professional,
2006
REFERENCES:
1. Robert C. Seacord, “Secure Coding in C and C++ (SEI Series in Software Engineering)”,
Addison-Wesley Professional, 2005.
2. Jon Erickson, “Hacking: The Art of Exploitation”, 2nd Edition, No Starch Press, 2008.
3. Mike Shema, “Hacking Web Apps: Detecting and Preventing Web Application Security
Problems”, First edition, Syngress Publishing, 2012
4. Bryan Sullivan and Vincent Liu, “Web Application Security, A Beginner's Guide”, Kindle
Edition, McGraw Hill, 2012
5. Lee Allen, “Advanced Penetration Testing for Highly-Secured Environments: The Ultimate
Security Guide (Open Source: Community Experience Distilled)”, Kindle Edition, Packt
Publishing,2012
6. Jason Grembi, “Developing Secure Software”

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 2 3 2 3 2 - - - 2 1 2 2 2 2 1
2 2 2 2 3 3 - - - 2 1 2 2 1 2 1
3 1 2 2 2 1 - - - 1 1 2 1 2 2 1
4 2 3 2 2 2 - - - 2 1 2 2 2 2 1
5 2 1 2 2 3 - - - 2 1 1 2 2 1 2
AVg. 1.8 2.2 2 2.4 2.2 - - - 1.8 1 1.8 1.8 1.8 1.8 1.2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS339 CRYPTOCURRENCY AND BLOCKCHAIN TECHNOLOGIES LT P C

2 0 2 3
COURSE OBJECTIVES:
 To understand the basics of Blockchain
 To learn Different protocols and consensus algorithms in Blockchain
 To learn the Blockchain implementation frameworks
 To understand the Blockchain Applications
 To experiment the Hyperledger Fabric, Ethereum networks

154
UNIT I INTRODUCTION TO BLOCKCHAIN 7
Blockchain- Public Ledgers, Blockchain as Public Ledgers - Block in a Blockchain, Transactions-
The Chain and the Longest Chain - Permissioned Model of Blockchain, Cryptographic -Hash
Function, Properties of a hash function-Hash pointer and Merkle tree

UNIT II BITCOIN AND CRYPTOCURRENCY 6

A basic crypto currency, Creation of coins, Payments and double spending, FORTH – the precursor
for Bitcoin scripting, Bitcoin Scripts , Bitcoin P2P Network, Transaction in Bitcoin Network, Block
Mining, Block propagation and block relay

UNIT III BITCOIN CONSENSUS 6

Bitcoin Consensus, Proof of Work (PoW)- Hashcash PoW , Bitcoin PoW, Attacks on PoW ,monopoly
problem- Proof of Stake- Proof of Burn - Proof of Elapsed Time - Bitcoin Miner, Mining Difficulty,
Mining Pool-Permissioned model and use cases.

UNIT IV HYPERLEDGER FABRIC & ETHEREUM 5

Architecture of Hyperledger fabric v1.1- chain code- Ethereum: Ethereum network, EVM,
Transaction fee, Mist Browser, Ether, Gas, Solidity.

UNIT V BLOCKCHAIN APPLICATIONS 6

Smart contracts, Truffle Design and issue- DApps- NFT. Blockchain Applications in Supply Chain
Management, Logistics, Smart Cities, Finance and Banking, Insurance,etc- Case Study.

COURSE OUTCOMES:
CO1: Understand emerging abstract models for Blockchain Technology
CO2: Identify major research challenges and technical gaps existing between theory and practice
in the crypto currency domain.
CO3: It provides conceptual understanding of the function of Blockchain as a method of securing
distributed ledgers, how consensus on their contents is achieved, and the new applications
that they enable.
CO4: Apply hyperledger Fabric and Ethereum platform to implement the Block chain Application.

30 PERIODS
PRACTICAL 30 PERIODS
1. Install and understand Docker container, Node.js, Java and Hyperledger Fabric, Ethereum
and perform necessary software installation on local machine/create instance on cloud to
run.
2. Create and deploy a blockchain network using Hyperledger Fabric SDK for Java Set up and
initialize the channel, install and instantiate chain code, and perform invoke and query on
your blockchain network.
3. Interact with a blockchain network. Execute transactions and requests against a blockchain
network by creating an app to test the network and its rules.
4. Deploy an asset-transfer app using blockchain. Learn app development within a Hyperledger
Fabric network.
5. Use blockchain to track fitness club rewards. Build a web app that uses Hyperledger Fabric
to track and trace member rewards.

155
 6. Car auction network: A Hello World example with Hyperledger Fabric Node SDK and IBM
Blockchain Starter Plan. Use Hyperledger Fabric to invoke chain code while storing results
and data in the starter plan
TOTAL: 60 PERIODS
TEXT BOOKS
1. Bashir and Imran, Mastering Blockchain: Deeper insights into decentralization, cryptography,
Bitcoin, and popular Blockchain frameworks, 2017.
2. 2.Andreas Antonopoulos, “Mastering Bitcoin: Unlocking Digital Cryptocurrencies”, O’Reilly,
2014.
REFERENCES:
1. Daniel Drescher, “Blockchain Basics”, First Edition, Apress, 2017.
2. Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller, and Steven Goldfeder.
Bitcoin and cryptocurrency technologies: a comprehensive introduction. Princeton University
Press, 2016.
3. Melanie Swan, “Blockchain: Blueprint for a New Economy”, O’Reilly, 2015
4. Ritesh Modi, “Solidity Programming Essentials: A Beginner’s Guide to Build Smart Contracts
for Ethereum and Blockchain”, Packt Publishing
5. Handbook of Research on Blockchain Technology, published by Elsevier Inc. ISBN:
9780128198162, 2020.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 2 2 1 - - - 1 - - 2 3 1 1
2 3 3 3 3 1 - - - 2 - - 2 1 2 1
3 3 3 3 3 2 - - - 3 - - 2 2 3 3
4 3 2 3 2 3 - - - 3 - - 2 2 2 3
AVg. 3 2.75 2.75 2.5 1.75 2.25 2 3 2.75 2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS354 NETWORK SECURITY L T P C

2 0 2 3
COURSE OBJECTIVES:
 To learn the fundamentals of cryptography.
 To learn the key management techniques and authentication approaches.
 To explore the network and transport layer security techniques.
 To understand the application layer security standards.
 To learn the real time security practices.

UNIT I INTRODUCTION 8
Basics of cryptography, conventional and public-key cryptography, hash functions, authentication,
and digital signatures.

UNIT II KEY MANAGEMENT AND AUTHENTICATION 7

Key Management and Distribution: Symmetric Key Distribution, Distribution of Public Keys, X.509
Certificates, Public-Key Infrastructure. User Authentication: Remote User-Authentication Principles,
Remote User-Authentication Using Symmetric Encryption, Kerberos Systems, Remote User
Authentication Using Asymmetric Encryption.
156
UNIT III ACCESS CONTROL AND SECURITY 4
Network Access Control: Network Access Control, Extensible Authentication Protocol, IEEE 802.1X
Port-Based Network Access Control - IP Security - Internet Key Exchange (IKE). Transport-Level
Security: Web Security Considerations, Secure Sockets Layer, Transport Layer Security, HTTPS
standard, Secure Shell (SSH) application.

UNIT IV APPLICATION LAYER SECURITY 5

Electronic Mail Security: Pretty Good Privacy, S/MIME, DomainKeys Identified Mail. Wireless
Network Security: Mobile Device Security

UNIT V SECURITY PRACTICES 6

Firewalls and Intrusion Detection Systems: Intrusion Detection Password Management, Firewall
Characteristics Types of Firewalls, Firewall Basing, Firewall Location and Configurations.
Blockchains, Cloud Security and IoT security
30 PERIODS
PRACTICALEXERCISES: 30 PERIODS
1. Implement symmetric key algorithms
2. Implement asymmetric key algorithms and key exchange algorithms
3. Implement digital signature schemes
4. Installation of Wire shark, tcpdump and observe data transferred in client-server
communication using UDP/TCP and identify the UDP/TCP datagram.
5. Check message integrity and confidentiality using SSL
6. Experiment Eavesdropping, Dictionary attacks, MITM attacks
7. Experiment with Sniff Traffic using ARP Poisoning
8. Demonstrate intrusion detection system using any tool.
9. Explore network monitoring tools
10. Study to configure Firewall, VPN

COURSE OUTCOMES:
At the end of this course, the students will be able:
CO1: Classify the encryption techniques
CO2: Illustrate the key management technique and authentication.
CO3 Evaluate the security techniques applied to network and transport layer
CO4: Discuss the application layer security standards.
CO5: Apply security practices for real time applications.
TOTAL:60 PERIODS
TEXT BOOKS:
1. Cryptography and Network Security: Principles and Practice, 6th Edition, William Stallings,
2014, Pearson, ISBN 13:9780133354690.

REFERENCES:
1. Network Security: Private Communications in a Public World, M. Speciner, R. Perlman, C.
Kaufman, Prentice Hall, 2002.
2. Linux iptables Pocket Reference, Gregor N. Purdy, O'Reilly, 2004, ISBN-13: 978-
0596005696.
3. Linux Firewalls, by Michael Rash, No Starch Press, October 2007, ISBN: 978-1-59327-141-
1.

157
 4. Network Security, Firewalls And VPNs, J. Michael Stewart, Jones & Bartlett Learning, 2013,
ISBN-10: 1284031675, ISBN-13: 978-1284031676.
5. The Network Security Test Lab: A Step-By-Step Guide, Michael Gregg, Dreamtech Press,
2015, ISBN-10:8126558148, ISBN-13: 978-8126558148.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 2 2 2 - - - 2 1 2 1 2 3 1
2 1 1 3 2 2 - - - 2 2 1 1 3 1 2
3 1 2 1 1 2 - - - 3 3 1 3 2 1 3
4 2 2 3 2 3 - - - 3 3 2 1 2 1 3
5 2 1 3 2 2 - - - 2 1 1 3 2 1 1
AVg. 1.8 1.8 2.4 1.8 2.2 - - - 2.4 2 1.4 1.8 2.2 1.4 2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS333 AUGMENTED REALITY/VIRTUAL REALITY L T P C

2 0 2 3
COURSE OBJECTIVES:
 To impart the fundamental aspects and principles of AR/VR technologies.
 To know the internals of the hardware and software components involved in the
development of AR/VR enabled applications.
 To learn about the graphical processing units and their architectures.
 To gain knowledge about AR/VR application development.
 To know the technologies involved in the development of AR/VR based applications.

UNIT I INTRODUCTION 7
Introduction to Virtual Reality and Augmented Reality – Definition – Introduction to Trajectories and
Hybrid Space-Three I’s of Virtual Reality – Virtual Reality Vs 3D Computer Graphics – Benefits of
Virtual Reality – Components of VR System – Introduction to AR-AR Technologies-Input Devices –
3D Position Trackers – Types of Trackers – Navigation and Manipulation Interfaces – Gesture
Interfaces – Types of Gesture Input Devices – Output Devices – Graphics Display – Human Visual
System – Personal Graphics Displays – Large Volume Displays – Sound Displays – Human Auditory
System.

UNIT II VR MODELING 6
Modeling – Geometric Modeling – Virtual Object Shape – Object Visual Appearance – Kinematics
Modeling – Transformation Matrices – Object Position – Transformation Invariants –Object
Hierarchies – Viewing the 3D World – Physical Modeling – Collision Detection – Surface
Deformation – Force Computation – Force Smoothing and Mapping – Behavior Modeling – Model
Management.

UNIT III VR PROGRAMMING 6

VR Programming – Toolkits and Scene Graphs – World ToolKit – Java 3D – Comparison of World
ToolKit and Java 3D

158
UNIT IV APPLICATIONS 6
Human Factors in VR – Methodology and Terminology – VR Health and Safety Issues – VR and
Society-Medical Applications of VR – Education, Arts and Entertainment – Military VR Applications
– Emerging Applications of VR – VR Applications in Manufacturing – Applications of VR in Robotics
– Information Visualization – VR in Business – VR in Entertainment – VR in Education.

UNIT V AUGMENTED REALITY 5

Introduction to Augmented Reality-Computer vision for AR-Interaction-Modelling and Annotation-
Navigation-Wearable devices
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Study of tools like Unity, Maya, 3DS MAX, AR toolkit, Vuforia and Blender.
2. Use the primitive objects and apply various projection types by handling camera.
3. Download objects from asset store and apply various lighting and shading effects.
4. Model three dimensional objects using various modelling techniques and apply textures over
them.
5. Create three dimensional realistic scenes and develop simple virtual reality enabled mobile
applications which have limited interactivity.
6. Add audio and text special effects to the developed application.
7. Develop VR enabled applications using motion trackers and sensors incorporating full haptic
interactivity.
8. Develop AR enabled applications with interactivity like E learning environment, Virtual
walkthroughs and visualization of historic places.
9. Develop AR enabled simple applications like human anatomy visualization, DNA/RNA
structure visualization and surgery simulation.
10. Develop simple MR enabled gaming applications.

COURSE OUTCOMES:
On completion of the course, the students will be able to:
CO1: Understand the basic concepts of AR and VR
CO2:Understand the tools and technologies related to AR/VR
CO3:Know the working principle of AR/VR related Sensor devices
CO4:Design of various models using modeling techniques
CO5:Develop AR/VR applications in different domains
TOTAL:60 PERIODS
TEXTBOOKS:
1. Charles Palmer, John Williamson, “Virtual Reality Blueprints: Create compelling VR
experiences for mobile”, Packt Publisher, 2018
2. Dieter Schmalstieg, Tobias Hollerer, “Augmented Reality: Principles & Practice”, Addison
Wesley, 2016
3. John Vince, “Introduction to Virtual Reality”, Springer-Verlag, 2004.
4. William R. Sherman, Alan B. Craig: Understanding Virtual Reality – Interface, Application,
Design”, Morgan Kaufmann, 2003

159
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 2 - 3 - - - 2 2 1 2 2 1 2
2 3 2 2 1 3 - - - 3 2 2 3 3 1 2
3 3 3 2 2 3 - - - 3 2 1 2 3 2 2
4 3 3 3 2 3 - - - 3 2 2 3 3 2 2
5 3 3 3 3 3 - - - 3 3 3 3 3 3 3
AVg. 3.00 2.60 2.40 2.00 3.00 - - - 2.80 2.20 1.80 2.60 2.80 1.80 2.20
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS352 MULTIMEDIA AND ANIMATION LTPC

2 023
COURSE OBJECTIVES:
 To grasp the fundamental knowledge of Multimedia elements and systems
 To get familiar with Multimedia file formats and standards
 To learn the process of Authoring multimedia presentations
 To learn the techniques of animation in 2D and 3D and for the mobile UI
 To explore different popular applications of multimedia

UNIT I INTRODUCTION TO MULTIMEDIA 6

Definitions, Elements, Multimedia Hardware and Software, Distributed multimedia systems,
challenges: security, sharing / distribution, storage, retrieval, processing, computing. Multimedia
metadata, Multimedia databases, Hypermedia, Multimedia Learning.

UNIT II MULTIMEDIA FILE FORMATS AND STANDARDS 6

File formats – Text, Image file formats, Graphic and animation file formats, Digital audio and Video
file formats, Color in image and video, Color Models. Multimedia data and file formats for the web.

UNIT III MULTIMEDIA AUTHORING 6

Authoring metaphors, Tools Features and Types: Card and Page Based Tools, Icon and Object
Based Tools, Time Based Tools, Cross Platform Authoring Tools, Editing Tools,
Painting and Drawing Tools, 3D Modeling and Animation Tools, Image Editing Tools,
audio Editing Tools, Digital Movie Tools, Creating interactive presentations, virtual learning,
simulations.

UNIT IV ANIMATION 6
Principles of animation: staging, squash and stretch, timing, onion skinning, secondary action, 2D,
2 ½ D, and 3D animation, Animation techniques: Keyframe, Morphing, Inverse Kinematics, Hand
Drawn, Character rigging, vector animation, stop motion, motion graphics, , Fluid Simulation,
skeletal animation, skinning Virtual Reality, Augmented Reality.

UNIT V MULTIMEDIA APPLICATIONS 6

Multimedia Big data computing, social networks, smart phones, surveillance, Analytics, Multimedia
Cloud Computing, Multimedia streaming cloud, media on demand, security and forensics, Online
social networking, multimedia ontology, Content based retrieval from digital libraries.
TOTAL : 30 PERIODS
160
LIST OF EXPERIMENTS:
Working with Image Editing tools:
Install tools like GIMP/ InkScape / Krita / Pencil and perform editing operations:
Ø Use different selection and transform tools to modify or improve an image
Ø Create logos and banners for home pages of websites.
Working with Audio Editing tools:
Ø Install tools like, Audacity / Ardour for audio editing, sound mixing and special effects like fade-in
or fade-out etc.,
Ø Perform audio compression by choosing a proper codec.
Working with Video Editing and conversion tools:
Install tools like OpenShot / Cinelerra / HandBrake for editing video content.
Ø Edit and mix video content, remove noise, create special effects, add captions.
Ø Compress and convert video file format to other popular formats.
Working with web/mobile authoring tools:
Adapt / KompoZer/ BlueGriffon / BlueFish / Aptana Studio/ NetBeans / WordPress /Expression Web:
Ø Design simple Home page with banners, logos, tables quick links etc
Ø Provide a search interface and simple navigation from the home page to the inside pages of the
website.
Ø Design Responsive web pages for use on both web and mobile interfaces.
Working with Animation tools:
Install tools like, Krita, Wick Editor, Blender:
Ø Perform a simple 2D animation with sprites
Ø Perform simple 3D animation with keyframes, kinematics
 Working with Mobile UI animation tools: Origami studio / Lottie / Framer etc.,
Working with E-Learning authoring tools:
Install tools like EdApp / Moovly / CourseLab/ IsEazy and CamStudio/Ampache, VideoLAN:
Ø Demonstrate screen recording and further editing for e-learning content.
Ø Create a simple E-Learning module for a topic of your choice.
Creating VR and AR applications:
Ø Any affordable VR viewer like Google Cardboard and any development platform like Openspace
3D / ARCore etc.

Note: all tools listed are open source. Usage of any proprietary tools in place of open source tools
is not restricted.

30 PERIODS

161
 TOTAL: 60 PERIODS
WEB REFERENCES:
1. https://itsfoss.com/
2. https://www.ucl.ac.uk/slade/know/3396
3. https://handbrake.fr/
4. https://opensource.com/article/18/2/open-source-audio-visual-production-tools
https://camstudio.org/
5. https://developer.android.com/training/animation/overview
6. https://developer.android.com/training/animation/overview (UNIT-IV)

COURSE OUTCOMES:
 Get the bigger picture of the context of Multimedia and its applications
 Use the different types of media elements of different formats on content pages
 Author 2D and 3D creative and interactive presentations for different target multimedia
applications.
 Use different standard animation techniques for 2D, 21/2 D, 3D applications
 Understand the complexity of multimedia applications in the context of cloud, security,
bigdata streaming, social networking, CBIR etc.,

TEXT BOOKS:
1. Ze-Nian Li, Mark S. Drew, Jiangchuan Liu, Fundamentals of Multimedia”, Third Edition,
Springer Texts in Computer Science, 2021. (UNIT-I, II, III)

REFERENCES:
1. John M Blain, The Complete Guide to Blender Graphics: Computer Modeling & Animation,
CRC press, 3rd Edition, 2016.
2. Gerald Friedland, Ramesh Jain, “Multimedia Computing”, Cambridge University Press,
2018.
3. Prabhat K.Andleigh, Kiran Thakrar, “Multimedia System Design”, Pearson
Education, 1st Edition, 2015.
4. Mohsen Amini Salehi, Xiangbo Li, “Multimedia Cloud Computing Systems”, Springer Nature,
1st Edition, 2021.
5. Mark Gaimbruno, “3D Graphics and Animation”, Second Edition, New Riders, 2002.
6. Rogers David, “Animation: Master – A Complete Guide (Graphics Series)”, Charles River
Media, 2006.
7. Rick parent, “Computer Animation: Algorithms and Techniques”, Morgan Kauffman, 3rd
Edition, 2012.
8. Emilio Rodriguez Martinez, Mireia Alegre Ruiz, “UI Animations with Lottie and After Effects:
Create, render, and ship stunning After Effects animations natively on mobile with React
Native”, Packt Publishing, 2022.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s

1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 3 2 3 - - - 3 2 1 2 3 2 3
2 3 3 3 3 3 - - - 3 3 2 2 3 2 3
3 3 3 3 3 3 - - - 3 3 2 3 3 2 3

162
 4 3 3 3 3 3 2 - - 3 3 3 3 3 3 3
5 3 3 3 3 3 2 - - 3 3 3 3 3 3 3
AVg. 3.00 2.80 3.00 2.80 3.00 2.00 - - 3.00 2.80 2.20 2.60 3.00 2.40 3.00
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS371 VIDEO CREATION AND EDITING L T P C

2 0 2 3
COURSE OBJECTIVES:
● To introduce the broad perspective of linear and nonlinear editing concepts.
● To understand the concept of Storytelling styles.
● To be familiar with audio and video recording. To apply different media tools.
● To learn and understand the concepts of AVID XPRESS DV 4.

UNIT I FUNDAMENTALS 6
Evolution of filmmaking - linear editing - non-linear digital video - Economy of Expression - risks
associated with altering reality through editing.

UNIT II STORYTELLING 6
Storytelling styles in a digital world through jump cuts, L-cuts, match cuts, cutaways, dissolves, split
edits - Consumer and pro NLE systems - digitizing images - managing resolutions - mechanics of
digital editing - pointer files - media management.

UNIT III USING AUDIO AND VIDEO 6

Capturing digital and analog video importing audio putting video on exporting digital video to tape
recording to CDs and VCDs.

UNIT IV WORKING WITH FINAL CUT PRO 6

Working with clips and the Viewer - working with sequences, the Timeline, and the canvas - Basic
Editing - Adding and Editing Testing Effects - Advanced Editing and Training Techniques - Working
with Audio - Using Media Tools - Viewing and Setting Preferences.

UNIT V WORKING WITH AVID XPRESS DV 4 6

Starting Projects and Working with Project Window - Using Basic Tools and Logging - Preparing to
Record and Recording - Importing Files - Organizing with Bins - Viewing and Making Footage -
Using Timeline and Working in Trim Mode - Working with Audio - Output Options.
30 PERIODS
LIST OF EXPERIMENTS 30 PERIODS
1. Write a Movie Synopsis (Individual/Team Writing)
2. Present team stories in class.
3. Script/Storyboard Writing(Individual Assignment)
4. Pre-Production: Personnel, budgeting, scheduling, location scouting, casting, contracts &
agreements
5. Production: Single camera production personnel & equipment, Documentary Production
6. Writing The Final Proposal: Overview, Media Treatments, Summary, Pitching
163
 7. Write Documentary & Animation Treatment
8. Post-production: Editing, Sound design, Finishing
TOTAL: 60 PERIODS
COURSE OUTCOMES:
On completion of the course, the students will be able to:
CO1:Compare the strengths and limitations of Nonlinear editing.
CO2:Identify the infrastructure and significance of storytelling.
CO3:Apply suitable methods for recording to CDs and VCDs.
CO4:Address the core issues of advanced editing and training techniques.
CO5:Design and develop projects using AVID XPRESS DV 4

TEXT BOOKS
1. Avid Xpress DV 4 User Guide, 2007.
2. Final Cut Pro 6 User Manual, 2004.
3. Keith Underdahl, “Digital Video for Dummies”, Third Edition, Dummy Series, 2001.
4. Robert M. Goodman and Partick McGarth, “Editing Digital Video: The Complete Creative
and Technical Guide”, Digital Video and Audio, McGraw – Hill 2003.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 2 1 1 - - - 1 2 3 2 3 1 1
2 2 3 3 3 1 - - - 1 2 2 1 1 1 1
3 2 2 3 3 1 - - - 3 1 1 1 2 1 2
4 2 2 2 2 1 - - - 3 1 1 1 2 2 2
5 2 1 3 3 1 - - - 3 2 1 2 2 2 1
AVg. 2.2 1.8 2.6 2.4 1 - - - 2.2 1.6 1.6 1.4 2 1.4 1.4
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCW332 DIGITAL MARKETING L T P C

2 0 2 3
COURSE OBJECTIVES:
 The primary objective of this module is to examine and explore the role and importance of
digital marketing in today’s rapidly changing business environment.
 It also focuses on how digital marketing can be utilized by organizations and how
its effectiveness can be measured.

UNIT I INTRODUCTION TO ONLINE MARKET 6

Online Market space- Digital Marketing Strategy- Components - Opportunities for building Brand
Website - Planning and Creation - Content Marketing.

UNIT II SEARCH ENGINE OPTIMISATION 6

Search Engine optimisation - Keyword Strategy- SEO Strategy - SEO success factors -On-Page
Techniques - Off-Page Techniques. Search Engine Marketing- How Search Engine works- SEM
components- PPC advertising -Display Advertisement

164
UNIT III E- MAIL MARKETING 6
E- Mail Marketing - Types of E- Mail Marketing - Email Automation - Lead Generation - Integrating
Email with Social Media and Mobile- Measuring and maximizing email campaign effectiveness.
Mobile Marketing- Mobile Inventory/channels- Location based; Context based; Coupons and offers,
Mobile Apps, Mobile Commerce, SMS Campaigns-Profiling and targeting

UNIT IV SOCIAL MEDIA MARKETING 6

Social Media Marketing - Social Media Channels- Leveraging Social media for brand conversations
and buzz. Successful /benchmark Social media campaigns. Engagement Marketing- Building
Customer relationships - Creating Loyalty drivers - Influencer Marketing.

UNIT V DIGITAL TRANSFORMATION 6

Digital Transformation & Channel Attribution- Analytics- Ad-words, Email, Mobile, Social Media, Web
Analytics - Changing your strategy based on analysis- Recent trends in Digital marketing.
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Subscribe to a weekly/quarterly newsletter and analyze how its content and structure aid
with the branding of the company and how it aids its potential customer segments.
2. Perform keyword search for a skincare hospital website based on search volume and
competition using Google keyword planner tool.
3. Demonstrate how to use the Google WebMasters Indexing API
4. Discuss an interesting case study regarding how an insurance company manages leads.
5. Discuss negative and positive impacts and ethical implications of using social media for
political advertising.
6. Discuss how Predictive analytics is impacting marketing automation

COURSE OUTCOMES:
CO1: To examine and explore the role and importance of digital marketing in today’s
rapidly changing business environment..
CO2: To focuses on how digital marketing can be utilized by organizations and how its
effectiveness can be measured.
CO3: To know the key elements of a digital marketing strategy.
CO4: To study how the effectiveness of a digital marketing campaign can be measured
CO5: To demonstrate advanced practical skills in common digital marketing tools such as SEO,
SEM, Social media and Blogs.
TOTAL:60 PERIODS
TEXT BOOKS
1. Fundamentals of Digital Marketing by Puneet Singh Bhatia;Publisher: Pearson Education;
2. First edition ( July 2017);ISBN-10: 933258737X;ISBN-13: 978-9332587373.
3. Digital Marketing by Vandana Ahuja ;Publisher: Oxford University Press ( April 2015). ISBN-
10: 0199455449
4. Marketing 4.0: Moving from Traditional to Digital by Philip Kotler;Publisher: Wiley; 1st edition
( April 2017); ISBN10: 9788126566938;ISBN 13: 9788126566938;ASIN: 8126566930.
5. Ryan, D. (2014 ). Understanding Digital Marketing: Marketing Strategies for Engaging the
Digital Generation, Kogan Page Limited..
6. Barker, Barker, Bormann and Neher(2017), Social Media Marketing: A Strategic Approach,
2E South-Western ,Cengage Learning.
7. Pulizzi,J Beginner's Guide to Digital Marketing , Mcgraw Hill Education
165
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 2 1 3 - - - 1 2 3 3 3 3 3
2 2 2 2 1 3 - - - 1 2 3 3 3 3 3
3 1 1 1 2 2 - - - 1 2 1 1 3 2 1
4 3 2 2 3 1 - - - 1 3 2 3 2 3 2
5 2 3 1 3 3 - - - 2 3 1 2 1 2 1
AVg. 2.2 2.2 1.6 2 2.4 - - - 1.2 2.4 2 2.4 2.4 2.6 2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS373 VISUAL EFFECTS L T P C

2 0 2 3
COURSE OBJECTIVES
● To get a basic idea on animation principles and techniques
● To get exposure to CGI, color and light elements of VFX
● To have a better understanding of basic special effects techniques
● To have a knowledge of state of the art vfx techniques
● To become familiar with popular compositing techniques

UNIT I ANIMATION BASICS 6

VFX production pipeline, Principles of animation, Techniques: Keyframe, kinematics, Full animation,
limited animation, Rotoscoping, stop motion, object animation, pixilation, rigging, shape keys, motion
paths.

UNIT II CGI, COLOR, LIGHT 6

CGI – virtual worlds, Photorealism, physical realism, function realism, 3D Modeling and Rendering:
color - Color spaces, color depth, Color grading, color effects, HDRI, Light – Area and mesh lights,
image based lights, PBR lights, photometric light, BRDF shading model

UNIT III SPECIAL EFFECTS 6

Special Effects – props, scaled models, animatronics, pyrotechniques, Schüfftan process, Particle
effects – wind, rain, fog, fire

UNIT IV VISUAL EFFECTS TECHNIQUES 6

Motion Capture, Matt Painting, Rigging, Front Projection.Rotoscoping, Match Moving – Tracking,
camera reconstruction, planar tracking, Calibration, Point Cloud Projection, Ground plane
determination, 3D Match Moving

UNIT V COMPOSITING 6
Compositing – chroma key, blue screen/green screen, background projection, alpha compositing,
deep image compositing, multiple exposure, matting, VFX tools - Blender, Natron, GIMP.
30 PERIODS

166
Laboratory Experiments:
Using Natron:
o Understanding Natron Environment:
o Working with color and using color grading
o using Channels
o Merging images
o Using Rotopaint
o performing Tracking and stabilizing
o Transforming elements
o Stereoscopic compositing
Using Blender:
Ø Motion Tracking – camera and object tracking
Ø Camera fx, color grading, vignettes
Ø Compositing images and video files
Ø Multilayer rendering
30 PERIODS
TOTAL: 60 PERIODS
COURSE OUTCOMES
At the end of the course, the student will be able to:
CO1:To implement animation in 2D / 3D following the principles and techniques
CO2:To use CGI, color and light elements in VFX applications
CO3:To create special effects using any of the state of the art tools
CO4:To apply popular visual effects techniques using advanced tools
CO5:To use compositing tools for creating VFX for a variety of applications

TEXT BOOKS:
1. Chris Roda, Real Time Visual Effects for the Technical Artist, CRC Press, 1st Edition, 2022.
2. Steve Wright, Digital Compositing for film and video, Routledge, 4th Edition, 2017.
3. John Gress, Digital Visual Effects and Compositing, New Riders Press, 1st Edition, 2014.
REFERENCES:
1. Jon Gress, “Digital Visual Effects and Compositing”, New Riders Press, 1st Edition, 2014.
2. Robin Brinkman, The Art and Science of Digital Compositing: Techniques for Visual Effects,
Animation and Motion Graphics”, Morgan Kauffman, 2008.
3. Luiz Velho, Bruno Madeira, “Introduction to Visual Effects A Computational Approach”,
Routledge, 2023.
4. Jasmine Katatikarn, Michael Tanzillo, “Lighting for Animation: The art of visual storytelling
, Routledge, 1st Edition, 2016.
5. Eran Dinur, “The Complete guide to Photorealism, for Visual Effects, Visualization
6. Jeffrey A. Okun, Susan Zwerman, Christopher McKittrick, “ The VES Handbook of Visual
Effects: Industry Standard VFX Practices and Procedures”, Third Edition, 2020.and
Games”, Routledge, 1st Edition, 2022.
7. https://www.blender.org/features/vfx/
8. https://natrongithub.github.io/

167
 CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 3 3 1 - - - 1 2 1 1 3 3 2
2 1 3 3 2 1 - - - 3 2 2 2 1 1 1
3 2 3 3 2 1 - - - 1 2 1 2 2 2 2
4 3 3 2 2 3 - - - 3 3 2 2 2 3 1
5 1 2 1 1 2 - - - 1 3 2 3 2 3 1
AVg. 2 2.8 2.4 2 1.6 - - - 1.8 2.4 1.6 2 2 2.4 1.4
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS347 GAME DEVELOPMENT L T P C

2 0 2 3
COURSE OBJECTIVES:
 To know the basics of 2D and 3D graphics for game development.
 To know the stages of game development.
 To understand the basics of a game engine.
 To survey the gaming development environment and tool kits.
 To learn and develop simple games using Pygame environment

UNIT I 3D GRAPHICS FOR GAME DESIGN 6

Genres of Games, Basics of 2D and 3D Graphics for Game Avatar, Game Components – 2D and
3D Transformations – Projections – Color Models – Illumination and Shader Models – Animation –
Controller Based Animation.

UNIT II GAME DESIGN PRINCIPLES 6

Character Development, Storyboard Development for Gaming – Script Design – Script Narration,
Game Balancing, Core Mechanics, Principles of Level Design – Proposals – Writing for
Preproduction, Production and Post – Production.

UNIT III GAME ENGINE DESIGN 6

Rendering Concept – Software Rendering – Hardware Rendering – Spatial Sorting Algorithms –
Algorithms for Game Engine– Collision Detection – Game Logic – Game AI – Pathfinding.

UNIT IV OVERVIEW OF GAMING PLATFORMS AND FRAMEWORKS 6

Pygame Game development – Unity – Unity Scripts –Mobile Gaming, Game Studio, Unity
Single player and Multi-Player games.

UNIT V GAME DEVELOPMENT USING PYGAME 6

Developing 2D and 3D interactive games using Pygame – Avatar Creation – 2D and 3D Graphics
Programming – Incorporating music and sound – Asset Creations – Game Physics algorithms
Development – Device Handling in Pygame – Overview of Isometric and Tile Based arcade Games
– Puzzle Games.
30 PERIODS

168
COURSE OUTCOMES:
CO1:Explain the concepts of 2D and 3d Graphics
CO2:Design game design documents.
CO3:Implementation of gaming engines.
CO4:Survey gaming environments and frameworks.
CO5:Implement a simple game in Pygame.
EXPERIMENTS: 30 PERIODS
1. Installation of a game engine, e.g., Unity, Unreal Engine, familiarization of the GUI.
Conceptualize the theme for a 2D game.
2. Character design, sprites, movement and character control
3. Level design: design of the world in the form of tiles along with interactive and collectible
objects.
4. Design of interaction between the player and the world, optionally using the physics engine.
5. Developing a 2D interactive using Pygame
6. Developing a Puzzle game
7. Design of menus and user interaction in mobile platforms.
8. Developing a 3D Game using Unreal
9. Developing a Multiplayer game using unity
TOTAL: 60 PERIODS
REFERENCES
1. Sanjay Madhav, “Game Programming Algorithms and Techniques: A Platform Agnostic
Approach”, Addison Wesley,2013.
2. Will McGugan, “Beginning Game Development with Python and Pygame: From Novice to
Professional”, Apress,2007.
3. Paul Craven, “Python Arcade games”, Apress Publishers,2016.
4. David H. Eberly, “3D Game Engine Design: A Practical Approach to Real-Time Computer
Graphics”, Second Edition, CRC Press,2006.
5. Jung Hyun Han, “3D Graphics for Game Programming”, Chapman and Hall/CRC, 2011.
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 2 1 2 - - - - - - - 2 2 2
2 1 2 2 1 2 - - - - - - - 2 2 1
3 1 1 1 2 1 - - - - - - - 2 2 2
4 3 3 1 3 3 - - - - - - - 2 2 3
5 3 3 2 1 3 - - - - - - - 2 2 3
AVg. 2.2 2.2 1.6 1.6 2.2 - - - - - - - 2 2 2.2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS353 MULTIMEDIA DATA COMPRESSION AND STORAGE L T P C

2 0 2 3
COURSE OBJECTIVES:
 To understand the basics of compression techniques
 To understand the categories of compression for text, image and video
 To explore the modalities of text, image and video compression algorithms
 To know about basics of consistency of data availability in storage devices
 To understand the concepts of data streaming services
169
UNIT I BASICS OF DATA COMPRESSION 6
Introduction ––Lossless and LossyCompression– Basics of Huffmann coding- Arithmetic coding-
Dictionary techniques- Context based compression – Applications

UNIT II IMAGE COMPRESSION 6

Lossless Image compression – JPEG-CALIC-JPEG LS-Prediction using conditional averages –
Progressive Image Transmission – Lossless Image compression formats – Applications - Facsimile
encoding

UNIT III VIDEO COMPRESSION 6

Introduction – Motion Compensation – Video Signal Representation – H.261 – MPEG-1- MPEG-2-
H.263.

UNIT IV DATA PLACEMENT ON DISKS 6

Statistical placement on Disks – Striping on Disks – Replication Placement on Disks – Constraint
allocation on Disks – Tertiary storage Devices – Continuous Placement on Hierarchical storage
system – Statistical placement on Hierarchical storage systems – Constraint allocation on
Hierarchical storage system

UNIT V DISK SCHEDULING METHODS 6

Scheduling methods for disk requests – Feasibility conditions of concurrent streams– Scheduling
methods for request streams
30 PERIODS

LIST OF EXPERIMENTS

1. Construct Huffman codes for given symbol probabilities.

2. Encode run lengths with fixed-length code.
3. Lempel-Ziv algorithm for adaptive variable-length encoding
4. Compress the given word using arithmetic coding based on the frequency of the letters.
5. Write a shell script, which converts all images in the current directory in JPEG.
6. Write a program to split images from a video without using any primitives.
7. Create a photo album of a trip by applying appropriate image dimensions and format.
8. Write the code for identifying the popularity of content retrieval from media server.
9. Write the code for ensuring data availability in disks using strip based method.
10. Program for scheduling requests for data streams.

30 PERIODS
TOTAL : 60 PERIODS

COURSE OUTCOMES:
CO1: Understand the basics of text, Image and Video compression
CO2: Understand the various compression algorithms for multimedia content
CO3: Explore the applications of various compression techniques
CO4: Explore knowledge on multimedia storage on disks
CO5: Understand scheduling methods for request streams

170
TEXT BOOKS
1. Khalid Sayood, Introduction to Data Compression, Morgan Kaufmann Series in Multimedia
Information and Systems, 2018, 5th Edition.
2. Philip K.C.Tse, Multimedia Information Storage and Retrieval: Techniques and
Technologies, 2008
REFERENCES
1. David Salomon, A concise introduction to data compression, 2008.
2. Lenald Best, Best’s Guide to Live Stream Video Broadcasting, BCB Live Teaching series,
2017.
3. Yun-Qing Shi, Image And Video Compression For Multimedia Engineering Fundamentals
Algorithms And Standards, Taylor& Francis,2019
4. Irina Bocharova, Compression for Multimedia, Cambridge University Press; 1st edition,
2009

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 2 1 1 - - - - - - - 2 2 2
2 3 2 2 1 2 - - - - - - - 2 2 2
3 3 2 2 1 2 - - - - - - - 2 2 2
4 3 2 2 1 1 - - - - - - - 2 2 2
5 3 2 2 1 1 - - - - - - - 2 2 2
AVg. 3 2 2 1 1.4 - - - - - - - 2 2 2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS361 ROBOTIC PROCESS AUTOMATION LT P C

2 0 2 3
COURSE OBJECTIVES:
 To understand the basic concepts of Robotic Process Automation.
 To expose to the key RPA design and development strategies and methodologies.
 To learn the fundamental RPA logic and structure.
 To explore the Exception Handling, Debugging and Logging operations in RPA.
 To learn to deploy and Maintain the software bot.

UNIT I INTRODUCTION TO ROBOTIC PROCESS AUTOMATION 6

Emergence of Robotic Process Automation (RPA), Evolution of RPA, Differentiating RPA from
Automation - Benefits of RPA - Application areas of RPA, Components of RPA, RPA Platforms.
Robotic Process Automation Tools - Templates, User Interface, Domains in Activities, Workflow
Files.

UNIT II AUTOMATION PROCESS ACTIVITIES 6

Sequence, Flowchart & Control Flow: Sequencing the Workflow, Activities, Flowchart, Control Flow
for Decision making. Data Manipulation: Variables, Collection, Arguments, Data Table, Clipboard
management, File operations Controls: Finding the control, waiting for a control, Act on a control,
UiExplorer, Handling Events

171
UNIT III APP INTEGRATION, RECORDING AND SCRAPING 6
App Integration, Recording, Scraping, Selector, Workflow Activities. Recording mouse and keyboard
actions to perform operation, Scraping data from website and writing to CSV. Process Mining.

UNIT IV EXCEPTION HANDLING AND CODE MANAGEMENT 6

Exception handling, Common exceptions, Logging- Debugging techniques, Collecting crash dumps,
Error reporting. Code management and maintenance: Project organization, Nesting workflows,
Reusability, Templates, Commenting techniques, State Machine.

UNIT V DEPLOYMENT AND MAINTENANCE 6

Publishing using publish utility, Orchestration Server, Control bots, Orchestration Server to deploy
bots, License management, Publishing and managing updates. RPA Vendors - Open Source
RPA, Future of RPA
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
Setup and Configure a RPA tool and understand the user interface of the tool:
1. Create a Sequence to obtain user inputs display them using a message box;
2. Create a Flowchart to navigate to a desired page based on a condition;
3. Create a State Machine workflow to compare user input with a random number.
4. Build a process in the RPA platform using UI Automation Activities.
5. Create an automation process using key System Activities, Variables and Arguments
6. Also implement Automation using System Trigger
7. Automate login to (web)Email account
8. Recording mouse and keyboard actions.
9. Scraping data from website and writing to CSV
10. Implement Error Handling in RPA platform
11. Web Scraping
12. Email Query Processing
TOTAL:60 PERIODS
COURSE OUTCOMES:
By the end of this course, the students will be able to:
 Enunciate the key distinctions between RPA and existing automation techniques and
platforms.
 Use UiPath to design control flows and work flows for the target process
 Implement recording, web scraping andprocess mining by automation
 Use UIPath Studio to detect, and handle exceptions in automation processes
 Implement and use Orchestrator for creation, monitoring, scheduling, and controlling of
automated bots and processes.

TEXT BOOKS:
1. Learning Robotic Process Automation: Create Software robots and automate business
processes with the leading RPA tool - UiPath by Alok Mani Tripathi, Packt Publishing, 2018.
2. Tom Taulli , “The Robotic Process Automation Handbook: A Guide to Implementing RPA
Systems”, Apress publications, 2020.

172
REFERENCES:
1. Frank Casale (Author), Rebecca Dilla (Author), Heidi Jaynes (Author), Lauren Livingston
(Author), Introduction to Robotic Process Automation: a Primer, Institute of Robotic Process
Automation, Amazon Asia-Pacific Holdings Private Limited, 2018
2. Richard Murdoch, Robotic Process Automation: Guide To Building Software Robots,
Automate Repetitive Tasks & Become An RPA Consultant, Amazon Asia-Pacific Holdings
Private Limited, 2018
3. A Gerardus Blokdyk, “Robotic Process Automation Rpa A Complete Guide “, 2020

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 2 1 3 - - - 1 3 3 2 2 2 1
2 1 1 2 3 3 - - - 1 2 3 1 3 2 1
3 2 3 2 3 3 - - - 2 3 1 1 3 3 3
4 1 2 1 2 2 - - - 1 2 1 3 3 3 2
5 3 3 3 3 3 - - - 3 1 1 1 3 2 1
AVg. 2 2.2 2 2.4 2.8 - - - 1.6 2.2 1.8 1.6 2.8 2.4 1.6
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS340 CYBER SECURITY L T P C

2 0 2 3
COURSE OBJECTIVES:
 To learn cybercrime and cyberlaw.
 To understand the cyber attacks and tools for mitigating them.
 To understand information gathering.
 To learn how to detect a cyber attack.
 To learn how to prevent a cyber attack.

UNIT I INTRODUCTION 6
Cyber Security – History of Internet – Impact of Internet – CIA Triad; Reason for Cyber Crime –
Need for Cyber Security – History of Cyber Crime; Cybercriminals – Classification of Cybercrimes –
A Global Perspective on Cyber Crimes; Cyber Laws – The Indian IT Act – Cybercrime and
Punishment.

UNIT II ATTACKS AND COUNTERMEASURES 6

OSWAP; Malicious Attack Threats and Vulnerabilities: Scope of Cyber-Attacks – Security Breach –
Types of Malicious Attacks – Malicious Software – Common Attack Vectors – Social engineering
Attack – Wireless Network Attack – Web Application Attack – Attack Tools – Countermeasures.

UNIT III RECONNAISSANCE 5

Harvester – Whois – Netcraft – Host – Extracting Information from DNS – Extracting Information
from E-mail Servers – Social Engineering Reconnaissance; Scanning – Port Scanning – Network
Scanning and Vulnerability Scanning – Scanning Methodology – Ping Sweer Techniques – Nmap
Command Switches – SYN – Stealth – XMAS – NULL – IDLE – FIN Scans – Banner Grabbing and
OS Finger printing Techniques.

173
UNIT IV INTRUSION DETECTION 5
Host -Based Intrusion Detection – Network -Based Intrusion Detection – Distributed or Hybrid
Intrusion Detection – Intrusion Detection Exchange Format – Honeypots – Example System Snort.

UNIT V INTRUSION PREVENTION 5

Firewalls and Intrusion Prevention Systems: Need for Firewalls – Firewall Characteristics and
Access Policy – Types of Firewalls – Firewall Basing – Firewall Location and Configurations –
Intrusion Prevention Systems – Example Unified Threat Management Products.
30 PERIODS

PRACTICAL EXERCISES: 30 PERIODS

1. Install Kali Linux on Virtual box
2. Explore Kali Linux and bash scripting
3. Perform open source intelligence gathering using Netcraft, Whois Lookups, DNS
Reconnaissance, Harvester and Maltego
4. Understand the nmap command d and scan a target using nmap
5. Install metasploitable2 on the virtual box and search for unpatched vulnerabilities
6. Use Metasploit to exploit an unpatched vulnerability
7. Install Linus server on the virtual box and install ssh
8. Use Fail2banto scan log files and ban Ips that show the malicious signs
9. Launch brute-force attacks on the Linux server using Hydra.
10. Perform real-time network traffic analysis and data pocket logging using Snort
COURSE OUTCOMES:
On successful completion of this course, the student will be able to
CO1: Explain the basics of cyber security, cyber crime and cyber law (K2)
CO2: Classify various types of attacks and learn the tools to launch the attacks (K2)
CO3 Apply various tools to perform information gathering (K3)
CO4: Apply intrusion techniques to detect intrusion (K3)
CO5: Apply intrusion prevention techniques to prevent intrusion (K3)
TOTAL:60 PERIODS
TEXTBOOKS
1. Anand Shinde, “Introduction to Cyber Security Guide to the World of Cyber Security”, Notion
Press, 2021 (Unit 1)
2. Nina Godbole, Sunit Belapure, “Cyber Security: Understanding Cyber Crimes, Computer
Forensics and Legal Perspectives”, Wiley Publishers, 2011 (Unit 1)
3. https://owasp.org/www-project-top-ten/
REFERENCES
1. David Kim, Michael G. Solomon, “Fundamentals of Information Systems Security”, Jones &
Bartlett Learning Publishers, 2013 (Unit 2)
2. Patrick Engebretson, “The Basics of Hacking and Penetration Testing: Ethical Hacking and
Penetration Testing Made easy”, Elsevier, 2011 (Unit 3)
3. Kimberly Graves, “CEH Official Certified Ethical hacker Review Guide”, Wiley Publishers,
2007 (Unit 3)
4. William Stallings, Lawrie Brown, “Computer Security Principles and Practice”, Third Edition,
Pearson Education, 2015 (Units 4 and 5)
5. Georgia Weidman, “Penetration Testing: A Hands-On Introduction to Hacking”, No Starch
Press, 2014 (Lab)

174
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 1 1 1 1 - 1 - - - - 1 - 2 2 2
2 1 3 1 3 2 1 - - - - - - 2 2 1
3 2 1 1 1 - 1 - - - - 1 - 2 2 2
4 3 3 2 2 2 1 - - - - - - 2 2 3
5 3 2 1 1 1 1 - 1 - - 1 - 2 2 2
AVg. 2 2 1.2 1.6 1 1 0 0.2 0 0 0.6 0 2 2 2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS359 QUANTUM COMPUTING L T P C

2 0 2 3
COURSE OBJECTIVES:
 To know the background of classical computing and quantum computing.
 To learn the fundamental concepts behind quantum computation.
 To study the details of quantum mechanics and its relation to Computer Science.
 To gain knowledge about the basic hardware and mathematical models of quantum
computation.
 To learn the basics of quantum information and the theory behind it.

UNIT I QUANTUM COMPUTING BASIC CONCEPTS 6

Complex Numbers - Linear Algebra - Matrices and Operators - Global Perspectives Postulates of
Quantum Mechanics – Quantum Bits - Representations of Qubits - Superpositions

UNIT II QUANTUM GATES AND CIRCUITS 5

Universal logic gates - Basic single qubit gates - Multiple qubit gates - Circuit development -
Quantum error correction

UNIT III QUANTUM ALGORITHMS 7

Quantum parallelism - Deutsch’s algorithm - The Deutsch–Jozsa algorithm - Quantum Fourier
transform and its applications - Quantum Search Algorithms: Grover’s Algorithm

UNIT IV QUANTUM INFORMATION THEORY 6

Data compression - Shannon’s noiseless channel coding theorem - Schumacher’s quantum
noiseless channel coding theorem - Classical information over noisy quantum channels

UNIT V QUANTUM CRYPTOGRAPHY 6

Classical cryptography basic concepts - Private key cryptography - Shor’s Factoring Algorithm -
Quantum Key Distribution - BB84 - Ekart 91
30 PERIODS
PRACTICAL EXERCISES 30 PERIODS
1. Single qubit gate simulation - Quantum Composer
2. Multiple qubit gate simulation - Quantum Composer
3. Composing simple quantum circuits with q-gates and measuring the output into classical
bits.
4. IBM Qiskit Platform Introduction
175
5. Implementation of Shor’s Algorithms
6. Implementation of Grover’s Algorithm
7. Implementation of Deutsch’s Algorithm
8. Implementation of Deutsch-Jozsa’s Algorithm
9. Integer factorization using Shor’s Algorithm
10. QKD Simulation
11. Mini Project such as implementing an API for efficient search using Grover’s Algorithms or

COURSE OUTCOMES:
On completion of the course, the students will be able to:
CO1: Understand the basics of quantum computing.
CO2: Understand the background of Quantum Mechanics.
CO3: Analyze the computation models.
CO4: Model the circuits using quantum computation.
environments and frameworks.
CO5: Understand the quantum operations such as noise and error–correction.
TOTAL:60 PERIODS
TEXTBOOKS:
1. Parag K Lala, Mc Graw Hill Education, “Quantum Computing, A Beginners Introduction”,
First edition (1 November 2020).
2. Michael A. Nielsen, Issac L. Chuang, “Quantum Computation and Quantum Information”,
Tenth Edition, Cambridge University Press, 2010.
3. Chris Bernhardt, The MIT Press; Reprint edition (8 September 2020), “Quantum Computing
for Everyone”.

REFERENCES
1. Scott Aaronson, “Quantum Computing Since Democritus”, Cambridge University Press,
2013.
2. N. David Mermin, “Quantum Computer Science: An Introduction”, Cambridge University
Press, 2007.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 2 2 - - - - 2 - - - 2 3 2
2 3 2 2 2 - - - - 2 - - - 2 3 1
3 3 3 3 3 2 - - - 3 - - - 3 2 2
4 3 3 3 3 3 - - - 3 - - - 1 3 2
5 3 3 2 3 - - - - 2 - - - 1 3 3
AVg. 3 2.6 2.4 2.6 1 - - - 2.4 - - - 1.8 2.8 2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

176
CCS331 3D PRINTING AND DESIGN LT P C
2 0 2 3
COURSE OBJECTIVES:
 To discuss on basics of 3D printing
To explain the principles of 3D printing technique
 To explain and illustrate inkjet technology
 To explain and illustrate laser technology
 To discuss the applications of 3D printing

UNIT I INTRODUCTION 6
Introduction; Design considerations – Material, Size, Resolution, Process; Modelling and viewing -
3D; Scanning; Model preparation – Digital; Slicing; Software; File formats

UNIT II PRINCIPLE 6
Processes – Extrusion, Wire, Granular, Lamination, Photopolymerisation; Materials - Paper,
Plastics, Metals, Ceramics, Glass, Wood, Fiber, Sand, Biological Tissues, Hydrogels, Graphene;
Material Selection - Processes, applications, limitations;

UNIT III INKJET TECHNOLOGY 6

Printer - Working Principle, Positioning System, Print head, Print bed, Frames, Motion control; Print
head Considerations – Continuous Inkjet, Thermal Inkjet, Piezoelectric Drop-On-Demand; Material
Formulation for jetting; Liquid based fabrication – Continous jet, Mulitjet; Powder based fabrication
– Colourjet.

UNIT IV LASER TECHNOLOGY 6

Light Sources – Types, Characteristics; Optics – Deflection, Modulation; Material feeding and flow
– Liquid, powder; Printing machines – Types, Working Principle, Build Platform, Print bed
Movement, Support structures;

UNIT V INDUSTRIAL APPLICATIONS 6

Product Models, manufacturing – Printed electronics, Biopolymers, Packaging, Healthcare, Food,
Medical, Biotechnology, Displays; Future trends;
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Study the interface and basic tools in the CAD software.
2. Study 3D printer(s) including print heads, build envelope, materials used and related
support removal system(s).
3. Review of geometry terms of a 3D mesh.
4. Commands for moving from 2D to 3D.
5. Advanced CAD commands to navigate models in 3D space
6. Design any four everyday objects
Refer to web sites like Thingiverse, Shapeways and GitFab to design four everyday objects
that utilize the advantages of 3D printing
. Choose four models from a sharing site like Thingiverse, Shapeways or Gitfab.
a. Improve upon a file and make it your own. Some ideas include:
• Redesign it with a specific user in mind

177
• Redesign it for a slightly different purpose
• Improve the look of the product
7. Use the CAM software to prepare files for 3D printing.
8. Manipulate machine movement and material layering.
9. Repair a 3D mesh using
a) Freeware utilities: Autodesk MeshMixer (http://goo.gl/x5nhYc), MeshLab (http://goo.gl/fgztLl) or
Netfabb Basic or Cloud Service (http://goo.gl/Q1P47a)
b) Freeware tool tutorials: Netfabb Basic or Cloud Service (http://goo.gl/Q1P47a), Netfabb and
MeshLab (http://goo.gl/WPOVec)
c) Professional tools: Magics or Netfabb
Equipment : one 3D printer for every 10-15 students

COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1:Outline and examine the basic concepts of 3D printing technology
CO2:Outline 3D printing workflow`
CO3: Explain and categorise the concepts and working principles of 3D printing using inkjet
technique
CO4: Explain and categorise the working principles of 3D printing using laser technique
CO5: Explain various method for designing and modeling for industrial applications
TOTAL:60 PERIODS
TEXT BOOKS
1. Christopher Barnatt, 3D Printing: The Next Industrial Revolution, CreateSpace Independent
Publishing Platform, 2013.
2. Ian M. Hutchings, Graham D. Martin, Inkjet Technology for Digital Fabrication, John Wiley &
Sons, 2013.

REFERENCES:
1. Chua, C.K., Leong K.F. and Lim C.S., Rapid prototyping: Principles and applications, second
edition, World Scientific Publishers, 2010
2. Ibrahim Zeid, Mastering CAD CAM Tata McGraw-Hill Publishing Co., 2007
3. Joan Horvath, Mastering 3D Printing, APress, 2014

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 1 1 2 2 3 1 - - 2 - 2 2 3 2 1
2 3 2 3 3 3 2 - - 3 - 3 2 3 2 3
3 2 2 2 2 2 2 - - 2 - 2 2 3 2 2
4 2 2 2 2 3 2 - - 2 - 2 2 3 3 2
5 1 3 3 3 3 3 - - 3 - 3 3 3 3 1
AVg. 1.8 2 2.4 2.4 2.8 2 - - 2.4 - 2.4 2.2 3 2.4 1.8
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

178
CCS350 KNOWLEDGE ENGINEERING L T P C
2 0 2 3
COURSE OBJECTIVES:
 To understand the basics of Knowledge Engineering.
 To discuss methodologies and modeling for Agent Design and Development.
 To design and develop ontologies.
 To apply reasoning with ontologies and rules.
 To understand learning and rule learning.

UNIT I REASONING UNDER UNCERTAINTY 6

Introduction – Abductive reasoning – Probabilistic reasoning: Enumerative Probabilities – Subjective
Bayesian view – Belief Functions – Baconian Probability – Fuzzy Probability – Uncertainty methods
- Evidence-based reasoning – Intelligent Agent – Mixed-Initiative Reasoning – Knowledge
Engineering.

UNIT II METHODOLOGY AND MODELING 6

Conventional Design and Development – Development tools and Reusable Ontologies – Agent
Design and Development using Learning Technology – Problem Solving through Analysis and
Synthesis – Inquiry-driven Analysis and Synthesis – Evidence-based Assessment – Believability
Assessment – Drill-Down Analysis, Assumption-based Reasoning, and What-If Scenarios.

UNIT III ONTOLOGIES – DESIGN AND DEVELOPMENT 6

Concepts and Instances – Generalization Hierarchies – Object Features – Defining Features –
Representation – Transitivity – Inheritance – Concepts as Feature Values – Ontology Matching.
Design and Development Methodologies – Steps in Ontology Development – Domain
Understanding and Concept Elicitation – Modelling-based Ontology Specification.

UNIT IV REASONIING WITH ONTOLOGIES AND RULES 6

Production System Architecture – Complex Ontology-based Concepts – Reduction and Synthesis
rules and the Inference Engine – Evidence-based hypothesis analysis – Rule and Ontology
Matching – Partially Learned Knowledge – Reasoning with Partially Learned Knowledge.

UNIT V LEARNING AND RULE LEARNING 6

Machine Learning – Concepts – Generalization and Specialization Rules – Types – Formal definition
of Generalization. Modelling, Learning and Problem Solving – Rule learning and Refinement –
Overview – Rule Generation and Analysis – Hypothesis Learning.
30 PERIODS
PRACTICAL EXERCISES: 30 PERIODS
1. Perform operations with Evidence Based Reasoning.
2. Perform Evidence based Analysis.
3. Perform operations on Probability Based Reasoning.
4. Perform Believability Analysis.
5. Implement Rule Learning and refinement.
6. Perform analysis based on learned patterns.
7. Construction of Ontology for a given domain.

179
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1: Understand the basics of Knowledge Engineering.
CO2: Apply methodologies and modelling for Agent Design and Development.
CO3: Design and develop ontologies.
CO4: Apply reasoning with ontologies and rules.
CO5: Understand learning and rule learning.
TOTAL: 60 PERIODS
TEXT BOOKS:
1. Gheorghe Tecuci, Dorin Marcu, Mihai Boicu, David A. Schum, Knowledge Engineering
Building Cognitive Assistants for Evidence-based Reasoning, Cambridge University Press,
First Edition, 2016. (Unit 1 – Chapter 1 / Unit 2 – Chapter 3,4 / Unit 3 – Chapter 5, 6 / Unit 4
- 7 , Unit 5 – Chapter 8, 9 )
REFERENCES:
1. Ronald J. Brachman, Hector J. Levesque: Knowledge Representation and Reasoning,
Morgan Kaufmann, 2004.
2. Ela Kumar, Knowledge Engineering, I K International Publisher House, 2018.
3. John F. Sowa: Knowledge Representation: Logical, Philosophical, and Computational
Foundations, Brooks/Cole, Thomson Learning, 2000.
4. King , Knowledge Management and Organizational Learning , Springer, 2009.
5. Jay Liebowitz, Knowledge Management Learning from Knowledge Engineering, 1st
Edition,2001.

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 1 1 1 1 - - 1 2 1 2 1 1 1
2 3 2 3 2 2 - - - 2 1 2 1 3 3 1
3 2 2 3 2 2 - - - 3 2 2 2 3 2 3
4 2 2 3 1 1 - - - 2 2 2 2 2 1 1
5 2 2 2 1 1 - - - 2 1 1 1 2 1 1
AVg. 2.4 1.8 2.4 1.4 1.4 0.2 0 0 2 1.6 1.6 1.6 2.2 1.6 1.4
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS364 SOFT COMPUTING L T PC

2 0 2 3
COURSE OBJECTIVES:
 To introduce the ideas of fuzzy sets, fuzzy logic and use of heuristics based on human
experience.
 To provide the mathematical background for carrying out the optimization associated with
neural network learning
 To learn various evolutionary Algorithms.
 To become familiar with neural networks that can learn from available examples and
generalize to form appropriate rules for inference systems.
 To introduce case studies utilizing the above and illustrate the Intelligent behavior of
programs based on soft computing

180
UNIT 1 INTRODUCTION TO SOFT COMPUTING AND FUZZY LOGIC 6
Introduction - Fuzzy Logic - Fuzzy Sets, Fuzzy Membership Functions, Operations on Fuzzy Sets,
Fuzzy Relations, Operations on Fuzzy Relations, Fuzzy Rules and Fuzzy Reasoning, Fuzzy
Inference Systems

UNIT II NEURAL NETWORKS 6

Supervised Learning Neural Networks – Perceptrons - Backpropagation -Multilayer Perceptrons –
Unsupervised Learning Neural Networks – Kohonen Self-Organizing Networks

UNIT III GENETIC ALGORITHMS 6

Chromosome Encoding Schemes -Population initialization and selection methods - Evaluation
function - Genetic operators- Cross over – Mutation - Fitness Function – Maximizing function

UNIT IV NEURO FUZZY MODELING 6

ANFIS architecture – hybrid learning – ANFIS as universal approximator – Coactive Neuro fuzzy
modeling – Framework – Neuron functions for adaptive networks – Neuro fuzzy spectrum - Analysis
of Adaptive Learning Capability

UNIT V APPLICATIONS 6
Modeling a two input sine function - Printed Character Recognition – Fuzzy filtered neural networks
– Plasma Spectrum Analysis – Hand written neural recognition - Soft Computing for Color Recipe
Prediction.
30 PERIODS
COURSE OUTCOMES:
CO1: Understand the fundamentals of fuzzy logic operators and inference mechanisms
CO2: Understand neural network architecture for AI applications such as classification and
clustering
CO3: Learn the functionality of Genetic Algorithms in Optimization problems
CO4: Use hybrid techniques involving Neural networks and Fuzzy logic
CO5: Apply soft computing techniques in real world applications

PRACTICAL EXERCISES 30 PERIODS

1. Implementation of fuzzy control/ inference system
2. Programming exercise on classification with a discrete perceptron
3. Implementation of XOR with backpropagation algorithm
4. Implementation of self organizing maps for a specific application
5. Programming exercises on maximizing a function using Genetic algorithm
6. Implementation of two input sine function
7. Implementation of three input non linear function
TOTAL:60 PERIODS
TEXT BOOKS:
1. SaJANG, J.-S. R., SUN, C.-T., & MIZUTANI, E. (1997). Neuro-fuzzy and soft computing: A
computational approach to learning and machine intelligence. Upper Saddle River, NJ,
Prentice Hall,1997
2. Himanshu Singh, Yunis Ahmad Lone, Deep Neuro-Fuzzy Systems with Python
3. With Case Studies and Applications from the Industry, Apress, 2020

181
REFERENCES
1. roj Kaushik and Sunita Tiwari, Soft Computing-Fundamentals Techniques and Applications,
1st Edition, McGraw Hill, 2018.
2. S. Rajasekaran and G.A.V.Pai, “Neural Networks, Fuzzy Logic and Genetic Algorithms”, PHI,
2003.
3. Samir Roy, Udit Chakraborthy, Introduction to Soft Computing, Neuro Fuzzy and Genetic
Algorithms, Pearson Education, 2013.
4. S.N. Sivanandam, S.N. Deepa, Principles of Soft Computing, Third Edition, Wiley India Pvt
Ltd, 2019.
5. R.Eberhart, P.Simpson and R.Dobbins, “Computational Intelligence - PC Tools”, AP
Professional, Boston, 1996

CO’s-PO’s & PSO’s MAPPING

CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 2 3 3 3 - - - 3 1 3 2 3 1 2
2 2 3 3 2 3 - - - 3 2 3 2 2 1 3
3 1 3 2 2 1 - - - 3 1 1 2 1 3 2
4 1 2 1 3 2 - - - 3 3 1 1 2 1 1
5 2 3 1 2 1 - - - 3 3 3 2 1 2 3
AVg. 1.8 2.6 2 2.4 2 - - - 3 2 2.2 1.8 1.8 1.6 2.2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS357 OPTIMIZATION TECHNIQUES L T P C

2 0 2 3
COURSE OBJECTIVES:
The objective of this course is to enable the student to
 Formulate and solve linear programming problems (LPP)
 Evaluate Integer Programming Problems, Transportation and Assignment Problems.
 Obtain a solution to network problems using CPM and PERT techniques.
 Able to optimize the function subject to the constraints.
 Identify and solve problems under Markovian queuing models.

UNIT I LINEAR MODELS 6

Introduction of Operations Research - mathematical formulation of LPP- Graphical Methods to solve
LPP- Simplex Method- Two-Phase method

UNIT II INTEGER PROGRAMMING AND TRANSPORTATION PROBLEMS 6

Integer programming: Branch and bound method- Transportation and Assignment problems -
Traveling salesman problem.

UNIT III PROJECT SCHEDULING 6

Project network -Diagram representation – Floats - Critical path method (CPM) – PERT- Cost
considerations in PERT and CPM.

182
UNIT IV CLASSICAL OPTIMIZATION THEORY 6
Unconstrained problems – necessary and sufficient conditions - Newton-Raphson method,
Constrained problems – equality constraints – inequality constraints - Kuhn-Tucker conditions.

UNIT V QUEUING MODELS 6

Introduction, Queuing Theory, Operating characteristics of a Queuing system, Constituents of a
Queuing system, Service facility, Queue discipline, Single channel models, multiple service
channels.
30 PERIODS
PRACTICALS
1.Solving simplex maximization problems using R programming.
2. Solving simplex minimization problems using R programming.
3. Solving mixed constraints problems – Big M & Two phase method using TORA.
4. Solving transportation problems using R.
5. Solving assignment problems using R.
6. Solving optimization problems using LINGO.
7. Studying Primal-Dual relationships in LP using TORA.
8. Solving LP problems using dual simplex method using TORA.
9. Sensitivity & post optimality analysis using LINGO.
10. Solving shortest route problems using optimization software
11. Solving Project Management problems using optimization software
12. Testing random numbers and random variates for their uniformity.
13. Testing random numbers and random variates for their independence
14. Solve single server queuing model using simulation software package.
15. Solve multi server queuing model using simulation software package.
30 PERIODS
TOTAL: 60 PERIODS
COURSE OUTCOMES:
On successful completion of this course, the student will able to
CO1:Formulate and solve linear programming problems (LPP)
CO2:Evaluate Integer Programming Problems, Transportation and Assignment Problems.
CO3:Obtain a solution to network problems using CPM and PERT techniques.
CO4:Able to optimize the function subject to the constraints.
CO5:Identify and solve problems under Markovian queuing models

TEXT BOOK:
1. Hamdy A Taha, Operations Research: An Introduction, Pearson, 10th Edition, 2017.

REFERENCES:
1. ND Vohra, Quantitative Techniques in Management, Tata McGraw Hill, 4th Edition, 2011.
2. J. K. Sharma, Operations Research Theory and Applications, Macmillan, 5th Edition, 2012.
3. Hiller F.S, Liberman G.J, Introduction to Operations Research, 10th Edition McGraw Hill,
2017.
4. Jit. S. Chandran, Mahendran P. Kawatra, KiHoKim, Essentials of Linear Programming,
Vikas Publishing House Pvt.Ltd. New Delhi, 1994.
5. Ravindran A., Philip D.T., and Solberg J.J., Operations Research, John Wiley, 2nd Edition,
2007.

183
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 2 1 1 - - - 2 1 1 2 3 3 3
2 3 1 2 2 3 - - - 3 2 3 1 2 1 1
3 2 3 3 2 2 - - - 3 3 1 3 1 3 1
4 2 2 1 1 3 - - - 2 1 3 1 2 1 2
5 2 1 1 3 2 - - - 3 3 1 3 3 2 1
AVg. 2.4 2 1.8 1.8 2.2 - - - 2.6 2 1.8 2 2.2 2 1.6
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS348 GAME THEORY L T PC

2 0 2 3
COURSE OBJECTIVES:
 To introduce the student to the notion of a game, its solutions concepts, and other basic
notions and tools of game theory, and the main applications for which they are appropriate,
including electronic trading markets.
 To formalize the notion of strategic thinking and rational choice by using the tools of game
theory, and to provide insights into using game theory in 41odeIIing applications.
 To draw the connections between game theory, computer science, and economics,
especially emphasizing the computational issues.
 To introduce contemporary topics in the intersection of game theory, computer science,
and economics.
 To apply game theory in searching, auctioning and trading.

UNIT I INTRODUCTION 6
Introduction — Making rational choices: basics of Games — strategy — preferences — payoffs —
Mathematical basics — Game theory — Rational Choice — Basic solution concepts-non-
cooperative versus cooperative games — Basic computational issues — finding equilibria and
learning in games- Typical application areas for game theory (e.g. Google's sponsored search, eBay
auctions, electricity trading markets).

UNIT II GAMES WITH PERFECT INFORMATION 6

Games with Perfect Information — Strategic games — prisoner's dilemma, matching pennies - Nash
equilibria —mixed strategy equilibrium — zero-sum games

UNIT III GAMES WITH IMPERFECT INFORMATION 6

Games with Imperfect Information — Bayesian Games — Motivational Examples — General

Definitions — Information aspects — Illustrations — Extensive Games with Imperfect — Information
— Strategies — Nash Equilibrium —Repeated Games — The Prisoner's Dilemma — Bargaining

UNIT IV NON-COOPERATIVE GAME THEORY 6

Non-cooperative Game Theory — Self-interested agents — Games in normal form — Analyzing
games: from optimality to equilibrium — Computing Solution Concepts of Normal — Form Games
— Computing Nash equilibria of two-player, zero-sum games —Computing Nash equilibria of two-
player, general- sum games — Identifying dominated strategies

184
UNIT V MECHANISM DESIGN 6
Aggregating Preferences — Social Choice — Formal Model — Voting — Existence of social functions
— Ranking systems — Protocols for Strategic Agents: Mechanism Design — Mechanism design with
unrestricted preferences
30 PERIODS
COURSE OUTCOMES:
Upon Completion of the course, the students will be able to
CO1:Discuss the notion of a strategic game and equilibria and identify the characteristics of main
applications of these concepts.
CO2:Discuss the use of Nash Equilibrium for other problems.
CO3:Identify key strategic aspects and based on these be able to connect them to appropriate
game theoretic concepts given a real world situation.
CO4:Identify some applications that need aspects of Bayesian Games.
CO5:Implement a typical Virtual Business scenario using Game theory.

LABORATORY EXERCISES:
1. Prisoner’s dilemma
2. Pure Strategy Nash Equilibrium
3. Extensive Form – Graphs and Trees, Game Trees
4. Strategic Form – Elimination of dominant strategy
5. Minimax theorem, minimax strategies
6. Perfect information games: trees, players assigned to nodes, payoffs, backward Induction,
subgame perfect equilibrium,
7. imperfect-information games - Mixed Strategy Nash Equilibrium - Finding mixed-strategy
Nash equilibria for zero sum games, mixed versus behavioral strategies.
8. Repeated Games
9. Bayesian Nash equilibrium

30 PERIODS
TOTAL: 60 PERIODS

TEXT BOOKS:

1. M. J. Osborne, An Introduction to Game Theory. Oxford University Press, 2012.

2. M. Machler, E. Solan, S. Zamir, Game Theory, Cambridge University Press, 2013.
3. N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani, Algorithmic Game Theory.
Cambridge University Press, 2007.
4. A.Dixit and S. Skeath, Games of Strategy, Second Edition. W W Norton & Co Inc, 2004.
5. YoavShoham, Kevin Leyton-Brown, Multiagent Systems: Algorithmic, Game-Theoretic,
and Logical Foundations, Cambridge University Press 2008.
6. Zhu Han, DusitNiyato, WalidSaad, TamerBasar and Are Hjorungnes, “Game Theory in
Wireless and Communication Networks”, Cambridge University Press, 2012.
7. Y.Narahari, “Game Theory and Mechanism Design”, IISC Press, World Scientific.
8. William Spaniel, “Game Theory 101: The Complete Textbook”, CreateSpace Independent
Publishing, 2011.

185
CO’s-PO’s & PSO’s MAPPING
CO’s PO’s PSO’s
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 2 3 3 - - - - - - - 1 1 3
2 3 3 3 2 3 - - - - - - - 1 1 1
3 1 1 3 3 3 - - - - - - - 1 1 2
4 2 1 1 1 1 - - - - - - - 1 1 2
5 2 2 3 2 1 - - - - - - - 1 1 2
AVg. 2.2 2 2.4 2.2 2.2 - - - - - - - 1 1 2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS337 COGNITIVE SCIENCE L T P C

2 0 2 3
COURSE OBJECTIVES:
 To know the theoretical background of cognition.
 To understand the link between cognition and computational intelligence.
 To explore probabilistic programming language.
 To study the computational inference models of cognition.
 To study the computational learning models of cognition.

UNIT I PHILOSOPHY, PSYCHOLOGY AND NEUROSCIENCE 6

Philosophy: Mental-physical Relation – From Materialism to Mental Science – Logic and the
Sciences of the Mind – Psychology: Place of Psychology within Cognitive Science – Science of
Information Processing –Cognitive Neuroscience – Perception – Decision – Learning and Memory
– Language Understanding and Processing.

UNIT II COMPUTATIONAL INTELLIGENCE 6

Machines and Cognition – Artificial Intelligence – Architectures of Cognition – Knowledge Based
Systems – Logical Representation and Reasoning – Logical Decision Making –Learning – Language
– Vision.

UNIT III PROBABILISTIC PROGRAMMING LANGUAGE 6

WebPPL Language – Syntax – Using Javascript Libraries – Manipulating probability types and
distributions – Finding Inference – Exploring random computation – Coroutines: Functions that
receive continuations –Enumeration

UNIT IV INFERENCE MODELS OF COGNITION 6

Generative Models – Conditioning – Causal and statistical dependence – Conditional dependence
– Data Analysis – Algorithms for Inference.

UNIT V LEARNING MODELS OF COGNITION 6

Learning as Conditional Inference – Learning with a Language of Thought – Hierarchical Models–
Learning (Deep) Continuous Functions – Mixture Models.
30 PERIODS
PRACTICAL EXERCISES
1.Demonstration of Mathematical functions using WebPPL.
2. Implementation of reasoning algorithms.
186
3. Developing an Application system using generative model.
4. Developing an Application using conditional inference learning model.
5. Application development using hierarchical model.
6. Application development using Mixture model.
30 PERIODS
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO1:Understand the underlying theory behind cognition.
CO2:Connect to the cognition elements computationally.
CO3:Implement mathematical functions through WebPPL.
CO4:Develop applications using cognitive inference model.
CO5:Develop applications using cognitive learning model.

TOTAL: 60 PERIODS
TEXT BOOK:
1. Vijay V Raghavan,Venkat N.Gudivada, VenuGovindaraju, C.R. Rao, Cognitive Computing:
Theory and Applications: (Handbook of Statistics 35), Elsevier publications, 2016
2. Judith Hurwitz, Marcia Kaufman, Adrian Bowles, Cognitive Computing and Big Data
Analytics, Wiley Publications, 2015
3. Robert A. Wilson, Frank C. Keil, “The MIT Encyclopedia of the Cognitive Sciences”,The MIT
Press, 1999.
4. Jose Luis Bermúdez, Cognitive Science -An Introduction to the Science of the Mind,
Cambridge University Press 2020

REFERENCES:

1. Noah D. Goodman, Andreas Stuhlmuller, “The Design and Implementation of Probabilistic

Programming Languages”, Electronic version of book, https://dippl.org/.
2. Noah D. Goodman, Joshua B. Tenenbaum, The ProbMods Contributors, “Probabilistic
Models of Cognition”, Second Edition, 2016, https://probmods.org/.

CO’s-PO’s & PSO’s MAPPING

PO’s PSO’s
CO’s 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 1 3 2 2 - - - 1 1 2 2 1 2 2
2 2 2 1 1 2 - - - 3 2 3 1 2 3 2
3 1 3 1 3 3 - - - 1 3 1 3 3 1 2
4 2 1 1 2 3 - - - 1 2 3 1 3 3 1
5 1 2 3 2 2 - - - 1 2 2 2 2 2 1
AVG 1.8 1.8 1.8 2 2.4 - - - 1.4 2 2.2 1.8 2.2 2.2 1.6
1 - low, 2 - medium, 3 - high, ‘-' - no correlation

CCS345 ETHICS AND AI L T P C

2 0 2 3
COURSE OBJECTIVES:
 Study the morality and ethics in AI
 Learn about the Ethical initiatives in the field of artificial intelligence

187
  Study about AI standards and Regulations
 Study about social and ethical issues of Robot Ethics
 Study about AI and Ethics- challenges and opportunities

UNIT I INTRODUCTION 6
Definition of morality and ethics in AI-Impact on society-Impact on human psychology-Impact on the
legal system-Impact on the environment and the planet-Impact on trust

UNIT II ETHICAL INITIATIVES IN AI 6

International ethical initiatives-Ethical harms and concerns-Case study: healthcare robots,
Autonomous Vehicles , Warfare and weaponization.

UNIT III AI STANDARDS AND REGULATION 6

Model Process for Addressing Ethical Concerns During System Design - Transparency of
Autonomous Systems-Data Privacy Process- Algorithmic Bias Considerations -
Ontological Standard for Ethically Driven Robotics and Automation Systems

UNIT IV ROBOETHICS: SOCIAL AND ETHICAL IMPLICATION OF ROBOTICS 6

Robot-Roboethics- Ethics and Morality- Mora