Anna University, Chennai Non-Autonomous Affiliated Colleges Regulations 2021 Choice Based Credit System B.Tech. Information Technology
Anna University, Chennai Non-Autonomous Affiliated Colleges Regulations 2021 Choice Based Credit System B.Tech. Information Technology
Anna University, Chennai Non-Autonomous Affiliated Colleges Regulations 2021 Choice Based Credit System B.Tech. Information Technology
Demonstrate technical competence with analytical and critical thinking to understand and
meet the diversified requirements of industry, academia and research.
Exhibit technical leadership, team skills and entrepreneurship skills to provide business
solutions to real world problems.
Work in multi-disciplinary industries with social and environmental responsibility, work
ethics and adaptability to address complex engineering and social problems
Pursue lifelong learning, use cutting edge technologies and involve in applied research to
design optimal solutions.
1
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.
To ensure graduates
2
ANNA UNIVERSITY, CHENNAI
NON- AUTONOMOUS AFFILIATED COLLEGES
REGULATIONS 2021
B. TECH. INFORMATION TECHNOLOGY
CHOICE BASED CREDIT SYSTEM
CURRICULA FOR SEMESTERS I TO VIII AND SYLLABI FOR SEMESTERS III AND 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
GE3152 அறிவியல் தமிழ் /Scientific
7. HSMC 1 0 0 1 1
Thoughts in Tamil
PRACTICALS
8. Problem Solving and Python
GE3171 ESC 0 0 4 4 2
Programming Laboratory
9. Physics and Chemistry
BS3171 BSC 0 0 4 4 2
Laboratory
10. GE3171 English Laboratory $ EEC 0 0 2 2 1
TOTAL 16 1 10 27 22
$
Skill Based Course
SEMESTER II
PERIODS PER TOTAL
S. COURSE CATE-
COURSE TITLE WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
THEORY
1. 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
4. Basic Electrical and Electronics
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
7. GE3252 தமிழர் மரபு /Heritage of Tamils HSMC 1 0 0 1 1
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
11. Communication Laboratory /
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
3
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. CS3352 Digital Principles and
ESC 3 0 2 5 4
Computer Organization
3. CS3353 Foundations of Data
PCC 3 0 0 3 3
Science
4. CD3291 Data Structures and
PCC 3 0 0 3 3
Algorithms
5. CS3391 Object Oriented
PCC 3 0 0 3 3
Programming
PRACTICALS
6. CD3281 Data Structures and
PCC 0 0 4 4 2
Algorithms Laboratory
7. CS3381 Object Oriented
PCC 0 0 3 3 1.5
Programming Laboratory
8. CS3362 Data Science Laboratory PCC 0 0 4 4 2
9. GE3361 Professional Development$ EEC 0 0 2 2 1
TOTAL 15 1 15 31 23.5
$
Skill Based Course
SEMESTER IV
PERIODS TOTAL
S. COURSE CATE PER WEEK
COURSE TITLE 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. IT3401 Web Essentials 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.
4
SEMESTER V
PERIODS TOTAL
S. COURSE CATE PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
THEORY
1. CS3591 Computer Networks PCC 3 0 2 5 4
2. IT3501 Full Stack web Development PCC 3 0 0 3 3
3. CS3551 Distributed Computing PCC 3 0 0 3 3
4. CS3691 Embedded Systems and IoT PCC 3 0 2 5 4
5. Professional Elective I PEC - - - - 3
6. Professional Elective II PEC - - - - 3
7. Mandatory Course- I& MC 3 0 0 3 0
PRACTICALS
8. IT3511 Full Stack web Development
PCC 0 0 4 4 2
Laboratory
TOTAL - - - - 22
& 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 PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
THEORY
1. CCS356 Object Oriented Software
PCC 3 0 2 5 4
Engineering
2. Open Elective – I* OEC 3 0 0 3 3
3. Professional Elective III PEC - - - - 3
4. Professional Elective IV PEC - - - - 3
5. Professional Elective V PEC - - - - 3
6. Professional Elective VI PEC - - - - 3
7. Mandatory Course-II & MC 3 0 0 3 0
8. NCC Credit Course Level 3# - 3 0 0 3 3#
PRACTICALS
9. Mobile Application
IT3681 PCC 0 0 3 3 1.5
Development Laboratory
TOTAL - - - - 20.5
*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
5
SEMESTER VII / VIII*
PERIODS TOTAL
S. COURSE CATE PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
THEORY
1. GE3791 Human Values and Ethics HSMC 2 0 0 2 2
2. Management – Elective# 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. IT3711 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).
#
Management – Elective shall be chosen from the Management Elective courses.
PERIODS TOTAL
S. COURSE CATE PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
PRACTICALS
1. IT3811
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.
MANAGEMENT – ELECTIVE
PERIODS TOTAL
S. COURSE CATE PERWEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. GE3751 Principles of Management HSMC 3 0 0 3 3
2. GE3752 Total Quality Management HSMC 3 0 0 3 3
3. GE3753 Engineering Economics HSMC 3 0 0 3 3
and 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
6
MANDATORY COURSES I
PERIODS TOTAL
S. COURSE CATE
COURSE TITLE PER WEEK CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
Introduction to Women
1. MX3081 MC 3 0 0 3 0
and Gender Studies
2. MX3082 Elements of Literature MC 3 0 0 3 0
3. MX3083 Film Appreciation MC 3 0 0 3 0
4. MX3084 Disaster Management MC 3 0 0 3 0
MANDATORY COURSES II
PERIODS TOTAL
SL. COURSE CATE PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
Well Being with traditional
1. MX3085 practices (Yoga, Ayurveda MC 3 0 0 3 0
and Siddha)
History of Science and
2. MX3086 MC 3 0 0 3 0
Technology in India
Political and Economic
3. MX3087 Thought for a Humane MC 3 0 0 3 0
Society
State, Nation Building and
4. MX3088 MC 3 0 0 3 0
Politics in India
5. MX3089 Industrial Safety MC 3 0 0 3 0
7
PROFESSIONAL ELECTIVE COURSES: VERTICALS
Text and UI and UX Design Data Warehousing Modern Cryptography UI and UX Design Cyber security Text and
Speech Analysis Speech Analysis
Business Analytics Software Testing and Storage Engineering Secure Digital marketing Quantum Computing Optimization
Automation Technologies software systems Techniques
Image and video Web Application Software Defined Cryptocurrency and Visual Effects Cryptocurrency and Game Theory
analytics Security Networks Blockchain Blockchain
Technologies Technologies
Computer Vision Dev-ops Stream Processing Network Security Game Game Development Cognitive Science
Development
Big Data Analytics Principles of Security and Privacy Security and Privacy in Multimedia Data 3D Printing and Ethics And AI
Programming in Cloud Cloud Compression and 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.
8
PROFESSIONAL ELECTIVE COURSES
VERTICALS
PERIODS TOTAL
S. COURSE CATE PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
Exploratory Data
1. CCS346 PEC 2 0 2 4 3
Analysis
Recommender
2. CCS360 PEC 2 0 2 4 3
Systems
Neural Networks and
3. CCS355 PEC 2 0 2 4 3
Deep Learning
Text and
4. CCS369 PEC 2 0 2 4 3
Speech Analysis
5. CCW331 Business Analytics PEC 2 0 2 4 3
Image and video
6. CCS349 PEC 2 0 2 4 3
analytics
7. CCS338 Computer Vision PEC 2 0 2 4 3
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. CCS332 App Development PEC 2 0 2 4 3
Cloud Services
3. CCS336 PEC 2 0 2 4 3
Management
4. CCS370 UI and UX Design PEC 2 0 2 4 3
Software Testing and
5. CCS366 PEC 2 0 2 4 3
Automation
Web Application
6. CCS374 PEC 2 0 2 4 3
Security
7. CCS342 Dev-ops PEC 2 0 2 4 3
Principles of
8. CCS358 Programming PEC 2 0 2 4 3
Languages
9
VERTICAL 3: CLOUD COMPUTING AND DATA CENTRE 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
Cloud Services
3. CCS336 PEC 2 0 2 4 3
Management
4. CCS341 Data Warehousing PEC 2 0 2 4 3
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
Digital and Mobile
2. CCS343 PEC 2 0 2 4 3
Forensics
Social Network
3. CCS363 PEC 2 0 2 4 3
Security
4. CCS351 Modern Cryptography PEC 2 0 2 4 3
Engineering Secure
5. CB3591 PEC 2 0 2 4 3
Software Systems
Cryptocurrency and
6. CCS339 Blockchain PEC 2 0 2 4 3
Technologies
7. CCS354 Network Security PEC 2 0 2 4 3
Security and Privacy
8. CCS362 PEC 2 0 2 4 3
in Cloud
10
VERTICAL 5: CREATIVE MEDIA
PERIODS TOTAL
S. COURSE CATE PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
Augmented
1. CCS333 PEC 2 0 2 4 3
Reality/Virtual Reality
Multimedia and
2. CCS352 PEC 2 0 2 4 3
Animation
Video Creation and
3. CCS371 PEC 2 0 2 4 3
Editing
4. CCS370 UI and UX Design PEC 2 0 2 4 3
PERIODS TOTAL
S. COURSE CATE PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
Augmented
1. CCS333 PEC 2 0 2 4 3
Reality/Virtual Reality
Robotic Process
2. CCS361 PEC 2 0 2 4 3
Automation
Neural Networks and
3. CCS355 PEC 2 0 2 4 3
Deep Learning
4. CCS340 Cyber security PEC 2 0 2 4 3
11
VERTICAL 7: ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING
PERIODS TOTAL
S. COURSE CATE PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
Knowledge
1. CCS350 PEC 2 0 2 4 3
Engineering
2. CCS364 Soft Computing PEC 2 0 2 4 3
Neural Networks and
3. CCS355 PEC 2 0 2 4 3
Deep Learning
Text and
4. CCS369 PEC 2 0 2 4 3
Speech Analysis
Optimization
5. CCS357 PEC 2 0 2 4 3
Techniques
6. CCS348 Game Theory 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
Introduction to Industrial
2. OIE351 OEC 3 0 0 3 3
Engineering
Climate Change and its
3. OBT351 OEC 3 0 0 3 3
Impact
Environment and Social
4. OCE351 OEC 3 0 0 3 3
Impact Assessment
Renewable Energy
5. OEE351 OEC 3 0 0 3 3
System
Introduction to Industrial
6. OEI351 Instrumentation and OEC 3 0 0 3 3
Control
7. OMA351 Graph Theory OEC 3 0 0 3 3
12
OPEN ELECTIVES – II
PERIODS TOTAL
SL. COURSE CATE PER WEEK CONTACT
COURSE TITLE CREDITS
NO. CODE GORY
L T P PERIODS
Resource Management
1. OIE352 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
Introduction to Control
5. OEI352 OEC 3 0 0 3 3
Engineering
Pharmaceutical
6. OPY351 OEC 3 0 0 3 3
Nanotechnology
7. OAE351 Aviation Management OEC 3 0 0 3 3
PERIODS TOTAL
S. COURSE CATE PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
English for Competitive
1. OHS351 OEC 3 0 0 3 3
Examinations
NGOs and Sustainable
2. OMG352 OEC 3 0 0 3 3
Development
Democracy and Good
3. OMG353 OEC 3 0 0 3 3
Governance
Renewable Energy
4. OME353 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
Sustainable
7. OMF353 OEC 3 0 0 3 3
Manufacturing
Electric and Hybrid
8. OAU351 OEC 3 0 0 3 3
Vehicle
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
Introduction to non-
13. OML351 OEC 3 0 0 3 3
destructive testing
14. OMR351 Mechatronics OEC 3 0 0 3 3
15. ORA351 Foundation of Robotics OEC 3 0 0 3 3
Fundamentals of
16. OAE352 OEC 3 0 0 3 3
Aeronautical engineering
Remote Sensing
17. OGI351 OEC 3 0 0 3 3
Concepts
13
18. OAI351 Urban Agriculture OEC 3 0 0 3 3
Drinking Water Supply
19. OEN351 OEC 3 0 0 3 3
and Treatment
Electric Vehicle
20. OEE352 OEC 3 0 0 3 3
technology
Introduction to PLC
21. OEI353 OEC 3 0 0 3 3
Programming
22. OCH351 Nano Technology OEC 3 0 0 3 3
23. OCH352 Functional Materials OEC 3 0 0 3 3
Biomedical
24. OBT352 OEC 3 0 0 3 3
Instrumentation
25. OFD352 Traditional Indian Foods OEC 3 0 0 3 3
Introduction to food
26. OFD353 OEC 3 0 0 3 3
processing
27. OPY352 IPR for Pharma Industry OEC 3 0 0 3 3
28. OTT351 Basics of Textile Finishing OEC 3 0 0 3 3
Industrial Engineering for
29. OTT352 OEC 3 0 0 3 3
Garment Industry
Basics of Textile
30. OTT353 OEC 3 0 0 3 3
Manufacture
Introduction to Petroleum
31. OPE351 Refining and OEC 3 0 0 3 3
Petrochemicals
Energy Conservation and
32. OPE352 OEC 3 0 0 3 3
Management
Basics of Plastics
33. OPT351 OEC 3 0 0 3 3
Processing
34. OEC351 Signals and Systems OEC 3 0 0 3 3
Fundamentals of
35. OEC352 Electronic Devices and OEC 3 0 0 3 3
Circuits
Foundation Skills in
36. OBM351 integrated product OEC 3 0 0 3 3
Development
37. OBM352 Assistive Technology OEC 3 0 0 3 3
38. OMA352 Operations Research OEC 3 0 0 3 3
Algebra and Number
39. OMA353 OEC 3 0 0 3 3
Theory
40. OMA354 Linear Algebra OEC 3 0 0 3 3
Lean Concepts, Tools And
41. OCE353 OEC 3 0 0 3 3
Practices
OPEN ELECTIVES – IV
PERIODS TOTAL
S. COURSE CATE PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
1. OHS352 Project Report Writing OEC 3 0 0 3 3
Advanced Numerical
2. OMA355 OEC 3 0 0 3 3
Methods
14
3. OMA356 Random Processes OEC 3 0 0 3 3
Queuing and Reliability
4. OMA357 OEC 3 0 0 3 3
Modelling
Production and
5. OMG354 Operations Management OEC 3 0 0 3 3
for Entrepreneurs
6. OMG355 Multivariate Data Analysis OEC 3 0 0 3 3
7. OME352 Additive Manufacturing OEC 3 0 0 3 3
New Product
8. OME353 OEC 3 0 0 3 3
Development
Industrial Design & Rapid
9. OME355 OEC 2 0 2 4 3
Prototyping Techniques
Micro and Precision
10. OMF352 OEC 3 0 0 3 3
Engineering
Cost Management of
11. OMF354 OEC 3 0 0 3 3
Engineering Projects
Batteries and
12. OAU352 OEC 3 0 0 3 3
Management 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
Production Planning and
16. OIM353 OEC 3 0 0 3 3
Control
17. OIE353 Operations Management OEC 3 0 0 3 3
18. OSF352 Industrial Hygiene OEC 3 0 0 3 3
19. OSF353 Chemical Process Safety OEC 3 0 0 3 3
Electrical, Electronic and
20. OML352 OEC 3 0 0 3 3
Magnetic materials
Nanomaterials and
21. OML353 OEC 3 0 0 3 3
applications
Hydraulics and
22. OMR352 OEC 3 0 0 3 3
Pneumatics
23. OMR353 Sensors OEC 3 0 0 3 3
24. ORA352 Foundation of Automation OEC 3 0 0 3 3
Concepts in Mobile
25. ORA353 OEC 3 0 0 3 3
Robotics
26. OMV351 Marine Propulsion OEC 3 0 0 3 3
27. OMV352 Marine Merchant Vehicles OEC 3 0 0 3 3
Elements of Marine
28. OMV353 OEC 3 0 0 3 3
Engineering
29. OAE353 Drone Technologies OEC 3 0 0 3 3
Geographical Information
30. OGI352 OEC 3 0 0 3 3
System
Agriculture
31. OAI352 Entrepreneurship OEC 3 0 0 3 3
Development
32. OEN352 Biodiversity Conservation OEC 3 0 0 3 3
Introduction to control
33. OEE353 OEC 3 0 0 3 3
systems
34. OEI354 Introduction to Industrial OEC 3 0 0 3 3
15
Automation Systems
35. OCH353 Energy Technology OEC 3 0 0 3 3
36. OCH354 Surface Science OEC 3 0 0 3 3
Environment and
37. OBT353 OEC 3 0 0 3 3
Agriculture
Fundamentals of Food
38. OFD354 OEC 3 0 0 3 3
Engineering
Food safety and Quality
39. OFD355 OEC 3 0 0 3 3
Regulations
40. OPY353 Nutraceuticals OEC 3 0 0 3 3
Basics of Dyeing and
41. OTT354 OEC 3 0 0 3 3
Printing
42. OTT355 Fibre Science OEC 3 0 0 3 3
Garment Manufacturing
43. OTT356 OEC 3 0 0 3 3
Technology
44. OPE353 Industrial safety OEC 3 0 0 3 3
Unit Operations in Petro
45. OPE354 OEC 3 0 0 3 3
Chemical Industries
Plastic Materials for
46. OPT352 OEC 3 0 0 3 3
Engineers
Properties and Testing of
47. OPT353 OEC 3 0 0 3 3
Plastics
48. OEC353 VLSI Design OEC 3 0 0 3 3
Industrial IoT and Industry
49. OEC354 OEC 2 0 2 4 3
4.0
50. OBM353 Wearable devices OEC 3 0 0 3 3
51. OBM354 Medical Informatics OEC 3 0 0 3 3
Basics of Integrated Water
52. OCE354 OEC 3 0 0 3 3
Resources Management
16
SUMMARY
Non-Credit
8 √ √
/(Mandatory)
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.
17
VERTICALS FOR MINOR DEGREE
(In addition to all the verticals of other programmes)
18
(choice of courses for Minor degree is to be made from any one vertical of other programmes
or from anyone of the following verticals)
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
Foundations of
1. CMG337 PEC 3 0 0 3 3
Entrepreneurship
Team Building &
2. CMG338 Leadership Management PEC 3 0 0 3 3
for Business
Creativity & Innovation in
3. CMG339 PEC 3 0 0 3 3
Entrepreneurship
Principles of Marketing
4. CMG340 PEC 3 0 0 3 3
Management for Business
Human Resource
5. CMG341 Management for PEC 3 0 0 3 3
Entrepreneurs
Financing New Business
6. CMG342 PEC 3 0 0 3 3
Ventures
19
VERTICAL 3: PUBLIC ADMINISTRATION
PERIODS TOTAL
S. COURSE CATE PER WEEK
COURSE TITLE CONTACT CREDITS
NO. CODE GORY
L T P PERIODS
Statistics for
1. CMG349 PEC 3 0 0 3 3
Management
Datamining For Business
2. CMG350 PEC 3 0 0 3 3
Intelligence
Human Resource
3. CMG351 PEC 3 0 0 3 3
Analytics
Marketing And Social
4. CMG352 PEC 3 0 0 3 3
Media Web Analytics
Operation And Supply
5. CMG353 PEC 3 0 0 3 3
Chain Analytics
6. CMG354 Financial Analytics PEC 3 0 0 3 3
20
VERTICAL 5: ENVIRONMENTAL 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
Monitoring and Analysis PEC 3 0 0 3 3
21
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.
22
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.
UNIT IV PROCESSOR 9
Instruction Execution – Building a Data Path – Designing a Control Unit – Hardwired Control,
Microprogrammed Control – Pipelining – Data Hazard – Control Hazards.
23
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.
24
CS3353 FOUNDATIONS OF DATA SCIENCE L T P C
3 0 0 3
COURSE OBJECTIVES:
To understand the data science fundamentals and process.
To learn to describe the data for the data science process.
To learn to describe the relationship between data.
To utilize the Python libraries for Data Wrangling.
To present and interpret data using visualization libraries in Python
UNIT I INTRODUCTION 9
Data Science: Benefits and uses – facets of data - Data Science Process: Overview – Defining
research goals – Retrieving data – Data preparation - Exploratory Data analysis – build the model–
presenting findings and building applications - Data Mining - Data Warehousing – Basic Statistical
descriptions of Data
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
TEXTBOOKS:
1. David Cielen, Arno D. B. Meysman, and Mohamed Ali, “Introducing Data Science”, Manning
Publications, 2016. (Unit I)
25
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)
REFERENCE:
1. Allen B. Downey, “Think Stats: Exploratory Data Analysis in Python”, Green Tea Press,2014.
TEXT BOOK:
1. Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, “Data Structures &
Algorithms in Python”, An Indian Adaptation, John Wiley & Sons Inc., 2021
REFERENCES:
1. Lee, Kent D., Hubbard, Steve, “Data Structures and Algorithms with Python” Springer Edition
2015
2. Rance D. Necaise, “Data Structures and Algorithms Using Python”, John Wiley & Sons,
2011
3. Aho, Hopcroft, and Ullman, “Data Structures and Algorithms”, Pearson Education, 1983.
4. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, “Introduction
to Algorithms", Second Edition, McGraw Hill, 2002.
5. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Fourth Edition, Pearson
Education, 2014
27
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.
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.
LIST OF EXPERIMENTS:
1. Implement simple ADTs as Python classes
2. Implement recursive algorithms in Python
3. Implement List ADT using Python arrays
4. Linked list implementations of List
5. Implementation of Stack and Queue ADTs
6. Applications of List, Stack and Queue ADTs
7. Implementation of sorting and searching algorithms
8. Implementation of Hash tables
9. Tree representation and traversal algorithms
10. Implementation of Binary Search Trees
11. Implementation of Heaps
12. Graph representation and Traversal algorithms
13. Implementation of single source shortest path algorithm
14. Implementation of minimum spanning tree algorithms
COURSE OUTCOMES:
At the end of the course, the student should be able to:
CO1:Implement ADTs as Python classes
CO2:Design, implement, and analyse linear data structures, such as lists, queues, and stacks,
according to the needs of different applications
CO3:Design, implement, and analyse efficient tree structures to meet requirements such as
searching, indexing, and sorting
CO4:Model problems as graph problems and implement efficient graph algorithms to solve them
TOTAL:60 PERIODS
TEXT BOOK:
1. Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, “Data Structures &
Algorithms in Python”, John Wiley & Sons Inc., 2013
REFERENCES:
1. Rance D. Necaise, “Data Structures and Algorithms Using Python”, John Wiley & Sons,
2011
2. Aho, Hopcroft, and Ullman, “Data Structures and Algorithms”, Pearson Education, 1983.
3. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, “Introduction
to Algorithms", Second Edition, McGraw Hill, 2002.
4. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Fourth Edition, Pearson
Education, 2014
29
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
30
CS3362 DATA SCIENCE LABORATORY L T P C
0 0 4 2
COURSE OBJECTIVES:
To understand the python libraries for data science
To understand the basic Statistical and Probability measures for data science.
To learn descriptive analytics on the benchmark data sets.
To apply correlation and regression analytics on standard data sets.
To present and interpret data using visualization packages in Python.
LIST OF EXPERIMENTS:
1. Download, install and explore the features of NumPy, SciPy, Jupyter, Statsmodels and
Pandas packages.
2. Working with Numpy arrays
3. Working with Pandas data frames
4. Reading data from text files, Excel and the web and exploring various commands for doing
descriptive analytics on the Iris data set.
5. Use the diabetes data set from UCI and Pima Indians Diabetes data set for performing the
following:
a. Univariate analysis: Frequency, Mean, Median, Mode, Variance, Standard Deviation,
Skewness and Kurtosis.
b. Bivariate analysis: Linear and logistic regression modeling
c. Multiple Regression analysis
d. Also compare the results of the above analysis for the two data sets.
6. Apply and explore various plotting functions on UCI data sets.
a. Normal curves
b. Density and contour plots
c. Correlation and scatter plots
d. Histograms
e. Three dimensional plotting
7. Visualizing Geographic Data with Basemap
31
CS3452 THEORY OF COMPUTATION L T P C
3 0 0 3
COURSE OBJECTIVES:
To understand foundations of computation including automata theory
To construct models of regular expressions and languages.
To design context free grammar and push down automata
To understand Turing machines and their capability
To understand Undecidability and NP class problems
UNIT 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
32
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.
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
34
CS3492 DATABASE MANAGEMENT SYSTEMS L T P C
3 0 0 3
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
COURSE OUTCOMES:
Upon completion of this course, the students will be able to
CO1:Construct SQL Queries using relational algebra
35
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.
COURSE OUTCOMES:
At the end of this course, the students will be able to:
CO 1: Apply JavaScript, HTML and CSS effectively to create interactive and dynamic websites.
CO 2: Create simple PHP scripts
CO 3: Design and deploy simple web-applications.
CO 4: Create simple database applications.
CO 5: Handle multimedia components
TOTAL:75 PERIODS
TEXT BOOKS
1. Robin Nixon, "Learning PHP, MySQL, JavaScript, CSS & HTML5" Third Edition, O'Reilly
publishers, 2014.
2. Paul Deitel, Harvey Deitel, Abbey Deitel, “Internet & World Wide Web - How to Program”,
5th
edition, Pearson Education, 2012.
REFERENCES:
1. Jeffrey C. Jackson, "Web Technologies--A Computer Science Perspective", Pearson
Education, 2006.
2. James F. Kurose, “Computer Networking: A Top-Down Approach”, Sixth Edition, Pearson
Education, 2012
3. Steven Holzener , “PHP – The Complete Reference”, 1st Edition, Mc-Graw Hill, 2017
4. Fritz Schneider, Thomas Powell , “JavaScript – The Complete Reference”, 3rd Edition, Mc-
Graw Hill Publishers, 2017
5. Bates, “Developing Web Applications”, Wiley Publishers, 2006
37
CS3451 INTRODUCTION TO OPERATING SYSTEMS L T P C
3 0 0 3
COURSE OBJECTIVES:
To understand the basics and functions of operating systems.
To understand processes and threads
To analyze scheduling algorithms and process synchronization.
To understand the concept of deadlocks.
To analyze various memory management schemes.
To be familiar with I/O management and file systems.
To be familiar with the basics of virtual machines and Mobile OS like iOS and Android.
UNIT I INTRODUCTION 7
Computer System - Elements and organization; Operating System Overview - Objectives and
Functions - Evolution of Operating System; Operating System Structures – Operating System
Services - User Operating System Interface - System Calls – System Programs - Design and
Implementation - Structuring methods.
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.
38
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.
39
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.
REFERENCES :
1. R.K. Trivedi, ‘Handbook of Environmental Laws, Rules, Guidelines, Compliances and
Standards’, Vol. I and II, Enviro Media. 38 . edition 2010.
2. Cunningham, W.P. Cooper, T.H. Gorhani, ‘Environmental Encyclopedia’, Jaico Publ.,
House, Mumbai, 2001.
3. Dharmendra S. Sengar, ‘Environmental law’, Prentice hall of India PVT. LTD, New Delhi,
2007.
4. Rajagopalan, R, ‘Environmental Studies-From Crisis to Cure’, Oxford University Press,
Third Edition, 2015.
5. Erach Bharucha “Textbook of Environmental Studies for Undergraduate Courses” Orient
Blackswan Pvt. Ltd. 2013.
40
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.
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
42