AIDS Curriculum Syllabusduring 2020 VISU
AIDS Curriculum Syllabusduring 2020 VISU
SEMESTER: I
Credits
S.NO Course Code Course Title Category CIE SEE Total Marks
L T P C
THEORY
1 19EN101T Communicative English HSMC 50 50 100 2 0 0 2
2 19CH101T Engineering Chemistry BSC 50 50 100 3 0 0 3
3 19MA101T Matrices, Differential and Integral Calculus BSC 50 50 100 3 1 0 4
4 19CS101T Programming for problem solving in C ESC 50 50 100 3 0 0 3
5 19ME101T Engineering Graphics ESC 50 50 100 2 0 4 4
PRACTICAL
6 19CH102L Chemistry Laboratory BSC 50 50 100 0 0 2 1
7 19CS102L C Programming Laboratory ESC 50 50 100 0 0 4 2
8 19EN102L Communicative English Laboratory HSMC 50 50 100 0 0 2 1
Total 20
SEMESTER: II
Credits
S.NO Course Code Course Title Category CIE SEE Total Marks
L T P C
THEORY
1 19MA102T Vector Calculus and Complex Functions BSC 50 50 100 3 1 0 4
2 19PH101T Engineering Physics BSC 50 50 100 3 0 0 3
3 19CS103T Programming for problem solving using Python ESC 50 50 100 2 0 4 4
4 19EE103T Basic Electrical, Electronics and Communication Engineering ESC 50 50 100 2 1 0 3
5 19CS104T Introduction to Information and Computing Technology ESC 50 50 100 2 0 0 3
6 19EN103T Constitution of India MC 50 50 100 2 0 0 0
PRACTICAL
7 19PH102L Physics Laboratory BSC 50 50 100 0 0 2 1
8 19ME104L Workshop Practice ESC 50 50 100 0 0 4 2
9 19EE104L Basic Electrical, Electronics & Communication Engineering ESC 50 50 100 0 0 2 1
Laboratory
10 19TP101L Quantitative Aptitude and Verbal Reasoning EEC 50 50 100 0 0 2 1
Total 22
SEMESTER: III
Credits
S.NO Course Code Course Title Category CIE SEE Total Marks
L T P C
THEORY
1 19MA208T Mathematics for Data Analysis BSC 50 50 100 3 1 0 4
2 19CS201T Data Structures PCC 50 50 100 3 0 0 3
3 19CS202T Digital Logic Circuits ESC 50 50 100 3 1 0 4
4 19IT202T Computer Architecture PCC 50 50 100 3 0 0 3
5 19AD201T Object Oriented Programming Paradigm using C++ and Java PCC 50 50 100 3 0 0 3
6 19PH205T Fundamentals of Nano Science MC 50 50 100 3 0 0 0
PRACTICAL
7 19CS203L Data Structures Laboratory PCC 50 50 100 0 0 4 1
8 19AD202L Object Oriented Programming Paradigm Laboratory PCC 50 50 100 0 0 2 1
9 19PD201L Personality & Character Development MC - - - 2 0 0 0
10 19TP201L Quantitative Aptitude &Behavioral Skills EEC 50 50 100 0 0 2 1
Total 20
SEMESTER: IV
Credits
S.NO Course Code Course Title Category CIE SEE Total Marks L T P C
THEORY
1 19MA209T Queuing Theory and Optimization BSC 50 50 100 3 1 0 4
2 19CS204T Operating systems PCC 50 50 100 3 0 0 3
3 19CS205T Design and Analysis of Algorithms PCC 50 50 100 3 0 1 4
4 19IT205T Database Management Systems PCC 50 50 100 3 0 0 3
5 19AD203T Principles of Artificial Intelligence PCC 50 50 100 3 0 0 3
6 19CH201T Environmental Science and Engineering MC 50 50 100 3 0 0 0
PRACTICAL
7 19CS206L Operating Systems Laboratory PCC 50 50 100 0 0 2 1
8 19IT208L Database Management Systems Laboratory PCC 50 50 100 0 0 2 1
9 19AD204L Artificial Intelligence Laboratory PCC 50 50 100 0 0 2 1
10 19TP202L Quantitative Aptitude & Communication Skills EEC 50 50 100 0 0 2 1
Total 21
SEMESTER: V
Credits
S.NO Course Code Course Title Category CIE SEE Total Marks
L T P C
THEORY
1 19AD301T Machine Learning and its techniques PCC 50 50 100 3 1 0 4
2 19IT204T Object Oriented Software Engineering PCC 50 50 100 3 0 0 3
3 19AD302T Fundamentals of Data Science PCC 50 50 100 3 0 0 3
4 19MA302T Statistics Foundations and Probability Distributions BSC 50 50 100 3 1 0 4
5 Professional Elective I PEC 50 50 100 3 0 0 3
6 Open Elective I OEC 50 50 100 3 0 0 3
PRACTICAL
7 19AD303L Machine Learning Laboratory PCC 50 50 100 0 0 2 1
8 19AD304L Data Science Laboratory PCC 50 50 100 0 0 2 1
9 19TP301L Quantitative Aptitude and Soft Skills EEC 50 50 100 0 0 2 1
Total 23
SEMESTER: VI
Credits
S.NO Course Code Course Title Category CIE SEE Total Marks
L T P C
THEORY
1 19AD305T Data Exploration using R PCC 50 50 100 3 1 0 4
2 19AD306T Artificial Neural Networks PCC 50 50 100 3 1 0 4
3 19AD307T Advanced Artificial Intelligence PCC 50 50 100 3 0 0 3
4 19IT301T Web Technologies PCC 50 50 100 3 0 0 3
5 Professional Elective II PEC 50 50 100 3 0 0 3
6 Open Elective II OEC 50 50 100 3 0 0 3
PRACTICAL
7 19AD308L Data Analytics Laboratory PCC 50 50 100 0 0 2 1
8 19IT304L Web Technologies Laboratory PCC 50 50 100 0 0 2 1
9 19AD309L Internship EEC 100 - 100 - - - 1
10 19AD310L Mini Projects PROJ 100 - 100 0 0 2 1
Total 24
SEMESTER: VII
Credits
S.NO Course Code Course Title Category CIE SEE Total Marks
L T P C
THEORY
1 19AD401T Deep Learning PCC 50 50 100 3 0 0 3
2 19AD402T Big Data Management PCC 50 50 100 3 1 0 4
3 19AD403T Internet of Things PCC 50 50 100 3 0 0 3
4 Professional Elective-III PEC 50 50 100 3 0 0 3
5 Professional Elective-IV PEC 50 50 100 3 0 0 3
6 Open Elective-III OEC 50 50 100 3 0 0 3
PRACTICAL
7 19AD404L Deep Learning Laboratory PCC 50 50 100 0 0 2 1
8 19AD405L Internet of Things Laboratory PCC 50 50 100 0 0 2 1
9 19AD406L Project Phase –I PROJ 50 50 100 0 0 4 2
Total 23
SEMESTER: VIII
Credits
S.NO Course Code Course Title Category CIE SEE Total Marks
L T P C
THEORY
1 Professional Elective-V PEC 50 50 100 3 0 0 3
2 Professional Elective-VI PEC 50 50 100 3 0 0 3
PRACTICAL
3 19AD407L Project Phase –II PROJ 50 50 100 0 0 14 6
12
Total
165
Overall Curriculum Credits
COURSE OBJECTIVES
To equip the students in communication skills from preliminary to
advanced level.
PREREQUISITE
Basic English Knowledge (i.e.) ability to grasp, listen and speak in
English language.
Ability to read and write in English language.
Basic Grammar Skills
COURSE OUTCOMES
PO-10
PO-11
PO-12
PO-1
PO-2
PO-3
PO-4
PO-5
PO-6
PO-7
PO-8
PO-9
CO No.
CO1 - - - - - - - - - 3 - -
CO2 - - - - - - - - - 3 - -
CO3 - - - - - - - - - 3 - -
CO4 - - - - - - - - - 3 - -
CO5 - - - - - - - - - 3 - -
CO6 - - - - - - - - - 3 - -
Note: - 1: Slight 2: Moderate 3: Substantial
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS:
1. Board of Editors. Using English. A Coursebook for Undergraduate
Engineers and Technologists. Orient Blackswan Limited: Hyderabad: 2015.
REFERENCES:
COURSE OBJECTIVES
Engineering chemistry helps to understand the basics principles of chemistry for engineering
applications.
Engineering chemistry makes the student conversant with water treatment techniques, and
basic principles of NanoChemistry.
The knowledge on phase rule and alloys enable the students to understand the basic concepts
involved in the analysis of pure metals and alloys.
The students will have adverse knowledge on types of fuels, calorific value calculations,
manufacture of solid, liquid, gaseous fuels and principles, generation of energy in batteries,
nuclear reactors, solar cells and fuel cells.
PREREQUISITE
Student must have the basic knowledge on Water characteristics, Alloys, Energy devices,
Batteries, fuels and Nano Chemistry
COURSE OUTCOMES
PO-10
PO-11
PO-12
PO-1
PO-2
PO-3
PO-4
PO-5
PO-6
PO-7
PO-8
PO-9
CO No.
CO1 2 3 - - - - - - - - - -
CO2 3 3 - - - - - - - - - -
CO3 3 2 - - - - - - - - - -
CO4 2 3 - - - - - - - - - -
CO5 3 2 - - - - - - - - - -
Note: - 1: Slight 2: Moderate 3: Substantial
Phase Rule – Introduction, definition of termswith examples, One component system – water system
– reduced phase rule – Thermal analysis and cooling curves – two component systems – lead-silver
system – Pattinson process.
between fission and fusion reactions - Light water nuclear reactor for power generation – Breeder
reactor .
UNIT-V NANOCHEMISTRY. 9
Basics -distinction between molecules, nanoparticles and bulk materials; size-dependent properties.
Nanoparticles: nano cluster, nano rod, nanotubes (CNT) and nanowire. Synthesis: precipitation,
thermolysis, hydrothermal, solvothermal, electro deposition, chemical vapour deposition, laser
ablation; Properties and applications in various engineering fields.
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS:
1. Shikha Agarwal, "Engineering Chemistry- Fundamentals and applications", Cambridge
University Press, Delhi, 2015
2. Jain P.C and Monica Jain, “Engineering chemistry”, DhanpatRai Publishing
Company(P) Ltd., New Delhi,2010.
REFERENCES:
3. DaraS.S,UmareS.S,”Engineering chemistry”,S.Chand& Company Ltd., New Delhi
2010.
4. SivasankarB.,,”Engineering chemistry”, Tata McGraw-Hill publishing company Ltd.,
New Delhi,2008
5. B.R.Puri, L.R.Sharma, M.S.Pathania.,"Principles of Physical Chemistry", Vishal
Publishing Company ,2008.
COURSE OBJECTIVE
PREREQUISITE
COURSE OUTCOMES
Blooms
CO. No. Course Outcome
level
At the end of the course students are able
To find Eigen values and Eigenvectors for a square matrix and to convert
CO 1 C3
the quadratic form to canonical form by orthogonal transformation.
PO-10
PO-11
PO-12
PO-1
PO-2
PO-3
PO-4
PO-5
PO-6
PO-7
PO-8
PO-9
CO No.
CO1 2 2
CO2 2 2
CO3 2 2
CO4 2 2
CO5 2 2
Learning Resources
TEXT BOOK
6. Grewal B.S., “Higher Engineering Mathematics”, 43rd Edition, Khanna Publishers,
New Delhi, 2014.
7. Kreyzig E., “Advanced Engineering Mathematics”, 10th Edition, John Wiley and
sons, 2011.
REFERENCE BOOK
COURSE OBJECTIVES
● This course aims at giving adequate exposure to students on the principles of procedural
programming language
● The course is intended to introduce the students to computational thinking and make the
students develop C Programs using basic programming constructs.
● The course will enable the students to apply the fundamentals of C programming to solve
Engineering problems.
.
PREREQUISITE
● Basic Mathematics Skills
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12
CO1 3 - - - - - - - - - - -
CO2 3 - - - - - - - - - - -
CO3 - - 3 - - - - - - - - -
CO4 - - 3 - - - - - - - - -
CO5 - 3 - - - - - - - - - -
CO6 3 - - - - - - - - - - -
CO1 3
CO2 3
CO3 3
CO4 3
CO5 3
CO6 3
UNIT-IV POINTERS 9
Structures and Unions: Defining a Structure – Processing a Structure – User defined data
types (Typedef) – Unions, Files: Opening and Closing a Data File – Reading and writing a
data file – Processing a data file – Unformatted data files – Concept of binary files –
Accessing a file randomly using fseek() &ftell().
Total: 45 Periods
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
1. Sumitabha Das, “Computer Fundamentals & C Programming”, Mc Fraw Hill, 2018.
2. Pradip Dey and Manas Ghosh, “Programming in C”, Second Edition, Oxford
University Press, 2011.
REFERENCES
3. Anita Goel and Ajay Mittal, “Computer Fundamentals and Programming in C”,
Dorling Kindersley (India) Pvt. Ltd., Pearson Education in South Asia, 2011.
4. Byron S Gottfried and Jitendar Kumar Chhabra, “Programming with C”, Tata
McGraw Hill Publishing Company, Third Edition, New Delhi, 2011.
5. Kernighan,B.W and Ritchie,D.M, “The C Programming language”, Second Edition,
Pearson Education, 2006
6. Ashok N. Kamthane, “Computer programming”, Pearson Education, 2007.
COURSE OBJECTIVES
PREREQUISITE
Basic geometrical constructions.
COURSE OUTCOMES
Blooms
CO. No. Course Outcome
level
At the end of the course students are able to
Construct different curves and draw the projection of points and
CO 1 C3
straight lines for given positions.
Draw the projection of planes and simple solids inclined to one or
CO 2 C3
both the planes.
CO 3 Draw the projection of sectional views and development of lateral C3
surfaces of cut solids.
CO 4 Draw the isometric and perspective views of simple and sectioned C3
vertical solids.
CO 5 Construct the plan and sectional elevation of a single-storey building C3
showing the details from foundation to ceiling.
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12
CO1 3 - - - - - - - - 3 - -
CO2 3 - - - - - - - - 3 - -
CO3 3 - - - - - - - - 3 - -
CO4 - - 3 - - - - - - 3 - -
CO5 - - 3 - 3 - - - - 3 - -
Note: - 1: Slight 2: Moderate 3: Substantial
Presented in Board of Studies meeting held on 24.06.2020 (Approved)
Passed in the 1st Academic Council meeting dated 06.08.2020
LEARNING RESOURCES:
TEXT BOOKS
1. Bhatt N.D. and Panchal V.M. “Engineering Drawing”, Charotar Publishing House,
Gujarat – 388 001, 2010.
2. Natarajan, K V. , “Engineering Graphics”, Dhanalakshmi publishers, Chennai, 2019.
REFERENCES
3. Shah, M.B. & Rana B.C., “Engineering Drawing and Computer Graphics”, Pearson
Education, 2008.
4. Basant Agarwal and Agarwal C.M., “Engineering Drawing”, Tata McGraw Hill
Publishing Company Limited, New Delhi, 2008.
5. Narayana, K.L. & P Kannaiah, “Text book on Engineering Drawing”, Scitech
Publishers, Chennai, 2008.
6. (Corresponding set of manuals) CAD Software Theory and User Manuals.
7. S.S Bhavikatti& M.V. Chitawadagi, “Building Planning and Drawing”, I. K.
International Publishing House Pvt. Ltd., Delhi- 110002, 2014.
COURSE OBJECTIVES
To introduce different experiments to test the basic understanding of chemistry
concepts applied in water technology, electrochemistry and Instrumentation methods.
To impart practical skills in water quality parameter analysis, spectrophotometry,
flame photometry and corrosion rate determination.
PREREQUISITE
Basic skills in performing volumetric analysis
COURSE OUTCOMES
Blooms
CO. No. Course Outcome
level
Explain the measurement of conductance of strong acid vs strong base and
CO 1 C3
mixture of acids vs strong base using conductivity meter.
CO 2 Determine the strength of given acid using pH mete C3
PO-11
PO-12
PO-1
PO-2
PO-3
PO-4
PO-5
PO-6
PO-7
PO-8
PO-9
CO No.
CO1 - - - - - - - - - -
3 2
CO2 - - - - - - - - - -
3 2
CO3 - - - - - - - - - -
3 1
CO4 - - - - - - - - - -
2 -
CO5 - - - - - - - - - -
2 -
Note: - 1: Slight 2: Moderate 3: Substantial
LEARNING RESOURCES
REFERENCES
1. Vogel A. I, Textbook of Quantitative Chemical Analysis, Wiley Publications, 8th edition, 2014.
COURSE OBJECTIVES
Blooms
CO. No. Course Outcome
level
CO1 Ilustrate Algorithms, Pseudo Code and Flow Charts
C3
CO2 Make use of various I/O statements, Expressions, decision making
C3
and Looping in C programs
CO3 Develop C programs using Arrays and Strings C3
CO4 Implement concepts of functions and pointers in C programs. C3
CO5 Apply Structures and Union concepts in the real time applications. C4
CO6 Appraise various file handling mechanisms to solve complex
C6
Problems.
CO6 - 3 - - 2 - - - 2 - - -
CO1 3
CO2 3
CO3 3
CO4 3
CO5 3
CO6 3
LIST OF EXPERIMENTS
1. Algorithm, Pseudo code and Flowchart are mandatory for every application
2. Simple C Programs using statements and expressions
3. Solving problems using decision making and looping.
4. Programs using single and multidimensional arrays.
5. Solving simple problems using built-in and user defined String functions.
6. Execute searching and sorting of strings.
7. Programs using built-in and user defined functions
8. Programs using Recursive Function and conversion
9. Simple programs to understand Storage class in C
10. Simple programs using pointers
11. Programs using Dynamic Memory allocation
12. Use structures and unions for solving various applications.
13. Implement various operations of Sequential file.
14. Execute the functions of Random access file.
15. Mini Project: A batch of 3 students can select a topic on their interest and should
involve all the concepts of C programming to the maximum extent in developing the
application.
LEARNING RESOURCES
REFERENCES:
Text Book References:
1. ‘C Programming Absolute Beginner’s Guide (3rd Edition)’ by Greg Perry and Dean
miller.
2. ‘Programming in C’ (Second Edition) by Reema Thareja, Oxford University Press, 2011.
Ritchie
7. ’Programming in ANSI C (7th Edition)’ by E. Balaguruswamy
Website References:
C Programming Tutorial
a. TutorialsPoint
b. Programiz
c. javatpoint
d. W3schools
e. BeginnersBook.com
Presented in Board of Studies meeting held on 24.06.2020 (Approved)
Passed in the 1st Academic Council meeting dated 06.08.2020
COURSE OBJECTIVES
This course will develop the students’ ability
Toprune their note taking skills on lectures and listening passages
To understand meaning of words, phrases and sentences in context and follow the
instructions given
To prepare students to give a simple self-introduction providing basic personal details
To give a 1-2 minute informal presentation about biographical information using
familiarvocabulary and practiced phrases.
PREREQUISITES
Basic English Knowledge (i.e.) ability to listen in English and understand what is
spoken and reply in English
Exposure to native speaker level accent, pronunciation and complex sentence
structure in English.
COURSE OUTCOMES
Blooms
CO. No. Course Outcome
level
At the end of the course students are able to
PO-10
PO-11
PO-12
PO-9
PO-1
PO-2
PO-3
PO-4
PO-5
PO-6
PO-7
PO-8
CO No.
CO1 - - - - - - - - 3 3 - -
CO2 - - - - - - - - 3 3 - -
CO3 - - - - - - - - 3 3 - -
CO4 - - - - - - - - 3 3 - -
CO5 - - - - - - - - 3 3 - -
CO6 - - - - - - - - 3 3 - -
Note: - 1: Slight 2: Moderate 3: Substantial
SYLLABUS
UNIT-II CONVERSATIONS 6
Listening- Telephone Etiquettes Speaking – short talks- greeting–taking leave
Total: 30 Periods
LIST OF EXPERIMENTS
12. Active Listening – Skimming. Scanning Exercises
13. Self-Introduction
14. Role Play
15. Opining on prompts
16. 5-minute Talk
17. Presentation Skills - PPT presentations
18. Group Discussion
19. Dictation and Summarising
20. Credible Talks : Current Affairs
21. Interview Skills -Mock Interview
22.
LEARNING RESOURCES
1. Listenwise.com
2. https://www.eslfast.com
3. EnglishClub.com
4. http://www.bbc.co.uk/learningenglish
5. TalkEnglish.com: Listening Lessons
6. https://www.esl-lab.com
TEXT BOOK
1. Lebaur, Roni, Learn to Listen and Listen to Learn.Pearson Longman, USA:2017
2. Hardman, Emilia, Active Listening 101: How to Turn Down Your Volume to Turn
Up Your Communication Skills
REFERENCE BOOK
COURSE OBJECTIVE
PREREQUISITE
COURSE OUTCOMES
Blooms
CO. No. Course Outcome
level
At the end of the course students are able
CO 1 To apply various techniques in solving differential equations. C3
To find Gradient, divergence and curl of a vector point function and
CO 2 related identities. Evaluation of line, surface and volume integrals C3
using Gauss, Stokes and Green’s theorems and their verification
CO 3 To understand the concepts of Analytic functions and Conformal C3
mapping
CO 4 To evaluate Contour integrals using calculus of residues. C3
To find Laplace transform and Inverse Laplace transform of simple
CO 5 functions, properties and application to differential equations with C3
constant coefficients.
PO-10
PO-11
PO-12
PO-1
PO-2
PO-3
PO-4
PO-5
PO-6
PO-7
PO-8
PO-9
CO No.
CO1 2 2
CO2 2 2
CO3 2 2
CO4 2 2
CO5 2 2
Note: - 1: Slight 2: Moderate 3: Substantial
Learning Resources
TEXT BOOKS
1. Grewal B.S., “Higher Engineering Mathematics”, Khanna Publishers, New Delhi,
43rd Edition, 2014.
2. Kreyszig Erwin, "Advanced Engineering Mathematics", John Wiley and Sons, 10th
Edition, New Delhi, 2016.
REFERENCES
3. Bali N., Goyal M. and Watkins C., “Advanced Engineering Mathematics”, 7th
Edition, Firewall Media (An imprint of Lakshmi Publications Pvt., Ltd.,), New Delhi,
2009.
4. Jain R.K. and Iyengar S.R.K., “Advanced Engineering Mathematics”, 3rd Edition,
Narosa Publications, New Delhi , 2007.
5. O’Neil, P.V. “Advanced Engineering Mathematics”, Cengage Learning India Pvt.,
Ltd, New Delhi, 2007.
6. Veerarajan T, “Engineering Mathematics” Tata McGraw Hill Publication,2017
7. Wylie, R.C. and Barrett, L.C., “Advanced Engineering Mathematics”, 6th Edition, Tata
McGraw Hill Education Pvt. Ltd, New Delhi, 2012.
8. Dr. Balaji. G, “Vector Calculus and Complex Functions”, 1st Edition, G. Balaji
Publishers, December 2019.
COURSE OBJECTIVES
To understand the elastic behavior of materials, rigidity modulus of torsion pendulum,
beam and cantilever.
To know the applications of crystal structures and their properties.
To design an engineering materials by understanding the thermal behavior of
materials.
To understand the characteristics of laser are being applied in Industrial and medical
fields.
To enhance the knowledge on semiconductor and magnetic materials help to
manipulate the logical operations.
To understand the dual nature of radiation and Schrödinger’s equations are the basics
for the study of quantum physics.
PREREQUISITE
Student must have the basic knowledge on elasticity, crystal structures, modes of heat
transfer, semiconductor, magnetic material and basic properties of light.
COURSE OUTCOMES
CO. No. Course Outcome Blooms level
PO-11
PO-12
PO-1
PO-2
PO-3
PO-4
PO-5
PO-6
PO-7
PO-8
PO-9
CO No.
CO1 3 2
CO2 3 1
CO3 3 2
CO4 3 1
CO5 3 2
Note: - 1: Slight 2: Moderate 3: Substantial: C3-Apply, Analysis, Evaluate
Presented in Board of Studies meeting held on 24.06.2020 (Approved)
Passed in the 1st Academic Council meeting dated 06.08.2020
Learning Resources
TEXT BOOKS
REFERENCE BOOKS
3. R. Murugesan , “ Properties of Matter”, I Edition,S. Chand Publication, 1994
4. Charles Kittell, “ Introduction to solid state physics” , Wiley &Sons , 2004,
5. KiruthigaSivaprasath, R.Murugesan, “ Thermal Physics”, II Edition, Chand
Publications,2004,
6. ShatendraShrama& Jyotsna Sharma, “Engineering physics”, I Edition, Pearson
Publications,2018.
7. S. Salivahanan, A. Rajalakshmi, S. Karthie and N.P. Rajesh, “Physics for Electronics
Engineering and Information Science”, McGraw Hill Publication, 2018.
8. P. Mani, “ A text book on Engineering Physics”, Dhanam Publication, 2019.
COURSE OBJECTIVES
PREREQUISITE
Basic mathematical skills
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
Solve and debug simple computational
CO 1 C3
problems.
Apply the various control structures and
CO 2 C3
functions in Python
CO 3Create Python programs using strings and lists. C6
Evaluate the compound data using Python
CO 4 C5
Tuples, Sets and Dictionaries.
Design python programs to implement various
CO 5 C6
file operations.
Compose the exception handling in python
CO 6 C6
programs
MAPPING WITH PROGRAM OUTCOMES
LAB EXPERIMENTS
LEARNING RESOURCES:
TEXT BOOKS
REFERENCES
COURSE OBJECTIVES
To learn the fundamental laws, theorems of electrical circuits and also to analyze
them.
To study the basic principles of transformer and its performance.
To explain the fundamentals of semiconductor and applications.
To impart knowledge of communication systems.
PREREQUISITE
COURSE OUTCOMES
CO. BLOOMS
COURSE OUTCOME LEVEL
NO.
At the end of the course students will be able to
CO 1 Apply basic circuit laws to solve DC circuits C3
CO 2 Solve single phase AC circuits C3
PO-10
PO-11
PO-12
PO-1
PO-2
PO-3
PO-4
PO-5
PO-6
PO-7
PO-8
PO-9
CO No.
CO1 3 1 - - - - - - - - 1 -
CO2 3 1 - - - - - - - - 1 -
CO3 3 - - - - - - - - - 1 -
CO4 3 - - 2 2 - - - - - 1 -
CO5 3 - - 2 2 - - - - - 1 -
CO6 3 - - 2 2 - - - - - 1 -
Note: - 1: Slight 2: Moderate 3: Substantial
SYLLABUS ( Total contact hours = 45 Periods, No. of Credits = 3 )
UNIT-I DC Circuits 9
Electrical circuit elements (R, L and C), voltage and current sources, Resistance in series and
parallel, Star Delta transformation, Kirchhoff’s current and voltage laws, Mesh and Nodal
Analysis.
Total: 45 Periods
LEARNING RESOURCES:
TEXT BOOK:
1. D P Kothari and I.J Nagarath, “Basic Electrical Engineering”, McGraw Hill
Education(India) Private Limited, Fourth edition, 2019.
2. R Muthusubramanian, S Salivahanan, “Basic Electrical And Electronics
Engineering”, Tata McGraw Hill Education(India) Private Limited, 2010
REFERENCES :
3. D P Kothari and I.J Nagarath, “Basic Electrical Engineering”, McGraw Hill
Education(India) Private Limited, Fourth edition, 2019.
4. R Muthusubramanian, S Salivahanan, “Basic Electrical And Electronics
Engineering”, Tata McGraw Hill Education(India) Private Limited, 2010
COURSE OBJECTIVES
● To introduce the concept of Internet, Networks and its working principles.
● To Introduce the Concept Client side and Server Side Scripts.
● To Understand Various Applications related to Information and Computing
Technology.
PREREQUISITE
● Basics of Computer and Components.
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO 1 Illustrate the working of WWW and C3
CO 2 Interpret the usage of Internet Servers C3
CO 3 Design and Deploy Web Sites C3
CO 4 Develop interactive server side scripts C5
CO 5 Describe the basics of Networking C4
CO 6 Describe basics of Mobile Communication C4
PO-5
PO-10
PO-11
PO-12
PO-1
PO-2
PO-3
PO-6
PO-7
PO-8
PO-9
CO No.
CO1 3 - - - - - - - - - - -
CO2 3 - - - - - - - - - - -
CO3 - - 3 - - - - - - - - -
CO4 - - 3 - - - - - - - - -
CO5 3 - - - - - - - - - - -
CO6 3 - - - - - - - - - - -
.
.
MAPPING WITH PROGRAMME SPECIFIC OUTCOMES
UNIT-II HTML 6
Need for Scripting-Client and Server Side Scripting-HTML Document Structure-Basic
Formatting Tags-Hyperlinks and Images-Audio and Video-Tables-Forms-Frames
UNIT-IV Networking 6
Fundamental computer network concepts - Types of computer networks - Network layers -
TCP/IP model - Wireless Local Area Network - Ethernet - WiFi - Network Routing -
Switching - Network components
Total: 30 Periods
LEARNING RESOURCES :
TEXT BOOKS
REFERENCES
COURSE OBJECTIVES
This course will develop the students’ ability
To understand the need for a constitution and appreciate the rights of citizens of India.
To offer an insight into the constitutional foundations and institutional praxes of
Indian democracy.
To focus on conceptual framework of constitutional designs and institutional
functioning.
To provide details of Indian institutional foundations, their arrangements with the lens
of Indian experience as well as changing trends in the normativities of
constitutionalism.
PREREQUISITES
PO-10
PO-11
PO-12
PO-1
PO-2
PO-3
PO-4
PO-5
PO-6
PO-7
PO-8
PO-9
CO No.
CO1 - - - - - - - - - 3 - -
CO2 - - - - - - - - - 3 - -
CO3 - - - - - - - - - 3 - -
CO4 - - - - - - - - - 3 - -
CO5 - - - - - - - - - 3 - -
Note: - 1: Slight 2: Moderate 3: Substantial
SYLLABUS
LEARNING RESOURCES
TEXT BOOK
1. Singh, Abhay Prasad. Murari, Krishna. Constitutional Government and Democracy in
India, Pearson Education : India : 2019
REFERENCE BOOKS
PREREQUISITE
Student must have the basic knowledge on measuring instruments screw gauge,
vernier calipers and spectrometers.
COURSE OUTCOMES
Blooms
CO. No. Course Outcome
level
At the end of the course students are able to ,
Explore the knowledge of young’s modulus by non uniform
CO 1 C4
bending to the girders.
CO 2 Test the bad conductor by measuring the thermal conductivity and C4
study the thermal properties of a material.
CO 3 Demonstrate the rigidity modulus of the wire and moment of inertia C4
of the disc.
CO4 Apply physics principles of optics and distinguish the spectrum of C4
colours using grating.
CO 5 Demonstrate the total internal reflection in optical fibres by C4
calculating acceptance angle.
PO-10
PO-11
PO-12
PO-1
PO-2
PO-3
PO-4
PO-5
PO-6
PO-7
PO-8
PO-9
CO No.
CO1 3 2
CO2 3 2
CO3 3 1
CO4 2
CO5 2
Note: - 1: Slight 2: Moderate 3: Substantial
SYLLABUS
Learning Resources
REFERENCES
1. M.N.Srinivasan, S.Balasubramanian, R.Ranganathan, Text book of Practical
S.Chand&Sons.II Revise edition 2017
2. P. Mani, Engineering Physics, Dhanam Publications, 2017
3. R. Suresh and Dr. C. Kalyanasundaram, Physics laboratory, Sri Krishna Publication,
2017.
COURSE OBJECTIVES
PREREQUISITE
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12
CO1 3 - - - - - - - - - - -
CO2 3 - - - - - - - - - - -
CO3 3 - - - - - - - - - - -
CO4 3 - - - - - - - - - - -
CO5 3 - - - - - - - - - - -
Note: - 1: Slight 2: Moderate 3: Substantial
LIST OF EXPERIMENTS
Carpentry:
1. Study of the joints in roofs, doors, windows and furniture.
2. Hands-on-exercise: Wood work, joints (Cross lap, T-lap and Dove tail) by sawing,
planning and cutting.
Plumbing Works:
1. Study of pipeline joints, its location and functions: valves, taps, couplings, unions,
reducers, elbows in household fittings.
2. Study of plumbing line for basic water supply and sewage.
3. Hands-on-exercise: Basic pipe connections – Mixed pipe material (GI and PVC)
connection – Pipe connections with different joining components.
4. Demonstration of plumbing requirements of high-rise buildings.
Welding:
1. Preparation of butt joints, lap joints and T- joints by Shielded metal arc welding.
2. Demonstration on Gas welding.
Basic Machining:
1. Simple Turning and Taper turning
2. Drilling Practice
Demonstration on:
1. Smithy operations, upsetting, swaging, setting down and bending.
2. Foundry operations like mould preparation for simple components.
3. Fitting – Exercises – Preparation of square fitting and V – fitting models.
1. Residential house wiring using switches, fuse, indicator, lamp and energy meter.
2. Fluorescent lamp wiring
3. Stair case wiring
4. Measurement of electrical quantities – voltage, current, power 7 power factor in RLC
circuit
5. Measurement of energy using single phase energy meter
6. Measurement of resistance to earth of an electrical equipment.
7. Study of protective devices – SFU, MCB, ELCB, Live wire detector
LEARNING RESOURCES
REFERENCES
1. Jeyachandran K, Natarajan S and Balasubramanian S, “A Primer on Engineering
Practices Laboratory”, Anuradha Publications, 2007.
2. Jeyapoovan T, Saravanapandian M and Pranitha S, “Engineering Practices Lab Manual”,
Vikas Publishing House Private Limited, 2006.
3. Rajendra Prasad A and Sarma P.M.M.S., “Workshop Practice”, Sree Sai Publication,
2002.
4. Bawa H.S, “Workshop Practice”, Tata McGraw Hill Publishing Company Limited, 2007.
5. Kannaiah P and Narayana K.L, “Manual on Workshop Practice”, Scitech Publications.,
1999.
COURSE OBJECTIVES
To solve and simulate the fundamental laws of electric circuits
To study the characteristics of transformer
To study and simulate the characteristics of diodes and transistors
To study the various modulation techniques
PREREQUISITE
Basic Electrical, Electronics and Communication Engineering fundamentals
COURSE OUTCOMES
Blooms
CO. No. Course Outcome
level
Solve and simulate the circuits using the concepts of Ohm’s and
CO 1 C3
Kirchhoff’s laws
CO 2 Plot the characteristics of Transformer C3
LIST OF EXPERIMENTS
LIST OF EQUIPMENTS
S. No. Component or Equipment Required number
1. Bread boards 30
2. PN junction diode 6
3. Transistors 6
4. Single Phase Transformer 2
5. Ammeter A.C and D.C 10
6. Voltmeters A.C and D.C 10
7. Wattmeters LPF and UPF 4
8. Cathode Ray Oscilloscopes 2
9. Dual Regulated power supplies 6
10. A.C. Signal Generators 2
LABORATORY MANUAL
1. Laboratory Manual – “Basic Electrical, Electronics and Communication
Engineering Laboratory,” Department of EEE.
PREAMBLE
PREREQUISITES
Basic English Knowledge (i.e.) ability to grasp, listen and speak in English language.
Ability to read and write in English language.
Basic Grammar Skills
Basic school Math skills
COURSE OUTCOMES
Blooms
CO. No. Course Outcome
level
At the end of the course students are able to
CO 1 Express ideas using words in a clearly understandable manner. C2
CO 2 Construct Grammatically Correct sentence to speak and write C4
Apply the knowledge of numbers to evaluate the averages, and
CO 3 compare two quantities using ratio and proportion and calculate C4
percentages.
Evaluate the concepts of speed, time and distance, understand timely
CO 4 completion using time and work and implement business C5
transactions using profit and loss.
Understand the family relationships and the ability to arrange things
CO 5 in an orderly fashion, ability to visualize directions and understand C4
the logic behind a sequence.
CO6 Apply the knowledge of coding and decoding C3
PO-10
PO-11
PO-12
PO-1
PO-2
PO-3
PO-4
PO-5
PO-6
PO-7
PO-8
PO-9
CO No.
CO1 - - - - - - - - - 3 - -
CO2 - - - - - - - - - 3 - -
CO3 - - - - - - - - - 3 - -
CO4 - - - - - - - - - 3 - -
CO5 - - - - - - - - - 3 - -
CO6 - - - - - - - - - 3 - -
Average - - - - - - - - - 3 - -
Note: - 1: Slight 2: Moderate 3: Substantial
REFERENCE BOOK
1. Abhijit Guha, Quantitative Aptitude for Competitive Examinations (English) 5th Edition,
CAT and other MBA Entrance Examinations 4th Edition, Pearson 2013.
COURSEOBJECTIVE
To understand the basic concepts in probability and one & two dimensional random
variables.
Use graph models and their connectivity, to study the interconnection network
architecture in related to Computer Science.
Apply the Counting Principles to compute the running time algorithm.
Understand the basic concepts of Optimization and apply the same to problems in
Machine Learning.
Apply the concepts of basic principles of combinatorics and its applications.
COURSEOUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students are
able to
Understand the fundamental knowledge of the concepts of
CO1 probability and one dimensional random variable C3
Understand the basic concepts in Number Theory and its
CO2 Applications in Data Science. Solve problems under the C3
counting principle.
CO3 Solve problems using basic Graph Theory C3
Discuss the concepts and properties, Fundamental theorem
CO4 of arithmetic and Euclidean algorithm C3
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
No.
CO1 - - - - - - - - 2 - - - 3 -
CO2 - - - - - - - - - 3 - - 3 -
CO3 - - - - - - - - 2 - - - 3 -
CO4 3 - 2 - - - - - - - - - 3 -
CO5 3 - 2 - - - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
TEXTBOOK
1. Koshy,T.,―ElementaryNumberTheorywithApplications‖,ElsevierPublications,NewDelhi,
2002.
2. J. A. Bondy and U. S. R. Murty, Graph Theory and Applications, The Macmillan Press Ltd.
New York1982.
3. Johnson. R.A. and Gupta. C.B., "Miller and Freund‘s Probability and Statistics for
Engineers", Pearson Education, Asia, 7th Edition,2007.
REFERENCES
4. Johnson. R.A. and Gupta. C.B., "Miller and Freund‘s Probability and Statistics for
Engineers", Pearson Education, Asia, 7th Edition,2007.
5. Devore.J.L.,"ProbabilityandStatisticsforEngineeringandtheSciences‖,Cengage
Learning, New Delhi, 8th Edition,2012.
6. Niven, I., Zuckerman. H.S., and Montgomery, H.L., ―An Introduction to Theory of
Numbers, John Wiley and Sons , Singapore,2004.
7. Kenneth H. Rosen and K. Krithivasan, Discrete. Mathematics and Its Applications With
Combinatorics and Graph Theory. McGraw-Hill Companies Seventh Edition2011.
Presented in Board of Studies meeting held on 18.06.2021(Approved)
Passed in the Academic Council meeting dated 10.07.2021
R-2019 UG Syllabus for 19CS201T
PREREQUISITE
Programming for Problem solving inC
COURSEOBJECTIVES
To implement the ADTs stack, queue, and dequeue,list
Learn the performance of the implementations of non linear datastructures.
To understand the performance of various sorting and searchingalgorithm
COURSEOUTCOMES
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
No.
CO1 - - 3 - - - - - - - - - 3 -
CO2 3 - - - - - - - - - - - 3 -
CO3 - - 2 3 - - - - - - - - 3 -
CO4 - 3 - 2 - - - - - - - - 3 -
CO5 - 3 - - - - - - - - - - 3 -
CO6 - 3 - - - - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
Total: 45 Periods
LEARNING RESOURCES:
TEXTBOOKS
REFERENCES
PREREQUISITE
Workshop Practices Lab
COURSEOBJECTIVES
COURSEOUTCOMES
CO1 3 - - - - - - - - - - - 3 -
CO2 - 3 3 - - - - - - - - - 3 -
CO3 - 3 3 - - - - - - - - - 3 -
CO4 - 3 3 - - - - - - - - - 3 -
CO5 2 3 - - - - - - - - - - 3 -
CO6 - - 3 - - - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
Total: 60 Periods
LEARNING RESOURCES:
TEXTBOOKS
REFERENCES
3. Donald D. Givone, Digital Principles and Design‖, Tata Mc Graw Hill, 2003.
4. Charles H. Roth Jr, Larry L. Kinney, Fundamentals of Logic Design, Seventh
Edition, CENGAGE Learning, 2013.
5. G. K. Kharate, Digital Electronics, Oxford University Press,2012.
Blooms
CO. Course Outcome
level
No.
At the end of the course students are able to
CO 1 Explain basic structure of computers, operations and instructions. C2
CO 2 Design arithmetic and logic unit. C6
CO 3 Analyze pipelined execution and design control unit. C4
CO 4 Analyze parallel processing architectures. C4
CO 5 Examine performance of various memory systems C4
CO 6 Organize various I/O communications. C3
UNIT-IV PARALLELISM 9
Introduction - Memory Hierarchy – memory technologies: SRAM, DRAM, Flash and Disk
Memory – Cache Memory: Mapping Functions – Performance Considerations Virtual
Memory,TLB‘s – Accessing I/O devices – Interrupts – Direct Memory Access: Bus
Arbitration – Bus Structure – Bus operation.
Total: 45 Periods
LEARNING RESOURCES
TEXTBOOKS
1. David A. Patterson and John L. Hennessy, Computer Organization and Design: The
Hardware/Software Interface, Fifth Edition, Morgan Kaufmann / Elsevier,2014.
2. Carl Hamacher, ZvonkoVranesic, SafwatZaky and NaraigManjikian,
Computer Organization and Embedded Systems, Sixth Edition, Tata McGraw
Hill,2012.
REFERENCES
PREREQUISITE
COURSEOBJECTIVES
To introduce the principles of OOPs and operator overloading.
To understand the concepts of inheritance, files and exception handling.
To learn generic programming.
To understand object oriented concepts and characteristics of Java.
To learn programs using inheritance, packages, interface and multithreaded program.
COURSEOUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
Apply the concepts of object-oriented programming for
CO 1 C3
solving real time complex problems
CO 2 Illustrate the concepts of overloading and code reusability C4
Appraise error handling techniques using exception handling
CO 3 C5
for better performance
Construct programs using templates and file handling
CO 4 C4
concepts.
CO 5 Develop java programs using OOPs principle C5
CO6 Design applications using java library C6
Overview of Java – Data Types and Arrays - Introducing Classes and Methods –
Constructors – Overloading Methods – Access Control – Nested and Inner Class -
Inheritance – Using Super – Method Overriding – Abstract Class – Final Keyword –
Packages – Member Access – Importing Packages - Interfaces – Exception Handling –
Exception Types – Multiple Catch –User Defined Exceptions.
UNIT V ADVANCEDJAVAPROGRAMMING 9
Total: 45 Periods
LEARNINGRESOURCES:
TEXTBOOKS
1. The Complete Reference C++, 5th Edition, Herbert Scheldt, Tata McGraw Hill,2012.
2. Herbert Schildt, Java: The Complete Reference, Eleventh Edition, 11th Edition, McGraw Hill,2018.
REFERENCES
1. Programming with C++, 7th edition, E. Balagurusamy, Tata McGraw Hill,2017.
2. CayS.HorstmanandGaryCornell,―CoreJavaVolumeI—Fundamentals‖,10thEd(Core
Series), Prentice Hall,2015.
PREREQUISITE
Basic knowledge about nano particles and theirdimensions.
COURSEOBJECTIVES
To learn about the basis of nanomaterial science and their structures.
To understand the preparation technique of nanomaterial.
To study the characterisation of nanomaterial.
To know the wide application of nano materials in nano electronic devices and
nano in bio-technology.
COURSEOUTCOMES
TEXTBOOKS
1. T. Pradeep, Nano: The Essentials, 1st Ed., McGraw Hill,2007.
2. T.Pradeep, A Textbook of Nanoscience and NanoTechnology, 5th Ed., McGraw Hill,2018.
REFERENCEBOOKS
3. Chattopadhyay, Banerjee, Introduction to Nanoscience and Nanotechnology, PHI,
2009.
4. C. Binns, Introduction to Nanoscience and Nanotechnology, Vol. 14, John Wiley & 59
M.Sc.(Physics) 2017-18 Sons,2010.
5. P.C. Poole Jr, and F.J. Owens, Introduction to Nanotechnology, John Wiley & Sons,
2003.
6. R. Kelsall, I.W. Hamley, and M. Geoghegan, Nanoscale Science and Technology, John
Wiley & Sons,20
PREREQUISITE
C Programming Laboratory
COURSEOBJECTIVES
The aim of this laboratory is
To develop programming skills in design and implementation of data structures
and their applications.
COURSEOUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO1 Apply appropriate data structure for given problem C3
CO2 Develop knowledge on the applications of Linear data C3
structures
CO3 Develop tree structure for an appropriate application. C6
CO4 Build a program to find the shortest path using graph C6
technology
CO5 Develop algorithms using searching and sorting for various C6
applications.
CO6 Apply appropriate hash functions that result in a collision free C3
scenario for data storage and retrieval.
LIST OFEXPERIMENTS
1. Singly and doubly linked lists- Student InformationSystem
2. Application of List - Represent a polynomial as a linked list and write
functions for polynomialaddition.
3. Stack and Queue -operations.
4. Applications ofstack- Evaluating arithmetic expressions and postfix, infix
and prefix notation
5. Application of Binary tree - expression tree. Produce its pre-order, in-order,
and post- ordertraversals.
6. Binary search tree – Construct rooms with the no of seats available and Finda
Presented in Board of Studies meeting held on 18.06.2021(Approved)
Passed in the Academic Council meeting dated 10.07.2021
R-2019 UG Syllabus for 19CS203L
LEARNING RESOURCES
TEXTBOOK
PREREQUISITE
C Programming Laboratory
COURSEOBJECTIVE
The aim of this laboratory is to
To practice design and implementation of C++ program with classes and objects as real-
worldentities
To practice reusability using inheritance inC++
To develop programs using C++ templates, exception handling and fileconcepts.
To develop programs usingMultithreading
Explore exception handling techniques and itsimplementation
Build a simple application using File streamconcepts
COURSE OUTCOMES
Blooms
CO. No. Course Outcome
level
Apply the concepts of object-oriented programming for solving real
CO 1 C3
time complex problems
CO 2 Construct programs using classes, objects and operator overloading C3
CO 3 Develop programs using inheritance C6
Construct programs using exception handling mechanism
CO 4 C3
Compile java programs using package, interface and
CO 5 C6
Multithreading
CO 6
Develop various applications using java library frameworks C6
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 3 - - - - - - - - - 3 -
CO2 3 3 2 - - - - - - - - - 3 -
CO3 3 3 3 - - - - - - - - - 3 -
CO4 3 3 2 - - - - - - - - - 3 -
CO5 3 3 3 - - - - - - - - - 3 -
CO6 3 3 3 - - - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
LIST OFEXPERIMENTS
1. Programs using C++ functions and overloadedfunctions
2. Simple C++ programs using classes andobjects
3. Execute C++ programs with constructors anddestructors
4. Programs using operatoroverloading
5. Test type conversions for various datatypes
6. Design C++ programs using all the types ofinheritances
7. Programs using class and functiontemplates
8. Experiment with sequential fileaccess.
9. Programs using exception handlingmechanisms
10. Programs using classes and objects inJava
11. Execute Java programs with various string handlingmethods
12. Design java programs usingInterfaces
13. Construct user definedpackages
14. Develop java programs using multithreadedprograms
15. Programs using java exception handlingmechanisms
16. Programs using Collectionsframework.
LEARNING RESOURCES:
REFERENCES:
1. The Complete Reference C++, 5th Edition, Herbert Scheldt, Tata McGraw Hill,2012.
2. Herbert Schildt, Java: The Complete Reference, Eleventh Edition, 11th Edition, McGraw Hill,2018
PREREQUISITE
Student must have the basic knowledge in:1. Communication 2.Mathematics.
COURSEOBJECTIVES
• To set the attitude and behavior of the students towards theirgoal
• To familiarize them with behavioral skills and professional etiquettes andcommunication.
• To create awareness and enhance students QuantitativeAptitude
COURSEOUTCOMES
BLOOMS
CO. No. COURSE OUTCOME
LEVEL
At the end of the course the student will be able to
CO 1 Develop self esteem, social etiquettes and C2
CO 2 Set professional goals C2
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 - - - - - - - - 2 - - - - -
CO2 - - - - - - - - 3 - - - -
CO3 - - - - - - - - 2 - - - - -
CO4 3 - 2 - - - - - - - - - - -
CO5 3 - 2 - - - - - - - - - - -
CO6 3 - 2 - - - - - - - - - - -
Note: - 1: Slight 2: Moderate 3: Substantial
SYLLABUS
UNIT-IICOMMUNICATION (6hrs)
Concept, characters and process of communication - 7c‘s of communication - Verbal and non
verbal communication - Body language -Art of meeting and greeting- Making Effective
conversation.
LIST OFACTIVITIES
1. Self AnalysisActivities 4. Classroom
2. Role Play TeachingonQuantitativ
3. Extempore eAptitude
5. Practice sessions for
QuantitativeAptitude
LEARNINGRESOURCES-ONLINE
1. Positivepsychology.com
2. www.skillsyouneed.com
3. www.businessjargons.com
4. www.careerbless.com/aptitude/qa
5. www.indiabix.com/aptitude
LEARNINGRESOURCES
PREREQUISITE
Basic concepts of probability and knowledge of Differential and IntegralCalculus.
COURSEOBJECTIVE
COURSEOUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students are able to
CO1 2 2 - - - - - - - - - - 3 -
CO2 2 2 - - - - - - - - - - 3 -
CO3 2 2 - - - - - - - - - - 3 -
CO4 2 2 - - - - - - - - - - 3 -
CO5 2 2 - - - - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
Total : 60 Periods
LEARNING RESOURCES:
TEXTBOOKS
1. TahaH.A.―OperationsResearch‖,PearsonEducation,Asia,8thEdition,2007.
2. Gross.D.andHarris.C.M,―FundamentalsofQueueingTheory‖,WileystudentEdition,2004
REFERENCES
3. HiraandGupta―ProblemsinOperationsResearch‖,S.ChandandCo.,2008
4. J. Nocedal and S. J. Wright, Numerical Optimization. New York: Springer Science
Business Media,2006
5. Winston.W.L.―OperationsResearch‖,FourthEdition,Thomson–Brooks/Cole,2003
PREREQUISITE
Computer Architecture
COURSEOBJECTIVES
COURSEOUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO 1 Apply basic concepts and functions of operating systems. C3
Analyse the concepts of scheduling algorithms and
CO 2 C4
deadlock algorithms.
CO 3 Compare and contrast various memory management schemes. C4
CO 4 Examine functionality of file systems. C4
CO 5 Develop virtualization and administrative tasks on Linux
C3
Servers.
CO6 Compare Mobile IOS and Android architecture C4
UNIT-I OPERATINGSYSTEMOVERVIEW 9
Computer System Overview- Operating system overview-objectives and functions,
Evolution of Operating System- Computer System Organization- Operating System
Structure and Operations- System Calls, System Programs, OS Generation and System
Boot. Processes – Process Concept, Process Scheduling, Operations on Processes.
UNIT-II PROCESSMANAGEMENT 9
CPU Scheduling – Scheduling criteria, Scheduling algorithms, Threads- Overview,
Multithreading models, Threading issues; Process Synchronization – The critical-
section problem, Semaphores, Classic problems of synchronization, Monitor- Deadlock
- Deadlock characterization, Methods for handling deadlocks, Deadlock prevention-
Avoidance- detection- Recovery.
UNIT-IV FILESYSTEMS 9
Mass Storage system – Overview of Mass Storage Structure, Disk Structure, Disk
Scheduling and Management; File-System Interface – File concept, Access methods,
Directory Structure, Directory organization, File system mounting and protection; File
System Structure, Directory implementation, Allocation Methods, Free Space
Management, Swap space management.
PREREQUISITE
DataStructures
OBJECTIVES
To understand the basic idea of algorithm and analysis techniques.
To understand the behaviour of various computer algorithms.
Become familiar with the different algorithm design techniques.
To understand the limitations of Algorithmicpower.
Learn to apply the design techniques in solving various kinds of problems
COURSEOUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students are able to
CO 1 Analyse algorithms for various computing problem. C4
Analysis of various algorithm using brute force and Divide and
CO 2 C4
conquer technique with application to real time environment
Analysis of various algorithm using Dynamic Programming and
CO 3 Greedy technique with application to real time environment. C4
Analysis of Iterative Improvement approach.
CO 4 C4
BLOOMS
CO. No. COURSE OUTCOME LEVEL
At the end of the course students are able to
Illustrate fundamental database concepts, relational database
CO 1 C2
concepts and SQL fundamentals
CO 2 Classify ER diagrams and analyze the necessity of normalization. C2
Analyse transaction properties, concurrency and
CO 3 C4
recovery mechanisms.
Apply different storage techniques and necessary query
CO 4 C3
optimization for developing applications.
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 - - - - - - - - - - - 3 -
CO2 - 3 - - - - - - - - - - 3 -
CO3 - 3 - - - - - - - - - - 3 -
CO4 3 - - - - - - - - - - - 3 -
CO5 - 3 - - - - - - - - - - 3 -
CO6 - 3 - 2 - - - - - - - - 3 -
UNITIII TRANSACTIONS 9
Transaction Concepts – ACID Properties – Schedules – Need for Concurrency Control –
Concurrency control techniques– Lock based and timestamp based Protocols – Serializability -
Deadlock –Transaction Recovery-Log based Recovery, Immediate, Deferred, Shadow paging.
Case Study – IRCTC Web Site working Model – Transaction Processing.
UNITIV IMPLEMENTATIONTECHNIQUES 9
RAID– Indexing – B+ tree Index Files – Hashing- Static Hashing – Dynamic Hashing – Query
Processing Overview Syntax Check, Semantic Check– Algorithms for SELECT and JOIN
operations – Query optimization using Heuristics and Cost Estimation – Evaluation Plan for
Query – Query Parsing and Translation- Case Study - Data Structure techniques inDBMS.
TEXTBOOKS
1. Abraham Silberschatz, HenryF.Korth, S. Sudharshan, ―DatabaseSystemConcepts‖,Sixth
Edition, Tata McGraw Hill,2011.
2. RamezElmasri, ShamkantB. Navathe, ―Fundamentals of DatabaseSystems‖, Sixth
Edition, Pearson,2011.
PREREQUISITE
Must have knowledge in probability concepts, bayes theorem and basic problemsolving.
COURSEOBJECTIVE
● Study the basic concepts of Artificial Intelligence
● To know how the knowledge can be represented in Artificial Intelligence
● Study the basic concepts of planning methods such as STRIPS.
● Study how the Uncertainty can be implemented using Probability concepts
● To know the basic machine learning algorithms.
COURSEOUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students are able to
Describe basic exposition to the goals and methods and techniques of
CO 1 C3
Artificial Intelligence using Problem solving.
Express how the knowledge can be represented through Artificial
CO 2 Intelligence. C2
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
No.
CO1 3 3 - - - - - - - - - - 3 -
CO2 3 3 - - - - - - - - - - 3 -
CO3 3 3 - - - - - - - - - - 3 -
CO4 3 3 - - - - - - - - - - 3 -
CO5 3 3 - - - - - - - - - - 3 -
CO6 3 3 1 - - - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
UNIT-I- PROBLEMSOLVINGMETHODOLOGY 9
Introduction to Artificial intelligence – Agents – Problem solving and examples -Problem
formulation – uninformed search strategies – heuristics–informed search strategies – constraint
satisfaction problem. Case study: problem solving as a Data scientist.
UNIT III-PLANNINGMETHODS 9
Planning with state-space search – partial-order planning – planning graphs – planning and
acting in the real world – STRIPS-KSTRIPS.case study: Case study: cake problem and shoe
socks problem.
UNITIV-UNCERTAINITY 9
Uncertainty – review of probability - probabilistic Reasoning – Bayesian networks – Dempster
shafer Theory – Rule value Approach-Certaintyfactors. Hidden Markov Model.casestudy : Tooth
ache problem and Burglary and alarm problem.
TEXTBOOKS
1. S.RusselandP.Norvig,―ArtificialIntelligence–AModernApproach‖,SecondEdition,PearsonEducation,
2003.
REFERENCES
2. DavidPoole,AlanMackworth,RandyGoebel,‖ComputationalIntelligence:Alogicalapproach‖, Oxford
University Press,2004.
3. G.Luger,―ArtificialIntelligence:StructuresandStrategiesfor complexproblemsolving‖,FourthEdition,
Pearson Education,2002.
4. J. Nilsson, ―Artificial Intelligence: A new Synthesis‖, Elsevier Publishers,1998.
CO.NO.
COURSE OUTCOME BLOOMS
LEVEL
At the end of the course students are able to
Discuss the structure and functional components of various ecosystem
CO 1 and explain the role of biodiversity that sustain life and their C3
conservation strategies.
Ability to identify environmental pollution problems and interpret its
CO 2 C3
consequences.
Interpret the available natural resources and explain the role of
CO 3 individual in the conservation of natural resources. C3
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
No.
CO1 3 2 - - - - - - - - - - - -
CO2 3 - - - - - - - - - - - - -
CO3 3 2 - - - - - - - - - - - -
CO4 2 - - - - - - - - - - - - -
CO5 2 - - - - - - - - - - - - -
Note: - P1r:eSselnigtehdt i2n:BM
oaord
d eorfaStetu3
di:eS
sumbesetta
inngtihaelld on 18.06.2021(Approved)
Passed in the Academic Council meeting dated 10.07.2021
R-2019 UG Syllabus for 19CH201T
COURSEOBJECTIVES
COURSEOUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO 1 Explaint basic services of system calls C4
CO 2 Construct and implement various CPU Scheduling Algorithm C3
Develop and implement deadlock avoidance and Detection
CO 3 C3
Algorithms
Construct programs to demonstrate inter-process
CO 4 C3
Communication
CO 5 Explain page replacement algorithms and disk Scheduling
C4
Algorithms
CO6 Demonstrate File organization and file allocation strategies C2
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 - - - 2 - - - 2 - - - 3 -
CO2 - - 3 - 2 - - - 2 - - - 3 -
CO3 - - 3 - 2 - - - 2 - - - 3 -
CO4 - - 3 - 2 - - - 2 - - - 3 -
CO5 - - 3 - 2 - - - 2 - - - 3 -
CO6 - - 3 - 2 - - - 2 - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
LIST OFEXPERIMENTS
1. Basics of UNIX commands and shellprograms
2. Implement few UNIX commands using systemcalls
3. CPU Scheduling Algorithms for stack and queueApplication.
4. Semaphores andIPC.
5. Bankers Algorithm for DeadlockAvoidance
6. Threading & Synchronization Application for Reader WriterProblem
7. Memory Allocation Methods for fixed partition
a)FirstFit
b) WorstFit
c) BestFit
8. Paging Technique of MemoryManagement
9. Page ReplacementAlgorithms
a) FIFO
b) LRU
c) LFU
COURSEOUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
CO 1 Illustrate and Apply DDL, DML, DCL and TCL commands. C2
Apply Integrity constraints required for the application and retrieve
CO 2 C3
the data using simple, nested and join queries
Apply views, sequences and integrity constraints required for
CO 3 C3
various applications
CO 4 Build PL/SQL programs for data manipulation and data definition C3
Analyze use of triggers, cursors, goto, exception handling, functions
CO 5 C4
and procedures.
CO 6 Develop database applications as an individual and/or team
C6
member using frontend and backend tools with engineering
ethics principles.
LIST OFEXPERIMENTS
LEARNING RESOURCES:
TEXTBOOK
PREREQUISITE
COURSEOBJECTIVE
● Design and implement the various methods of problem solving using computationalintelligence
● Design an Expert system for any domainconcepts.
● Adopt the appropriate AI methods to solve a givenproblem.
● To represent the knowledge and inferencing in python andJess.
● To implement the different algorithms to solve a particularproblem
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students are able to
Implement appropriate AI methods and techniques to
CO 1 C3
solve a given problem.
CO 2 Implement and build an Methodology of different algorithms C2
on a problem.
CO 3 Represent knowledge and perform inferencing using Python and JESS C3
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
No.
CO1 3 3 3 - - - - - - - - - 3 -
CO2 3 3 3 - - - - - - - - - 3 -
CO3 3 3 3 - - - - - - - - - 3 -
CO4 3 3 3 - - - - - - - - - 3 -
CO5 3 3 3 - - - - - - - - - 3 -
CO6 3 3 3 - - - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
LIST OFEXPERIMENTS
S.NO PROGRAMS
1 Study of PROLOG. Write the following programs usingPROLOG
2 Write a program to Implement 8 queensproblem
3 Implement the depth first search.and best first search using water jugproblem
4 Implement.Min max procedure game playing usingpython/jess
5 Implement 8-puzzle problem using best firstsearch
6 Implement Robot (traversal) problem using means EndAnalysis
7 Implement Goal stack planning usingpython/jess
8 Implement Monkey banana problem usingcsp
9 Solve 8 Puzzle problem using availableconstraing
10 Solve Map coloring problem using constraint satisfactionproblem.
11 Implement Dempster shafer usingPython./jess
12 Implement the forward chaining and backward chaining usingpython/jess
13 Implement the Expert system in education usingJess
LEARNING RESOURCES:
TEXT BOOKS
PREREQUISITE
Student must have the basic knowledge in:1. Communication 2.Mathematics.
COURSEOBJECTIVES
• To improve students‘ Communication and Soft skills needed for them
to succeed as a Professional.
• To orient the students towards the placementprocess.
• To train students in Quantitative Aptitude and general mathematicalskills.
COURSEOUTCOMES
BLOOMS
CO. COURSE OUTCOME
LEVEL
NO.
At the end of the course, the students will be able to
Demonstrate public speaking skills, such as GD, debate and
CO 1 C3
Extempore
CO 2 Prepare Resumes and answer confidently in telephonic interviews C2
CO 3 Demonstrate Self-confidence and self reliance in mock and real C3
Interviews
CO 4 Apply the basic concepts of arithmetic and the ability to find the C3
speed and distance and the time taken in the flow of any liquid
CO 5 Apply the logical reasoning in choosing the right conclusion about C3
date and time
CO 6 Interpret the statements using logics and symbols. C3
CO
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
No.
CO1 - - - - - - - - 3 3 - - - -
CO2 - - - - - - - - 2 2 - - - -
CO3 - - - - - - - - 3 3 - - - -
CO4 3 - - 3 - - - - - - - - - -
CO5 3 - - 3 - - - - - - - - - -
CO6 3 - - 3 - - - - - - - - - -
Note: - 1: Slight 2: Moderate 3: Substantial
SYLLABUS
PREREQUISITE
COURSE OBJECTIVES
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 2 - - - - - - - - - 3 -
CO2 3 3 2 - - - - - - - - - 3 -
CO3 3 3 2 - - - - - - - - - 3 -
CO4 3 3 2 - - - - - - - - - 3 -
CO5 3 3 2 - - - - - - - - - 3 -
CO6 3 3 2 2 2 - - - - - - - 3 2
Note: - 1: Slight 2: Moderate 3: Substantial
Linear methods – Regression -Classification –Perceptron and Neural networks – Decision trees
– Support vector machines – Probabilistic models –Case Study: Spam Email detection.
LEARNING RESOURCES
TEXT BOOKS
1. Ameet V Joshi, Machine Learning and Artificial Intelligence, Springer Publications,
2020
2. Trevor Hastie, Robert Tibshirani, Jerome H. Friedman ,The Elements of Statistical
Learning, Springer Publications ,second edition,2017.
REFERENCES
3. Christopher M. Bishop, Pattern Recognition and Machine Learning, Springer
Publications, 2011.
4. Stuart Jonathan Russell, Peter Norvig, John Canny, Artificial Intelligence: A Modern
Approach, Prentice Hall, 2020.
5. Machine Learning Dummies, John Paul Muller, Luca Massaron, Wiley Publications,
2021.
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO 1 Compare different process models. C4
Identify Concepts of requirements engineering and Analysis Modeling.
CO 2 C3
CO 3 Apply fundamentals concepts of object oriented Design C3
CO 4 Apply systematic procedure for software design C3
CO 5 Evaluate errors with various testing techniques C5
CO6 Evaluate project schedule, estimate project cost and effort required
C5
CO1 - 3 - - - - - - - - - - 3
CO2 - 3 - - - - - - - - - - 3
CO3 3 - - - - - - - - - - - 3
CO4 3 - - - - - - - - - - - 3
CO5 - 3 - - - - - - - - - - 3
CO6 3 - 2 - - - - - - 2 - 3
Note: - 1: Slight 2: Moderate 3: Substantial
Total: 45 Periods
LEARNING RESOURCES:
TEXT BOOKS
REFERENCES
PREREQUISITE
Python programming
COURSE OBJECTIVES
Will gain knowledge in the basic concepts of Data Analysis
To acquire skills in data preparatory and preprocessing steps
To understand the mathematical skills in statistics
To learn the tools and packages in Python for data science
To gain understanding in classification and Regression Model
To acquire knowledge in data interpretation and visualization techniques.
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 2 - - - - - - - - - 3 -
CO2 3 3 2 - - - - - - - - - 3 -
CO3 3 3 2 - - - - - - - - - 3 -
CO4 3 3 2 2 2 - - - - - - - 3 -
CO5 3 3 2 2 2 - - - - - - - 3 -
CO6 3 3 2 2 2 - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
UNIT I INTRODUCTION 9
Need for data science – benefits and uses – facets of data – data science process – setting the
research goal – retrieving data – cleansing, integrating, and transforming data – exploratory
data analysis – build the models – presenting and building applications
Visualization with matplotlib – line plots – scatter plots – visualizing errors – density and
contour plots – histograms, binnings, and density – three dimensional plotting – geographic
data – data analysis using statmodels and seaborn – graph plotting using Plotly – interactive
data visualization using Bokeh
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
1. David Cielen, Arno D. B. Meysman, and Mohamed Ali, “Introducing Data Science”,
Manning Publications, 2016. (first two chapters for Unit I)
2. Robert S. Witte and John S. Witte, “Statistics”, Eleventh Edition, Wiley Publications,
2017. (Chapters 1–7 for Units II and III)
3. Jake VanderPlas, “Python Data Science Handbook”, O’Reilly, 2016. (Parts of chapters 2–4
for Units IV and V).
REFERENCES
4. Allen B. Downey, “Think Stats: Exploratory Data Analysis in Python”, Green Tea Press,
2014.
PREREQUISITE
Python Programming
COURSE OBJECTIVE
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 3 3 3 - - - - - - - 3 -
CO2 3 3 3 3 3 - - - - - - - 3 -
CO3 3 3 3 3 3 - - - - - - - 3 -
CO4 3 3 3 3 3 - - - - - - - 3 -
CO5 3 3 3 3 3 - - - - - - - 3 -
CO6 3 3 3 3 3 2 2 - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
LIST OF EXPERIMENTS
1. Implement the concept of decision trees with suitable data set from real world problem
and classify the data set to produce new sample.
2. Detecting Spam mails using Support vector machine
3. Implement facial recognition application with artificial neural network
4. Implement k-Nearest Neighbour algorithm to classify the iris data set
5. Implement character recognition using Multilayer Perceptron
6. Implement the non-parametric Locally Weighted Regression algorithm in order to fit data
points. Select appropriate data set for your experiment and draw graphs.
7. Implement sentiment analysis using random forest optimization algorithm
8. Write a program to construct a Bayesian network considering medical data. Use this
model to demonstrate the diagnosis of heart patients using standard Heart Disease Data
Set. You can use Java/Python ML library classes/API.
9. Choose best machine learning algorithm to implement online fraud detection
10. Study and implement amazon toolkit: Sagemaker
11. Mini-project: students work in team on any socially relevant problem that needs a
machine learning based solution, and evaluate the model performance.
PREREQUISITE
Python
COURSE OBJECTIVES
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 3 3 3 - - - - - - - 3 -
CO2 3 3 3 3 3 - - - - - - - 3 -
CO3 3 3 3 3 3 - - - - - - - 3 -
CO4 3 3 3 3 3 2 2 - - - - - 3 -
CO5 3 3 3 3 3 - - - - - - - 3 -
CO6 3 3 3 3 3 - - - - - - - 3 -
LIST OF EXPERIMENTS
REFERENCES:
PREREQUISITE
Student must have the basic knowledge in: 1. English Language 2. Mathematics
COURSE OBJECTIVES
To equip the students with the required soft skills that would instill confidence and
courage in them, to take up new opportunities in their career.
To train students in Quantitative Aptitude, general mathematical skills and soft skills.
COURSE OUTCOMES
CO 6 Apply coding and decoding to the programs and interpret the data. C3
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 - - - - - - - - - 1 - - 2 2
CO2 - - - - - - - - 2 2 - - 2 2
CO3 - - - - - - - - 1 1 - - 2 2
CO4 - - - 2 - - - - - - - - 2 2
CO5 - - - 2 - - - - - - - - 2 2
CO6 - - - 3 - - - - - - - - 2 2
Note: - 1: Slight 2: Moderate 3: Substantial
Networking: social network paradigm - Tools for gathering, analyzing, and interpreting data
for professional growth- Conflict resolution: Seeking win-win solution, becoming conflict
resolution expert, developing trust and integrity
Seating Arrangement, Blood relationship – some quick techniques to eliminate the wrong
options – Format of problems based on family tree – suggested method – Backtracking,
Syllogism.
Opening of cubes, Mirror images of capital letters –Mirror images of small letters – Mirror
images of Numbers, Geometrical images, Outcome of games; betting games.
Figure Series, Shortest Paths, Coding, Decoding; Data Interpretation – Types: Tables,
Graphs Line- graph, Bar graph, Cumulative Bar graph, Combination graph, Pie charts.
Total: 30Periods
LIST OF ACTIVITIES
1. Team building games
2. Case Studies
3. Building social media presence
4. Classroom instruction on Quantitative Aptitude
5. Practice sessions on Quantitative Aptitude
TEXT BOOKS
1. Dr.Aggarwal,R.S.,Quantitative Aptitude for Competitive Examinations (English)
7th edition, S Chand Publishing ,2015.
2. Sherfield,R.M; Montgomery,R.J and Moody,P,G(2010) Developing Soft Skills.
4th edition, New Delhi: Pearson Publications.
3. Pillai, Sabina and Fernandez, Agna, Soft Skills & Employability Skills, 1st edition,2017,
Cambridge University Press, New Delhi.
PREREQUISITE
Data Science
COURSE OBJECTIVES
COURSE OUTCOMES
CO3 Apply various variable and row filters in R for cleaning data C3
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 2 - - - - - - - - - - 3 -
CO2 3 2 - - - - - - - - - - 3 -
CO3 3 2 3 - - - - - - - - - 3 -
CO4 3 2 3 - - - - - - - - - 3 -
CO5 3 2 3 - - - - - - - - - 3 -
CO6 3 2 3 - - - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
The Seven Stages of Visualizing Data - Getting Started with Processing - Mapping - Time Series
- Connections and Correlations - Scatterplot Maps - Trees, Hierarchies, and Recursion -
Networks and Graphs – Acquiring Data – Parsing Data.
Introduction to R and RStudio - The Basics of Data Exploration - Loading Data into R -
Transforming Data and processing using basic commands.
Total: 60 Periods
LEARNING RESOURCES
TEXT BOOKS
1. Catherine Marsh, Jane Elliott, Exploring Data: An Introduction to Data Analysis for
Social Scientists, Wiley Publications, 2nd Edition, 2008. (Unit I and II)
2. Visualizing Data: Exploring and Explaining Data with the processing Environment, O
Reily Publications, 2007. (Unit-III)
3. Eric Pimpler, Data Visualization and Exploration with R, Geo Spatial Training service,
2017 .(Unit-IV)
4. Claus.O.Wlike, Fundamentals of Data Visualization, A primer on making informative
and compelling Figures, O’Reily Publications, 2019. (Unit-V)
REFERENCES
PREREQUISITE
Machine Learning
COURSEOBJECTIVES
To understand the biological neural network and to model equivalent neuron models.
To understand the architecture, learning algorithm and issues of various feed forward and
feedback neural networks..
COURSEOUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 3 - - - - - - - - - 3 -
CO2 3 3 3 - - - - - - - - - 3 -
CO3 3 3 3 - - - - - - - - - 3 -
CO4 3 3 3 - - - - - - - - - 3 -
CO5 3 3 3 - - - - - - - - - 3 -
CO6 3 3 3 - - - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
Presented in Board of Studies meeting held on 31.05.2022 (Approved)
Passed in the Academic Council meeting dated…………..
Form No.CD 02 C Rev.No.00 Effective Date: 1/06/19
R-2019 UG Syllabus for 19AD306T
LEARNING RESOURCES:
TEXT BOOKS
1. Neural Networks a Comprehensive Foundations, Simon Haykin, PHI edition. 2015
REFERENCES
PREREQUISITE
COURSE OBJECTIVES
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 2 - - - - - - - - - 3 -
CO2 3 3 2 - - - - - - - - - 3 -
CO3 3 3 2 - - - - - - - - - 3 -
CO4 3 3 2 - - - - - - - - - 3 -
CO5 3 3 2 - - - - - - - - - 3 -
CO6 3 3 2 - - - - 2 - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
Acting under uncertainty – Bayesian inference – naïve bayes models Probabilistic reasoning –
Bayesian networks – exact inference in BN – approximate inference in BN – causal networks.
Probabilistic reasoning over time – time and uncertainty – inference in temporal models –
Hidden Markov Models – Kalman filters – Dynamic Bayesian networks Probabilistic
programming.
Basis of utility theory – utility functions – Multiattribute utility functions – decision networks – value of
information – unknown preferences Sequential decision problems – MDPs – Bandit problems – partially
observable MDPs Multiagent environments – non-cooperative game theory – cooperative game theory –
making collective decisions.
Statistical learning theory – maximum-likelihood parameter learning – naïve bayes models – generative
and descriptive models – continuous models – Bayesisn parameter learning – Bayesian linear regression –
learning Bayesian net structures – density estimation EM Algorithm – unsupervised clustering – Gaussian
mixture models – learning Bayes net parameters – learning HMM – learning Bayes net structures with
hidden variables.
Learning from rewards – passive reinforcement learning – active reinforcement learning – generalization
in reinforcement learning – policy search – inverse reinforcement learning – applications Robots – robotic
perception – planning movements – reinforcement learning in robotics – robotic frameworks --
applications of robotics-Philosophy, ethics, and safety of AI – the future of AI.
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
1. Stuart Russel and Peter Norvig, “Artificial Intelligence: A Modern Approach”, Fourth
Edition, Pearson Education, 2020.
REFERENCES
PREREQUISITE
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 3 - - - - - - - - - 3 -
CO2 3 3 3 - - - - - - - - - 3 -
CO3 3 3 3 - - - - - - - - - 3 -
CO4 3 3 3 - - - - - - - - - 3 -
CO5 3 3 3 2 2 - - - - - - - 3 -
CO6 3 3 3 2 2 - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
HTML5: Elements- Headings – Link – Images – Special Characters and Horizontal Rule – Lists
- Tables – Forms – Form Input Types, CSS3: Inline, Embedded, External Style Sheets -
Positioning elements – Box Model and Text Flow – Drop Down Menus – Text Shadows –
Rounded Corners – Box Shadows – Image Borders – Animations – Transitions and
Transformations.
jQuery: Syntax – Selectors – Events – Effects – jQuery HTML – Traversing – CSS – DOM,
Bootstrap4: Overview – Environment Setup – Layout – Grid System – Components, Servlets:
Features – Servlet Life Cycle – Servlet Configuration – Creating a Sample Servlet –
HttpServletRequest and HttpServletResponse – Session Tracking Mechanism – Login
Application using Session Tracking
JSP: JSP Life Cycle – JSP Basic tags and Implicit objects – JavaBeans and Action Tags – JSTL
Core Tags – JSTL Formatting Tags – Implementing JSTL Tags
XML: Basics – Structuring Data – XML Namespaces – Document Type Definitions (DTD) –
XML Schema – XSL – XSLT – XML Document Object Model: Parsing XML documents using
DOM and SAX
LEARNING RESOURCES
TEXT BOOKS
1. Paul Deitel, Harvey Deitel, Abbey Deitel, “Internet and World Wide Web How to Program”,
5th Edition, Pearson Publication, 2012
2. “Web Technologies”, Black Book, DreamTech Press,2020
REFERENCES
PREREQUISITE
COURSE OBJECTIVE
To study and write simple programs using the basic packages for handling data
To do various sampling and T,Z,Anova test in various samples
To perform case study and design a system
To demonstrate Time Series Analysis in any real time application.
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 3 - - - - - - - - - 3 -
CO2 3 3 3 - - - - - - - - - 3 -
CO3 3 3 3 - - - - - - - - - 3 -
CO4 3 3 3 - - - - - - - - - 3 -
CO5 3 3 3 2 2 - - - - - - - 3 -
CO6 3 3 3 2 2 - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
LIST OF EXPERIMENTS
1. Study of data analysis using MS-Excel(Prerequisite)
2. Study of basic Syntaxes in R
3. Implementation of vector data objects operations
4. Implementation of matrix, array and factors and perform va in R
5. Implementation and use of data frames in R
6. Create Sample (Dummy) Data in R and perform data manipulation with R
7. Study and implementation of various control structures in R
8. Data Manipulation with dplyr package
9. Data Manipulation with data.table package
10. Study and implementation of Data Visualization with ggplot2
11. Study and implementation data transpose operations in R
HARDWARE:
PREREQUISITE
COURSE OBJECTIVE
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 3 - - - - - - - - - 3 -
CO2 3 3 3 - - - - - - - - - 3 -
CO3 3 3 3 - - - - - - - - - 3 -
CO4 3 3 3 - - - - - - - - - 3 -
CO5 3 3 3 2 2 - - - - - - - 3 -
CO6 3 3 3 2 2 - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
LIST OF EXPERIMENTS
1. Create a web page using frames, tables, forms, hyperlinks, lists and images.
2. Create a web page with the following using HTML5 (i) To embed an image map in a web
page (ii) To fix the hot spots (iii) Show all the related information when the hot spots are
clicked.
3. Design a website using all types of Cascading Style Sheets.
4. Write JavaScript program to make a simple calculator.
5. Write JavaScript program for login and registration form validation.
COURSE OBJECTIVES
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3- - - - - - - - - - - 3 -
CO2 - - - - - - - - - - - - - -
CO3 - 3 - - - - - - - - - - 3 -
CO4 - - - - - - - - - 3 - - - -
CO5 3 3 3 - - 3 - - - 3 3 3 3 -
CO6 3 3 3 - - - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
GUIDELINES
1. The Internship shall carry 100 marks and shall be evaluated through Continuous internal
evaluation only.
2. At the end of Internship, the student shall submit a detailed report on the Internship
undergone and a certificate from the organization concerned. The evaluation will be made
based on this report and a Viva-Voce Examination, conducted internally by a three member
Departmental Committee constituted by the HOD.
3. A photo copy of the certificates (issued by the Organization) submitted by the student shall
be attached to the mark list and sent to COE by the HOD with due recommendation
Total: 15 Days
COURSE OBJECTIVE
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 - - 3 - - - 3 3 - 3 - 3 3
CO2 - 3 - 3 - - 3 3 3 - - - 3 3
CO3 - 3 - - 3 - 3 - 3 - 3 - 3 -
CO4 - - 3 - 3 - - - 3 - - 3 3 -
CO5 - - - - - - - 3 3 - - - 3 -
CO6 - - - 3 - 3 - 3 3 3 3 - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
GUIDELINES
1. The mini project work is to be conducted by a group of two or three students
2. Each group will be associated with a subject Incharge/ mini project mentor. The group
should meet with the concerned faculty during Laboratory hours and the progress of work
discussed must be documented.
3. Each group can select the application based on their interested domains (Network
Security, Cloud Computing, IOT, Data Science, Block Chain Technology, Web App
Development, Mobile App Development, or any preferred technology).
4. The students should do survey for the identified problem statement.
5. Each group will identify the Hardware and software requirement for their mini project
problem statement.
6. Perform Design, Implementation and Validation for the selected application
7. Three reviews needs to be conducted.
8. A detailed report is to be prepared as per guidelines given by the Department.
9. Final review will be conducted.
Total: 30 Periods
PREREQUISITE
Artificial Intelligence
COURSE OBJECTIVES
Students are will be able
● To provide the basis of Neural networks and Deep Learning
● To provide the basis of challenges of gradient descent and handling it.
● To design convolutional neural network
● To design recurrent neural network
● To design a deep neural network
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO1 Construct a deep neural network. C3
PSO2
PO10
PO11
PO12
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 - - - - - - - - - 3 -
CO2 3 3 3 - - - - - - - - - 3 -
CO3 3 3 3 - - - - - - - - - 3 -
CO4 3 3 3 - - - - - - - - - 3 -
CO5 3 3 3 - - - - - - - - - 3 -
CO6 3 3 3 - - - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
TEXT BOOKS
1. Ian Goodfellow, Yoshua Bengio, Aaron Courville, ``Deep Learning'', MIT Press, 2016
2. Stone, James. (2019). Artificial Intelligence Engines: A Tutorial Introduction to the
Mathematics of Deep Learning, Sebtel Press, United States, 2019
REFERENCES
3. Vance, William , Data Science: A Comprehensive Beginners Guide to Learn the Realms of
Data Science (Hardcover - 2020), Joiningthedotstv Limited
4. Wani, M.A., Raj, B., Luo, F., Dou, D. (Eds.), Deep Learning Applications, Volume
3,Springer Publications 2022
5. Charu C. Aggarwal, ``Neural Networks and Deep Learning: A Textbook'', Springer
International Punlishing, 2018.
PREREQUISITE
Artificial Intelligence
COURSE OBJECTIVES
Students are will be able
● To provide the basis of Neural networks and Deep Learning
● To provide the basis of challenges of gradient descent and handling it.
● To design convolutional neural network
● To design recurrent neural network
● To design a deep neural network
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
Describe big data and use cases from selected business
CO1 C3
domains.
CO2 Explain NoSQL big data management C3
CO3 Install, configure, and run Hadoop and HDFS C3
CO4 Perform map-reduce analytics using Hadoop. C3
Use Hadoop related tools such as HBase, Cassandra, Pig, and
CO5 C3
Hive for big data analytics.
PSO2
PO10
PO11
PO12
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 - - 3 - - - - - - - - - 3 -
CO2 3 - - - - - - - - - - - 3 -
CO3 - - 3 - - - - - - - - - 3 -
CO4 - - 3 - - - - - - - - - 3 -
CO5 - - 3 - - - - - - - - - 3 -
CO6 - - 3 - - - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
What is big data – why big data – convergence of key trends – unstructured data – industry
examples of big data – web analytics – big data and marketing – fraud and big data – risk and
big data – credit risk management – big data and algorithmic trading – big data and
healthcare – big data in medicine – advertising and big data – big data technologies –
introduction to Hadoop – open source technologies – cloud and big data – mobile business
intelligence – Crowd sourcing analytics – inter and trans firewall analytics.
Introduction to NoSQL – aggregate data models – aggregates – key-value and document data
models – relationships – graph databases – schemaless databases – materialized views –
distribution models – sharding – master-slave replication – peer-peer replication – sharding
and replication – consistency – relaxing consistency – version stamps – map-reduce –
partitioning and combining – composing map-reduce calculations.
Data format – analyzing data with Hadoop – scaling out – Hadoop streaming – Hadoop pipes
– design of Hadoop distributed file system (HDFS) – HDFS concepts – Java interface – data
flow – Hadoop I/O – data integrity – compression – serialization – Avro – file-based data
structures.
MapReduce workflows – unit tests with MRUnit – test data and local tests – anatomy of
MapReduce job run – classic Map-reduce – YARN – failures in classic Map-reduce and
YARN – job scheduling – shuffle and sort – task execution – MapReduce types – input
formats – output formats.
LEARNING RESOURCES:
TEXT BOOKS
1. Michael Minelli, Michelle Chambers, and AmbigaDhiraj, "Big Data, Big Analytics:
Emerging Business Intelligence and Analytic Trends for Today's Businesses", Wiley, 2013.
2. Eric Sammer, "Hadoop Operations", O'Reilley, 2012.
PREREQUISITE
COURSE OBJECTIVES
COURSE OUTCOMES
CO5 Illustrate data analytics and use cloud offerings related to IoT. C3
PSO1
PO10
PO11
PO12
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 - - - - - - - - - - - -
CO2 3 2 2 - - - - - - - - - 3
CO3 - - 3 - - - - - - - - 3
CO4 3 2 3 - - - - - - - - - -
CO5 - 3 3 - - - - - - - - 3
CO6 3 - 3 - - - - - - - - - 3
IoT Access Technologies: Physical and MAC layers, Network Layer: IP versions,
Constrained Nodes and Constrained Networks – Optimizing IP for IoT: From 6LoWPAN to
6Lo, Routing over Low Power and Lossy Networks – Application Transport Methods:
Supervisory Control and Data Acquisition – Application Layer Protocols: CoAP and MQTT.
Structured Vs Unstructured Data and Data in Motion Vs Data in Rest – Role of Machine
Learning– No SQL Databases – Amazon Web Services for IoT - Sky Net IoT Messaging
Platform - Case Study on Smart Parking and Air Pollution Monitoring.
Cisco IoT system - IBM Watson IoT platform – Manufacturing - Converged Plantwide
Ethernet Model (CPwE) – Power Utility Industry – Grid Blocks Reference Model - Smart and
Presented in Board of Studies meeting held on31.05.2022 (Approved)
Passed in the 1st Academic Council meeting dated………
Form No.CD 02 C Rev.No.00 Effective Date: 1/06/19
R-2019 UG Syllabus for 19AD403T
Connected Cities: Layered architecture, Smart Lighting, Smart Parking Architecture and
Smart Traffic Control.
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
1. Arshdeep Bahga, Vijay Madisetti, “Internet of Things - A hands - on approach”,
Universities Press, 2015.
REFERENCES
2. Alan C. Gillies, “Software Quality: Theory and Management”, International Thomson
Computer Press, 2011.
3. Mordechai Ben-Menachem “Software Quality: Producing Practical Consistent Software”,
International Thompson Computer Press,2014.
PREREQUISITE
Artificial Intelligence
COURSE OBJECTIVE
COURSE OUTCOMES
PSO2
PO10
PO11
PO12
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 1 - - - - - - - - - - 2 -
CO2 3 3 2 - - - - - - - - - 3 -
CO3 3 2 3 - - - - - - - - - 2 1
CO4 3 2 - - - - - - - - - - 3 1
CO5 3 2 1 - - - - - - - - - 2 -
CO6 3 2 1 - - - - - - - - - 2 -
LIST OF EXPERIMENTS
1. Solving XOR problem using Multilayer perceptron
2. Implement character and Digit Recognition using ANN.
3. Implement the analysis of X-ray image using autoencoders
4. Implement Speech Recognition using NLP
5. Develop a code to design object detection and classification for traffic analysis using
CNN
6. Implement online fraud detection of share market data using any one of the data
analytics tools.
7. Implement image augmentation using deep RBM.
8. Implement Sentiment Analysis using LSTM.
9. Mini Project: Number plate recognition of traffic video analysis.
Hardware/Software Requirements:
• Understanding on Working of Colab and Transfer Learning Networks • High end
GPU Systems ( Huge Computation)
REFERENCES
1. Wani, M.A., Raj, B., Luo, F., Dou, D. (Eds.), "Deep Learning Applications", Volume 3,
Springer Publications 2022.
2. Stone, James. (2019), " Artificial Intelligence Engines: A Tutorial Introduction to the
Mathematics of Deep Learning", Sebtel Press, United States, 2019.
PREREQUISITE
COURSE OBJECTIVE
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO1 Use microcontroller based embedded platforms in IOT C3
CO2 Use wireless peripherals for exchange of data. C6
Make use of Cloud platform to upload and analyse any sensor
CO3 C6
data
CO4 Use of Devices, Gateways and Data Management in IoT. C3
Use the knowledge and skills acquired during the course to
CO5 build and test a complete, working IoT system involving C6
prototyping, programming and data analysis.
PSO1
PSO2
PO10
PO11
PO12
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 - 3 - - - - - - - 2 -
CO2 3 3 2 - 3 - - - - - - - 3 -
CO3 3 2 3 - - - - - - - - - 2 2
CO4 3 2 3 - - - - - - - - - 3 2
CO5 3 2 3 - - - - - - - - - 2 -
CO6 3 2 3 - - - - - - - - - 2 -
LIST OF EXPERIMENTS
REFERENCES
1. IOT Projects - Your Marketplace in Internet-of-things
2. 7 Steps to Getting Started With IoT – Geeks for Geeks
PREREQUISITE
Internship
Mini Project
COURSE OBJECTIVES
COURSE OUTCOMES
Blooms
CO. No. Course Outcome
level
At the end of the course students are able to
Formulate specific problem statements for real life problems and
CO 1 perform literature search in the area of interest and develop a suitable C3
solution methodology for the problem.
Approach, identify, demonstrate and solve the technical problems
CO 2 C4
using various available modern tools and techniques.
Conduct experiments / Design & Analysis / solution iterations and
CO 3 C5
document the results with ethical responsibility.
Synthesise the results and arrive at scientific conclusions / products /
CO 4 solution in association of multidisciplinary team which is useful to C4
society.
Analyze, summarize, infer and communicate their chosen domain
CO 5 problems and results optimistically by means of oral presentation and C3
written reports.
CO PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
No.
CO1 3 3 3 3 3 3 3 3 3
CO2 3 3 3 3 3 3 3 3
CO3 3 3 3 3 3 3
CO4 3 3 3
CO5 3 3 3 3 3
Avg. 3 3 3 3 3 3 3 3 3 3 3 3 3 3
The project work develops students’ ability to solve a specific problem to the real-world
issues right from its identification and literature review till the successful solution for it. This
project work train the students to solve the practical problems, to make reasoned and ethical
decisions, and to communicate effectively. Project may be a theoretical analysis, modelling &
simulation, experimentation & analysis, prototype design, fabrication of new equipment,
correlation and analysis of data, software development, etc. or a combination of these.
Total: 180 Periods
EVALUATION
The progress of the project is evaluated based on a minimum of three reviews. The review
committee may be constituted by the Head of the Department. A project report is required at
the end of the semester. The project work is evaluated based on oral presentation and the
project report jointly by external and internal examiners constituted by the controller of
examination.
CRITERIA
The students in a group of 3 to 4 works on a topic approved by the head of the department
under the guidance of a faculty member and prepares a comprehensive project report after
completing the work to the satisfaction of the supervisor. Project work may be carried out
inside or outside the college, in any relevant industry or research institution. Publications in
the peer reviewed journals / International Conferences will be an added advantage.
Course V
19AD311T Semester
Code
Category PROFESSIONAL ELECTIVE COURSE(PEC) L T P C
Course Title ETHICS FOR ARTIFICIAL INTELLIGENCE AND
3 0 0 3
DATA SCIENCE
COURSE OBJECTIVES
To understand the need for ensuring ethics in AI
To understand ethical issues with the development of AI agents
To understand the need of ethics in data science.
To know about privacy and their risk.
To identify ethics in real time with the help of case studies.
PREREQUISITE
Data Science and AI
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO 1 Understand the ethical issues in the development of AI agents C6
Learn the ethical considerations of AI with perspectives on ethical
CO 2 values C1
CO 3 Apply ethical frameworks to help them analyze ethical challenges. C6
CO 4 Analyze the errors in processing the data and design. C6
CO 5 Develop the data based on guiding principles. C3
CO6 Examine ethics in various real time examples C6
PSO2
PO10
PO11
PO12
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
Note: - 1: Slight 2: Moderate 3: Substantial
LEARNING RESOURCES:
TEXT BOOKS
1. N. Bostrom and E. Yudkowsky. “The ethics of artificial intelligence”. In W. M. Ramsey and
K. Frankish, editors, The Cambridge Handbook of Artificial Intelligence, pages 316–334.
Cambridge University Press, Cambridge, 2014
2. Shannon Vallor, William J. Rewak, S.J., “An Introduction to Data Ethics”, Santa Clara
University, 2018.
REFERENCES
3. John D. Kelleher, Brendan Tierney, “Data Science”, MIT Press, 2018
4. Wallach, W., & Allen, C, “Moral machines: ceaching robots right from wrong”, Oxford
University Press, 2008.
PREREQUISITE
COURSE OBJECTIVES
COURSE OUTCOMES
CO6 Design a tag set to be used for statistical processing for real- C6
time applications
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 3 - - - - - - - - - 3 -
CO2 3 3 2 - - - - - - - - - 3 -
CO3 3 3 2 - - - - - - - - - 3 -
CO4 3 3 2 - - - - - - - - - 3 -
CO5 3 3 2 2 - - - - - - - - 3 -
CO6 3 3 3 2 - - - - - - - - 3 2
Note: - 1: Slight 2: Moderate 3: Substantial
UNIT I - INTRODUCTION 9
Word level analysis - Unsmoothed N-grams, Evaluating N-grams, Smoothing, Interpolation and
Backoff – Word Classes, Part-of-Speech Tagging, Rule-based, Stochastic and Transformation
based tagging, Issues in PoS tagging – Hidden Markov and Maximum Entropy models.
Context-Free Grammars, Grammar rules for English, Treebanks, Normal Forms for grammar –
Dependency Grammar – Syntactic Parsing, Ambiguity, Dynamic Programming parsing –
Shallow parsing – Probabilistic CFG, Probabilistic CYK, Probabilistic Lexicalized CFGs –
Feature structures, Unification of feature structures.
UNIT IV - SEMANTICS 9
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
REFERENCES
3. Breck Baldwin, ―Language processing with Java and LingPipe Cookbook, Atlantic
Publisher, 2015.
4. Richard M Reese, ―Natural Language Processing with Java, OReilly Media, 2015.
5. Nitin Indurkhya and Fred J. Damerau, ―Handbook of Natural Language Processing,
Second Edition, Chapman and Hall/CRC Press, 2010.
6. Tanveer Siddiqui, U.S. Tiwary, ―Natural Language Processing and Information
Retrieval, Oxford University Press, 2008.
COURSE OBJECTIVES
To explore the techniques in Reinforcement Learning
Implement the Reinforcement learning for various reward based applications
PREREQUISITE
Machine Learning
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO 1 Analyze reinforcement learning problem C6
CO 2 Design using finite markov process C1
CO 3 Design using Temporal-Difference Learning C6
CO 4 Design using Eligibility Traces C6
CO 5 Plan and Learn with Tabular Methods C3
CO6 Use Reinforcement Learning to implement various intelligent
systems
C6
PSO2
PO10
PO11
PO12
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
Note: - 1: Slight 2: Moderate 3: Substantial
Models and Planning-Integrating Planning, Acting, and Learning-Prioritized Sweeping-Full vs. Sample
Backups-Trajectory Sampling-Heuristic Search-Monte Carlo Tree Search
Total: 45 Periods
LEARNING RESOURCES:
TEXT BOOKS
1. Richard S. Sutton and Andrew G. Barto, “Reinforcement Leaning:An Introduction”, The MIT
Press Cambridge, Massachusetts London, England,2015
REFERENCES
2. Richard S. Sutton,”Reinforcement Learning”, MIT Press; second edition (23 November
2018)
3. Maxim Lapan,”Deep Reinforcement Learning Hands-on”, Packt Publishing Limited; 2nd
edition (31 January 2020)
PREREQUISITE
COURSE OBJECTIVES
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 3 - - - - - - - - - 3 -
CO2 3 3 2 - - - - - - - - - 3 -
CO3 3 3 2 - - - - - - - - - 3 -
CO4 3 3 2 2 2 - - - - - - - 3 2
CO5 3 3 2 2 2 - - - - - - - 3 2
CO6 3 3 3 2 2 - - - - - - - 3 2
Note: - 1: Slight 2: Moderate 3: Substantial
Taxonomy, technology and features of augmented reality, difference between AR and VR,
Challenges with AR, AR systems and functionality, Augmented reality methods, visualization
techniques for augmented reality, enhancing interactivity in AR environments, evaluating AR
systems.
Introduction, The Virtual world space, positioning the virtual observer, the perspective
projection, human vision, stereo perspective projection, Colour theory, Conversion From 2D to
3D, 3D space curves, 3D boundary representation, simple 3D modelling, 3D clipping,
Illumination models, Reflection models, shading algorithms. Geometrical Transformations:
Introduction, Frames of reference, Modelling transformations, Instances, Picking, Flying,
Scaling the VE, Collision detection
Input: Tracker, Sensor, Digital Gloves, Movement Capture, Video-based Input, 3D Menus & 3D
Scanner etc. Output: Visual /Auditory / Haptic Devices. Generic VR system: Introduction,
Virtual environment, Computer environment, VR technology, Model of interaction, VR Systems.
Animating the Virtual Environment: Introduction, The dynamics of numbers, Linear and
Nonlinear interpolation, the animation of objects, linear and non-linear translation, shape &
object in between, free from deformation, particle system. Physical Simulation: Introduction,
Objects falling in a gravitational field, Rotating wheels, Elastic collisions, projectiles, simple
pendulum, springs, Flight dynamics of an aircraft
Virtual Reality and Virtual Environment: Introduction, Computer graphics, Real time computer
graphics, Flight Simulation, Virtual environment requirement, benefits of virtual reality,
Historical development of VR, Scientific Landmark
Human factors: Introduction, the eye, the ear, the somatic senses. Hardware: Introduction, sensor
hardware, Head-coupled displays, Acoustic hardware, Integrated VR systems. Software:
Introduction, Modelling virtual world, Physical simulation, VR toolkits, Introduction to VRML.
AR / VR Applications: Introduction, Engineering, Entertainment, Science, Training.
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
REFERENCES
3. Alan Craig, William Sherman and Jeffrey Will, Developing Virtual Reality Applications,
Foundations of Effective Design, Morgan Kaufmann, 2009.
4. John Vince, “Virtual Reality Systems “, Pearson Education Asia, 2007.
5. Anand R, “Augmented and Virtual Reality”, Khanna Publishing House, Delhi.
PREREQUISITE
COURSE OBJECTIVES
To understand the basics of data communication, layered models, protocol standards and
switching.
To know about data link layer protocols and error detection and correction mechanisms.
To learn the basic concepts of internetworking, addressing and routing
To understand the characteristics of TCP and UDP protocols, Flow control,
Retransmission and Quality of Service concepts.
To learn various protocols of Application Layer
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 3 - - - - - - - - - 3 -
CO2 3 3 2 - - - - - - - - - 3 -
CO3 3 3 2 - - - - - - - - - 3 -
CO4 3 3 2 - - - - - - - - - 3 -
CO5 3 3 2 - - - - - - - - - 3 -
CO6 3 3 3 2 - - - - - - - - 3 2
Note: - 1: Slight 2: Moderate 3: Substantial
Issues in the data link layer - Framing: High Level Data Link Control (HDLC) – Point-to-point
protocol (PPP) – stop and wait protocol -sliding window protocols - error detection and
correction – cyclic redundancy check (CRC) – Checksum – Hamming code error correction
techniques.
Logical addressing – IPv4 addresses, IPv6 addresses. Network layer protocol: IP – Subnetting –
Classless Inter Domain Routing (CIDR) – Variable Length Subnet Mask (VLSM) –ARP –
DHCP – ICMP. Routing: Distance Vector Routing – Link State Routing. Case Study: Hospital IP
Addressing Design using Machine Learning
World Wide Web – Hyper Text Transfer protocol – File Transfer Protocol – Email – Telnet -
Domain Name System - Simple Network Management Protocol. Case Study: DNS Security:
DNSSEC
Total: 45 Periods
Presented in Board of Studies meeting held on 31.05.2022 (Approved)
Passed in the Academic Council meeting dated…………..
Form No.CD 02 C Rev.No.00 Effective Date: 1/06/19
R-2019 UG Syllabus for 19AD315T
LEARNING RESOURCES
TEXT BOOKS
1. Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”, Fifth
Edition, Morgan Kaufmann Publishers Inc., 2012. (Unit I to V)
2. Behrouz A. Forouzan, Data Communications and Networking, Fifth Edition TMH, 2013.
REFERENCES
COURSE OBJECTIVES
1. To understand the basics of Information Security
2. To know the legal, ethical and professional issues in Information Security
3. To know the aspects of risk management
4. To become aware of various standards in this area
5. To know the technological aspects of Information Security
PREREQUISITE
Database Management Systems
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO1 Understand the fundamentals of data and information security C2
Illustrate the legal, ethical and professional issues in
CO2 C2
information security
CO3 Demonstrate the aspects of risk management. C3
Become aware of various standards in the Information
CO4 C4
Security System
CO5 Design and implementation of Security Techniques. C6
CO6 Develop a security framework for the current scenario C6
PSO2
PO10
PO11
PO12
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
Note: - 1: Slight 2: Moderate 3: Substantial
Presented in Board of Studies meeting held on 31.05.2022 (Approved)
Passed in the Academic Council meeting dated…………..
Need for Security, Business Needs, Threats, Attacks, Legal, Ethical and Professional Issues - An
Overview of Computer Security - Access Control Matrix, Policy-Security policies, Confidentiality
policies, Integrity policies and Hybrid policies
Risk Management: Identifying and Assessing Risk, Assessing and Controlling Risk - Systems:
Access Control Mechanisms, Information Flow and Confinement Problem
UNIT IV SECURITY DESIGN - LORGIC 9
Blueprint for Security, Information Security Policy, Standards and Practices, ISO 17799 / BS
7799, NIST Models, VISA International Security Model, Design of Security Architecture,
Planning for Continuity
Security Technology, IDS, Scanning and Analysis Tools, Cryptography, Access Control Devices,
Physical Security, Security and Personnel
TEXT BOOKS:
1. Michael E Whitman and Herbert J Mattord, ―Principles of Information Security, Vikas
Publishing House, New Delhi, 2014
REFERENCES:
2. Micki Krause, Harold F. Tipton, ― Handbook of Information Security anagement‖, Vol 1-3
CRCPress LLC, 2011.
3. Stuart McClure, Joel Scrambray, George Kurtz, ―Hacking Exposed‖, Tata cGraw- Hill, 2009.
4. Matt Bishop, ― Computer Security Art and Science‖, Pearson/PHI, 2019.
Presented in Board of Studies meeting held on 31.05.2022 (Approved)
Passed in the Academic Council meeting dated…………..
PREREQUISITE
Introduction to Artificial Intelligence
COURSE OBJECTIVES
To understand fundamental topics in bio-inspired optimization techniques
To Learn the collective systems such as ACO, PSO, and BCO
To develop skills in biologically inspired algorithm design with an emphasis on solving
real world problems
To understand the most appropriate types of algorithms for different data analysis
problems and to introduce some of the most appropriate implementation strategies.
To implement the Bio-inspired technique with other traditional algorithms.
COURSE OUTCOMES
CO. No. Course Outcome Blooms level
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 2 2 - - 2 - 2 - - - - - 2
CO2 3 2 2 - - 2 - 2 - - - - - -
CO3 3 2 2 - - 2 - 2 - - - - 2 2
CO4 3 2 2 - - 2 - 2 - - - - 3 -
CO5 3 2 2 - - 2 - 2 - - - - 3 2
CO6 3 2 32 - - 2 - 2 - - - - 3 2
Note: - 1: Slight 2: Moderate 3: Substantial
UNIT I INTRODUCTION 9
Foraging for food – Clustering of objects – Collective Prey retrieval –Scope of Swarm Robotics
– Social Adaptation of Knowledge: Particle Swarm – Particle Swarm Optimization (PSO) –
Presented in Board of Studies meeting held on 31.05.2022 (Approved)
Passed in the Academic Council meeting dated…………..
Particle Swarms for Dynamic Optimization Problems – Artificial Bee Colony (ABC)
Optimization biologically inspired algorithms in engineering.
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
1. Floreano D. and Mattiussi C., "Bio-Inspired Artificial Intelligence: Theories, Methods, and
Technologies", MIT Press, Cambridge, MA, 2008.
2. Leandro Nunes de Castro, " Fundamentals of Natural Computing, Basic Concepts, Algorithms
and Applications", Chapman & Hall/ CRC, Taylor and Francis Group, 2007
REFERENCES
5. Christian Blum, Daniel Merkle (Eds.), “Swarm Intelligence: Introduction and Application
Springer Verlag, 2008.
6. Leandro N De Castro, Fernando J Von Zuben, “Recent Developments in Biologically
Inspired Computing”, Idea Group Inc., 2005.
7. Albert Y.Zomaya, "Handbook of Nature e-Inspired and Innovative Computing", Springer
2006.
8. C. Ebelhart et al., “Swarm Intelligence”, Morgan Kaufmann, 2001.
PREREQUISITE
COURSE OBJECTIVES
Understand the health data formats, health care policy and standards
Learn the significance and need of data analysis and data visualization
Understand the health data management frameworks
Learn the use of machine learning and deep learning algorithms in healthcare
Apply healthcare analytics for critical care applications
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11PO-12 PSO 1 PSO 2
CO1 3 3 3 2 2 - - - - - - - 3 -
CO2 3 3 2 2 2 - - - - - - - 3 -
CO3 3 3 2 2 2 - - - - - - - 3 -
CO4 3 3 2 2 2 - - - - - - - 3 -
CO5 3 3 2 2 2 - - - - - - - 3 -
CO6 3 3 3 2 2 - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
Overview - History of Healthcare Analysis Parameters on medical care systems- Health care
policy- Standardized code sets – Data Formats – Machine Learning Foundations: Tree Like
reasoning , Probabilistic reasoning and Bayes Theorem, Weighted sum approach.
IOT- Smart Sensors – Migration of Healthcare Relational database to NoSQL Cloud Database –
Decision Support System – Matrix block Cipher System – Semantic Framework Analysis –
Histogram bin Shifting and Rc6 Encryption – Clinical Prediction Models – Visual Analytics for
Healthcare.
Introduction on Deep Learning – DFF network CNN- RNN for Sequences – Biomedical Image
and Signal Analysis – Natural Language Processing and Data Mining for Clinical Data –
Mobile Imaging and Analytics – Clinical Decision Support System. Case studies - Predicting
Mortality for cardiology Practice –Smart Ambulance System using IOT
UNIT V - APPLICATIONS 9
Applications and Practical Systems for Healthcare - Fraud Detection in Healthcare- Data
Analytics for Pharmaceutical Discoveries Clinical Decision Support Systems. Case Studies–
Hospital Acquired Conditions (HAC) program- Healthcare and Emerging Technologies – ECG
Data Analysis.
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
2. Hui Yang and Eva K. Lee, “Healthcare Analytics: From Data to Knowledge to
Healthcare Improvement”, 1 st Edition, Wiley, 2016.
REFERENCES
3. Vikas Kumar, “Health Care Analysis Made Simple”, Packt Publishing, 2018.
4. Nilanjan Dey, Amira Ashour , Simon James Fong, Chintan Bhatl, “Health Care Data
Analysis and Management, First Edition, Academic Press, 2018
5. Kulkarni , Siarry, Singh ,Abraham, Zhang, Zomaya , Baki, “Big Data Analytics in
HealthCare”, Springer, 2020.
COURSE OBJECTIVES
To impact knowledge on fuzzy logic principles
To use the fuzzy logic for application related to design and manufacture
PREREQUISITE
Machine Learning
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
Develop the skill in basic understanding on fuzzy logic.
CO 1 C6
Develop the skill in basic understanding on neural network
CO 2 C1
CO 3 Design fuzzy logicfor modeling and control C6
CO 4 Design applications using fuzzy set theory C6
CO 5 Design applications for advanced fuzzy logic applications C3
CO6 Develop and implement a basic trainable neural network (or)
C6
a fuzzy logic system to design and manufacturing.
PSO2
PO10
PO11
PO12
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
Introduction to Fuzzy Logic, Classical Sets and Fuzzy Sets - Classical Relations and Fuzzy
Relations -Membership Functions -Defuzzification - Fuzzy Arithmetic and Fuzzy Measures -
Fuzzy Rule Base and Approximate Reasoning - Introduction to Fuzzy Decision Making.
Hybrid Systems -Neural Networks, Fuzzy Logic and Genetic -GA Based Weight Determination -
LR-Type Fuzzy Numbers - Fuzzy Neuron - Fuzzy BP Architecture - Learning in Fuzzy BP-
Inference by Fuzzy BP - Fuzzy ArtMap: A Brief Introduction - Soft Computing Tools - GA in
Fuzzy Logic Controller Design - Fuzzy Logic Controller
Modelling of non-linear systems using fuzzy models – TSK model – Fuzzy logic controller –
Fuzzification – Knowledge base – Decision making logic – Defuzzification – Adaptive fuzzy
systems – Familiarization with fuzzy logic toolbox.
Fuzzy logic controllers – principles – review of control systems theory – various industrial
applications of FLC adaptive fuzzy systems – fuzzy decision making – Multiobjective decision
making – fuzzy classification – means clustering – fuzzy pattern recognition – image processing
applications -systactic recognition – fuzzy optimization.
Total: 45 Periods
LEARNING RESOURCES:
TEXT BOOKS
1. S.Rajasekaran, G.A.VijayalakshmiPai, "Neural Networks, Fuzzy Logic and Genetic
Algorithm, Synthesis and Applications ", PHI Learning Pvt.Ltd., 2017.
2. Timothy J.Ross, Fuzzy logic with Engineering Applications, McGraw Hill, 2017
REFERENCES
3. Jyh-Shing Roger Jang, Chuen-Tsai Sun, EijiMizutani, ―Neuro-Fuzzy and Soft Computing‖,
Prentice-Hall of India, 2002.
4. KwangH.Lee, ―First course on Fuzzy Theory and Applications‖, Springer, 2005.
5. George J. Klir and Bo Yuan, ―Fuzzy Sets and Fuzzy Logic-Theory and Applications‖,
Prentice Hall, 1996.
6. James A. Freeman and David M. Skapura, ―Neural Networks Algorithms, Applications, and
Programming Techniques‖, Addison Wesley, 2003.
7. Klir.G, Yuan B.B. Fuzzy sets and Fuzzy Logic Prentice Hall of India private limited, 1997.
COURSE OBJECTIVES
To understand the need for morphological processing and their representation
To know about the various techniques used for speech synthesis and recognition
To appreciate the syntax analysis and parsing that is essential for natural language processing
To learn about the various representations of semantics and discourse
To have knowledge about the applications of natural language processing
PREREQUISITE
Machine Learning, Natural Language Processing
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO 1 Identify the different linguistic components of natural language C6
CO 2 Design a morphological analyser for a given natural language C1
Decide on the appropriate parsing techniques necessary for a given
CO 3 language and application
C6
CO 4 Design new tagset and a tagger for a given natural language C6
CO 5 Design applications for text to speech synthesis C3
CO6 Design applications for natural language processing C6
PO11
PO12
PS01
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
Phonetics –Articulatory Phonetics -Phonological Categories -Acoustic Phonetics and Signals - Speech
Synthesis –Text Normalization –Phonetic and Acoustic Analysis -Diphone Waveform synthesis –
Evaluation-Automatic Speech Recognition –Architecture -Hidden Markov Model to Speech -MFCC
vectors -Acoustic Likelihood Computation -Evaluation. Triphones – Discriminative Training -Modeling
Variation. Computational Phonology- Finite-State Phonology –Computational Optimality Theory -
Syllabification -Learning Phonology and Morphology
Features, Feature Extraction and Pattern Comparison Techniques: Speech distortion measures –
mathematical and perceptual – Log Spectral Distance, Cepstral Distances, Weighted Cepstral Distances
and Filtering, Likelihood Distortions, Spectral Distortion using a Warped Frequency Scale, LPC, PLP and
MFCC Coefficients, Time Alignment and Normalization – Dynamic Time Warping, Multiple Time –
Alignment Paths
Hidden Markov Models: Markov Processes, HMMs – Evaluation, Optimal State Sequence – Viterbi
Search, Baum-Welch Parameter Re-estimation, Implementation issues
UNIT IV - SPEECH RECOGNITION 9
Large Vocabulary Continuous Speech Recognition: Architecture of a large vocabulary 95 continuous
speech recognition system – acoustics and language models – n-grams, context dependent sub-word units;
Applications and present status.
Text-to-Speech Synthesis: Concatenative and waveform synthesis methods, sub-word units for TTS,
intelligibility and naturalness – role of prosody, Applications and present status.
Total: 45 Periods
LEARNING RESOURCES:
REFERENCES
3. Thomas F Quatieri, “Discrete-Time Speech Signal Processing – Principles and Practice”, Pearson
Education. 2015
4. Claudio Becchetti and LucioPrinaRicotti, “Speech Recognition”, John Wiley and Sons, 1999.
5. Ben gold and Nelson Morgan, “Speech and audio signal processing”, processing and perception of
speech and music, Wiley- India Edition, 2006 Edition.
7. Steven W. Smith, “The Scientist and Engineer’s Guide to Digital Signal Processing”, California
Technical Publishing.2015
COURSE OBJECTIVES
To study the Robot Locomotion and types of robots.
To explore the kinematic models and constraints
To Learn sensors of robots and image processing for robotics.
To understand the methods for mobile robot Localization
To study the Path planning and Navigation of Robots.
PREREQUISITE
Artificial Intelligence
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO1 Explain the types of Robots C2
CO2 Discover the kinematics of Robots C1
CO3 Design image processing algorithms C6
CO4 Analyze Localization algorithms C4
CO5 Apply Path planning methods for navigation C3
CO6 Develop the Navigation of Robots C6
PSO1
PSO2
PO10
PO11
PO12
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 2 2 2
CO2 3 2 2 2
CO3 3 2 2 2
CO4 3 2 2 2
CO5 3 2 2 2
CO6 2 2 2 2
Note: - 1: Slight 2: Moderate 3: Substantial
Introduction to AI and Robotics – robot locomotion – legged mobile robots – wheeled mobile robots –
aerial mobile robots.
Kinematic models and constraints – mobile robot maneuverability – mobile robot workspace – advanced
kinematics – motion control.
Sensors for mobile robots – computer vision for robots – image processing for robotics – place
recognition – range data.
UNITIV - MOBILE ROBOT LOCALIZATION 9
Introduction to localization – noise and aliasing – localization-based navigation – belief representation –
map representation – probabilistic map-based localization – autonomous map building.
LEARNING RESOURCES:
TEXT BOOKS
1. R. Siegwart, I. R. Nourbaksh, and D. Scarramuzza, “Introduction to Autonomous Mobile Robots”,
Second Edition, MIT Press, 2011.
2. Stuart Russel and Peter Norvig, “Artificial Intelligence: A Modern Approach”, Fourth Edition,
Pearson Education, 2020.
PREREQUISITE
Object Oriented Software Engineering
COURSE OBJECTIVES
COURSE OUTCOMES
CO. No. Course Outcome Blooms level
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 1 3 - - - - - - - - - - -
CO2 3 2 2 - - - - - - - - - - -
CO3 3 1 3 - - - - - - - - - - -
CO4 3 1 2 - - - - - - - - - - -
CO5 3 1 3 - - - - - - - - - - -
CO6 3 2 3 - - - - - - - - - - -
Note: - 1: Slight 2: Moderate 3: Substantial
LEARNING RESOURCES
TEXT BOOKS
1. David J. Anderson and Eli Schragenheim, ―Agile Management for Software Engineering:
Applying the Theory of Constraints for Business Results, Prentice Hall, 2004.
2. Hazza and Dubinsky, ―Agile Software Engineering, Series: Undergraduate Topics in
Computer Science, Springer, 2009.
REFERENCES
3. CraigLarman,“AgileandIterativeDevelopment–AManager’sGuide”,PearsonEducation– 2010.
PREREQUISITE
Image Processing.
COURSE OBJECTIVES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 3 2 2 - - - - - - - 3 -
CO2 3 3 2 2 2 - - - - - - - 3 -
CO3 3 3 2 2 2 - - - - - - - 3 -
CO4 3 3 2 2 2 - - - - - - - 3 -
CO5 3 3 2 2 2 - - - - - - - 3 -
CO6 3 3 3 2 2 - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
UNIT I - INTRODUCTION 9
Image Processing, Computer Vision ,What is Computer Vision - Low-level, Mid-level, High-level ;
Fundamentals of Image Formation, Transformation: Orthogonal, Euclidean, Affine, Projective, Fourier
Transform, Convolution and Filtering, Image Enhancement, Restoration, Histogram Processing.
Feature Extraction -Edges - Canny, LOG, DOG; Line detectors (Hough Transform), Corners - Harris
and Hessian Affine, Orientation Histogram, SIFT, SURF, HOG, GLOH, Scale-SpaceAnalysis- Image
Pyramids and Gaussian derivative filters, Gabor Filters and DWT. Image Segmentation -Region
Growing, Edge Based approaches to segmentation, Graph-Cut, Mean-Shift, MRFs, Texture
Segmentation.
Simple pinhole camera model – Sampling – Quantisation – Colour images – Noise – Smoothing – 1D and
3D histograms - Histogram/Image Equalisation - Histogram Comparison - Back-projection - k-means
Clustering – Thresholding - Threshold Detection Methods - Variations on Thresholding - Mathematical
Morphology – Connectivity
Methods for 3D vision – projection schemes – shape from shading – photometric stereo – shape from
texture – shape from focus – active range finding – surface representations – point-based representation
– volumetric representations – 3D object recognition – 3D reconstruction – introduction to motion –
triangulation – bundle adjustment – translational alignment – parametric motion–spline-based motion-
optical flow – layered motion
UNIT V - APPLICATIONS 9
Overview of Diverse Computer Vision Applications: Document Image Analysis, Biometrics, Object
Recognition, Tracking, Medical Image Analysis, Content-Based Image Retrieval, Video Data
Processing , Virtual Reality and Augmented Reality.
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
REFERENCES
3. Simon J. D. Prince, Computer Vision: Models, Learning, and Inference, Cambridge University
Press, 2012.
4. Mark Nixon and Alberto S. Aquado, Feature Extraction & Image Processing for Computer
Vision, Third Edition, Academic Press, 2012.
4. E. R. Davies, (2012), “Computer & Machine Vision”, Fourth Edition, Academic Press.
6. Concise Computer Vision: An Introduction into Theory and Algorithms, by Reinhard Klette,
2014
COURSE OBJECTIVES
1: To acquire knowledge on software process management
2: To acquire managerial skills for software project development.
3: To understand software economics
4: To acquire knowledge about real time software development scenarios.
COURSE OUTCOMES
Analyze the major and minor milestones, artifacts and metrics from
CO3 C4
management and technical perspective.
CO6 C3
REFERENCES:
3. An Introduction to the Team Software Process, Watts S. Humphrey, Pearson Education, 2000 Process
Improvement essentials, James R. Persse, O’Reilly, 2006
4. Software Project Management, Bob Hughes & Mike Cotterell, fourth edition, TMH, 2006
5. Applied Software Project Management, Andrew Stellman & Jennifer Greene, O’Reilly, 2006.
6. Head First PMP, Jennifer Greene & Andrew Stellman, O’Reilly, 2007
7. Software Engineering Project Management, Richard H. Thayer & Edward Yourdon, 2 nd edition,
Wiley India, 2004.
8. Agile Project Management, Jim Highsmith, Pearson education, 2004.
COURSE OBJECTIVES
PREREQUISITE
Knowledge of Agile
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
Define the main concepts, key technologies, strengths and
CO 1 limitations of cloud computing. C1
PSO2
PO10
PO11
PO12
PS01
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
Note: - 1: Slight 2: Moderate 3: Substantial
UNIT I - INTRODUCTION 9
Service Oriented Architecture – REST and Systems of Systems – Web Services – Publish Subscribe
Model – Basics of Virtualization – Types of Virtualization – Implementation Levels of Virtualization –
Virtualization Structures – Tools and Mechanisms – Virtualization of CPU – Memory – I/O Devices –
Virtualization Support and Disaster Recovery.
LEARNING RESOURCES:
TEXT BOOKS
1. Kai Hwang, Geoffrey C. Fox, Jack G. Dongarra, "Distributed and Cloud Computing,
From Parallel Processing to the Internet of Things", Morgan Kaufmann Publishers,
2012.
2. Rittinghouse, John W., and James F. Ransome, “Cloud Computing: Implementation,
Management and Security”, CRC Press, 2017.
REFERENCES
COURSE OBJECTIVES
PREREQUISITE
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO 1 Organizes the elements of effective management. C4
CO 2 Designing the planning, organizing and control processes C5
Create motivation techniques, team work and effective
CO 3 C4
communication
Communicate effectively through both oral and written
CO 4 C6
presentation.
CO 5 Design the control process in Management C6
PSO2
PO10
PO11
PO12
PS01
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
UNIT II – PLANNING 9
Nature and purpose of planning – planning process – types of planning – objectives – setting objectives –
policies – Planning premises – Strategic Management – Planning Tools and Techniques – Decision
making steps and process.
UNIT III – ORGANISING 9
Nature and purpose – Formal and informal organization – organization chart – organization structure –
types – Line and staff authority – departmentalization – delegation of authority – centralization and
decentralization – Job Design - Human Resource Management – HR Planning, Recruitment, selection,
Training and Development, Performance Management , Career planning and management
UNIT IV - DIRECTING 9
UNIT V CONTROLLING 9
System and process of controlling – budgetary and non-budgetary control techniques – use of
computers and IT in Management control – Productivity problems and management – control and
performance – direct and preventive control – reporting.
Total: 45 Periods
LEARNING RESOURCES:
TEXT BOOKS
REFERENCES
COURSE OBJECTIVES
PREREQUISITE
Information retrieval
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
Identify the information extraction techniques for real time
CO 1 applications C1
PSO2
PO10
PO11
PO12
PS01
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
Note: - 1: Slight 2: Moderate 3: Substantial
Introduction – Origins – Text, Audio ,Image, Video Extraction – Visual object Feature Localization -
Entropy based Image Analysis – 3D shape Extraction Techniques - Semantic Multimedia Extraction
using Audio & Video – Multimedia Web Documents.
Introduction – Strategies - Utilities – Crossing the language barrier- Cross Language strategies with
Utilities – Efficiency Multidimensional data model- Parallel Information Retrieval – Distributed
Information Retrieval.
UNIT V APPLICATIONS 9
TEXT BOOKS
1. Mark T. Maybury, “Multimedia Information Extraction”, Wiley (IEEE), John Wiley &
Sons, 2012.
2. Ronen Feldman, James Sanger, “Text Mining Handbook”, Cambridge University
press, 2006..
REFERENCES
COURSE OBJECTIVES
PREREQUISITE
Cognitive Computing
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO 1 Explain cognitive computing and design principles. C1
PSO2
PO10
PO11
PO12
PS01
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
Foundation of Cognitive Computing: cognitive computing as a new generation, the uses of cognitive
systems, system cognitive, gaining insights from data, Artificial Intelligence as the foundation of
cognitive computing, understanding cognition. Design Principles for Cognitive Systems: Components of
a cognitive system, building the corpus, bringing data into cognitive system, machine learning,
hypotheses generation and scoring, presentation and visualization services.
cognitive computing a reality, cognitive application changing the market- IBM Watson as a
cognitive systems.
UNIT V APPLICATIONS 9
The process of building a cognitive application: Emerging cognitive platform, defining the
objective, defining the domain, understanding the intended users and their attributes, questions and
exploring insights, training and testing- Building a cognitive health care application- Smarter
cities-Cognitive Computing in Government.
Total: 45 Periods
LEARNING RESOURCES:
REFERENCES
COURSE OBJECTIVES
PREREQUISITE
● Introduction to Information and Computing Technology
● Object Oriented Software Engineering
● Web Technologies
● Mobile Communication
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
Examine the contributions of human factors and C1
CO 1
technical constraints onhuman- computer interaction.
Associate user interface techniques and methods to the C2
CO 2 design of software.
Apply exploratory and experimental research methods in C3
CO 3 user interfaces.
Explain the various models that suit real time interface C4
CO 4 development.
CO 5 Summarize real time user interface technologies system. C5
CO6 Integrate the principles and guidelines of user centred C6
interface designprocess, evaluation methodologies and tools
to analyze the interfaces.
PSO2
PO10
PO11
PO12
PS01
CO PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 - - - - - - - - - - - -
CO2 3 3 3 - 3 - - - - - - - 3 -
CO3 3 - 3 - - - - - 3 - - - 3 -
CO4 3 2 3 3 3 - - - - - - 3 3 -
CO5 2 3 3 - - - - - 3 - - - 2 3
CO6 - 3 3 3 3 - - - 3 - - 3 3 3
Note: - 1: Slight 2: Moderate 3: Substantial
The Human: I/O channels – Memory – Reasoning and problem solving; The computer:
Devices–Memory – processing and networks; Interaction: Models – frameworks –
Ergonomics – styles –elements – interactivity- Paradigms.
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, “Human Computer
Interaction”,3rd Edition, Pearson Education, 2004
2. Bill Scott and Theresa Neil, “Designing Web Interfaces”, First Edition, O‟Reilly,
2009.
REFERENCES
COURSE OBJECTIVES
PREREQUISITE
Keyword Extraction
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO 1 Design text extraction techniques C1
PSO2
PO10
PO11
PO12
PS01
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
Introduction- Rapid automatic keyword extraction: candidate keywords, keyword scores, adjoining
keywords, extracted keywords-Benchmark evaluation: precision and recall, efficiency, stoplist generation,
Evaluation on new articles.
UNIT II DOCUMENT CLUSTERING 9
Multilingual document clustering: Multilingual LSA, Tucker1 method, PARAFAC2 method, LSA with
term alignments, LMSA, LMSA with term alignments; Constrained clustering with k-means type
algorithms.
UNIT III CONTENT BASED CLASSIFICATION 8
Classification algorithms for Document Classification, Content-based spam email classification, Utilizing
nonnegative matrix factorization for email classification problems.
Text visualization techniques: Visualization in text analysis, Tag clouds, tag clouds, authorship and
change tracking, Data Exploration and the search for noval patterns, sentiment tracking, visual analytics
and FutureLens, scenario discovery. adaptive threshold setting for novelty mining: Introduction, adaptive
threshold for anomaly detection, Experimental study.
Events and trends in text streams: Introduction, Text streams, Feature extraction and data reduction,
Event detection, Trend detection, Event and trend descriptions. Embedding semantics in LDA topic
models: Introduction, vector space modeling, latent semantic analysis, probabilistic latent semantic
analysis, Latent Dirichlet allocation, embedding external semantics from Wikipedia, data-driven
semantic embedding.
Total: 45 Periods
LEARNING RESOURCES:
REFERENCES
1. Michael W. Berry & Jacob Kogan,"Text Mining Applications and Theory", Wiley
publications, 2010.
2. Aggarwal, Charu C., and ChengXiangZhai, eds., “Mining text data”, Springer Science &
Business Media, 2012.
3. Miner, Gary, et al., “Practical text mining and statistical analysis for non-structured text
data applications”, Academic Press, 2012.
4. Srivastava, Ashok N., and MehranSahami, “Text mining: Classification, clustering, and
applications”, Chapman and Hall/CRC, 2009.
5. Buitelaar, Paul, Philipp Cimiano, and Bernardo Magnini, eds., “Ontology learning from
text: methods, evaluation and applications”, Vol. 123. IOS press, 2005.
COURSE OBJECTIVES
To provide an insight on the operations, quality management and sampling tools and
fundamentals of supply chain networks, tools and techniques
PREREQUISITE
Basics of Management
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO 1 To know about the operations and fundamentals of supply chain C6
CO 2 To understand the quality management tools and sampling process C1
To understand the design factors and various design options of
CO 3 distribution networks in industries and the role of transportation and C6
warehousing
CO 4 To understand the various sourcing decisions in supply chain C6
CO 5 To understand the supply chain management in IT industries
C3
MAPPING PROGRAM OUTCOMES WITH SPECIFIC OUTCOMES
PSO1
PSO2
PO10
PO11
PO12
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
Total: 45 Periods
LEARNING RESOURCES:
TEXT BOOKS
1. Roberta S. Russell, Bernard W. Taylor, “Operations and Supply Chain Management, 10th Edition,
Wiley Publications,2019
2. Sunil Chopra, Peter Meindl and Kalra, Supply Chain Management, Strategy, Planning, and
Operation, Pearson Education, 2016.
REFERENCES
PREREQUISITE
Software Engineering
COURSE OBJECTIVES
To understand the basics of testing, planning, designing and managing test cases.
● To study the various types of test in the life cycle of the software product.
● To build design concepts for system testing and execution.
● To learn the software quality assurance ,metrics, defect prevention techniques
● To learn the techniques for quality assurance and applying for applications.
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO5
Apply techniques of quality assurance for typical applications. C3
PSO1
PSO2
PO10
PO11
PO12
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
Note: - 1: Slight 2: Moderate 3: Substantial
Quality Revolution, Verification and Validation, Failure, Error, Fault, and Defect, Objectives of
Testing, Testing Activities, Test Case Selection White-Box and Black, test Planning and design,
Test Tools and Automation, Power of Test. Test Team Organization and Management-Test
Groups, Software Quality Assurance Group, System Test Team Hierarchy, Team Building
System test categories Taxonomy of System Tests, Interface Tests Functionality Tests. GUI
Tests, Security Tests Feature Tests, Robustness Tests, Boundary Value Tests Power Cycling
Tests Interoperability Tests, Scalability Tests, Stress Tests, Load and Stability Tests, Reliability
Tests, Regression Tests, Regulatory Tests. Test Generation from FSM models- State-Oriented
Model. Finite-State Machine Transition Tour Method, Testing with State Verification. Test
Architectures-Local, distributed, Coordinated, Remote system test design- Test Design Factors
Requirement Identification, modeling a Test Design Process Test Design Preparedness, Metrics,
Presented in Board of Studies meeting held on 31.05.2022 (Approved)
Passed in the Academic Council meeting dated……….
Software quality - People‘s Quality Expectations, Frameworks and ISO-9126, McCall‘s Quality
Factors and Criteria – Relationship. Quality Metrics. Quality Characteristics ISO 9000:2000
Software Quality Standard. Maturity models- Test Process Improvement, Testing Maturity
Model.
Quality Assurance - Root Cause Analysis, modeling, technologies, standards and methodologies
for defect prevention. Fault Tolerance and Failure Containment - Safety Assurance and Damage
Control, Hazard analysis using fault-trees and event-trees. Comparing Quality Assurance
Techniques and Activities. QA Monitoring and Measurement, Risk Identification for
Quantifiable Quality Improvement. Case Study: FSM-Based Testing of Web-Based
Applications.
Total: 45 Periods
LEARNING RESOURCES:
TEXT BOOKS
1. Software Testing And Quality Assurance-Theory and Practice, Kshirasagar Naik, Priyadarshi
Tripathy, John Wiley & Sons Inc,2011
2. Software Quality Assurance - From Theory to Implementation, Daniel Galin, Pearson Education
Ltd UK, 2004
REFERENCES
3. Software Quality Engineering: Testing, Quality Assurance, and Quantifiable Improvement, Jeff Tian,
John Wiley & Sons, Inc., Hoboken, New Jersey. 2005.
4. Software Quality Assurance, Milind Limaye, TMH ,New Delhi, 2011
5. Aditya P. Mathur, “Foundations of Software Testing _ Fundamental Algorithms and Techniques”,
Dorling Kindersley (India) Pvt. Ltd., Pearson Education, 2008.
PREREQUISITE
Introduction to Artificial Intelligence
COURSE OBJECTIVES
To understand the concept of semantic web and related applications.
To learn knowledge representation using ontology.
To understand human behaviour in social web and related communities.
To learn visualization of social networks.
COURSE OUTCOMES
CO. No. Course Outcome Blooms level
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 2 2 - - 2 - 2 - - - - - 2
CO2 3 2 2 - - 2 - 2 - - - - - -
CO3 3 2 2 - - 2 - 2 - - - - 2 2
CO4 3 2 2 - - 2 - 2 - - - - 3 -
CO5 3 2 2 - - 2 - 2 - - - - 3 2
CO6 3 2 32 - - 2 - 2 - - - - 3 2
Note: - 1: Slight 2: Moderate 3: Substantial
UNIT I INTRODUCTION 9
Introduction to Semantic Web: Limitations of current Web - Development of Semantic Web -
Emergence of the Social Web - Social Network analysis: Development of Social Network
Analysis - Key concepts and measures in network analysis - Electronic sources for network
analysis: Electronic discussion networks, Blogs and online communities - Web-based networks -
Applications of Social Network Analysis.
and reputation - Trust derivation based on trust comparisons - Attack spectrum and
countermeasures.
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
1. Peter Mika, “Social Networks and the Semantic Web”, First Edition, Springer 2007.
2. Borko Furht, “Handbook of Social Network Technologies and Applications”, 1st Edition,
Springer, 2010.
REFERENCES
3. Guandong Xu ,Yanchun Zhang and Lin Li, “Web Mining and Social Networki
Techniques and applications”, First Edition, Springer, 2011.
4. Dion Goh and Schubert Foo, “Social information Retrieval Systems: Emerging
Technologies and Applications for Searching the Web Effectively”, IGI Global Snippet,
2008.
5. Max Chevalier, Christine Julien and Chantal Soulé-Dupuy, “Collaborative and Social
Information Retrieval and Access: Techniques for Improved user Modelling”, IGI Global
Snippet, 2009.
6. John G. Breslin, Alexander Passant and Stefan Decker, “The Social Semantic Web”,
Springer, 2009.
PREREQUISITE
COURSE OBJECTIVES
PSO2
PO10
PO11
PO12
PS01
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
Features, Feature Extraction and Pattern Comparison Techniques: Speech distortion measures –
mathematical and perceptual – Log Spectral Distance, Cepstral Distances, Weighted Cepstral
Distances and Filtering, Likelihood Distortions, Spectral Distortion using a Warped Frequency
Scale, LPC, PLP and MFCC Coefficients, Time Alignment and Normalization – Dynamic Time
Warping, Multiple Time – Alignment Paths
Hidden Markov Models: Markov Processes, HMMs – Evaluation, Optimal State Sequence –
Viterbi Search, Baum-Welch Parameter Re-estimation, Implementation issues.
Text-to-Speech Synthesis: Concatenative and waveform synthesis methods, sub-word units for
TTS, intelligibility and naturalness – role of prosody, Applications and present status.
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
1. Jurafsky and Martin, “Speech and Language Processing”, Pearson Prentice Hall, Second
Edition, 2008.
2. Lawrence Rabinerand Biing-Hwang Juang, “Fundamentals of Speech Recognition”, Pearson
Education, 2003
REFERENCES
3. Steven W. Smith, “The Scientist and Engineer’s Guide to Digital Signal Processing”,
California Technical Publishing.
4. Thomas F Quatieri, “Discrete-Time Speech Signal Processing – Principles and Practice”,
Pearson Education. 2009
5. Claudio Becchetti and Lucio Prina Ricotti, “Speech Recognition”, John Wiley and Sons, 1999.
6. Ben gold and Nelson Morgan, “Speech and audio signal processing”, processing and
perception of speech and music, Wiley- India Edition, 2006 Edition.
7. Frederick Jelinek, “Statistical Methods of Speech Recognition”, MIT Press
COURSE OBJECTIVES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
Explain the real world business problems and model with
CO 1 C6
analytical solutions.
Identify the business processes for extracting Business
CO 2 Intelligence C1
PSO1
PSO2
PO10
PO11
PO12
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
LEARNING RESOURCES:
TEXT BOOKS
REFERENCES
3. Philip Kotler and Kevin Keller, Marketing Management, 15th edition, PHI, 2016
4. VSP RAO, Human Resource Management, 3rd Edition, Excel Books, 2010.
5. Mahadevan B, “Operations Management -Theory and Practice”,3rd Edition, Pearson
Education, 2018.
COURSE OBJECTIVES
To study the basics of Cyber security.
To know about the security aspects operating systems and networks.
To explore Cryptography, IDS and IPS
To study the privacy principles and policies.
To know about the Security management and incidents.
PREREQUISITE
Machine Learning, Natural Language Processing
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO 1 Identify the different linguistic components of natural language C6
CO 2 Design a morphological analyser for a given natural language C1
Decide on the appropriate parsing techniques necessary for a given
CO 3 C6
language and application
CO 4 Design new tagset and a tagger for a given natural language C6
CO 5 Design applications for text to speech synthesis C3
CO6 Design applications for natural language processing C6
PO11
PO12
PS01
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
Note: - 1: Slight 2: Moderate 3: Substantial
Security in Operating Systems - Security in the Design of Operating Systems -Rootkit - Network
security attack- Threats to Network Communications - Wireless Network Security - Denial of
Service - Distributed Denial-of-Service.
LEARNING RESOURCES:
TEXT BOOKS
REFERENCES
4. Charles P. Pfleeger Shari Lawrence Pfleeger Jonathan Margulies, Security in Computing, 5th Edition ,
Pearson Education , 2015
5. George K.Kostopoulous, Cyber Space and Cyber Security, CRC Press, 2013.
6. MarttiLehto, PekkaNeittaanmä ki, Cyber Security: Analytics, Technology and Automation edited,
Springer International Publishing Switzerland 2015
7. Nelson Phillips and EnfingerSteuart, "Computer Forensics and Investigations", Cengage Learning,
New Delhi, 2009.
COURSE OBJECTIVES
PO11
PO12
PS01
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
Note: - 1: Slight 2: Moderate 3: Substantial
Presented in Board of Studies meeting held on 31.05.2022 (Approved)
Passed in the Academic Council meeting dated……….
LEARNING RESOURCES
TEXT BOOKS
1. Paul Goransson and Chuck Black, Software Defined Networks: A Comprehensive Approach,
Second Edition, Morgan Kaufmann, 2016.
2. Thomas D. Nadeau, Ken Gray, SDN: Software Defined Networks, O'Reilly Media, 2013.
REFERENCES
3. Siamak Azodolmolky, Software Defined Networking with Open Flow, Packet Publishing, 2013.
4. Vivek Tiwari, SDN and Open Flow for Beginners, Amazon Digital Services, Inc., 2013.
5. Fei Hu, Editor, Network Innovation through Open Flow and SDN: Principles and Design, CRC
Press, 2014.
COURSE OBJECTIVES
To understand Blockchain’s fundamental components, and examine decentralization using
blockchain.
● To learn the working process of cryptocurrency as a part of Blockchain.
● To know the components of Ethereum and Programming Languages for Ethereum
● To study the basics of Hyperledger and Web3.
● To know about alternative Blockchains and Blockchain projects in different domains.
PREREQUISITE
Machine Learning, Natural Language Processing
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
Describe the technology components of Blockchain and how
CO 1 C1
it works behind the scenes.
Understand different approaches to developing decentralized
CO 2 C2
applications.
Demonstrate Bitcoin and its limitations by comparing with
CO 3 C3
other alternative coins.
CO 4 Select solution using the Ethereum model. C4
Estimate and use Hyperledger and its development
CO 5 C5
framework.
Organize alternative Blockchains and emerging trends in
CO 6 C6
Blockchain.
PSO2
PO10
PO11
PO12
PS01
CO PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
Security Planning - Business Continuity Planning - Handling Incidents - Risk Analysis - Dealing
with Disaster - Emerging Technologies - The Internet of Things - Economics - Electronic Voting
- Cyber Warfare- Cyberspace and the Law - International Laws - Cyber crime - Cyber Warfare
and Home Land Security.
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
REFERENCES
COURSE OBJECTIVES
To give an idea about IPR, registration and its enforcement.
PREREQUISITE
Machine Learning, Natural Language Processing
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO 1 Identify the different linguistic components of natural language C6
CO 2 Design a morphological analyzer for a given natural language C1
Decide on the appropriate parsing techniques necessary for a given
CO 3 language and application
C6
CO 4 Design new tagset and a tagger for a given natural language C6
CO 5 Design applications for text to speech synthesis C3
CO6 Design applications for natural language processing C6
PSO2
PO10
PO11
PO12
PS01
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
UNIT I INTRODUCTION 9
Introduction to IPRs, Basic concepts and need for Intellectual Property - Patents, Copyrights,
Geographical Indications, IPR in India and Abroad – Genesis and Development – the way from
WTO to WIPO –TRIPS, Nature of Intellectual Property, Industrial Property, technological
Research, Inventions and Innovations – Important examples of IPR.
Meaning and practical aspects of registration of Copy Rights, Trademarks, Patents, Geographical
Indications, Trade Secrets and Industrial Design registration in India and Abroad
International Treaties and Conventions on IPRs, TRIPS Agreement, PCT Agreement, Patent Act
of India, Patent Amendment Act, Design Act, Trademark Act, Geographical Indication Act.
Digital Innovations and Developments as Knowledge Assets – IP Laws, Cyber Law and Digital
Content Protection – Unfair Competition – Meaning and Relationship between Unfair
Competition and IP Laws – Case Studies.
Total: 45 Periods
TEXT BOOKS:
1. V. Scople Vinod, Managing Intellectual Property, Prentice Hall of India pvt Ltd, 2012
2. S. V. Satakar, “Intellectual Property Rights and Copy Rights, Ess Ess Publications, New
Delhi, 2002
REFERENCES:
COURSE OBJECTIVES
This course gives an overview of Fog Computing and its architecture, challenges and
applications in different context.
The further objectives of this course is to make the student understand the architecture
and its components and working of components and its performance, explore Fog on
security, multimedia and smart data, and finally model the fog computing scenario.
PREREQUISITE
Machine Learning, Natural Language Processing
COURSE OUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO 1 Become familiar with the concepts of Fog. C6
Understand the architecture and its components and working of
CO 2 C1
components and its performance.
CO 3 Understand The Management Of Data And Security Analysis C6
CO 4 Explore Fog on security, multimedia and smart data. C6
CO 5 Model the fog computing scenario. C3
PSO2
PO10
PO11
PO12
PS01
CO
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 2 3
CO2 3 3 3
CO3 3 3 3 3
CO4 3 3
CO5 3 2 3
CO6 3 2 3
Note: - 1: Slight 2: Moderate 3: Substantial
UNIT II ARCHITECTURE 9
Smart Management of Big Data-Smart Data-Structure of Smart Data- Smart Data Life
Cycle-System Architecture-Multi-dimensional Payment Plan- Security and Privacy Issues-
Multimedia Fog Computing-Architecture Deduplication-Hybrid Secure Deduplication-
Security Challenges-Security Requirements
UNIT V CASE STUDY 9
Case Study: Wind Farm - Smart Traffic Light System, Wearable Sensing
Devices, Wearable Event Device, Wearable System, Demonstrations, Post Application
Example. Event Applications Example
Total: 45 Periods
LEARNING RESOURCES:
TEXT BOOKS
1. Ivan Stojmenovic, Sheng Wen ,” The Fog Computing Paradigm: Scenarios and Security
Issues” 2014.
2. Fog Computing: Helping the Internet of Things Realize its Potential Amir
VahidDastjerdi and RajkumarBuyya, University of Melbourne.2017
REFERENCES:
PREREQUISITE
COURSE OBJECTIVES
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 2 - - - - - - - - - 3 -
CO2 3 3 2 - - - - - - - - - 3 -
CO3 3 3 2 - - - - - - - - - 3 -
CO4 3 3 2 2 2 - - - - - - - 3 -
CO5 3 3 2 2 2 - - - - - - - 3 -
CO6 3 3 2 2 2 - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
Linear methods – Regression -Classification –Perceptron and Neural networks – Decision trees –
Support vector machines – Probabilistic models
Image Recognition – Speech Recognition – Email spam and Malware Filtering – Online fraud
detection – Medical Diagnosis
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
REFERENCES
PREREQUISITE
Python programming
COURSE OBJECTIVES
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 2 - - - - - - - - - 3 -
CO2 3 3 2 - - - - - - - - - 3 -
CO3 3 3 2 - - - - - - - - - 3 -
CO4 3 3 2 2 2 - - - - - - - 3 -
CO5 3 3 2 2 2 - - - - - - - 3 -
CO6 3 3 2 2 2 - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
UNIT I - INTRODUCTION 9
What is Data Science - Need for data science - benefits and uses of data science - facets of data -
The data science process - Defining the research goal - Retrieving data - Cleansing, integrating,
and transforming data - Exploratory data analysis - Build the models - Presenting findings and
building applications.
UNIT II - DESCRIPTIVE STATISTICS I 9
Tables (Frequency distributions) – Outliers – relative frequency distributions – cumulative
frequency distributions – frequency distributions for nominal data – interpreting distributions –
Graphs – Averages – mode – median – mean – averages for qualitative and ranked data –
UNIT III - DESCRIPTIVE STATISTICS II 9
Describing Variability – range – variance – standard deviation – Degrees of Freedom (DF) –
Interquartile Range (IQR) – Measures of variability for qualitative and ranked data - Normal
curve – z Scores – Normal curve problems – Finding proportions – Finding scores –Correlation –
Scatter plots – Correlation coefficient for quantitative data – Computational formula for
correlation coefficient.
UNIT IV - PYTHON FOR DATA HANDLING 9
Basics of NumPy arrays – Aggregations – Computations on arrays – Comparisons, Masks,
Boolean logic – Fancy indexing – Structured data – Data Manipulation with Pandas – Data
Indexing and selection – Operating on data – Handling Missing data.
UNIT V - PYTHON FOR DATA VISUALIZATION 9
Visualization with matplotlib – Line plots – Scatter plots – Visualizing errors – Density and
contour plots – Histograms, binnings, and density – Three-dimensional plotting – Geographic
data.
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
1. David Cielen, Arno D. B. Meysman, and Mohamed Ali, “Introducing Data Science”,
Manning Publications, 2016.)
2. Robert S. Witte and John S. Witte, “Statistics”, Eleventh Edition, Wiley Publications,
2017.
REFERENCES
3. Allen B. Downey, “Think Stats: Exploratory Data Analysis in Python”, Green Tea Press,
2014.
4. Jake VanderPlas, “Python Data Science Handbook”, O’Reilly, 2016.
PREREQUISTE
COURSE OBJECTIVES
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 3 - - - - - - - - - 3 -
CO2 3 3 3 - - - - - - - - - 3 -
CO3 3 3 3 - - - - - - - - - 3 -
CO4 3 3 3 - - - - - - - - - 3 2
CO5 3 3 3 - - - - - - - - - 3 2
CO6 3 3 3 - - - - - - - - - 3 2
Note: - 1: Slight 2: Moderate 3: Substantial
What is big data – why big data – convergence of key trends – unstructured data – industry
examples of big data – web analytics – big data and marketing – fraud and big data – risk and big
data – credit risk management – big data and algorithmic trading – big data and healthcare – big
data in medicine – advertising .
Data format – analyzing data with Hadoop – scaling out – Hadoop streaming – Hadoop pipes –
design of Hadoop distributed file system (HDFS) – HDFS concepts – Java interface – data flow
– Hadoop I/O – data integrity – compression – serialization – Avro – file-based data structures.
UNIT III - MAPREDUCE APPLICATIONS 9
MapReduce workflows – unit tests with MRUnit – test data and local tests – anatomy of
MapReduce job run – classic Map-reduce – YARN – failures in classic Map-reduce and YARN
– job scheduling – shuffle and sort – task execution – MapReduce types – input formats – output
formats.
UNIT IV - BIG DATA FRAMEWORKS 9
Introduction to NoSQL – Aggregate Data Models – HBase: Data Model and Implementations –
HBase Clients – Examples –. Cassandra: Data Model – Examples – Cassandra Clients – Hadoop
Integration. Pig – Grunt – Pig Data Model – Pig Latin – developing and testing Pig Latin scripts.
Hive – Data Types and File Formats – HiveQL Data Definition – HiveQL Data Manipulation –
HiveQL Queries
Hbase – data model and implementations – Hbase clients – Hbase examples – praxis. Cassandra
– cassandra data model – cassandra examples – cassandra clients – Hadoop integration. Pig –
Grunt – pig data model – Pig Latin – developing and testing Pig Latin scripts. Hive – data types
and file formats – HiveQL data definition – HiveQL data manipulation – HiveQL queries.
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
1. Michael Minelli, Michelle Chambers, and AmbigaDhiraj, "Big Data, Big Analytics:
Emerging Business Intelligence and Analytic Trends for Today's Businesses", Wiley,
2013.
REFERENCES
PREREQUISITE
Data Structures.
COURSEOBJECTIVES
To get introduced to the basic knowledge representation, problem solving, and learning
methods of Artificial Intelligence
To solve problems in Artificial Intelligence using Python.
To familiarize with Fuzzy Logic and knowledge processing in expert systems.
COURSEOUTCOMES
BLOOMS
CO. NO. COURSE OUTCOME
LEVEL
At the end of the course students will be able to
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 3 - - - - - - - - - 3 -
CO2 3 3 2 - - - - - - - - - 3 -
CO3 3 3 2 - - - - - - - - - 3 -
CO4 3 3 2 - - - - - - - - - 3 -
CO5 3 3 3 2 2 - - - - - - - 3 -
CO6 3 3 3 2 2 - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
UNIT I - INTRODUCTION 9
Artificial Intelligence, The AI Problems, Defining the Problem as a State Space Search, Problem
Characteristics -Searching strategies – Generate and Test, Heuristic Search Techniques.Python-
Introduction to Python- Lists Dictionaries & Tuples in Python- Python implementation of Hill
Climbing.
Best First Search - Implementation in Python - OR Graphs, The A * Algorithm, Problem Reduction-
AND-OR Graphs, The AO* algorithm, Constraint Satisfaction. MINIMAX search procedure, Alpha–
Beta pruning.
Knowledge representation - Using Predicate logic - representing facts in logic, functions and
predicates, Conversion to clause form, Resolution in propositional logic, Resolution in predicate
logic, Unification. Representing Knowledge Using Rules: Procedural Versus Declarative
knowledge, Logic Programming, Forward versus Backward Reasoning. .
Expert System –Representing and using Domain Knowledge – Reasoning with knowledge–
Expert System Shells –Support for explanation- examples –Knowledge acquisition-examples.
Total:45 Periods
LEARNING RESOURCES
TEXTBOOK
1. Elaine Rich and Kevin Knight, “Artificial Intelligence”, Tata McGraw-Hill Publishing
Company Ltd., New Delhi, Third Edition, ISBN: 13:978-0-07-008770-5, 2019.
2. Stuart Russell, Peter Norvig, “Artificial Intelligence- A modern approach”, Pearson
Education Asia, Second Edition, ISBN:81-297-0041-7, 2016.
REFERENCES
PREREQUISITE
COURSE OBJECTIVES
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 2 - - - - - - - - - 2 -
CO2 3 3 2 - - - - - - - - - 2 -
CO3 3 3 2 2 - - - - - - - - 2 -
CO4 3 3 2 2 - - - - - - - - 2 -
CO5 3 3 2 2 - - - - - - - - 2 -
CO6 3 3 2 2 3 - - - - - - - 2 -
Note: - 1: Slight 2: Moderate 3: Substantial
Introduction to Data Mining – Data Mining Tasks – Components of Data Mining Algorithms –
Data Mining supporting Techniques – Major Issues in Data Mining – Measurement and Data –
Data Preprocessing – Data sets
Cluster Analysis: Basic concepts and Methods – Cluster Analysis – Partitioning methods –
Hierarchical methods – Density Based Methods – Grid Based Methods – Evaluation of
Clustering – Advanced Cluster Analysis: Probabilistic model based clustering – Clustering High
– Dimensional Data – Clustering Graph and Network Data – Clustering with Constraints.
Association Rule Mining – Introduction – Large Item sets – Basic Algorithms – Parallel
and Distributed Algorithms – Comparing Approaches – Incremental Rules – Advanced
Association Rule Techniques – Measuring the Quality of Rules – Visualization of
Multidimensional Data – Diagrams for Multidimensional visualization – Visual Data Mining –
Data Mining Applications – Case Study: WEKA.
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
1. Jiawei Han, Micheline Kamber , Jian Pei, “Data Mining: Concepts and Techniques”,
Third Edition (The Morgan Kaufmann Series in Data Management Systems), 2012.
2. David J. Hand, Heikki Mannila and Padhraic Smyth “Principles of Data Mining”
(Adaptive Computation and Machine Learning), 2005
REFERENCES
PREREQUISITE
Object Oriented Programming Paradigm using C++ and JAVA.
Data Structures.
COURSE OBJECTIVES
To learn the fundamentals of Database Management Systems, different data models and
SQL.
To understand the importance of normalization in relational databases.
To know the basic concepts of transaction processing, concurrency control techniques
and recovery procedures.
To have an introductory knowledge about Query processing and optimization.
To learn various databases such as Distributed database, MongoDB and Apache
Cassandra.
COURSE OUTCOMES
Blooms
CO. No. Course Outcome
level
At the end of the course students are able to
Discuss the fundamental database concepts, Various Data models,
CO1 C2
relational database concepts and SQL fundamentals
CO2 Apply normalization for different applications. C3
CO3 Describe transaction concepts and its techniques. C2
Explain the importance of query processing and optimization and
CO4 C4
analyze the same for respective applications
CO5 Apply and Analyze different databases C4
CO6 Design and Develop different applications using various Databases C6
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 2 - - - - - - - - - 3 -
CO2 3 3 2 - - - - - - - - - 3 -
CO3 3 3 2 - - - - - - - - - 3 -
CO4 3 3 2 - - - - - - - - - 3 -
CO5 3 3 3 2 - - - - - - - - 3 -
CO6 3 3 3 2 2 - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
LEARNING RESOURCES
TEXT BOOKS
REFERENCES
PREREQUISTE
COURSE OBJECTIVES
COURSE OUTCOMES
Blooms
CO. No. Course Outcome
level
At the end of the course students will be able to
CO1 Explain the use and program in the programming language R C2
CO2 Discuss the use of R to solve statistical problems C2
CO3 Explain the concepts of Monte Carlo the technology C2
Illustrate the implementation and describe Monte Carlo the
CO4 C3
technology
CO5 Apply programming concepts to minimize and maximize functions
C3
using R.
CO6 Explain the concept of advanced technology and its applications C2
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 2 - - - - - - - - - 3 -
CO2 3 3 2 - - - - - - - - - 3 -
CO3 3 3 2 - - - - - - - - - 3 -
CO4 3 3 2 - - - - - - - - - 3 -
CO5 3 3 3 2 2 - - - - - - - 3 -
CO6 3 3 3 2 2 - - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
UNIT I - Introduction 9
Overview of R, R data types and objects, reading and writing data, sub setting R Objects,
Essentials of the R Language, Installing R, Running R, Packages in R, Calculations, Complex
numbers in R, Rounding, Arithmetic, Modulo and integer quotients, Variable names and
assignment, Operators, Integers, Factors, Logical operations
Control structures, functions, scoping rules, dates and times, Introduction to Functions, preview
of Some Important R Data Structures, Vectors- Generating sequences, Vectors and subscripts,
Extracting elements of a vector using subscripts, Working with logical subscripts, Scalars,
Vectors, Arrays, and Matrices, Adding and Deleting Vector Elements, Obtaining the Length of a
Vector, Matrices and Arrays as Vectors Vector Arithmetic and Logical Operations, Vector
Indexing, Common Vector Operations, Character Strings, Matrices, Lists, Data Frames, Classes.
Creating Lists, General List Operations, List Indexing Adding and Deleting List Elements,
Getting the Size of a List, Extended Example: Text Concordance Accessing List Components
and Values Applying Functions to Lists, Data Frames, Creating Data Frames, Accessing Data
Frames, Other Matrix-Like Operations.
Functions, Calculating a Probability, Cumulative Sums and Products, Minima and Maxima,
Calculus, Functions for Statistical Distributions
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
1. R Programming for Data Science by Roger D. Peng , Leanpug publications, July 2015.
2. The Art of R Programming by Prashanth singh, Vivek Mourya, Cengage Learning
India.
REFERENCES
PREREQUISITE
COURSE OBJECTIVES
To understand the health data formats, health care policy and standards.
To learn the significance and need of data analysis and data visualization.
To understand the health data management frameworks.
To learn the use of machine learning and deep learning algorithms in healthcare.
To apply healthcare analytics for critical care applications.
COURSE OUTCOMES
CO No. PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO 1 PSO 2
CO1 3 3 3 - - - - - - - - - 3 -
CO2 3 3 3 - - - - - - - - - 3 -
CO3 3 3 3 2 - 2 - - - - - - 3 -
CO4 3 3 3 2 - 2 - - - - - - 3 -
CO5 3 3 3 2 - 2 - - - - - - 3 -
CO6 3 3 3 2 - 2 - - - - - - 3 -
Note: - 1: Slight 2: Moderate 3: Substantial
Overview - History of Healthcare Analysis Parameters on medical care systems- Health care
policy- Standardized code sets – Data Formats – Machine Learning Foundations: Tree Like
reasoning, Probabilistic reasoning and Bayes Theorem, Weighted sum approach.
IOT- Smart Sensors – Migration of Healthcare Relational database to NoSQL Cloud Database –
Decision Support System – Matrix block Cipher System – Semantic Framework Analysis ––
Clinical Prediction Models – Visual Analytics for Healthcare.
Introduction on Deep Learning – DFF network CNN- RNN for Sequences – Biomedical Image
and Signal Analysis – Natural Language Processing and Data Mining for Clinical Data –
Mobile Imaging and Analytics – Clinical Decision Support System.
UNIT V- APPLICATIONS 9
Applications and Practical Systems for Healthcare - Fraud Detection in Healthcare- Data
Analytics for Pharmaceutical Discoveries Clinical Decision Support Systems.
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
REFERENCES
3. Vikas Kumar, “Health Care Analysis Made Simple”, Packt Publishing, 2018.
4. Nilanjan Dey, Amira Ashour , Simon James Fong, Chintan Bhatl, “Health Care Data
Analysis and Management, First Edition, Academic Press, 2018.
5. Kulkarni , Siarry, Singh ,Abraham, Zhang, Zomaya , Baki, “Big Data Analytics in
HealthCare”, Springer, 2020.
PREREQUISITE
COURSE OBJECTIVES
COURSE OUTCOMES
Blooms
CO. No. Course Outcome
level
CO
PSO1
PSO2
PO10
PO11
PO12
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 - - - - - - - - - - - -
CO2 3 2 2 - - - - - - - - 3 -
CO3 - - 3 - - - - - - - - 3 -
CO4 3 2 3 - - - - - - - - -
CO5 3 3 - - - - - - - - - 3 -
CO6 3 - 3 - - - - - - - - - 3 -
Named Entity Recognition – Opinion Mining using Recurrent Neural Networks – Parsing and
Sentiment Analysis using Recursive Neural Networks – Sentence Classification using
ConvolutionalNeural Networks – Dialogue Generation with LSTMs.
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
REFERENCES
PREREQUISITE
COURSE OBJECTIVES
COURSE OUTCOMES
Blooms
CO. No. Course Outcome
level
At the end of the course students are able to
CO5 Illustrate data analytics and use cloud offerings related to IoT. C3
CO
PSO1
PSO2
PO10
PO11
PO12
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 - - - - - - - - - - - -
CO2 3 2 2 - - - - - - - - 3 -
CO3 - - 3 - - - - - - - - 3 -
CO4 3 2 3 - - - - - - - - -
CO5 3 3 - - - - - - - - - 3 -
CO6 3 - 3 - - - - - - - - - 3 -
IoT Access Technologies: Physical and MAC layers, Network Layer: IP versions, Constrained
Nodes and Constrained Networks – Optimizing IP for IoT: From 6LoWPAN to 6Lo, Routing
over Low Power and Lossy Networks –Application Layer Protocols: CoAP and MQTT.
Structured Vs Unstructured Data and Data in Motion Vs Data in Rest – Role of Machine
Learning– No SQL Databases – Amazon Web Services for IoT - Sky Net IoT Messaging
Platform - Case Study on Smart Parking and Air Pollution Monitoring.
Cisco IoT system - IBM Watson IoT platform – Manufacturing - Converged Plantwide Ethernet
Model (CPwE) – Power Utility Industry – Grid Blocks Reference Model - Smart and Connected
Cities: Layered architecture, Smart Lighting, Smart Parking Architecture and Smart Traffic
Control.
Total: 45 Periods
LEARNING RESOURCES
TEXT BOOKS
REFERENCES
PREREQUISITE
COURSE OBJECTIVES
COURSE OUTCOMES
CO1 Demonstrate the open source search engine framework and explore its
C2
capabilities
CO
PSO1
PSO2
PO10
PO11
PO12
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 3 3 - - - - - - - - - 3 -
CO2 3 3 1 - - - - - - - - - 3 -
CO3 3 3 3 - - - - - - - - - 3 -
CO4 3 3 3 - - - - - - - - - 3 -
CO5 3 3 2 - - - - - - - - - 3 2
CO6 3 3 3 - - - - - - - - - 3 3
LEARNING RESOURCES
TEXT BOOKS
REFERENCES
PREREQUISITE
COURSE OUTCOMES
CO3 Demonstrate the skills to perform various tests in the given data. C3
CO
PSO1
PSO2
PO10
PO11
PO12
PO1
PO2
PO3
PO4
PO5
PO6
PO7
PO8
PO9
No.
CO1 3 - - - - - - - - - - - -
CO2 3 2 2 - - - - - - - - 3 -
CO3 - - 3 - - - - - - - - 3 -
CO4 3 2 3 - - - - - - - - -
CO5 3 3 - - - - - - - - - 3 -
CO6 3 - 3 - - - - - - - - - 3 -
Why hypothesis tests? – Strong or weak decisions – one-tailed and two-tailed tests – case studies
-Influence of sample size – power and sample size-Estimation – point estimate – confidence
interval – level of confidence – effect of sample size.
t-test for one sample – sampling distribution of t – t-test procedure – degrees of freedom –
estimating the standard error – case studies-t-test for two independent samples – statistical
hypotheses – sampling distribution – test procedure– p-value – statistical significance –
estimating effect size.
LEARNING RESOURCES
TEXT BOOKS
1. Robert S. Witte and John S. Witte, “Statistics”, Eleventh Edition, Wiley Publications,
2017.
2. Allen B. Downey, “Think Stats: Exploratory Data Analysis in Python”, Green Tea
Press,2014.
REFERENCES
3.David Spiegelhalter, “The Art of Statistics: Learning from Data”, Pelican Books, 2020.
4.Peter Bruce, Andrew Bruce, and Peter Gedek, “Practical Statistics for Data
Scientists”,Second Edition, O’Reilly Publishers, 2020.
5.Charles R. Severance, “Python for Everybody: Exploring Data in Python 3”, Shroff
Publishers, 2017.
6.Bradley Efron and Trevor Hastie, “Computer Age Statistical Inference”, Cambridge
University Press, 2016.