RAJALAKSHMI INSTITUTE OF TECHNOLOGY

(Affiliated to Anna University, Chennai)

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

CURRICULAM AND SYLLABUS
REGULATION 2021

VISION
 To empower the students with high quality technical education in the field of Computer Science and
Engineering to face the challenges of the modern computing industry and research for the positive
contributions to the society.
MISSION
 To produce globally competent and highly employable professionals, who will be innovative in solving
real world problems.
 To train the students with high ethical values to serve the society efficiently in their profession.
 To promote research activities the students and faculty members that could fortify industry academic
community connections.
PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

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

PROGRAM OUTCOMES (POs)

Engineering Graduates will be able to:

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 to 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 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. Lifelong learning: Recognize the need for, and have the preparation and ability to engage in independent
and lifelong learning in the broadest context of technological change.

PROGRAMME SPECIFIC OUTCOMES (PSOs)

PSO1 Exhibit design and programming skills to build and automate business solutions using cutting edge
technologies.

PSO2 Strong theoretical foundation leading to excellence and excitement towards research, to provide elegant
solutions to complex problems.

PSO3 Ability to work effectively with various engineering fields as a team to design, build and develop system
applications.
 ANNA UNIVERSITY, CHENNAI
NON- AUTONOMOUS AFFILIATED COLLEGES
REGULATIONS 2021
B. E. COMPUTER SCIENCE AND ENGINEERING
CHOICE BASED CREDIT SYSTEM
CURRICULA FOR SEMESTERS I TO VIII AND SYLLABI FOR SEMESTERS I TO IV
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. HS3151 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- WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
THEORY
1. HS3251 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
GE3252 தமி ழருமி் ததொி ழி லி் HSMC 1 0 0 1 1
7.
நி டி்பமி மி்
/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 /
11. GE3272 EEC 0 0 4 4 2
Foreign 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
 SEMESTER III
PERIODS TOTAL
S. COURSE CATE PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
THEORY
1. MA3354 Discrete Mathematics BSC 3 1 0 4 4
2. CS3351 Digital Principles and
ESC 3 0 2 5 4
Computer Organization
3. CS3352 Foundations of Data
Science PCC 3 0 0 3 3
4. CS3301 Data Structures PCC 3 0 0 3 3
5. CS3391 Object Oriented
Programming PCC 3 0 0 3 3
PRACTICALS
6. CS3311 Data Structures Laboratory PCC 0 0 3 3 1.5
7. CS3381 Object Oriented 0 0 3 3
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. CS3491 Artificial Intelligence and
PCC 3 0 2 5 4
Machine Learning
3. CS3492 Database Management
PCC 3 0 0 3 3
Systems
4. CS3401 Algorithms PCC 3 0 2 5 4
5. CS3451 Introduction to Operating
PCC 3 0 0 3 3
Systems
6. GE3451 Environmental Sciences and
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. CS3481 Database Management
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.
 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. CB3491 Cryptography and Cyber 3
PCC 3 0 0 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. CCS356 Object Oriented Software 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
 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

COURSE PERIODS TOTAL

S. CATE PERWEEK
CODE COURSE TITLE CONTACT CREDITS
NO. 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. GE3753 Engineering Economics and HSMC 3 0 0 3 3
Financial Accounting
4. GE3754 Human Resource 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
 MANDATORY COURSES I

PERIODS TOTAL
S. CATE
COURSE COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
MX3081 Introduction to Women MC 3 0 0 3 0
1.
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. MX3084 Disaster Management MC 3 0 0 3 0

MANDATORY COURSES II

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

.
 PROFESSIONAL ELECTIVE COURSES: VERTICALS

VERTICAL 1: DATA SCIENCE

PERIODS TOTAL
S. COURSE CATE PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. CCS346 Exploratory Data PEC 2 0 2 4 3
Analysis
2. CCS360 Recommender PEC 2 0 2 4 3
Systems
3. CCS355 Neural Networks and PEC 2 0 2 4 3
Deep Learning
4. CCS369 Text and PEC 2 0 2 4 3
Speech Analysis
5. CCW331 Business Analytics PEC 2 0 2 4 3

6. CCS349 Image and Video PEC 2 0 2 4 3

Analytics
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 PER WEEK
COURSE TITLE 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. CCS336 Cloud Services
PEC 2 0 2 4 3
Management
4. CCS370 UI and UX Design PEC 2 0 2 4 3
5. CCS366 Software Testing and
PEC 2 0 2 4 3
Automation
6. CCS374 Web Application
PEC 2 0 2 4 3
Security
7. CCS342 DevOps
PEC 2 0 2 4 3
8. CCS358 Principles of
Programming PEC 2 0 2 4 3
Languages
 VERTICAL 3: CLOUD COMPUTING AND DATA CENTER TECHNOLOGIES

PERIODS TOTAL
S. COURSE CATE PER WEEK
COURSE TITLE 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. CCS336 Cloud Services
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
PEC 2 0 2 4 3
Networks
7. CCS368 Stream Processing PEC 2 0 2 4 3
8. CCS362 Security and Privacy
PEC 2 0 2 4 3
in Cloud

VERTICAL 4: CYBER SECURITY AND DATA PRIVACY

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

PERIODS TOTAL
S. COURSE CATE PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. CCS333 Augmented
PEC 2 0 2 4 3
Reality/Virtual Reality
2. CCS352 Multimedia and
PEC 2 0 2 4 3
Animation
3. CCS371 Video Creation and
PEC 2 0 2 4 3
Editing
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. CCS353 Multimedia Data
Compression and PEC 2 0 2 4 3
Storage

VERTICAL 6: EMERGING TECHNOLOGIES

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

PERIODS TOTAL
SL. COURSE CATE PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. CCS350 Knowledge
PEC 2 0 2 4 3
Engineering
2. CCS364 Soft Computing PEC 2 0 2 4 3
3. CCS355 Neural Networks and
PEC 2 0 2 4 3
Deep Learning
4. CCS369 Text and
PEC 2 0 2 4 3
Speech Analysis
5. CCS357 Optimization
PEC 2 0 2 4 3
Techniques
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 PER WEEK CONTACT
COURSE TITLE CREDITS
NO. CODE GORY
L T P PERIODS
1. OAS351 Space Science OEC 3 0 0 3 3
2. OIE351 Introduction to Industrial 3 0 0 3 3
OEC
Engineering
3. OBT351 Climate Change and its 3 0 0 3 3
OEC
Impact
4. OCE351 Environment and Social 3 0 0 3 3
OEC
Impact Assessment
5. OEE351 Renewable Energy 3 0 0 3 3
OEC
System
6. OEI351 Introduction to Industrial 3 0 0 3 3
Instrumentation and OEC
Control
7. OMA351 Graph Theory OEC 3 0 0 3 3
 OPEN ELECTIVES – II

COURSE PERIODS TOTAL

SL. CATE PER WEEK
CODE COURSE TITLE CONTACT CREDITS
NO. GORY
L T P PERIODS
1. OIE352 Resource Management OEC 3 0 0 3 3
Techniques
2. OMG351 Fintech Regulations OEC 3 0 0 3 3
3. OFD351 Holistic Nutrition OEC 3 0 0 3 3
4. OCE352 ICT in Agriculture OEC 3 0 0 3 3
5. OEI352 Introduction to Control OEC 3 0 0 3 3
Engineering
6. OPY351 Pharmaceutical 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 PER WEEK
CODE COURSE TITLE CONTACT CREDITS
NO. GORY
L T P PERIODS
1. OHS351 English for Competitive OEC 3 0 0 3 3
Examinations
2. OMG352 NGOs and Sustainable OEC 3 0 0 3 3
Development
3. OMG353 Democracy and Good OEC 3 0 0 3 3
Governance
4. OME353 Renewable Energy OEC 3 0 0 3 3
Technologies
5. OME354 Applied Design Thinking OEC 2 0 2 4 3
6. OMF351 Reverse Engineering OEC 3 0 0 3 3
7. OMF353 Sustainable Manufacturing OEC 3 0 0 3 3
8. OAU351 Electric and Hybrid Vehicle 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. OML351 Introduction to Non-destructive 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. OAE352 Fundamentals of Aeronautical OEC 3 0 0 3 3
Engineering
17. OGI351 Remote Sensing Concepts OEC 3 0 0 3 3
18. OAI351 Urban Agriculture OEC 3 0 0 3 3
19. OEN351 Drinking Water Supply and OEC 3 0 0 3 3
Treatment
20. OEE352 Electric Vehicle Technology OEC 3 0 0 3 3
21. OEI353 Introduction to PLC 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. OBT352 Biomedical Instrumentation OEC 3 0 0 3 3
25. OFD352 Traditional Indian Foods OEC 3 0 0 3 3
26. OFD353 Introduction to food processing OEC 3 0 0 3 3
27. OPY352 IPR for Pharma Industry OEC 3 0 0 3 3
28. OTT351 Basics of Textile Finishing OEC 3 0 0 3 3
29. OTT352 Industrial Engineering for OEC 3 0 0 3 3
Garment Industry
30. OTT353 Basics of Textile Manufacture OEC 3 0 0 3 3
31. OPE351 Introduction to Petroleum OEC 3 0 0 3 3
Refining and Petrochemicals
32. OPE352 Energy Conservation and OEC 3 0 0 3 3
Management
33. OPT351 Basics of Plastics Processing OEC 3 0 0 3 3
34. OEC351 Signals and Systems OEC 3 0 0 3 3
35. OEC352 Fundamentals of Electronic OEC 3 0 0 3 3
Devices and Circuits
36. OBM351 Foundation Skills in Integrated OEC 3 0 0 3 3
Product Development
37. OBM352 Assistive Technology OEC 3 0 0 3 3
38. OMA352 Operations Research OEC 3 0 0 3 3
39. OMA353 Algebra and Number Theory OEC 3 0 0 3 3
40. OMA354 Linear Algebra OEC 3 0 0 3 3
41. OCE353 Lean Concepts, Tools and OEC 3 0 0 3 3
Practices

OPEN ELECTIVES – IV

COURSE PERIODS TOTAL

SL. CATE PER WEEK
CODE COURSE TITLE CONTACT CREDITS
NO. GORY
L T P PERIODS
1. OHS352 Project Report Writing OEC 3 0 0 3 3
2. OMA355 Advanced Numerical Methods OEC 3 0 0 3 3
3. OMA356 Random Processes OEC 3 0 0 3 3
4. OMA357 Queuing and Reliability OEC 3 0 0 3 3
Modelling
5. OMG354 Production and Operations OEC 3 0 0 3 3
Management for
Entrepreneurs
6. OMG355 Multivariate Data Analysis OEC 3 0 0 3 3
7. OME352 Additive Manufacturing OEC 3 0 0 3 3
8. OME353 New Product Development OEC 3 0 0 3 3
9. OME355 Industrial Design & Rapid OEC 2 0 2 4 3
Prototyping Techniques
10. OMF352 Micro and Precision OEC 3 0 0 3 3
Engineering
11. OMF354 Cost Management of OEC 3 0 0 3 3
Engineering Projects
12. OAU352 Batteries and Management OEC 3 0 0 3 3
System
13. OAU353 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. OIM353 Production Planning and 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. OML352 Electrical, Electronic and OEC 3 0 0 3 3
Magnetic materials
21. OML353 Nanomaterials and 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 Foundation of Automation OEC 3 0 0 3 3
25. ORA353 Concepts in Mobile Robotics OEC 3 0 0 3 3
26. OMV351 Marine Propulsion OEC 3 0 0 3 3
27. OMV352 Marine Merchant Vehicles OEC 3 0 0 3 3
28. OMV353 Elements of Marine OEC 3 0 0 3 3
Engineering
29. OAE353 Drone Technologies OEC 3 0 0 3 3
30. OGI352 Geographical Information OEC 3 0 0 3 3
System
31. OAI352 Agriculture Entrepreneurship OEC 3 0 0 3 3
Development
32. OEN352 Biodiversity Conservation OEC 3 0 0 3 3
33. OEE353 Introduction to control OEC 3 0 0 3 3
systems
34. OEI354 Introduction to Industrial OEC 3 0 0 3 3
Automation Systems
35. OCH353 Energy Technology OEC 3 0 0 3 3
36. OCH354 Surface Science OEC 3 0 0 3 3
37. OBT353 Environment and Agriculture OEC 3 0 0 3 3
38. OFD354 Fundamentals of Food OEC 3 0 0 3 3
Engineering
39. OFD355 Food safety and Quality OEC 3 0 0 3 3
Regulations
40. OPY353 Nutraceuticals OEC 3 0 0 3 3
41. OTT354 Basics of Dyeing and Printing OEC 3 0 0 3 3
42. OTT355 Fibre Science OEC 3 0 0 3 3
43. OTT356 Garment Manufacturing OEC 3 0 0 3 3
Technology
44. OPE353 Industrial safety OEC 3 0 0 3 3
45. OPE354 Unit Operations in Petro OEC 3 0 0 3 3
Chemical Industries
46. OPT352 Plastic Materials for OEC 3 0 0 3 3
Engineers
 47. OPT353 Properties and Testing of OEC 3 0 0 3 3
Plastics
48. OEC353 VLSI Design OEC 3 0 0 3 3
49. OEC354 Industrial IoT and Industry 4.0 OEC 2 0 2 4 3
50. OBM353 Wearable Devices OEC 3 0 0 3 3
51. OBM354 Medical Informatics OEC 3 0 0 3 3
52. OCE354 Basics of Integrated Water OEC 3 0 0 3 3
Resources Management

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 of Regulations 2021.
 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
Datamining for Sustainable
Fundamentals Team Building &
Business Agriculture and
of Investment Leadership Management Constitution of India
Intelligence Environmental
for Business Management
Banking,
Public Personnel Human Resource Sustainable Bio
Financial Creativity & Innovation in
Administration Analytics Materials
Services and Entrepreneurship
Insurance
Marketing and
Introduction to Administrative
Principles of Marketing Social Media Web Materials for Energy
Blockchain and Theories
Management for Business Analytics Sustainability
its Applications
Fintech Human Resource Operation and
Personal Management for Indian Administrative Supply Chain Green Technology
Finance and Entrepreneurs System Analytics
Payments
Introduction to Financing New Business Public Policy Environmental
Financial Analytics
Fintech Ventures Administration Quality Monitoring
and Analysis
Integrated Energy
Planning for
- - - -
Sustainable
Development
Energy Efficiency for
- - - - Sustainable
Development
(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 PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. CMG331 Financial Management PEC 3 0 0 3 3
2. CMG332 Fundamentals of
PEC 3 0 0 3 3
Investment
3. CMG333 Banking, Financial
PEC 3 0 0 3 3
Services and Insurance
4. CMG334 Introduction to Blockchain
PEC 3 0 0 3 3
and its Applications
5. CMG335 Fintech Personal Finance
PEC 3 0 0 3 3
and Payments
6. CMG336 Introduction to Fintech PEC 3 0 0 3 3

VERTICAL 2: ENTREPRENEURSHIP

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

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

VERTICAL 4: BUSINESS DATA ANALYTICS

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

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

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?

UNIT 1 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, Compound
& Complex Sentences. Vocabulary - Cause & Effect Expressions – Content vs Function words.
TOTAL : 45 PERIODS

LEARNING OUTCOMES :
At the end of the course, learners will be able
 To use appropriate words in a professional context
 To gain understanding of basic grammatic structures and use them in right context.
 To read and infer the denotative and connotative meanings of technical texts
 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.
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
 Use the matrix algebra methods for solving practical problems.
 Apply differential calculus tools in solving various application problems.
  Able to use differential calculus ideas on several variable functions.
 Apply different methods of integration in solving practical problems.
 Apply multiple integral ideas in solving areas, volumes and other practical problems.

TEXT BOOKS :
1. Kreyszig.E, "Advanced Engineering Mathematics", John Wiley and Sons,
th
10 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, 8 th 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.

PH3151 ENGINEERING PHYSICS LTP 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 – 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
 Understand the importance of mechanics.
 Express their knowledge in electromagnetic waves.
 Demonstrate a strong foundational knowledge in oscillations, optics and lasers.
 Understand the importance of quantum physics.
 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.
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.

CY3151 ENGINEERING CHEMISTRY LT 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
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:
 To infer the quality of water from quality parameter data and propose suitable treatment
methodologies to treat water.
 To identify and apply basic concepts of nanoscience and nanotechnology in designing the
synthesis of nanomaterials for engineering and technology applications.
 To apply the knowledge of phase rule and composites for material selection requirements.
 To recommend suitable fuels for engineering processes and applications.
 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.
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.
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, a
nd 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.

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’s PO’s PSOs
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 3 3 2 - - - - - 2 2
2 3 3 3 3 2 - - - - - 2 2
3 3 3 3 3 2 - - - - - 2 -
4 2 2 - 2 2 - - - - - 1 -
5 1 2 - - 1 - - - - - 1 -
6 2 2 - - 2 - - - - - 1 -
AVg. 2 3 3 3 2 - - - - - 2 2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation
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, Leatherpuppetry, 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,
 TamilNadu)
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 PC

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.

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.

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’s PO’s PSOs
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 3 3 3 3 3 - - - - - 3 2
2 3 3 3 3 3 - - - - - 3 2
3 3 3 3 3 2 - - - - - 2 -
4 3 2 - 2 2 - - - - - 1 -
5 1 2 - - 1 - - - - - 1 -
AVg. 2 - - - 2 - - - - - 1 -
2 3 3 3 2 - - - - - 2 2
1 - low, 2 - medium, 3 - high, ‘-' - no correlation
 BS3171 PHYSICS AND CHEMISTRY LABORATORY LTP C
00 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.
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
 Understand the functioning of various physics laboratory equipment.
 Use graphical models to analyze laboratory data.
 Use mathematical models as a medium for quantitative reasoning and describing physical
reality.
 Access, process and analyze scientific information.
 Solve problems individually and collaboratively.
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.
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.Preparation of
nanoparticles (TiO2/ZnO/CuO) by Sol-Gel method.
13. Estimation of Nickel in steel
14. Proximate analysis of Coal
TOTAL : 30 PERIODS

COURSE OUTCOMES:
 To analyse the quality of water samples with respect to their acidity, alkalinity, hardness and
DO.
 To determine the amount of metal ions through volumetric and spectroscopic techniques
 To analyse and determine the composition of alloys.
 To learn simple method of synthesis of nanoparticles
 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).

GE3172 ENGLISH LABORATORY LTP C

00 2 1
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; - 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

LEARNING OUTCOMES:
At the end of the course, learners will be able
 To listen and comprehend complex academic texts
 To speak fluently and accurately in formal and informal communicative contexts
 To express their opinions effectively in both oral and written medium of communication
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.
 HS3251 PROFESSIONAL ENGLISH -II LTP C
200 2

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
OUTCOMES:
At the end of the course, learners will be able
 To compare and contrast products and ideas in technical texts.
 To identify cause and effects in events, industrial processes through technical texts
 To analyse problems in order to arrive at feasible solutions and communicate them orally and in
the written format.
 To report events and the processes of technical and industrial nature.
 To present their opinions in a planned and logical manner, and draft effective resumes in 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.

REFERENCE BOOKS:
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.

MA3251 STATISTICS AND NUMERICAL METHODS LT P C

31 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.
● 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:
● Apply the concept of testing of hypothesis for small and large samples in real life problems.
● Apply the basic concepts of classifications of design of experiments in the field of agriculture.
● Appreciate the numerical techniques of interpolation in various intervals and apply the numerical
techniques of differentiation and integration for engineering problems.
● Understand the knowledge of various techniques and methods for solving first and second order
ordinary differential equations.
● 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.

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.
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: 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
 gain knowledge on classical and quantum electron theories, and energy band structures
 acquire knowledge on basics of semiconductor physics and its applications in various devices
 get knowledge on magnetic properties of materials and their applications in data storage,
 have the necessary understanding on the functioning of optical materials for optoelectronics
 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.
6. B.Rogers, J.Adams and S.Pennathur, Nanotechnology: Understanding Small Systems, CRC Press,
2014.

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

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
GE3251 ENGINEERING GRAPHICS L T PC
2 04 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.
Practicing three dimensional modeling of isometric projection of simple objects by CAD Software (Not
for examination)
TOTAL: (L=30+P=60) 90 PERIODS
OUTCOMES:
On successful completion of this course, the student will be able to
 Use BIS conventions and specifications for engineering drawing.
 Construct the conic curves, involutes and cycloid.
 Solve practical problems involving projection of lines.
 Draw the orthographic, isometric and perspective projections of simple solids.
 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
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.

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.

GE3252 TAMILS AND TECHNOLOGY L T PC

1 0 0 1

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)
(Publishedby: 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 ofArchaeology & 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. Porunai Civilization (Jointly Published by: Department of Archaeology & Tamil Nadu Text
BookandEducational Services Corporation, Tamil Nadu)
12. Journey of Civilization Indus to Vaigai (R.Balakrishnan) (Published by: RMRL) – Reference
Book.
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, Contributionof
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
 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
 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
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.

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.

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:
 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.
 Wire various electrical joints in common household electrical wire work.
 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.
 Solder and test simple electronic circuits; Assemble and test simple electronic components
on PCB.

CS3271 PROGRAMMING IN C LABORATORY LT P C

0 0 42

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

GE3272 COMMUNICATION LABORATORY LTPC

0 0 4 2
OBJECTIVES
 To identify varied group discussion skills and apply them to take part in effective discussions in
a professional context.

 To be able to communicate effectively through writing.

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
LEARNING OUTCOMES
 Speak effectively in group discussions held in a formal/semi formal contexts.
 Write emails and effective job applications.
Assessment Pattern
 One online / app based assessment to test speaking and writing skills
 Proficiency certification is given on successful completion of speaking and writing.

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.

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.
CS3351 DIGITAL PRINCIPLES AND COMPUTER ORGANIZATION LT PC
30 24
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.

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 2 1 1 2 - - - 1 1 2 1 2 2 1
2 2 2 1 2 2 - - - 1 1 1 2 2 2 2
3 2 1 - 1 1 - - - 2 1 1 2 2 3 1
4 2 2 1 2 2 1 1 - 1 2 1 3 2 2 3
5 3 2 2 1 2 - - - 1 1 2 2 3 3 2
AVg. 2 2 1 1 2 1 1 - 1 1 1 2 2 2 2
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3352 FOUNDATIONS OF DATA SCIENCE LTP 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)
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 LTP C

30 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

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

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.

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.
Lab Requirements: for a batch of 30 students
Operating Systems: Linux / Windows
Front End Tools: Eclipse IDE / Netbeans IDE
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
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 LTP 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

LIST OF EQUIPMENTS :(30 Students per Batch)

Tools: Python, Numpy, Scipy, Matplotlib, Pandas, statmodels, seaborn, plotly, bokeh
Note: Example data sets like: UCI, Iris, Pima Indians Diabetes etc.
TOTAL: 60 PERIODS
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

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

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
OUTCOMES:
On successful completion the students will be able to

 Use MS Word to create quality documents, by structuring and organizing content for their
day to day technical and academic requirements
 Use MS EXCEL to perform data operations and analytics, record, retrieve data as per
requirements and visualize data for ease of understanding
 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 LT P C
3 00 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 - 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

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
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

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.
 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 LTP 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
 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
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 2 1 3 2 - - - - 2 1 2 3 2 1 1
2 2 1 1 1 1 - - - 1 3 3 3 2 3 3
3 1 3 3 3 1 - - - 1 2 1 2 2 1 2
4 1 2 2 3 - - - - 2 3 3 1 3 1 3
5 1 2 3 2 3 - - - 3 1 3 3 1 3 3
AVg. 1 2 2 2 2 - - - 2 2 2 2 2 2 2
1 - low, 2 - medium, 3 - high, ‘-“- no correlation

CS3451 INTRODUCTION TO OPERATING SYSTEMS L T P C

3 00 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.

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

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

REFERENCE BOOKS :
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.

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
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
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

List of Equipments:(30 Students per Batch)

MYSQL / SQL : 30 Users
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