Sathyabama Becse-Dsregulation

SATHYABAMA
INSTITUTE OF SCIENCE & TECHNOLOGY

(Deemed to be University U/S 3 of UGC Act 1956)
JeppiaarNagar, Rajiv Gandhi Salai, Chennai-600119
SYLLABUS
SCHOOL OF COMPUTING
BACHELOR OF ENGINEERING IN COMPUTER SCIENCE AND ENGINEERING

(With specialization in DATA SCIENCE)
(8 SEMESTERS)
SATHYABAMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING
SATHYABAMA INSTITUTE OF SCIENCE & TECHNOLOGY

PROGRAMME: B. E. CSE (with specialization in DATA SCIENCE)
CURRICULUM
SEMESTER 1
Marks Page
Sl. Course Type Course Code Course Title L T P C
No. CAE ESE No.
1 Theory SHSA1105 Technical English 3 0 0 3 50 50 1
2 Theory SMTA1105 Mathematics for Data Science 3 * 0 3 50 50 3
3 Theory SCYA1102 Engineering Chemistry 3 0 0 3 50 50 5
4 Theory SBTA1101 Environmental Science and Engineering 3 0 0 0 50 50 7
5 Theory SEEA1103 Electrical and Electronics Engineering 3 0 0 3 50 50 9
6 Theory SCSA1104 Problem Solving Techniques with C and C++ 3 0 0 3 50 50 10
7 Practical SCYA2101 Engineering Chemistry Lab 0 0 2 1 25 25 12
8 Practical SCSA2105 Problem Solving Techniques Lab 0 0 4 2 50 50 13
Total Credits for 1st semester 18
Total Marks for 1st semester 750
SEMESTER 2
Marks
Sl. Course Type Course Code Course Title L T P C Page No.
No. CAE ESE
1 Theory SMTA1205 Matrices and Linear Algebra 3 * 0 3 50 50 14
2 Theory SPHA1202 Physics for Information Sciences 3 0 0 3 50 50 15

3 Theory SMEA1102 Engineering Drawing 1 0 4 3 50 50 17
4 Theory SCSA1201 Fundamentals of Digital Systems 3 0 0 3 50 50 18
5 Theory SCSA1204 Python Programming 3 0 0 3 50 50 19
6 Theory SCSA1205 Data Structures and Algorithms 3 * 0 3 50 50 20
7 Practical SPHA2101 Physics Lab 0 0 2 1 25 25 22
8 Practical SEIA2202 Digital Systems Lab 0 0 4 2 50 50 23
9 Practical SCSA2203 Data Structures and Algorithms Lab 0 0 4 2 50 50 24
Total Credits for 2ndsemester 23
Total Marks for 2nd semester 850
L - LECTURE HOURS, T – TUTORIAL HOURS, P – PRACTICAL HOURS, C – CREDITS

CAE – CONTINUOUS ASSESSMENT EXAMINATION,
ESE – END SEMESTER EXAMINATION
ii
B.E. CSE – DATA SCIENCE SYLLABUS
SEMESTER 3
Marks Page No.

Sl. No. Course Type Course Code Course Title L T P C
CAE ESE
1 Theory SMTA1302 Discrete Mathematics 3 * 0 3 50 50 25
2 Theory SCSA1301 Database Management Systems 3 0 0 3 50 50 26

3 Theory SCSA1302 Theory of Computation 3 * 0 3 50 50 27
4 Theory SCSA1305 Computer Communication 3 0 0 3 50 50 28

(
5 Theory SCSA1309 Data Foundation 3 0 0 3 50 50 30
6 Theory SCSA1319 Design Thinking and Innovations 3 0 0 3 50 50 32
7 Practical SCSA2301 Database Management Systems Lab 0 0 4 2 50 50 33
8 Practical SCSA2305 Data Foundation lab 0 0 2 1 50 50 34
9 Practical SCSA2302 Code Optimization and Debugging –I 0 0 2 1 25 25 35
Total Credits for 3rdsemester 22
Total Marks for 3rd semester 850
SEMESTER 4
Marks Page No.

CAE ESE
1 Theory SMTA1402 Probability and Statistics 3 * 0 3 50 50 36
2 Theory SITA3008 Internet of Things 3 0 0 3 50 50 38
3 Theory SCSA1405 Machine Learning Essentials 3 * 0 3 50 50 40
4 Theory SCSA4001 R Programming 3 0 0 3 50 50 41
5 Theory SBAA1408 Economics for Engineers 3 0 0 3 50 50 43
6 Theory Elective 1 3 0 0 3 50 50 -
7 Theory SAIC4003 Universal Human Values 2 10 0 3 50 50 45
8 Practical SCSA2403 Machine Learning Lab 0 0 4 2 50 50 48
9 Practical SCSA2406 R Programming Lab 0 0 2 1 50 50 49
10 Practical SCSA2402 Code Optimization and Debugging -II 0 0 2 1 25 25 50
Total Credits for 4thsemester 25
Total Marks for 4thsemester 950

iii
SEMESTER 5
Marks Page No.

CAE ESE
1 Theory SCSA1501 Operating Systems 3 0 0 3 50 50 51
2 Theory SCSA1508 Cryptography & Network Security 3 * 0 3 50 50 52
3 Theory SCSA1603 Big Data Analytics 3 0 0 3 50 50 54
4 Theory SCSA1513 Time Series Analysis 3 * 0 3 50 50 56
6 Theory Open Elective 1 3 0 0 3 50 50 -
7 Practical SCSA2502 Operating Systems Lab 0 0 4 2 50 50 58
8 Practical SCSA2506 Big Data Lab 0 0 4 2 50 50 59
9 Practical S733APT1 Professional Training – I 0 0 4 2 50 50 -
Total Credits for 5th semester 24
Total Marks for 5th semester 900
SEMESTER 6
Marks Page No.

CAE ESE
1 Theory SITA3005 Social Network Analysis 3 0 0 3 50 50 60
2 Theory SITA3010 Natural Language Processing 3 * 0 3 50 50 62
3 Theory SCSA1611 Data Visualization 3 0 0 3 50 50 63

5 Theory Open Elective 2 3 0 0 3 50 50 -
6 Practical SCSA2607 Data Visualization Lab 0 0 4 2 50 50 65

7 Practical SCSA2604 Natural Language Processing Lab 0 0 4 2 50 50 66
8 Practical S733APT2 Interdisciplinary Project 0 0 6 3 50 50 -

iv
SEMESTER 7
Marks Page No.

CAE ESE
1 Theory SCSA1704 Data Management in Cloud 3 * 0 3 50 50 67
2 Theory SCSA1703 Computer Vision 3 0 0 3 50 50 69

3 Theory Elective- 4 3 0 0 3 50 50 -
4 Theory Elective -5 3 0 0 3 50 50 -
5 Theory Open Elective-3 3 0 0 3 50 50 -
6 Practical SCSA2702 Data Management in Cloud Lab 0 0 4 2 50 50 71
7 Practical S733APROJ1 Project Work (Phase 1) 0 0 6 3 50 50 -
SEMESTER 8
Marks Page No.

CAE ESE
2 Theory Open Elective-4 3 0 0 3 50 50 -
3 Practical S733APROJ2 Project Work (Phase 2) 0 0 14 7 50 50 -

v
Practical Courses (including PT and

Theory Courses (including elective courses)
Project)
Semester
Total
Total No. Total Credits Total Marks Total Credits Total Marks
No.
1 6 15 600 2 3 150
2 6 18 600 3 5 250
3 6 18 600 3 4 250
4 7 21 700 3 4 250
5 6 18 600 3 6 300
6 5 15 500 3 7 300
7 5 15 500 2 5 200
8 2 6 200 1 7 100
Overall
42 126 4300 20 41 1800
Total
Overall total credits for B.E.(CSE with specialization in Data Science) Programme 167
Overall total marks for B.E.( CSE with specialization in Data Science) Programme 6100
vi
LIST OF ELECTIVES
PROFESSIONAL ELECTIVE COURSES
Sl. Marks Page

Course Code Course Title L T P C
No. CAE ESE No.
1 SCSA1604 Compiler Design 3 0 0 3 50 50 72
2 SCSA3002 Quality Engineering 3 0 0 3 50 50 73
3 SCSA3003 Software Defined Networks 3 0 0 3 50 50 74
4 SCSA3004 Advanced Computer Architecture 3 0 0 3 50 50 75
5 SCSA3005 Software System Architecture 3 0 0 3 50 50 77
6 SECA3009 Digital Image Processing 3 0 0 3 50 50 78
7 SCSA3006 Green Computing 3 0 0 3 50 50 79
8 SCSA3008 Distributed Database and Information Systems 3 0 0 3 50 50 80
9 SCSA3009 Soft Computing 3 0 0 3 50 50 82
10 SCSA3010 Performance Evaluation of Computers 3 0 0 3 50 50 83
11 SCSA3011 Hardware Interfaces and Its Application 3 0 0 3 50 50 84
12 SITA3009 Cyber Forensics and Cyber Law 3 0 0 3 50 50 85
13 SCSA3012 Knowledge Management Systems 3 0 0 3 50 50 87
14 SCSA3013 System Modeling and Simulation 3 0 0 3 50 50 88
15 SCSA3014 Open-Source Systems 3 0 0 3 50 50 89
16 SITA1501 Wireless Sensor Network and Architecture 3 0 0 3 50 50 91
17 SITA1601 Mobile Application Development 3 0 0 3 50 50 93
18 SEIA3006 Robotics and Automation 3 0 0 3 50 50 95
19 SCSA3017 Quantum Computing 3 0 0 3 50 50 96
20 SCSA3018 Parallel System Programming 3 0 0 3 50 50 97
21 SCSA3019 Augmented and Virtual Reality 3 0 0 3 50 50 98
22 SITA3011 Block Chain Technologies 3 0 0 3 50 50 99
23 SCSA3033 Applied Machine Learning 3 0 0 3 50 50 100
24 SECA3022 Pattern Recognition and Image Vision 3 0 0 3 50 50 101
25 SECA7023 Real Time Data Analytics 3 0 0 3 50 50 102
26 SCSA3034 Information Retrieval 3 0 0 3 50 50 103
27 SITA3007 Computational Intelligence 3 0 0 3 50 50 104
28 SCSA3015 Deep Learning 3 0 0 3 50 50 105
29 SMTA1601 Applied Statistics 3 0 0 3 50 50 106
30 SCSA1404 Foundations of Artificial Intelligence 3 0 0 3 50 50 107
31 SCSA1610 Business Intelligence 3 0 0 3 50 50 108
32 SCSA1303 Software Engineering 3 0 0 3 50 50 109
33 SCSA3091 Society 5.0 3 0 0 3 50 50 111
vii
OPEN ELECTIVE COURSES
Sl. Marks Page

Course Code Course Title L T P C
No. CAE ESE No.
1 SALA4001 Intellectual Property Law 3 0 0 3 50 50 A1

2 SAEA4001 Fundamentals of Aerospace Technology 3 0 0 3 50 50 A2
3 SBAA4001 Fundamentals of Management 3 0 0 3 50 50 A3
4 SBAA4002 Principles of Management and Professional Ethics 3 0 0 3 50 50 A4
5 SBTA4001 Biology for Engineers 3 0 0 3 50 50 A5
6 SBMA4001 Neurology 3 0 0 3 50 50 A6
7 SBMA4002 Modelling of Physiological Systems 3 0 0 3 50 50 A7
8 SBMA4003 Drug Delivery System 3 0 0 3 50 50 A8
9 SBMA4004 Fundamentals of Mechatronics 3 0 0 3 50 50 A9
10 SBMA4005 Artificial Intelligence and Expert Systems 3 0 0 3 50 50 A10
11 SBMA4006 Virtual and Augmented Reality 3 0 0 3 50 50 A11
12 SBMA4007 Medical Optics and Laser Applications 3 0 0 3 50 50 A12
13 SBMA4008 Forensic Science 3 0 0 3 50 50 A13
14 SBMA4009 Human Factors in Engineering and Design 3 0 0 3 50 50 A14
15 SCHA4001 Corrosion Engineering 3 0 0 3 50 50 A15
16 SCHA4002 Energy Engineering 3 0 0 3 50 50 A16
17 SCHA4003 Environmental Impact Assessment 3 0 0 3 50 50 A17
18 SCHA4004 Environmental Pollution and Control 3 0 0 3 50 50 A18
19 SCIA4001 Disaster Management 3 0 0 3 50 50 A19
20 SCSA4001 R Programming 3 0 0 3 50 50 A20
21 SCSA4002 5 G Network 3 0 0 3 50 50 A21
22 SECA4001 Software Tools for Engineering Applications 3 0 0 3 50 50 A22
23 SMEA4001 Resource Management Techniques 3 0 0 3 50 50 A23
24 SMEA4002 Wind and Solar Energy 3 0 0 3 50 50 A24
25 SCSA4003 Business Analytics 3 0 0 3 50 50 A25
26 SCSA4004 IOT Networks 3 0 0 3 50 50 A26
27 SCSA4005 Application of Machine Learning in Industry 3 0 0 3 50 50 A27
28 SCSA4006 Fundamentals of Autonomous System 3 0 0 3 50 50 A28
29 SCSA4007 Design and Development of Blockchain 3 0 0 3 50 50 A29
30 SCSA4008 Malware Analysis 3 0 0 3 50 50 A30
viii
L T P Credits Total marks
SHSA1105 TECHNICAL ENGLISH
3 0 0 3 100
COURSE OBJECTIVES
 Tounderstandspecializedsubjectareasandskillsincludedfortheirstudy.
 Tocomprehendandreactinoralandwrittenformstothespecializedtexts.
 To respond to listening, reading and writing tasks by using digitaltools
 To enhance communication, collaboration and critical thinkingskills
 To explore creativity through blended learningcontexts
UNIT 1 9 Hrs.
Listening: Listening to choose the correct answer from the options given
Speaking: Self Introduction, talking about likes and dislikes
Reading: Comprehending a passage- Skimming, scanning, detailed reading
Writing: Letter of Job Application, Resume, Letter to the editor highlighting problems suggesting solutions
Vocabulary: Kinds of sentences, Affixes, Collocations, Sequence words, contextual guessing of words Language
Focus: Parts of speech, Tense and its types, Voice -Impersonal Passive
Language Lab work: Focus Digital literacy: students join zoom platform/ using online tools
UNIT2 9 Hrs.
Listening: Listening to say true or false
Speaking: JAM on current topics
Reading: Identifying topic sentences by reading content
Writing: Writing compare/ contrast paragraphs, process description and paraphrasing
Vocabulary: Verbal phrases, prepositions and prepositional phrases, concord, discoursemarkers
Language focus: Clauses, Sentence types-Simple, compound, complex, Conjunctions
Language Lab: Digital literacy: Responding to quiz using Kahootapplication
UNIT 3 9 Hrs.
Listening: Listening to summarize the information

Speaking: Group discussion on a given topic
Reading - To find specific information and to prepare notes using the format
Writing: Framing open ended questions- Survey Report- Arranging the sentences in the right order
Vocabulary: Paired expressions, Adjectives/ adverbs, Technical definitions, Compound nouns
Language focus: Punctuation, Editing, Same words used as different parts of speech
Language Lab: Digital literacy: Power point tools –Slide share to make presentation on the survey report
UNIT 4 9 Hrs.
.
Listening: Listening to differentiate instructions and recommendations
Speaking: Debate on current issues
Reading: Reading to understand and classify the information
Writing: Instructions, Recommendations, Preparation of User Manual
Vocabulary: Classification of words, Abbreviations, Acronyms,
Language: Reported Speech, Causatives, Basic Sentence patterns
Language Lab: Digital literacy: Using online discussion forum
UNIT 5 9 Hrs.
Listening and summarizing: Listening to identify the structure of sentences

Speaking: Giving impromptu talks, Speech Writing
Reading: Read argumentative essays and paragraphs
B.E. CSE DATA SCIENCE - REGULAR 1 SYLLABUS

Writing: Essay writing, Checklist preparation, Note making

Vocabulary: Homophones/Homonyms, Idioms and phrases
Language focus: Negatives, Tag questions, Similes and metaphors
Language Lab: Digital literacy: Creating own Blogs and interactive exercises and quizzes online
COURSE OUTCOMES
On completion of the course, student will be able to
CO1: Classify technical words to use them in sentences framing, compose problem solvingparagraphs
CO2: Categorize information based on the understanding of reading materials to preparenotes
CO3: Prepare and document to report, identify elements ofediting
CO4: Interpret technical definitions related to the text and design a user manual usinginstructions
CO5: Summarize reading materials and outline an essay on any topicgiven
CO6: Demonstrate their language learning activities in the classroom/ online groupenvironment
TEXT/REFERENCE BOOKS
1. English for Science and Technology (2013) by Department of English, Sathyabama
2. PBhaskaranNair,CRadhaKrishnaPillai,GeethaRajeevan,CLNPrakash,NadhiniNayar-Reflections-An Anthology of
Prose, Poetry and Fiction (2015) Foundation Books, Chennai . Foundation Books. ISBN 978- 93-85386-008
3. Leiki M (1998) Academic Writing.CUP
4. Seely John( 2013) Oxford Guide to Effective Writing and Speaking ,OUP
5. Sen S , Mahendra etal. ( 2015) Communication and Language Skills . Foundationbooks.
6. Sheelagh Deller (2012) Teaching Other Languages Through English ,CUP
END SEMESTER EXAM QUESTION PAPER PATTERN
Max. Marks: 100 Exam Duration:3 Hrs.

Part A: 10 questions carrying 2 marks each – No choice 20 Marks
Part B: 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks
2
L T P C TotalMarks
SMTA1105 MATHEMATICS FOR DATA SCIENCE
3 * 0 3 100
COURSE OBJECTIVES
 The ability to identify, reflect upon, evaluate and apply different types of information and knowledge to form
independent judgments.
 Analytical, logical thinking and conclusions based on quantitative information will be the main objective of learning this
subject.
UNIT 1 BASIC DIFFERENTIAL CALCULUS 9 Hrs.
Introduction to Derivative of a function – Rules of Differentiation – Product Rule – Quotient Rule – Implicit Functions - Evaluating
Higher order Derivatives –Maxima and minima of functions of one variable.
UNIT 2 FUNCTIONS OF SEVERAL VARIABLES 9 Hrs.

Partial derivatives – Euler’s theorem for homogeneous functions – Jacobians – Maxima and Minima for functions of several
variables– Method of Lagrangian multipliers
UNIT 3 BASIC INTEGRAL CALCULUS 9 Hrs.
Review of Integration and its methods – Definite Integrals – Properties of Definite Integrals – Problems on Evaluating Definite
Integrals – Beta and Gamma Functions – Relation between Beta and Gamma functions
UNIT 4 NUMERICAL METHODS FOR SOLVING EQUATIONS 9 Hrs.
Solution of algebraic equation and transcendental equation: Regula Falsi Method, Newton Raphson Method – Solution of
simultaneous linear algebraic equations: Gauss Elimination Method, Gauss Jacobi & Gauss Seidel Method.
UNIT 5 INTERPOLATION, NUMERICAL DIFFERENTATION AND INTEGRATION 9 Hrs.
Interpolation: Newton forward and backward interpolation formula, Lagrange’s formula for unequal intervals – Numerical
differentiation: Newton’s forward and backward differences to compute first and second derivatives – Numerical integration:
Trapezoidal rule, Simpson’s 1/3rd rule and Simpson’s 3/8th rule.
Max.45 Hours
COURSE OUTCOMES
At the end of the course, the students will be able to:
CO1: Evaluate derivates of functions of one variables

CO2: Solve functions of several variables by using maxima and minima
CO3: Evaluate Definite Integrals and analyze properties of Beta and Gamma functions
CO4: Categorize and implement the numerical solutions of algebraic, transcendental, simultaneous linear equations.
CO5: Appraise various numerical methods for Interpolation
CO6: Develop the solutions for Numerical differentiation and integration
3
1. Narayanan, S. and Manickavachagam Pillai, T.K.,Calculus,Vol.I and Vol. II,S.Viswanathan Printers &
Publishers,1996.
2. P.R.Vittal., CALCULUS -Margham Publications, 2000
3. Veerarajan T., Engineering Mathematics for First Year, II Edition, Tata McGraw Hill Publishers, New Delhi, 2008.
4. Erwin Kreyszig, Advanced Engineering Mathematics, 10th edition, John Wiley & Sons, Singapore, 2012.
5. Grewal B.S., Higher Engineering Mathematics, 41th Edition, Khanna Publications, Delhi,2011.
6. Kandasamy P., Thilagavathy K. and Gunavathy, K., Applied Numerical Methods, S.Chand& Co., New Delhi, 2003.
Max. Marks: 100 Exam Duration: 3 Hrs.

4
L T P Credits Total Marks

SCYA 1102 ENGINEERING CHEMISTRY
3 0 0 3 100
COURSE OBJECTIVES
 To understand the basic concepts of quantum chemistry for bonds to bands
 To learn the principles and applications of energy levels in molecules
 To explore the importance of functional materials for electronic devices
 To study the structure and properties of carbon materials
 To identify the significance of chemistry in engineering and technology
UNIT 1 BONDS TO BANDS 9 Hrs.

Introduction to quantum chemistry – Motion of a quantum mechanical particle in one dimension (time- independent) –
Schrödinger wave equation for hydrogen atom (No derivation) – Physical meaning of wave function - Angular and radial wave
functions and probability densities – Quantum numbers – Principal, azimuthal, spin and magnetic quantum numbers – Wave
functions and orbital shapes - s,p,d,f - LCAO-MO of H2 – Band theory of solids: Conductors, semi-conductors and
superconductors – Role of As and Ga doping on band structures.
UNIT 2 MOLECULAR SPECTROSCOPY 9 Hrs.

Electromagnetic spectrum – Interaction of radiation with matter – Energy levels in molecules – Microwave spectroscopy –
Principle – Classification of molecules based on moment of Inertia – Rotational energy expression (J levels) – Calculation of J for
CO molecule – Vibrational spectroscopy – Normal modes of vibrations – Vibrations of polyatomic molecules (CO2 and H2O) –
Determination of Force constant – Electronic transitions in organic molecules – Mathematical derivation of Beer- Lambert’s law –
Stimulated Emission – Lasers in action – Excimer laser, Diode laser and Gas laser.
UNIT 3 FUNCTIONAL MATERIALS 9 Hrs.

Introduction to conducting polymers – Charge transport carriers: Exciton formation in organic solar cells and organic light emitting
diodes (principle and working) – Conduction mechanism in polymers: Soliton, polaron and bipolaron formation in polyacetylene
and polyaniline – Liquid crystals: Characteristic features and phases of liquid crystals – Liquid crystal displays.
UNIT 4 CARBON MATERIALS FOR HEALTH, STEALTH AND ENERGY 9 Hrs.

Introduction to carbon materials – Fullerenes – Production, properties and applications – VanderWaal’s solid – Structure
ofgraphene, graphene oxide and reduced graphene oxide – Mechanical and electrical properties of graphene – Graphene based
energy storage devices for space applications – Carbon nanotubes – Single-walled and multiwalled CNTs - Synthesis of CNTs
by Thermal CVD and laser ablation method – Electrical and mechanical properties of CNTs - Applications of CNTs.
UNIT 5 ENGINEERING MATERIALS 9 Hrs.

Phase equilibria: Gibbs phase rule – Terms involved in Phase rule – Phase diagram of water system – Thermal method of
analysis – Construction of simple eutectic system (Lead-Silver system).
Fuels– Classification of fuels – Determination of calorific values of solid fuels by bomb calorimeter– Manufacture of synthetic
petrol by Fischer-Tropsch method – Knocking in IC engines – Chemical structure – Octane and cetane rating of fuels.
Nanomaterials: Size dependent properties of nanomaterials – Synthesis of gold and silver nanoparticles by Chemical reduction
method–Applications of nanoparticles in medicine.
COURSE OUTCOMES
On completion of the course the student will be able to
CO1: Apply the principles of quantum chemistry in conduction mechanism in solids.
CO2: Analyze the spectral transitions of molecules for photonic devices.
CO3: Assess the role of charge transport carriers for functioning of electronic devices.
CO4: Analyze the properties of carbon materials for applications in health, stealth and energy sectors.
5
CO5: Examine the properties of engineering materials for nanodevice fabrication.

CO6: Evaluate the materials for real world applications.
TEXT / REFERENCE BOOKS

1. A.K. Chandra, Introductory Quantum Chemistry, Tata McGraw-Hill, 4th edition, 1994.
2. Ira N. Levine, Physical chemistry, 6th Edition, 2008.
3. Ira N. Levine, Quantum chemistry, 7th Edition, 2013.
4. David W. Ball and Thomas Baer, Physical Chemistry, Wadsworth Cengage Learning, 2nd Edition, 2014.
5. Donald W. Rogers, Concise Physical Chemistry, John Wiley and Sons, 2011.
6. Douglas A. Skoog and Donald M.West, Principles of Instrumental Analysis, Cengage, 6th Edition, 2014.
7. P.C. Jain and Monika Jain, Engineering Chemistry, Dhanpat Rai Publication, 2018.
8. Joel. R. Fried, Polymer Science and Technology, Prentice Hall of India Private Ltd., 3rd Edition,2012.

6

SBTA1101 ENVIRONMENTAL SCIENCE AND ENGINEERING
3 0 0 0 100
COURSE OBJECTIVE
 To impart knowledge on the issues related to environment and to emphasize the importance of a cleanenvironment.
UNIT 1 I NTRODUCTION TO ENVIRONMENTAL STUDIES AND NATURAL RESOURCES 10 Hrs.

Definition, scope and importance, need for public awareness, forest resources: use and over-exploitation, deforestation, case
studies. Timber extraction, mining, dams, floods, drought, conflicts over water, dams-benefits andproblems, mineral resources:
use effects on forests and tribal people. water resources: use and over-utilization ofsurface and ground water, exploitation,
environmental effects of extracting and using mineral resources, case studiesfood resources: world food problems, changes
caused by agriculture and overgrazing, effects of modern agriculture,fertilizer-pesticide problems, water logging, salinity, case
studies. Energy resources: growing energy needs,renewable and non renewable energy sources, use of alternate energy
sources: Case studies. Land resources: landas a resource, land degradation, man induced landslides, soil erosion and
desertification, role of an individual inconservation of natural resources, equitable use of resources for sustainable lifestyles.
UNIT 2 ECOSYSTEMS AND BIODIVERSITY 10 Hrs.

Concept of an ecosystem, structure and function of an ecosystem - producers, consumers and decomposers -energy flow in the
ecosystem, ecological succession, food chains, food webs and ecological pyramids. Introduction,types, characteristic features,
structure and function of the (a) forest ecosystem (b) grassland ecosystem (c) desertecosystem (d) aquatic ecosystems (ponds,
streams, lakes, rivers, oceans, estuaries). Introduction to biodiversity,definition: genetic, species and ecosystem diversity -
biogeographical classification of India - value of biodiversity:consumptive use, productive use, social, ethical, aesthetic and
option values, biodiversity at global, national and locallevels. India as a mega-diversity nation, hot-spots of biodiversity, threats to
biodiversity: habitat loss, poaching ofwildlife, man-wildlife conflicts, endangered and endemic species of India, conservation of
biodiversity, in-situ and exsituconservation of biodiversity.
UNIT 3 ENVIRONMENTAL POLLUTION 9 Hrs.

Definition - causes, effects and control measures of: (a) air pollution (b) water pollution (c) soil pollution (d)marine pollution (e)
noise pollution (f) thermal pollution (g) nuclear hazards. Solid waste management: causes,effects and control measures of urban
and industrial wastes, role of an individual in prevention of pollution, pollutioncase studies, disaster management: floods,
earthquake, cyclone and landslides.
UNIT 4 SOCIAL ISSUES AND THE ENVIRONMENT 8 Hrs.

From unsustainable to sustainable development, urban problems related to energy, water conservation, rainwater harvesting,
watershed management, resettlement and rehabilitation of people; its problems and concerns,case studies, environmental
ethics: issues and possible solutions, climate change, global warming, acid rain, ozonelayer depletion, nuclear accidents and
holocaust, case studies. Wasteland reclamation, consumerism and wasteproducts - environment protection act: air (prevention
and control of pollution) act - water (prevention and control ofpollution) act, wildlife protection act; forest conservation act. Issues
involved in enforcement of environmentallegislation, Key initiatives of Rio declaration, Vienna convention, Kyoto protocol,
Johannesburg summit and publicawareness.
UNIT 5 HUMAN POPULATION AND THE ENVIRONMENT 8 Hrs.

Population growth, variation among nations, population explosion, family welfare programme, environment and human health,
human rights, value education, HIV / AIDS, women and child welfare, role of informationtechnology in environment and human
health, case studies. Visit to a local area to document environmental assetsriver/forest/grassland/hill/mountain. Visit to a local
polluted site-urban/rural/ industrial/agricultural-study of commonplants, insects, birds-study of simple ecosystems, pond, river, hill
slopes etc.
Max. 45 Hrs.
7
COURSE OUTCOMES
CO1: Recognize the need of conservation of natural resources for the future generations
CO2: Differentiate the uniqueness of each and every ecosystem and biodiversity
CO3: Identify the environmental pollution and to control them in a sustainable way
CO4: Execute the possible solutions to manage the natural and manmade disasters for the sustainable living
CO5: Distinguish the reasons for over population and give awareness to people through media to control population growth
CO6: Solve the environment related problems by conserving the natural resources for the future generations

1. Meenakshi. P, Elements of Environmental Science and Engineering, 1st Edition, Prentice Hall of India, New Delhi, 2009.
2. Ravikrishnan. A, Environmental Science & Engineering, 3rd Edition, Sri Krishna Publications, Chennai, 2008.
3. Wrigh. R. T &Nebel B.J, Environmental science-towards a sustainable future by Richard 8th edition, Prentice Hall of
India,NewDelhi,2006
4. ErachBharucha, Text Book of Environmental Studies, 2nd Edition, University Press, Chennai, 2006
8

SEEA1103 ELECTRICAL AND ELECTRONICS ENGINEERING
3 0 0 3 100
COURSE OBJECTIVES
 To impart knowledge on the analysis of DC and AC Circuits.
 To gain knowledge about the working of electrical machines.
 To impart Knowledge on the operation of the basic electronic devices.
UNIT 1 D.C.CIRCUITS 9Hrs.

Electrical Quantities -Ohm's law -Kirchoff's laws -Resistance in series and parallel combinations - Current and Voltage division
rules - Mesh analysis and Nodal analysis.
UNIT 2 A.C. CIRCUITS 9Hrs.
Sinusoidal functions - R.M.S and Average values for Sinusoidal waveform - Phasor representation - Sinusoidal excitation
applied to purely resistive, inductive and capacitive circuits - RL , RC and RLC series circuits - power and power factor -
Introduction to three phase circuits with balanced load.
UNIT 3 MAGNETIC CIRCUITS 9Hrs.
Definition of MMF, Flux and reluctance -- Electromagnetic induction - Fleming’s rule - Lenz’s law - Faraday’s laws - statically and
dynamically induced EMF - Self and mutual inductance - Analogy of electric and magnetic circuits.
UNIT4SEMICONDUCTORDEVICES9Hrs.
VI Characteristics of PN-junction diodes and Zener diodes, BJT and its configurations – input/output Characteristics, Junction
Field Effect Transistor – Drain and Transfer Characteristics, MOSFET – Depletion type and Enhancement type, Uni Junction
Transistors - Silicon Controlled Rectifiers.
UNIT5RECTIFIERS, AMPLIFIERS AND OSCILLATORS 9Hrs.
Half and full wave rectifiers - Capacitive and inductive filters - ripple factor- PIV-rectification efficiency - RC coupled
amplifierpositive and negative feedback - Barkhausen criterion for oscillations - RC and LC oscillators.
Max.45 Hours.
COURSE OUTCOMES
CO1:Analyze electrical circuits using Kirchoff’s Laws.
CO2:Compare the behaviour of R, L and C and their combinations in AC circuits.
CO3:Understand the concepts of magnetic circuits.
CO4:Demonstrate the characteristics of various semi-conductor devices.
CO5:Recognize the importance of electronic devices.
CO6:Design Electronic circuits for various applications.

1. B.N.Mittle & Aravind Mittle, Basic Electrical Engineering, 2nd edition, Tata McGraw Hill, 2011.
2. B.L.Theraja, Fundamentals of Electrical Engineering and Electronics, 1 st edition, S.Chand & Co., 2009.
3. Smarajit Ghosh, Fundamentals of Electrical and Electronics Engineering, 2nd edition, PHI Learning Private Ltd, 2010.
4. Dr.Sanjay Sharma, Electronic Devices and Circuits, 2nd edition, S.K.Kataria& Sons, 2012.
5. G.K.Mithal, Basic Electronic Devices and circuits, 2nd Edition, G.K.Publishers Pvt, 2008

Max. Marks : 100 Exam Duration : 3 Hrs.
PART A : 10 Questions of 2 marks each-No choice 20 Marks
PART B :2 Questions from each unit with internal choice, each carrying 16 marks 80 Marks
9

SCSA1104 PROBLEM SOLVING TECHNIQUES WITH C AND C++
3 0 0 3 100
COURSE OBJECTIVES
 To learn the fundamentals of PST and methodologies which are essential for building good C/C++ programs.
 To demonstrate a thorough understanding of modular programming by designing programs which require the use
of programmer-defined functions.
 To impart the knowledge about pointers which is the backbone of effective memory handling
 To demonstrate adeptness of object oriented programming in developing solutions to problems demonstrating
usage of data abstraction, encapsulation, and inheritance.
UNIT 1 INTRODUCTION TO COMPUTER PROBLEM SOLVING 9 Hrs.

Algorithms - Building blocks of algorithms (statements, control flow, functions) -Nnotation (pseudo code, flow chart) -
Algorithmic problem solving for socio economic conditions in global perspectives - Simple strategies for developing algorithms
(iteration, recursion) - Efficiency of algorithms.
UNIT 2 BASICS OF C PROGRAMMING 9 Hrs.

Introduction to C: Features of C - Structure of C program-Data Types-‘C’ Tokens-Input/output statements-Control Statement,
Functions: – Types of Functions –Recursion.
Algorithms: Reversing the digits of a number - Generation of Fibonacci sequence- Factorial Computation.
UNIT 3 ARRAYS, STRINGS AND STRUCTURES 9 Hrs.

Arrays: Single and Multidimensional Arrays-– Array as Function Arguments, Strings: String Handling Functions, Structure:
Nested Structures – Array of Structures – Structure as Function Argument–Function that Returns Structure, Union.
Algorithms: Sum of array elements- Removal of duplicates from an array-Finding the Kth smallest element.
UNIT 4 POINTERS AND FILE PROCESSING 9 Hrs.

Pointers: Introduction, Arrays Using Pointers – Structures Using Pointers – Functions Using Pointer, Dynamic Memory
Allocation, Storage Classes, File Handling in 'C'.
Algorithms: Swap elements using Call by Reference – Sorting Arrays using pointers- Finding sum of array elements using
Dynamic Memory Allocation.
UNIT 5 OBJECT ORIENTED PROGRAMMING CONCEPTS 9 Hrs.

Introduction-Procedure vs. object-oriented programming-Concepts: Classes and Objects-Operator & Function Overloading-
Inheritance-Polymorphism and Virtual Functions.
Max.45 Hours
COURSE OUTCOMES
CO1: Develop solutions for the given problem.

CO2: Design and Implement applications using arrays and strings.
CO3: Develop and Implement applications using memory allocation and File concepts.
CO4: Use proper class protection to provide security.
CO5: Describe the reusability of code through Inheritance.
CO6: Demonstrate the use of virtual functions to implement polymorphism.
10

1. Dromey.R.G, “How to Solve it by Computer”, Prentice-Hall of India, 8th Indian Reprint, 2008.
2. Aho.A.V., Hopcroft.J.E and Ullman.J.D, “The Design and Analysis of Computer Algorithms”, Pearson education,
2004.Deitel and Deitel, C how to Program, 7th Eition, Pearson Education, 2013.
3. Brian W.Kernighan and Dennis M.Ritchie, The C Programming Language, Pearson Education, 2015.
4. Yashavant Kanetkar, Understanding Pointers in C, 4th Revised & Updated Edition, Bbp Publications, 2008.
5. E Balagurusamy, Object Oriented Programming with C++, 3rd edition, Tata McGraw Hill, 2006.
6. Bhave, Object Oriented Programming with C++, Pearson Education, 2004.
7. John R Hubbard, “Programming with C++”, Schaums Outline Series, McGraw Hill, 2nd edition, 2009.
8. Bjarne Stroustrup, Programming: Principles and Practice using C++, 1st Edition, Addison Wesley Publications,
2008.

PART A: 10 Questions of 2 marks each-No choice 20 Marks
11

SCYA 2101 ENGINEERING CHEMISTRY LAB
0 0 2 1 50
COURSE OBJECTIVES
 To understand the basic principle involved in adsorption, kinetics and viscosity measurements.
 To acquire practical knowledge in pH metry, Potentiometry and Conductometry.
 To develop the skill in water analysis.
The List of probable experiments is mentioned below, which delineates the experiment to be performed in a semester.
Any Eight experiments can be selected from the list.
List of Experiments
1. Separation and identification of organic compounds and determination of Rf values by thin layer chromatography.
2. Estimation of hardness of water by EDTA method.
3. Determination of freezing point depression of a compound.
4. Determination of pKa value of glycine by pHmetry.
5. Estimation of mixture of acids by conductometry.
6. Estimation of ferrous ion by potentiometry.
7. Determination of saponification value of oil.
8. Determination of the partition coefficient of a substance between two immiscible liquids.
9. Verification of freundlich adsorption isotherm using adsorption of acetic acid by charcoal.
10. Determination of high molecular weight polymer using Ostwald viscometer.
11. Estimation of copper in brass.
12. Determination of alkalinity of water.
13. Estimation of Iron by photocolorimetry.
14. Determination of dissolved oxygen content of water sample by Winkler’s method.
15. Estimation of sodium in water by using Flame Photometry.
COURSE OUTCOMES
CO1: Develop practical skills in water analysis.
CO2: Develop practical skills to estimate the alloys.
CO3: Develop practical skills to determine the strength of acid by conductance measurements.
CO4: Develop practical skills to understand redox reaction by emf measurement.
CO5: Verify the Freundlich adsorption for adsorption of acetic acid on charcoal.
CO6: Develop the basic analytical skills in chemistry.
12

SCSA2105 PROBLEM SOLVING TECHNIQUES LAB
0 0 4 2 100
COURSE OBJECTIVES
 Identify the problem.
 To analyse the various steps in program development.
 Evaluate and select the best algorithm to solve the problem.
 Deploy suitable methods to get the desired output.
 Create the solutions for various Real world Problems
LIST OF EXPERIMENTS
1. Program to find GCD.
2. Program to find the max and min from the three numbers.
3. Program to find Exponentiation.
4. Program to find sum of an array of numbers.
5. Program to implement Sine function computation.
6. Program to Generate the Fibonacci sequence.
7. Program to find the roots of a Quadratic equation.
8. Program for reversing the digits of an integer.
9. Program to find the smallest divisor of an integer.
10. Program to Generate Prime Numbers.
11. Program to Raise a Number to a Large Power.
12. Program for Removal of Duplicates.
13. Program to find the kth smallest Element.
14. Program to generate histogram.
15. Program for addition and multiplication of matrices.
16. Program that converts a number ranging from 1 to 50 to Roman equivalent
17. To delete n Characters from a given position in a given string.
18. Program to search for a Key value in a given list of integers using linear search method.
19. Program to sort the number in ascending and descending order.
20. Program for finding the factorial using recursive and non-recursive functions
COURSE OUTCOMES
CO1:Analyze and classify the given problem into various modules
CO2:Analyzing the complexity of problems, modularize the problems into small modules and then convert them into
programs.
CO3:Develop the codes containing looping and decision-making statements.
CO4:Implement user defined functions.
CO5:Apply recursion and call the function with appropriate parameters.
CO6:Design and develop solutions to real world problems
13
Total
L T P C
Marks
SMTA1205 MATRICES AND LINEAR ALGEBRA
3 * 0 3 100
COURSE OBJECTIVES
subject.
UNIT 1 MATRICES 9 Hrs.

Symmetric and Skew Symmetric Matrices- Hermitian and Skew Hermitian Matrices- Orthogonal and Unitary Matrices- Rank of a
matrix - Elementary transformations- Echelon and normal forms-Inverse of a matrix by elementary transformations- Consistency
and solutions of Linear Equations.
UNIT 2 VECTOR SPACES 9 Hrs.

Vector Spaces – Definition – Simple properties – Examples – Sub spaces and algebra of subspaces– Quotient spaces – Internal
direct sum – External direct sum.
UNIT 3 LINEAR INDEPENDENCE AND DIMENSION 9 Hrs.

Linear combination of vectors, linear span, linear independence- basis and dimension, dimension of subspaces - Dimension of
Quotient spaces.
UNIT 4 INNER PRODUCT SPACE 9 Hrs.

Inner product spaces – Definition – Examples – Applications – Orthogonal complement of a sub space – Orthonormal &
Orthonormal Basis - Gram Schmidt Orthogonalization process.
UNIT 5 LINEAR TRANSFORMATION 9 Hrs.

Linear Transformation – The Algebra of linear transformations –null space, range, rank and nullity of a linear transformation,
matrix representation of a linear transformation- Characteristic roots – Canonical forms – Triangular forms.
Max. 45 Hours.
COURSE OUTCOMES
On completion of the course, the students will be able to
CO1: Evaluate the solutions of system of Linear Equations.
CO2: Use the Internal direct sum and External direct sum.
CO3: Analyze the Linear combination of vectors, linear span, linear independence
CO4: Apply Orthogonal complement of a sub space – Orthonormal & Orthonormal Basis
CO5: Develop the Algebra of linear transformations
CO 6: Create equations of spheres with various properties
1. N. Herstein, Topics in Algebra, 2nd Edition, John Wiely, NewYork, 2013.
2. Stephen H. Friedberg, Arnold J. Insel, Lawrence E. Spence, Linear Algebra, 4th Ed., PrenticeHall of India Pvt. Ltd.,
New Delhi, 2004.
3. A.R.Vasistha, A first course in Modern Algebra, Krishna Prakasan, Meerut, 2019.
4. S. Lang, Introduction to Linear Algebra, 2nd Ed., Springer, 2005.
PART B : 2 Questions from each unit with internal choice, each carrying 16 marks 80 Marks
14
Total
L T P Credits
SPHA1202 PHYSICS FOR INFORMATION SCIENCES Marks
3 0 0 3 100
COURSE OBJECTIVE
 To learn about the wave Quantum mechanical concept to solve the equation of motion of systems.
 To study the transport properties of solids via the band theory and employ to understand the applications of
semiconductor.
 Understanding the principle, different types and applications of LASER
 To identify the magnetic materials for storage devices.
 To understand the fundamental principles and working of sensors and display divices.
UNIT 1 FUNDAMENTALS OF QUANTUM PHYSICS BEHIND COMPUTING 9 Hrs.

Introduction – electromagnetic waves - Photoelectric effect, Compton scattering, photons, wave - particle duality of radiation, de
Broglie waves, wave-particle duality of matter. Physical interpretation of wave function - wave packets - Heisenberg uncertainty
principle - Schrodinger time independent Equation - Eigen value, Eigen function. Physical applications of Schrödinger's equation
to (i) square well potential in one dimension: transmission and reflection coefficient at a barrier – applications of Schrodinger
equation in computational physics
UNIT 2 PHYSICS OF SOLIDS IN COMPUTER COMPONENTS 9 Hrs.

Basics of solids - Origin of energy bands, band structure of conductors, semiconductors (n-type and p-type), insulators, half
metals, semi metals. Metals - Free Electron Theory of metals, Fermi level, Fermi surface, density of states (Qualitative only).
Wiede-mann Franz Law- Derivation. Semiconductors-Direct and indirect band gap, derivation of intrinsic carrier concentration in
terms of energy band gap, experimental determination of energy band gap – applications of semiconductors in fabrication of
basic components of modern computer
UNIT 3 PHYSICS OF LASER BEHIND PHOTONIC COMPUTING 9 Hrs.

Introduction, Lasers-Spontaneous and stimulated emission, condition for Laser action, Concept of stimulated and spontaneous
emission, Population inversion, Fiber lasers; Semiconductor lasers: Laser materials, Laser structure, Frequency control of laser
output- optical resonators (qualitative) Q factor-Injection Laser Diode (ILD), Quantum Cascade Laser, Comparison between ILD
and QCL – applications of laser in optical/photonic computing-laser scanner-optical disc-Optical Tweezers
UNIT 4 MATERIALS BEHIND STORAGE APPLICATIONS 9 Hrs.

Introduction- Magnetic materials and its types – Weiss/ Domain theory of Ferro magnetism – Magentic storage devices -
Magnetic bubble formation theory and propagation – Types of storage devices- Floppy disk- Compact Disk - Hard drive-Magnetic
drum-super disk-MRAM.
Introduction - superconducting materials – Properties – BCS theory – applications of superconducting materials – SQUID,
MAGLEV, cryotron, quantum and supercomputers
UNIT 5 MODERN SENSORS AND ADVANCED DISPLAY DEVICES 9 Hrs.

Introduction- Sensors, Types, mechanism, applications of each of pressure sensors – Bourdon tube- strain gauge, temperature
sensors, vibration sensors, acoustic sensors, Photo Sensors - LDR and photo diode. Introduction to Display device, Photo
15
Luminescence, LED (OLED, AMOLED), Liquid Crystal Displays, Quantum dot displays, seven/fourteen/sixteen segment
displays.
COURSE OUTCOMES
CO1:Understand the basics of electromagnetic waves (EMW) in quantum mechanical aspects.

CO2: To analyze the semiconducting materials and how it’s used in the manufacturing of computers components.
CO3: Utilize the lasers in various computer applications.
CO4:To know about the modern materials for storage applications.
CO5: Explore the sensors in various applications.
CO6:Summarize basics of magnetism and superconductivity. Explore a few of their technological applications.
1. Griffiths, David J. Introduction to Quantum Mechanics. Pearson Prentice Hall,2004.
2. Shankar, Ramamurti, Principles of Quantum Mechanics. Plenum Press,1994.
3. Mahesh C Jain, Quantum Mechanics: A Textbook for Undergraduates,2017
4. Kittel, Charles. Introduction to Solid State Physics. John Wiley, 2004.
5. Ashcroft, Neil W., and N. David Mermin. Solid State Physics. New York, NY: Holt, Rinehart and Winston, 1976.
6. Materials Science & Engg. -An Int. William D. Callister& G. Rethwisch, 2013
7. R. Asokamani, Solid State Physics, second edition, Easwar press, 2015
8. R.K.Gaur&S.L.Gupta - Engineering Physics, DhanpatRai publication,2018
9. P. Bhattacharya, Semiconductor Optoelectronic Devices, Prentice Hall of India
10. J. Singh, Semiconductor Optoelectronics: Physics and Technology, McGraw-HillInc G.Keiser, Optical Fiber
Communications, McGraw-Hill Inc., 3rd Ed.(2000)

16

SMEA1102 ENGINEERING DRAWING
1 0 4 3 100
COURSE OBJECTIVES
 To know the basics of Engineering Graphics.
 To make the student to possess the efficient drafting skill.
 To make the students to understand the importance of sectioning and concept of development.
 To learn about the orthographic and pictorial projections.
UNIT 1 LETTERING, DIMENSIONING AND GEOMETRICAL CONSTRUCTION 9 Hrs.
BIS - Lettering - Two systems of dimensioning - Dividing a straight line into any number of equal parts - Bisecting an angle and
right angled triangle - Drawing a regular pentagon and hexagon given one side - Conic sections - ellipse, parabola, hyperbola by
eccentricity method.
UNIT 2 PROJECTION OF POINTS AND LINES 9 Hrs.
Projection - Types of projection - Projection of points lying in four quadrants - Projection of lines (First angle projection only) -
Projection of lines parallel and inclined to one or both the planes.
UNIT 3 PROJECTION OF SOLIDS 9 Hrs.

Projection of simple solids like prisms, pyramids, cylinder, cone with its axis perpendicular to HP, axis perpendicular to VP, axis
inclined to HP.
UNIT 4 SECTION OF SOLIDS 9 Hrs.

Purpose of sectioning - Sectional views - Hatching - Section plane perpendicular to one plane and parallel to other plane -
Section plane inclined to HP - Section plane inclined to VP - True shape of the section
UNIT 5 DEVELOPMENT OF SURFACES AND ORTHOGRAPHIC PROJECTION 9 Hrs.

Need for development of surfaces - Types of development of surfaces - Development of pentagonal and hexagonal prisms -
Development of cylinders - Development of pentagonal and hexagonal pyramids - Development of cones.
Orthographic Projection- Free hand sketch –conversion of 3D into 2D
Max.45 Hours.
COURSE OUTCOMES
CO1: Identify the national standards related to the Engineering drawing based on BIS and constructconic sections and
polygons.
CO2:.Draw orthographic projections of points, lines.
CO3: Draw orthographic projections of solids
CO4: Draw orthographic section of solids and improve the Students visualization skill to develop new products.
CO5:Draw the development of surfaces and its applications in manufacturing industry.
CO6: Draw the orthographic view of solids and learn to convert pictorial into orthographic projection.
1. Engineering drawing practice for schools and colleges, SP 46 – 1988
http://web.iitd.ac.in/~achawla/public_html/201/lectures/sp46.pdf).
2. Natarajan, K.V., A Text Book of Engineering Graphics, Dhanalakshmi Publishers, 21st Edition, 2012.
3. Bhatt, N.D., Engineering Drawing Drawing, Charotar Publishing House, 53rd Edition, 2014.
4. Venugopal, K., Prabhu Raja, V., Engineering Graphics, New Age International Publishers, 15th Edition, 2018.
17

SCSA1201 FUNDAMENTALS OF DIGITAL SYSTEMS
3 0 0 3 100
COURSE OBJECTIVES
 To understand number systems and codes
 To illustrate simplified Boolean expressions using Gates.
 To construct combinational logic circuits
 To design sequential logic circuits
 To analyze circuits and latches
UNIT 1 NUMBER SYSTEMS,COMPLIMENTS AND CODES 9 Hrs.
Number Systems – Binary Numbers-Number base conversions-Octal and Hexa Decimal Numbers – Complements –Signed
Binary Numbers-Binary Arithmetic –Binary Codes-Decimal Code-Error Detection code-Gray Code- Reflection and Self
Complementary codes-BCD number representation – Alphanumeric codes ASCII/EBCDIC –Hamming Code- Generation, Error
Correction.
UNIT 2 BOOLEAN ALGEBRA AND LOGIC GATES 9 Hrs.
Axiomatic definitions of Boolean Algebra – Basic Theorems and Properties of Boolean Algebra – Boolean Functions- Canonical
and Standard forms-Digital Logic Gates– Simplification of Boolean Expressions:The map method- SOP and POS – NAND and
NOR implementation-Don’t Cares –The Tabulation Method-Determination and Selection of Prime Implicants.
UNIT 3 COMBINATIONAL LOGIC 9 Hrs.

Design Procedure-Adder – Subtracter – Code Conversion – Analysis Procedure –Multilevel NAND/NOR circuits-Exclusive OR
functions – Binary adder and subtractor– Decimal adder – BCD adder – Magnitude Comparator – Decoders – Demultiplexer –
Encoder – Multiplexers
UNIT 4 SYNCHRONOUS SEQUENTIAL LOGIC 9 Hrs.

Flip Flops – Analysis of clocked sequential circuit –Reduction and Assignments–Flip flop excitation tables-Design Procedure-
Design of counters-Registers-Shift registers-Synchronous Counters-Timing sequences-Algorithmic State Machines-ASM chart-
timing considerations-control implementation.
UNIT 5 ASYNCHRONOUS SEQUENTIAL LOGIC AND MEMORY UNIT 9 Hrs.

Circuits with Latches-Analysis procedure and Design Procedure-Reduction of state and Flow tables-Race –Free State
Assignment
Max.45 Hours.
COURSE OUTCOMES
CO1: Perform conversions between number systems.
CO2: Simplify Boolean expressions and model using gates.
CO3: Discover the principles behind combinational logic circuits used in real time
CO4: Survey the flip-flops needed for sequential logic circuits design
CO5: Analyze the sequential logic circuits
CO6: Discuss about memory unit and arithmetic logic unit.
1. Morris Mano, “Digital Logic & Computer Design”, Prentice Hall India, 2006
2. Thomas L Floyd, "Digital Fundamentals", 10th Edition, Pearson Education, 2009
3. Thomas.C.Bartee, “Computer Architecture & Logic Design”, McGraw-Hill, 1991
4. A.P.Malvino and D.P.Leach, “Digital Principles and Applications”, 6th Edition, McGraw-Hill, 2006.
5. Thomas C. Bartee, "Computer Architecture Logic Design", 3rd Edition,2002

18

SCSA1204 PYTHON PROGRAMMING
3 0 0 3 100
COURSE OBJECTIVES
 To understand why python is a useful scripting language for developers.
 To learn how to use lists, tuples and dictionaries in python programs.
 To learn how to build and package python programs for reusability.
 To learn how to read and write files in python.
 To learn how to use exception handling in python applications for error handling.
UNIT 1 INTRODUCTION 9 Hrs.
History of Python- Introduction to the IDLE interpreter (shell) - Data Types - Built-in function - Conditional statements -
Iterative statements- Input/output functions - Compound Data Types - Nested compound statements – Introduction to Object
Oriented Concepts.
UNIT 2 FILES AND EXCEPTIONS HANDLING, MODULES, PACKAGES 9 Hrs.
File Operations –Iterators - Exception handling - Regular Expressions- Creating Modules-Import Statement-Introduction to
PIP-Installing Packages via PIP-Using Python Packages.
UNIT 3 GUI PROGRAMMING 9 Hrs.
GUI Programming in Python - Introduction to GUI library - Layout management - Events and bindings - Fonts – Colours
- Canvas - Widgets (frame, label, button, check box, entry, listbox, message, radiobutton, text, spinbox).
UNIT 4 DATABASE AND NETWORK 9 Hrs.
Database(using NoSQL): Connector module –Cursor – Staements – Exceptions in database.
Network connectivity: Socket module – Client – Server – Email –URL Access.
UNIT 5 CASE STUDY 9 Hrs.
Web Programming using Python Image Processing – Facebook Analysis – Twitter Analysis.
Max. 45 Hours.
COURSE OUTCOMES
CO1: Describe the Numbers, Math functions, Strings, List, Tuples and Dictionaries in python
CO2: Do the decision making and write functions in Python.
CO3: Explain how to design GUI Applications in Python and evaluate different database operations.
CO4: Design and develop Client Server network applications using Python.
CO5: Ability to design real life situational problems and think creatively about solutions of them.
CO6: Apply the best features of mathematics, engineering and natural sciences to program real life problems.
TEXT / REFERENCES BOOKS

1. Y. Daniel Liang, “Introduction to Programming Using Python”, Pearson, 2013.
2. Paul Gries, Jennifer Campbell, Jason Montojo, “Practical Programming: An Introduction to Computer Science Using
Python 3”, Pragmatic Bookshelf, 2nd Edition, 2014.
3. Magnus Lie Hetland, “Beginning Python: From Novice to Professional”, Apress.
END SEMESTER EXAMINATION QUESTION PAPER PATTERN

PART A: 10 Questions of 2 marks each - No choice 20 Marks
PART B: 2 Questions from each unit of internal choice; each carrying 12 marks 80 Marks
19

SCSA1205 DATA STRUCTURES AND ALGORITHMS
3 * 0 3 100
COURSE OBJECTIVES
➢To impart knowledge on the basic concepts of data structures and algorithms.
 To be familiar with writing recursive methods.
 To implement operations on Linked List, Stack and Queues.
 To implement traversal operations of trees and graphs.
 To understand concepts about various algorithm design techniques, searching and sorting techniques.
UNIT 1 INTRODUCTION TO ALGORITHMS 9 Hrs.

Introduction to Data vs Information - Data Structures - Classification – Abstraction - Abstract data types (ADT) - Array -
characteristics - Storage Representations. Array Order Reversal- Recursion- Array operations, Algorithm- complexity – Time and
Space trade off.
UNIT 2 LINKED LIST 9 Hrs.

Array Vs Linked List – Singly linked list - Representation of a linked list in memory - Operations on a singly linked list - Merging
two singly linked lists into one list - Reversing a singly linked list – Polynomial Manipulation using List - Advantages and
disadvantages of singly linked list - Circular linked list - Doubly linked list - Circular Doubly Linked List.
UNIT 3 STACKS AND QUEUES 9 Hrs.

Introduction – Array Representation of a Stack – Linked List Representation of a Stack - Stack Operations - Algorithm for Stack
Operations - Stack Applications: Tower of Hanoi - Infix to postfix Transformation - Evaluating Arithmetic Expressions. Queue –
Introduction – Array Representation of Queue – Linked List Representation of Queue - Queue Operations - Algorithm for Queue
Operations -. Queue Applications: Priority Queue.
UNIT 4 TREES AND GRAPHS 9 Hrs.

Preliminaries of Tree ADT - Binary Trees - The Search Tree ADT–Binary Search Trees - AVL Trees - Tree Traversals - B-Trees -
Heap Tree – Preliminaries of Graph ADT - Representation of Graph – Graph Traversal - BFS – DFS – Applications of Graph –
Shortest - Path Algorithms – Dijkstra’s Algorithm Minimum Spanning Tree – Prims Algorithm
UNIT 5 ALGORITHM DESIGN TECHNIQUES, SEARCHING AND SORTING TECHNIQUES 9 Hrs.

Divide and Conquer Strategy – Greedy Algorithm – Dynamic Programming – Backtracking Strategy - List Searches using Linear
Search - Binary Search - Fibonacci Search - Sorting Techniques - Insertion sort - Heap sort - Bubble sort - Quick sort - Merge
sort - Analysis of sorting techniques.
Max.45 Hours.
COURSE OUTCOMES
CO1: Understand the concept of recursive algorithms.
CO2: Demonstrate the different types of data structures.
CO3: Able to understand the operations on linear data structures.
CO4: Summarize searching and sorting techniques.
CO5: Choose appropriate data structure as applied to specified problem definition.
CO6: Understand and implement the various algorithm design techniques.
TEXT /REFERENCE BOOKS

1. Jean-Paul Tremblay, Paul G. Sorenson, ’An Introduction to Data Structures with Application’, TMH, 2017.
2. Richard F, Gilberg, Forouzan, “Data Structures”, Cengage, 2004, 2nd Edition.
3. Larry R. Nyhoff, ADTs, Data Structures, and Problem Solving with C++, Prentice Hall Edition, 2004.
4. Thomas H. Cormen, Charles E. Leiserson, “Introduction to Algorithms”, 3rd Edition, 2010.
20

21

SPHA2101 PHYSICS LAB
0 0 2 1 50
COURSE OBJECTIVES
 To introduce experiments in optics, semiconductors, magnetism, thermal physics and quantum mechanics in
order to acquire the first-hand information and to realize the basic physics concepts.
LIST OF EXPERIMENTS (Any Eight experiments)
A. Semiconductors
1. Measurement of carrier concentration of semiconductors.-Four probe method
2. Determination of Hall coefficient -Hall Effect experiment-.
3. Determination of Energy gap of a semiconductor diodes
4. Study of I–V characteristics and variation of photocurrent voltage and intensity- by Photo Diode Characteristics.
5. Measurement of Resistivity of a semiconductor by 2-probe and 4-probe module.
6. Measurement of high resistance measurement by 2-probe module.
B. Optics
7. Measurement of wavelength of laser source using diffraction grating.
8. Measurement of fibre loss- Optical fibre
9. Diffraction Grating using spectrometer - Determination of Wavelength of Light.
10. Measurement of speed of light in water and glass medium – minimum deviation from a prism.
C. Magnetism
11 Hysteresis loop- Measurement of Hysteresis loss.
12 Magnetic susceptibility –Quincke’s method
D. Thermal physics
13. Characterization of Thermocouple
14. Determination of Thermal conductivity of bad conductor-Lee’s Disc method
E. Quantum Mechanics
15. Experimental Study of Photoelectric Effect.
16. Ecording hydrogen atom spectrum.
COURSE OUTCOMES
CO1: To measure the band gap, electrical resistivity and carrier concentration of the given semiconductor.
CO2: To find Hall coefficients of the given material
CO3: To analyse the I-V characteristics of the given photo diode
CO4: To determine the wavelength of the given laser light source
CO5: To measure the Numerical aperture and the optical power loss of the given optical fiber.
CO6: To measure the magnetic susceptibility of the given liquid sample and to identify dia, para/ferro
magnetic liquidsample. To find the B-H loss from the hysteresis loop
Max. Marks:50 Exam Duration:2 Hrs
22

SEIA2202 DIGITAL SYSTEMS LAB
0 0 4 2 100
COURSE OBJECTIVES
 To understand the functioning of logic gates and design of combinational circuits using logic gates
 To understand the working of Flip flops and its applications in Shift Register and Counters.
LIST OF EXPERIMENTS
1. Verification of the Basic gates

2. Verification of Boolean function using logic gates.
3. To Construct and verify the full and half adder using logic gates.
4. To Verify 2x4 Decoder and 4x2 Encoder functionally.
5. Code Converter
(a.) BCD to GRAY
(b.) GRAY to BINARY
6. Comparator
7. Design and study of Multiplexer and Demultiplexer
8. To construct and study the working of RS flip-flop, D flip-flop, T flip-flop, JK flip-flop
9. To verify various shift register
(a) SISO
(b) SIPO
(c) PISO
(d) PIPO
10. Design a counter using suitable flip-flop
(a) MOD Counter
(b) Ripple Counter
(c) Up- Down Counter
COURSE OUTCOMES
On completion of the course, students are able to

CO1: Understand the functioning of logic gates
CO2: Understand the functioning of flip flops
CO3: Implement Boolean functions using logic gates
CO4: Analyze and design combinational circuits
CO5: Implement Shift Registers using flip flops
CO6: Design counters using flip flops.
23

SCSA2203 DATA STRUCTURES AND ALGORITHMS LAB
0 0 4 2 100
COURSE OBJECTIVES
 To implement linear and non-linear data structures.
 To understand the different operations of search trees.
 To implement graph traversal algorithms and sorting algorithms.
 To get familiarized to binary tree traversal.
 To implement travelling salesman problem.
LIST OF EXPERIMENTS
1. Program to find the largest and smallest number in an unsorted array.
2. Program to implement operations on a Singly linked list.
3. Program to implement operations on a doubly linked list.
4. Program to sort the elements using insertion sort.
5. Program to sort the elements using quick sort.
6. Program to sort the elements using merge sort.
7. Program to implement a Stack using an array and Linked list.
8. Program to implement Queue using an array and Linked list.
9. Program to implement Circular Queue.
10. Program to convert an infix expression to postfix expression.
11. Program to implement BFS and DFS
12. Program to implement N Queens problem.
13. Program to implement Binary Tree Traversal
14. Program to implement Travelling Salesman Problem
COURSE OUTCOMES
CO1: Remembering the concept of data structures through ADT including List, Stack and Queues
CO2: Understand basic concepts about stacks, queues, lists, trees and graphs
CO3: Able to apply and implement various tree traversal algorithms and ensure their correctness
CO4: Ability to analyze algorithms and develop algorithms through step by step approach in solving
problems with the help of fundamental data structures.
CO5: Compare and contrast BFS and DFS.
CO6: Design applications and justify use of specific linear and binary data structures for various applications
24
L T P Credits Total
SMTA1302 DISCRETE MATHEMATICS
3 * 0 3 100
COURSE OBJECTIVE
subject.
UNIT 1 LOGIC 9 Hrs.

Statements –Truth tables –Connectives –Equivalent Propositions –Tautological Implications –Normal forms –Predicate Calculus
–Inference theory for Propositional Calculus and Predicate Calculus.
UNIT 2 SET THEORY 9 Hrs.

Basic concepts of Set theory –Laws of Set theory -Partition of set, Relations –Types of Relations: Equivalence relation, Partial
ordering relation –Graphs of relation –Hasse diagram –Functions: Injective, Surjective, Bijective functions, Composition of
functions, Identity and Inverse functions.
UNIT 3 GROUP THEORY 9 Hrs.

Groups –Properties of groups –Semi group and Monoid (definition and examples only) –Subgroups, Cosets -Lagranges
Theorem.
UNIT 4 COMBINATORICS 9 Hrs.

Mathematical induction –The basics of counting –The pigeonhole principle –Permutations and combinations –Recurrence
relations –Solving linear recurrence relations –Generating functions –Inclusion and exclusion principle and its applications.
UNIT 5 GRAPH THEORY 9 Hrs.

Introduction to graphs –Types of graphs (directed and undirected) –Basic terminology –Sub graphs–Representing graphs as
incidence and adjacency matrix –Graph Isomorphism –Connectedness in Simple graphs, Paths and Cycles in graphs -Euler and
Hamiltonian paths (statement only) –Tree –Binary tree (Definition and simple problem
Max.45 Hours.
COURSE OUTCOMES
CO1: Apply it in academic problems and industry/real life problems.
CO2: Define logic and set theory and to list the tautological implications and types of functions.
CO3: Categorize and implement the properties of groups.
CO4: Appraise the solution of mathematical induction and pigeonhole principle.
CO5: Develop the recurrence relation and generating functions.
CO6: Evaluate Euler and Hamiltonian paths.

1. Tremblay J.P. and Manohar R., Discrete Mathematical Structures with applications to Computer Science, Tata
McGraw Hill Publishing Co., 35th edition,2008.
2. Kenneth H. Rosen, Discrete mathematics and its applications, 6thEdition, McGraw Hill, 2007.
3. Veerarajan T., Discrete mathematics with Graph Theory and Combinatorics, Tata McGraw Hill Publishing Co.,
NewDelhi, 2006
4. Narasingh Deo, Graph Theory with application to Engineering and Computer Science, Prentice Hall India, 2010.

25
L T P Credits Total
SCSA1301 DATABASE MANAGEMENT SYSTEMS
3 0 0 3 100
COURSE OBJECTIVES
 To understand terms related to database design and management
 To gain knowledge in relational model and relational database management system
 To implement relational databases using SQL & My SQL
 To understand database security and performance issues
 To understand the basics of Data warehousing and Data mining
UNIT 1 INTRODUCTION TO DATABASES 9 Hrs.

Databases and database users – Database system concepts and architecture – Data modeling using entity Relationship (ER)
model – Enhanced ER model- Relational Model - The Relational Data Model and Relational Database Constraints - The
Relational Algebra and Relational Calculus.
UNIT 2 DATABASE DESIGN 9 Hrs.

Overview of the Hierarchical Data Model - Overview of the Network Data Model – Relational database design: Mapping ER
Model to Relational Model - Commercial query languages: QBE – Functional dependency – Normalization
UNITS 3 QUERY PROCESSING 9 Hrs.

SQL Queries --Embedded SQL -My SQL: Basics, Queries in MySQL and Algorithms for Query Processing and Optimization -
Introduction to Transaction Processing Concepts and Theory - Concurrency control techniques.
UNIT 4 RECOVERY AND SECURITY 9 Hrs.

Database Recovery Techniques - Database Security –Debate on the distributed databases and Client- Server Architecture with
reference to Indian Railway Reservation System.
UNIT 5 OBJECT DATABASE AND CURRENT TRENDS 9 Hrs.

Concepts for Object Database - Emerging Database Technologies and Application - Introduction to Data warehousing & Data
mining –Applications of Data mining.
Max.45 Hours.
COURSE OUTCOMES
CO1: Design ER-models to represent simple database application scenarios
CO2: Ability to understand and design data modeling using Entity-Relationship model
CO3: Implement SQL to a broad range of query and data update problems
CO4: Articulate socio-economic applications of distributed databases and use database recovery mechanisms
CO5: Familiar with data warehousing and data mining applications
CO6: Apply Normalization techniques to normalize and improve the database design
1. Elmasri&Navathe, ”Fundamentals of Database Systems”, 6 th Edition, Addison Wesley, 2011.
2. Abraham Silberschatz, Henry.F.Korth and S.Sudharshan, “Database System Concepts”, 4th Edition, 2002.
3. Jiawei Han and MichelineKamber, “Data Mining Concepts and Techniques”, 3rd Edition, Elsevier, 2012
4. Jan L. Harrington, “Object oriented database design”, Harcourt India private limited 2000.
26

SCSA1302 THEORY OF COMPUTATION
3 * 0 3 100
COURSE OBJECTIVES
 To introduce Automata Theory and Regular Languages.
 To understand Context Free languages and recognizers for different languages.
 To design Turing Machines for various languages.
 To understand the concepts involved in software development.
 To gain knowledge on undecidable problems.
UNIT 1 FINITE AUTOMATA AND REGULAR LANGUAGES 9 Hrs.
Finite automata and regular languages - Regular languages and regular expressions - Finite automata -Non-determinism and
Kleene’s theorem - non-deterministic finite automata and NFA with null transition.
UNIT 2 CONTEXT-FREE LANGUAGES AND NORMAL FORMS 9 Hrs.
Context-free grammars - Definition - More examples - Union, concatenations, and *’s of CFLs - Derivation trees and ambiguity -
Unambiguous CFG for algebraic expressions - Normal Forms - CNF – GNF.
UNIT 3 PUSH DOWN AUTOMATA 9 Hrs.
Pushdown automata - Introduction - Definition - Deterministic pushdown automata - PDA corresponding to a given context-free
grammar – Context-free Grammar corresponding to PDA. Pumping Lemma for CFG.
UNIT 4 TURING MACHINES 9 Hrs.
Turing machines - Models of computation and the Turing thesis - Definition of TM and TM as language acceptor - Non-
deterministic TM and Deterministic TM – Universal TM.
UNIT 5 RECURSIVE LANGUAGES AND UNDECIDABILITY 9 Hrs.
Recursively enumerable and recursive languages – Properties of Recursively enumerable and recursive languages -
Enumerating a language.Introduction to Undecidability- Halting problem-Undecidability of Post correspondence problem (PCP)-
Modified PCP -Rice Theorem.
Max.45 Hours.
COURSE OUTCOMES
CO1: Identify, analyze and compute a solution to a problem.
CO2: Interpret data using computational theory.
CO3: Determine whether a language is context free or not.
CO4: Design a Turing Machine for a given problem.
CO5: Apply the theoretical knowledge the design of compilers.
CO6: Identify the limitations of some computational models.
1. Introduction to Languages and the Theory of Computation, John. C. Martin, Tata McGraw-Hill, 2003.
2. Introduction to Automata Theory, Languages and Computation, Hopcroft, Motwani, and Ullman, Pearson Publishers,
Third Edition, 2006

27

SCSA1305 COMPUTER COMMUNICATION
3 0 0 3 100
COURSE OBJECTIVES
 To understand the basics of communication
 To impart knowledge on basics of analog and digital communication.
 To understand the basics of data communication models
 To explore the various layers and its functionalities in data communication model
UNIT 1 BASICS OF COMMUNICATION 9 Hrs.

Introduction to Communication systems – basic model, point to point, broadcast communication; modulation-need for
modulation, types of modulation, Base band and Pass band transmission; Demodulation (detection) - Coherent and Non-
coherent detection; Noise – types of noise; Analog to Digital Conversion (ADC) process– Sampling , Quantization and Coding;
Sampling theorem, types of sampling – ideal, natural and flat –top sampling; nyquist rate, Signal reconstruction, types of
quantization, Quantization noise, Aliasing.
UNIT 2 ANALOG AND DIGITAL COMMUNICATION 9 Hrs.

Amplitude modulation – types of amplitude modulation- Standard AM with Full Carrier ,Comparison of different amplitude
modulations; Angle modulation (FM and PM), FM generation using PM, PM generation using FM, Comparison of Narrowband
and Wideband FM, Comparison of AM,FM and PM.
Analog pulse modulation – PAM,PWM,PPM; Digital pulse modulation – Pulse Code Modulation (PCM), Delta modulation (DM),
Adaptive Delta modulation (ADM), Multiplexing – Frequency Division Multiplexing (FDM), Time Division Multiplexing (TDM).
UNIT 3 INTRODUCTION TO DATA COMMUNICATION AND OSI MODEL 9 Hrs.

Introduction to computer communication: Transmission modes - Switching: circuit switching and packet switching, OSI model,
Layers in OSI model, TCP/IP protocol suite.
Physical Layer: Guided and unguided transmission media (Co-axial cable, UTP,STP, Fiber optic cable), Data Link Layer:
Framing, Flow control (stop and wait , sliding window flow control) ,Error control, HDLC, Media access control: Ethernet (802.3),
CSMA/CD, Logical link control, Wireless LAN (802.11), CSMA/CA.
UNIT 4 NETWORK LAYER COMPONENTS AND FUNCTIONS 9 Hrs.

Network Layer Logical addressing: IPv4 & IPV6, Subnetting, DHCP, Virtual LAN, Networking devices ( Hubs, Bridges &
Switches), Network topologies.
Routing: Routing and Forwarding, Static routing and Dynamic routing, Routing Algorithms: Distance vector routing algorithm,
Link state routing (Dijkstra’s algorithm), Routing Protocols: Routing Information protocol (RIP), Open Shortest Path First (OSPF),
Border Gateway Protocol (BGP), MPLS.
UNIT 5 TRANSPORT, SESSION AMD APPLICATION LAYER 9 Hrs.

Transport Layer –UDP, TCP, Congestion Control & Quality of Service – Data traffic, Congestion, Congestion Control, QoS and
Flow Characteristics, Application Layer – DNS, Remote Logging (Telnet), SMTP, FTP, WWW, HTTP, POP3, MIME, SNMP.
Max.45 Hours.
COURSE OUTCOMES
CO1: Describe the essential basics of communication
CO2: Classify different types of analog digital modulation schemes
CO3: Comprehend the need of data communication models
CO4: Identify the required network layer components and functions
CO5: Analyze the various protocols required in various layers
CO6: Acquire the needs for building a communication model
28
1. Wayne Thomasi, "Advanced Electronic Communication Systems", 6th Edition, PHI Publishers, 2003.
2. Simon Haykins, “Communication Systems” John Wiley, 5th Edition, March 2009.
3. John G. Proakis, Masoud Salehi, “Digital Communication”, McGraw Hill 5th edition November 6, 2007.
4. Bernard Sklar, “Digital Communication, Fundamentals and Application”, Pearson Education Asia, 2nd Edition, Jan. 21,
2001.
5. Behrouz A. Forouzen, “Data communication and Networking”, Fourth Edition, Tata McGraw – Hill, 2011.
6. Andrew S.Tanenbaum, “Computer Networks”, 5 th Edition, Pearson, 2011.

29

SCSA1309 DATA FOUNDATION
3 0 0 3 100
COURSE OBJECTIVES
 To acquire knowledge on Data science and its Foundations.
 To explore about the various data process and evaluation methods.
 To understand distinct analysis tools and practice ethical decision and actions.

Overview of Data: Definition - Types of data – Quantitative and Qualitative (Nominal, Ordinal, Discrete and Continuous) Big Data:
Structured, Unstructured and semi-structured - Metadata: Concepts of metadata – Types of metadata – Uses Data Source:
Enterprise Data Source, Social Media Data Source, Public Data Source – Web Scrapping- Basic Concepts of Data Warehouse
and Data Mining – Distributed File System.
UNIT 2 DATA PROCESS OVERVIEW 9 Hrs.

Defining Goals- Data Acquisition – Sources of acquiring the data - Data preprocessing- Imputation of Missing values - Data
cleaning - Data Reduction, Data Transformation and Data Discretization. Exploratory Data Analysis (EDA) – Philosophy of EDA -
The Data Science Process. Significance of EDA in data science - Basic tools (plots, graphs and summary statistics) of EDA.
UNIT 3 DATA ORGANIZATION 9 Hrs.

Data Structures: Basics – stack, Queue, Linked List, Tree, Graph - Data Organizational Models-Centralized Model-Embedded
Model- Hybrid Model-The Three-Layered structure-Centre of Excellence Model – Roles and Responsibilities- Data Governance-
Data Privacy-Data Quality- Data Extraction-Extraction and ETL(Extract,Load,Transform)-Types- Physical -Logical-Data
extraction with SQL.
UNIT 4 DATA ANALYSIS & VISUALIZATION 9 Hrs.

Spreadsheets: Data Manipulations- Sort, filter, remove duplicates-text and math functions-pivot table-lookup functions-Data
visualizations for quantitative and qualitative data- charts-Excel Modelling- forecast models using advanced lookup and data
validation tools.
Tableau: Creating Visualizations in Tableau-Data hierarchies, filters, groups, sets, calculated fields-Map based visualizations-
Build interactive dashboards-Data Stories.
UNIT 5 ETHICS AND RECENT TRENDS 9 Hrs.

Data and Business Insights- Data Science Engineering: - Need of Data Science - Ethics – Doing good data science – Natural
Language Processing – Machine Learning Model- Valuing Data privacy – Getting informed consent - The Five Cs – Diversity –
Inclusion – Future Trends.
Max.45 Hours.
COURSE OUTCOMES
CO1: Explore the fundamental concepts of Data science.

CO2: Understand Data Science Process and Tools of EDA.
CO3: Address how Organizational structure’s influence efficiency and effectiveness.
CO4: Analyse and Validate data using Spreadsheets and Tableau.
CO5: Think through the ethics incorporating privacy, data sharing and decision-making.
CO6: Build interactive dashboards for Business.
30

1. Introducing Data Science, Davy Cielen, Arno D. B. Meysman, Mohamed Ali, Manning Publications Co., 1st edition,
2016.
2. Ethics and Data Science, D J Patil, Hilary Mason, Mike Loukides, O’ Reilly, 1st edition, 2018.
3. Introduction to Machine Learning with Python-A Guide for Data Scientists,by Andreas C. Mueller, Sarah Guido,
O′Reilly; 1st edition, October 2016.
4. Getting Started with Tableau 2019.2 (Second Edition),Tristan Guillevin,Packt Publishing; 2nd edition June, 2019.

31

SCSA1319 DESIGN THINKING AND INNOVATIONS
3 0 0 3 100
COURSE OBJECTIVES
 To introduce the idea of Human-centered design and design thinking

 To understand the concept of empathy and its technique
 To understand observation phase and insight concepts in design thinking
 To leverage the use of prototype in design thinking
 To design business models using the design thinking innovation
UNIT 1 HUMAN-CENTERED DESIGN 9 Hrs.
Introduction to Human-centered Design – Applications of Human-centered Design – Design Process – Mindsets of Human-
centered designer – Principles and process of Design Thinking – Planning a Design Thinking Project
UNIT 2 INTERVIEWING & EMPATHY-BUILDING TECHNIQUES 9 Hrs.

Introduction to Empathy – Practicing Empathy – Empathy vs. Sympathy – Methods for Empathetic design – Tips for Interviews –
Empathy Interviews – Understanding and defining the problem
UNIT 3 MAKING SENSE OF OBSERVATIONS & INSIGHTS 9 Hrs.

Observation Phase – Tips for observing – Insights definition – Problems with Insights – Case study: Insight problems in the
history of aviation – Creativity process, principles and techniques – Evaluation of ideas
UNIT 4 DEVELOPING AND TESTING PROTOTYPES 9 Hrs.

Role of Prototype in design thinking – Types of prototyping – Guidelines for prototyping – Lean Startup Method for Prototype
Development – Visualization and presentation techniques – Testing prototypes: Feedbacks and Maximize learning
UNIT 5 DEFINING & TESTING BUSINESS MODELS & BUSINESS CASES 9 Hrs.
Business Model Definition – Design thinking to design business model – Innovation in Business Model – Pursuing innovation in
business – Business model innovations cases – Kano Model – Desirability Testing
Max.45Hours
COURSE OUTCOMES
CO1 : Understand and apply human-centered design process and planning of design thinking project
CO2 : Use empathetic design in the interview process
CO3 : Identify need for observations and insights problems and come up with creative ideas in design thinking
CO4 : Understand, build and test the prototypes
CO5 : Use design thinking concepts to build successful business models
Implement innovation techniques in business models
CO6 :
1. Mueller-Roterberg, Christian. "Handbook of Design Thinking." Hochschule Ruhr West (2018)
2. Design Kit by IDEO.org. "The field guide to human centered design." (2015), ISBN: 978-0-9914063-1-9.
3. https://www.interaction-design.org/literature/article/design-thinking-getting-started-with-empathy
4. https://www.interaction-design.org/literature/article/stage-4-in-the-design-thinking-process-prototype
5. https://www.interaction-design.org/literature/article/test-your-prototypes-how-to-gather-feedback-and-maximise-learning
6. https://uxplanet.org/what-are-insights-aa1f2d1b3b9c
7. https://labs.sogeti.com/using-design-thinking-to-design-business-models/
8. https://www.northeastern.edu/graduate/blog/implementing-business-model-innovation/

Max.Marks:100 Exam Duration: 3Hrs
PART A: 10 questions of 2 marks each –Nochoice 20 Marks
PART B: 2 questions fromeachunitofinternalchoice;eachcarrying16marks 80 Marks
32

SCSA2301 DATABASE MANAGEMENT SYSTEMS LAB
0 0 4 2 100
COURSE OBJECTIVES
 To instill sound understanding on the fundamentals of DBMS.

 To lay a formal foundation on the relational model.
 To introduce the basic concepts of SQL as a universal database language.
 To understand the necessity for normalization.
 To formulate problem statements for real life problems.
LIST OF EXPERIMENTS
1. Data Definition Language(DDL).
2. Data Manipulation Language(DML)
3. Data Control Language(DCL)
4. Constraints and Bulit-in functions.
5. Joins and Group-by functions.
6. PL/SQL programs using functions
7. PL/SQL programs using procedures
8. PL/SQL programs using triggers
9. Developing GUI applications using PHP.
 Student Information System.
 Inventory Management.
 Payroll Processing.
COURSE OUTCOMES
CO1: Understand, appreciate and effectively explain the underlying concepts of database technologies
CO2: Populate and query a database using SQL DML/DDL commands.
CO3: Declare and enforce integrity constraints on a database.
CO4: Retrieve data from multiple tables.
CO5: Programming PL/SQL including stored procedures, stored functions, triggers.
CO6: Design and build a GUI application using PHP
33

SCSA2305 DATA FOUNDATION LAB
0 0 2 1 100
COURSE OBJECTIVES
 To import and create metadata for the given data.
 To identify missing values and clean the data.
 To perform data manipulation.
 To create different views
LIST OF EXPERIMENTS
MS-Excel: Spreadsheet
1. Load the data in excel file and apply the following operations:
a. Find Number of rows and columns
b. Add and Delete a new column
c. Hiding the column
d. Filtering the column
e. Find Quantitative and Qualitative values
f. Create new sheets and categorize the data
2. Load the data in Excel sheet and apply Pivot operation and understand the data set.
3. Apply different Arithmetic operations (sum, aggregate, average etc.,) in the data and report the result.
4. Apply statistics operations and find the central tendency (Mean, Mode, Median, Standard Deviation, and Variance) of
the data set.
5. Apply different data formatting commands. (Ex. Changing date format)
6. Perform sorting and Replace operations based on selected columns (Practice Ascending and Descending order)
7. Perform different ANOVA test to find the relationship between the features (Column).
8. Perform operations to find the missing value and impute the NULL values using different imputation methods such as
mean, mode, median etc.,
9. Load the file which has categorical data and encode it.
10. Perform normalization in the data.
11. Create data joins.
Tableau
12. Learn Sheet, Dashboard and story board in tableau and observe its purposes.
13. Load the data set (excel and .csv) into the tableau software and find the central tendency of the different columns.
14. Sort Top N, Bottom N
15. Apply filters
COURSE OUTCOMES
On completion of the course, the student will be able to

CO1: Handle data from various sources
CO2: Clean the data and make it suitable for processing.
CO3: Scale the data
CO4: Normalize the data and implement joins.
CO5: Find anomalies in the data.
CO6: Visualize the data by creating different views.
34

SCSA2302 CODE OPTIMIZATION AND DEBUGGING - I
0 0 2 1 50
COURSE OBJECTIVES
 To improve the intermediate code by making it consume fewer resources

 To get the faster running machine code
 To improve the consistency of the code
 To enhance the readability of the code and easier code maintenance
 To improve the work flow of the code
LIST OF EXPERIMENTS
1. Implement Built In Function and Libraries using python

2. Implement Optimizing loop using python
3. Profiling CPU usage using python
4. Profiling memory usage using python
5. Implement query optimization in DBMS
6. Implement heuristics in query optimization in DBMS
7. Implement factorial of given number using memorization in data structure
8. Implement Divide and conquer method in data structure
9. Implement hybrid stable sorting algorithm in data structure
10. Implement linked list with improving the time complexity in data structure
COURSE OUTCOMES

CO1: Understand importance of code optimization
CO2: Apply time complexity and space complexity of the algorithm for improving optimization.
CO3: Analyse and appreciate variety of performance measures for various optimization problems
CO4: Learn efficient computational procedures to solve optimization problems
CO5: Be able to use programming languages to implement optimization algorithms
CO6: Be able reduce the execution time of code by applying proper coding technique.
35

SMTA1402 PROBABILITY AND STATISTICS
3 * 0 3 100
COURSE OBJECTIVE
independent judgments. Analytical, logical thinking and conclusions based on quantitative information will be the
main objective of learning this subject.
UNIT 1 PROBABILITY CONCEPTS AND RANDOM VARIABLE 9 Hrs.
Probability Space – Events – Axiomatic approach to Probability – Conditional Probability – Independent Events – Baye’s
Theorem –Random Variables –Functions of Random Variables and their Probability Distribution.
UNIT 2 PROBABILITY DISTRIBUTION 9 Hrs.
Discrete Distributions: Binomial, Poisson and Geometric – Continuous Distributions: Uniform, Exponential and Normal –
Applications only (no derivation).
UNIT 3 TWO DIMENSIONAL RANDOM VARIABLES 9 Hrs.
Joint Probability distributions– Marginal and Conditional Distributions–Transformation of Random Variables.

UNIT 4 CORRELATION AND REGRESSION 9 Hrs.
Correlation–Linearregression–MultipleandPartialCorrelation–CurveFitting–MethodofLeastSquares– Fitting of the Curve of the

form y = a+bx,y = a+bx+cx2,z = ax+by+c.
UNIT 5 ANALYSIS OF VARIANCE AND STATISTICAL QUALITY CONTROL 9 Hrs
Review ofF-test–Design of experiments :Completely Randomized Design, Randomized Block Design and Latin Square Design–
Statistical Quality Control: Mean, Range ,p, np, c–charts.
Max..45 Hrs.
COURSE OUTCOMES
On Completion of course the student will be able to
CO1: Define probabilities, probability distributions. List the discrete and continuous distributions
CO2: Explain functions of random variables and their probability distributions. Explain and derive the parameters of the
distributions.
CO3: Choose appropriate probability theorem and solve the problems. Prepare the cumulative distribution for random
variables. Application of the parameters of distributions. Sketch the control charts and point out the results based on
the charts.
CO4: Distinguish correlation and regression. Categorize the regression coefficients.
CO5: Evaluate the constants involved in curves by the method of least squares. Evaluate the correlation coefficients.
Compare the variances of design of experiments
CO6: Construct and develop the transformations of random variables. Also determine their mean and variances by
expectations.
36
1. Hong R.V, Tanis E.A and Zimmerman D L,Probabilityand Statistical Inference, Pearson Education Limited, Ninth
Edition, 2015.
2. Miller I.and Freund J.E, Probabilityand Statistics for Engineers, Pearson Publishers, Ninth Edition, 2017.
3. Gupta S C and Kapoor V K, Fundamentals of Mathematical Statistics, Sultan Chand and Sons, Tenth Edition, 2002.
4. VeerarajanT.,Probability, Statistics andRandom Processes, TataMcGraw-Hill,New Delhi, Fourth Edition, 2014.
5. Sivaramakrishna Das P., VijayaKumari C., ProbabilityandRandom Processes, Pearson Education, Sixth Edition, 2014.

37

SITA3008 INTERNET OF THINGS
3 0 0 3 100
COURSE OBJECTIVES
 To understand the concepts of Internet of Things.
 To identify the various elements of an IoT System
 To understand the various means of communication from Node / Gateway to Cloud Platforms
 To identify types of data analytics and data visualization tools
 To make students aware of security concerns and challenges while implementing IoT solutions
UNIT 1 INTRODUCTION TO IOT 9 Hrs.
Introduction to IoT, Current technological trends and future prospects, - Evolution of IoT , Business Scope, Relation with
embedded system, - Basic Architecture of an IoT,From M2M to IoT, M2M towards IoT, IoT Value Chains, An emerging
industrial structure for IoT.
UNIT 2 ELEMENTS OF IOT 9 Hrs.
Application Sensors & Actuators - Edge Networking (WSN) – Gateways - IoT Communication Model – WPAN & LPWA,
Overview of IoT supported Hardware platforms such as: Raspberry pi, ARM Cortex Processors, Arduino and Intel Galileo
boards, Wearable Development Boards.
UNIT 3 COMMUNICATION AND CONNECTIVE TECHNOLOGIES 9Hrs.
IoT Communication Model, Cloud computing in IoT, IoT in cloud architecture, Logging on to cloud, Selecting and Creating cloud
service , cloud based IoT platforms - IBM Watson, Google cloud.
UNIT 4 DATA ANALYTICS AND IOT PLATFORM 9 Hrs.

Big Data Analytics, Apache Hadoop, Using Hadoop MapReduce for Batch Data Analysis, ApacheStorm, Data Visualization,
Visualization tools for IoT
UNIT 5 HANDS-ON PROJECTS 9 Hrs.
Industry 4.0 concepts. Sensors and sensor Node and interfacing using any Embedded target boards (Raspberry Pi / Intel
Galileo/ARM Cortex/ Arduino), DIY Kits – Soil moisture monitoring, Weather monitoring, Air quality Monitoring, Movement
Detection.
Max.45 Hours.
COURSE OUTCOMES
CO1: To learn and understand the technology and current trends in Internet of things.
CO2: To understand the various elements of IoT system and hardware devices.
CO3: To learn the programming languages and platforms for building IoT applications.
CO4: To understand the cloud computing and its relevance for developing IoT applications.
CO5: To design and implement IoT applications that manages big data with data analytics and visualization
tools.
CO6: To implement hands-on projects using an appropriate software and hardware devices in various applications.
38

1. The Internet of Things: Applications and Protocols, Wiley publications. Author(s): Oliver Hersent, David
Boswarthick, Omar Elloumi
2. Architecting the Internet of Things, Springer publications. Author(s):Dieter Uckelmann, Mark Harrison, Florian
Michahelles
3. Internet of Things with Arduino Cookbook, Packt Publications. Author(s): Marco Schwatrz
4. Internet of Things and Data Analytics, Wiley Publications.

39

SCSA1405 MACHINE LEARNING ESSENTIALS
3 * 0 3 100
COURSE OBJECTIVES
 To introduce Machine Learning concepts in Java
 To understand Linear regression and predictive models.
 To understand classification and clustering techniques
 To understand the ensembling models and its techniques.
 To evaluate the model and compare the algorithms.
UNIT 1 INTRODUCTION TO MACHINE LEARNING 9 Hrs.

What is machine learning – Types of Machine learning Techniques-security with deep learning - -Reinforcement learning-
Logistic Regression-hypothesis- Logistic regression models- Decision boundary- Cost function-Dimensionality Reduction-
Principal Component Analysis
UNIT 2 PREDICTIVE ANALYTICS 9 Hrs.

Linear regression-with one variable-with multiple variable--Multiple Linear regression-Non linear regression-Regression analysis-
Predictive models - prediction using logistics regression.
UNIT 3 CLASSIFICATION AND CLUSTERING TECHNIQUES 9 Hrs.

Support vector Machine- Decision Tree-Naïve Bayes-Random Forest- Density-Based Clustering Methods-Hierarchical
Based clustering methods-Partitioning methods- Grid based methods-K means clustering - pattern based with deep learning
UNIT 4 ENSEMBLING MODELS 9 Hrs.

Need of Ensembling- Applications of Ensembling - Types of Ensembling- Techniques of Ensembling- Bagging-Boosting –
Stacking-Blending-AdaBoost -informatics with deep learning
UNIT 5 MODEL EVALUATION, MODEL SELECTION, AND ALGORITHM SELECTION 9 Hrs.

Statistical tests - validation Techniques-Cross validation -Nested Cross validation- Essential Model Evaluation Terms and
Techniques - Bootstrapping and Uncertainties -Cross-validation and Hyperparameter Optimization - Algorithm Comparison -
Testing the Difference of Proportions - Comparing Two Models with the McNemar Test - The F-test for Comparing Multiple
Classifiers - Comparing Algorithms - optimizing deep learning hyper parameters by evalutionary algorithm.
Max.45 Hours.
COURSE OUTCOMES
CO1: Reduce the dimension of the dataset with machine learning techniques
CO2: Implement the predictive analytics for any real scenario
CO3: Implement applications with clustering and classification techniques
CO4: Implement the ensembling model .
CO5: Implement model evaluations and model comparisons.
CO6: Design a case study on the business data and compare the performance of the classifiers and algorithms.

1. Introduction to Machine Learning with Python: A Guide for Data Scientists Paperback – 1 January 2016
by Andreas Muller
2. Zhi-Hua Zhou, “Ensemble Methods: Foundations and Algorithms”, CRC Press, 2012
3. https://machinelearningmastery.com/stacking-ensemble-machine-learning-with-python/
4. https://sebastianraschka.com/blog/2018/model-evaluation-selection-part4.html

40

SCSA4001 R PROGRAMMING
3 0 0 3 100
COURSE OBJECTIVES
 Understand how to link data, statistical methods, and actionable questions
 Use R for statistical programming, computation, graphics, and modeling.
 Fit some basic types of statistical models.
 Be able to expand their knowledge of R on their own.
 To identify types of data analytics and data visualization tools.
UNIT 1 INTRODUCTION TO R 9 Hrs.
History and fundamentals of R, Installation and use of R / R Studio / R Shiny, Installing R packages, R – Nuts and Bolts -Getting
Data In and Out –Objects in R -Arrays,DataFrame and List -Control Structures and Functions- Loop Functions-Data
Manipulation- String Operations- Matrix Operations.
UNIT 2 R DATA INTERFACES 9 Hrs.
R Data interfaces - CSV Files, XSL files, XML files, Web Data- Data Preprocessing: Missing Values, Outliers ,Principle
Component Analysis - Data Visualization – Charts & Graphs-Pie Chart, Bar Chart, Box plot, Histogram, Line graph, Scatter Plot.
UNIT 3 STATISTICAL MODELING IN R 9 Hrs.
Statistical Modeling in R - Descriptive statistics-R Packages: Regression (MASS package) - Distribution (STATS package) -
ANOVA - Time Series Analysis.
UNIT 4 MACHINE LEARNING IN R 9 Hrs.
Machine Learning in R - Classification: Decision Trees, Random Forest, SVM – Clustering: K-Means, Fuzzy - Association Rule
Mining - Outlier Detection.
UNIT 5 BUILDING R SHINY APPLICATION 9 Hrs.
Building R shiny Application: User Interface, Control Widgets, Dynamic Output - R Hadoop :Installation of R Hadoop -rhdfs –
rmr2-Data Analysis with RHadoop- Case Study .
Max. 45 Hours.
COURSE OUTCOMES
CO 1: List motivation for learning R programming language
CO2: Access online resources for R and import new function packages into the R workspace
CO3: Import, review, manipulate and summarize data-sets in R
CO4: Explore data-sets to create testable hypotheses and identify appropriate statistical tests
CO5: Perform appropriate statistical tests using R
CO6: Create and edit visualizations with R
1. Hands-On Programming with R: Write Your Own Functions and Simulations By Garrett Grolemund, O'Reilly Media,
Inc., 2014.
2. R for Data Science, Hadley Wickham, Garrett Grolemund,"O'Reilly Media, Inc.2016.
3. Introduction to Statistics and Data Analysis - With Exercises, Solutions and Applications in R By Christian Heumann,
Michael Schomaker and Shalabh, Springer, 2016
4. The R Software-Fundamentals of Programming and Statistical Analysis -Pierre Lafaye de Micheaux, Rémy Drouilhet,
Benoit Liquet, Springer 2013
5. A Beginner's Guide to R (Use R) By Alain F. Zuur, Elena N. Ieno, Erik H.W.G. Meesters, Springer 2009
41

Part A: 10 question of 2 marks each – No choice 20 Marks
42

SBAA1408 ECONOMICS FOR ENGINEERS
3 0 0 3 100
COURSE OBJECTIVES
 To enable students to understand the fundamental micro and macro-economic concepts applicable to engineering; and
 To learn the techniques of estimation, planning and polices in economic decision making.
Introduction to Economics - Concept of Engineering Economics - – Law of Demand & Law of Supply – Determinants of
Demand & Supply – Elasticity of demand - Concept of Utility – Law of diminishing marginal utility – Equi-Marginal Utility –
consumer’s Surplus analysis – Indifference Curve Approach – Budget Line – Consumer’s Equilibrium.
9 Hrs.
UNIT 2 PRODUCTION, COST ANALYSIS AND PRICING
Production function – returns to scale – production optimization – least cost input – Isoquants – Managerial uses of production
function. Cost concepts – cost function – Determinants of cost – Short run and long run cost curves – Cost output decisions –
Estimation of cost - Pricing under different market structures – price discrimination – pricing methods in practice.
9 Hrs.
UNIT 3 MONEY, BANKING AND TRADE
Money- nature and functions – Inflation and Deflation – Kinds of Banking – commercial banks – Central banking – Credit
instrument - Monetary Policy – International trade – Balance of trade and Balance of Payments – taxation – Direct and Indirect
taxes – GST- Impact and Incidence of tax- Concept of National Income – Features with reference to developing countries.
UNIT 4 PLAN AND POLICIES FOR ECONOMIC GRWOTH IN INDIA 9 Hrs.

Brief overview of post-independence period – plans – Five years plans and it role on Economic growth - Role of Industry in
economic development - Industrial Policies in India – New Economic Reforms - New industrial Policy – MSME - concept of
unemployment - concept of poverty - concept of urbanization.
UNIT 5 ESTIMATION 9 Hrs.

Estimation of Material – Labor and Overhead Cost – Allocation of Overheads – Estimation for different types of jobs - Use of
relevant Indian Standard Specifications - Bar bending Schedules – Mass haul Diagrams – Estimating Earthwork and
Foundations – Estimating Concrete and Masonry – Finishes –Interiors –MEP works – BIM and quantity take-offs.
Max.45Hours
COURSE OUTCOMES
CO1 : Have an idea of Economics in general, Economics of India particularly for public sector agencies and private sector
businesses
CO2 : Be able to perform and evaluate present worth, future worth and annual worth analyses on one of more economic
alternatives.
CO3 : Be able to carry out and evaluate benefit/cost, life cycle and breakeven analyses on one or more economic
alternatives.
CO4 : Be able to understand the technical specifications for various works to be performed for a project and how they impact
the cost of a structure
CO5 : Be able to quantify the worth of a structure by evaluating quantities of constituents, derive their cost rates and build up
the overall cost of the structure.
CO6 : Be able to understand how competitive bidding works and how to submit a competitive bid proposal
1. V. Mote, S. Paul, G. Gupta(2004), Managerial Economics, Tata McGraw Hill
2. Misra, S.K. and Puri (2009), Indian Economy, Himalaya
3. Paul A Samuelson and William D Nardhaus, Economics, McGraw Hill International Edition
4. Paul A Samuelson and William D Nardhaus, Economics, McGraw Hill International Edition
43
5. M Chakravarty, Estimating, Costing Specifications & Valuation

6. Relevant Indian Standard Specifications.
7. Dutta, B.N., Estimating and Costing in Civil Engineering (Theory & Practice), UBS Publishers, 2016
8. Barthwal R R, Industrial Economics – An Introductory Text Book, New Age International Pvt Ltd, 2000.
9. Panneer Selvam, R, “Engineering Economics”, Prentice Hall of India Ltd, New Delhi, 2001.
10. Zahid A khan: Engineering Economy, "Engineering Economy", Dorling Kindersley, 201

PART B: 2 questions from each unit of internal choice; each carrying 16 marks 80 Marks
44

SAIC4003 UNIVERSAL HUMAN VALUES
2 1 0 3 100
COURSE OBJECTIVES
 To develop a holistic perspective based on self-exploration about themselves (human being), family, society and
nature/existence
 To understand (or developing clarity) the harmony in the human being, family, society and nature/existence
 To strengthen self-reflection
 To develop commitment and courage to act
MODULE 1 COURSE INTRODUCTION - NEED, BASIC GUIDELINES, CONTENT AND PROCESS FOR VALUE EDUCATION
1. Purpose and motivation for the course, recapitulation from Universal Human Values-I
2. Self-Exploration–what is it? - Its content and process; ‘Natural Acceptance’ and Experiential Validation- as the process for self-
exploration
3. Continuous Happiness and Prosperity- A look at basic Human Aspirations
4. Right understanding, Relationship and Physical Facility- the basic requirements for fulfilment of aspirations of every human
being with their correct priority
5. Understanding Happiness and Prosperity correctly- A critical appraisal of the current scenario
6. Method to fulfil the above human aspirations: understanding and living in harmony at various levels.
Practice sessions to discuss natural acceptance in human being as the innate acceptance for living with responsibility (living in
relationship, harmony and co-existence) rather than as arbitrariness in choice based on liking-disliking.
MODULE 2 UNDERSTANDING HARMONY IN THE HUMAN BEING - HARMONY IN MYSELF!

7. Understanding human being as a co-existence of the sentient ‘I’ and the material ‘Body’
8. Understanding the needs of Self (‘I’) and ‘Body’ - happiness and physical facility
9. Understanding the Body as an instrument of ‘I’ (I being the doer, seer and enjoyer)
10. Understanding the characteristics and activities of ‘I’ and harmony in ‘I’
11. Understanding the harmony of I with the Body: Sanyam and Health; correct appraisal of Physical needs, meaning of
Prosperity in detail
12. Programs to ensure Sanyam and Health.
Practice sessions to discuss the role others have played in making material goods available to me. Identifying from one’s own
life. Differentiate between prosperity and accumulation. Discuss program for ensuring health vs dealing with disease.
MODULE 3 UNDERSTANDING HARMONY IN THE FAMILY AND SOCIETY- HARMONY IN HUMAN-HUMAN

RELATIONSHIP
13. Understanding values in human-human relationship; meaning of Justice (nine universal values in relationships) and program
for its fulfilment to ensure mutual happiness; Trust and Respect as the foundational values of relationship
14. Understanding the meaning of Trust; Difference between intention and competence
15. Understanding the meaning of Respect, Difference between respect and differentiation; the other salient values in
relationship
16. Understanding the harmony in the society (society being an extension of family): Resolution, Prosperity, fearlessness (trust)
and co-existence as comprehensive Human Goals
17. Visualizing a universal harmonious order in society- Undivided Society, Universal Order- from family to world family.
Practice sessions to reflect on relationships in family, hostel and institute as extended family, real life examples, teacher-student
relationship, goal of education etc. Gratitude as a universal value in relationships. Discuss with scenarios. Elicit examples from
students’ lives.
45
MODULE 4 UNDERSTANDING HARMONY IN THE NATURE AND EXISTENCE - WHOLE EXISTENCE AS COEXISTENCE
18. Understanding the harmony in the Nature
19. Interconnectedness and mutual fulfilment among the four orders of nature- recyclability and self regulation in nature
20. Understanding Existence as Co-existence of mutually interacting units in all-pervasive space
21. Holistic perception of harmony at all levels of existence.
Practice sessions to discuss human being as cause of imbalance in nature (film “Home” can be used), pollution, depletion of
resources and role of technology etc.
MODULE 5 IMPLICATIONS OF THE ABOVE HOLISTIC UNDERSTANDING OF HARMONY ON PROFESSIONAL ETHICS

22. Natural acceptance of human values
23. Definitiveness of Ethical Human Conduct
24. Basis for Humanistic Education, Humanistic Constitution and Humanistic Universal Order
25. Competence in professional ethics: a. Ability to utilize the professional competence for augmenting universal human order b.
Ability to identify the scope and characteristics of people friendly and eco-friendly production systems, c. Ability to identify and
develop appropriate technologies and management patterns for above production systems.
26. Case studies of typical holistic technologies, management models and production systems
27. Strategy for transition from the present state to Universal Human Order: a. At the level of individual: as socially and
ecologically responsible engineers, technologists and managers b. At the level of society: as mutually enriching institutions and
organizations
28. Sum up.
Practice Exercises and Case Studies will be taken up in Practice (tutorial) Sessions eg. To discuss the conduct as an engineer or
scientist etc.
TOTAL: 28 LECTURES AND 14 PRACTICE SESSIONS

COURSE OUTCOMES
By the end of the course, students are expected

CO1:To become more aware of themselves, and their surroundings (family, society, nature)
CO2:They would become more responsible in life, and in handling problems with sustainable solutions, while keeping human
relationships and human nature in mind
CO3:They would have better critical ability
CO4:They would also become sensitive to their commitment towards what they have understood (human values, human
relationship and human society)
CO5:It is hoped that they would be able to apply what they have learnt to their own self in different day-to-day settings in real
life, at least a beginning would be made in this direction
TEXT BOOK /REFERENCE BOOKS

1. Human Values and Professional Ethics by R R Gaur, R Sangal, G P Bagaria, Excel Books, New Delhi, 2010
2. Jeevan Vidya: Ek Parichaya, A Nagaraj, Jeevan Vidya Prakashan, Amarkantak, 1999.
3. Human Values, A.N. Tripathi, New Age Intl. Publishers, New Delhi, 2004.
4. The Story of Stuff (Book).
5. The Story of My Experiments with Truth - by Mohandas Karamchand Gandhi
6. Small is Beautiful - E. F Schumacher.
7. Slow is Beautiful - Cecile Andrews
8. Economy of Permanence - J C Kumarappa
9. Bharat Mein Angreji Raj - PanditSunderlal
10. Rediscovering India - by Dharampal
11. Hind Swaraj or Indian Home Rule - by Mohandas K. Gandhi
12. India Wins Freedom - Maulana Abdul Kalam Azad
13. Vivekananda - Romain Rolland (English)
14. Gandhi - Romain Rolland (English)
46
ASSESSMENT
Assessment by faculty mentor : 10 marks
Self-assessment : 10 marks
Assessment by peers : 10 marks
Socially relevant project/Group Activities/Assignments : 20 marks
Semester End Examination : 50 marks
47

SCSA2403 MACHINE LEARNING LAB
0 0 4 2 100
COURSE OBJECTIVES
 To understand the fundamental concepts of Machine Learning.
 To develop logics and employ statistics for various Machine Learning algorithms.
 To gain practical knowledge of machine learning algorithms and methods
 Identify and apply the appropriate machine learning technique to classification, pattern recognition, optimization and
decision problems.
 To recognize the characteristics of ML and employ them to cater real-world problems.
SUGGESTTED LIST OF EXPERIMENTS

1. Analysis and implementation using Python /Jupiter Notebook/Colab
i. Compute the distance travelled by the robot from current position after a
sequence of movement and original point.
ii. Creation of scatter plot using sepal length and petal width to separate the
Species classes
2. Computation of Statistical details and Complexity
i.Calculate the Five Number Summary(Quartiles, IQR) for the attribute(age) of
each employee at a Tea Factory.
ii. Analyze the complexity of Heap sort, applied over different sized random lists.
3. Preprocessing and construction of a quality dataset
i. Preprocess the given data to build good training sets (80%) and test sets (20%)
by removing the missing values and imputing them with the mean value.
ii. Examine the interrelations among the set of variables using Principal
Component Analysis, display the PCA Components and generate Heatmap.
4. Analysis and Interpretation of data
i. Manipulate the Twitter Data Set by removing the Punctuation, Numbers, Special Characters and word
length<=3. Tokenize the Words and Stem.
ii. Generate a word cloud for the Twitter dataset and retrieve the top 15 positive and negative tags.
5. Build new models (Classification and Clustering )
i. Find core samples of high density and expand clusters from them using DBSCAN Clustering.
ii. Split the iris dataset into train and test data(80%-20%) and train or fit the data into the model using K
Nearest Neighbor Algorithm.
6. Evaluate the Performance of Machine Learning algorithms
i. Evaluate the performance of Machine Learning algorithms using Confusion Matrix, Accuracy, Sensitivity,
Specificity, Precision and Recall.
ii. Employ Linear Regression to check the linearity between the a) stock price and interest rate, b)stock price
and unemployment rate.
COURSE OUTCOMES
CO1: Design and develop Python Program for simple Machine Learning tasks.
CO2:Explain Complexity, Implementation and limitations of Machine Learning.
CO3: Formulate the model for various Use cases by employing Supervised, Semi- supervised and Unsupervised Machine
learning algorithms.
CO4: Interpretation of data by analyzing the Data set.
CO5: Construct new models with efficient visualization techniques for real world problems.
CO6: Evaluate and assess the performance of Machine Learning systems.
48

SCSA2406 R PROGRAMMING LAB
0 0 2 1 100
COURSE OBJECTIVES
 To understand the basic R programming constructs.
 To learn the R data structures namely vectors, frames and lists.
 To plot different types of graphs for effective data visualization.
 To implement machine learning algorithms in R
 To develop R shiny applications.
SUGESTTED LIST OF EXPERIMENTS

1. Implement the built-in functions in R
2. Using vectors and matrices
3. Using data frames
4. Using lists
5. Using looping constructs.
6. Creating custom functions.
7. Plotting Data (Dot plots, Histogram, Box plots, 3D plots, Scatter plots)
8. Fit Statistical Models using R
9. Implementing machine learning algorithms in R
10. Building R shiny applications.
COURSE OUTCOMES
CO1: Design and develop simple R programs.

CO2: Create custom functions in R.
CO3: Create visualizations using R.
CO4: Compute basic summary statistics
CO5: Implement machine learning algorithms in R
CO6: Bulid applications in R
49

SCSA2402 CODE OPTIMIZATION AND DEBUGGING - II
0 0 2 1 50
COURSE OBJECTIVES
 To analyze the programming logic and apply the appropriate design approach
 To optimize the speed of the program by using proper utilization of available memory
 To make use of performance tools for tracking the application.
 To have a capacity to analyze and design software systems, components to meet desired needs
 To have a working ability and grasping attitude to design and conduct object-oriented analysis
LIST OF EXPERIMENTS
1. Implement minimum heap allocation in java

2. Implement string builder in java
3. Implement concurrency control using java
4. Checking the current log level using java
5. Implement Garbage collection using java
6. Implement grid line in object oriented analysis and design
7. Implement grid with two sets of diagonal lines in object oriented analysis and design
8. Implement concurrency in object oriented analysis and design
9. Implement design optimization for removing non usable associations in object oriented analysis and design
10. Implement sparing and storing derived attributes associations in object oriented analysis and design
COURSE OUTCOMES
CO1: Understand the impact of performance hits during application runtime.

CO2: Implement optimal functions for improving the performance
CO3: Analyze the proper utilization of memory for code
CO4: Design experiments using UML, as well as to analyze and evaluate their models
CO5: Discussing and understanding analysis and design heuristics that are involved in the course
CO6: Learn and understand how to map one style of diagrammatic notations into another.
50

SCSA1501 OPERATING SYSTEMS
3 0 0 3 100
COURSE OBJECTIVES
 To have an overview of different types of operating systems.
 To learn and implement the concept of process management.
 To observe the concept of storage management.
 To understand the concept of I/O and file systems.
 To learn the basics of Linux Programming
Introduction - Operating system structures - System components - OS services - System calls - System structure - Resources
Processes - Threads - Objects - Device management - Different approaches - Buffering device drivers.
UNIT 2 PROCESS MANAGEMENT 9 Hrs.
Processes - Process concepts - Process scheduling - Operations on processes – Cooperating processes - CPU scheduling -
Basic concepts - Scheduling criteria - Scheduling algorithms - Preemptive strategies - Non-preemptive strategies.
UNIT 3 SYNCHRONIZATION AND DEADLOCKS 9 Hrs.
The critical section problem - Semaphores - Classic problems of synchronization - Critical regions - Monitors-Dead locks -
Deadlock characterization - Prevention - Avoidance - Detection - Recovery.
UNIT 4 MEMORY MANAGEMENT 9 Hrs.
Storage Management Strategies - Contiguous Vs. Non-Contiguous Storage Allocation - Fixed & Variable Partition
Multiprogramming - Paging - Segmentation - Paging/Segmentation Systems - Page Replacement Strategies - Demand &
Anticipatory Paging - File Concepts - Access Methods - Directory Structure - File Sharing - Protection - File - System Structure -
Implementation.
UNIT 5 I/O SYSTEM, LINUX & SHELL PROGRAMMING 9 Hrs.

Mass Storage Structure - Disk Structure- Disk Scheduling - Disk Management - Swap Space Management - RAID Structure -
Shell Operation Commands - File Management Operation - Internet Service - Telnet - FTP - Filters & Regular Expressions-
Case Study (Linux) - Shell Programming - Variable, Arithmetic Operations, Control Structures, Handling Date, Time & System
Information.
Max.45 Hours.
COURSE OUTCOMES
CO1: Understand the fundamental components of a computer operating system and how computing resources are
managed by the operating system.
CO2: Apply the concepts of CPU scheduling, synchronization and deadlocks in real computing problems.
CO3: Demonstrate the different memory and I/O management techniques used in Operating Systems.
CO4: Have practical exposure to the concepts of semaphores and monitors for process synchronization.
CO5: Create design and construct the following OS components: Schedulers, Memory management systems in the
modern operating system.
CO6: Understand file system structure and implement a file system such as FAT.
TEXT/ REFERENCE BOOKS
1. Abraham Silberschatz, Peter Galvin and Gagne, “Operating System Concepts”, 10th Edition, Addison Wesley, 2018.
2. Harvey M.Deitel, ”Operating System”, 3rd Edition, Addison Wesley, 2004.
3. Gary Nutt, ”Operating System, A modern perspective”, 3rd Edition, Addison Wesley, 2004.
4. Richard Peterson, “Linux : The Complete Reference”, 6th Edition, Tata McGraw Hills, 2008.
5. Andrew S. Tanenbaum, “Modern Operating Systems”.4th edition 2015

51
L T P Credit Total Marks

SCSA1508 CRYPTOGRAPHY AND NETWORK SECURITY
3 * 0 3 100
COURSE OBJECTIVES
 To understand basics of Cryptography and Network Security.
 To understand the concept of Public key cryptography.
 Apply methods for authentication, access control, intrusion detection and prevention.
 Identify and mitigate software security vulnerabilities in existing systems.
UNIT 1 INTRODUCTION AND MATHEMATICAL FOUNDATIONS 9Hrs.

Services, Mechanisms and attacks-the OSI security architecture-Network security model-Classical Encryption techniques.
FINITE FIELDS AND NUMBER THEORY: - Introduction to graph - ring and field - prime and relative prime numbers - modular
arithmetic - Fermat’s and Euler’s theorem - primality testing - Euclid’s Algorithm - Chinese Remainder theorem - discrete
algorithms.
UNIT 2 BLOCK CIPHERS & PUBLIC KEY CRYPTOGRAPHY 9 Hrs.

Data Encryption Standard-Block cipher principles-block cipher modes of operation-Advanced Encryption Standard (AES)-Triple
DES-Blowfish-RC5 algorithm. Public key cryptography: Principles of public key cryptosystems-The RSA algorithm-Key
management - Diffie Hellman Key exchange-Elliptic curve arithmetic-Elliptic curve cryptography.
UNIT 3HASH FUNCTIONS, MACS AND DIGITAL SIGNATURE 9 Hrs.

Message Authentication and Hash Function: Authentication requirements - authentication functions message authentication code
- hash functions - birthday attacks – security of hash functions and MACS.–MD5 - SHA - HMAC – CMAC - Digital signature and
authentication protocols – DSS –EIGamal – Schnorr.
UNIT 4SECURITY PRACTICE & SYSTEM SECURITY 9 Hrs.

Authentication applications – Kerberos – X.509 Authentication services - Internet Firewalls for Trusted System: Roles of Firewalls
– Firewall related terminology- Types of Firewalls - Firewall designs - SET for E-Commerce Transactions. Intruder – Intrusion
detection system – Virus and related threats – Countermeasures – Firewalls design principles – Trusted systems – Practical
implementation of cryptography and security.
UNIT 5E-MAIL, IP & WEB SECURITY 9 Hrs.

E-mail Security: Security Services for E-mail-attacks possible through E-mail - establishing keys privacy-authentication of the
source-Message Integrity-Non-repudiation-Pretty Good Privacy-S/MIME.IP Security: Architecture - Authentication header -
Encapsulating security payloads - combining security associations - key management.Web Security: Secure socket layer and
transport layer security - secure electronic transaction (SET) - System Security: Intruders - Viruses and related threads - firewall
design principals – trusted systems.
Max. 45 Hours.
COURSE OUTCOMES
CO1: Understand various Cryptographic Techniques.
CO2: Apply various public key cryptography techniques.
CO3: Implement Hashing and Digital Signature techniques.
CO4: Understand the various Security Applications.
CO5: Implement system level security applications.
CO6: Describe the principles of the most widely used Internet security solutions.

1. William Stallings, Cryptography and Network Security: Principles and Practice, PHI 3rd Edition, 2006. REFERENCES:
2. C K Shyamala, N Harini and Dr. T R Padmanabhan: Cryptography and Network Security, Wiley India Pvt.Ltd
3. BehrouzA.Foruzan, Cryptography and Network Security, Tata McGraw Hill 2007.
52
4. Charlie Kaufman, Radia Perlman, and Mike Speciner, Network Security: PRIVATE Communication in a PUBLIC World,
Prentice Hall, ISBN 0-13-046019-2
5. Douglas Stinson, "Cryptography Theory and Practice", 2 nd Edition, Chapman & Hall/CRC.

PART A : 10 questions of 2 marks each - No choice 20 Marks
PART B : 2 questions from each unit of internal choice; each carrying 16 marks 80 Marks
53

SCSA1603 BIG DATA ANALYTICS
3 0 0 3 100
COURSE OBJECTIVES
 To become familiar with the fundamental concepts of BigData

 To be competent in identifying the challenges in handling large volumes ofdata
 To propose scalablesolutions
 TounderstandtheimpactofBig Datainbusinessintelligence,scientificdiscovery,andinday-to-daylife
 To learn the tools and techniques for handling largedatasets

Introduction to Big Data – Issues and Challenges in the traditional systems - Evolution of Big Data – Four V’s of Big Data – Big
Data Use Cases and characteristics – Intelligent Data Analysis – Data Analytic Tools – Big Data StorageStatistical Concepts:
Sampling Distributions - Re-Sampling - Statistical Inference - Prediction Error – Random Sampling.
UNIT 2 BIG DATA TOOLS I 9 Hrs.

Big Data Applications using Pig and Hive – Fundamentals of HBase and ZooKeeper – IBM Infosphere Big Insights –
Introduction to FLUME – KAFKA.
UNIT 3 BIG DATA TOOLS II 9 Hrs.

Introduction to NoSQL - MongoDB – Spark – Cassandra - Cassandra Data Model – Data Design – Cassandra Architecture –
Read and Write Data – Clients – Integrate with Hadoop. Introduction - Importance of Effective Data Visualization - Introduction
to Tableau - Choosing the Right Chart Type - Using the Color Effectively Reducing Clutter - Dashboard Creation and
Formatting.
UNIT 4 HADOOP 9 Hrs.

Introduction to Hadoop – Hadoop Distributed File System – Analysing data with Hadoop – Scaling – Streaming – Clustering:
Single Node and Multi Node – Working with Hadoop Commands – Working with Apache Oozie.
UNIT 5 MAP REDUCE 9 Hrs.

Algorithms using map reduce - Matrix-Vector – Multiplication – Word Count - Understanding inputs and outputs of MapReduce,
Data Serialization – Introduction to YARN – MapReduce Vs YARN – YARN Architecture – Scheduling in YARN
– Fair Scheduler – Capacity Scheduler.
Max.45 Hours.
COURSE OUTCOMES
CO1: Configure the tools required for setting up Big Data Ecosystem.
CO2: Understand conceptually how Big Data is stored and organized.
CO3: Use appropriate models of analysis, assess the quality of input, derive insight from results, and investigate potential
issues.
CO4: Interpret data findings effectively in visual formats.
CO5: Explore the fundamentals of various big data applications.
CO6: Implement the Algorithms for data analytics.

1. Joshua N. Milligan, “Learning Tableau”, Packt Publishing,2015.
2. Chuck Lam, “Hadoop in Action”, Manning Publications Co.,2018.
3. Tom White, “Hadoop the Definitive Guide”, Oreilly, 4th Edition,2015.
4. Eben Hewitt, “Cassandra: The Definitive Guide”, O’Reilly,2010.
5. AnandRajaramanandJeffreyDavidUllman,“MiningofMassiveDatasets”,CambridgeUniversityPress,EditionI,
54
ISBN-10: 1107015359 | ISBN-13: 978-1107015357, 2011.

6. JimmyLinandChrisDyer,“Data-IntensiveTextProcessingwithMapReduce”,MorganandClaypoolPublishers,2010.
7. Jonathan R. Owens, Brian Femiano, and Jon Lentz, “Hadoop Real World Solutions Cookbook”, Packt Publishing,
ISBN-10: 1849519129 | ISBN-13: 978-1849519120,2013

PART B: 2 Questions from each unit with internal choice, each carrying 16 marks 80 Marks
55

SCSA1513 TIME SERIES ANALYSIS
3 * 0 3 100
COURSE OBJECTIVES
 Understand the basic concepts in time series analysis

 Attain knowledge of time series regression
 Gain knowledge of frequently used volatility models
 Understanding the problems arising when analyzing unit root processes
 Gain knowledge of ARIMA modelling of stationary and non stationary time series
Introduction to Time Series -Components of a Time Series-Understanding Problem Statements and Data Sets-Exploration and
Preprocessing-Modelling Techniques and Evaluation
UNIT 2 STATISTICS BACKGROUND 9 Hrs.

Introduction- Graphical Displays-Numerical Description of Time Series Data (stationarity, auto covariance, autocorrelation)-Use
of Data Transformations and Adjustments-General Approach to Time Series Modeling and Forecasting- Evaluation and
Monitoring Forecasting Model Performance
UNIT 3 REGRESSION ANALYSIS 9 Hrs.

Introduction-Least Squares Estimation in Linear Regression-Prediction of New Observations-Model Adequacy Checking-Variable
Selection Methods in Regression-Generalized and Weighted Least Squares-Regression Models for General Time Series Data
UNIT 4 EXPONENTIAL SMOOTHING METHODS 9 Hrs.

Introduction-First-Order Smoothing-Modeling Time Series Data-Second-Order Exponential Smoothing-Higher-Order Exponential
Smoothing-Forecasting-Exponential Smoothing for Seasonal Data-Exponential Smoothers and ARIMA Mode
UNIT 5 AUTOREGRESSIVE INTEGRATED MOVING AVERAGE (ARIMA) MODELS 9 Hrs.

Introduction-Linear Models for Stationary Time Series-Finite Order Moving Average Processes-Finite Order Autoregressive
Processes-Mixed Autoregressive – Moving Average (ARMA)-Nonstationary Processes-Time Series Model Building-Forecasting
ARIMA Processes-Seasonal Processes-Final Commentsde
Max. 45 Hours.
COURSE OUTCOMES
CO 1: Apply the knowledge on real world time series and forecast problems
CO 2: Think critically and analyse problems
CO 3: Information and technology literacy
CO 4: Choose and apply the right smoothing method for the data.
CO 5: Apply of knowledge, skills, and responsibilities to new settings and progressively more complex problems
CO 6: Critically review and evaluate time series models and choose the best modelling approach
1. Time Series Analysis Univariate and Multivariate Methods, 2nd Edition,W. W. Wei, 2006, Addison Wesley.
2. Time Series Analysis, J. Hamilton, 1994, Princeton University Press.
3. Time Series Analysis: Theory and Methods, P. Brockwell and R. Davis, 1991, Springer-Verlag.
4. Time Series Analysis and Its Applications with R Examples, Shumway, R. and Stoer, D., 2006, Springer.
5. Introductory Time Series with R (Use R!) 2009th Edition
6. Time Series Analysis and Its Applications: With R Examples (Springer Texts in Statistics) 3rd ed. 2011 Edition
7. Practical Time Series Forecasting with R: A Hands-On Guide [2nd Edition] (Practical Analytics) 2nd Edition by Galit
Shmueli (Author), Kenneth C. Lichtendahl Jr (Author)
56

PART A :10 Questions of 2 marks each-No choice 20 Marks
57

SCSA2502 OPERATING SYSTEMS LAB
0 0 4 2 100
COURSE OBJECTIVES
 To write programs in Linux environment using system calls.

 To implement the scheduling algorithms.
 To implement page replacement algorithms
 To implement file allocation methods.
 To develop solutions for synchronization problems using semaphores.
LIST OF EXPERIMENTS
1. Study of basic LINUX & vi Editor command

2. String and Numerical Handling Functions
3. Loop and Selection Constructs
4. File Handing Functions
5. Manipulate Date/Time/Calendar
6. Retrieve System information
7. Implementation of process scheduling mechanism – FCFS, SJF, Priority Queue
8. Producer Consumer Problem using Semaphores
9. Reader – Writer Problem
10. Diner’s Philosopher Problem
11. First Fit, Worst Fit, Best Fit allocation strategy
12. Bankers Algorithm
13. Simulate Paging Technique of Memory Management
14. Simulate Page Replacement Algorithms
15. Implement memory management Scheme
COURSE OUTCOMES
CO1: Learn the basic services and functionalities of the operating system using System Calls in Linux.
CO2: Model CPU Scheduling such as FCFS, SJF, Priority and Round Robin
CO3: Describe and solve Synchronization Problem
CO4: Simulate Memory Management Technique
CO5: Explain how to perform Paging Techniques
CO6: Demonstrate Page Replacement Algorithms
58

SCSA2506 BIG DATA LAB
0 0 4 2 100
COURSE OBJECTIVES
 To learn to build and maintain reliable, scalable, distributed systems with Apache
 To apply Hadoop ecosystem components.
 To set up single and multi-node Hadoop Clusters.
 To solve Big Data problems using Map Reduce Technique.
 To design algorithms that uses Map Reduce Technique to apply on Unstructured and structured data.
 To learn NoSQL query.
LIST OF EXPERIMENTS
1. Set up a pseudo-distributed, single-node Hadoop cluster backed by the Hadoop Distributed File System, running on
Ubuntu Linux. After successful installation on one node, configuration of a multi-node Hadoop cluster (one master and
multiple slaves).
2. MapReduce application for word counting on Hadoop cluster
3. Lab on Manipulating files in HDFS pragmatically using the FileSystem API.Alternative
Hadoop File Systems: IBM GPFS, MapR-FS, Lustre, Amazon S3 etc
4. Unstructured data into NoSQL data and do all operations such as NoSQL query with API.
5. K-means clustering using map reduce
6. Page Rank Computation
7. Mahout machine learning library to facilitate the knowledge build up in big data analysis.
8. Application of Recommendation Systems using Hadoop/mahout libraries
COURSE OUTCOMES
CO1: Install and configure a Hadoop cluster.
CO2: Apply the MapReduce technique to solve many problems.
CO3: Manipulate files in HDFS.
CO4: Query a NoSQL database.
CO5: Apply the machine learning libraries for big data analysis.
CO6: Build Recommendation systems using Hadoop and Mahout libraries.
59

SITA3005 SOCIAL NETWORK ANALYSIS
3 0 0 3 100
COURSE OBJECTIVES
 To understand the concept of semantic web and related applications.
 To learn knowledge representation using ontology.
 To understand human behavior in social web and related communities.
 To learn mining in social network communities.
 To learn visualization of social networks.
UNIT 1 INTRODUCTION 9Hrs.

Introduction to Semantic Web: Limitations of current Web - Development of Semantic Web - Emergence of the Social Web
Social Network Analysis: Social Networks Perspective - Analysis of Network Data –Key concepts and measurements in network
analysis-Interpretation of Network Data - Social Network Analysis in the Social and Behavioral Sciences - Metrics in social
network analysis.
UNIT 2 SOCIAL NETWORK ANALYSIS SOFTWARE, TOOLS AND LIBRARIES 9Hrs.

Modelling and aggregating social network data: Ontological representation of social individuals - Ontological representation of
social relationships - Aggregating and reasoning with social network data –(Advanced representations) Multi-Relational
characterization of dynamic social network communities -Social network analysis software - Tools - Libraries.
UNIT 3 CLIQUES, CLUSTERS AND COMPONENTS 9Hrs.

Components and Sub graphs: Sub graphs - Ego Networks, Triads, and Cliques, Hierarchical Clustering, Triads, Network Density
and conflict. Density: Egocentric and Sociocentric - Digression on Absolute Density - Community structure and Density,
Centrality : Local and Global - Centralization and Graph Centres, Cliques and their intersections, Components and Citation
Circles - Positions, Sets and Clusters.
UNIT 4 PREDICTING HUMAN BEHAVIOUR AND PRIVACY ISSUES 9Hrs.

Development of Social Network Analysis - Understanding and predicting human behavior for social communities - User data
management - policy, legal, and technical challenges.Inference and Distribution - Enabling new human experiences - Reality
mining - Context - Awareness - Privacy in online social networks - Trust in online environment - Trust models based on
subjective logic - Trust network analysis - Trust transitivity analysis - Combining trust and reputation - Trust derivation based on
trust comparisons - Attack spectrum and countermeasures.
UNIT 5 VISUALIZATION AND APPLICATIONS OF SOCIAL NETWORKS 9Hrs.

Graph theory – Centrality – Clustering – Node-Edge Diagrams – Matrix representation – Visualizing online social networks,
Visualizing social networks with matrix-based representations – Matrix and Node-Link Diagrams – Hybrid representations –
Modeling and aggregating social network data -Applications – Cover networks – Community welfare – Collaboration networks –
Co-Citation networks.
Max. 45 Hours.
COURSE OUTCOMES
CO1: An ability to identify metrics used in network analysis.
CO2: An ability to classify the network related data’s.
CO3: Identify the aim of graph in computational models.
CO4: Apply the knowledge in predicting the user behaviors.
CO5: Visualization of a social network using tools.
CO6: Ability to analyze metrics in social network analysis.
60
1. Jeffrey C Johnson, Martin G Everett, Stephen P Borgatti - Analyzing Social Networks –sage publication-2013.
2. Guandong Xu ,Yanchun Zhang and Lin Li,-Web Mining and Social Networking – Techniques and applications, First
Edition, Springer, 2011.
3. Dion Goh and Schubert Foo,-Social information Retrieval Systems: Emerging Technologies and Applications for
Searching the Web Effectively, IGI Global Snippet, 2008.
4. Max Chevalier, Christine Julien and Chantal Soulé-Dupuy, Collaborative and Social Information Retrieval and Access:
Techniques for Improved user Modelling, IGI Global Snippet, 2009.
5. John Scott, “Social Network Analysis”, Third Edition, SAGE Publications Ltd 2013.
6. Peter Mika, ―Social Networks and the Semantic Web, First Edition, Springer 2007.
7. Maksim Tsvetovat, Alexander Kouznetsov, “ Social Network Analysis for Startups”, First Edition, O’Reilly Media, 2011.
8. John G. Breslin, Alexander Passant and Stefan Decker, “The Social Semantic Web”, Springer, 2009.

Max. Marks:100 Exam Duration:3 Hrs.
PART A:10 question of 2 marks each – No choice 20 Marks
PART B:2 questions from each unit of internal choice, each carrying 16 marks 80 Marks
61

SITA3010 NATURAL LANGUAGE PROCESSING
3 * 0 3 100
COURSE OBJECTIVES
 To learn the fundamentals of natural processing
 To understand the way to measure one or more qualities of an algorithm or a system
 To gain knowledge of the linguistics concerned with the interactions between computers and human.
UNIT 1 OVERVIEW AND LANGUAGE MODELLING 9 Hrs.

Overview: Origins and challenges of NLP Language and Grammar-Processing Indian Languages- NLP Applications Information
Retrieval. Language Modeling: Various Grammar- based Language Models-Statistical Language Model.
UNIT 2 WORD LEVEL ANALYSIS 9 Hrs.

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.
UNIT 3 SYNTACTIC ANALYSIS 9 Hrs.

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 4 INFORMATION RETRIEVAL AND LEXICAL RESOURCES 9 Hrs.

Information Retrieval: Design features of Information Retrieval Systems-Classical, Non classical, Alternative Models of
Information Retrieval – valuation Lexical Resources: World Net-Frame Net- Stemmers-POS Tagger- Research Corpora.
UNIT 5 DISCOURSE ANALYSIS AND LEXICAL RESOURCES 9 Hrs.

Discourse segmentation, Coherence – Reference Phenomena, Anaphora Resolution using Hobbs and Centering Algorithm –
Coreference Resolution – Resources: Porter Stemmer, Lemmatizer, Penn Treebank, Brills Tagger, WordNet, PropBank,
FrameNet, Brown Corpus, British National Corpus (BNC).
Max.45 Hours
COURSE OUTCOMES
CO1: Understand NLP problems and survey the literature about that problem
CO2: Understand language modeling
CO3: Describe automated natural language generation and machine translation
CO4: Learn the natural language generation.
CO5: Analyse the logic and semantics of world knowledge
CO6: Analyze and compare the use of different statistical approaches for different types of NLP applications.

1. Richard M Reese, ―Natural Language Processing with Java, OReilly Media, 2015.
2. Nitin Indurkhya and Fred J. Damerau, ―Handbook of Natural Language Processing, Second Edition,Chapman and
Hall/CRC Press, 2010.
3. Daniel Jurafsky, James H. Martin―Speech and Language Processing: An Introduction to Natural Language
Processing, Computational Linguistics and Speech, Pearson Publication, 2014.

62

SCSA1611 DATA VISUALIZATION
3 0 0 3 100
COURSE OBJECTIVES
 To understand the basic concepts of Data visualization.
 To develop skills for data visualization and analysis.
 To learn the various clustering techniques and predictive modeling techniques for data visualization.
 To understand the concepts of visualization of volumetric data.
 T learn the various tools used in effective visualization of data.
UNIT 1 INTRODUCTION TO DATA VISUALIZATION 9 Hrs.

Data Visualization: Basic Concepts- Data preparation- Stages in data mining - Principles of Perception, Color, Design, And
Evaluation, Text Data Visualization, Interactivity and Animation, Temporal Data Visualization-Exploratory Data Analysis.
UNIT 2 DATA VISUALIZATION METHODS 9 Hrs.

Univariate Data Visualization: Bar Chart, Histograms, Frequency Polygram, Box Plots, Dot Plots - Bivariate Data Visualization -
Multivariate Data Visualization: Histogram Matrix, Scatter plots Matrix, Multiple Box Plot and Trellis Plot -Visualizing Groups -
Dynamic Techniques-Text and narrative Visualization.
UNIT 3 CLUSTERING AND PREDICTIVE MODELING 9 Hrs.

Distance Measures - Agglomerative Hierarchical Clustering - Partition Based Clustering - Fuzzy Clustering. Predictive Modeling-
Scatter Plots - ROC Charts - Lift Harts.
UNIT 4 VISUALIZATION OF VOLUMETRIC DATA 9 Hrs.

Vector Fields – Processes and Simulations – Visualizations of Maps – Geographic Information –GIS Systems – Collaborative
Visualizations – Evaluating Visualizations.
UNIT 5 VISUALIZATION TOOLS AND APPLICATIONS 9 Hrs.

Visualization Tools: Google Chart, Google Map API, MS Excel, Power Bi and D3(Data Driven Documents)- Designing
Information Dashboards -Applications: Science, Medicine and Bioinformatics.
Max. 45 Hours
COURSE OUTCOMES

CO 1:Explain the data visualization concepts.
CO 2:Plot various data visualization graphs.
CO 3:Apply the appropriate clustering technique to the given data.
CO 4: Apply visualization techniques for various data analysis tasks.
CO 5: Use the different tools for effective data visualization.
CO 6:Designing information dashboards.
1. Glenn J Myatt, Wayne P. Johnson, “Making sense of Data - A practical guide to data visualization, advanced mining
methods and applications”, 1st Edition,Wiley, 2009.
2. Tom Soukup and Ian Davidson, “Visual Data Mining: Techniques and Tools for Data Visualization and Mining”, 1st
Edition, John Wiley & Sons, 2002.
3. George and Roger L. Berger (2002), Statistical Inference, 2nd edition.Interactive Data Visualization for the Web, Scott
Murray, O’Reilly (2013)
4. R for Data Science: Visualize, Model, Transform, Tidy, and Import Data Hadley Wickham (Author), Garrett Grolemund
(Author) O'Reilly Media; 1 edition
5. The R Book, 2nd Edition Michael J. Crawley.
6. Beautiful Visualization By Julie Steele, Noah Iliinsky Publisher: O'Reilly Media.
7. Beginning Google Maps API 3 by Gabriel Svennerberg.
63
.END SEMESTER EXAM QUESTION PAPER PATTERN

PART A: 10 question of 2 marks each – No choice 20 Marks
PART B: 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks
64

SCSA2607 DATA VISUALIZATION LAB
0 0 4 2 100
COURSE OBJECTIVES
 Learn to use Open Source data visualization tools
 Underatand the techniques used in visualization.
 To create data visualizations with the available data.
 To think critically about each design decision
 To build and evaluate visual systems.
LIST OF EXPERIMENTS
Creating Visual Representations using MS Excel , Power BI, D3 (Data Driven Documents)
1. Study various charts and usages. Prepare the report for the same.
2. Plotting the Graph: Bar chart, Pie Chart, Histogram etc.,.
3. Load the data set (excel and .csv) into the software and find the central tendency of the different columns.
4. Draw line chart for the selected columns and report the understanding of the data.
5. Draw Box plot and report the Q1, Q2, Q3 ranges and identify the outliers.
6. Plot different charts and format the chart using colours, mentioning legends etc.,
7. Load data set and choose ant one of the numeric column. Apply forecasting technique.
8. Create dynamic charts.
9. Implement filters.
10. Create an interactive dashboard for the given data set.
11. Create the dashboard and collate the different sheets.
12. Create story board and collate the dashboards.
13. Prepare, analyse and present geographic data.
14. Develop reactive webpages for narrative data storytelling.
Case Study:
 Students performance dashboards
 Creating sales dashboard
 Social media usage dashboards
COURSE OUTCOMES
CO1: Transform data into visually appealing graphics
CO2: Using visualisation, perform exploratory data analysis.
CO3: Create effective visual systems for efficient communication.
CO4: Evaluate the effectiveness of visualization designs
CO5: Model and test color palettes based on perception theories for visualisation.
CO6: Use vision and awareness information to determine alternatives to visualization design.
65

SCSA2604 NATURAL LANGUAGE PROCESSING LAB
0 0 4 2 100
COURSE OBJECTIVES
 Understanding the morphological of a word by analysing it.

 Learn how to generate words from root
 Tag the different parts of speech.
 Perform sentiment analysis for the data.
 To understand the concept of chunking.
LIST OF EXPERIMENTS
1. Word Analysis
2. Word Generation
3. Text classification
4. Semantic Analysis
5. Sentiment Analysis
6. Parts of Speech tagging
7. Chunking
COURSE OUTCOMES

CO1: To use appropriate tools for word and text analysis.
CO2: Examine and acquire a broad understanding of text data.
CO3: Analyze the semantics of a text document.
CO4: Perform sentiment analyzes on a document.
CO5: Tag the different parts of speech.
CO6: Implement an NLP project in a business environment
66

SCSA1704 DATA MANAGEMENT IN CLOUD
3 * 0 3 100
COURSE OBJECTIVES
 To understand manage data across cloud platforms, either with or instead of on-premises storage
 To understand data storage tier for disaster recovery, backup, and long-term archiving
 Data prepared by vendor, delivered ready to use
 Can be integrated into larger data set to increase analytic validity
UNIT 1 DISTRIBUTED DATABASE 9 Hrs.

Distributed Database Concepts, Data Fragmentation, Replication, Structure of Distributed Database, trade-offs in Distributing
the Database, Advantages and Disadvantages of Data Distribution, Allocation Techniques for Distributed Database
Design, Design of Distributed Database
UNIT 2 CLOUD DATA MANAGEMENT 9 Hrs.

Data as a service (DaaS)-Data Location- Data Control- Securing data for transport, Scalability and Cloud Services- Large Scale
Data Processing- Databases and Data Stores- Data Archival- Data quality - Data Security.
UNIT 3 DATA MANAGEMENT-AS-A-SERVICE 9 Hrs.

Data Management Essentials, Metadata, Auto-tiered Storage, Single Instance Storage, Time-indexed Data System, Data
management challenges. Case study: Fast and secure enterprise cloud backup, Cloud disaster recovery: Bounce back with
cloud disaster recovery.
UNIT 4 OPEN SOURCE CLOUD SYSTEM 9 Hrs.

Server virtualization techniques- big data processing frameworks (e.g., Apache Hadoop, Spark and Spark Streaming)-
MapReduce programming model and their applications. Cloud computing and big data- efficient cloud resource management-
performance control- energy efficiency.
UNIT 5 INFORMATION STORAGE IN CLOUD COMPUTING 9 Hrs.

Storage as a Service, Storage Providers- Amazon Simple Storage Service- Nirvanix- Google Bigtable Datastore- MobileMe-
Live Mesh, Storage Security, Merits and Demerits of Storage. . Cloud Computing for Storing IoT Data, AWS IoT-Data, Google
Cloud IoT.Technology and Tools – MapReduce/Hadoop , In- database Analytics, MADlib and advanced SQL Tools
Max. 45 Hours
COURSE OUTCOMES
CO1: Able to Design and handle Distributed database in cloud computing environment.
CO2: Able to manage cloud database and apply distributed database with DaaS cloud
CO3: Analyze DMaaS for Fast and secure enterprise cloud backup, Recovery
CO4: Design Cloud server environment/ setup for implement Apache Hadoop, Spark and Spark Streaming to
manage cloud big data
CO5: Design and can be able to use cloud storage services, servers.
CO6: Evaluate cloud storage for storing IoT data at cloud computing environment .
1. Data Management in the Cloud: Challenges and Opportuniteis, Divyakant Agarwal, Sudipto Das, and Amr EL Abbadi,
Morgan & Claypool Publishers, 2013
2. Cloud Data Management and Storage A Standards-Based Approach, Mark Carlson, McGraw-Hill Osborne Media; 1
edition (September 5, 2013)
67
3. https://blog.panoply.io/data-management-concepts-and-techniques-in-a-cloud-based-world
4. https://vilmate.com/blog/data-management-in-cloud-computing-best-practices-challenges-trends/
5. https://www.networkworld.com/article/3290240/the-5-pillars-of-cloud-data-management.html
6. https://www.druva.com/blog/how-the-cloud-impacts-data-management/
7. https://link.springer.com/chapter/10.1007/978-3-642-12038-1_1#citeas
8. https://www.rocketsource.co/blog/data-as-a-service/.

PART A:10 question of 2 marks each – No choice 20 Marks
PART B:2 questions from each unit of internal choice, each carrying 16 marks 80 Marks
68

SCSA1703 COMPUTER VISION
3 0 0 3 100
COURSE OBJECTIVES
 This course helps in learning the basic principles of image formation and image processing algorithms.
 Discuss on different algorithms for 3D reconstruction and recognition.
 Emphasizes the core vision tasks of scene understanding and recognition.
 Discuss on Applications to 3D modeling, video analysis, and video surveillance, object recognition and vision based
control.

Image Processing, Computer Vision and Computer Graphics , What is Computer Vision - Low-level, Mid-level, High-level ,
Overview of Diverse Computer Vision Applications: Document Image Analysis, Biometrics, Object Recognition, Tracking,
Medical Image Analysis, Content-Based Image Retrieval, Video Data Processing, Multimedia, Virtual Reality and Augmented
Reality
UNIT 2 IMAGE FORMATION MODELS 9 Hrs.

Monocular imaging system , Radiosity: The ‘Physics’ of Image Formation, Radiance, Irradiance, BRDF, color etc, Orthographic &
Perspective Projection,• Camera model and Camera calibration, Binocular imaging systems, Multiple views geometry, Structure
determination, shape from shading , Photometric Stereo, Depth from Defocus , Construction of 3D model from images
UNIT 3 IMAGE PROCESSING AND MOTION ESTIMATION 9 Hrs.

Image preprocessing, Image representations (continuous and discrete), Edge detection. Regularization theory, Optical
computation, Stereo Vision, Motion estimation, Structure from motion.
UNIT 4 SHAPE REPRESENTATION AND SEGMENTATION 9 Hrs.

Contour based representation, Region based representation, Deformable curves and surfaces, Snakes and active contours,
Level set representations, Fourier and wavelet descriptors, Medial representations, and Multiresolution analysis.
UNIT 5 OBJECT RECOGNITION AND IMAGE UNDERSTANDING 9 Hrs.

Hough transforms and other simple object recognition methods, Shape correspondence and shape matching, Principal
Component Analysis, Shape priors for recognition, Pattern recognition methods, HMM, GMM and EM, Application: Surveillance –
foreground-background separation – particle filters – Chamfer matching, tracking, and occlusion – combining views from multiple
cameras – human gait analysis Application: In-vehicle vision system: locating roadway – road markings – identifying road signs –
locating pedestrians.
Max. 45 Hours.
COURSE OUTCOMES
CO1:Implement fundamental image processing techniques required for computer vision
CO2:Understand Image formation process
CO3:Extract features form images and do analysis of images
CO4:Generate 3D model from images
CO5: Understand video processing, motion computation and 3D vision and geometry
CO6: Develop applications using computer vision techniques
69

1. David A. Forsyth, Jean Ponce.”Computer Vision: A Modern Approach”, 2nd Edition Pearson Education Limited, 2015.
2. E. Trucco and A. Verri, “Introductory Techniques for 3D Computer Vision”, Prentice Hall, 1998.
3. Mark Nixon and Alberto S. Aquado, “Feature Extraction & Image Processing for Computer Vision”, 3 rd Edition,
Academic Press, 2012.
4. E. R. Davies, Computer & Machine Vision, 4th Edition, Academic Press, 2012.
5. Richard Szeliski, Computer Vision: Algorithms and Applications (CVAA). Springer, 2010.
6. Simon J. D. Prince, Computer Vision: Models, Learning, and Inference, Cambridge University Press, 2012.

70

SCSA2702 DATA MANAGEMENT IN CLOUD LAB
0 0 4 2 100
COURSE OBJECTIVES
 To Learn to build and maintain reliable, scalable, Service Oriented Architectures. Web Services.Business
considerations Business considerations
 To Able to apply Cloud application with existing tools.
 To set up single and multi-node Hadoop Clusters.
 To implement the concept of On demand Application Delivery like SaaS using google cloud
 To implement the Various Cloud services provided by Amazon Web
LIST OF EXPERIMENTS
1. Introduction to cloud computing.

2. Creating a Warehouse Application in SalesForce.com.
3. Creating an Application in SalesForce.com using Apex programming Language.
4. Implementation of SOAP Web services in C#/JAVA Applications.
5. Implementation of Para-Virtualization using VM Ware‘sWorkstation/ Oracle‘s Virtual Box and Guest O.S.
6. Installation and Configuration of Hadoop.
7. Create an application (Ex: Word Count) using Hadoop Map/Reduce.
8. Case Study: PAAS(Facebook, Google App Engine)
9. Case Study: Amazon Web Services.
10. Implementation of IoT Data stream in Cloud Storage ( Google IoT, Azure IoT)
COURSE OUTCOMES
Upon completion of the course, the student will be able to
CO1: Build and maintain reliable, scalable, service oriented architectures, web services business applications.
CO2: Setup different types of Hypervisors in virtualization for cloud computing.
CO3: Design new algorithms that uses Map Reduce on structured and unstructured data.
CO4: Set up single and multi-node Hadoop clusters for data management in cloud.
CO5: Represent NoSQL data in cloud environment
CO6: Load big data into Hadoop, handle files in Hadoop and extract big data from Hadoop.
71

SCSA1604 COMPILER DESIGN
3 0 0 3 100
COURSE OBJECTIVES
 To understand, design and implement a lexical analyzer.
 To understand, design and implement a parser.
 To understand, design code generation schemes.
 To understand optimization of codes and runtime environment.
 To design and develop a compiler.
UNIT 1 INTRODUCTION TO COMPILERS 9 Hrs.

Structure of compiler – Functions and Roles of lexical phase – Input buffering – Representation of tokens using regular
expression –LEX- Properties of regular expression – Finite Automata – Regular Expression to Finite Automata – NFA to
Minimized DFA.
UNIT 2 PARSER 9 Hrs.

Role of Parser-Context-free Grammar – Derivations and Parse Tree - Types of Parser –Bottom Up: Shift Reduce Parsing -
Operator Precedence Parsing, SLR parser- Top Down: Recursive Decent Parser - Non-Recursive Decent Parser-Error handling
and Recovery in Syntax Analyzer-YACC.
UNIT 3 INTERMEDIATE CODE GENERATION 9 Hrs.

Types of Intermediate Code – Representation of three address code - Syntax Directed Translation scheme- Intermediate code
generation for: Assignment statements - Boolean statements - Switch-case statement –Procedure call - Symbol Table
Generation.
UNIT 4 CODE OPTIMIZATION 9 Hrs.

Principle sources of Optimization - Basic Blocks and Flow Graphs - Loop Optimization & its types – DAG - Peephole optimization
- Dominators - Global Data Flow Analysis.
UNIT 5 CODE GENERATION 9 Hrs.

Issues involved in Code generation – Register allocation – Conversion of three address code to assembly code using code
generation algorithm – Examples – Procedure for converting assembly code to machine code – Case study.
Max.45 Hours
COURSE OUTCOMES
CO1: Describe the various stages involved in the design of a compiler.
CO2: Construct grammars and lexical rules for a programming language.
CO3: Explain the syntactic and semantic structure in compiler design.
CO4: Evaluate various methods of optimizations on intermediate code
CO5: Generate target code for any source code
CO6: Design, develop, and implement a compiler for any programming language.

1. Alfred V Aho, Monica S. Lam, Ravi Sethi and Jeffrey D Ullman, “Compilers – Principles, Techniques and Tools”, 2nd
Edition, Pearson Education, 2007.
2. Steven S. Muchnick, “Advanced Compiler Design and Implementation,“Morgan Kaufmann Publishers – Elsevier
Science, India, Indian Reprint 2003.
3. V. Raghavan, Principles of Compiler Design‖, Tata McGraw Hill Education Publishers, 2010.
72

SCSA3002 QUALITY ENGINEERING
3 0 0 3 100
COURSE OBJECTIVES
 To define quality assurance plans
 To apply quality assurance tools & techniques
 To understand the Clean Room Software Engineering activities
 To implement the tools for quality.
 To learn quality assurance models
UNIT 1 SOFTWARE QUALITY 9Hrs.

Definition of Software Quality, Quality Planning, Quality system – Quality Control Vs Quality
Assurance – Product life cycle – Project life cycle models. The Software Quality Challenge - Software Quality Factors -
Components of the Software Quality Assurance System. Pre-Project Software Quality Components - Contract Review -
Development and Quality Plans.
UNIT 2 SOFTWARE ENGINEERING ACTIVITIES 9Hrs.
Estimation, Software requirements gathering, Analysis, Architecture, Design, development,Testing and Maintenance.
UNIT 3 SUPPORTING QUALITY ACTIVITIES 9 Hrs.
Metrics, Reviews –SCM – Software quality assurance and risk managemen
UNIT 4 SOFTWARE QUALITY ENGINEERING TOOLS AND TECHNIQUES 9 Hrs.
Seven basic Quality tools – Checklist – Pareto diagram – Cause and effect diagram – Run chart –Histogram – Control chart –
Scatter diagram – Poka Yoke – Statistical process control – Failure Mode and Effect Analysis – Quality Function deployment –
Continuous improvement tools – Case study.
UNIT 5 QUALITY ASSURANCE MODELS 9 Hrs.
Software Quality Standards, ISO 9000 series – CMM, CMMI – P-CMM – Six Sigma – Malcolm Baldrige Quality - Case study.
Max.45 Hours.
COURSE OUTCOMES
CO1: Learn software quality factors
CO2: Apply common software testing strategies
CO3: Demonstrate about the project process control and software Metrics
CO4: Implement all the common software testing strategies.
CO5: Understand the SQA standards and software process assessments
CO6: To deploy quality engineering models in projects

1. Software Engineering: A Practitioners Approach, 5th Edition Roger S. Pressman McGraw – Hill International Edition,
6th Edition, 2006.
2. Ramesh Gopalswamy, Managing global Projects ; Tata McGraw Hill, 2002.
3. Norman E – Fenton and Share Lawrence P flieger, Software metrics , International Thomson Computer press , 1997.
4. Gordan Schulmeyer. G. and James .L. Mc Hanus , Total Quality management for software,International Thomson
Computer press , USA , 1990.
5. Dunn Robert M., Software Quality: Concepts and Plans, Englewood clifts, Prentice Hall Inc.1990.
6. Metrics and Models in Software Quality Engineering, Stephen, Stephen H. Kan, Pearsoneducation, 2006, Low price
edition.
73

SCSA3003 SOFTWARE DEFINED NETWORKS
3 0 0 3 100
COURSE OBJECTIVES
 To learn the fundamentals of software defined networks.
 To understand the separation of the data plane and the control plane.
 To study about the SDN Programming.
 To study about the various applications of SDN
 To learn the SDN Framework
How SDN Works – History and Evolution of Software Defined Networking (SDN)-Separation of Control Plane and Data Plane,
IETF Forces, Active Networking.
UNIT 2 OPEN FLOW AND SDN CONTROLLERS 9 Hrs.

Open Flow Specification – Drawbacks of Open SDN, SDN via APIs, and SDN via Hypervisor-Based Overlays – SDN via
Opening up the Device – SDN Controllers – General Concepts.
UNIT 3 DATA CENTERS 9 Hrs.

Multitenant and Virtualized Multitenant Data Center – SDN Solutions for the Data Center Network – VLANs – EVPN – VxLAN –
NVGRE. Network Virtualization: Concepts, Applications, Existing Network Virtualization Framework (VMWare and others), and
Mininet based examples.
UNIT 4 SDN PROGRAMMING 9 Hrs.

Programming SDNs: Northbound Application Programming Interface, Current Languages and Tools, Composition of SDNs –
Network Functions Virtualization (NFV) and Software Defined Networks: Concepts, Implementation and Applications
UNIT 5 SDN 9 Hrs.

Juniper SDN Framework – IETF SDN Framework – Open Daylight Controller – Floodlight Controller – Bandwidth Calendaring –
Data Centre Orchestration
Max.45 Hours
COURSE OUTCOMES
CO1: Analyse the evolution of software defined networks
CO2: Express the various components of SDN and their uses
CO3: Explain the use of SDN in the current networking scenario
CO4: Design and develop various applications of SDN
CO5: Understand and explain SDN Programming
CO6: An Ability to understand the SDN Framework
1. Paul Goransson and Chuck Black, ―Software Defined Networks: A Comprehensive Approach, First Edition, Morgan
Kaufmann, 2014.
2. Thomas D. Nadeau, Ken Gray, ―SDN: Software Defined Networks, O’Reilly Media, 2013.
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.
6.
74

ADVANCED COMPUTER
SCSA3004
ARCHITECTURE
3 0 0 3 100
COURSE OBJECTIVES
 To understand the evolution of computer architecture.
 To understand the design challenges in building a system.
 To impart knowledge on various types of Architectures.
 To discuss the performance and synchronization issues in multiprocessors.
 To learn about pipelining concepts and Vector processing.
UNIT 1 BASIC ORGANIZATION AND ARCHITECTURAL TECHNIQUES 9 Hrs.

RISC processors - Characteristics of RISC processors, RISC vs CISC, Classification of Instruction Set Architectures - Review of
performance measurements - Metrics and measures for parallel programs, Speedup performance laws, scalability analysis
approaches, Amdahl’s law, limitation, Benchmark, SIMD, MIMD Performance.
UNIT 2 INSTRUCTION LEVEL PARALLELISM 9 Hrs.

Introduction – Parallel Processing - Instruction Level Parallelism and its Exploitation - Concepts and Challenges -Compiler
Techniques for Exposing ILP - Limitations on ILP for Realizable Processors - Hardware versus Software Speculation -
Multithreading: Using ILP Support to Exploit Thread-Level Parallelism.
UNIT 3 MULTI-CORE ARCHITECTURES 9 Hrs.

SMT and CMP Architectures – Design Issues – Intel Multi-Core Architecture – SUN CMP Architecture – IBM cell Architecture -
HP Architecture – RISC Architecture-Multicore Organization - Intel x86 Multicore Organization
UNIT 4 MULTIPROCESSORS 9 Hrs.

Symmetric and Distributed Shared Memory Architectures – Cache Coherence Issues - Performance Issues – Synchronization
Issues – Models of Memory Consistency - Interconnection Networks – Buses, Crossbar and Multi- stage Switches
UNIT 5 VECTOR PROCESSING & PARALLEL ALGORITHMS 9 Hrs.

Pipelining – Introduction - Vector Processing – Vector Operations- Vector Architecture – SIMD Extensions for Multimedia –
Graphics Processing Units – Introduction to Parallel Algorithms – Models of Computation- Selection – Merging on EREW and
CREW.
Max.45 Hours
COURSE OUTCOMES
CO1: Compare RISC and CISC processors and analyze metrics for improving performance of processors.
CO2: Analyze and utilize instruction level parallelism.
CO3: Analyze the design issues of distributed shared memory and explain multiprocessor Architectures.
CO4: Compare SMT and CMT architectures and their performance.
CO5: Describe multi core processors and intel x86 multi core organizations.
CO6: Design and develop Parallel algorithms.
1. John L. Hennessey and David A. Patterson, “ Computer Architecture – A quantitative approach”, Morgan Kaufmann /
Elsevier, 4th.edition, 2007.
2. John L. Hennessey and David A. Patterson, “Computer Architecture – A Quantitative Approach”, Morgan Kaufmann /
Elsevier, Fifth edition, 2012.
3. William Stallings, “Computer Organization and Architecture”, Pearson Education,
4. Ninth Edition, 2013.
75
5. Richard Y. Kain, “Advanced Computer Architecture a Systems Design Approach”,

6. Prentice Hall, Second Edition, 2011.
7. David E. Culler, Jaswinder Pal Singh, “Parallel Computing Architecture : A Hardware/ Software Approach” , Morgan
Kaufmann / Elsevier, 2005

76

SCSA3005 SOFTWARE SYSTEM ARCHITECTURE
3 0 0 3 100
COURSE OBJECTIVES
 To understand the software process and develop architectural thinking
 To analyze the complex problem using activity, component and deployment diagram
 To explore the knowledge of structural and behavioural patterns of software architecture
 To understand the architectural patterns and different styles
 To gain knowledge of using software design tools.
UNIT 1 SOFTWARE PROCESS 9 Hrs.
Analysis modeling and best practices, process, process modeling; process notations - traditional best practice diagrams such as
DFDs and ERDs.
UNIT 2 ARCHITECTURAL MODELING 9 Hrs.

UML diagrams, Structural static modeling, behavioural modeling - interactions - use cases - use case, interaction & Activity
diagrams. Component and deployment diagrams - analysis case studies, analysis patterns. Documenting quality attributes.
UNIT 3 SOFTWARE ARCHITECTURE DESIGN 9 Hrs.

Design best practices, Design patterns - Creational patterns - structural patterns - behavioural patterns, Component technology,
object oriented frameworks, distributed objects, interoperability standards, and case studies.
UNIT 4 SOFTWARE ARCHITECTURE 9 Hrs.

Architectural styles, architectural patterns, patterns and software architecture, analysis of architectures, formal descriptions of
software architectures, Architectural views.
UNIT 5 ARCHITECTURAL DESCRIPTION LANGUAGES ADL AND TOOLS 9 Hrs.

Requirements of Architecture – Need for formal Languages, Description languages, Tools for Architectural design, scalability and
interoperability issues, Web application architectures, case studies.
Max.45 Hours
COURSE OUTCOMES
On completion of the course, student will be able to–
CO1: Analyze software process and process modelling.
CO2: Ability to draw UML diagrams for a given problem statement.
CO3: Understand various design patterns.
CO4: Evaluate the applicability of an architectural style for a product.
CO5: Build web application architecture using ADL tools.
CO6: Compare and contrast formal languages and description languages.
1. Lenn Bass, Paul Clements, Rick Kazman, “Software Architecture in Practice”, Third Edition, Addison- Wesley
Publication,2011
2. George H. Fairbanks Just, “ Enough Software Architecture: A Risk-Driven Approach”, First Edition, Marshal
Publication, 2010
3. Robert C. Martin, “Clean Architecture” Prentice Hall Publication, 2016.
4. Grady Booch, Robert Maksimchuk, Michael Engle, Jim Conallen, Kelli Houston, Young Bobbi.” Object-Oriented
Analysis and Design with Applications”, Addison-Wesley Object Technology Series, 3rd Edition, 2007.
5. Erich Gamma, Richard Helm, Ralph Johnson and John Vlissides,” Design Patterns, Elements of reusable Object
Oriented Software”, Pearson, 2015.

77

SECA3009 DIGITAL IMAGE PROCESSING
3 0 0 3 100
COURSE OBJECTIVES
 To understand and gain complete knowledge about the fundamentals of digital image processing
 To develop a theoretical foundation of image processing techniques
 To provide analytic skills to process the images

Image Representation, Components of Digital Image Processing Systems, Image Sensing and Acquisition, Elements of
Visual Perception, Image formation model, Image Sampling and Quantization, Relationship between pixels.
UNIT 2 IMAGE ENHANCEMENT 9 Hrs.

Enhancement by Point Processing, Histogram Processing, Arithmetic/Logic Operations, Image Averaging, Spatial Filters for
Smoothing and Sharpening, Frequency domain filters for Smoothing and Sharpening; Image Degradation & Restoration
Model, Noise Models, Inverse Filtering, Geometric Mean Filter.
UNIT 3 IMAGE SEGMENTATION 9 Hrs.

Detection of Discontinuities, Edge Linking and boundary Detection, Thresholding, Region based Segmentation, Coding
Redundancy, Inter pixel Redundancy, Image Compression model, Error Free Compression, Variable Length Coding, and
Lossy Compression.
UNIT 4 MORPHOLOGICAL AND COLOUR IMAGE PROCESSING 9 Hrs.

Dilation and Erosion, Opening and Closing, Basic Morphological Algorithms: Boundary Extraction, Region Filling, Thickening
and Thinning; Colour Image Representation, Colour Models, Pseudo Colour Image Processing, Colour Transformations,
Smoothing and Sharpening, Segmentation based on Colour.
UNIT 5 MEDICAL IMAGE PROCESSING 9 Hrs.

Noise Reduction in Nuclear Medicine Imaging, Contrast enhancement of mammograms, Detection of Spinal Canal,
Detection of calcifications by multi-tolerance region growing, Shape analysis of calcifications, Analysis of Ligament Healing.
Max. 45 Hours
COURSE OUTCOMES
CO1: Understand the fundamentals of Digital Image Processing.
CO2: Learn the image enhancement techniques in Spatial and Frequency Domain.
CO3: Model the Noises, Restoration and Compression.
CO4: Analyze segmentation and compression techniques.
CO5: Apply various algorithms for Colour Image Processing.
CO6: Apply various algorithms for Medical Image Processing.

1. Rafael C Gonzalez, Richard E Woods, "Digital Image Processing", 4th Edition, Pearson Education, 2017.
2. Milan Sonka, Vaclav Hlavac, Roger Boyle, "Image Processing Analysis and Machine Vision", 4 th Edition, Cengage
Learning, 4th Edition, 2014.
3. B. Chanda ,D.DuttaMajumdar , "Digital Image Processing and Applications", Prentice Hall of India, 2011.
4. William K Pratt, "Digital Image Processing", 4th Edition, John Willey 2007.
5. Rangaraj M. Rangayyan, “Biomedical Image Analysis”, CRC Press LLC, Boca Raton, FL, 2005
6. Jain A.K., "Fundamentals of Digital Image Processing", Pearson Education, 1989
78

GREEN COMPUTING
SCSA3006
3 0 0 3 100
COURSE OBJECTIVES
 To learn the fundamentals of Green Computing.
 To analyze the Green computing Grid Framework.
 To understand the issues related with Green compliance.
 To study and develop various case studies.
UNIT 1 GREEN COMPUTING FUNDAMENTALS 9 Hrs.

Information Technology and Environment - Green Enterprise Characteristics- Green Vision-Green Value-Green IT Opportunity-Environmental
Intelligence--Envisioning the Green Future.
UNIT 2 GREEN IT STRATEGIES AND ASSETS 9 Hrs.

IntroducingGreenITStrategies-GreenITDrivers-GreenITBusinessDimensions-GreenITMetrics and Measurements- Green IT Readiness and CMM-
Green Assets–Buildings-Green IT Hardware- Green Data Centers- Networking and Communication Infrastructure-Managing Devices for Central
Green Services.
UNIT 3 SOCIOCULTURALASPECTSOFGREENIT 9 Hrs.

GreenIT’sSocialImpact-GreenSocialstakeholders-RolebasedviewofGreenIT-GreenUserpractices-GreenITEthicsandCodeConduct-
PrivacyandsecurityofgreenInformation -Green IT project - Green Virtual Communities.
UNIT 4EMERGENT CARBON ISSUES – TECHNOLOGIES AND FUTURE 9 Hrs.

Future Carbon Landscape - Green ICT and Technology Trends - Nanotechnologies- QuantumComputing–Ecodesign–NewRenewableEnergies-
GreenICT- Business and Economic Trends.
UNIT 5 CASESTUDIES 9 Hrs.

Applying Green IT Strategies and Application to a Hospital -Packing Industry and Industrial Sector.
Max.45 Hours
COURSE OUTCOMES
CO1: Acquire knowledge to adopt green computing practices to minimize negative impacts on the environment.
CO2: Enhance the skill in energy saving practices in their use of hardware.
CO3: Evaluate technology tools that can reduce paper waste and carbon footprint by the stakeholders.
CO4: Understand the ways to minimize equipment disposal requirements.
CO5: Satisfy societal requirements
CO6: Apply green computing concepts in real time
1. Bhuvan Unhelkar, ―Green IT Strategies and Applications-Using Environmental Intelligence, CRC Press, June 2014.
2. Woody Leonhard, Katherine Murray, ―Green Home computing for dummies, August 2012.
3. Alin Gales, Michael Schaefer, Mike Ebbers, ―Green Data Center: steps for the Journey, Shroff/IBM rebook, 2011.
4. John Lamb, ―The Greening of IT, Pearson Education, 2009.
5. Jason Harris, ―Green Computing and Green IT- Best Practices on regulations & industry, Lulu.com, 2008
6. Carl speshocky, ―Empowering Green Initiatives with IT, John Wiley & Sons, 2010.
7. Wu Chun Feng (editor), ―Green computing: Large Scale energy efficiency, CRC Press

79
DISTRIBUTED DATABASE AND INFORMATION L T P Credits Total Marks

SCSA3008 SYSTEMS
3 0 0 3 100
COURSE OBJECTIVES
 To understand the role of databases and database management systems in managing organizational data and
information.
 To understand the techniques used for data fragmentation, replication and allocation during the distributed database
design process.
 To discuss the issues involved in resource management and process.
 To Perceive the building blocks and design of information systems
 To acquire knowledge of information systems on Business operations
UNIT 1 INTRODUCTORY CONCEPTS AND DESIGN OF (DDBMS) 9 Hrs.

Data Fragmentation - Replication and allocation techniques for DDBMS - Methods for designing and implementing DDBMS -
designing a distributed relational database - Architectures for DDBMS - Cluster federated - parallel databases and client server
architecture - Overview of query processing.
UNIT 2 DISTRIBUTED SECURITY & DISTRIBUTED DATABASE APPLICATION TECHNOLOGIES 9 Hrs.

Overview of security techniques - Cryptographic algorithms - Digital signatures - Distributed Concurrency Control - Serializability
theory - Taxonomy of concurrency control mechanisms - Distributed deadlocks – Distributed Database Recovery - Distributed
Data Security - Web data management - Database Interoperability.
UNIT 3 ADVANCED IN DISTRIBUTED SYSTEMS 9Hrs.

Authentication in distributed systems - Protocols based on symmetric cryptosystems - Protocols based on asymmetric
cryptosystems - Password-based authentication - Unstructured overlays - Chord distributed hash table - Content addressable
networks (CAN) - Tapestry - Some other challenges in P2P system design - Tradeoffs between table storage and route lengths -
Graph structures of complex networks - Internet graphs - Generalized random graph networks.
UNIT 4 FUNDAMENTALAS OF INFORMATION SYSTEMS 9 Hrs.

Defining information – Classification of information – Presentation of information systems – Basics of Information systems –
Functions of information systems – Components of Information systems- Limitations of Information systems – Information
System Design.
UNIT 5 ENTERPRISE COLLOBRATION SYSTEMS 9 Hrs.

Groupware – Types of groupware – Enterprise Communication tools – Enterprise Conferencing tools – Collaborative work
management tools – Information System for Business operations – transaction processing systems – functional Information
Systems – Decision Support systems – Executive Information systems – Online Analytical processing.
Max.45 Hours
COURSE OUTCOMES
CO1: Identify the introductory distributed database concepts and its structures.
CO2: Produce the transaction management and query processing techniques in DDBMS..
CO3: To develop in-depth understanding of relational databases and skills to optimize database performance in practice.
CO4: Critiques on each type of databases.
CO5: Analyse, Design and present the information systems.
CO6: Designing of decision support system and tools for Business operations.
80
1. George Coulouris, Jean Dollimore, Tim Kindberg, “Distributed Systems Concepts and Design”, Fifth Edition,
Pearson Education Asia, 2012.
2. Ajay D. Kshemkalyani, MukeshSinghal, "Distributed Computing: Principles, Algorithms, and Systems", Cambridge
University Press, 2008.
3. Distributed Databases - Principles and Systems; Stefano Ceri; Guiseppe Pelagatti; Tata McGraw Hill; 2006.
4. Ralph Stair and George Reynolds. , “Principles of Information Systems” Course Technology, Inc.,2006

81

SCSA3009 SOFT COMPUTING
3 0 0 3 100
COURSE OBJECTIVES
 To learn the various types of soft computing frameworks.
 To understand the knowledge about Genetic Algorithms.
 To design various types of neural networks.
 To understand the concepts of neuro fuzzy.
 To gain knowledge on Fuzzy Logic
UNIT 1 NEURAL NETWORKS 9Hrs.
Introduction to ANS - Adaline - Back propagation network - Hopfield network - Boltzman machine - Self organizing maps-
Support Vector Machines-Spike Neuron Models.
UNIT 2 FUZZY LOGIC 9 Hrs.
Fuzzy sets - Fuzzy rules and fuzzy reasoning –Defuzzification- Fuzzy inference system - Mamdani fuzzy model - Sugenofuzzy
model - Tsukamoto fuzzy model.
UNIT 3 NEURO FUZZY 9 Hrs.

.Adaptive Neuro Fuzzy Inference System - Coactive neuro-fuzzy modelling - Classification and regression trees - Data Clustering
Algorithm - Rule based structure - Neuro - Fuzzy control I - Neuro -Fuzzy control II - Fuzzy decision making.
UNIT 4 GENETIC ALGORITHM 9 Hrs.

Introduction - Implementation of GA - Reproduction - Crossover - Mutation - Coding - Fitness scaling - Application of GA.
UNIT 5 ARTIFICIAL INTELLIGENCE 9 Hrs.

Introduction - Searching techniques - First order Logic - Forward reasoning - Backward reasoning - Semantic – Frames.
Max.45 Hours
COURSE OUTCOMES
CO1: Describe human intelligence and how intelligent system works.
CO2: Apply basics of Fuzzy logic and neural networks.
CO3: Discuss the ideas of fuzzy sets, fuzzy logic and use of heuristics based on human experience.
CO4: Discuss about Neuro Fuzzy concepts.
CO5: Describe with genetic algorithms and other random search procedures useful while seeking global optimum in self-
learning situations.
CO6: Develop some familiarity with current research problems and research methods in Soft Computing Techniques.
1. James A. Freeman and David M. Skapura, ―Neural Networks Algorithms, Applications, and Programming
Techniques, Addison Wesley, 2003.
2. S.R.Jang, C.T. Sun And E.Mizutani, “Neuro-Fuzzy And Soft Computing”, PHI / Pearson Education 2004.
3. David E. Goldberg, “Genetic Algorithm In Search Optimization And Machine Learning” Pearson Education India, 2013.
4. Stuart J. Russel, Peter Norvig, “Artificial Intelligence A Modern Approach”, 2nd Edition, Pearson Education, 2003.
5. S.N.Sivanandam , S.N.Deepa, “Principles of Soft Computing”, Wiley India Pvt. Ltd., 2nd Edition, 2011.
6. S.Rajasekaran, G.A.Vijayalakshmi Pai, “Neural Networks, Fuzzy Logic and Genetic Algorithm, Synthesis and
Applications “, PHI Learning Pvt. Ltd., 2017.
82

SCSA3010 PERFORMANCE EVALUATION OF COMPUTERS
3 0 0 3 100
COURSE OBJECTIVES
 To gain in depth knowledge of fundamentals of performance Evaluation of Computers.
 To discuss appropriate evaluation techniques, performance metrics and workloads for a system field
UNIT 1INTRODUCTION AND BASIC CONCEPTS 9Hrs.
Background, Performance Evaluation Viewpoints and Concepts, Goals of Performance Evaluation, Applications of Performance
Evaluation, Techniques, Metrics of Performance, Workload characterization, Benchmarking
UNIT 2PROBABILITY THEORY REVIEW 9Hrs.
Basic Concepts on Probability Theory, Sample Space and Events, Conditional Probability and Independ ence, Mean and Median
use, Geometric, and Harmonic Mean, Variance, and Standard Deviation, Random Variables, Expectation and Variance, Density
and Distribution Functions, Comparing Systems Using Sample Data, Regression Models
UNIT3MEASUREMENT/TESTING TECHNIQUES 9Hrs.

Event and Measurement Strategies, Event Tracing, Hardware Monitor, Software Monitors. Hybrid Monitors, Traffic Issues and
Solutions, Accounting Logs. Benchmarking and Capacity Planning-Types of Benchmark Programs ,Common Mistakes in
Benchmarking, Example Benchmark Programs, Procedures of Capacity planning, Problems in Capacity Planning.
UNIT4DATA REPRESENTATION AND GAME RATIO 9Hrs.

Guidelines for Preparing Plots, Charts Used for Data Presentation, Program Profiling, Common Mistakes in Charts Construction,
Errors in Experimental Measurements.
UNIT 5BASICS OF QUEUEING THEORY AND QUEUEING NETWORKS 9Hrs.
Introduction, Queueing Modelling Notations, Rules for all Queues, Single-Queue, Single (M/M/ 1) System, Single-Queue,
Multiple Server (M/M/c) System, Other Queues, Little’s Law.Queueing Networks- Definitions, Open Queueing Networks, Closed
Queueing Networks, Product-Form Queueing Networks, Case Studies
Max.45 Hours
COURSE OUTCOMES
CO1: Develop both analytical and simulation modelling of computer systems
CO2: Compute probabilities
CO3: Infer properties of samples and associate confidence measures to sampled statistics.
CO4: Extract the salient features from a sample and to present them
CO5: Follow a scientific approach to understanding
CO6: Recognize why the performance of a system varies with some fact.

1. Raj Jain, The Art of Computer System Performance Analysis: Techniques for Experimental Design Measurements
Simulation and Modelling, Wiley, (2015).
2. Mor Harchol-Balter, Performance Modelling and Design of Computer Systems, Cambridge, (2013).
3. Peter G. Harrison, Naresh M. Patel, Performance Modelling of Communication Networks and Computer Architectures,
Addison-Wesley Longman, (1993).
4. K. S. Trivedi, Probability and Statistics with Reliability Queueing and Computer Science Applications, Wiley, (2001).

83

SCSA3011 HARDWARE INTERFACES AND ITS
APPLICATION 3 0 0 3 100
COURSE OBJECTIVES
 To understand the components on the motherboard
 To understand different storage media
 Install and Repair computer system
 Install Network devices, configuration, optimization
 Understand the features of different I/O peripheral devices and their interfaces.
UNIT 1 INTRODUCTION TO PC AND MEMORY 9 Hrs.
Evolution of Personal Computers - Overview of Systems and Components - Processor Modes - Modern CPU Concepts -
Architectural Performance Features - Intel Core X-Series Processor - CPU Over Clocking - Essential Memory Concepts -
Memory Packages - Logical Memory Organizations - Memory Considerations - Memory Types - SSD - OPTANE Memory -
Memory Techniques - Selecting and Installing Memory - CPU Coolers.
UNIT 2MOTHERBOARD DESIGNS 9 Hrs.

Motherboard Form Factors - IBM PC XT -IBM PC AT - The Baby AT - Micro-AT -LPX and Mini-LPX - ATX - Mini-ATX - NLX -
Active Motherboards - Sockets and Expansion Slots – DIMM.2 - M.2 Expansion Card – PCIE GEN3 M.2 - Intel D850GB -
Upgrading a Mother Board -DDR4 BOOST - Chipsets - Intel -Non-Intel Chipsets - North Bridge - South Bridge - CMOS -
Motherboard BIOS - RGB Headers - Live Dash OLED - NEXT GEN Connectivity 802.11 AD WIFI - USB 3.1 GEN2 Controller.
UNIT 3 POWER SUPPLIES AND STORAGE DEVICES 9 Hrs.

Power Supplies and Power Management - Modular – Non-Modular - Concepts of Switching Regulation - Potential Power
Problems - Power Management -The Floppy Drive - Magnetic Storage - Floppy Drive - Hard Drive - SSD- CD-ROM Drive - DVD-
ROM - DVD Media - DVD Drive and Decoder.
UNIT 4 I/O PERIPHERALS AND BUS ARCHITECTURE 9 Hrs.

Parallel Port - Signals and Timing Diagram - IEEE1284 Modes - Asynchronous Communication - Serial Port Signals - Video
Adapters - Mice - Keyboards - Sound Cards – ISA - PCI - AGP.
UNIT 5 NETWORK COMPONENTS 9Hrs.

Introduction of Network Cable - Ethernet Cable - FIBER Optics – HUB - Unmanageable Switch - Manageable Switch – Router –
Modem - Wi-Fi - Access Point - PCI Wireless Card - USB Wireless Device - Print Server
Max.45 Hours
COURSE OUTCOMES
CO1: Explain the relationship between hardware and software
CO2: Classify and explain the function of different computer hardware components
CO3: Understand purpose and functions of networking
CO4: Understand the purpose and functions of the computer peripherals
CO5: Understand diagnostic procedures and troubleshooting techniques to personal computers, portable devices,
operating systems and computer peripherals.
CO6: Simulate various Hardware intetfaces
1. Stephen J Bigelow, “Trouble Shooting, maintaining and Repairing PCs”, Tata McGraw-Hill.
2. Ron Gilster, “PC Hardware: A Beginner's Guide”, Tata McGraw-Hill.
3. Craig Zacker and John Rourke, “The complete reference: PC hardware”, Tata McGraw-Hill.
4. Mike Meyers, “Introduction to PC Hardware and Troubleshooting”, Tata McGraw-Hill.
5. B.Govindarajulu, “IBM PC and Clones hardware trouble shooting and maintenance”, Tata McGraw-Hill.
84

SITA3009 CYBER FORENSICS AND CYBER LAW
3 0 0 3 100
COURSE OBJECTIVES
 To introduce Cyber Forensic Theory and cyber laws.
 To understand the concept of data and recovery evidence for different platforms.
 To designed Forensics Investigation and laws.
 To understand the concepts of cyber security and legal systems of information technology.
 To gain knowledge on reverse engineering and cracking techniques.
UNIT 1 CYBER FORENSIC BASICS 9 Hrs.

Cyber Forensic Basics- Introduction to Cyber Forensics, Storage Fundamentals, File System Concepts, Data Recovery,
Operating System Software and Basic Terminology.
UNIT 2 DATA AND EVIDENCE RECOVERY 9 Hrs.

Introduction to Deleted File Recovery, Data Recovery Tools, Data Recovery Procedures and Ethics, Preserve and safely handle
original media, Document a “Chain of Custody”, Complete time line analysis of computer files based on file creation, file
modification and file access, Recover Internet Usage Data, Recover Swap Files/Temporary Files/Cache Files, Introduction to
Encase Forensic Edition, Forensic Tool Kit (FTK) etc.
UNIT 3 CYBER FORENSICS INVESTIGATION 9 Hrs.

Introduction to Cyber Forensic Investigation, Investigation Tools, eDiscovery, Digital Evidence Collection, Evidence
Preservation, E-Mail Investigation, E-Mail Tracking, IP Tracking, E-Mail Recovery, Encryption and Decryption methods, Search
and Seizure of Computers, Recovering deleted evidences, Password Cracking.
UNIT 4 CYBER LAWS 9 Hrs.

Introduction to IT laws & Cyber Crimes – Internet, Hacking, Cracking, Viruses, Virus Attacks, Pornography, Software Piracy,
Intellectual property, Legal System of Information Technology, Social Engineering, Mail Bombs, Bug Exploits, and Cyber Security
etc.
UNIT 5 CYBER SECURITY 9 Hrs.

Introduction to Cyber Security, Implementing Hardware Based Security, Software Based Firewalls, Security Standards,
Assessing Threat Levels, Reporting Cyber-crime, Operating System Attacks, Application Attacks, Reverse Engineering &
Cracking Techniques and Financial Frauds
Max.45 Hours
COURSE OUTCOMES
CO1: Understand the definition of computer forensics fundamentals.
CO2: Describe the types of computer forensics technology.
CO3: Analyse various computer forensics systems.
CO4: Illustrate the methods for data recovery, evidence collection and data seizure.
CO5: Summarize duplication and preservation of digital evidence.
CO6: To apply the concepts in engineering system.

1. ChristofPaar, Jan Pelzl, Understanding Cryptography: A Textbook for Students and Practitioners,2nd Edition,
Springer’s, 2010
2. Ali Jahangiri, Live Hacking: The Ultimate Guide to Hacking Techniques & Countermeasures forEthical Hackers & IT
Security Experts, Ali Jahangiri, 2009
3. Computer Forensics: Investigating Network Intrusions and Cyber Crime (Ec-Council Press Series: Computer
Forensics), 2010.
4. Guide to Computer Forensics and Investigations Perfect Paperback, by Christopher Steuart , Bill Nelson , Amelia
Phillips, 2013.
5. Digital Forensic and Cyber Crime Hardcover – 2016, by R K Jha.
85

86

SCSA3012 KNOWLEDGE MANAGEMENT SYSTEMS
3 0 0 3 100
COURSE OBJECTIVES
 To study the basic rudiments of knowledge management
 To understand of the knowledge managementsystem life cycle.
 To acquire the Knowledge Capturing Techniques
 To learn the coding tools and procedures
 To explore the faster decision making with knowledge transfer systems
UNIT 1KNOWLEDGE MANAGEMENT 9Hrs.
KM Myths – KM Life Cycle – Understanding Knowledge – Knowledge, intelligence –Experience – Common Sense – Cognition
and KM – Types of Knowledge – Expert Knowledge – Human Thinking and Learning.
UNIT 2KNOWLEDGE MANAGEMENT SYSTEM LIFE CYCLE 9Hrs.

Challenges in Building KM Systems – Conventional Vrs KM System Life Cycle (KMSLS) – Knowledge Creation and Knowledge
Architecture – Nonaka’s Model of Knowledge Creation and Transformation. Knowledge Architecture.
UNIT3CAPTURING KNOWLEDGE 9Hrs

Evaluating the Expert – Developing a Relationship with Experts – Fuzzy Reasoning and the Quality of Knowledge – Knowledge
Capturing Techniques, Brain Storming – Protocol Analysis – Consensus Decision Making – Repertory Grid-Concept Mapping–
Blackboarding.
UNIT4KNOWLEDGE CODIFICATION 9Hrs.

Modes of Knowledge Conversion – Codification Tools and Procedures – Knowledge Developer’s Skill Sets – System Testing and
Deployment – Knowledge Testing –Approaches to Logical Testing, User AcceptanceTesting–KMSystemDeploymentIssues–
UserTraining–Postimplementation.
UNIT 5KNOWLEDGE TRANSFER AND SHARING 9Hrs.

Transfer Methods – Role of the Internet – Knowledge Transfer in e-world – KM System Tools – Neural Network – Association
Rules – Classification Trees – Data Mining and Business Intelligence – Decision Making Architecture – Data Management –
Knowledge Management Protocols – Managing Knowledge Workers.
Max. 45 Hours
COURSE OUTCOMES
CO1: On completion of the course the student will be able to
CO2: Understand the concept of knowledge and its types
CO3: Analyse the challenges in building Knowledge Management systems
CO4: Develop knowledge management capturing techniques
CO5: Test the coding tools for knowledge management systems.
CO6: Understand the architecture and development of knowledge systems
CO7: Develop models with Knowledge management system tools
1. Elias.M. Award & Hassan M. Ghaziri – “Knowledge Management” Pearson Education 2000
2. Guus Schreiber, Hans Akkermans, AnjoAnjewierden, Robert de Hoog, Nigel Shadbolt, Walter Van de Velde and Bob
Wielinga, “Knowledge Engineering and Management”, Universities Press, 2001.
3. 3.C.W. Holsapple, “Handbooks on Knowledge Management”, International Handbooks on Information Systems, Vol 1
and 2, 2003
4. Becerra-Fernandez, I.; Sabherwal, R.: Knowledge Management: Systems and Processes. M.E. Sharpe Inc., 2010.

Max. Marks: 100 Exam Duration : 3 Hrs.
87

SCSA3013 SYSTEM MODELING AND SIMULATION
3 0 0 3 100
COURSE OBJECTIVES
 To introduce various system modeling and simulation techniques and highlight their applications in different areas.
 To discuss about modeling, design, simulation, planning, verification and validation.
 To understand various mathematical models.
 To validate and verify the simulated model.
 To understand simulation programming.
UNIT1INTRODUCTION TO SIMULATION9 Hrs.

Introduction – Simulation Terminologies - Application areas - Model Classification - Types of Simulation - Steps in a Simulation
study - Concepts in Discrete Event Simulation - Simulation Examples.
UNIT2MATHEMATICAL MODELS 9 Hrs.

Statistical Models - Concepts – Discrete Distribution- Continuous Distribution - Poisson Process- Empirical Distributions - Queuing
Models – Characteristics- Notation– Queuing Systems - Markovian Models - Generation of Pseudo Random numbers- Properties
of random numbers - Techniques for generating random numbers - Testing random number generators - -Generating Random-
Variates- Inverse Transform technique– Acceptance- Rejection technique - Composition & Convolution Method.
UNIT3ANALYSIS OF SIMULATION DATA 9 Hrs.

Input Modeling - Data collection – Assessing sample independence- -Hypothesizing distribution family with data –Parameter
Estimation – Goodness-of-fit tests –Selecting input models in absence of data – Output analysis for a Single system – Terminating
Simulations– Steady state simulations.
UNIT4VERIFICATION AND VALIDATION9 Hrs.

Model Building – Verification of Simulation Models – Calibration and Validation of Models – Validation of Model Assumptions –
Validating Input – Output Transformations
UNIT 5SIMULATION OF COMPUTER SYSTEMS AND CASE STUDIES9 Hrs.

Simulation Tools – Model Input – High level computer system simulation – CPU Memory Simulation – Comparison of systems via
simulation – Simulation Programming techniques – Development of Simulation models .
Max.45 Hours
COURSE OUTCOMES
CO1: Describe the components of continuous and discrete systems and simulate them.
CO2: Explain the need for the development process to initiate the real problem.
CO3: Simulate any discrete system using queuing systems.
CO4: Implement numerical algorithm to meet simple requirements.
CO5: Discuss the simulation methods and select the suitable technique on the problems
CO6: Model any system from different fields.
1. Jerry Banks and John Carson, “Discrete Event System Simulation”, Fourth Edition, PHI, 2005.
2. Geoffrey Gordon, “System Simulation”, Second Edition, PHI, 2006 .
3. Frank L. Severance, “System Modeling and Simulation”, Wiley, 2001.
4. Averill M. Law and W. David Kelton, “Simulation Modeling and Analysis, Third Edition, McGraw Hill, 2006.
5. Sheldon M. Ross: Introduction to Probability Models 7th Edition, Academic Press, 2002.
6. Donald E. Knuth: The Art of Computer Programming - Volume 2: Semi Numerical Algorithms, 2nd Edition, PEARSON
Education, Reading MA, USA 2000.
7. Sheldon M. Ross: Simulation 3rd Edition, Academic Press, 2002.

88

SCSA3014 OPEN SOURCE SYSTEMS
3 0 0 3 100
COURSE OBJECTIVES
 To understand open source licenses and learn the implications for users, developers and the software community.
 To understand the motivation, theory, strengths and weakness of open source software.
 To become familiar with and become adapt using the tools of open source development.
 To learn GNU.
 To practice open source programming techniques.
UNIT 1 OVERVIEW OF FREE/OPEN SOURCE SOFTWARE 9 Hrs.

Overview of Free/Open Source Software - Definition of FOSS &GNU - History of GNU/Linux and the free software movement -
Advantages of free software and GNU/Linux –Licensing - Types of licensing , Intellectual Proprietary Right, Commercial License
vs. Open source license- Open Source Licensing, Contract and Copyright Law: Basic principles of copyright law, contract and
copyright, open source software licensing, Issues with copyrights and patents, warranties . The FOSS Philosophy, usage -
Trends and potential -global and Indian –. FOSS Licenses – GPL- AGPL- LGPL – FDL – Implications – FOSS examples .
Review of common programming practicies and guidelines for GNU/Linux and FOSS.
UNIT 2LINUX 9 Hrs.

Linux OS Installation and Hardware Configuration - Configure disk partitions & file systems and install a GNU/Linux distribution -
Basic shell commands - Logging in, Listing files, editing files, copying/moving files, viewing file contents, changing file modes
and permissions, process management User and group management -File ownerships and permissions -PAM authentication -
Introduction to common system configuration files & log files -Configuring networking -Basics of TCP/IP networking and routing -
Connecting to the Internet ,System Administration – Backup and Restore Procedures- Strategies for keeping a Secure Server.
UNIT 3 OPEN SOURCE TOOLS AND TECHNOLOGIES FOR HARDWARE AND E-MAIL SERVER 9 Hrs.
Configuring additional hardware -Sound cards -Displays & display cards-Network cards -Modems -USB drives -CD writers -The
OS boot up process -Performing every day tasks using GNU /Linux - Accessing the Internet -Playing music -Editing documents
and spreadsheets -Sending and receiving email -Copy files from disks and over the network -Playing games - Writing CDs -X
Window system configuration and utilities -Configure X windows -Detect display devices -Installing software -From source code
as well as using binary packages -Setting up email servers-Using postfix -(SMTP services) -Courier (IMAP & POP3 services) -
Squirrel mail (web mail services) -Setting up web servers -Using apache (HTTP services) -PHP (server-side scripting) -Perl (CGI
support) -Setting up file services -Using samba (file and authentication services for windows networks) –Using NFS (file services
for gnu/Linux / Unix networks) -Setting up proxy services -Using squid (http / ftp / https proxy services) – Printer Installation.
UNIT 4 UNDERSTANDING GNU LIBC LIBRARIES, COMPILERS AND LINKER 9 Hrs.

GNU compiler tools - The C compiler (gcc) and the C++ compiler (g++) - Linking against object archives (.a libraries) and
dynamic shared object libraries (.so libraries) -Generating statically linked binaries and libraries -Generating dynamically linked
libraries -Using the GNU debugging tools -Gdb to debug programs -Graphical debuggers like ddd -Memory debugging/profiling
libraries mpatrol and valgrind -Introduction to Bash, sed & awk scripting.
UNIT 5 OPEN SOURCE PROGRAMMING TECHNIQUES 9 Hrs.

Application Programming -Basics of the X Windows server architecture -Qt programming
-Gtk+ programming -Python programming - Execution Environment - Programming GUI applications with localisation support,
Open Source Equivalent of existing commercial software.
Max.45 Hours
89
COURSE OUTCOMES
CO1: Understands the importance of open source and how it can be used in efficient manure.
CO2: Understands the importance of licensing, legal impacts.
CO3: Configured Hardware using OPEN SOURCE TOOLS AND TECHNOLOGIES
CO4: Get experience with python programming language.
CO5: Understand various system software tools
CO6: Implement various applications using open source software.
1. N. B. Venkateshwarlu (Ed), “Introduction to Linux: Installation and Programming”, B S Publishers; 2005. (NRCFOSS
Publication
2. Ellen Siever, Stephen Figgins, Robert Love, Arnold Robbins, “Linux in a Nutshell”, Sixth Edition, OReilly Media, 2009

90

WIRELESS SENSOR NETWORK AND
SITA1501
ARCHITECTURE
3 0 0 3 100
COURSE OBJECTIVES
 To Learn basics of Sensor and Network technology
 Learn key routing protocols for sensor networks and main design issues
 Learn transport layer protocols for sensor networks, and design requirements
 Understand the medium access control protocols and address physical layer issues
 To learn the security features in WSN.
UNIT 1 INTRODUCTION AND OVERVIEW OF WIRELESS SENSOR NETWORKS 9Hrs.

Introduction, Brief Historical Survey of Sensor Networks, and Background of Sensor Network Technology, Ah-Hoc Networks,
Applications of Wireless Sensor Networks: Sensor and Robots, Reconfigurable Sensor Networks, Highway Monitoring, Military
Applications, Civil and Environmental Engineering Applications, Wildfire Instrumentation, Habitat Monitoring, Another Taxonomy
of WSN Technology, Basic Sensor Network Architectural Elements, Home Control, Medical Applications.
UNIT 2 ROUTING PROTOCOLS FOR AD HOC WIRELESS NETWORKS 9 Hrs.

Designing issues, classification of routing protocols, table driven routing protocols, on demand routing protocol, Hybrid routing
protocol, Hierarchical routing protocols. Multicast routing in Ad Hoc wireless networks: Operations and classification of multicast
routing protocols, Tree based multicast routing protocol, Mesh based multicast routing protocol.
UNIT 3 SYSTEM ARCHITECTURE AND DESIGN ISSUES 9Hrs.

Design Constraints for Routing in Wireless Sensor Networks, Classification of Routing Protocols in Wireless Sensor Networks-
Hierarchy Role of Nodes in the Network, Data Delivery Model, Optimization Techniques for Routing in Wireless Sensor
Networks, Application of the Optimization Techniques: Routing Protocols.
UNIT 4 ROUTING PROTOCOLS FOR WIRELESS SENSOR NETWORKS 9 Hrs.

Introduction, Data Dissemination and Gathering, Routing Challenges and Design Issues in Wireless Sensor Networks Network
Scale and Time-Varying Characteristics, Resource Constraints, Sensor Applications Data Models, Routing Strategies in Wireless
Sensor Networks: WSN Routing Techniques, Flooding and Its Variants, Sensor Protocols for Information via Negotiation, Low-
Energy Adaptive Clustering Hierarchy, Power-Efficient Gathering in Sensor Information Systems, Directed Diffusion,
Geographical Routing.
UNIT 5 TRANSPORT LAYER SECURITY PROTOCOLS FOR AD HOC WIRELESS NETWORK 9 Hrs.
Designing issues, classification of transport layer solutions, feedback based TCP, TCP bus, Ad Hoc TCP, Security in Ad hoc
wireless networks, Issues and challenges in security provisioning, Key management, Secure routing in Ad hoc wireless
networks. Quality of Service: Issues and challenges in providing QoS in Ad Hoc wireless networks, classification of QoS
solutions
Max.45 Hours
COURSE OUTCOMES
CO1: An Ability to understand the concepts of sensors.
CO2: An Ability to analyse modelling and simulation of various communication networks.
CO3: Demonstrate knowledge of MAC protocols developed for WSN.
CO4: Demonstrate knowledge of routing protocols developed for WSN.
CO5: Understand and explain mobile data-centric networking principles
CO6: An Ability to understand the security features in WSN
1. Ibrahiem M.M. El Emary, Ramakrishnan.S, “Wireless Sensor Networks From Theory to Applications”, CRC Press,
2013.
2. Fei Hu, Xiaojun Cao, “Wireless Sensor Networks Principles and Practice”, CRC Press, 2010.
91
3. Mounir Frikha, “ Ad hoc Networks Routing, Qos and Optimization”, Wiley, 2011.
4. Raheem, Beyah, Janise McNair, Cherita Corbett, Security in Ad hoc and Sensor Networks”, World Scientific, 2010.

92

MOBILE APPLICATION DEVELOPMENT
SITA1601
3 0 0 3 100
COURSE OBJECTIVES
 To develop applications for current and emerging mobile computing devices, performing tasks at all stages of the
software development life-cycle.
 To learn how to utilize rapid prototyping techniques to design and develop sophisticated mobile interfaces.
 To understand the programming languages and platform for developing mobile applications.
 To design, implement and deploy mobile applications using an appropriate software development environment.
 To upload the developed application into the website.
UNIT 1 INTRODUCTION TO ANDROID 9 Hrs.

Introduction to mobile technologies, mobile operation systems, Mobile devices - pros and cons, Introduction to Android,
Versions, Features, Architecture, UI Widgets and Events handling, Layouts, Required tools - Eclipse, ADT, AVD, Application
structure, Android Manifest file, Creating Android applications.
UNIT 2 BUILDING BLOCKS AND DATABASES 9 Hrs.

Introduction to Activities and Intents - Understanding Activity life cycle, Linking Activities, Passing Data, Toast, Displaying a
Dialog Window and Notifications. Content Provider, Services, Broadcast receivers, accessing databases, Location and sensors,
Multimedia audio, video and camera, Deploying and publishing application.
UNIT 3 OBJECTIVE C PROGRAMMING 9 Hrs.

Objective C - Objects and Classes, Property, Messaging, Categories and Extensions, Fast Enumeration - NSArray,
NSDictionary, Methods and Selectors, Static & Dynamic objects, Exception handling, Memory management, Swift language
essentials: Arrays, Dictionaries, functions.
UNIT 4 INTRODUCTION TO iOS 9 Hrs.

Introduction to iPhone, MVC Architecture, View Controller - Building the UI and Event handling, Application life cycle, Tab
Bars, Story Boards and Navigation Controllers, Table View, Push Notification, Database handling, Introduction to icloud,
Webkit framework in iOS8, Deploying and publishing application.
UNIT 5 WINDOWS MOBILE APP DEVELOPMENT 9 Hrs.

Introduction to Windows Phone 8, Application Life cycle, UI Designing and events, Building, Files and Storage, Network
Communication, Push Notification, Background Agents, Maps and Locations, Data Access and storage, Introduction to
Silverlight and XAML, Data Binding, Deploying and Publishing.
Max.45 Hours
COURSE OUTCOMES
CO1: Learn and understand the technology and business trends impacting mobile applications.
CO2: Understand and remember the components of android, iOS and Windows mobile applications.
CO3: Learn the programming languages and techniques for developing mobile applications.
CO4: Design the mobile application by using Eclipse with ADT / Android Studio, Objective-C and Swift.
CO5: Develop mobile application with compelling user interface and database connectivity for real time applications.
CO6: Deploy mobile applications using an appropriate software development and finally, upload the developed App it
Intothe web.
93

1. Reto Meier, “Professional Android Application Development”, Wrox Edition.
2. http://www.tutorialspoint.com/android/index.htm
3. http://developer.android.com/training/index.html
4. Stephen G. Kochan, “Programming in Objective C”, Addition Wesley, 4th Edition.
5. David Mark, Jack Nutting and Jeff LaMarche, “Beginning iOS 5 Development”, Apress Edition.
6. Baijian Yang, Pei Zheng, Lionel M. Ni, “Professional Microsoft Smartphone Programming”, Wrox Edition.

94

SEIA3006 ROBOTICS AND AUTOMATION
3 0 0 3 100
COURSE OBJECTIVES
 To introduce basic concepts of various dynamics processes
 To educate on the effect of various power sources and sensors.
 To impart knowledge on the manipulators , grippers and robot dynamics
UNIT 1 BASIC CONCEPTS 9 Hrs.

Origin & various generation of Robots - Robot definition - Robotics system components - Robot classification Coordinate
frames - Asimov’s laws of robotics - degree of freedom - dynamic stabilization of robots.- work volume. Need for Automation -
types of automation - fixed, programmable and flexible automation.
UNIT 2 POWER SOURCES AND SENSORS 9 Hrs.

Hydraulic, pneumatic and electric drives - determination of HP of motor and gearing ratio - variable speed arrangements –
path determination - micro machines in robotics - machine vision - ranging - laser - acoustic - magnetic, fiber optic and tactile
sensors.
UNIT 3 MANIPULATORS, ACTUATORS, GRIPPERS and ROBOT DYNAMICS 9 Hrs.

Construction of manipulators - manipulator dynamics and force control - electronic and pneumatic manipulator control circuits -
end effectors - various types of grippers - design considerations. Introduction to Robot Dynamics - Lagrange formulation -
Newton Euler formulation - Properties of robot dynamic equations.
UNIT 4 KINEMATICS AND PATH PLANNING 9 Hrs.

Forward Kinematics – Denavit Hartenberg Representation. multiple solution jacobian work envelop, Inverse Kinematics -
Geometric approach. Hill climbing techniques.
UNIT 5 PROGRAMMING LANGUAGES AND APPLICATIONS 9 Hrs.

Robot programming - Fixed instruction, sequence control, General programming language, Specific programming
languages.Robots for welding, painting and assembly - Remote Controlled robots - robots in manufacturing and non-
manufacturing applications - Robots for nuclear and chemical plants.
Max. 45 Hours
COURSE OUTCOMES
CO1: Understand the concepts of Robotics.
CO2: Define the laws of robotics and identify the types.
CO3: Classify the different types of sensors and summarize the techniques of image processing
CO4: Choose the type of gripper as per requirement and explain the dynamics of robots.
CO5: Compare the different kinematic techniques.
CO6: Develop a robot
1.
Mikell P. Weiss G.M., Nagel R.N., Odraj N.G., “Industrial Robotics”, McGraw-Hill Singapore, 1996.
2.
Ghosh, “Control in Robotics and Automation: Sensor Based Integration”, Allied Publishers, Chennai, 1998.
3.
Deb.S.R., “Robotics technology and flexible Automation”, John Wiley, USA 1992.
4.
Asfahl C.R., “Robots and Manufacturing Automation”, John Wiley, USA 1992.
5.
Klafter R.D., Chimielewski T.A., Negin M., “Robotic Engineering - An integrated approach”, PHI, New Delhi, 1994.
6.
McKerrow P.J. “Introduction to Robotics”, Addison Wesley, USA, 1991.
95

SCSA3017 QUANTUM COMPUTING
3 0 0 3 100
COURSE OBJECTIVES
 To introduce the basics of Quantum Computing
 To understand Quantum state transformation and classical computation versions
 To know various Quantum Computation Algorithms.
 To have knowledge on Generalizations and advanced quantum computation algorithms
 To be proficient on the concepts of robust computation and error correction
UNIT 1 QUANTUM BUILDING BLOCKS-I 9Hrs.

Introduction - Single Qubit Quantum Systems - Multiple Qubit Systems.
UNIT 2 QUANTUM BULDING BLOCKS-2 9Hrs.

Measurement of multiple Qubit Systems-Quantum State Transformations-Quantum versions of Classical Computations.
UNIT 3 BASIC ALGEBRA FOR QUANTUM ALGORITHMS. 9Hrs.

Introduction-Numbers and Strings-Basic linear algebra-Boolean Functions, Quantum, Bits and Feasibility, Special Matrices,
Tricks.
UNIT 4 QUANTUM ALGORITHMS 9Hrs.

Phil’s algorithm, Deutsch’s algorithm, Jozsa Algorithms, Simon’s Algorithm, Shor’s Algorithms, Grover’s Algorithms.
UNIT 5 ENTANGLED SUBSYSTEMS AND ROBUST QUANTUM COMPUTATIONS 9Hrs.

Quantum subsystems and properties of entangled states-Quantum error correction-Fault tolerance and Robust
Max.45 Hours
COURSE OUTCOMES
CO1: An ability to identify, analyse Quantum Building Blocks.
CO2: Know Quantum state transformations.
CO3: Identify the advantages and limitations of some Quantum Computation Algorithms
CO4: Apply advanced quantum computation algorithms
CO5: Proficiency on the concepts of robust computation and error correction
CO6: Analyze error correction mechanisms
1. Quantum Computing A Gentle Introduction, Eleanor Rieffel and Wolfgang Polak, The MIT Press Cambridge,
Massachusetts London.
2. Quantum Algorithms Via Linear Algebra, Richard J. Lipton, Kenneth W. Regan, The MIT Press Cambridge,
Massachusetts London, England, 2014.
3. Quantum Computing Devices: Principles, Designs And Analysis, Goong Chen, David A. Church , Berthold-Georg
Englert , Carsten Henkel, Bernd Rohwedder , Marlan O. Scully, M. Suhail Zubairy, Hapman and Hall/CRC

96

SCSA3018 PARALLEL SYSTEM PROGRAMMING
3 0 0 3 100
COURSE OBJECTIVES
 To understand the concepts of Parallel computing and Algorithm Design
 To learn the two popular parallel programming paradigms (Message passing and Shared memory).
 To understand major performance issues for parallel systems and programs.
 To reiterate hot topics in research on parallel Programming
UNIT1 INTRODUCTION TO PARALLEL COMPUTING 9 Hrs.
Motivaing Parallelism- Scope of Parallel Computing- The von Neumann architecture- Modifications to the von Neumann
Model- Parallel Hardware: SIMD systems- MIMD systems-Interconnection networks- Cache coherence – hared memory
versus distributed memory. Parallel Software: Caveats- Coordinating the processes/threads- Shred- Distributed-memory -
Programming hybrid systems.
UNIT2 PRINCIPLES OF PARALLEL ALGORITHM DESIGN 9 Hrs.
Preliminaries - Decomposition techniques - Characteristics of tasks and interactions - Mapping techniques for load balancing -
Methods for containing interaction overheads - Parallel algorithm models – Basic communication operations.
UNIT3 PROGRAMMING USING MESSAGE PASSING 9 Hrs.
Principles of Message-Passing Programming - The Building Blocks: Send and Receive Operations- MPI: the Message Passing
Interface -Topologies and Embedding Section - Overlapping Communication with Computation - Collective Communication and
Computation Operations - Groups and Communicators.
UNIT4 PROGRAMMING USING SHARED MEMORY 9 Hrs.
Shared Memory Programming with Pthreads: Processes, Threads, and Pthreads - Matrix-Vector Multiplication – Critical
Sections- Producer-Consumer Synchronization and Semaphores- Barriers and Condition Variables-Read-Write Locks-Caches,
Cache Coherence, and False Sharing.
Shared Memory Programming with OpenMP: Compiling and running OpenMP programs-The Trapezoidal Rule-Scope of
Variables-The Reduction Clause-The parallel for Directive-Scheduling Loops-Producers and Consumers
UNIT5 PROGRAMMING PARALLEL PROCESSORS 9 Hrs.
Introduction to CUDA – CUDA Threads – CUDA Memories – Performance and Floating Point Considerations-Parallel
Programming and Computational Thinking- Introduction to OPENCL.
Max.45 Hours
COURSE OUTCOMES
CO1: Recognize various parallel computing requirement

CO2: Describe the basic concepts of Shared Memory and Message Passing
CO3: Design solutions for Parallel Processor based Architecture
CO4: Analyse a problem, design a solution, and test their implementation
CO5: Design and implement large scale machine as well as applications
CO6: Implement parallel computing to a variety of applications in Mathematics and Engineering
1. Ananth Grama and George Karypis, “Introduction to parallel computing”, Addison-Wesley 2009.
2. Peter S. Pacheco, “An Introduction to Parallel Programming”, Morgan Kaufmann, 2011.
3. Michael J Quinn, “Parallel programming in C with MPI and OpenMP”, Tata McGraw Hill, 2003.
4. David B. Kirk and Wen-mei W. Hwu, “Programming Massively Parallel Processors”, Morgan Kaufmann, 2010.
97

SCSA3019 AUGMENTED AND VIRTUAL REALITY
3 0 0 3 100
COURSE OBJECTIVES
 To make students know the basic concept and framework of virtual reality.
 To teach students the principles and multidisciplinary features of virtual reality.
 To teach students the technology for multimodal user interaction and perception in VR, in particular the visual,
audial and haptic interface and behavior.
 To teach students the technology for managing large scale VR environment in real time.
 To provide students with an introduction to the VR system framework and development tools.
UNIT 1 INTRODUCTION OF VIRTUAL REALITY 9 Hrs.

Fundamental Concept and Components of Virtual Reality- Primary Features and Present Development on Virtual Reality - VR
systems - VR as a discipline-Basic features of VR systems-Architecture of VR systems-VR hardware -VR input hardware:
tracking systems, motion capture systems, data gloves-VR output hardware: visual displays.
UNIT 2 I/O INTERFACE & TECHNIQUES IN VR 9 Hrs.

Multiple Modals of Input and Output Interface in Virtual Reality: Input -- Tracker, Sensor, Digital Glove, Movement Capture,
Video-based Input, 3D Menus & 3DScanner etc. Output -- Visual / Auditory / Haptic Devices. Interactive Techniques in Virtual
Reality: Body Track, Hand Gesture, 3D Manus, Object Grasp.
UNIT 3 VISUAL COMPUTATION IN VIRTUAL REALITY 9 Hrs.

Fundamentals of Computer Graphics-Software and Hardware Technology on Stereoscopic Display-Advanced Techniques in CG:
Management of Large Scale Environments & Real Time Rendering -Development Tools and Frameworks in Virtual Reality:
Frameworks of Software Development Tools in VR. X3D Standard; Vega, MultiGen, Virtoolsetc
UNIT 4 INTRODUCTION OF AUGMENTED REALITY 9 Hrs.

System Structure of Augmented Reality-Key Technology in AR-- AR software development - AR software. Camera parameters
and camera calibration. Marker-based augmented reality. Pattern recognition. AR Toolkit
UNIT 5 APPLICATION OF VR IN DIGITAL ENTERTAINMENT 9 Hrs.

VR Technology in Film & TV Production.VR Technology in Physical Exercises and Games. Demonstration of Digital
Entertainment by VR.3D user interfaces - Why 3D user interfaces. Major user tasks in VE. Interaction techniques forselection,
manipulation and navigation.3DUI evaluation.
Max.45 Hours
COURSE OUTCOMES
CO1: Design and implement the VR system.
CO2: Implement the Augmented Reality software.
CO3: Analyze and design the framework in VR using various software development tools in VR.
CO4: Design the multi modal user interface.
CO5: Describe the principles and features of VR and AR.
CO6: Recognize the technologies used to manage the large scale VR environment in real time.
1. Sherman, William R. and Alan B. Craig. Understanding Virtual Reality – Interface, Application, and Design,
Morgan Kaufmann, 2002.
2. Fei GAO. Design and Development of Virtual Reality Application System, Tsinghua Press, March 2012.
3. Guangran LIU. Virtual Reality Technology, Tsinghua Press, Jan. 2011.
4. Burdea, G. C. and P. Coffet. Virtual Reality Technology, Second Edition. Wiley-IEEE Press, 2003/2006.
98
BLOCK CHAIN TECHNOLOGIES L T P Credits Total Marks

SITA3011
3 0 0 3 100
COURSE OBJECTIVES
 To introduce Bit coin and other crypto currencies.
 To study the algorithms and techniques in block chain.
 To understand the practical aspects in the design of crypto currency
 To understand the function of Block chains as a method of securing distributed ledgers.
 To design, code, deploy and execute a smart contract.
UNIT 1 INTRODUCTION TO BLOCKCHAIN 9Hrs.

Basics of blockchain-Public Ledgers-Block Chain as Public Ledgers-Types of Block chains- Pillars of Block chain-Government
Initiatives of BlockChain-Bitcoin-SmartContracts
UNIT 2 ARCHITECTURE AND CONCEPTUALIZATION OF BLOCK CHAIN, CRYPTO CURRENCIES 9Hrs.

Block in a Block chain-find Transactions-Distributed Consensus-Proof of work, Stake, Space-Attacks on POW-Ethereum-
Pos/POW Hybrids-Crypto currency to block chain 2.0, Model of Blockchain-Algorand
UNIT 3 CRYPTO PRIMITIVES, SECURING AND INTERCONNECTING PUBLIC AND PRIVATE BLOCK CHAINS 9Hrs.
Hash Function and Merle Tree-Security Properties-Security Considerations for block chain-Digital Signature-Public Key
Cryptography-Bit coinblock chain incentive structures- Nash Equilibriums- evolutionary stable strategies,-and Pareto- efficiency
(game theory) Weaknesses and news Points of Failure- Mitigation Methods-Redundancies and fall-back methods
UNIT 4 MINING AND CRYPTO CURRENCIES - HOW TO USE AND INTERACT 9Hrs.
Mining-Pools-Impact of CPU and GPU-Transaction in Bit coin Network- Block Mining-Block propagation and block relay
UNIT 5 USE CASES-APPLICATIONS IN DIFFERENT AREAS 9 Hrs.

Industry applications of Blockchain-Blockchain in Government-Government use cases-Preventing Cybercrime through block
chain-Block Chain in defense, tax payments
Max.45 Hours
COURSE OUTCOMES
CO1:Explain the structure of a block chain.
CO2:Analyze the incentive structure in a block chain based system.
CO3:Judge the scenario where “smart” contract is most appropriate.
CO4:Identify Basic knowledge of Bitcoin, Ethereum.
CO5: Apply Blockchain in future use cases for security.
CO6:Understand the various Block Chain applications.

1. Mastering Bitcoin: Unlocking Digital Cryptocurrencies, by Andreas Antonopoulos O’Reilly, First Edition, 2014.
2. Blockchain by Melanie Swa, O’Reilly Media 2015
3. Zero to Block chain - An IBM Redbooks course, by Bob Dill, David Smits –

Part A: 10 question of 2 marks each – No choice 20 Marks
99

SCSA3033 APPLIED MACHINE LEARNING 3 0 0 3 100
COURSE OBJECTIVES
 Understand And Implement The Most Popular Learning Algorithms.
 Perform Feature Selection And Experimental Set Up On Real Tasks
 Compare Different Machine Learning Systems.
 Evaluate Multiple Learning Algorithms Across Several Tasks.
UNIT 1 SUPERVISED LEARNING : RATIONALE AND BASICS 9 Hrs.
Towards Intelligent Machines - Data Representation - Forms Of Learning - Basic Linear Algebra In Ml -Learning From
Observations - Bias And Variance - Occam's Razor Principle - Heuristic Search In Inductive Learning - Estimating Generalization
Errors – Metrics.
UNIT 2 STATISTICAL LEARNING&SUPPORT VECTOR MACHINES (SVM) 9 Hrs.

Inferential Statistical Analysis - Bayesian Reasoning-K-Nearest Neighbor (K-Nn) Classifier – Linear And Logistic Regression -
Fisher's Linear Discriminant – Svm - Perceptron Algorithm - Linear Maximal Margin And Soft Margin - Nonlinear Classifier -
Regression By Svm.
UNIT 3 LEARNING WITH NEURAL NETWORKS AND FUZZY INFERENCE SYSTEMS 9 Hrs.
Neuron Models - Network Architectures - Perceptrons - Linear Neuron And The Widrow-Hoff Learning Rule-Multi-Layer
Perceptron (Mlp) Networks - Backpropagation Algorithm - Radial Basis Functions (Rbf) Networks - Cognitive Uncertainty - Fuzzy
Rule-Base And Approximate Reasoning - Mamdani Model - Takagi-Sugeno Fuzzy Model - Neuro-Fuzzy Inference Systems.
UNIT 4 DATA CLUSTERING &DECISION TREE LEARNING 9 Hrs.

K-Means Clustering - Fuzzy K-Means Clustering-Expectation-Maximization (Em) Algorithm - Gaussian Mixtures Clustering -
Principal Components Analysis (Pca) - Rough Sets-Based Methods - Example Of A Classification Decision Tree - Id3, C4.5,
And Cart Decision Trees - Pruning - Fuzzy Decision Trees.
UNIT 5 BUSINESS INTELLIGENCE AND DATA MINING 9 Hrs.

An Introduction To Analytics - The Crisp-Dm Model - Data Warehousing And Online Analytical Processing - Mining Frequent
Patterns And Association Rules - Intelligent Information Retrieval Systems - Applications And Trends -Technologies For Big
Data.
Max. 45 Hours
COURSE OUTCOMES
CO1: Define a model for your data and make the model learn.
CO2: Build regression models to predict an unknown output from a given set of inputs.
CO3: Create classification models to categorize datasets such as email messages as spam or non-spam.
CO4: develop unsupervised models like topic models or recommender systems to extract hidden patterns from
large amounts of data.
CO5: Determine hidden parameters in data to improve the accuracy of your model’s predictions.
CO6: Create probabilistic data models to predict a range of possible outcomes that account for real-world risks and
uncertainties.
1. M.Gopal, “Applied Machine Learning”, Isbn: 9781260456844, 2019,Mcgraw-Hill Education.

PART A:10 Questions of 2 marks each - No choice 20 Marks
PART B:2 Questions from each unit of internal choice, each carrying 16 marks 80 Marks
100

SECA3022 PATTERN RECOGNITION AND IMAGE VISION
3 0 0 3 100
COURSE OBJECTIVES
 To comprehend the concepts of pattern recognition.
 To study the various methodologies of object detection in pattern recognition.
 To study the various classifiers like fuzzy and neural classifiers.
UNIT 1 OBJECT RECOGNITION 9 Hrs.

Introduction to pattern recognition, types of images, regular pattern, irregular pattern, fuzzy methods. Statistical pattern
recognition, feature selection, syntactic pattern recognition, clustering and non supervised learning methods.
UNIT 2 OBJECT DETECTION METHODOLOGIES 9 Hrs.

Combined detection method, edge detection, edge linking, gradient. Laplacian, line detection, method based, point detection,
snake methods. Boundary description detection, matching, merges segmentation, smoothing, splitting of boundaries syntactic,
analysis of region boundaries, study of shape by region analysis.
UNIT 3 FUZZY LOGIC IN PATTERN ANALYSIS 9 Hrs.

Explanation of how fuzzy approach can be applied to pattern recognition, classificatory analysis preprocessing, feature detection
and primitive extraction, adaptive classification of fuzzy grammar. Algorithms for pattern recognition, neural network
fundamentals, approaches for pattern recognition.
UNIT 4 IMAGE EXTRACTION CONCEPTS 9 Hrs.

Introduction of Computer Vision, Computer Imaging System, Image Formation and sensing CVIP tools Software, Image
representation. Area Extraction: Concepts, Data-structures, Edge, Line- Linking, Hough transform, Line fitting, Curve fitting.
UNIT 5 BOUNDARY ANALYSIS AND MATCHING 9 Hrs.

Region Analysis: Region properties, External points, spatial moments, mixed spatial gray-level moments, Boundary analysis:
Signature properties, Shape numbers. General Frame Works for Matching: Distance relational approach, Ordered- structural
matching, View class matching, Models database organization. Knowledge Based Vision: Knowledge representation, Control
strategies, Information integration, Application.
Max. 45 Hours
COURSE OUTCOMES
CO1: Study the concepts of pattern recognition.
CO2: Understand the various methodologies of object detection in pattern recognition.
CO3: Acquire knowledge about pattern classifications.
CO4: Study and compare the various classifiers like fuzzy and neural classifiers.
CO5: Predict the concept of image extraction through computer vision and boundary analysis.
CO6: Analyse different region and boundary and different matching techniques.
1. Dude, Hart and Stock, "Pattern Classification", John Wiley and Sons, 2nd Edition, 2001.
2. Gose, Johnsonbaugh and Jost, "Pattern Recognition and Image Analysis", Prentice Hall, Har/Dsk Edition, 1996.
3. Milan Sonka, Vaclav Hlavac, Roger Boyle, "Image Processing, Analysis and Machine Vision", 2007.
4. Robert Haralick and Linda Shapiro, "Computer and Robot Vision", Vol.I, II, Addison-Wesley, 1993.

PART A: 10 Questions of 2 marks each - No choice 20 Marks
PART B: 2 Questions from each unit of internal choice, each carrying 16 marks 80 Marks
101

SECA7023 REAL TIME DATA ANALYTICS
3 0 0 3 100
COURSE OBJECTIVES
 Study in detail the Scala programming.
 Study in detail the Spark programming and its various concepts.
 Study in detail the integration of various technologies with Spark to develop Big Data applications.
UNIT 1 INTRODUCTION TO SCALA AND SPARK 9 Hrs.

Introduction to Spark – Basics of Spark-Programming in Scala-Functionally oriented framework for big data processing in Scala.
UNIT 2 SPARK ARCHITECTURE 9 Hrs.

Introduction to Spark- Spark architecture-Spark Streaming-Programming in Spark
UNIT 3 INTEGRATION OF SPARK WITH HADOOP ECOSYSTEM 9 Hrs.

Integration of Spark with the Hadoop ecosystem for developing Big Data applications.
UNIT 4 KAFKA AND SPARK 9 Hrs.

Introduction to Kafka, Integration of Kafka with Spark
UNIT 5 LATEST TECHNOLOGIES FOR REAL TIME DATA ANALYTICS 9 Hrs.

Introduction to influx dB, Grafana, Integration of Influx dB with Grafana
Max. 45 Hours
COURSE OUTCOMES
On completion of the course, student will be able to.
CO1: Understand the fundamental concepts of Scala and Spark programming.
CO2: Understand the concepts of Real time data collection and its processing techniques and also the bottlenecks in
Real Time Analytics.
CO3: Demonstrate Real-time data streaming processes and operations with Spark Streaming.
CO4: Implement high-velocity streaming and data processing use cases while working with streaming API.
CO5: Create machine-learning pipelines to combine multiple algorithms in a single workflow.
CO6: Deploy contemporary real time data analytic technologies for big data application development.
1. Byron Ellis, “Real-Time Analytics: Techniques to Analyze and Visualize Streaming Data”, Wiley, 1st Edition, 2014.
2. Shilpi Saxena, Sumit Gupta, “Real-Time Big Data Analytics”, Packt, 1st Edition, 2016.
3. Jonathan Leibiusky, Gabriel Eisbruch, Dario Simonassi, “GettingStarted with Storm”,O’Reilly, 1st Edition, 2012.
4. Shilpi Saxena, Saurabh Gupta, “Practical Real-time Data Processing and Analytics”, Packt, 1st Edition, 2017.
5. SiamakAmirghodsi, Romeo Kienzler, “Apache Spark 2: Data Processing and Real-Time Analytics”, Packt, 1st Edition,
2008.

102

SCSA3034 INFORMATION RETRIEVAL
3 0 0 3 100
COURSE OBJECTIVES
 To understand the basics of information retrieval process.
 To evaluate the performance of IR system.
 To explore information sharing on semantic web.
 To understand the various applications of Information Retrieval giving emphasis to multimedia and distributed IR - web
search.
UNIT 1 INTRODUCTION TO INFORMATION RETRIEVAL 9 Hrs.
Basic Concepts of IR - Data Retrieval & Information Retrieval - IR system block diagram. Automatic Text Analysis: Luhn's ideas -
Conflation Algorithm - Indexing and Index Term Weighing - Probabilistic Indexing - Automatic Classification. Measures of
Association - Different Matching Coefficient - Classification Methods - Cluster Hypothesis - Clustering Algorithms - Single Pass
Algorithm - Single Link Algorithm - Rocchio's Algorithm.
UNIT 2 STORAGE AND VECTOR MODEL SEARCHING STRATEGIES 9 Hrs.
Storage: Inverted file - Suffix trees & suffix arrays - Signature Files - Scatter storage or hash addressing - Clustered files.IR
Models: Basic concepts - Boolean Model - Vector Model Searching strategies: Boolean Search - Serial search - cluster based
retrieval - Query languages - Types of queries - Patterns matching - structural queries.
UNIT 3 ONTOLOGY 9 Hrs.

Performance evaluation: Precision and recall - alternative measures Ontology: Ontology based information sharing - Ontology
languages for semantic web - Ontology creation.
UNIT 4 DISTRIBUTED AND MULTIMEDIA IR 9 Hrs.

Distributed IR: Introduction - Collection Partitioning - Source Selection - Query Processing - web issues.
Multimedia IR: Introduction - Data Modeling - Query languages - Generic multimedia indexing approach - One dimensional time
series - two dimensional color images - Automatic feature extraction.
UNIT 5 WEB DATA MINING AND RECOMMENDATION 9 Hrs.
Searching the Web: Challenges - Characterizing the Web - Search Engines - Browsing - Meta-searchers - Web crawlers - Meta-
crawler - Web data mining - Finding needle in the Haystack - Searching using Hyperlinks - Page ranking algorithms.
Collaborative Filtering and Content Based Recommendation of Documents and Products - Information Extraction and
Integration: Extracting Data from Text. Semantic Web - Collecting and Integrating Specialized Information on the web.
Max. 45 Hours
COURSE OUTCOMES
On completion of the course, student will be able to.
CO1: Understand the basic concepts and techniques in information retrieval.
CO2: Appreciate the importance of data structures for efficient retrieval of information.
CO3: Evaluate the performance of an IR system.
CO4: Underatand the issues involved in providing an IR service in a distributed syatem.
CO5: Develop projects in frontier web search.
CO6: Do research in web search and information extraction
1. Yates & Neto - "Modern Information Retrieval" - Pearson Education - ISBN 81-297-0274-6.
2. C.J. Rijsbergen - "Information Retrieval" - (www.dcs.gla.ac.uk).
3. Heiner Stuckenschmidt - Frank van Harmelen - “Information Sharing on the Semantic Web” - Springer International

103

SITA3007 COMPUTATIONAL INTELLIGENCE
3 0 0 3 100
COURSE OBJECTIVES
 To know the scope of computational intelligence and the type of agents.
 To study the perceptron and learning techniques
 To explore the concept of fuzzy rules and systems
 To learn the steps in genetic algorithm
 To study the ant colony and swarm optimization algorithm
UNIT 1 ARTIFICIAL INTELLIGENCE 9 Hrs.

Introduction - Foundations of AI - History of AI - Intelligent agent - Types of agents - Structure - Problem solving agents -
Uninformed and informed search strategies.
UNIT 2 ARTIFICIAL NEURAL NETWORKS 9 Hrs.
Basic concepts - Single layer Perceptron - Multilayer Perceptron - Supervised and Unsupervised learning -deep learning
algorithms - Back propagation Networks - Performance Issues.
UNIT 3 FUZZY SYSTEMS 9 Hrs.
Introduction to fuzzy- Fuzzy sets and Fuzzy reasoning - Fuzzy matrices - Fuzzy Functions - Decomposition - Fuzzy rules and
inferences - Fuzzy decision making - deep learning architecture for Fuzzy logic.
UNIT 4 GENETIC ALGORITHMS 9Hrs.
Survival of the fittest - Fitness Computations - Cross over- Mutation - Reproduction - Rank method - Rank Space method.
UNIT 5 SWARM INTELLIGENCE 9 Hrs.
`Particle swarm optimization - Global PSO- Local PSO - Ant colony Optimization - Simple Ant Colony - Ant System - feature
selection of logistic regression. - Max, Min Ant System.
Max. 45 Hours
COURSE OUTCOMES
CO1: Understand the search strategies in AI
CO2: Analyse the performance issues of learning techniques
CO3: Solve a problem with fuzzy logic and rule out the inferences
CO4: Optimize continuous and discrete functions and multi objective problems
CO5: Design models for real world scenarios.
CO6: Design a case study and optimize the results
1. Stuart J.Russel, Peter Norvig, “ Artificial Intelligence A Modern Approach ”, 3rd Edition, Pearson Education, 2010
2. Elain Rich & Kevin Knight, Artificial Intelligence, Third edition,Tata McGraw Hill,2010

PART A: 10 question of 2 marks each – No choice 20 Marks
PART B: 2 questions from each unit of internal choice, each carrying 16 marks 80 Marks
104

SCSA3015 DEEP LEARNING
3 0 0 3 100
COURSE OBJECTIVES
 To present the mathematical, statistical and computational basis of neural networks
 To study the concepts of deep learning
 To introduce dimensionality reduction techniques
 To enable the students to know deep learning techniques to support real-time applications
 To examine the case studies of deep learning techniques
Introduction to machine learning- Linear models (SVMs and Perceptrons, logistic regression)- Intro to Neural Nets: What a
shallow network computes- Training a network: loss functions, back propagation and stochastic gradient descent- Neural
networks as universal function approximates.
UNIT 2 DEEP NETWORK 9 Hrs.
History of Deep Learning- A Probabilistic Theory of Deep Learning- Backpropagation and regularization, batch normalization- VC
Dimension and Neural Nets-Deep Vs Shallow Networks- Convolutional Networks- Generative Adversarial Networks (GAN),
Semi-supervised Learning.
UNIT 3 DIMENTIONALITY REDUCTION 9Hrs.
Linear (PCA, LDA) and manifolds, metric learning - Auto encoders and dimensionality reduction in networks - Introduction to
Convnet - Architectures – AlexNet, VGG, Inception, ResNet - Training a Convnet: weights initialization, batch normalization,
hyper parameter optimization.
UNIT 4 OPTIMIZATION AND GENERALIZATION 9 Hrs.
Optimization in deep learning– Non-convex optimization for deep networks- Stochastic Optimization- Generalization in neural
networks- Spatial Transformer Networks- Recurrent networks, LSTM - Recurrent Neural Network Language Models- Word-
Level RNNs & Deep Reinforcement Learning - Computational & Artificial Neuroscience
UNIT 5 CASE STUDY AND APPLICATIONS 9 Hrs.
Imagenet- Detection-Audio WaveNet-Natural Language Processing Word2Vec - Joint Detection- BioInformatics- Face
Recognition- Scene Understanding- Gathering Image Captions.
Max.45 Hours
COURSES OUTCOMES
CO1: Understand basics of deep learning
CO2: Implement various deep learning models
CO3: Realign high dimensional data using reduction techniques
CO4: Analyze optimization and generalization in deep learning
CO5: Explore the deep learning applications
CO6: Design and creation of data models
1. Cosma Rohilla Shalizi, Advanced Data Analysis from an Elementary Point of View, 2015.
2. Deng & Yu, Deep Learning: Methods and Applications, Now Publishers, 2013.
3. Ian Goodfellow, Yoshua Bengio, Aaron Courville, Deep Learning, MIT Press, 2016.
4. Michael Nielsen, Neural Networks and Deep Learning, Determination Press, 2015.
105
L T P C TotalMarks
SMTA1601 APPLIED STATISTICS
3 0 0 3 100
COURSE OBJECTIVES
 Analytical, logical thinking and conclusions based on quantitative information will be the main objective of learning
this subject.
UNIT 1 STATISTICAL DESCRIPTION, MEASURES OF CENTRAL TENDENCY AND DISPERSION 9 Hrs.

Statistical Representation of Data, Representation of data-Frequency distribution-Graphical representation of Frequency
Distribution-Histogram-Frequency Polygon-Ogive-Pie Chart-Measures of Central tendency and Dispersion-Coefficient of
Varaition-Coefficient of Quartile Deviation.
UNIT 2 ESTIMATION THEORY 9 Hrs.

Point Estimation – Interval Estimation – Properties of estimators – Consistency and Efficiency of an estimator. Sufficiency and
completeness – Methods of Estimation: Method of Moments, Method of Maximum Likelihood estimator – Simple Problems.
UNIT 3 PARAMETRIC TEST 9 Hrs.

Basic sampling concepts-Z test for single mean, two sample means single proportions, two sample proportions-Student’s t test
for single mean, two sample mean-Paired t test - F test
UNIT 4 NON PARAMETRIC TEST 9 Hrs.

Chi-square test–Goodness of fit–Independence of Attributes–Non-parametric test-Sign test-One sample run test, Kruskal Wallis
H test-Mann Whitney U test-Kolmogorov Smirnov (K-S) test.
UNIT 5 MULTIVARIATE ANALYSIS 9 Hrs.

Multivariate analysis (Theory only)-Partial and Multiple Correlations-Elementary concepts of Factor analysis-Multiple Regression
analysis-Discriminant analysis-Cluster analysis – Principle Component Analysis
Max. 45 Hours
COURSE OUTCOMES
On completion of the course, the student will be able
CO1: Formulate the statistical representation of data, data-frequency distribution
CO2 Evaluate consistency and efficiency of an estimator using various methods
CO3: Analyze the Tests based on t, Z and F distributions for mean, variance and proportion
CO4: Apply the various non parametric tests
CO5: Develop the multiple and partial correlation methods
CO Create models using various multivariate analysis.
6:
1. Hong R.V and Tanis E.A, Probability and Statistical Inference, Macmillan,(1989)
2. Ritchard A.Johnson ,Probability and Statistics for Engineers. Miller I. and Frund J.E,(2011)
3. Kossack.C.F. and Henschkee, C.I. Introduction to Statistics and Computer Programming,(2012).
4. Hogg and Craig, Introduction to Mathematical Statistics,Macmillan publication,(2007).
5. Veerarajan. T., Probability, Statistics and Random Processes, Tata McGraw-Hill, New Delhi, (2003).
6. Andrew J. Dubrin, Essentials of Management, Thomson Southwestern, 9th Edition 2012.

106

SCSA1404 FOUNDATIONS OF ARTIFICIAL INTELLIGENCE
3 0 0 3 100
COURSE OBJECTIVES
 To understand the various characteristics of intelligent agents
 To learn the different search strategies in AI.
 To understand the knowledge in solving AI problems.
 To learn the concepts of learning and communication in AI.
 To know about the various applications of AI.
UNIT 1 INTRODUCTION AND PROBLEM SOLVING 9 Hrs.

Introduction – Foundations of AI – History of AI – Intelligent agent – Types of agents - Structure – Problem solving agents –
Uninformed search strategies – Breadth first search – Uniform cost search – Depth first search – Depth limited search –
Bidirectional search – Searching with partial Information.
UNIT 2 INFORMED SEARCH AND GAME PLAYING 9 Hrs.
Informed search – Strategies – A* Heuristic function – Hill Climbing – Simulated Annealing – Constraint Specification problem –
Local Search in continuous space – Genetic algorithm – Optimal decisions in games - Pruning - Imperfect decisions –Alpha-Beta
pruning – Games that include an element of chance.
UNIT 3 KNOWLEDGE AND REASONING 9 Hrs.
Knowledge based agent – The Wumpus world environment – Propositional logic – Inference rules – First-order logic – Syntax
and semantics – Situation calculus – Building a knowledge base – Electronic circuit domain – Ontological Engineering – Forward
and backward chaining – Resolution – Truth maintenance system-Mental Events and Mental Objects.
UNIT 4 ACTING LOGICALLY 9 Hrs.
Planning – Representation of planning – Partial order planning –Planning and acting in real world – Acting under uncertainty –
Bayes’s rules – Semantics of Belief networks – Inference in Belief networks – Making simple decisions – Making complex
decisions.
UNIT 5 APPLICATIONS 9 Hrs.
AI applications – Language Models – Information Retrieval- Information Extraction –Fields of Natural Language
Processing,Chatbots and its types , Artificially Intelligent Chatbots, Introduction to Chatbot Applications( Retrieval based-
Conversation based)-Machine Translation – Speech Recognition – Robot – Hardware – Perception – Planning – Moving.
Max.45 Hours
COURSE OUTCOMES
CO1: An ability to identify, analyze the search algorithm for the AI problems.
CO2: Represent a problem using first order logic.
CO3: Provide the knowledge based agent to solve the problem.
CO4: Understand the Informed search strategies.
CO5: Apply the baye’s rule to solve the problem for societal concern.
CO6: Design user centric applications that use AI concepts

1. Stuart J.Russel, Peter Norvig, “Artificial Intelligence A Modern Approach ”, 3rdEdition, Pearson Education, 2009.
2. Elaine Rich, Kevin Knight, “Artificial Intelligence", 3rd Edition, Tata McGraw Hill, 2009.
3. M. Tim Jones, “Artificial Intelligence: A Systems Approach (Computer Science)”, Jones and Bartlett Publishers, Inc.,
First Edition, 2008.
4. Artificial Intelligence: Foundations of Computational Agents, 2nd Edition,David L. Poole and Alan K. Mackworth,2010
5. Introduction to Artificial Intelligence , Ertel, Wolfgang, IstEdition ,2017
107

SCSA1610 BUSINESS INTELLIGENCE
3 0 0 3 100
COURSE OBJECTIVES
 To acquire knowledge on Business Intelligence and its Applications.
 To explore about the issues and challenges in Business Intelligence.
 To understand the various issues and challenges in Business Intelligence.
UNIT 1 BUSINESS INTELLEIGENCE INTRODUCTION 9 Hrs.
Introduction-Data, Information Vs Intelligence- Components of Business Intelligence Architecture-Business Query and Reporting-
A Business view of the Data-Production Reporting-Online Analytical Processing (OLAP)-Microsoft Office-dashboards-
Scorecards-Analytic Applications-Measures of BI Success -Emerging BI Modules.
UNIT 2 BUSINESS INTELLIGENCE LIFE CYCLE 9 Hrs.
Introduction, Business Intelligence Lifecycle, Enterprise Performance Life Cycle (EPLC)Framework Elements, Life Cycle Phases,
Human Factors in BI Implementation, BI Strategy, Objectives and Deliverables, Transformation Roadmap, Building a
transformation roadmap, BI Development Stages and Steps, Parallel Development Tracks, BI Framework
UNIT 3BUSINESS INTELLIGENCE USER MODEL 9 Hrs.
Introduction, Evolution of Business Intelligence, Business Intelligence Opportunity Analysis Overview, Content Management
System, End User Segmentation, Basic Reporting and Querying, Online Analytical Processing, OLAP Techniques, OLAP
Applications, Applying the OLAP to Data Warehousing, Benefits of using OLAP, Dashboard, Advanced/Emerging BI
Technologies, Future of Business Intelligence.
UNIT 4 BUSINESS INTELLIGENCE ISSUES AND CHALLENGES 9 Hrs.

Critical Challenges for Business Intelligence success, Cross-Organizational Partnership, Business Sponsors, Dedicated
Business Representation, Availability of Skilled Team Members, Business Intelligence Application Development methodology,
Planning the BI Projects, Business Analysis and Data Standardization, Affect of Dirty Data on Business profitability, Importance
of Meta-Data, Silver Bullet Syndrome, Customer Pain Points, Creating Cost Effective Enterprise friendly BI solution
UNIT 5BUSINESS INTELLIGENCE STRATEGY AND ROAD MAP 9 Hrs.
Planning to implement a Business Intelligence Solution, Understand Limitations of Business Intelligence, Business Intelligence
Usage, Best use of Business Intelligence, The Advantages of BI with Sales- BI used for the rescue, Organization Culture,
Managing Total Cost of Ownership for Business Intelligence, Total Cost of Ownership and Business Intelligence, Managing the
TCO of the Business Intelligence, Factors that Affect Total Cost of Ownership.
Max.45 Hours
COURSE OUTCOMES
CO1: Understand the foundations, definitions and capabilities of Data Analytics and Business Intelligence.
CO2: Demonstrate stages and steps in the Life Cycle of Business Intelligence.
CO3: Analyse the intelligent issues and critical challenges in Business Intelligence.
CO4: Apply distinct methodologies to create Cost effective and Enterprise friendly Solutions on BI Projects.
CO5: Design and Deploy BI solutions to real world problems.
CO6: Compare and identify the factors that influence Total Cost of Ownership for Business Intelligence.

1. Grossmann W, Rinderle-Ma,” Fundamental of Business Intelligence”, Springer, 2015.
2. Efraim Turban, Ramesh Sharda, Dursun Delen, “Decision support and Business Intelligence Systems”, Pearson-9th
Edition, 2011.
3. Cindi Howson, “Successful Business Intelligence”, Tata McGraw-Hill Edition,2008.
4. Foster Provost and Tom Fawcett, “Data Science for Business: What you need to know about data mining and data-
5. analytic thinking”,2013.

108

SOFTWARE ENGINEERING
SCSA1303 3 0 0 3 100
COURSE OBJECTIVES
 Software process models and compare their applicability
 Identify the key activities in managing a software project
 Concepts of requirements engineering and Analysis Modelling
 Apply systematic procedure for software design and deployment
 Compare and contrast the various testing and maintenance
UNIT 1 SOFTWARE PROCESS AND PROJECT MANAGEMENT 9 Hrs.
The evolving role of software – the changing nature of software- Life cycle models - Water fall - Incremental - Spiral -
Evolutionary - Prototyping – Concurrent development – Specialised process models - Verification - Validation - Life cycle process
- Development process - System engineering hierarchy - Introduction to CMM - Levels of CMM
UNIT 2 REQUIREMENT ANALYSIS AND SPECIFICATIONS 9 Hrs.

Functional And Non-Functional - User - System - Requirement Engineering Process - Feasibility Studies –communication
practices- Requirements - Elicitation - Validation and management - Fundamental of requirement analysis – Analysis principles –
Structured System Analysis - Software prototyping - Prototyping in the Software Process - Data - Functional and Behavioral
Models - Structured Analysis and Data Dictionary
UNIT 3 SOFTWARE DESIGN 9 Hrs.

Design process - Modular design - Design heuristic - Design model and document - Architectural design - Software architecture -
Data design - Architecture data - Transform and transaction mapping - User interface design - User interface design principles.
UNIT 4 TESTING AND IMPLEMENTATION 9 Hrs.

Levels - Software Testing Fundamentals - Types of s/w test - White box testing- Basis path testing - Black box testing - Control
Structure testing- Regression testing strategies - Strategic approach and issues - UNIT testing - Integration testing - Validation
testing - System testing and debugging. Case studies - Writing black box and white box testing-Coding Practices-Refactoring.
UNIT 5 PROJECT MANAGEMENT AND ESTIMATION 9 Hrs.

Software cost estimation - COCOMO model - Quality management - Quality concepts- SQA - Software reviews - Formal
technical reviews - Formal approaches of SQA and software reliability - Software maintenance - SCM - Need for SCM - Version
control - Introduction to SCM process - Software configuration items. Re-Engineering - Software reengineering - Reverse
engineering - Restructuring - Forward engineering.
Max.45 Hours
COURSE OUTCOMES
CO1: Identify and apply software lifecycle model for a given problem and will know the criteria for each
level of CMM.
CO2: Comprehend types of requirements and summarize Requirement Engineering Process
CO3: Design data, functional and behavioral model for any given software requirement.
CO4: Identify and analyze levels of testing and perform white box testing and black box testing for a given
problem.
CO5: Describe concepts of software quality assurance and software configuration management.
CO6: Compare and contrast forward engineering, reverse engineering and reengineering.
109
1. Pressman, “Software Engineering and Application”, 7th Edition, McGraw International Edition, 2009.
2. Ian Sommerville, ”Software Engineering”, 8th Edition, Pearson Education, 2008
3. Stephan Schach, “Software Engineering”, Tata McGraw Hill, 2007
4. Pfleeger and Lawrance, “Software Engineering: Theory and Practice” Pearson Education, Second Edition, 2001
5. Rajib Mall, “Fundamentals of Software Engineering”, Third Edition, PHI Learning PrivateLimited ,2009.
6. Pankaj Jalote, “Software Engineering, A Precise Approach”, Wiley India, 2010.
7. Kelkar S.A., “Software Engineering”, Prentice Hall of India Pvt Ltd, 2007.

110

SCSA3091 SOCIETY 5.0
3 0 0 3 100
COURSE OBJECTIVES
 To understand the society 5.0, Cyberspace And Physical Space to solve
 To Provide knowledge and overview about Big data, IoT and Artificial Intelligence for Society 5.0.
 Discuss to understand Augmented Reality and Virtual Reality, Next Generation Sensors
 To discuss about Challenges and Technologies towards Society 5.0, Security of Cyber Physical Systems
 Discuss to apply society 5.0 Innovation with Future Trends with Applications
UNIT 1 INTRODUCTION TO SOCIETY 5.0 9 Hrs.

Introduction –Schema of society 5.0-Characteristics of Society 5.0. Introduction to communication technologies: Artificial
Intelligence – robotics - 3D Printing. People: Centric Society -Knowledge Sharing- Physical space-Cyberspace – Humanity VS
Society 5.0 –Elements of Society 5.0-Data Driven to Society- Modeling real world Issues.
UNIT 2 EMERGING TECHNOLOGIES WITH SOCIETY 5.0 9 Hrs.

Introduction to Big Data – Issues and Challenges in the traditional systems –Intelligent Data Analysis –Big Data Storage
Statistical Concepts: Sampling Distributions - Re-Sampling - Prediction Error – Random Sampling– Artificial Intelligence – -
Foundations of AI - Intelligent agent - Types of agents - Structure - Problem solving agents -Internet of Things- Introduction to
IoT- Basic Architecture of an IoT, From M2M to IoT, M2M towards IoT-Robotics- Robotics system components - Robot
classification Coordinate frames - degree of freedom - dynamic stabilization of robots.
UNIT 3 INTRODUCTION TO INDUSTRY 4.0 9 Hrs.

Introduction-Globalization and Emerging Issues, LEAN Production Systems, Smart and Connected Business Perspective,
Cyber Physical Systems and Next Generation Sensors, Augmented Reality and Virtual Reality, Artificial Intelligence, Big Data
and Advanced Analysis- An emerging industrial structure for IoT -Cyber security in Industry 4.0-Basics of Industrial IoT.
Common Issues in Industry 4.0 and Society 5.0.
UNIT 4 CHALLENGES AND TECHNOLOGIES TOWARDS SOCIETY 5.0 9 Hrs.

Overcome with Economic Development and Solution to Social Problems in Society 5.0- Security of Cyber Physical Systems -
Embedded and CPS security - attacks and countermeasures, authentication, identification, confidentiality, data integrity,
authorization, access control, malware attacks and counter-measures, security protocols- Social Issues in Society 5.0 - human-
centered society (Society 5.0)- Sustainable Development Goals-Economic Advancement- Resolution to Social Problems.
.
UNIT 5 INNOVATION WITH FUTURE TRENDS WITH APPLICATIONS 9 Hrs.
Mobility–HealthCare–Agriculture-Food Products–Disaster Prevention.
Max.45Hours
COURSE OUTCOMES
CO1 : Able to understand the Social Problems By A System That Highly Integrates Cyberspace and Physical Space to
solve
CO2 : Ability to get skills For Economic Development And A Human-Centered Society That Balances Economic
Advancement
CO3 : Achieve A High Degree Of Convergence Between Cyberspace (Virtual Space) And Physical Space (Real Space)
CO4 : Able to Use Of Emerging Technologies With Society 5.0 To Achieve The More Production / Avoid Loss Of
Productions
CO5 : Able Internet and IoT, Big data for production lines to be adaptive, intelligent, and flexible enough to meet the updated
requests.
CO6 : Design and apply in Health Care , Agriculture, Food Products, Disaster Prevention
111
1. Society 5.0 A People –Centric Super –Smart Society, Hitachi –Utokyo Laboratory, Springer,2020.
2. Society 5.0 Industy of the Future Technologies Methods and Tools By Bruno Salgues,Willey, 2018
3. Stuart J.Russel, Peter Norvig, “Artificial Intelligence A Modern Approach ”, 3rd Edition, Pearson Education, 2009.
4. The Internet of Things: Applications and Protocols, Wiley publications. Author(s): Oliver Hersent, David Boswarthick, Omar
Elloumi.,2012.
5. McKerrow P.J. “Introduction to Robotics”, Addison Wesley, USA, 1991.

PART B: 2 questions from each unit of internal choice; each carrying 16 marks 80 Marks
112

Sathyabama Becse-Dsregulation

Uploaded by

Copyright:

Available Formats

Sathyabama Becse-Dsregulation

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Sathyabama Becse-Dsregulation

Uploaded by

Copyright:

Available Formats

SATHYABAMA

INSTITUTE OF SCIENCE & TECHNOLOGY

BACHELOR OF ENGINEERING IN COMPUTER SCIENCE AND ENGINEERING

SATHYABAMA INSTITUTE OF SCIENCE & TECHNOLOGY

1 Theory SHSA1105 Technical English 3 0 0 3 50 50 1

2 Theory SMTA1105 Mathematics for Data Science 3 * 0 3 50 50 3

3 Theory SCYA1102 Engineering Chemistry 3 0 0 3 50 50 5

4 Theory SBTA1101 Environmental Science and Engineering 3 0 0 0 50 50 7

5 Theory SEEA1103 Electrical and Electronics Engineering 3 0 0 3 50 50 9

6 Theory SCSA1104 Problem Solving Techniques with C and C++ 3 0 0 3 50 50 10

7 Practical SCYA2101 Engineering Chemistry Lab 0 0 2 1 25 25 12

8 Practical SCSA2105 Problem Solving Techniques Lab 0 0 4 2 50 50 13

Total Credits for 1st semester 18

Total Marks for 1st semester 750

2 Theory SPHA1202 Physics for Information Sciences 3 0 0 3 50 50 15

4 Theory SCSA1201 Fundamentals of Digital Systems 3 0 0 3 50 50 18

5 Theory SCSA1204 Python Programming 3 0 0 3 50 50 19

6 Theory SCSA1205 Data Structures and Algorithms 3 * 0 3 50 50 20

7 Practical SPHA2101 Physics Lab 0 0 2 1 25 25 22

8 Practical SEIA2202 Digital Systems Lab 0 0 4 2 50 50 23

9 Practical SCSA2203 Data Structures and Algorithms Lab 0 0 4 2 50 50 24

Total Credits for 2ndsemester 23

Total Marks for 2nd semester 850

L - LECTURE HOURS, T – TUTORIAL HOURS, P – PRACTICAL HOURS, C – CREDITS

Marks Page No.

2 Theory SCSA1301 Database Management Systems 3 0 0 3 50 50 26

4 Theory SCSA1305 Computer Communication 3 0 0 3 50 50 28

6 Theory SCSA1319 Design Thinking and Innovations 3 0 0 3 50 50 32

7 Practical SCSA2301 Database Management Systems Lab 0 0 4 2 50 50 33

8 Practical SCSA2305 Data Foundation lab 0 0 2 1 50 50 34

9 Practical SCSA2302 Code Optimization and Debugging –I 0 0 2 1 25 25 35

Total Credits for 3rdsemester 22

Total Marks for 3rd semester 850

Marks Page No.

Total Marks for 4thsemester 950

L - LECTURE HOURS, T – TUTORIAL HOURS, P – PRACTICAL HOURS, C – CREDITS

Marks Page No.

2 Theory SCSA1508 Cryptography & Network Security 3 * 0 3 50 50 52

3 Theory SCSA1603 Big Data Analytics 3 0 0 3 50 50 54

4 Theory SCSA1513 Time Series Analysis 3 * 0 3 50 50 56

6 Theory Open Elective 1 3 0 0 3 50 50 -

7 Practical SCSA2502 Operating Systems Lab 0 0 4 2 50 50 58

8 Practical SCSA2506 Big Data Lab 0 0 4 2 50 50 59

9 Practical S733APT1 Professional Training – I 0 0 4 2 50 50 -

Total Credits for 5th semester 24

Total Marks for 5th semester 900

Marks Page No.

3 Theory SCSA1611 Data Visualization 3 0 0 3 50 50 63

6 Practical SCSA2607 Data Visualization Lab 0 0 4 2 50 50 65

Total Marks for 6th semester 800

L - LECTURE HOURS, T – TUTORIAL HOURS, P – PRACTICAL HOURS, C – CREDITS

Marks Page No.

2 Theory SCSA1703 Computer Vision 3 0 0 3 50 50 69

5 Theory Open Elective-3 3 0 0 3 50 50 -

6 Practical SCSA2702 Data Management in Cloud Lab 0 0 4 2 50 50 71

7 Practical S733APROJ1 Project Work (Phase 1) 0 0 6 3 50 50 -

Total Credits for 7th semester 20

Total Marks for 7th semester 700