Becse R2023book

Download as pdf or txt
Download as pdf or txt
You are on page 1of 198

SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SHSB1101 TECHNICAL ENGLISH
3 0 0 0 3 100

COURSE OBJECTIVES
To understand specialized subject areas and skills included for their study.
To comprehend and react in oral and written forms to the specialized texts.
To respond to listening, reading and writing tasks by using digital tools.
To enhance communication, collaboration and critical thinking skills.
To explore creativity through blended learning contexts.
UNIT 1 9 Hrs.
Listening :
Listening to choose the correct answer from the options given (MCQ).
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 (problems and 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.

UNIT 2 9 Hrs.
Listening : Listening to advertisements about a product, say true or false.
Speaking : JAM on current topics, mini presentations.
Reading : Identifying topic sentences by reading content.
Writing : Writing compare/ contrast paragraphs, process description, E-Mail Writing.
Vocabulary : Verbal phrases, Prepositions and Prepositional phrases, Concord, Discourse
Markers.
Language Focus : Clauses, Conjunctions, Sentence Types - Simple, Compound and Complex.
Language Lab : Digital literacy: Responding to quiz using Kahoot application.

UNIT 3 9 Hrs.
Listening : Listening to summarize the information, debates/ discussions.
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 Focus : Reported Speech, Causatives, Basic Sentence Patterns
Language Lab : Digital literacy: Using online discussion forum

B.E/B.Tech REGULAR REGULATIONS 2023


1
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

UNIT 5 9 Hrs.
Listening and
summarizing : Listening to identify the structure of sentences, small talks, TED talks.
Speaking : Giving impromptu talks, Speech Writing.
Reading : Read argumentative essays and paragraphs.
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.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Classify technical words to use them in sentences framing, compose problem solving
paragraphs.
CO2 - Categorize information based on the understanding of reading materials to prepare notes.
CO3 - Prepare and document to report, identify elements of editing.
CO4 - Interpret technical definitions related to the text and design a user manual using instructions.
CO5 - Summarize reading materials and outline an essay on any topic given.
CO6 - Demonstrate their language learning activities in the classroom/ online group environment.

TEXT / REFERENCES BOOKS


1. Technical English [2019], Department of English, Sathyabama Institute of Science and Technology.
2. Beer A Guide to Writing as an Engineer 4th edition, Wiley, 2013
3. Alred, Gerald J., et al., Handbook of Technical Writing 11th edition, Bedford/St. Martin's, 2019.
4. Pearsall, Thomas Edward, Technical Writing: A Practical Guide for Engineers, Scientists, and
Nontechnical Professionals McGraw-Hill Education, 2017.
5. Straus, Jane, The Blue John Wiley and Sons, 2014.
6. O'Conner, Patricia T. Woe is I: The Grammarphobe's Guide to Better English in Plain English
Riverhead Books, 2019.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


2
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SMTB1101 MATRICES AND CALCULUS
3 1 0 0 3 100

COURSE OBJECTIVES
To identify, reflect upon, evaluate and achieve conceptual understanding and knowledge of
traditional calculus to form independent judgements.
To model the engineering problems and obtain its solutions mathematically.
To understanding science, engineering and computer science analytically and logical thinking is
attained.

UNIT 1 MATRICES 9 Hrs.


Characteristic equation of a square matrix Eigen values and Eigen vectors of a real matrix Properties
of Eigen values and Eigen Vectors Cayley-Hamilton theorem (without proof) verification, finding
inverse and power of a matrix Diagonalization of a matrix using orthogonal transformation Quadratic
forms Nature of quadratic forms Reduction of quadratic form to canonical form by orthogonal
transformation.

UNIT 2 GEOMETRICAL APPLICATIONS OF DIFFERENTIAL CALCULUS 9 Hrs.


Definitions Derivative of standard functions (Results only) - Differentiation of function of function
Logarithmic differentiation Derivatives of implicit function- Curvature Centre, Radius and Circle of
Curvature in Cartesian co-ordinates Evolutes.

UNIT 3 FUNCTIONS OF SEVERAL VARIABLES 9 Hrs.


Partial derivatives (Definition) Total derivative Jacobian- Maxima and minima
of functions of two variables

UNIT 4 INTEGRAL CALCULUS I 9 Hrs.


Beta and Gamma integrals Relation between them Properties of Beta and Gamma integrals with
proofs Evaluation of definite integrals in terms of Beta and Gamma function.

UNIT 5 INTEGRAL CALCULUS II 9 Hrs.


Double integrals in Cartesian and Polar co-ordinates Change of order of integration Change of
variables from Cartesian to Polar coordinates Area of plane curves using double integrals. Triple
integrals Volume using triple integrals in Cartesian co-ordinates (Simple Applications).

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Convert the quadratic form to canonical form by orthogonal transformation.
CO2 - Construct the circle of curvature and evolutes of any curve.
CO3 - Examine the maxima and minima of functions of several variables.
CO4 - Analyze the relationship between Beta and Gamma functions and its applications.
CO5 - Evaluate double integrals in various coordinate systems.
CO6 - Apply the concept of triple integrals in engineering problems.

B.E/B.Tech REGULAR REGULATIONS 2023


3
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Erwin Kreyszig, Advanced Engineering Mathematics , 10th Edition, John Wiley and Sons,
Singapore, 2012.
2. Grewal B.S., Higher Engineering Mathematics , 41st Edition, Khanna Publications, Delhi,
2011.
3. Veerarajan T., Engineering Mathematics for First Year , 2nd Edition, Tata McGraw Hill
Publishers, New Delhi, 2008.
4. Kandaswamy P and Co., Engineering Mathematics for First Year , 9th revised edition, S.Chand
and Co Pub., 2010.
5. Venkataraman M.K., Engineering Mathematics First Year , 2nd Edition, National Publishing
Co., 2000.
6. Ramana B.V., Higher Engineering Mathematics , Tata McGraw Hill, New Delhi, 11th Reprint,
2010.
7. Bali and Manish Goyal, A Text book of Engineering Mathematics , Laxmi publications, Reprint
2008

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


4
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCYB1101 CHEMISTRY 3 0 0 0 3 100

COURSE OBJECTIVES
To understand the basic concepts of quantum chemistry from bonds to bands
To learn the principles and applications of energy levels in molecules
To know the importance of electrochemistry in batteries.
To explore the concept of corrosion mechanism and design principles.
To study the various synthetic approaches in Nanochemistry.

UNIT 1 ATOMIC AND MOLECULAR STRUCTURE 9 Hrs.


Introduction to quantum chemistry Motion of a quantum mechanical particle in one dimension (time-
independent) Physical meaning of wave function Schrodinger equation for Hydrogen atom (No
derivation. Only 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 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

UNIT 3 ELECTROCHEMISTRY 9 Hrs.


Electrochemistry: Galvanic cell - Electrochemical cell representation - EMF series and its significance.
Batteries: Terminology Mechanism of Lead-acid accumulator - Mechanism of Nickel-Cadmium batteries
- Mechanism of Lithium batteries: Li/SOCl2 cell - Li/I2 cell - Lithium ion batteries - Mechanism of Fuel
Cells: Hydrogen-oxygen fuel cells - Solid oxide fuel cell (SOFC).

UNIT 4 CORROSION SCIENCE 9 Hrs.


Introduction Definition Types - Dry corrosion: Mechanism Pilling - Bedworth rule - Wet corrosion:
Mechanism Types - Galvanic corrosion and differential aeration cell corrosion - Galvanic series and its
significance - Factors influencing corrosion - Corrosion prevention - Material selection and design -
Cathodic protection Sacrificial anodic method and Impressed current method Inhibitors Anodic and
Cathodic inhibitors.

UNIT 5 CHEMISTRY OF MATERIAL SCIENCES 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 alloy 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 nano particles
by chemical reduction method Applications of nanoparticles in medicine.

Max. 45 Hrs.

B.E/B.Tech REGULAR REGULATIONS 2023


5
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Apply the principles of quantum chemistry for energy level quantisation in molecules.
CO2 - Analyse the molecular transitions by interaction of EMR with matter
CO3 - Assess the reaction mechanism in electrochemical storage device
CO4 - Comprehend the corrosion mechanism for environmental sustainability and examine the
mechanism of corrosion for mitigation.
CO5 - Interpret the role of phase diagram/ fuels/ nanoparticles in chemical/ material science.
CO6 - Apply the concept of chemical science in real world applications.

TEXT / REFERENCE BOOKS


1. A.K.Chandra, Introductory Quantum Chemistry , Tata McGraw-Hill, 4th edition, 2019.
2. Ira N. Levine, hemistry , 6th Edition, 2018.
3. hemistry , 7th Edition, 2013.
4. David W. Ball and Thomas Baer, Physical Chemistry , Wadsworth Cengage Learning, 2nd
Edition, 2014.
5. Mars G Fontana, Corrosion Engineering , 3rd Edition, Tata McGraw Hill, 2018.
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. David Linden, Thomas B Reddy, Handbook of Batteries , 4th Edition, McGraw-Hill, 2010.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


6
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

ELECTRICAL AND ELECTRONICS L T P EL Credits Total Marks


SEEB1101
ENGINEERING 3 0 0 0 3 100

COURSE OBJECTIVES
To understand the fundamental concepts of electrical wiring and its components.
To analyse DC and AC circuit behaviour.
To impart knowledge on electronic devices and their applications.
To gain knowledge on operation of UPS and SMPS power supplies.

UNIT 1 INTRODUCTION TO ELECTRICAL SYSTEMS 9 Hrs.


Basic element resistors, inductors and capacitors - Domestic wiring - Wiring materials and accessories -
Staircase wiring - Fluorescent tubes Earthing - Types and benefits.

UNIT 2 DC CIRCUITS 9 Hrs.


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 3 AC CIRCUITS 9 Hrs.


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.

UNIT 4 SEMICONDUCTOR DEVICES 9 Hrs.


VI Characteristics of PN-junction diodes and Zener diodes - BJT and its configurations Input/output
characteristics - Junction Field Effect Transistor Drain and transfer characteristics - Silicon Controlled
Rectifiers.

UNIT 5 POWER SUPPLY 9 Hrs.


Introduction to power supplies - Regulated power supplies - Single and dual regulated power supply -
Design using regulator IC - Switched Mode Power Supply( SMPS) - Design used in Computer systems -
Introduction to Uninterrupted Power Supply(UPS ) - Online UPS - Offline UPS - High frequency online
UPS.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Understand the fundamental electrical concepts.
CO2 - Analyze simple DC circuits using appropriate techniques.
CO3 - Apply phasor analysis techniques to solve AC circuits.
CO4 - Demonstrate the characteristics of various semi-conductor devices.
CO5 - Analyze characteristics of switched mode power supply.
CO6 - Design power supply unit using regulator IC.

B.E/B.Tech REGULAR REGULATIONS 2023


7
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Dr. Ramana Pilla, Dr. M Surya Kalavathi and Dr. G T Chandra Sekhar, Basic Electrical Engineering ,
S.Chand and Co.,2022.
2. Dr.Sanjay Sharma, Electronic Devices and Circuits , 2nd Edition, S.K.Kataria and Sons,2012.
3. B.N.Mittle and Aravind Mittle, Basic Electrical Engineering , 2nd Edition, Tata McGraw Hill,2011.
4. Smarajit Ghosh, Fundamentals of Electrical and Electronics Engineering , 2nd Edition, PHI
Learning PrivateLtd, 2010.
5. B.L.Theraja, Fundamentals of Electrical Engineering and Electronics ,1st Edition, S.Chand and
Co.,2009.
6. G.K.Mithal, Basic Electronic Devices and Circuits , 2nd Edition, G.K.Publishers Pvt, 2008.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


8
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


S11BLH11 PROGRAMMING IN C
2 0 4 0 4 100

COURSE OBJECTIVES
To understand the concepts of variables, operators, control structures and arrays.
To gain knowledge on functions, structures and union in C.
To explore the concepts of pointers and files to create real world applications using C.

UNIT 1 BITS AND BYTES IN COMPUTING 12 Hrs.


Computers: Hardware Software Processor Memory I/O devices Interface Programming
Languages Evolution from COBOL, FORTRAN to C, Python Need
Algorithms: Role in problem solving Analysis Design Flowcharts: Role in problem solving Symbols
Design Pseudo code: Role in problem solving Design Program: Role in problem solving Design
Practical:
Describe a simple real world problem in your domain of interest and describe it in the form of
problem statement, input, output and provide its solution in terms of algorithm, flowchart, pseudo
code and program.

UNIT 2 C: MATH BEHIND CODING 12 Hrs.


C: Structure of program Character set Tokens Keywords Identifiers Constants Variables
Data types Strings Operators and its types Functions Header Files
Algorithmic Strategies: Iteration and Recursion Efficiency Role of time and space consumption while
building an algorithm Complexities
Practical:
Describe a simple real world problem in your domain of interest and provide a computing and
non-computing solution for the same. Calculate the time and space consumed in both solutions.
Compare and contrast the pros and cons in both solutions.
Write an algorithm, flowchart, pseudo code followed by a simple C code to do find the Factorial
and Fibonacci series using both iteration and recursion.
Input the number of days taken to cultivate both rice and wheat in turns in an agricultural land
from the user. Write a C program to display the days as years, months and days using simple
operators.
You have a circular plot for building playground and a rectangular plot for building an apartment.
Get the input from the user for both plots and write a C program to calculate the area and
perimeter of both plots.

UNIT 3 C: MAGIC BEHIND INSTANT OUTPUTS 12 Hrs.


Advanced coding concepts: Decision Making using branching statements and its types Decision making
using looping statements and its types Switch statements Break Continue Goto Jump
statements.
Case Study: Fun with Code -- Printing Alphabets / Flags of Countries / Flying Alphabet Screensaver.
Practical:
Describe a problem statement in your domain of interest whose solution involves repetition of
same steps and provide code as solution involving for, while and do while loops.
Describe a problem statement in your domain of interest whose solution involves decision making
and provide code as solution involving if-else, nested if-else and ladder if-else.
Develop a simple scientific calculator using Switch case statement.
A Cartesian co-ordinate system has four quadrants. Write a C program to find the quadrant of
the co-ordinate points given by the user using both if-else and nested if-else control structure.
Given a rose flower to you, dismantle the petals of the flower from inside, if you notice - it follows

B.E/B.Tech REGULAR REGULATIONS 2023


9
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

the sequence of Fibonacci. Now, try to arrange the word "PIZZA" in several ways without
repeating and calculate number of ways it can be done using factorial concept. Write a C program
to find both Fibonacci and factorial by getting the mentioned input.
1. Product of two large prime numbers is used as encryption key in encryption algorithms. Write a
C program to display all the prime numbers between 1 and 100 and give the first two largest
numbers as the output.

UNIT 4 STORING GROUP OF HOMOGENOUS ELEMENTS: ARRAYS 12 Hrs.


Diving into Arrays: Definition Syntax Types Representation: Row and Column Order Dynamic
Arrays.
Idea behind functions: Declaration Definition Types Calling Arguments Prototypes Call by
Value Call by Reference Pointers Amalgamation of Pointers with Arrays and Strings.
Case Study: Fun with Code Simple Game development using Arrays and Functions.
Practical:
Describe a problem statement in your domain of interest where you need to work with group of
same type of data. Provide a solution in terms of C program to store and manage the data
effectively.
You're playing UNO cards, suddenly a person is getting rev card. Write a C program to reverse
the round by storing the number of players in array.
Write a C program for Vehicle Regulation System where odd number ending vehicles can use
the road on odd days and even number ending vehicles can use the road on even days using
two separate arrays to store and display the odd and even numbers.
Write a C program to do the following applications in array:
a. (i). Get set of positive and negative integers from the user; replace positive integers by
0 in the array.
b. (ii). Reverse the floating point numbers stored in the array.
c. (iii). Return the smallest value and largest value position in the array.
d. (iv). Search the number '5' in array and replace it with '10'
Write C program to do the following string handling applications.
a. (i). Get favourite actor and actress name, concatenate it and display
b. (ii). Display your name in uppercase, lowercase and as fname and lname.
c. (iii). Count the frequency of "the" in any sentence and delete it from sentence.
d. (iv). Check whether the given string is a palindrome or not.
Write a C program for counting the total number of duplicate elements in an array; print all the
unique elements in the same array as two different functions.
Write a C program to sort the elements in an array in both ascending and descending order using
two different functions.
Write a C program to find the largest and smallest number in an array using recursion and to
convert the output into a binary number.
Write a C program to swap two numbers using two functions, one using pointers and the other
one without using pointers.

UNIT 5 STORING GROUP OF HETROGENOUS ELEMENTS: STRUCTURE 12 Hrs.


Outset of Structure and Union: Structure definition and declaration Structures fusion with Arrays Pointers
Functions Union initiation, Definition and declaration Memory allocation- Static and dynamic
Working with Files: File handling functions Read Write Other operations Different file types
Case Study: Report on using file functions to create score board for any game, importing it to program
Practical:
Describe a problem statement in your domain of interest where you need to work with group of
different type of data. Provide a solution in terms of C program to store and manage the data
effectively.

B.E/B.Tech REGULAR REGULATIONS 2023


10
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

Write a C program to get the details of the student (roll no, name, date of birth, state, 10th
percentage and 12th percentage) using structure. Calculate the age of the student and display
the eligibility status for his admission.
a. Eligibility criteria: more than 60 percent in 10th and 12th, age>=17, state==TN.
Write a menu driven C program for library management system with ten entries:
a. (i). Add Book (ii). Add Author (iii). Add Category (iv). Book Cos
(v). Display - Book by Author, Book by Category, Book under cost
Write a C program to create an employee Union with employee details (id, name, salary) Accept
the details of 'n' employees, rearrange the data in ascending order of employee name, id and
salary as three different functions and display it.
Complex Practice Problems
Design a C program by creating your own header file for any function of your choice and display
the output by calling the header file.
Create TIC-TAC-TOE game using C Language.
Given a situation, you are going to ATM to withdraw money. Write a C program, get the money
requested from the user as input and display the number of possible bank notes for the requested
money. Note: Give input as number ending in 0's or 5's.
Develop a C program for managing Car Rental process with various modules for registration as
new user, login, get id proof, keep track of cars available and cars given for rental.
Create SUDOKU game using C Language.

Max. 60 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Interpret the difference between components of problem solving such as algorithm, flowchart,
pseudo code and source code.
CO2 - Build simple solutions for any given problem statement using various components of problem
solving techniques and measure its efficiency in terms of time and space.
CO3 - E types, Operators.
CO4 - Design applications using different core concepts such as Arrays and Functions in C language.
CO5 - Formulate real time solutions through programs using Structure and Union in C language.
CO6 - Develop various applications for solving real time societal problems.

TEXT / REFERENCE BOOKS


1. 14th Edition, 2019.
2. Pearson Education, 2008..
3. Hill Publications, 8th Edition, 2019.
4. 3rd Edition, 2013.

B.E/B.Tech REGULAR REGULATIONS 2023


11
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCYB2101 CHEMISTRY LAB
0 0 2 0 1 50

COURSE OBJECTIVES
To understand the basic principle involved in volumetric and instrumental analysis.
To acquire practical knowledge in pHmetry, potentiometry and conductometry.
To develop the skill in water analysis.

SUGGESTED LIST OF EXPERIMENTS


1. Estimation of mixture of acids by conductometry.
2. Estimation of ferrous ion by potentiometry.
3. Determination of pKa value of glycine by pHmetry.
4. Estimation of hardness of water by EDTA method.
5. Determination of alkalinity of water.
6. Estimation of Iron by photocolorimetry.
7. Estimation of copper in brass.
8. Determination of high molecular weight polymer using Ostwald viscometer.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Estimate the ionic conductance of mixture of acids.
CO2 - Construct a redox cell for the emf measurement.
CO3 - Interpret the concept of Zwitter ion in amino acids.
CO4 - Predict the quality of water sample for domestic and industrial applications.
CO5 - Demonstrate the validity of Beer-
CO6 - Apply Poiseu

TEXT / REFERENCE BOOKS


1. th Edition. Persons Education

2004.
2. S. S. Dara, Experiments and Calculations in Engineering Chemistry, S. Chand and Co. 2010.

B.E/B.Tech REGULAR REGULATIONS 2023


12
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

ADVANCED CALCULUS AND L T P EL Credits Total Marks


SMTB1201
STATISTICS 3 1 0 0 3 100

COURSE OBJECTIVES
To identify, reflect upon, evaluate and achieve conceptual understanding and knowledge of
traditional calculus to form independent judgements.
To model the engineering problems and obtain its solutions mathematically.
To understand science, engineering and computer science analytically and logical thinking is
attained.

UNIT 1 DIFFERENTIAL EQUATIONS 9 Hrs.


Higher order linear differential equations with constant coefficients Particular Integral for eax, sinax or
cosax, xn, xneax, xsinax, xcosax, eaxsinbx or eaxcosbx Method of Variation of Parameters

UNIT 2 VECTOR CALCULUS 9 Hrs.


Vector Differentiation - Gradient, divergence and curl Directional derivative Irrotational and Solenoidal
vector fields-Vector Integration Simple problems on line, surface and volume Integrals
Simple
applications involving cubes and rectangular parallelopipeds.

UNIT 3 LAPLACE TRANSORMATION 9 Hrs.


Laplace transform Transforms of standard functions properties Transforms of derivatives and
integrals Transforms of the type eatf(t), tf(t), f(t)/t Transform of periodic functions Transform of unit
step function and impulse function Inverse Laplace transforms Convolution theorem Initial and
final value theorems Applications - Linear ordinary differential equation with constant coefficients.

UNIT 4 BASIC CONCEPTS OF PROBABILITY AND STATISTICS 9 Hrs.


Measures of central tendency: Mean, Median, Mode Measures of dispersion: Standard deviation for
discrete and grouped data. Definitions: Sample Space, Events Addition Law of probability
Multiplication law of probability Conditional probability Baye

UNIT 5 THEORY OF SAMPLING AND TESTING OF HYPOTHESIS 9 Hrs.


Test of Hypothesis Large samples Z test Single proportion Difference of proportions Single
mean Difference of means Small samples Single mean Difference of means
Test of variance Chi square test: Goodness of fit, Independence of attributes.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Solve any higher order linear differential equations.
CO2 - Apply concepts of calculus on vector and scalar valued functions.
CO3 - Use Laplace Transform for transformation of functions.
CO4 -
CO5 - Analyze the concept of testing of hypothesis in small, large samples.
CO6 - Construct the Chi-Square test for goodness of fit and independence of attributes of real data.

B.E/B.Tech REGULAR REGULATIONS 2023


13
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. L.Ross, Differential Equations , 3rd Edition, Wiley India, 2009.
2. Bali N.P and Manish Goyal, A Text book of Engineering Mathematics , 8th Edition, Laxmi
Publications Pvt Ltd., 2011.
3. Veerarajan T, Engineering Mathematics for First Year , 2nd Edition, Tata McGraw Hill Publishers, 2008.
4. Erwin Kreyszig, Advanced Engineering Mathematics , 10th edition, John Wiley and Sons, Singapore,
2012.
5. Grewal B.S., Higher Engineering Mathematics , 41st Edition, Khanna Publications, Delhi, 2011.
6. Venkataraman M.K., Engineering Mathematics First Year , 2nd Edition, National Publishing Co.,
2000.
7. Veerarajan T, Probability, Statistics and Random Process , 4th Edition, Tata McGraw Hill, 2014.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


14
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SPHB1101 PHYSICS
3 0 0 0 3 100

COURSE OBJECTIVES
To understand the concept of crystal structures and symmetry, the physics of scattering and
diffraction theory, experimental diffraction from single crystals, instrumentation and powder
diffraction.
To understand and describe properties of matter, including: flexibility, strength and transparency.
To develop a working knowledge of the laws and methods of thermodynamics and elementary
statistical mechanics and to use this knowledge to explore various applications.
To differentiate between various acoustic terms and understand how these apply to different
materials and acoustic design solutions.
To gain knowledge about semiconductor physics and discus working and applications of basic
devices, including p-n junctions, BJTs and FETs.

UNIT 1 QUANTUM MECHANICS 9 Hrs.


Introduction to Quantum mechanics-Energy distribution function, Wave particle duality - De Broglie
matter waves Concept of wave function and its physical significance
Principle tion Time independent and Time dependent equations Particle
in a one dimensional rigid box Tunnelling (Qualitative) Scanning Tunnelling Microscope (STM).

UNIT 2 PROPERTIES OF MATTER 9 Hrs.


Introduction- Elasticity- - Torsional stress and deformations Twisting couple Torsion
pendulum - theory and experiment bending of beams - bending moment cantilever:-Theory and
experiment uniform and non-uniform bending: theory and experiment- Magnetism - Basic definitions -
Magnetic permeability, susceptibility, relation between permeability and susceptibility - Bohr magneton.
Classification of magnetic materials-Hysteresis

UNIT 3 CRYSTAL PHYSICS 9 Hrs.


Single crystalline, polycrystalline and amorphous materials single crystals: unit cell, crystal systems,
Bravais lattices, directions and planes in a crystal, Miller indices inter-planar distances coordination
number and packing factor for SC, BCC, FCC, HCP. crystal imperfections: point defects, line defects
growth of single crystals: solution and melt growth techniques.

UNIT 4 SEMICONDUCTOR PHYSICS 9 Hrs.


Classification of materials-Theory of semiconductors: Intrinsic and extrinsic semiconductors, band
structure of semiconductors - Fermi level in intrinsic and extrinsic semiconductors - Theory of p-n
junctions diode and transistor: p-n junction under thermal equilibrium, forward bias, reverse bias, carrier
density - V-I characteristics, junction capacitance and voltage breakdown -Zener diode and its
characterisation- Avalanche breakdown- JEFT- I-V characteristics- amplifying and switching.

UNIT 5 LASER AND ITS APPLICATIONS 9 Hrs.


Absorption and Emission of Radiation by atoms, ions and molecules - Laser medium Phenomenon of
population inversion - Laser cavity (fiber laser, and other cavities), generation of coherent beam, Q-
switching - Short pulse generation - power amplification - Basic Laser Principles: Theory of Laser -
Properties of Laser - Fundamental Optical properties - Modified Optical properties - Laser output its
characteristics.

Max. 45 Hrs.

B.E/B.Tech REGULAR REGULATIONS 2023


15
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Solve the time independent Schrodinger wave equation for a particle in a box to obtain the Eigen
values and Eigen functions.
CO2 - Understand the dual nature of radiation and matter.
CO3 - Estimate the atomic packing factor for SC, BCC and FCC structures.
CO4 - Recognize sound level descriptors and how they are used in architectural acoustics and analyse
acoustic properties of typically used materials for design consideration.
CO5 - Understanding the working, design considerations and applications of various semiconducting
devices including p-n junctions, BJTs and FETs.
CO6 - Demonstrate an understanding of optical fiber communication link, structure, propagation and
transmission properties of an optical fiber.

TEXT / REFERENCE BOOKS


1. Pillai S.O., Solid state Physics , New age International Publishers, 7th Edition.
2. Arthur Beiser, Concepts of Modern Physics , Tata McGraw Hill Publications.
3. M.N.Avadhanulu and A text book of Engineering Physics , S. Ch.Publishing.
4. B. B.Laud, Lasers and nonlinear optics , New age International Publishers, II-Edition.
5. R. Murugesan, Modern Physics , S. Chand Publishing, 15th Edition (2015).
6. D. S. Mathur, Elements of Properties of Matter , S. Chand Publishing (2014).
7. A. K. Bandyopadhyay, Nanomaterials , New age International Publishers.
8. K. K. Chattopadhyay, Introduction to Nano Science and
9. Sulabha Kulkarni, Introduction to Nanoscience and Nanotechnology 2nd Edition.
10. David Griffiths, Introduction to Electrodynamics , Addison-Wesley publishing, 3rd Edition.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


16
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB1201 DATA STRUCTURES
3 1 0 0 3 100

COURSE OBJECTIVES
To understand concepts of linked list, searching and sorting techniques.
To implement basic concepts of stacks and queues.
To develop the ability to solve problems by choosing and applying the right data structures.

UNIT 1 INTRODUCTION 9 Hrs.


Introduction to Data Structures - Need - Classification-Arrays - 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 -Advantages and disadvantages of singly linked list - Circular linked list -
Doubly linked list.

UNIT 2 STACK AND QUEUE 9 Hrs.


Basic Stack Operations - Representation of a Stack using Arrays - Algorithm for Stack Operations - Infix
to postfix Transformation - Evaluating Arithmetic Expressions.
Basic Queue Operations - Representation of a Queue using array - Enqueue - Dequeue - Circular
Queues - Priority Queues.

UNIT 3 TREES 9 Hrs.


Trees- Binary Trees - Properties of Binary trees -Implementation using Array and Linked list - Recursive
and Non-Recursive Binary Tree traversals - Binary Search Tree - Insertion and Deletion

UNIT 4 GRAPHS 9 Hrs.


Graph - Representation using Array and Linked List - Types of graphs - Graph traversals - BFS and DFS
-Minimum Spanning Tree - -
Floyd Warshall Algorithm.

UNIT 5 SEARCHING AND SORTING TECHNIQUES 9 Hrs.


Basic concepts - 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 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Comprehend the concepts of data structures and choose the appropriate data structure to the
problem definition.
CO2 - Design applications of linear data structures.
CO3 - Apply appropriate algorithms for solving problems like sorting, searching.
CO4 - Implement the various non-linear data structures and perform the intended operations.
CO5 - Demonstrate the representation and traversal techniques of graphs and their applications.
CO6 - Apply the learned algorithm, data structures to solve problems.

B.E/B.Tech REGULAR REGULATIONS 2023


17
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Jean-Paul Tremblay, Paul G. Sorenson, An Introduction to D ,
TMH, 2017.
2. nd Edition.

3. Larry R. Nyhoff, ADTs, Data Structures, and Problem Solving with C++ , Pearson Education,
2009.
4. MIT Press, 4th Edition,
2022.
5. Goodrich MT, Tamassia R, Goldwasser MH. Data structures and Algorithms in Python John
Wiley and Sons Ltd; 2013.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


18
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


S11BLH21 PROGRAMMING IN PYTHON
3 0 2 1 4 100

COURSE OBJECTIVES
To learn data structures concepts like lists, tuples, and dictionaries in Python.
To build packages with Python modules for reusability and handle user/custom exceptions.
To create real world GUI applications, establish database connectivity and networking.

UNIT 1 INTRODUCTION TO PYTHON 12 Hrs.


History of Python- Introduction to the IDLE interpreter (shell) - Data Types - Built-in functions Conditional
statements - Iterative statements- Input/output functions - Python Database Communication - Data
analysis and visualization using Python.
Practical:
Implement built-in functions and trace the type of data items.
Implement concepts of Conditional and Iterative Statements.
Use the built-in csv module to read and write from a CSV file in Python.
Perform data analysis and visualization on a given dataset using Python libraries like pandas,
numpy, matplotlib and display charts, graphs, and plots.

UNIT 2 OBJECT ORIENTED CONCEPTS 12 Hrs.


Class Objects Constructors Polymorphism Encapsulation -Inheritance -Data Abstraction- Method
Overloading-Method Overriding-Database Access-Data Hiding-Import Class.
Practical:
Execute concepts on Polymorphism, Encapsulation.
Implement Data Abstraction and Inheritance.
Differentiate Method Overloading and Overriding.
Create a class called "Person" with attributes "name" and "age." Make the "age" attribute private
and implement a getter method to access it.
Create a module called "math_operations.py" with a class called "Calculator." Import the
"Calculator" class into another script and use its methods to perform mathematical operations.

UNIT 3 FILES AND EXCEPTIONS HANDLING, MODULES, PACKAGES 12 Hrs.


File Operations Iterators - Exception handling - Regular Expressions- Functions and modules-Import
Statement Introduction to PIP-Installing Packages via PIP-Using Python Packages.
Practical:
Create a text file called "numbers.txt" and write the numbers from 1 to 10 in words, each on a
separate line.
Implement a custom iterator that generates a sequence of Fibonacci numbers and print the first
10 numbers.
Create a try-except block to catch a File Not Found Error and print a message when a file is not
found.
Write a Python program that handles a Zero Division Error and prints a custom error message to
the console.
Create a module called "greetings.py" with a function called "hello" that prints "Hello, World!"
Import the module into another script and use the "hello" function.
Install the numpy package using PIP, import the package and create a numpy array with random
values.

B.E/B.Tech REGULAR REGULATIONS 2023


19
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

UNIT 4 GUI PROGRAMMING 12 Hrs.


GUI programming in Python - Introduction to GUI library - Layout management - Events and bindings - Fonts
Colors - Canvas - Widgets (frame, label, button, check box, entry, list box, message, radio button, text, spin
box).
Practical:
Design a GUI form with a vertical box layout that includes labels and entry fields for user
registration information.
Create a GUI window with a grid layout that contains buttons representing a 3x3 game board.
Create a canvas in your GUI program and draw simple shapes such as rectangles, circles, and
lines.
Create a GUI form program that includes various widgets and implement event handling
Concepts also add Create a drop-down menu that allows users to select different font styles for
text display.

UNIT 5 DATABASE AND NETWORK 12 Hrs.


Database (using NoSQL): Connector Module Cursor Statements - Exceptions in database. Network
connectivity: Socket module - Client Server Email URL Access.
Practical:
Connect to the NoSQL database using a Python connector module, such as "pymongo" for
MongoDB or "cassandra-driver" for Cassandra.
Use a cursor to iterate over the records in a collection/table and print specific fields/attributes.
Implement error handling for specific scenarios, such as duplicate key violation or record not
found, in the NoSQL database.
Implement either a TCP/IP or UDP client-server application using the socket module for sending
and receiving messages.
Write a program using the smtplib module to send an email from a specified email address to
another recipient.

Max. 60 Hrs.

COURSE OUTCOMES
On Completion of the course the student will able to
CO1 - Describe the numbers, math functions, strings, list, tuples and dictionaries in Python.
CO2 - Develop simple applications in Python using object oriented programming concepts.
CO3 - Design GUI applications in Python and evaluate different database operations.
CO4 - Design client server network applications using Python.
CO5 - Design solutions to real life problems.
CO6 - Apply the best features of mathematics, engineering and natural sciences to program real life
problems.

TEXT / REFERENCE BOOKS


1. R. Nageswara Rao 3rd Edition, 2021
2.
3. Python Notes for Professionals by Stack Overflow Documentation
(https://books.goalkicker.com/PythonBook/).
4. -
5.
nd Edition,2014.

B.E/B.Tech REGULAR REGULATIONS 2023


20
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

ENGINEERING DRAWING AND L T P EL Credits Total Marks


SMEB2102
DESIGN 0 0 4 0 2 100

COURSE OBJECTIVES
To understand the concept of graphic communication, develop the drawing skills for communicating
concepts, ideas and designs of engineering products and to expose them to existing national
standards related to technical drawings.
To make the student to visualize and read the drawings.
To make the students to understand the importance of sectioning and development of surfaces.
To learn about the orthographic and pictorial projections.

CONCEPTS AND CONVENTIONS


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

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

PROJECTION OF POINTS AND LINES


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.

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

SECTION OF SOLIDS
Purpose of sectioning - Sectional views - Hatching - Section plane perpendicular to one plane and parallel
to other plane -Section plane inclined to HP-True shape of the section.
Practicing three-dimensional modeling of simple objects by CAD Software (Not for examination).

DEVELOPMENT OF SURFACES AND FREEHAND SKETCHING


Need for development of surfaces - Types of development of surfaces - Development of lateral surfaces
of simple and sectioned solids - Prisms, pyramids, cylinders and cones.
Orthographic Projection-: Visualization concepts and Free Hand sketching: Visualization principles -
Representation of Three Dimensional objects - Layout of views- Freehand sketching of multiple views
from pictorial views of objects.
Practicing three-dimensional modeling of simple objects by CAD Software (Not for examination).

B.E/B.Tech REGULAR REGULATIONS 2023


21
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

COURSE OUTCOMES
On completion of the course, students will be able to
CO1 - Identify the national standards related to the Engineering drawing based on BIS and construct
conic sections and polygons.
CO2 - Solve practical problems involving projection of 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.

TEXT / REFERENCE BOOKS


1. Charotar Publishing House, 53rd Edition,
2019.
2.
2018.
3.
Limited,2018.
4. Engineering drawing practice for schools and colleges, SP 46 1988 (http:// web.iitd.ac.in
/~achawla / public_html / 201/ lectures/sp46.pdf).

PUBLICATION OF BUREAU OF INDIAN STANDARDS


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

(Note: Only after submission of all drawing sheets prescribed by staff member, the students will
be allowed for End Semester practical examination.)

B.E/B.Tech REGULAR REGULATIONS 2023


22
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SPHB2101 PHYSICS LAB
0 0 2 0 1 50
COURSE OBJECTIVE
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.

SUGGESTED LIST OF EXPERIMENTS


1. To determine the rigidity modulus of a given wire by Torsional pendulum.
2. To determine the angle of minimum deviation by I - D curve method.
3. To determine V-I characteristics of a photodiode.
4. To determine the numerical aperture of an optical fibre.
5. To find the energy gap of a semiconductor.
6. - non-uniform bending.
7. - uniform bending.
8. Determination of the wave length of the laser using grating- Laser.
9. Determination of thickness of a thin sheet/wire- Air wedge.
10. Determination of numerical aperture and acceptance angle- optical fibre.
11. Photoelectric effect.
12. Michelson interferometer.
13. V-I characterisation of solar cell.
14. CRO- functions.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Measure the rigidity modulus of a given wire by oscillations.
CO2 - Measure the angle of minimum deviation by spectrometer.
CO3 - Analyse the I-V characteristics of the given photo diode.
CO4 - Measure the band gap of the given semiconductor.
CO5 -
CO6 - Determine the wavelength of the given laser light source.

B.E/B.Tech REGULAR REGULATIONS 2023


23
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total marks


SCSB2201 DATA STRUCTURES LAB
0 0 4 0 2 100

SUGGESTED LIST OF EXPERIMENTS

1. In a marketplace, there are multiple places that sell pineapple at different size and cost. Implement
a program to find the place that sells quality pineapple with largest size and minimum cost by
getting the size and cost in array.
2. To use undo operation in a Microsoft Word, the machine needs to remember the list of states and
operations made. To implement this in real time write a detailed program with set of insertion and
deletion operation functions.
3. Spotify app uses playlist where the song can be changed in both directions to play the next and
previous songs in the list. To implement this concept in real time, write a detailed program with set
of insertion and deletion operation functions.
4. Implement the problem of Towers of Hanoi a critically acclaimed mathematical implementation
with the use of Stack data structure. Implement all of its operation.
5. To manage the queuing system of ticket counter in SKY cinemas implement the queue data
structure with all of its corresponding operations.
6. To organize a traffic light management system based on number of vehicles on each side,
implement a circular queue data structure algorithm along with its respective operations.
7.
the same expression into machine readable form.
8. To sort the contact names in your phone in ascending order based on the first name using insertion
sort algorithm.
9. To sort the students in the class according to their heights for group photo in descending using
quick sort algorithm.
10. To sort the chocolates in the supermarket based on its cost and size in ascending order using
merge sort algorithm.
11. Implement the Linear Search and Binary Search methods in two programmes to discover any given
element inside the provided range of numbers, and compare the results to determine which
algorithm is faster and/or uses less space.
12. Write a programme to visit every restaurant along the route when travelling from Chennai to
Pondicherry through creating a binary tree for the purpose.
13. Write a program
a. To find the nearest restaurants from your location by implementing Breadth First Search
traversal algorithm.
b. Implement the Depth First Search traversal algorithm to find the cycles in any given graph.
14. By applying the minimal spanning tree technique, you can implement an intercom system to
connect all the departments in your college with the least amount of wiring.
15. Implement any shortest path algorithm to discover the shortest route between Chennai and
Hyderabad.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Implement programs using array and linked list data structures by mapping it to daily pursuits.
CO2 - Formulate programs for algorithms based on stack and queue data structure and its

B.E/B.Tech REGULAR REGULATIONS 2023


24
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

application.
CO3 - Demonstrate the process of sorting that happens in daily activity by implementing various
sorting algorithms.
CO4 - Compare and contrast the difference in time and space complexity for Linear and Binary search
algorithm.
CO5 - Develop graph and tree traversal algorithms for real time application.
CO6 - Design shortest path finding algorithms for real time societal problems.

B.E/B.Tech REGULAR REGULATIONS 2023


25
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

DISCRETE MATHEMATICS AND L T P EL Credits Total Marks


SMTB1302
NUMERICAL METHODS 3 1 0 0 3 100

COURSE OBJECTIVES
To identify, reflect upon, evaluate and achieve conceptual understanding and knowledge of
traditional calculus to form independent judgements.
To model the engineering problems and obtain its solutions mathematically.
To understand science, engineering and computer science analytically and logical thinking is
attained.

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 AND GROUP THEORY 9 Hrs.


Basic concepts of Set theory- Laws of Set theory- Partition of set - Relations- Types of Relations: Equivalence
relation - Partial order in relation - Graphs of relation- Hass diagram, Groups Properties of groups Semi group
and Monoid (definition and examples only) Subgroups, Cosets Lagrange theorem.

UNIT 3 GRAPH THEORY 9 Hrs.


Introduction to graphs Graph terminology representation of graphs Graph isomorphism
Connectivity Euler and Hamilton paths - Tree Binary tree Expression tree.

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 and Gauss Seidel Method.

UNIT 5 NUMERICAL INTERPOLATION, DIFFERENTATION AND 9 Hrs.


INTEGRATION

intervals
second order derivatives Numerical rd

3/8th rule.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Apply logic and truth tables to solve problems on Inference theory for propositional calculus
and predicate calculus. Distinguish PCNF and PDNF.
CO2 - Explain the concept of set theory and group theory.
CO3 - Develop Euler, Hamiltonian paths. Identify graph isomorphism.
CO4 - Formulate numerical solution of algebraic, transcendental and simultaneous linear equations.
CO5 - Appraise various numerical methods for Interpolation.
CO6 - Develop the solutions for Numerical differentiation and integration.

B.E/B.Tech REGULAR REGULATIONS 2023


26
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Kenneth H.Rosen, Discrete Mathematics and its Applications , 6th Edition, McGraw- Hill,
2007.
2. Veerarajan T., Discrete Mathematics with Graph Theory and Combinatorics , Tata Mcgraw
Hill Publishing Co., New Delhi, 2006.
3. Narasingh Deo, Graph Theory with Application to Engineering and Computer Science ,
Prentice Hall India, 2010.
4. Steven C .Chapra, Raymond P. Canale, Numerical Methods for Engineers , Tata McGraw
Hill Publishing Co., New Delhi, 2003.
5. Kandasamy P., Thilagavathy K., and Gunavathy K., Applied Numerical Methods , S. Chand
and Co., New Delhi, 2003.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


27
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

COMPUTER ARCHITECTURE AND L T P EL Credits Total Marks


SCSB1301
ORGANIZATION 3 0 0 0 3 100

COURSE OBJECTIVES
To impart knowledge on ALU and its operations.
To understand the types of memory organizations, interface and communication in I/O devices.
To analyse the characteristics, structure, communication and synchronization of multiprocessors.

UNIT 1 GENERAL REGISTERS 9 Hrs.


Introduction - General Register Organization - Stack organization - Basic computer Organization -
Instruction codes - Computer Registers - Computer Instructions - Instruction Cycle.

UNIT 2 ARITHMETIC LOGIC UNIT AND COMPUTER ARITHMETIC 10 Hrs.


Introduction to ALU - Arithmetic Logic - Shift Micro operations - Arithmetic Logic Shift unit - Example
Architectures: MIPS RISC CISC - Addition - Subtraction - Multiplication and Division algorithms -
Floating Point Arithmetic operations - Micro programmed Control- Design of Control unit.

UNIT 3 MEMORY ORGANIZATION 8 Hrs.


Memory Hierarchy - Main memory - Auxiliary Memory - Associative Memory - Cache Memory - Virtual
memory.

UNIT 4 INPUT - OUTPUT ORGANIZATION 9 Hrs.


Peripheral Devices - I/O Interface - Modes of transfer - Priority Interrupt - DMA - IOP - Serial
Communication.

UNIT 5 CHARACTERISTICS OF MULTIPROCESSORS 9 Hrs.


Interconnection Structures - Interprocessor Arbitration - Interprocessor Communication and
Synchronization - Cache coherence.

Max.45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Classify the various types of registers, microinstructions and addressing modes.
CO2 - Explain Arithmetic Logic Unit and computer arithmetic operations.
CO3 - Infer the usage of Memory Organization.
CO4 - Describe about the I/O devices and organization.
CO5 - Explain the interconnection structures and interprocessor communication.
CO6 - Describe the characteristics and synchronization of multiprocessors.

B.E/B.Tech REGULAR REGULATIONS 2023


28
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. rd Edition, Prentice-Hall Publishers, 2017.

2.
3.
2001.
4. th Edition,

McGraw-Hill, 2002.
5. -
Edition, Prentice Hall, 2013.
6. John P Hayes, Computer Architecture Organization, McGraw Hill, 4th Edition, 2003

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


29
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SISB4301 UNIVERSAL HUMAN VALUES
2 0 0 3 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, 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? -
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 fulfillment 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 fulfill 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-
8. - happiness and physical facility
9.
10. Understanding the char
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.

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.

B.E/B.Tech REGULAR REGULATIONS 2023


30
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

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

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.

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
On completion of the course, the student 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 - To have better critical ability.
CO4 - To become sensitive to their commitment towards what they have understood (human values,
human relationship and human society).
CO5 - 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.

B.E/B.Tech REGULAR REGULATIONS 2023


31
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / 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).

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

B.E/B.Tech REGULAR REGULATIONS 2023


32
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB1303 THEORY OF COMPUTATION
3 1 0 0 3 100

COURSE OBJECTIVES
To introduce automata theory, regular languages, context free languages and recognizers for
different languages.
To design Turing machines for various languages.
To gain knowledge on unsolvable problems.

UNIT 1 FINITE AUTOMATA AND REGULAR LANGUAGES 9 Hrs.


Finite automata and regular languages - Regular languages and regular expressions - Finite automata -
Non- - 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 - s - 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 Hrs.

COURSE OUTCOMES
On completion of the course, the student will be able to
CO1 - Build solutions for acceptance, rejections problems using Finite State Machine.
CO2 - Perform operations on Context free Languages using context free grammars.
CO3 - Solve problems on Context Free Languages using Push Down Automata.
CO4 - Design a solution for given problems using Turing Machine.
CO5 - Distinguish Recursively Enumerable Languages and Recursive languages.
CO6 - Hypothesize solutions to unsolvable problems.

B.E/B.Tech REGULAR REGULATIONS 2023


33
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. John. C. Martin, Introduction to Languages and the Theory of Computation , Tata McGraw-Hill,
4th Edition, 2010.
2. Hopcroft, Motwani and Ullman, Introduction to Automata Theory, Languages and
Computation , Pearson Publishers, 3rd Edition, 2006.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


34
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


S13BLH21 DIGITAL LOGIC CIRCUITS
2 0 4 0 4 100

COURSE OBJECTIVES
To design a binary logic circuit for an arithmetic expression.
To understand the usage of registers and counters used in various digital circuits.
To get an exposure on the electronics behind design of Basic digital logical elements.

UNIT 1 NUMBER SYSTEMS, LOGIC FUNCTIONS AND BOOLEAN 12 Hrs.


ALGEBRA
Number systems Number systems conversions - Binary arithmetic Binary codes Logic
functions-Universal gate functions - Boolean algebra Functionally complete operation sets,
Reduction of switching equations using Boolean algebra, Realization of switching function,
Experimental verification of Logic gates and Boolean function.

UNIT 2 DESIGN OF COMBINATIONAL LOGIC 12 Hrs.


Design procedure of Combinational Logic Design of two level gate networks - Sum of Products
(SOP) - Product of Sums(POS) - Canonical SOP - Canonical POS - Karnaugh Map - Simplifications
of Boolean functions using Karnaugh Map and implementation using Logic function Advantages
and limitations of K-Map - Tabulation method - Simplifications of Boolean functions using
Tabulation method.

UNIT 3 COMBINATIONAL CIRCUITS 12 Hrs.


Introduction to Combinational circuits Half Adder, Full Adder - Half Subtractor, Full Subtractor-
Parallel binary Adder, Parallel binary Subtractor - Carry look ahead Adder- BCD Adder- Decoders-
Encoders - Priority Encoder- Multiplexers- MUX as universal combinational modules-
Demultiplexers- Code convertors- Magnitude Comparator, Design and experimental verification of
Adders, Substractors, Encoders, Decoders, Multiplexers, Demultiplexers and Code convertors.

UNIT 4 SEQUENTIAL CIRCUITS 12 Hrs.


Introduction to Sequential circuits Flip flops SR, JK, D and T flip flops, Master Slave flip flop,
Characteristic and excitation table Realization of one flip flop with other flip flops Registers
Shift registers Counters Synchronous and Asynchronous counters Modulus counters Ring
Counter Johnson Counter State diagram, State table, State minimization Hazards, Design
and experimental verification of Flip flops, Sift registers and Counters.

DIGITAL LOGIC FAMILIES, MEMORIES AND


UNIT 5 12 Hrs.
PROGRAMMABLE DEVICES
Classification and characteristics of logic family Bipolar logic family Saturated logic family
Non saturated family Unipolar family MOS, CMOS logic families. Classification and
Organization of memories Programmable Logic Devices Programmable Logic Array(PLA)
Programmable Array Logic (PAL) Field Programmable Gate Arrays (FPGA).

Max. 60 Hrs.

B.E/B.Tech REGULAR REGULATIONS 2023


35
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

COURSE OUTCOMES
On completion of the course, student will be able to
CO 1 - Classify various types of Digital Number systems and Boolean algebra.
CO 2 - Illustrate Combinational logic.
CO 3 - Design and implement the digital circuit using combinational logic
CO 4 - Design and implement the digital circuit using sequential logic.
CO 5 - Illustrate the digital logic families
CO 6 - Solve the arithmetic expressions using memories and programmable logic devices
and implement memory units with Programmable logic devices

TEXT / REFERENCE BOOKS


1. rd Edition, Prentice Hall of India, 2008.
2.
1998.
3. Vikas Publishing
House, 2002.
4. rd Edition, TMH, 2003.
5.

B.E/B.Tech REGULAR REGULATIONS 2023


36
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

Total
MICROPROCESSOR AND L T P EL Credits
S13BLH51 Marks
MICROCONTROLLER
2 0 4 0 4 100

COURSE OBJECTIVES
To understand the architecture of Microprocessor and Microcontroller.
To familiarize the students in writing assembly programming and interfacing with peripherals.
To provide foundation and confidence to solve real-world problem using Microprocessor and
Microcontroller.

UNIT 1 8086 MICROPROCESSOR 12 Hrs.


Introduction, 8086 Architecture, Pin Diagram and signals, Timing Diagram, Interrupts and its types,.8086
assembly language programming and its practices Addressing Modes.

UNIT 2 8086 INTERFACING 12 Hrs.


Memory interfacing Interrupt controller (8259A) DMA controller (8237) - Multiprocessor configurations -
Serial communication USART (8251) - Programmable Peripheral Interface (8255) - Programmable Interrupt
Controller(8259) - Programmable interval timer(8254), Analog to Digital Converter(ADC) and Digital to Analog
Converter(DAC) interfacing -Validate of applications.

UNIT 3 8051 MICROCONTROLLERS 12 Hrs.


Introduction to microcontrollers - Difference between microprocessor and microcontroller - Architectural
of 8051 -Memory architecture Timers Interrupts - Addressing Modes and Instructions to 8051 - 8051
assembly language programming and its practices.

UNIT 4 8051 INTERFACING 12 Hrs.


I/O Ports Timer port architecture and programming - Serial port architecture and programming -
Interrupts handling - LCD and Keyboard interfacing ADC and DAC interfacing DC and Stepper Motor
interfacing Introduction to PIC16X Microcontroller - Validate applications.

UNIT 5 GPU ARCHITECTURE 12 Hrs.


Evolution of GPU architectures - Understanding Parallelism with GPU Typical GPU Architecture - CUDA
Hardware Overview - Threads, Blocks, Grids, Warps, Scheduling - Memory Handling with CUDA: Shared
Memory - Global Memory - Constant Memory and Texture Memory.

Max. 60 Hrs.
COURSE OUTCOMES
On completion of the course, student will be able to
CO 1 - Analyze the internal architecture and operations of microprocessor related to industrial and
performance-oriented logics and techniques.
CO 2 - Analyze various addressing modes and instruction set of microprocessors to structure the
programming skills.
CO 3 - Examine the various processors and to select appropriate processor and controller, based on
the performance requirements and implementation.
CO 4 - Develop assembly language programs through simulation and hardware implementation by
assembling and disassembling the machine codes of microcontroller.
CO 5 - Implement electronic circuitry to the Microprocessor I/O ports in order to interface the processor
and controller for various applications.

B.E/B.Tech REGULAR REGULATIONS 2023


37
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

CO 6 - Evaluate various assembly language programs based on computation complexity to address


Real World Problems.
TEXT / REFERENCE BOOKS
1. Yu-Cheng Liu, Glenn A. Gibson, Microcomputer Systems: The 8086 / 8088 Family -
Architecture, Programming and Design , Prentice Hall of India, 2nd Edition, 2015.
2. Microprocessors and Microcontrollers Architecture, Programming and
Interfacing Using 8085, 8086 and 8051
3. rd Edition, Thomson, 2007.

4. nd Edition,

Pearson Education, 2008.

B.E/B.Tech REGULAR REGULATIONS 2023


38
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


S12BLH31 PROGRAMMING IN JAVA
3 0 2 1 4 100

COURSE OBJECTIVES
To introduce object oriented concepts, packages, interfaces and multithreading in Java.
To understand input and output operations, GUI programming and database connectivity.
To impart knowledge on the concepts of server side programs.

UNIT 1 JAVA BASICS 12 Hrs.


Features of Java Language - JVM - Bytecode Data Types-Java Tokens-Access Modifiers-Operators-
Arrays one dimensional and multi-dimensional - Control Structures- String Handling String class
String buffer class.
Practical: Implementation of Matrix Operations using Arrays, String Operations, Looping Control
Statements, Conditional Control Statements.

UNIT 2 OBJECT ORIENTED PROGRAMMING 12 Hrs.


Object Oriented Concepts-Classes and Objects Constructors . Method Overloading-Inheritance
Types Using Super Method Overriding Abstract Classes Using final with inheritance- Garbage
Collection.
Practical: Implementation of Constructors, Inheritance, Static and dynamic Polymorphism, Abstract
Class.

UNIT 3 PACKAGES, INTERFACES AND THREADS 12 Hrs.


Introduction to Packages User Defined Packages - Importing packages Access protection Interfaces
Exception Handling Using try, catch, throw, throws and finally Java Thread Model Main thread
Multithreading Thread priorities Synchronization.
Practical: Creating custom Packages, Interfaces. Handling predefined and User Defined Exceptions,
Implementation Single and Multi-Threading.

UNIT 4 FILE STREAMS AND COLLECTIONS FRAMEWORK 12 Hrs.


IO Package - Introduction Input Stream and Output Stream classes - Data Output Stream and Data
Input Stream classes FileInputStream FileOutputStream. - Reader and Writer Classes File Reader
and File Writer-Collections Framework-List, Set, Map.
Practical: Reading Contents from File and Writing Contents to File, Implementation of Collections
Frameworks.

UNIT 5 GUI PROGRAMMING, DATA BASE CONNECTIVITY,


SERVER SIDE PROGRAMMING 12 Hrs.
GUI Programming using Java FX-Explore Events-Accessing Database using JDBC-Introduction to
servlet - Servlet life cycle - Developing and Deploying Servlets JSP TAGS Expressions -Applications
using Servlet and JSP.
Practical: Creation of Graphical user Interface for different Applications. Creation of Server side Programs
using Servlet and JSP.

Max. 60 Hrs.

B.E/B.Tech REGULAR REGULATIONS 2023


39
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Develop applications using java object oriented concepts.
CO2 - Create user defined packages and interfaces.
CO3 - Build software using the concepts of Files and Collection Framework.
CO4 - Design GUI using Java FX.
CO5 - Implement Java applications web using Database connectivity.
CO6 - Design Web applications using Servlet and JSP.

TEXT / REFERENCE BOOKS


1. 5th Edition, Tata Mcgraw Hill, 2017.
2. 4th Edition 2006.
3. Core Java Volume-I Fundamentals, 9th Edition, Cay Horstman and Grazy Cornell, Prentice
Hall, 2013.
4. Y. Daniel Liang, Introduction to Java programming omprehensive version,10th Edition,
Pearson ltd, 2015.
5. https://docs.oracle.com/javase/tutorial/.
6. https://www.tutorialspoint.com/java/.

B.E/B.Tech REGULAR REGULATIONS 2023


40
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SMTB1402 PROBABILITY AND STATISTICS
3 1 0 0 3 100

COURSE OBJECTIVES
To identify, reflect upon, evaluate and achieve conceptual understanding and knowledge of
traditional Calculus to form independent judgements.
To model the engineering problems and obtain its solutions mathematically.
To understand Science, Engineering and Computer Science analytically and logical thinking is
attained.

UNIT 1 BASIC CONCEPTS OF PROBABILITY 9 Hrs.


Probability Space Events Axiomatic approach to Probability Conditional Probability Independent
Events - 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 Linear regression Ranks-Spearman rank Correlation - Repeated Ranks- Multiple and
Partial Correlation Curve Fitting Method of Least Squares 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 9 Hrs.


CONTROL
Review of F-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 the course the student will be able to
CO1 - Understand probability concepts and
variables and their probability distributions.
CO2 - Analyse discrete and continuous probability distributions.
CO3 - Estimate the distributions and transformations of two dimensional random variables.
CO4 - Distinguish correlation and regression. Construct curve fitting by the method of least squares.
CO5 - Evaluate problems on design of experiments using analysis of variances.
CO6 - Sketch the control charts and point out the results based on the charts.

B.E/B.Tech REGULAR REGULATIONS 2023


41
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Hong R.V, Tanis E.A and Zimmerman D L, Probability and Statistical Inference, Pearson
Education Limited, 9th Edition, 2015.
2. Miller I.and Freund J.E, Probability and Statistics for Engineers, Pearson Publishers, 9th
Edition, 2017.
3. Gupta S C and Kapoor V K, Fundamentals of Mathematical Statistics, Sultan Chand and
Sons, 10th Edition, 2002.
4. VeerarajanT., Probability, Statistics and Random Processes, Tata McGraw-Hill, New Delhi,
4th Edition, 2014.
5. Sivaramakrishna Das P, VijayaKumari C., Probability and Random Processes, Pearson
Education, 6th Edition,2014.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


42
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB1401 OPERATING SYSTEMS AND UNIX
3 0 0 0 3 100

COURSE OBJECTIVES
To have an overview of different types of operating systems and process management.
To understand the concepts of storage management, I/O and file systems.
To learn the basics of Unix Programming.

UNIT 1 INTRODUCTION 8 Hrs.


Introduction - Operating system structures - System components - OS services - System calls - System
structure - Resources Processes - Threads - Objects - Device management - Different approaches -
Buffering device drivers.

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

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

UNIT4 MEMORY MANAGEMENT AND I/O MANAGEMENT 10 Hrs.


Storage Management Strategies - Contiguous vs Non-Contiguous storage allocation - Fixed and
variable partition multiprogramming - Paging - Segmentation Paging / Segmentation systems - Page
Replacement strategies - Demand and anticipatory paging, File management: Access methods -
Directory structure - Allocation methods - Disk management: Disk structure - Disk scheduling.

UNIT 5 UNIX 9 Hrs.


Unix components - Internal and external commands - File and directory related commands - File
permission and manipulation - Standard I/O - Configuring vi environment - Regular expression -
Process related commands - Shell programming - Branching control structures- if, case etc. - Loop
control structures: while, until, for, etc. - Jumping control structures break, continue, exit, etc. - Integer
and real arithmetic in shell programs.

Max.45 Hrs.

COURSE OUTCOMES
On completion of the course the student will be able to
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 in process management.
CO3 - Analyse synchronization and deadlocks in real computing problems.
CO4 - Demonstrate the different memory and I/O management techniques used in Operating
Systems.
CO5 - Gain practical exposure in disk scheduling.
CO6 - Develop shell scripts in vi environment.

B.E/B.Tech REGULAR REGULATIONS 2023


43
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


th Edition,
1.
Addison Wesley, 2018.
2. Edition, Addison Wesley, 2004.
rd

3. rd Edition, Addison Wesley, 2004.

4. , 4 edition 2015.
th

5. Eric S. Raymond Art of UNIX Programming , 1st Edition, ,2003.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


44
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


S11BLH41 DATABASE MANAGEMENT SYSTEMS
3 0 2 1 4 100

COURSE OBJECTIVES
To understand the concept of DBMS and ER Modelling.
To familiarize with normalization, query optimization and relational algebra.
To apply concurrency control, recovery, security and indexing for the real time data.

UNIT 1 DATABASE SYSTEMS CONCEPTS AND ARCHITECTURE 12 Hrs.


History and motivation for database systems - characteristics of database approach - Actors on the scene
- Workers behind the scene - Advantages of using DBMS approach - Data Models, Schema, and
Instances - Three-Schema Architecture and Data Independence - The Database System Environment -
Centralized and Client/Server Architectures for DBMS - Classification of DBMS.
Practical: Create a database table, add constraints (primary key, unique, check, not null), insert rows,
update and delete rows using SQL DDL and DML commands.

UNIT 2 DATA MODELING 12 Hrs.


Entity Relationship Model: Types of Attributes, Relationship, Structural Constraints - Relational Model,
Relational model Constraints - Mapping ER model to a relational schema - Integrity Constraints Practical:
Create a set of tables, add foreign key constraints and incorporate referential integrity.

UNIT 3 SCHEMA REFINEMENT 12 Hrs.


Guidelines for Relational Schema - Functional dependency - Normalization, Boyce Codd Normal Form,
Multi-valued dependency and Fourth Normal form - Join dependency and Fifth Normal form.

aggregate functions. Query the database tables and explore sub queries and simple join operations.
UNIT 4 QUERY PROCESSING AND TRANSACTION PROCESSING 12 Hrs.
SQL fundamentals -Translating SQL Queries into Relational Algebra - heuristic query optimization -
Introduction to Transaction Processing - Transaction and System concepts - Desirable properties of
Transactions - Characterizing schedules based on recoverability - Characterizing schedules based on
serializability
Practical: Execute complex transactions and realize DCL and TCL commands.

UNIT 5 CONCURRENCY CONTROL, RECOVERY TECHNIQUES AND NOSQL DBMS 12 Hrs.


Two-Phase Locking Techniques for Concurrency Control - Concurrency Control based on timestamp -
Recovery Concepts - Recovery based on deferred update - Recovery techniques based on immediate
update -Shadow Paging - Introduction, Need of NoSQL - different NoSQL data models: Key-value stores
- Column families - Document databases - Graph databases.
Practical: Create Document, column and graph-based data using NOSQL database tools.

Max. 60 Hrs.
COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Demonstrate the basic concept and role of DBMS in an organization.
CO2 - Illustrate the design principles for database design, ER model.
CO3 - Discuss normalization techniques with simple examples.
CO4 - Demonstrate the basics of query evaluation and heuristic query optimization techniques.
CO5 - Apply Concurrency control and recovery mechanisms for the desirable database problem.
CO6 - Design the database system with the fundamental concepts of DBMS.

B.E/B.Tech REGULAR REGULATIONS 2023


45
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Silberschatz, A., Korth, H. F. and Sudarshan, S., Database System Concepts , McGraw-Hill, 7th
Edition. 2019.
2. Elmasri, R., and Navathe, S. B., Fundamentals of Database Systems , 4th Edition, Addison Wesley
Publishing Edition, 2017.
3. Majumdar, A. K., and Bhattacharyya, P., McGraw-Hill, 2017.
4. Pramod J. Sadalage and Marin Fowler, NoSQL Distilled: A brief guide to merging world of Polyglot
Persistence , Addison Wesley, 2012.
5. Shashank Tiwari, Professional NoSql , Wiley ,2011.

B.E/B.Tech REGULAR REGULATIONS 2023


46
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB2401 OPERATING SYSTEMS LAB
0 0 4 0 2 100

SUGGESTED LIST OF EXPERIMENTS


1. Working with Shell in Ubuntu/ Fedora.
2. Working with Text Files in Ubuntu
a. Editing Files with Vim and Vi
b. Starting with Vi
3. Managing Running Processes: Monitoring Process Activity
a. Fedora OS Installation on Virtual Machine.
b. Post-Installation Configuration on Fedora OS.
c. Configuring Basic Tools in Fedora OS.
4. Implementation of Process Scheduling mechanism Priority Scheduling, Round Robin Scheduling,
FCFS, SJF.
5. Producer Consumer Problem using Semaphores.
6. Inter-Process Communication using Shared Memory.
7. Bankers Algorithm for Deadlock Avoidance.
8. Memory Allocation Methods for Fixed Partition: First Fit, Worst Fit and Best Fit allocation.
9. Simulate Paging Technique of Memory Management.
10. Page Replacement Algorithms: FIFO, LRU, LFU.
11. File Organization Technique: Single Level Directory, Two Level Directory Organization.
12. Simulate File Allocation Strategies: Sequential, Linked and Indexed.
13. Reader Writer Problem.
14.
15. Threading and Synchronization Applications.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Infer the basic services and functionalities of the operating system using System Calls in Linux.
CO2 - Implement CPU Scheduling algorithms such as FCFS, SJF, Priority and Round Robin.
CO3 - Design programs for deadlock avoidance.
CO4 - Simulate Memory Management Techniques.
CO5 - Implement Paging Techniques and Page Replacement Algorithms.
CO6 - Design solutions for Synchronization problems.

B.E/B.Tech REGULAR REGULATIONS 2023


47
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

DESIGN THINKING AND L T P EL Credits Total Marks


SCSBDPROJ
INNOVATIONS 0 0 4 0 2 100

COURSE OBJECTIVES
To apply knowledge in real time problem solving.
To foster innovation in design of products, processes or systems.
To develop creative thinking in finding viable solutions to engineering /non engineering problems.

Activity 1
Design thinking introduction
Phases of design thinking - a study approach.
Group discussion on Ideation- Users perspective.
Formation of team Thinking skills- Brain storming.

Activity 2
Problem identification (phase I)
Selecting user requirements.
.
Specific Problem selection to proceed with the work Team presentation on identified problems and
various possible solutions.

Activity 3
Problem identification (Phase II )
Study of an application and its importance to end user.
Various models of an application.
Finalize the identified problem.

Activity 4
Design ideation and various stages
Sketch design diagram.
Architecture or full diagrammatic study.

Activity 5
Review and upgradation
Review of the ideation (one to one interaction).
Feedback.
Upgradation plan.

Activity 6
Implementation (Phase I)
Build the prototype using available resources.
Record Module diagrams.

Activity 7
Implementation( Phase II)
Display and review of the prototype.
Record its functionality and its Usage-Technical manual.

B.E/B.Tech REGULAR REGULATIONS 2023


48
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

Activity 8
Testing
To test the product design with real time environment.
Record Process-user manual.

Activity 9
IPR-Activity I
To study various IPR activities.
To prepare for IPR Process.
To file an IPR.

Activity 10
Start-ups Formation
To exhibit the product to public: feedback approach.
To prepare full documentation.
Start-ups registration/apply patent/publish paper/submit model/prototype/Apply for seed/submit as
research proposal.

COURSE OUTCOMES
On completion of the course, the students will be able to
CO1 - Solve real world problems by applying knowledge across domains.
CO2 - Develop various design products, processes or technologies for sustainable and socially relevant
applications.
CO3 - Demonstrate knowledge of resource utilization/budgets to Implement appropriate
methodologies.
CO4 - Execute tasks by application of engineering standards/ requirements/ design criteria, within
timelines.
CO5 - Conduct extended investigation that results in the translation of idea to product / production of a
research thesis/ developing a proof of concept.
CO6 - Communicate well organized technical and scientific findings effectively in written and oral forms,
following ethical and professional norms.

TEXT / REFERENCE BOOKS


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

B.E/B.Tech REGULAR REGULATIONS 2023


49
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

COURSE ASSESSMENT METHODS

Direct Methods Design innovation Reviews


Report Submission
IPR Registration
Indirect Methods Course Exit Survey

Assessment Method Rubrics Marks allotted Assessment Type


Review 1 1 30 CAE
Internal Guide 2 10 CAE
IPR Process and Registration 5 10 ESE
Total Internal 50
Final Review 3 30 ESE
Report Submission 4 20 ESE
Total External 50

Note: The design thinking guidelines is suggestive and the procedures can customize the rubrics
based on their domain requirement.

B.E/B.Tech REGULAR REGULATIONS 2023


50
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

DATA COMMUNICATION AND L T P EL Credits Total Marks


SCSB1501
COMPUTER NETWORKS 3 0 0 0 3 100

COURSE OBJECTIVES
To classify different network architectures, transmission methods and switching techniques.
To evaluate network errors, examine methods to detect and remove them.
To articulate the functioning behind the data transfer through different transmission mode in a
network.

UNIT 1 INTRODUCTION 9 Hrs.


Data communication process - Components of communication media Modes of Communication IEEE
protocol and Standards Network classifications Rudiments of networks topologies Client Server and
Peer to Peer Network Architecture.

UNIT 2 TRANSMISSION MEDIA AND SWITCHING 9 Hrs.


Communication Media Guided transmission, Unguided and Line of Sight (LOS) Network connecting
devices - Multiplexing techniques Switching techniques Packet switching techniques Analog and
digital signals Encoding and modulation Parallel and serial transmission.

UNIT 3 ERROR DETECTION, CORRECTION AND COMMUNICATION 9 Hrs.


Types of network errors Error detection Error correction methods Flow control Error control
IEEE 802.3 IEEE 802.5 IEEE 802.11 IEEE 802.15.1 (Piconet and Scatternet).

UNIT 4 ISDN AND ATM 9 Hrs.


Access to ISDN ISDN layers Broadband ISDN Packet layer protocol ATM ATM architecture
ATM layers Congestion control Leaky bucket algorithm.

UNIT 5 REFERENCE MODELS AND PROTOCOLS 9 Hrs.


OSI Reference models Routing algorithms TCP/IP layered architecture Transport and application
layers of TCP/IP Network Protocols DHCP NAT DNS SMTP HTTP WWW.

Max.45 Hrs.
COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Interpret the foundations of communication, network and transmission along with its devices,
types, topologies and protocols.
CO2 - Compare different network architectures, transmission methods and switching techniques.
CO3 - Classify various types of network errors, examine methods to detect them and evaluate various
correction algorithms to remove it.
CO4 - Apprehend the working of advanced switching network, its protocol and architecture.
CO5 - Master the functioning behind the data transfer through different transmission mode in a network.
CO6 - Categorize the layers built in a network and discern the data flow between the layers through
diverse range of algorithms.

B.E/B.Tech REGULAR REGULATIONS 2023


51
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. th Edition, 2022.
2. Andrew.S.Tenenbaum, Nick Feamster, David Wetherall, th Edition,
Pearson, 2021
3. th Edition, Pearson Education, 2000.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


52
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

DESIGN AND ANALYSIS OF L T P EL Credits Total Marks


SCSB1502
ALGORITHMS 3 1 0 0 3 100

COURSE OBJECTIVES
To analyse the performance of algorithms under various scenarios.
To gain knowledge of the foundational mathematics needed to analyse algorithms and solve
recurrence equations.
To understand and apply the design strategies to real world problems.

UNIT 1 INTRODUCTION 9 Hrs.


Fundamentals of Algorithmic Problem Solving - Time Complexity - Space complexity with examples -
Growth of Functions - Asymptotic Notations and its properties - Complexity Analysis Examples -
Performance measurement - Instance Size, Test Data, Experimental setup.

UNIT 2 MATHEMATICAL FOUNDATION 9 Hrs.


Solving Recurrence Equations - Substitution Method - Recursion Tree Method - Master Method - Sorting
in Linear Time - Lower bounds for Sorting: Counting Sort - Radix Sort - Bucket Sort.

UNIT 3 BRUTE FORCE AND DIVIDE-AND-CONQUER 9 Hrs.


Brute Force: Travelling Salesman Problem - Knapsack Problem - Assignment Problem - Closest Pair
and Convex Hull Problems - Divide and Conquer Approach: Binary Search - Quick Sort - Merge Sort -

UNIT 4 GREEDY APPROACH AND DYNAMIC PROGRAMMING 9 Hrs.


Greedy Approach: Optimal Merge Patterns- Huffman Code - Job Sequencing problem- Tree Vertex
Splitting, Dynamic Programming: Dice Throw - Optimal Binary Search Algorithms.

UNIT 5 BACKTRACKING AND BRANCH AND BOUND 9 Hrs.


Backtracking: 8 Queens - Hamiltonian Circuit Problem - Branch and Bound - Assignment Problem -
Knapsack Problem: Travelling Salesman Problem - NP Complete Problems - Clique Problem - Vertex
Cover Problem.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Analyze the efficiency of an algorithm based on time and space complexity.
CO2 - Apply mathematical principles for recursive analysis.
CO3 - Construct algorithms based on brute force and divide and conquer techniques and its real time
applications.
CO4 - Design solutions using dynamic and greedy approaches for real world problems.
CO5 - Design a solution by using branch and bound, backtracking techniques.
CO6 - Develop a solution for any given problem by choosing appropriate algorithm.

B.E/B.Tech REGULAR REGULATIONS 2023


53
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1.
th Edition, MIT Press, 2022.

2.

Education India, 2013.


3. rd Edition, Pearson
Education, 2012.
4. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Fundamentals of Computer
Algorithms , 2nd Edition, Universities Press, 2007.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


54
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

SOFTWARE ENGINEERING DESIGN L T P EL Credits Total Marks


S11BLH51
AND DEVELOPMENT 3 0 2 1 4 100
COURSE OBJECTIVES
To understand the fundamentals of software process and development, requirements engineering
and analysis modelling.
To use UML in requirements elicitation and designing.
To understand concepts of relationships and aggregations and to test the software against its
requirements specification.
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 Specialized model -
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 and System - Requirement Engineering Process - 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 AN OVERVIEW OF OBJECT ORIENTED SYSTEM DEVELOPMENT 9 Hrs.


Object Oriented System Development Methodology - Overview of Unified Approach - Object Basics:
Object Oriented Philosophy - Objects - Classes - Attributes - Object Behavior and Methods, Messages
and Interfaces, Encapsulation and Information Hiding - Class Hierarchy - Polymorphism - Object
Relationships and Associations - Aggregations and Object Containment - Object Identity - Static and
Dynamic Binding - Persistence. Object-oriented CASE tools, Object Oriented Systems Development Life
Cycle - Usecase Driven Approach Reusability.

UNIT 4 OBJECT ORIENTED METHODOLOGIES 9 Hrs.


- Booch Methodology - Jacobson et al. Methodologies
Patterns - Framework - Unified approach - Unified Modeling Language: Static and Dynamic Model - UML
Diagrams - UML Class Diagram UML Use Case Case study- Use case Modeling Relating Use cases
include, extend and generalization When to use Use-cases- UML Dynamic Modeling Case study-
UML Extensibility - UML Metamodel.

UNIT 5 TESTING AND SOFTWARE QUALITY ASSURANCE 9 Hrs.


Software Testing Fundamentals - White box testing- Basis path testing - Black box testing - Control
Structure testing- Regression testing strategies Levels of testing - Software Quality Assurance- Impact
of Object Orientation on Testing -Develop Test Cases and Test Plans - System Usability and User
Satisfaction Usability Testing Software Configuration Management- Re-Engineering - Reverse
engineering - Restructuring - Forward engineering.
Practical: 15 Hrs.
1. Create a system to perform book bank operation.
2. Create a system to perform the Exam registration system.
3. Design an object-oriented model for Course reservation system.
4. Design an object-oriented model for Passport automation System.
5. Design an object-oriented model for Book bank management system.
6. Design an object-oriented model for Online course reservation system.
7. Design an object-oriented model for Conference management System.
Max. 60 Hrs.

B.E/B.Tech REGULAR REGULATIONS 2023


55
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

COURSE OUTCOMES
On Completion of the course, student will be able to
CO1 - Comprehend the basics fundamentals of software process and development.
CO2 - Appreciate the concepts of requirements engineering and analysis modeling.
CO3 - Implement software design with UML diagrams.
CO4 - Interpret the concept of building blocks of modeling.
CO5 - Deploy the various testing methodologies for Software Quality.
CO6 - Design software applications using OO concepts.

TEXT / REFERENCE BOOKS


1. Bruce R. Maxim , Roger S. Pressman
8th Edition, 2019.
2. Ian Sommerville, th Edition, Pearson Education, 2008.
3. .
4. -
Hill.
5. Grady Booch,
rd Edition Addison Wesley.

6.
Validation: Software Best Practice.
7. Kelkar S.A., . Ltd, 2007.

B.E/B.Tech REGULAR REGULATIONS 2023


56
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


S11BPB51 AUGMENTED AND VIRTUAL REALITY
2 0 0 3 3 100
COURSE OBJECTIVES
To acquire a basic understanding of the tenets of virtual reality, such as immersion and presence.
To examine the usability and utilization of AR/VR features in AR/VR apps.
To use the UNITY platform for business, design and prototype effective AR/VR apps.

UNIT 1 INTRODUCTION TO AUGMENTED REALITY AND VIRTUAL REALITY 9 Hrs.


History of Augmented Reality - Displays - Definition and Scope (Multimodal Displays, Spatial Display
Model, and Visual Displays) - AR: Strong vs. Weak - AR Applications - AR Challenges. Scope and
definition - Types of VR - VR Characteristics - Basic VR Environments - VR Environment Limitations -
Virtual Reality Hardware Requirements: Immersion vs. Presence.

UNIT 2 INTERACTION FOR AR/VR ENVIRONMENTS DESIGN 9 Hrs.


Identifying user needs - AR/VR design and analysis - Typical AR/VR graphical metaphors - Affordances
in AR/VR - Human Data Processing - Design for perception and cognition - User experience(UX)
guidelines for AR/VR - UX obstacles for AR/VR - AR/VR prototypes - AR/VR prototype evaluation.

UNIT 3 INTRODUCTION TO UNITY 9 Hrs.


Overview of Unity: Windows, Interface, Navigation, Terminology, Game Objects, Hierarchy, Parenting
Objects - Asset Store, Importing Plug-ins - Terrain Creation, Materials, Colors, and Transparency -
Introduction to Mono behaviors: Awake, Start, and Update

UNIT 4 INTRODUCTION TO VUFORIA AND PHYSICS IN UNITY 9 Hrs.


Overview of Vuforia: Interface, Navigation, Terminology, Image Targeting, Custom Images - Introductory
to Scripting: Definitions, Creating Objects, Accessing Components, Debugging, Lists, Loops - Overview
of Physics in Unity

UNIT 5 EXPANDING ON SCRIPTING AND INTERACTIONS 9 Hrs.


Creating Trigger Events - Manipulating Components in Scripts - Programming Interactions between Objects
and Tracked Images - Designing a simple User Interface in AR - Navigating World Space for Objects and User
- Introduction to colliders and their use: OnCollisionEnter, OnCollisionExit, OnCollisionStay, OnTrigger vs
OnCollision - Rigidbodies and how Colliders report to them Case Study to building a real time application
using AR and VR.
CASE STUDY
Implement the AR for Tutor and VR for Class Room Project using Unity Software.
Develop a VR app to virtually view the hardware lab components.
Illustrate the Remote Desktop to control to your computer in VR.
Develop a layout of machine shop floor in VR.
Develop a Virtual Park for experiencing the look of environment with the help of Mixamo Animated
Assets with audio.
Design an environment for playing football and volley ball in VR.
Develop an AR worm gear for crankshaft image video.
Develop a layout of Computer Lab in VR environment.
Develop satellite AR for study purpose, for launch, take off.
Build a Planetarium set up in VR environment.

Max. 45 Hrs.

B.E/B.Tech REGULAR REGULATIONS 2023


57
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Describe the principles and features of VR and AR.
CO2 - Infer the design of AR and VR software.
CO3 - Design the multi model user interface using UNITY.
CO4 - Understand the Vuforia and Scripting Physics.
CO5 - Design user interfaces in AR.
CO6 - Create real time application using AR and VR.

TEXT / REFERENCE BOOKS


1. Sherman, William R. and Alan B. Craig, Understanding Virtual Reality Interface, Application, and
Design , Morgan Kaufmann, 2018.
2. Design and Development of Virtual Reality Application System , Tsinghua Press, March
2012.
3. Virtual Reality Technology , Tsinghua Press, Jan. 2011.
4. Burdea, G. C. and P. Coffet., Virtual Reality Technology , 2nd Edition. Wiley-IEEE Press, 2006.
5. Schmalstieg, D., and Hollerer, T., Augmented Reality: Principles and Practice Addison-Wesley
Professional, 2016.

B.E/B.Tech REGULAR REGULATIONS 2023


58
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB2501 COMPUTER NETWORKS LAB
0 0 4 0 2 100

SUGGESTED LIST OF EXPERIMENTS


1. NETWORK DESIGN AND DEVICES
a. To find Network IP address of a machine, time and date server.
b. Working with complex network topologies
c. To monitor network traffic using Wire Shark
Case Study
d. Study of different types of Network cables; implement cross-wired and straight cable using clamp
protocol.
e. Study of network devices in detail.

2. NETWORKING PROTOCOL AND LAN


a. Connect the computers in LAN.
b. Construction of VPN Network.
c. Construction of Ethernet connection.
d. Verify and configure VLAN and VLAN trunk in packet tracer.
Case Study
e. To get the MAC or Physical Address of the system Using Address Resolution Protocol.

3. NETWORK SIMULATOR TOOL


a. Configure a network topology using packet tracer software.
b. To configure simple static routing.
c. To implement Security on interconnecting devices.
d. To configure network state routing protocol.
Case Study
e. Study of Network Simulator (NS) and simulation of congestion control algorithms using NS.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Analyze the performance of network protocols in different layers.
CO2 - Implement Ethernet connection.
CO3 - Design with simulation tools.
CO4 - Analyze various LAN networks.
CO5 - Construct VPN network model.
CO6 - Implement security and configure the network.

B.E/B.Tech REGULAR REGULATIONS 2023


59
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB1601 COMPILER DESIGN
3 1 0 0 3 100

COURSE OBJECTIVES
To understand, design and implement lexical analyser and parser.
To understand code generation schemes, optimization of codes and runtime environment.
To design and develop a compiler.

UNIT 1 INTRODUCTION TO COMPILERS AND LEXCIAL ANALYSIS 9 Hrs.


Introduction to programming language translators - Structure of a Compiler - Role of Lexical Analyzer
Patterns Lexemes Tokens Attributes - Specification of Tokens - Regular Expression - Regular
expression to Deterministic Finite Automata - Minimized DFA - Study on LEX tool.

UNIT 2 SYNTAX ANALYSIS 9 Hrs.


Role of Parser - Context Free Grammar - Derivations and Parse Tree - Elimination of Ambiguity - Top
Down Parsing - Predictive Parsing - LL(1) Grammars- Bottom Up Parsing - Shift Reduce Parsers -
Operator Precedence Parsing Types of LR Parsers - SLR Parser - Error handling and recovery in syntax
analyzer - Study on YACC tool.

UNIT 3 SEMANTICS ANALYSIS AND 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.


Principal sources of optimization - Loop optimizations - Basic blocks - Optimization of basic blocks - DAG
representation of basic blocks -Loops in flow graphs Dominators - Global Data Flow analysis.

UNIT 5 CODE GENERATION 9 Hrs.


Issues in the design of a code generator - Target machine - Next-Use information - Register allocation
and assignment- Peephole optimization- Runtime storage management - Activation records - Recent
Trends in compiler design.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Demonstrate the functioning of a compiler and to grasp of concepts such as higher level
programming, automata theory, and formal languages.
CO2 - Develop language specifications using context free grammars.
CO3 - Infer the syntactic and semantic structure in compiler design.
CO4 - Construct symbol tables and generate intermediate code
CO5 - Apply code optimization techniques to generate optimized code
CO6 - Apply the skills on devising, selecting and using tools and techniques towards compiler design

B.E/B.Tech REGULAR REGULATIONS 2023


60
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. V. Aho, Monica S. Lam, Ravi Sethi and Jeffrey D. Ullman, Compilers: Principles, techniques,
and .
2. K. D. Cooper and L. Torczon, Engineering a Compiler , Morgan Kaufmann, 2nd edition, 2011.
3. V. Raghavan, Principles of Compiler Design , Tata McGraw Hill Education Publishers, 2010.
4. Morgan Kaufmann
Publishers Elsevier Science, India, Indian Reprint 2003.
5. Springer International
Publishing, 2017.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


61
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB1602 NETWORK SECURITY
3 0 0 0 3 100

COURSE OBJECTIVES
To acquire knowledge on standard algorithms used to provide confidentiality, integrity and
authenticity.
To explore the various key distribution and management schemes.
To learn how to deploy encryption techniques to secure data in transit across data networks.

UNIT 1 BASICS OF CRYPTOGRAPHY 9 Hrs.


The OSI Security Architecture -Services, mechanisms and attacks - A Model for network security
Classical encryption technique Symmetric cipher model Substitution technique Rotor machines
Steganography.

UNIT 2 DATA ENCRYPTION 9 Hrs.


Stream Cipher - SDES - Block cipher principles The Data Encryption Standard The strength of DES
Advanced Encryption Standard - Triple DES.

UNIT 3 KEY DISTRIBUTION AND KEY MANAGEMENT 9 Hrs.


Random key generation- Requirements - Linear Congruential generators- Blum Blum Shub generator
Placement of encryption - Traffic confidentiality Key distribution- Public key cryptography and RSA
Key Management - Diffie-hellman Key exchange.

UNIT 4 NETWORK PROTECTION, MONITORING, DETECTION,


AUTHENTICATION 9 Hrs.
Firewalls, packet filter and stateful firewalls, application aware firewalls, personal firewalls- Intrusion
Detection System- Honeypots - Authentication requirements Authentication functions message
authentication codes Hash functions MD 5 (Message Digest
Algorithm) HMAC. Digital Signatures and authentication protocols: Digital Signatures Authentication
protocols Digital Signature Standard Kerberos X.509 Authentication Service.

UNIT 5 ATTACKS AND SYSTEM SECURITY 9 Hrs.


Unauthorized access - Distributed Denial of Service (DDoS) attacks- Man in the middle attacks- Code -
SQL injection attacks- Privilege escalation- Insider threats- ARP Cache poisoning- MAC flooding, Side-
channel attack- The Secure Sockets Layer (SSL)- Pretty Good Privacy (PGP)- Email Security-Web
Security-IP Security Biometric Security.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Explain the facts and fundamental ideas of symmetric encryption schemes.
CO2 - Illustrate various encryption standards and its challenges in the network.
CO3 - Experiment with key encryption mechanisms and key management strategies in new situations.
CO4 - Design suitable network protection, monitoring and detection strategies that detect or prevent
from the threat.
CO5 - Defend the network from external or internal authentication threats.
CO6 - Design security strategies and resolve security issues in networks and computer systems to
secure an organization / IT infrastructure.

B.E/B.Tech REGULAR REGULATIONS 2023


62
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. William Stallings, Cryptography and Network Security: Principles and Practice, 8th Edition,
Pearson edition, 2020.
2. Behrouz A. Forouzan, Cryptography and Network Security, McGraw-Hill, 3rd Edition 2015.
3. W. Stallings, Network Security Essentials: Applications and Standards,6 th Edition, Pearson
Prentice Hall, 2016.
4. Bryan Sullivan and Vincent Liu, Web Application Security, A Beginner's Guide, McGraw-Hill
Education, 2012.
5. C. Kaufman, R. Perlman and M. Speciner, Network Security: Private Communication in a
Public World, 2nd Edition, Prentice Hall PTR, 2002.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


63
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB1603 PARALLEL AND DISTRIBUTED COMPUTING
3 0 0 0 3 100

COURSE OBJECTIVES
To understand parallel programming model, analyse synchronization and deadlocks in real
computing problems
To design distributed shared memory in the modern operating system.
To understand group communication in distributed computing.

UNIT 1 INTRODUCTION TO PARALLEL COMPUTING 9 Hrs.


Motivating Parallelism- Scope of Parallel Computing- Modifications to the von Neumann Model- Parallel
Hardware: SIMD systems- MIMD systems-Interconnection networks- Cache coherence Shared
memory versus distributed memory. Parallel Software: Caveats- Coordinating the processes/threads
Programming hybrid systems.

UNIT 2 ARCHITECTURES AND PROGRAMMING 9 Hrs.


Parallel architectures Trends in architectures CMPs-GPUs and Grids Multiprocessors Multicomputers-
Multithreading-Pipelining VLIWs Superscaling Vectors SIMDs-paradigm of shared-memory
distributed memory interconnection networks-optical computing, Models of parallelism: PRAM -CTA.
Performance and Floating Point Considerations-Parallel Programming and Computational Thinking-
Introduction to OPENCL.

UNIT 3 COMMUNICATION IN DISTRIBUTED COMPUTING 9 Hrs.


Introduction - Goals of Distributed computing Design issues Transparency Flexibility Reliability-
Performance Scalability - Client Server Model Remote procedure call Group Communication.

UNIT 4 SYNCHRONIZATION AND PROCESS IN DISTRIBUTED SYSTEMS 9 Hrs.


Synchronization: Algorithms-Deadlocks-Threads System Models-Workstation-model Processor Pool
Model-Hybrid Model-Scheduling in Distributed systems.

UNIT 5 DISTRIBUTED FILE SYSTEMS AND SHARED MEMORY 9 Hrs.


Distributed File System Design Distributed File System Implementation -storage systems-performance
studies, Introduction to Shared Memory Consistency Models-Shared Variable Distributed Shared
Memory - Case Study MACH.

Max.45 Hrs.

COURSE OUTCOMES
On completion of the course, the student will be able to
CO1 -
CO2 - Describe the parallel programming model.
CO3 - Interpret group communication and distribution of the control towards the operating system.
CO4 - Apply the concepts of synchronization and deadlocks in real computing problems.
CO5 - Construct the distributed shared memory in the modern operating system.
CO6 - Implement a MACH.

B.E/B.Tech REGULAR REGULATIONS 2023


64
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Ananth Grama and Ge arallel C -Wesley,
2009.
2. nd Edition, Morgan Kaufmann,
2021.
3. Ananth Grama and George Karypis, to Parallel C -Wesley2009.
4. David Culler and Jaswinder Pal Computer Morgan Kaufmann,
1999.
5. Andrew S. Tanenbaum and

6. Pradeep K Sinha, Operating Systems, Concepts and Prentice Hall of


India, 2009.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


65
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


S11BLH 61 MACHINE LEARNING
3 0 2 1 4 100

COURSE OBJECTIVES
To emphasize on the logical, knowledge-based approach.
To acquire knowledge in hyper parameter tuning which can be applied for projects and solving
practical problems.
To gain experience of doing independent study and research.

UNIT 1 INTRODUCTION TO MACHINE LEARNING 12 Hrs.


Machine Learning Applications - Types of Machine Learning Training, Testing, - Machine Learning
process Variance Bias - Training Error Testing Error - Overfitting Under fitting Gradient Descent
Accuracy Precision Recall Confusion Matrix
Practical: Split the given dataset into 80 percentage training data and 20 percentage test data.
Illustrate confusion matrix using IRIS dataset.

UNIT 2 DATA PRE PROCESSING 12 Hrs.


Why data preprocessing - Steps of preprocessing - Data cleaning Missing values, Noisy data,
Removing outliers - Data integration Data transformation Generalization - Normalization - Min-max
normalization, Z-Score normalization, Decimal scaling normalization, Decimal scaling normalization,
Attribute selection, Label encoding One Hot encoding- Data reduction - Dimensionality reduction
PCA.
Practical: Apply a scaling technique for a given data set after dealing with missing values.
Take a valid dataset, reduce dimensions using PCA.

UNIT 3 SUPERVISED LEARNING 12 Hrs.


Regression - Linear Models for Regression Classification Logistic Regression - Classification Models
- KNN Classification Naïve Bayes Classification Decision Tree Classification Support Vector
Machine Ensemble Learning Random Forest
Practical: Predict heart disease by exploiting KNN Classification Algorithm.
Apply SVM and Decision Tree for classification and check their accuracy level.

UNIT 4 UNSUPERVISED LEARNING 12 Hrs.


Clustering - k-means clustering - Supervised Learning after clustering - Hierarchical clustering Iterative
distance-based clustering - Dealing with continuous, categorical values in K-Means - Constructing a
hierarchical cluster - K-Medoids - k-Mode and density-based clustering - Measures of quality of clustering
Practical: Cluster the given dataset using K means.
Once clusters are formed, apply appropriate supervised learning algorithm.

UNIT 5 NEURAL NETWORK AND LOCAL MODELS 12 Hrs.


Structure of a brain - Artificial Neural Network Perceptron Activation function Sigmoid Relu Tanh
- Multilayer perceptron Feed forward propagation Back propagation - Training process in neural
network Loss function - Gradient descent - Tuning the network size - Learning rate - Competitive
learning - Adaptive resonance theory - Self organizing map -Radial basis functions Bagging - Boosting
- Reinforcement Learning Hyper Parameter Tuning.
Practical: Predict the appropriate class by using ANN.
Perform various hyper parameter tuning and check the accuracy.

Max.60 Hrs.

B.E/B.Tech REGULAR REGULATIONS 2023


66
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Comprehend the underlying terminologies and applications of Machine Learning.
CO2 - Apply relevant preprocessing techniques and make the Data ready for applying machine
learning algorithms.
CO3 - Deploy various supervised learning techniques.
CO4 - Implement various unsupervised learning algorithms.
CO5 - Develop neural network models.
CO6 - Implement machine learning algorithms for a wide variety real time applications.

TEXT / REFERENCE BOOKS


1. Burkov, Andriy, The Hundred-page Machine Learning Book , 2019.
2. Theobald, Oliver. Machine Learning for Absolute Beginners: A Plain English
Introduction , Scatterplot Press, 2017.
3. Michalski, Ryszard S., et al., Machine Learning: An Artificial Intelligence Approach (Volume I)
Elsevier Science, 2014.
4. Maini, Vishal, and Sabri, Samer. Machine Learning For Humans: Introduction to Machine
Learning with Python. Romania, Alanna Maldonado, 2023.
5. Bishop, C Pattern Recognition and Machine Learning . Springer New
York, 2006.

B.E/B.Tech REGULAR REGULATIONS 2023


67
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB2601 COMPILER DESIGN LAB
0 0 4 0 2 100

SUGGESTED LIST OF EXPERIMENTS

1. AUTOMATA THEORY
a. Construction of NFA and DFA from a regular expression.
b. Construct the conversion of NFA to DFA
Case Study
c. Possibilities of getting 6 in two dices. Construct the finite automata for solving dice game.

2. LEX and YACC


a. Use LEX tool to implement Lexical Analyzer.
b. Use LEX to count the number of tokens in an expression
c. Use LEX to check whether string is accepted or not for entered grammar
d. Use LEX and YACC to implement Parser using Ambiguous Grammar.
e. Use LEX and YACC to implement Parser using Unambiguous Grammar.
Case Study
f. Step by step math problem solver is used to get the solution for solving many math problems
such as algebra, calculus, linear systems, quadratic equations, etc. But for that basic arithmetic
operations are very important. Using LEX and YACC tool implement the basic arithmetic
operations.

3. PARSER
a. Implement Recursive Descent Parser algorithm.
b. Implement Shift Reduce Parser algorithm.
c. Implement Operator Precedence Parser algorithm
Case Study
d. Real-world constructions like sentences or mathematical expressions become very easy
when it comes to graphical representation use the parser to implement the tree structure for a
grammar.

4. CODE GENERATOR AND OPTIMIZER


a. Implement the compiler to produce three address codes.
b. Implement Symbol Table Management.
c. Implementation of simple code optimization techniques
Case Study
d. Construct a Simple compiler.

COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Analyse tokens for the given source code using Lex tool.
CO2 - Develop a parser using Lex and Yacc tool.
CO3 - Construct Finite automata for any given regular expression.
CO4 - Develop the parser for checking syntactic error.
CO5 - Generate symbol table and target code for the given input.
CO6 - Design a compiler to convert given source code to target code

B.E/B.Tech REGULAR REGULATIONS 2023


68
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB1701 ARTIFICIAL INTELLIGENCE
3 0 0 0 3 100

COURSE OBJECTIVES
To learn the different problem solving and search strategies in AI and analyze the optimization
techniques.
To understand the knowledge representation and logic in solving AI problems, planning and
reasoning.
To know about the various learning algorithms and applications of AI.

UNIT 1 s FOUNDATION AND INTELLIGENT AGENTS 9 Hrs.


Introduction: What is AI - Foundations of AI - History of AI - Intelligent agent Rationality - Performance
measures - Nature of environments - Structure and types of agents - Problem solving agents : Toy
problems - Real world Problems - Case study : Vacuum cleaner world.

UNIT 2 SEARCH METHODS AND OPTIMIZATION TECHNIQUES 9 Hrs.


Uninformed search : Breadth first search - Depth first search - Depth limited search - Iterative deepening
DFS - Bidirectional search - Informed search - Greedy Best First Search - A* search - Heuristic functions
- Optimization - Hill climbing - Simulated annealing - Local beam search - Genetic algorithm - Case study
: 8 puzzle problem.

UNIT 3 BACKTRACKING AND KNOWLEDGE REPRESENTATION 9 Hrs.


Backtracking - Constraint satisfaction problems - Gaming - Adversarial search - Optimal decisions in
games - Alpha Beta pruning - Case study : 8 queens problem.
Knowledge based agents - Propositional logic - First order logic - Forward and backward chaining -
Ontological engineering - Case study: Wumpus world problem.

UNIT 4 PLANNING AND REASONING 9 Hrs.


Planning - Classical planning - State space search - Progression and Regression - Partial order planning
- Planning and acting in real world - Reasoning - Acting under uncertainty - - Probabilistic
reasoning - Semantics and inference in Bayesian networks - Decision networks, Case study : Air cargo
transport problem.

UNIT 5 LEARNING AND AI APPLICATIONS 9 Hrs.


Learning - Supervised learning - Explanation based learning - Probabilistic learning - Reinforcement learning
- Applications - NLP - Speech Recognition - Object Recognition Robotics - Case study : Word2Vec Problem.

Max.45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Identify how an intelligent agent works to take actions.
CO2 - Analyze the search algorithm for solving AI problems.
CO3 - Upgrade a problem solution with optimization techniques.
CO4 - Apply knowledge based agent to solve the problems logically.
CO5 -
CO6 - Design AI algorithms to work with real time applications.

B.E/B.Tech REGULAR REGULATIONS 2023


69
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. rd Edition, Pearson
Education, 2009.
2. rd Edition, Tata McGraw Hill, 2009.
3.
Bartlett Publishers, Inc., 1st Edition, 2008.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


70
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


S12BLH71 BIG DATA ANALYTICS
3 0 2 1 4 100

COURSE OBJECTIVES
To understand the architecture of Hadoop, including the Hadoop Distributed File System (HDFS) and
the Hadoop ecosystem and apply the knowledge to work with Hadoop and Spark for data processing.
To analyze and compare NoSQL databases like MongoDB, HBase, and Cassandra based on their
architectures and data models.
To design and build data visualizations and interactive dashboards using PowerBi and Tableau.

UNIT 1 INTRODUCTION 12 Hrs.


Introduction to Big Data Evolution- Challenges in the traditional systems - characteristics of Big Data
Hadoop architecture Hadoop Distributed File System Hadoop Ecosystem.

Practical: Installing and configuring Hadoop on a local or distributed environment - working with HDFS
commands - Performing basic operations like file creation, deletion, and listing using Hadoop Distributed
File System (HDFS).

UNIT 2 DATA STORAGE AND PROCESSING 12 Hrs.


Map Reduce Framework - HDFS write and Read - YARN architecture - Spark architecture, Streaming -
Apache Mahout.
Practical: Loading data from various sources into Hadoop, such as CSV files, JSON data, or database
tables. Algorithms using map reduce - word count, matrix multiplication Implementing the ML algorithms
using Apache Spark: Linear Regression, K-means Clustering, Random Forest Classifier -Developing a
Recommendation System with Apache Mahout.

UNIT 3 BIG DATA ECOSYSTEM TOOLS 12 Hrs.


Data Ingestion and Streaming:Kafka, Flume - Data Querying and Analysis:Drill, Impala - Data Processing:
Hive, Pig -Data Integration and Workflow Management: Nifi, Oozie.
Practical: Write Pig Latin scripts to process data stored in Hadoop.- Implementing streaming data
processing using frameworks like Apache Kafka or Apache Flink.

UNIT 4 NOSQL DATABASES AND DATA EXPLORATION 12 Hrs.


Introduction to NoSQL - MongoDB: Document-oriented data model, CRUD operations, Querying and
indexing, Aggregation Hbase - Cassandra: Architecture, Data Model, Data Design Effective Data
Visualization: Power BI Introduction to Tableau.
Practical : Connecting MongoDB with Power BI: Importing data from MongoDB into Power BI for
visualization - Creating Basic Visualizations in Power BI: Building charts, graphs, and tables in Power BI
- Customizing visualization properties and formatting options .

UNIT 5 DATA VISUALIZATION AND BUSINESS INTELLIGENCE 12 Hrs.


Tableau - Apache Superset Business use cases: Sentiment Analysis for Social Media Posts, identify
fraudulent activities in financial transactions, machine learning model to predict customer behaviour,
Demand Forecasting -Recommender Systems.
Practical: Connect Tableau to a dataset (e.g., CSV file, Excel spreadsheet, and database). - creating
interactive dashboards and reports. basic visualizations such as bar charts, line charts, and scatter plots,
Customize visualizations by adjusting colors, labels, and formatting options, Add filters - Creating
Dashboards: Design and build a dashboard with multiple visualizations - Advanced Analytics and
Forecasting: Apply Tableau's built-in analytics functions for data analysis, perform trend analysis,
forecasting, and statistical calculations - Embed Tableau visualizations in web pages

B.E/B.Tech REGULAR REGULATIONS 2023


71
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

Apache Superset: Open-source data exploration and visualization platform for creating charts,
dashboards, and data exploration

Max. 60 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Understand the fundamental concepts and characteristics of Big Data, including its challenges
and the need for specialized technologies and frameworks.
CO2 - Gain proficiency in installing, configuring, and working with Hadoop, including Hadoop
Distributed File System (HDFS), MapReduce, and YARN.
CO3 - Acquire practical skills in loading and processing data using Hadoop, including working with
various data formats and applying algorithms for different applications in real time.
CO4 - Utilize key tools in the Big Data ecosystem, such as Kafka, Flume, Drill, Impala, Hive, Pig, Nifi,
and Oozie, for data ingestion, querying, analysis, processing, and workflow management.
CO5 - Develop a strong understanding of NoSQL databases like MongoDB, HBase, and Cassandra,
including data modeling, CRUD operations, querying, and aggregation.
CO6 - Learn data visualization and business intelligence techniques using tools like Tableau and
Apache Superset, enabling the creation of interactive dashboards, basic visualizations,
advanced analytics, and forecasting.

TEXT / REFERENCE BOOKS


1. Mayer-Schönberger, Viktor, and Kenneth Cukier. "Big Data: A Revolution That Will Transform
How We Live, Work, and Think." Houghton Mifflin Harcourt, 2013.
2. White, Tom. "Hadoop: The Definitive Guide." O'Reilly Media, 2015.
3. Holmes, Alex. "Hadoop in Practice." Manning Publications, 2014.
4. Chambers, Bill, and Matei Zaharia. "Spark: The Definitive Guide." O'Reilly Media, 2018.
5. Akidau, Tyler, Slava Chernyak, and Reuven Lax. "Streaming Systems: The What, Where,
When, and How of Large-Scale Data Processing." O'Reilly Media, 2018.
6. Chodorow, Kristina. "MongoDB: The Definitive Guide." O'Reilly Media, 2013.
7. George, Lars. "HBase: The Definitive Guide." O'Reilly Media, 2011.
8. Carpenter, Jeff, and Eben Hewitt. "Cassandra: The Definitive Guide." O'Reilly Media, 2010.
9. Sleeper, Ryan. "Practical Tableau: 100 Tips, Tutorials, and Strategies from a Tableau Zen
Master." O'Reilly Media, 2018.
10. Murray, Daniel G. "Tableau Your Data! Fast and Easy Visual Analysis with Tableau Software."
Wiley, 2016.
11. Grandi, Andrea. "Learning Apache Superset: Interactive Data Visualization and Business
Intelligence." Packt Publishing, 2020.

B.E/B.Tech REGULAR REGULATIONS 2023


72
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3001 INFORMATION SECURITY ANALYSIS
3 0 0 0 3 100

COURSE OBJECTIVES
To explore system security related incidents and counter measures against common threat /
vulnerabilities.
To install, configure and troubleshoot information security devices and gain experience using tools
and common processes in information security analysis of compromised systems.
To gain insight on potential defences and measures the common threat/vulnerabilities

UNIT 1 INFORMATION SECURITY FUNDAMENTALS 9 Hrs.


Definitions and challenges of security - Attacks and services - Security policies - Security controls -
Access control structures Cryptography Deception - Ethical hacking Firewalls - Identify and Access
Management (IdAM).

UNIT 2 SYSTEM SECURITY 9 Hrs.


System vulnerabilities - Network security systems - System security - System security tools - Web security
- Application security - Intrusion detection systems.

UNIT 3 INFORMATION SECURITY MANAGEMENT 9 Hrs.


Monitor systems and apply controls - Security assessment using automated tools - Backups of security
devices - Performance analysis - Root cause analysis and Resolution - Information security policies
Procedures - Standards and guidelines.

UNIT 4 INCIDENT MANAGEMENT 9 Hrs.


Security requirements- Risk management - Risk assessment - Security incident management-Third party
security management -Incident components - Roles.

UNIT 5 INCIDENT RESPONSE 9 Hrs.


Incident response lifecycle - Record, classify and prioritize information security incidents using standard
templates and tools -Responses to information security incidents - Vulnerability assessment - Incident
analysis.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Understand the basics of information security.
CO2 - Identify and analyse the responses to information security incidents.
CO3 - Install and configure information security devices.
CO4 - Perform various analysis of security management.
CO5 - Acquire the knowledge about the risk and incident management in information security
analysis.
CO6 - Develop a healthy, safe and secure working environment.

B.E/B.Tech REGULAR REGULATIONS 2023


73
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. William Stallings, Lawrie Brown, Computer Security: Principles and Practice , 3rd edition,
2014.
2. Nina Godbole, Information Systems Security: Security Management, Metrics, Frameworks and
Best Practices , Wiley, 2017.
3. Nina Godbole, Sunit Belapure, Cyber Security- Understanding cyber-crimes, Computer
Forensics and , Wiley Publications, 2016
4. Andrew Vladimirov Michajlowski, Konstantin, Gavrilenko, Assessing Information Security:
Strategies, Tactics, Logic and Framework, IT Governance Ltd , Reilly, 2010.
5. Lee Allen, Kevin Cardwell, Advanced Penetration Testing for Highly-Secured Environments
Second Edition, PACKT Publishers, 2016.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


74
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3002 CYBER CRIMES AND LAW
3 0 0 0 3 100

COURSE OBJECTIVES
To gain knowledge on the basic concepts of cybercrimes, forensics and investigation process.
To gain insight about the Information Technology act.
To explore various electronic records and digital signature, legal protection against cybercrimes.

UNIT 1 INTRODUCTION TO CYBERCRIME 9 Hrs.


Introduction Understanding the h - Understanding cybercrime in digital
environment- Threats: Intellectual Property - Software attacks Deviations in QoS Espionage Forces
of nature Human error Information extortion Sabotage Theft Hardware failures Software
failures attacks: Malicious code Hoaxes Crack Brute Force Dictionary DoS and DDoS Spoofing
Man-in-the-Middle Spam Email bombing Sniffers Social engineering Pharming Timing attack.

UNIT 2 COMPUTER FORENSICS AND INVESTIGATION PROCEDURES 9 Hrs.


Introduction to computer forensics - Use of computer forensics in law enforcement - Computer forensics
services- Benefits of professional forensics methodology - Steps taken by computer forensics Specialists-
Who Can Use computer forensic evidence? - Cyber detectives - Computer forensics investigative service
- Forensics process improvement.

UNIT 3 DEFINITIONS AND TERMINOLOGY (IT ACT, 2000) 9 Hrs.


Internet - Internet Governance - E-contract - IT Act provisions for E-contracts in India - Features of
E-contracts - Types of E-contracts - Use of Digital Signatures for E-contracts Encryption - Data Security:
Pillars of Security - Security threats - Causes of security threats - Technology solutions to Security Threats
- Security Policy - Cybersecurity and legal framework.

UNIT 4 ELECTRONIC RECORDS 9 Hrs.


Authentication of electronic records - Legal recognition of electronic records - Legal recognition of Digital
Signatures - Use of electronic records and digital signatures in government and its agencies - Retention
of electronic records - Publication of rules and regulations in electronic gazette, Attribution,
acknowledgement and dispatch of electronic records - Secure electronic records and digital signatures.

UNIT 5 LEGAL PROTECTION AGAINST CYBER CRIMES 9 Hrs.


Criminal liabilities under Information Technology Act 2000 - Common Cyber Crimes and Applicable Legal
Provisions: A Snapshot - Civil liabilities under Information Technology Act 2000 - Civil liability for
corporate: Cyber Crimes under IPC and special laws - The Indian Penal Code, 1860 - Cyber crimes under
the special acts.

Max. 45 Hrs.
COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Understand the basic concepts of cybercrimes and its types.
CO2 - Enhance the knowledge about the forensics and investigation process.
CO3 - Interpret the Information Technology Act.
CO4 - Explore various electronic records and digital signature.
CO5 - Understand the special laws and the Indian penal code.
CO6 - Learn about the legal protection against cyber crimes.

B.E/B.Tech REGULAR REGULATIONS 2023


75
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Michael E. Whitman, Herbert J. Mattord, Cengage
Learning, 4th Edition.
2. ybercrime and Digtial Deviance , 1st Edition, Taylor and Fancis.
3. , Charles
RiverMedia, 2nd Edition, 2005.
4. Dr. U.S. Pandey, aws , Himalaya Publishing House. 1st edition 2017.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


76
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3003 LINUX PROGRAMMING
3 0 0 0 3 100

COURSE OBJECTIVES
To teach principles of operating system including file handling utilities, security by file permissions,
Process utilities, Disk utilities, Networking Commands, Basic Linux commands, Scripts and filters.
To familiarize fundamentals of the Bourne again shell (bash), shell programming, pipes, input and
output redirection Control structures, arithmetic in shell interrupt processing, functions, debugging
shell scripts.
To impart fundamentals of file concepts kernel support for file, File structure related system calls (file

UNIT 1 INTRODUCTION TO LINUX AND LINUX UTILITIES 9 Hrs.


Linux commands - PATH, man, echo, printf, script, passwd, uname, who, date, stty, pwd, cd, mkdir, rmdir,
ls, cp, mv, rm, cat, more, wc, lp, od, tar, gzip - File handling utilities - Security by file permissions - Process
utilities - Disk utilities - Networking commands -unlink, du, df, mount, umount, find, unmask, ulimit, ps, w,
finger, arp, ftp, telnet, rlogin. Text Processing utilities and backup utilities - tail, head , sort, nl, uniq, grep,
egrep, fgrep, cut, paste, join, tee, pg, comm, cmp, diff, tr, awk, cpio.

UNIT 2 INTRODUCTION TO SHELLS AND FILTERS 9 Hrs.


Linux Session - Standard Streams Redirection Pipes - Tee Command - Command Execution -
Command line editing Quotes - Command Substitution - Job Control Aliases Variables - Predefined
Variables Options - Shell/Environment Customization.
Filters and Pipes - Concatenating files - Display beginning and end of files - Cut and paste Sorting -
Translating Characters - Files with Duplicate Lines - Count Characters, Words or Lines -Comparing Files.

UNIT 3 GREP, SED, UNIX FILE STRUCTUREAND FILE MANAGEMENT 9 Hrs.


Operation - grep Family - Searching for File Content - Scripts, Operation, Addresses, commands,
Applications - grep and sed - Introduction to UNIX file system -inode (Index Node) - File descriptors,
system calls and device drivers - File Structures - System Calls for File Management create, open,
close, read, write, lseek, link, symlink, unlink, stat, fstat, lstat, chmod, chown - Directory API opendir,
readdir, closedir, mkdir, rmdir, umask.

UNIT 4 PROCESS AND SIGNALS 9 Hrs.


Process - Process identifiers - Process structure - Process table - Viewing processes - System processes
- Process scheduling - Starting new processes - Waiting for a process - Zombie processes - Orphan
process - fork, vfork, exit, wait, waitpid, exec - Signals functions - Unreliable signals - Interrupted system
calls - kill, raise, alarm, pause, abort, system, sleep functions, signal sets. File locking: creating lock files
- Locking regions - Use of read and write with locking - Competing locks - Other lock commands -
Deadlocks.

UNIT 5 INTER PROCESS COMMUNICATION AND SOCKETS 9 Hrs.


Pipe - Process pipes - The pipe call - Parent and child processes and named pipes: fifos -Semaphores:
semget, semop, semctl - Message queues: msgget, msgsnd, msgrcv, msgctl - Shared memory: shmget,
shmat, shmdt, shmctl - ipc status commands Socket - Socket connections - Socket attributes - Socket
addresses - socket, connect, bind, listen, accept, socket communications.

Max. 45 Hrs.

B.E/B.Tech REGULAR REGULATIONS 2023


77
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Apply various Linux commands that are used to manipulate system operations at admin level
and a prerequisite to pursue job as a Network administrator.
CO2 - Develop Shell programs using Linux commands.
CO3 - Design applications to manipulate internal kernel level Linux File System.
CO4 - Develop IPC-
CO5 - Develop network programs that allows applications to make efficient use of resources available
on different machines in a network.
CO6 - Develop socket programs for networking applications.

TEXT / REFERENCE BOOKS


1. W. Richard. Stevens, Advanced Programming in the UNIX Environment , 3rd edition,
Pearson Education, New Delhi, India, 2013.
2. Behrouz A. Forouzan, Richard F. Unix and Shell Programming .
3. Linux System Programming , .
4. Advanced Programming in the UNIX Environment , 2nd Edition, Pearson
Education, 2013.
5. UNIX Network Programming , PHI, 2004.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


78
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

EL Total
CRYPTOGRAPHY AND NETWORK L T P Credits
SCSB3004 Marks
SECURITY
3 0 0 0 3 100

COURSE OBJECTIVES
To understand the fundamentals of Cryptography, standard algorithms used to provide
confidentiality, integrity and authenticity.
To explore the various key distribution and management schemes, deploy encryption techniques to
secure data in transit across data networks
To learn various mechanisms for network security to protect against the threats in the networks.

UNIT 1 INTRODUCTION 9 Hrs.


Security trends - Legal, ethical and professional aspects of security - Need for security at multiple levels
- Security policies - Model of network security Security attacks, services and mechanisms OSI security
architecture Classical encryption techniques: Substitution techniques - Transposition techniques,
steganography - Foundations of modern cryptography - Perfect security Information theory Product
cryptosystem Cryptanalysis.

UNIT 2 SYMMETRIC CRYPTOGRAPHY 9 Hrs.


Mathematics of Symmetric key cryptography: Algebraic structures - Modular arithmetic -
algorithm - Congruence and matrices - Groups, Rings, Fields - Finite fields - Symmetric Key Ciphers:
SDES Block cipher - Principles of DES Strength of DES Differential and linear cryptanalysis - Block
cipher design principles Block cipher mode of operation Evaluation criteria for AES Advanced
Encryption Standard - RC4 Key distribution.

UNIT 3 PUBLIC KEY CRYPTOGRAPHY 9 Hrs.


Mathematics of Asymmetric Key Cryptography: Primes Primality testing Factorization
function - - Chinese Remainder theorem Exponentiation and logarithm -
Asymmetric Key Ciphers: RSA cryptosystem Key distribution Key management Diffie Hellman key
exchange - ElGamal cryptosystem Elliptic curve arithmetic - Elliptic curve cryptography.

UNIT 4 MESSAGE AUTHENTICATION AND INTEGRITY 9 Hrs.


Authentication requirement Authentication function MAC Hash function Security of hash function
and MAC SHA Digital signature and authentication protocols DSS- Entity Authentication: Biometrics,
Passwords - Challenge Response protocols - Authentication applications - Kerberos - X.509

UNIT 5 SECURITY PRACTICE AND SYSTEM SECURITY 9 Hrs.


Electronic Mail security PGP - S/MIME IP security Web Security - System Security: Intruders
Malicious software viruses Firewalls.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 -
CO2 - Assess the vulnerabilities in a computer network.
CO3 - Apply suitable encryption algorithm to ensure security.
CO4 - Apply the various authentication schemes to simulate different applications.
CO5 - Design network application security schemes such as PGP, S/MIME.
CO6 - Understand various security practices and system security standards.

B.E/B.Tech REGULAR REGULATIONS 2023


79
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. William Stallings, Cryptography and Network Security: Principles and Practice , Pearson,
2016.
2. C K Shyamala, N Cryptography and Network Security ,
Wiley India Pvt.Ltd., 2015.
3. Behrouz A.Foruzan, Cryptography and Network Security , Tata McGraw Hill 2008.
4. Charlie Kaufman, Radia Perlman, and Mike Speciner, Private
Communication in a Public World , Addison Wesley, 2022.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


80
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3005 CYBER PHYSICAL SYSTEMS
3 0 0 0 3 100

COURSE OBJECTIVES
To study the basic concepts, requirements, principles, and techniques in emerging cyber physical
systems.
To provide students hands-on experience in prototyping a cyber-physical system and address real-
world problems through Cyber Physical Systems
To develop an exposition of the challenges in implementing a cyber-physical system from a
computational perspective

UNIT 1 COMPUTATIONAL FOUNDATION, DESIGN AND SYSTEM


REQUIREMENTS 9 Hrs.
Cyber Physical Systems in real world - Basic principle of Cyber Physical Systems - Industry 4.0 - IIoT -
Cyber Physical Systems design recommendations - CPS system requirement - Cyber Physical System
application - Case study of Cyber Physical Systems.

UNIT 2 PLATFORMS, MODELS AND DYNAMICS BEHAVIOURS 9 Hrs.


Hardware platforms for Cyber Physical Systems (Sensors/Actuators, Microprocessor/Microcontrollers) -
Wireless technologies for Cyber Physical Systems - Continuous Dynamics - Discrete dynamics - Hybrid
systems.

UNIT 3 CONCURRENT MODELS OF COMPUTATION 9 Hrs.


Structure of model - Synchronous reactive models - Dataflow models of computation -Timed models of
computation.

UNIT 4 STUDY OF EMBEDDED SYSTEMS VS INTERNET OF THINGS VS CYBER


PHYSICAL SYSTEM 9 Hrs.
Design of Embedded Systems (I/O Units, Multitasking and Scheduling) - Internet of Things Architecture
- CPS architecture.

UNIT 5 SECURITY AND PRIVACY IN CYBER PHYSICAL SYSTEMS 9 Hrs.


Security and Privacy issues in CPSs - Local network security for CPSs Internet - Wide Secure
Communication - Security and privacy for cloud - Interconnected CPSs - Case Study: Cyber security in
Digital Manufacturing / Industry 4.0.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Comprehend the need and purpose of the different components of cyber physical systems.
CO2 - Develop the ability to interact with cyber physical systems.
CO3 - Design a new system with which a product can be made.
CO4 - Comprehend the semantics of a CPS model.
CO5 - Develop the ability to interact with cyber physical systems protocols.
CO6 - Analyse common methods used to secure cyber physical systems.

B.E/B.Tech REGULAR REGULATIONS 2023


81
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Principles of Cyber Physical Systems , MIT Press, 2015.
2. E. A. Lee, SanjitSeshia , "Introduction to Embedded Systems A Cyber Physical Systems
Approach", Second Edition, MIT Press, 2017, ISBN: 978-0-262-53381-2.
3.
.
4.
.
5.
.
6. -Physical
Systems: Foundations, Principles and Sol

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


82
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3007 ETHICAL HACKING
3 0 0 0 3 100

COURSE OBJECTIVES
To understand the basics of computer-based vulnerabilities, different foot printing, reconnaissance
and scanning methods.
To explore the enumeration and vulnerability analysis methods, hacking options available in web and
wireless applications.
To explore the options for network protection, tools to perform ethical hacking to expose the
vulnerabilities.

UNIT 1 INTRODUCTION 9 Hrs.


Ethical Hacking overview - Role of security and penetration testers. Penetration - Testing
Methodologies - Laws of the Land - Overview of TCP/IP - Application layer - Transport layer - Internet
layer - IP Addressing. - Network and computer attacks - Malware - Protecting against malware attacks -
Intruder attacks - Addressing physical security.

UNIT 2 FOOT PRINTING, RECONNAISSANCE AND SCANNING


NETWORKS 9 Hrs.
Footprinting concepts - Footprinting through search engines, web services, social networking sites,
website, Email - Competitive intelligence - Footprinting through social engineering - Footprinting tools -
Network scanning concepts - Port-Scanning tools - Scanning techniques - Scanning beyond IDS and
firewall.

UNIT 3 ENUMERATION AND VULNERABILITY ANALYSIS 9 Hrs.


Enumeration concepts - NetBIOS enumeration SNMP, LDAP, NTP, SMTP and DNS enumeration -
Vulnerability assessment concepts - Desktop and server OS vulnerabilities - Windows OS vulnerabilities
- Tools for identifying vulnerabilities in windows- Linux OS vulnerabilities- Vulnerabilities of embedded
OS.

UNIT 4 SYSTEM HACKING 9 Hrs.


Hacking web servers - Web application components- Vulnerabilities - Tools for web attackers and security
testers - Hacking wireless networks - Components of a wireless network Wardriving- Wireless hacking
- Tools of the trade.

UNIT 5 NETWORK PROTECTION SYSTEMS 9 Hrs.


Access control lists. - Cisco adaptive security appliance firewall - Configuration and risk analysis tools for
firewalls and routers - Intrusion detection and prevention systems - Network based and host-based IDSs
and IPSs - Web filtering - Security incident response teams Honeypots.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Express knowledge on basics of computer-based vulnerabilities
CO2 - Understand the different foot printing, reconnaissance and scanning methods.
CO3 - Demonstrate the enumeration and vulnerability analysis methods
CO4 - Gain knowledge on hacking options available in Web and wireless applications.
CO5 - Acquire knowledge on the options for network protection.
CO6 - Use tools to perform ethical hacking to expose the vulnerabilities.

B.E/B.Tech REGULAR REGULATIONS 2023


83
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Michael T. Simpson, Kent Backman, and James E. Corley, Hands-On Ethical Hacking and
Network Defense, Course Technology , Delmar Cengage Learning, 2010.
2. The Basics of Hacking and Penetration Testing , Elsevier,
2013.
3. Dafydd
Exploiting Security Flaws , 2011.
4. Black Hat Python: Python Programming for Hackers and Pentesters , 2014

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


84
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

BLOCKCHAIN AND L T P EL Credits Total Marks


SCSB1262
CRYPTOCURRENCY 3 0 0 0 3 100

COURSE OBJECTIVES
To impart technical understanding of blockchain technologies, basics of Ethereum that helps
developers publish distributed applications
To learn various aspects of working and use of bitcoin and transfer of money for medium of exchange
To provide knowledge on security and privacy of blockchain technologies

UNIT 1 INTRODUCTION TO BLOCKCHAIN 9 Hrs.


Peer-to-Peer(P2P) networking - Block chain architecture -Design and integration -Key participants in the
block chaining -Blocks in blockchain -Types of blockchain - Logical components of blockchain - Core
components of blockchain architecture -Smart contracts and their applications.

UNIT 2 ETHEREUM BASICS 9 Hrs.


Ethereum and smart contracts - Turing completeness of smart contract languages and verification
challenges - Using smart contracts to enforce legal contracts - Comparing bitcoin scripting vs. Ethereum
smart contracts - Writing smart contracts using Solidity and JavaScript.

UNIT 3 INTRODUCTION TO BITCOIN 9 Hrs.


Bitcoin features - Blockchain and Bitcoin - Bitcoin security - Bitcoin transaction - Transaction lifecycle -
Consensus Protocol - Role of Bitcoin crimes - Dark side of Bitcoin crimes - Open challenges to bitcoin
Crimes.

UNIT 4 FUNDAMENTALS OF CRYPTOCURRENCIES 9 Hrs.


Nodes - P2P Ledger - Gossip protocol - Consensus methods Messages - Account balance - Genesis
block and new coins - How a crypto currency works - Crypto currency exchange - Smart contracts - E-
Governance.

UNIT 5 SECURITY AND PRIVACY ISSUES OF BLOCKCHAIN TECHNOLOGY 9 Hrs.


Introduction - Blockchain aspects for consideration -Security of blockchain, Privacy of blockchains,
Security issues of blockchain technology, Privacy issues of blockchain technology, Types of attacks,
Security enhancement to blockchain systems, Applications of blockchain in healthcare, finance.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Understand the concepts of blockchain technologies.
CO2 - Implement Ethereum block chain contract.
CO3 - Illustrate the concepts of bitcoin and their usage.
CO4 - Understand basic principles of Crypto currencies.
CO5 - Apply security features in blockchain technologies.
CO6 - Use smart contract in real world applications.

B.E/B.Tech REGULAR REGULATIONS 2023


85
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1.
, Penguin, 2018.
2. Merunas
using Ethereum- , 2019.
3.
, 2020.
4. , 2015.
5. Shih , 2019.
6. -On Cybersecurity with Blockchain Implement DDoS protection, PKI-
, 2018 .
7. ptocurrency Master Everything You Need to Know About Cryptocurrency
, 2018.
8.
A Comprehen , 2016.
9.

10. ckchain: Distributed ledger technology, decentralization, and smart


, 2018.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


86
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

CYBER FORENSICS AND L T P EL Credits Total Marks


SCSB3008
INFORMATION SECURITY 3 0 0 0 3 100

COURSE OBJECTIVES
To impart knowledge on cybercrime and cyber forensics.
To learn about cyber investigation and evidence management.
To understand digital forensics.

UNIT 1 UNDERSTANDING THE THREAT FROM CYBER CRIME 9 Hrs.


Introduction to cyber threat Definition of cyber crime Classification Current threats and trends
Diversity of cyber crime Cyber hate crimes Cyber terrorism.

UNIT 2 RESPONDING TO CYBER CRIME 9 Hrs.


Cyber strategy National security strategy Cyber security strategy Organized crime strategy Cyber
crime strategy Policy cyber crime International response National cyber security structure Strategic
policy requirements Police and crime commissioners.

UNIT 3 INVESTIGATING CYBER CRIME 9 Hrs.


Preventing cyber crime Password protection Get safe online Cyber security guidance for Business
Cyber crime investigation skills Criminal investigation Code of ethics Evidence Hi Tech
Investigations Capturing and analysing digital evidence.

UNIT 4 DIGITAL FORENSICS 9 Hrs.


Introduction to Digital Forensics Forensic software and hardware Analysis and advanced tools
forensic technology and practices Forensic ballistics and photography Face, iris and fingerprint
recognition Audio video analysis Windows system forensics Linux system forensics Network
forensics.

UNIT 5 CASE STUDY 9 Hrs.


Latest study topics on cybercrime and investigations Recent cybercrime cases Recent digital forensics
cases Bridging the gaps in cybercrime investigations between the cyber security stake holders.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Infer the various ideas about cybercrime.
CO2 - Describe the cybercrime strategy.
CO3 - Identify the cybercrime investigation methodology.
CO4 - Analyse and validate forensics data.
CO5 - Develop security architecture for an organization.
CO6 - Apply the concepts of cybercrime and digital forensics in real time scenarios.

B.E/B.Tech REGULAR REGULATIONS 2023


87
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Thomas Halt, Adam M. Bossler an Cybercrime and Digital
Forensics: An Introduction , Routledge Taylor and Francis Group, 2017.
2. Bernad CLIO Inc, California, 2004,
EBOOKS:https://books.google.co.in/books/about/Cybercrime_and_Digital_Forensics.html?id=7
SA6D wAAQBAJ andredir_esc=y.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


88
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

SECURED NETWORK L T P EL Credits Total Marks


SCSB1372
PROTOCOLS AND STANDARDS 3 0 0 0 3 100

COURSE OBJECTIVES
To understand the concepts of different layers of protocols.
To provide knowledge and overview about cyber physical system and IoT.
To make students aware of various cyber risk assessment and threats.

UNIT 1 INTRODUCTION 9 Hrs.


Introduction (overview of network security issues, cryptographic algorithms, authentication techniques) -
Layer 2/3 security - Authentication systems - Key establishment protocols - Kerberos- Secure
communication at the data link and network layers (IPSEC and IKE) - Secure communication at the
transport and application layers (SSL/TLS, email security, PGP) - Vulnerabilities of Internet protocols.

UNIT 2 PROTOCOLS 9 Hrs.


Secure Sockets Layer (SSL) - SSL Protocol Stack - SSL Record Protocol Operation IP Security (IPsec)
- IP Security (IPsec) architecture - Benefits of IPsec Hypertext Transfer Protocol Secure (HTTPS)
Kerberos - Drawbacks and limitations - Kerberos Vulnerabilities Transport Layer Security (TLS).

UNIT 3 ATTACKS AND THREATS 9 Hrs.


Denial of service (DoS) attacks and defences - Firewalls, IP spoofing prevention - Routing protocols
security and router security - Domain name server (DNS) security - Traffic monitoring, Intrusion detection,
Honeypots - Wireless networks security - Spam, Phishing, and Pharming - Malware propagation and
containment, Botnets - Anonymity and privacy on the Web.

UNIT 4 SECURITY IN NEXT GENERATION SYSTEM 9 Hrs.


Internet Security Protocols and Standards - TCP Attacks, DNS Vulnerabilities, SSL/TLS, DDoS - Next
Generation System Designs and Challenges - Cyber-physical system overview and security - Internet of
Things and smart grid security - Data and infrastructure security in cloud/edge computing.

UNIT 5 CYBER RISK ASSESSMENT 9 Hrs.


Blockchain and decentralized applications- Hash cash and other consensus protocols - Blockchain
Security- Smart contracts - Scalability and privacy challenges - Security economics and risk modelling -
Cyber-risk assessment - Threat information sharing - Cyber-insurance .

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Analyse the security issues and authentication algorithms.
CO2 - Express the various protocols in different layers.
CO3 - Explain the use of different attacks and security mechanism in current networking scenario.
CO4 - Analyse the security issues in IoT and smart grid applications.
CO5 - Evaluate the security methods using blockchain.
CO6 - Analyse the cyber risk assessment.

B.E/B.Tech REGULAR REGULATIONS 2023


89
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Uyless D. Black, 2nd Edition, 2015.
2. James F Kurose and Keith W. Ross, "Computer Networking - A Top-Down Approach",
Addison-Wesley, 5th Edition, 2010.
3. L. Peterson and B. Davie, "Computer Networks: A Systems Approach", Elsevier Inc., 5th
Edition, 2011.
4.
Publication, 2016.
5.
2018.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


90
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SITB3001 ADVANCED JAVA PROGRAMMING
3 0 0 0 3 100

COURSE OBJECTIVES
To introduce the basics of enterprise architecture models and session tracking.
To understand JSP and to write custom tags.
To impart knowledge on the development of Enterprise Java Beans and advanced Java programming
concepts.

UNIT 1 INTRODUCTION AND DATABASE PROGRAMMING 9 Hrs.


J2EE Platform Enterprise architecture styles J2EE run times J2EE API J2EE architecture
Containers Introduction to J2EE technologies Naming and directory services. Database programming
with JDBC JDBC/ODBC bridge Establishing a connection Creating and executing SQL statements
Querying Report statements Scrollable and updatable result sets Java.Sql packages JDBC data
sources Connection pooling.

UNIT 2 SERVLET PROGRAMMING 9 Hrs.


Introduction to Servlet Programming - Servlet implementations - Servlet configuration - Servlet exceptions
- Servlet life cycle - Servlet programming - Servlet security- Servlet communication - Advanced servlets:
Approach to session tracking- Demonstrating session - Lifecycle with cookies - A simple shopping cart
using sessions - Servlet context interface - Servlet collaboration.

UNIT 3 JSP AND JAVA MAIL 9 Hrs.


Java Server Pages: Intro to JSP - JSP directives - Scripting elements - Standard auctions - Implicit objects
- Scope - JSP pages as XML documents - JSP sample program - Design strategies - JSP tag Extensions-
A simple TAG - Writing TAG extensions. Java Mail API: Introduction to java mail - Mail protocols- Java
mail overview- Quick, Send me a Email: An example program.

UNIT 4 ENTERPRISE JAVA BEANS 9 Hrs.


Overview of EJB-EJB Middleware Architecture - EJB architecture- EJB containers and its services -
Design of EJB tier - Session java beans- Stateless and stateful beans, Entity beans and persistence -
Container Vs bean managed persistence, Message driven bean - Relationships, EJB container services.

UNIT 5 SPRING FRAMEWORK 9 Hrs.


Introduction to Spring - spring framework architecture - Spring MVC-Spring ORM - IOC container -Spring
event handling - Introduction to Hibernate - Spring JDBC - Hibernate mappings - Spring MVC web
framework - Spring AOP framework.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Implement JDBC connectivity.
CO2 - Implement advanced servlets.
CO3 - Implement JSP and Java Mail.
CO4 - Implement EJB.
CO5 - Implement Java,J2EE applications using Spring framework.
CO6 - Develop enterprise java applications thereby meeting the industrial requirements.

B.E/B.Tech REGULAR REGULATIONS 2023


91
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Subrahmanyam Allamaraju and Cedric Buest, J2EE
1.3 Edition
2. Tata McGraw Hill, 2007.
3. James Holmes- nd Edition, Tata McGraw Hill, 2007.

4. http://www.java.sun.com/tutorial.
5. Professional Java Development with the Spring Framework John Wiley
and Sons, 2005.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


92
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SITB3003 ADVANCED INTERNET TECHNOLOGIES
3 0 0 0 3 100

COURSE OBJECTIVES
To understand the search engine functionality and features and develop an optimized search engine
which is user interactive.
To gain knowledge on the various elements of web forms development.
To learn about the recent technological aspects implemented for a modernized Internet Application.

UNIT 1 SEARCH ENGINE OPTIMIZATION AND IT S OBJECTIVES 9 Hrs.


Search Engine Basics - Introduction to SEO - Layout of search result pages - Algorithm-based ranking
system - Search engine success factors - Determining search intent and delivering relevant and fresh
content - Analyzing ranking factors - Using advanced search techniques - Vertical search techniques -
Country-specific search engines - Determining SEO objectives

UNIT 2 DEVELOPING AN SEO FRIENDLY WEBSITE 9 Hrs.


Accessibility of website to search engine - Defining your site's information architecture - Site auditing to
identify SEO problems - Web analytics and current server statistics software - Determining top
competitors in SEO - Search engine indexing status - Benchmarking current rankings, traffic source, and
volumes - Conduct SWOT analysis - Keyword generation - Using google analytics - Creating and
optimizing pay-per-click campaigns.

UNIT 3 RESPONSIVE WEB DESIGNING WITH HTML5 AND CSS3 9 Hrs.


Getting started with HTML5, CSS3, and responsive web design - Media queries - Supporting differing
viewports - Embracing fluid layout - Flexible images - Proportion-based grids - HTML 5 for responsive
design - Basics of CSS3 - CSS3 selectors - Pseudo-classes and pseudo-elements Typography - CSS
color modes - Stunning aesthetics with CSS3 - CSS3 transitions - CSS3 transformations Animations.

UNIT 4 FORMS WITH HTML5 AND CSS3 9 Hrs.


Exploring the FORM element - Exploring the INPUT element - Exploring the BUTTON element - Exploring
the multiple-choice elements - Exploring the TEXTAREA and LABEL elements - Exploring the FIELDSET
and LEGEND elements - Describing the DATALIST element - Submitting a form - Styling HTML5 forms
with CSS3

UNIT 5 RICH INTERNET APPLICATION (RIA) AND MASHUP 9 Hrs.


Characteristics of RIA - Moving from web 1.0 to web 2.0 - Web mashup ecosystems - Mashup
technologies - RIA: AJAX versus traditional approach - Technical background.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Develop understanding on search engines and its optimised functionalities.
CO2 - Design a user-friendly search engine with standard features.
CO3 - Apply the various trending web applications features with its new improvements.
CO4 - Explore the numerous elements of web forms and its features.
CO5 - Gain knowledge on the trending technologies implemented in industries.
CO6 - Design web pages for real time scenarios.

B.E/B.Tech REGULAR REGULATIONS 2023


93
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Advanced Internet Technology , DT Editorial Services, Dreamtech Press, 2014.
2. Advanced Internet Technologies , Prentice Hall Series in Advanced
Communications Technologies, 1998.
3. Advanced Internet Technologies , Vision Publications, 2020.
4. Advanced Internet Technologies ,
2020.
5. Advanced Internet Programming: Technologies and Applications , Charles
River Media, Inc., 2001.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


94
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

BEGINNER FULL STACK WEB L T P EL Credits Total Marks


SITB3005
DEVELOPMENT 3 0 0 0 3 100

COURSE OBJECTIVES
To understand the fundamentals of web programming, client side scripting and server side
development.
To understand API development with Express framework, architect databases using NoSQL and
SQL databases.
To learn the advanced client side scripting and ReactJS framework.

UNIT 1 WEB DEVELOPMENT USING HTML 9 Hrs.


Clients, Servers, and Communication - The Internet - Basic internet protocols -The World Wide Web-
HTTP request message-response - Web clients web servers- Introduction to HTML - Browsers and HTML
- offline and online - Tags, Attribute and elements - Doctype element Comments -headings,
paragraphs, and formatting text - Lists and links - Images and tables.

UNIT 2 CSS 9 Hrs.


Introduction CSS - Applying CSS to HTML - selectors, properties and values - CSS colors and
backgrounds - CSS box model - CSS margins, padding, and borders - CSS text and font properties -
CSS general topics.

UNIT 3 INTRODUCTION TO JAVASCRIPT 9 Hrs.


Introduction to JavaScript - Applying JavaScript (internal and external) - Understanding JS syntax -
Introduction to document and window object - Variables and operators -Data types and Num type
conversion -Math and string manipulation -Objects and arrays - Date and time -Conditional statements -
Switch case - Looping in JS Functions.

UNIT 4 JQUERY AND SERVER-SIDE JS FRAMEWORK NODE.JS 9 Hrs.


Introduction jQuery selectors jQuery HTML - Animations Effects Event handling DOM jQuery
DOM traversing, DOM manipulation jQuery AJAX- Introduction - What is Node JS Architecture
Feature of Node JS - Installation and setup - Creating web servers with HTTP (Request and Response)
Event handling - GET and POST implementation - Connect to SQL database using Node JS.

UNIT 5 INTRODUCTION TO ADVANCED CLIENT SIDE PROGRAMMING 9 Hrs.


React JS: ReactDOM - JSX - Components - Properties Fetch API - State and lifecycle - JS local storage
- Events - Lifting state up - Composition and inheritance.

Max.45 Hrs.

COURSE OUTCOMES
On completion of the course, the student will be able to
CO1 - Write client side scripting using HTML, CSS and JS.
CO2 - Implement and architect the server side of the web application.
CO3 - Implement Web Application using NodeJS.
CO4 - Architect NoSQL databases with MongoDB.
CO5 - Implement a full-stack single page application using React, NodeJS
CO6 - Apply advanced client side scripting and ReactJS framework to develop applications.

B.E/B.Tech REGULAR REGULATIONS 2023


95
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Media, Inc, 7th Edition, 2020.
2. Matt Frisbie, "Professional JavaScript for Web Developers", Wiley Publishing, Inc, 4 th Edition,
ISBN: 978-1-119-36656-0, 2019.
3. nd Edition, 2020.

4. -Wesley Professional, 2nd Edition, 2016.


5.
1st edition, 2017.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


96
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SITB3006 UI / UX DESIGN
3 0 0 0 3 100

COURSE OBJECTIVES
To provide students with the knowledge of user-centered design, graphic design on screens,
simulation and prototyping techniques, usability testing methods, interface technologies and user
centered design in corporate perspective.
The course is organized around a practical project with iterative design of a graphical user interface
to organize information about users into useful summaries with affinity diagrams.
To convey user research findings with personas and scenarios and to learn the skill of sketching as
a process for user experience design.

UNIT 1 INTRODUCTION TO UI 9 Hrs.


What is User Interface Design (UI) -Relationship between UI and UX , Roles in UI/UX, A brief historical
Overview of interface design, Interface conventions, Approaches to screen based UI, Template vs
Content, Formal elements of interface design, Active elements of interface design, Composing the
elements of interface design, UI design process, Visual communication design component in interface
design.

UNIT 2 INTRODUCTION TO UX 9 Hrs.


UX Basics - Foundation of UX design - Good and poor design - Understanding your users - Designing
the experience - Elements of user experience - Visual design principles - Functional layout - Interaction
design - Introduction to the interface - Navigation design - User testing -Developing and releasing your
design.

UNIT 3 WIREFRAMING FOR UI DESIGNERS 9 Hrs.


Wire framing - Why and how to create wireframes - Issues to solve steps in creating a wireframe
Designing on a Grid System (like Bootstrap) - Get critiques incorporate feedback and improve your
designs - Wireframe to refined design iterate and refine - Understanding the mobile experience.

UNIT 4 UI OR VISUAL DESIGN CONCEPTS 9 Hrs.


Color Harmonies - Creating contrast with color guidelines for proper color usage - Typography and Fonts
Display Text (Such as Headings) versus Body Text Legibility Type Trends Typeface Selection and Pairing
Where to Get Web Fonts Ideal Line Height Column Width (Line Length) Hyphenation and Justification
Design Elements Proximity Similarity Continuity.

UNIT5 THE BUSINESS OF UX and UI DESIGN 9 Hrs.


UX and UI design industry getting into the business - Strategies and ideas - Resources - Creating your
portfolio website - Examples of UX and UI portfolio websites - What you should include on your portfolio
website - Get 1-on-1 feedback on your case studies and portfolio website -Resume development what
you should include on your resume - Get 1-on-1 feedback on your resume.

Max. 45 Hrs.

B.E/B.Tech REGULAR REGULATIONS 2023


97
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

COURSE OUTCOMES
On completion of the course, student will be able to:
CO1 - Understand the definition and principles of UI/UX Design in order to design with intention.
CO2 - Achieve a deep understanding of the entire life cycle of design the process, purpose, and tools.
CO3 - Discover the industry-standard tools and specific project deliverables in UI/UX.
CO4 - Explain why you made design decisions, through presentations of assignments.
CO5 - Apply the user Interfaces to different devices and requirements,
CO6 - Create high quality professional documents and artifacts related to the design process.

TEXT / REFERENCE BOOKS


1. Harvey and Paul Deiteland
Wide Web - 5th Edition, Pearson Education, 2011
2. Achyut S Godbole and Atul 2nd Edition, Tata McGraw Hill,
2012.
3. 3rd Edition, Tata
McGraw Hill, 2013
4. Jesse James Garre The Elements of User Experience: User-Centered Design for the Web
and Beyond , 2nd Edition, Pearson Education. 2011.
5. The Essential Guide to User Interface Design: An Introduction to GUI
Design Principles and Techniques , 3rd Edition, Wiley Publishing, 2007.
6. The UX Book Process and Guidelines for Ensuring a
Quality User Experience , Elsevier, 2012.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


98
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SITB3007 WEB DEVELOPMENT BOOTCAMP
3 0 0 0 3 100

COURSE OBJECTIVES
To create web application using cutting edge technologies.
To learn about JavaScript, functions and invocation patterns.
To master backend development with Node JS.

UNIT 1 INTRODUCTION TO HTML AND CSS 9 Hrs.


Fundamentals/ basic HTML - Text formatting on web pages Hyperlinks - Complex image maps - tables
and nested tables - Inserting web page - Setting and modifying field properties - Validating HTML -
Designing with style sheets - Style Sheet Syntax - ID - Class Contextual Selectors - Cascading Order
Properties.

UNIT 2 INTRODUCTION TO JAVASCRIPT 9 Hrs.


Data Types - Javascript variables - Naming and naming conventions for Javascript variables - String
concatenation - String lengths and retrieving the number of characters - Basic arithmetic and the modulo
operator in Javascript - Increment and decrement expressions - Functions and invocation patterns -
Intermediate JavaScript - JS objects and prototypes.

UNIT 3 DOCUMENT OBJECT MODEL (DOM) AND JQUERY 9 Hrs.


Tree structure of HTML based websites - Manipulate and change the HTML elements using DOM -
Installing and using the jQuery framework - jQuery functionality Selectors HTML manipulation

UNIT 4 BOOTSTRAP 9 Hrs.


Fundamentals of UI design for websites - Bootstrap framework - Bootstrap grid layout system Bootstrap
CSS buttons Bootstrap CSS forms Bootstrap CSS tables - Bootstrap navigation bars

UNIT 5 NODE JS 9 Hrs.


Components of back-end development - Apply concepts like data types, objects, methods, object-
oriented programming and classes in the context of backend development - Server-side JavaScript -
JavaScript build processes - File system interaction

Max. 45 Hrs.

COURSE OUTCOMES
Upon completion of the course the student will be able to
CO1 - Understand how website work and how HTML, CSS contribute.
CO2 - Design user interactions on web pages.
CO3 - Develop back end website applications.
CO4 - Prepare mock-ups and storyboards for a web development project.
CO5 - Explore new methods of development in web applications and programming languages.
CO6 - Manage a project from conception to finished product.

B.E/B.Tech REGULAR REGULATIONS 2023


99
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCES BOOKS


1. Full-Stack React Projects: Learn MERN Stack Development by Building
Modern Web Apps Using MongoDB, Express, React, and Node.js , 2nd Edition 2020.
2. Frank Zammetti Modern Full-Stack Development: Using TypeScript, React, Node.js ,
Webpack, and Docker, 2020.
3. https://www.javatpoint.com/document-object-model.
4. https://www.geeksforgeeks.org/how-do-you-run-javascript-script-through-the-terminal.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


100
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

INTRODUCTION TO L T P EL Credits Total Marks


SITB3008
JAVASCRIPT 3 0 0 0 3 100

COURSE OBJECTIVES
To learn to use best-practice idioms and patterns.
To understand concepts commonly used in dynamic language programming, such as introspection,
higher-order functions, closures and advanced language features such as prototypical inheritance.
To become adept at implementing client-side interfaces through the use of the DOM, jQuery and
AJAX.

UNIT 1 INTRODUCTION AND LANGUAGE SYNTAX 9 Hrs.


Java Script Advantages Variable declaration operators - Control statements - Error handling -
Understanding arrays.

UNIT 2 FUNCTIONS 9 Hrs.


Function declaration and invocation syntax - Anonymous functions - Functions as data-
The arguments object - Variadic functions - Optional parameters - Named parameters - Function
overloading - Duck typing.

UNIT 3 HTML FORMS AND DOM 9 Hrs.


Tags - Document structure Elements - Text, forms, images, blocks and frames Selectors- Cascading
and inheritance - Text and color types - The box model Layout -The DOM as a document API - Browser
information - The setTimer and setTimeout - Element lookup - Tree traversal -Attribute getting and setting
- Creating and deleting nodes - Events.

UNIT4 AJAX WITH JQUERY 9 Hrs.


Overview of jQuery - Cross-browser compatibility -The $ function object - Element selectors - Tree
traversal -Node creation, insertion, modification and deletion - Getting and setting attributes, styles and
class - Wrapping and unwrapping DOM raw objects AJAX - Asynchronous communication - Callback
functions - The get and post formats - Same-origin policy - Cross-origin requests with JSONP - AJAX
polling.
.
UNIT5 NODEJS 9 Hrs.
Server-side scripting - Threaded vs event-based server models -Working with callbacks - Express web
framework.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Identify the method required to produce a certain outcome or solve a problem using JavaScript.
CO2 - Apply invaluable built-in JavaScript methods.
CO3 - Develop fun, interactive, and dynamic JavaScript web apps, games, and pages.
CO4 - Identify the method required to produce a certain outcome or solve a problem using JavaScript.
CO5 - Apply invaluable built-in JavaScript methods.
CO6 - Develop fun, interactive, and dynamic JavaScript web apps, games, and pages.

B.E/B.Tech REGULAR REGULATIONS 2023


101
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Crockford, 2008.
2. Flanagan,
3. Fulton, Steve, and Fulton, Animation for
2013.
4. Resig, John, Bibeault, 2013.
5. Mulder, ent with Backbone.js: Scalable Application
O'Reilly Media, 2014.
6. -Depth Guide for
Media, 2014.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


102
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

BACK END TOOLS FOR FULL L T P EL Credits Total Marks


SITB3009
STACK DEVELOPMENT 3 0 0 0 3 100

COURSE OBJECTIVES
To familiarize students with the basics of Back End Development, including programming languages,
web servers, databases, and data modelling techniques.
To introduce students to the various Back End tools and techniques used in developing, testing, and
deploying web applications.
To expose students to real-world case studies of Back End tools and technologies used in creating
e-commerce, social media, and financial services applications.

UNIT 1 DEFINITION AND OVERVIEW OF FULL STACK DEVELOPMENT 9 Hrs.


Introduction to full stack development - Overview of full stack development -History and evolution of full
stack development - Role of back end tools in full stack development -Role of back end tools in full stack
development - Understanding the back end of a web application - Back end tools and technologies.
Overview of front end and back end technologies - Front end technologies (HTML, CSS, JavaScript, etc.)
- back end technologies (Programming languages, Web servers, Databases, etc.) - Understanding the
interaction between front end and back end.

UNIT 2 PROGRAMMING LANGUAGES FOR BACK END DEVELOPMENT 9 Hrs.


Programming languages for back end development (Java, Python, PHP, Ruby, etc.) - Web servers and
frameworks (Node.js, Flask, Django, Rails, etc.) -Databases and data modeling (SQL, NoSQL, ORM,
etc.)-RESTful APIs (HTTP, JSON, XML, etc.).

UNIT 3 TOOLS AND TECHNIQUES FOR BACK END DEVELOPMENT 9 Hrs.


Version control with git (creating repositories, branching, merging, pull requests, etc.) - Testing and
debugging (unit testing, integration testing, debugging tools and techniques, performance testing, etc.) -
DevOps and deployment (continuous integration and deployment, deployment tools, infrastructure as
code, containerization with Docker, etc.) - Security in back end development (common security threats,
authentication and authorization, encryption and hashing, OWASP top ten vulnerabilities, etc.).

UNIT 4 PERFORMANCE OPTIMIZATION AND SCALABILITY 9 Hrs.


Scaling and performance optimization (horizontal and vertical scaling, load balancing and clustering,
caching and content delivery networks, monitoring and optimization, etc.) - Real-time communication with
web sockets (understanding web sockets, implementing web sockets with Node.js and Socket.IO,
broadcasting and chatting applications, etc.) - Microservices architecture (overview of microservices,
benefits and challenges of microservices, implementing microservices with Docker and Kubernetes,
service mesh and API gateways, etc.).

UNIT 5 BEST PRACTICES AND FUTURE TRENDS 9 Hrs.


Case studies of back end tools in Real-world applications (e-commerce, social media, financial services,
etc.) - Best practices for back end development (clean code, design patterns, error handling, etc.) -
Trends and future of back end tools (serverless computing, machine learning, blockchain, etc.)

Max. 45 Hrs.

B.E/B.Tech REGULAR REGULATIONS 2023


103
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

COURSE OUTCOMES
On successful completion of a course students will be able to
CO1 - Understand the fundamentals of full stack development and the role of back end tools in creating
modern web applications.
CO2 - Demonstrate proficiency in at least one programming language and web framework commonly
used in back end development.
CO3 - Build RESTful APIs using various Back End tools and techniques, including data interchange
formats and HTTP methods.
CO4 - Implement performance optimization and scalability techniques, including micro services
architecture and real-time communication with web sockets.
CO5 - Analyze and apply Back End tools and technologies to solve real-world problems in e-commerce,
social media, and financial services applications.
CO6 - Identify and evaluate current and future trends in Back End Development, including serverless
computing, machine learning, and blockchain.

TEXT / REFERENCE BOOKS


1. Back-End Development with Python and Flask Packt Publishing, 2018.
2. Freeman, Adam, Web Development with Node and Express: Leveraging the JavaScript Stack,
O'Reilly Media, 2014.
3. Rails, David, et al. Agi Pragmatic Bookshelf, 2017.
4. Shifflett, Scott PHP 7 Programming Cookbook: Over 80 recipes that will take your PHP 7 web
development skills to the next level! Packt Publishing, 2016.
5. Kim, Euiseong, et al. Django Design Patterns and Best Practices: Industry-standard web
development techniques and solutions using Python , 2nd edition Packt Publishing, 2019.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


104
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

FULL STACK DEVELOPMENT L T P EL Credits Total Marks


SITB3010
FRAMEWORK 3 0 0 0 3 100

COURSE OBJECTIVES
To become knowledgeable about HTML and CSS.
To familiarize pupils with the components of JSX and React JS.
To gain expertise in MongoDB and Python connectivity.

UNIT 1 HTML 9 Hrs.


Introduction to HTML- Browsers and HTML - offline and online -Tags, Attribute and elements -
Doctype element Comments - Headings, paragraphs, and formatting text - Lists and links - Images and
tables.

UNIT 2 CSS AND JAVASCRIPT 9 Hrs.


Introduction CSS - Applying CSS to HTML - Selectors, properties and values - CSS Colors and
backgrounds - CSS box model - CSS margins, padding, and borders-CSS text and font properties-CSS
general topic.
Introduction to JavaScript - Applying JavaScript (internal and external) - Understanding JS syntax -
Introduction to document and window ObjectVariables and operators - Data types and Num type
conversion - Math and string manipulation - Objects and arrays - Date and time - Conditional statements
- Switch case - Looping in JS- Functions.

UNIT 3 REACT JS 9 Hrs.


React JS Introduction - Templating using JSX - Components, state and props - Lifecycle of components
- Rendering list and portals - Error handling - Routers Redux and Redux saga -Immutable.js - Service
side rendering - Unit testing - Webpack.

UNIT 4 NODE JS 9 Hrs.


Node js overview - Node js - Basics and setup-Node js console-Node js command utilities - Node js
modules - Node js concepts - Node js events - Node js with express js - Node js database access.

UNIT 5 MONGODB AND PYTHON 9 Hrs.


MongoDB - SQL and NoSql concepts - Create and manage MongoDB - Migration of data into MongoDB
- MongoDB with PHP - MongoDB with NodeJS - Services offered by MongoDB - Python-Python
installation and configuration - Developing a Python ApplicationConnect MongoDB with Python
Installation and configuration - Developing a Python application - Connect MongoDB with Python.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Learn basic HTML commands.
CO2 - Apply CSS commands to design web pages.
CO3 - Apply JSX-components, lifecycle of components.
CO4 - Comprehend basics and Setup-Node js.
CO5 - Connect MongoDB with python.
CO6 - Develop web pages and validate for real time application.

B.E/B.Tech REGULAR REGULATIONS 2023


105
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. th Indian Reprint, 2008.
2. Martin C.
3.
Congress.
4. How to Program , Prentice Hall,
5th Edition, 2011.
5. , Pearson
Education, 2011.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


106
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

INTRODUCTION TO RASPBERRY PI L T P EL Credits Total Marks


SCSB3010
AND ARDUINO 3 0 0 0 3 100

COURSE OBJECTIVES
To provide skills for interfacing sensors and actuators with different IoT architectures.
To understand the various means of communication from Node / Gateway to cloud platforms.
To capable of developing various applications using raspberry pi.

UNIT 1 INTRODUCTION TO SENSORS 9 Hrs.


Sensors - Classification of Sensors - Roles of sensors in IOT - Various types of sensors - Design of
sensors - Sensor architecture - Special requirements for IOT sensors - Role of actuators - Types of
actuators - Transducers.

UNIT 2 IoT WITH ARDUINO 9 Hrs.


Introduction to the Arduino -About the Arduino Board - Creating an Arduino programming environment,
Creating an Arduino program - Using Libraries - Working with digital interfaces - Interfacing with analog
devices - Adding interrupts - Communicating with devices using sensors - Working with motors - Using
an LCD.

UNIT 3 PROGRAMMING ESP 8266 MODULE 9 Hrs.


ESP 8266 Wi-Fi Serial Module: Overview - Setting up the hardware - Interfacing with Arduino - Creating
an IoT temperature and humidity sensor system - Overview of DHT-22 sensor - Interfacing the hardware:
Arduino, ESP 8266 Wi-Fi module, and DHT-22 sensor - Checking your data via ThingSpeak- Connecting
your Arduino set-up to Blynk via Wi-Fi.

UNIT 4 INTRODUCTION TO RASPBERRY PI 9 Hrs.


Introduction to Raspberry Pi - About the Raspberry Pi board: Hardware layout - Operating systems on
Raspberry Pi -Configuring Raspberry Pi - Programming Raspberry Pi with Python - Raspberry Pi
interfaces - Controlling LED with Raspberry Pi - Interfacing an LED and switch with Raspberry Pi -
Interfacing a light sensor (LDR) with Raspberry Pi - Wireless temperature monitoring system using Pi.

UNIT 5 IoT DESIGN USING RASPBERRY PI 9 Hrs.


IoT applications based on Pi - LAMP Web-server - GPIO control over web browser - Creating custom
web page for LAMP - Communicating data using on-board module - Home automation using Pi - Node-
RED - MQTT Protocol - Using Node-RED Visual Editor on Rpi.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Understand general concepts of IoT also recognize various devices, sensors and applications.
CO2 - Create IoT solutions using sensors, actuators and devices.
CO3 - Demonstrate Arduino programming language and IDE.
CO4 - Understand the working of Raspberry Pi, its features and how various components can be used
with Pi.
CO5 - Create the Raspberry Pi interfaces with Python.
CO6 - Design real time IoT Devices.

B.E/B.Tech REGULAR REGULATIONS 2023


107
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Vijay Madisetti and Arshdeep Bahga, Internet of Things (A Hands-On-Approach) , 1st Edition,
VPT, 2016.
2. Richard Blum, Arduino Programming in 24 Hours , Sams Teach Yourself, Pearson Education,
2017.
3. Paul Scherzand Simon Monk, Electronics for Inventors , 3rd Edition, 2016.
4. Making Sense of Sensors: End-to-End Algorithms and Infrastructure
2016.
5.
6. Eben Upton and Gar th edition, John

Wiley and Sons.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


108
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3011 Iot PLATFORMS AND SYSTEM DESIGN
3 0 0 0 3 100

COURSE OBJECTIVES
To learn about various IoT related protocols, smart objects and IoT architectures.
To build simple IoT systems using Arduino and Raspberry Pi.
To develop IoT infrastructure for popular applications.

UNIT 1 INTRODUCTION TO IoT 9 Hrs.


Introduction to IoT - Current technological trends and future prospects - Evolution of IoT - IoT Devices -
IoT Devices vs. Computers - Trends in the adoption of IoT - Societal benefits of IoT - Business scope,
Relation with embedded system - IoT reference architecture Physical-logical design of IOT - From M2M
to IoT, Software define network.

UNIT 2 IoT PLATFORMS DESIGN METHODOLOGY 9 Hrs.


Introduction - IoT Design and Methodology - Purpose and requirements specification - Process
specification - Domain model specification - Information model specification - Service specification - IoT
level specification - Functional view specification - Operational view specification - Device and component
integration - Application development.

UNIT 3 IoT AND CLOUD 9 Hrs.


Interoperability in IoT - Introduction to Arduino Programming - Integration of sensors and actuators with
Arduino Cloud computing in IoT - IoT in cloud architecture - Logging on to cloud- Cloud based IoT
platforms - IBM Watson, Google cloud.

UNIT 4 DATA ANALYTICS AND SUPPORTING SERVICES 9 Hrs.


Structured vs unstructured data and data in motion vs data in Rest Role of machine learning No SQL
databases Hadoop ecosystem Apache Kafka - Apache Spark Edge streaming analytics and network
analytics Xively Cloud for IoT, Python web application framework Django AWS for IoT System
Management with NETCONF-YANG- Cisco IoT system - IBM Watson IoT platform.

UNIT 5 CASE STUDIES / APPLICATION BUILDING WITH IoT 9 Hrs.


Introduction- Smart perishable tracking with IoT and sensors - Smart Healthcare Elderly fall detection
with IoT and sensors - Smart inflight lavatory maintenance with IoT IoT Based application to monitor
water quality - Smart warehouse monitoring - Smart retail IoT possibilities in the retail sector -
Prevention of drowsiness of drivers by IoT - Based smart driver assistance systems - System to measure
collision impact in an accident with IoT - Integrated vehicle health management.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Understand integrating IoT Services to other third party clouds.
CO2 - Illustrate the application of IoT in various domains.
CO3 - Interpretation of different IoT platforms design methodology.
CO4 - Interpret the vision of IoT from a global context.
CO5 - Apply data analytics and use cloud offerings related to IoT.
CO6 - Analyze applications of IoT in real time scenario.

B.E/B.Tech REGULAR REGULATIONS 2023


109
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. David Hanes, Gonzalo Salgu

Cisco Press, 2017.


2. Key applications

3. -
swan Private Limited - New Delhi; edition (2015).
1st
4. Jan Ho¨ ller, Vlasios Tsiatsis , Catherine Mulligan, Stamatis , Karnouskos, Stefan Avesand.
David Boyle, "From Machine-to-Machine to the Internet of Things - Introduction to a New Age
of Intelligence", Elsevier, 2014.
5. Hakima Chaouchi, -1-
84821-140-7, Wiley Publications.
6. Internet of Things, RMD Sundaram Shriram K Vasudevan, Abhishek S Nagarajan, John
Wiley and Sons.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


110
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

IoT ARCHITECTURE AND ITS L T P EL Credits Total Marks


SCSB3012
PROTOCOLS 3 0 0 0 3 100

COURSE OBJECTIVES
To understand smart objects and IoT architectures.
To understand design methodology for IoT platforms.
To learn management and security protocols of IoT.

UNIT 1 INTRODUCTION TO IoT 9 Hrs.


Basics of internet of things (IoT): Introduction to Internet of Things - Physical design of IOT - Logical
design of IOT - IOT levels - IOT enabling technologies: Wireless sensor networks - Cloud computing -
Big data analytics - Communication protocols - Domain specific IOTs: Home automation, Cities,
Environment, Energy, Retail, Logistics, Agriculture, Industry, Health and Life Style.

UNIT 2 IoT ARCHITECTURE AND DESIGN 9 Hrs.


Drivers IoT Architecture: oneM2M, IoT World Forum (IoTWF) and alternative IoT models Simplified
IoT Architecture The core IoT functional stack IoT data management and compute stack: Fog, Edge
and Cloud in IoT.

UNIT 3 IoT DATA LINK AND NETWORK LAYER PROTOCOL 9 Hrs.


IEEE 802.15.4e - IEEE 802.11 - Wireless HART - Z-Wave - Bluetooth Low Energy- Zigbee smart energy-
DASH7- HomePlug - G.9959 - LTE-A- LoRaWAN- Weightless-DECT/ULE - Network layer: IPv4 - IPv6 -
6LoWPAN - 6TiSCH - ND DHCP- ICMP RPL CORPL CARP.

UNIT 4 TRANSPORT and SESSION LAYER PROTOCOLS 9 Hrs.


Transport Layer: TCP MPTCP UDP DCCP SCTP - TLS - DTLS Session layer: HTTP- CoAP -
XMPP - AMQP MQTT - SMQTT DDS.

UNIT 5 IoT MANAGEMENT AND SECURITY PROTOCOLS 9 Hrs.


Interconnection of heterogeneous datalinks - Smart transducer interface - Security in IoT protocols: MAC
802.15.4 - 6LoWPAN RPL- TLS-SSL IoT challenges.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Understand building blocks of Internet of Things and characteristics.
CO2 - Identify the basics of various IoT architecture.
CO3 - Analyze applications of IoT in real time scenario
CO4 - Understand the characteristics of protocols in data link.
CO5 - Understand the characteristics of protocols in network layers
CO6 - Apply security mechanism related to IoT.

B.E/B.Tech REGULAR REGULATIONS 2023


111
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1.

Cisco Press, 2017.


2. Key applications

3. -
swan Private Limited - New Delhi; edition (2015).
1st
4. Jan Ho¨ ller, Vlasios Tsiatsis , Catherine Mulligan, Stamatis , Karnouskos, Stefan Avesand.
David Boyle, "From Machine-to-Machine to the Internet of Things - Introduction to a New Age
of Intelligence", Elsevier, 2014.
5. -1-
84821-140-7, Wiley Publications.
6. Internet of Things, RMD Sundaram Shriram K Vasudevan, Abhishek S Nagarajan, John Wiley
and Sons.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


112
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

WIRELESS TECHNOLOGY, SECURITY L T P EL Credits Total Marks


SCSB3013
AND COMMUNICATION PROTOCOLS 3 0 0 0 3 100

COURSE OBJECTIVES
To understand the fundamentals of wireless sensor networks and its application.
To learn about the issues and challenges in the design of wireless technology.
To understand the transport layer and security issues possible in ad hoc and sensor networks.

UNIT 1 INTRODUCTION 9 Hrs.


Introduction: Fundamentals of wireless communication technology - Electromagnetic spectrum radio
propagation - Characteristics of wireless channels - Modulation techniques - Multiple access techniques
-wireless LANs, PANs, WANs, and MANs, Wireless internet. Key definitions of sensor networks - Unique
constraints and challenges - Advantages of sensor network - Driving applications - Issues in wireless
networks - Issues in design of sensor network - Sensor network architecture - Data dissemination and
gathering.

UNIT 2 MEDIUM ACCESS CONTROL PROTOCOLS 9 Hrs.


MAC Protocols: Issues in designing MAC protocols for ad hoc wireless networks - Design goals -
Classification of MAC protocols - MAC protocols for sensor network - Location discovery Quality - other
issues - S-MAC - IEEE 802.15.4.

UNIT 3 ROUTING PROTOCOLS 9 Hrs.


Routing Protocols: Issues in designing a routing protocol - Classification of routing protocols- Table-driven
- On-demand Hybrid Flooding Hierarchical and power aware routing protocols.

UNIT 4 TRANSPORT AND QoS IN WIRELESS SENSOR NETWORKS 9 Hrs.


Data-Centric and Contention - Based networking Transport layer and QoS in wireless sensor networks
Congestion control in network processing Operating systems for wireless sensor networks
Examples.

UNIT 5 SECURITY IN WSN 9 Hrs.


Security attacks Key distribution and management Intrusion detection Software based anti-tamper
techniques Water marking techniques Defense against routing attacks - Secure ad hoc routing
protocols Broadcast authentication WSN protocols TESLA Biba Sensor network security protocols
SPINS.
Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, the student should be able to
CO1 - Understand the fundamentals of wireless technology.
CO2 - Technically know how in building a WSN network.
CO3 - Identify different issues in wireless networks.
CO4 - Apply the knowledge to identify appropriate physical and MAC layer protocols.
CO5 - Understand the transport layer and security issues in sensor networks.
CO6 - Analyse the various critical parameters in deploying a WSN.

B.E/B.Tech REGULAR REGULATIONS 2023


113
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERNCE BOOKS


1. C. Siva Ram Murthy, and B. S. Manoj, "AdHoc Wireless networks ", Pearson Education - 2008.
2. Feng Zhao and Leonides Guibas, "Wireless sensor networks ", Elsevier publication - 2004.
3. Jochen Schiller, "Mobile Communications", Pearson Education, 2nd Edition, 2003.
4. William Stallings, "Wireless Communications and Networks ", Pearson Education 2004
5.
wiley publication, Jan 2006.
6.
7.
computer networks, Elsevier, 2002, 394 - 422.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


114
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3014 SENSORS AND ACTUATORS
3 0 0 0 3 100

COURSE OBJECTIVES
To understand basics of sensors, actuators and their operating principle.
To provide information about interfacing of sensors and signal conditioning circuits to establish any
control system or monitoring system.
To provide knowledge about simulation and characterization of different sensors and to provide an
understanding on characteristic parameters to evaluate sensor performance.

UNIT 1 SENSORS/TRANSDUCERS 9 Hrs.


Sensors/Transducers Principles Classification Parameters Characteristics - Environmental
Parameters (EP) - Characterization.
Mechanical and Electromechanical Sensors: Introduction - Resistive potentiometer - Strain gauge -
Inductive sensors - Capacitive sensors - Electrostatic transducer - Force/stress sensors using Quartz
resonators - Ultrasonic sensors.

UNIT 2 THERMAL / MAGNETIC SENSORS 9 Hrs.


Gas thermometric sensors - Acoustic temperature sensor - Nuclear thermometer - Magnetic thermometer
- Resistance change type thermometric sensors Thermo emf sensors - The PTAT sensor - Thermal
radiation sensors - Quartz crystal thermoelectric sensors.
Magnetic Sensors: Magneto resistive sensors - Hall effect and sensors - Inductance and Eddy current
sensors - Switching magnetic sensors: The Wiegand sensor - The Pulse wire sensor - SQUID sensors.

UNIT 3 RADIATION SENSORS 9 Hrs.


Basic Characteristics - Types of Photosensistors / Photodetectors - X-ray and nuclear radiation sensors
- Fibre optic sensors - Recent trends in sensor technologies: Film sensors - Thick film sensors - Thin film
sensors - Semiconductor IC technology - Standard methods - Micro electromechanical systems (MEMS)
- Nano-sensors.

UNIT 4 SENSORS AND THEIR APPLICATIONS 9 Hrs.


On-board Automobile Sensors - Flow-rate sensors - Pressure sensors -Temperature sensors - Oxygen
sensors -Torque and position sensors - Home appliance sensors - Aerospace sensors - Static Pressure
sensors - Temperature sensing - Fluid velocity sensors - Sensing direction of air-flow - Measuring air-
speed on Aircrafts -monitoring strain - Force, Thrust, and Acceleration - Sensors for manufacturing -
Distance sensing - Medical diagnostic sensors - Sensors for environmental monitoring.

UNIT 5 ACUTATORS 9 Hrs.


Actuators: Pneumatic and hydraulic actuation systems - Actuation systems - Pneumatic and hydraulic
systems -Directional control valves - Pressure control valves - Cylinders, servo and proportional control
valves - Process control valves - Rotary actuators - Mechanical actuation systems - Types of motion -
Kinematic chains, Cams, Gears, Ratchet and pawl - Belt and chain drives Bearings - Mechanical
aspects of motor selection - Electrical actuation systems - Electrical systems - Mechanical switches -
Solid-state switches Solenoids - D.C. Motors - A.C. motors - Stepper motors.

Max. 45 Hrs.

B.E/B.Tech REGULAR REGULATIONS 2023


115
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

COURSE OUTCOMES
On completion of the course, the student should be able to
CO1 - Understand the principle of operation of different sensors and their applications .
CO2 - Be updated on the recent trends in sensor technologies.
CO3 - Analyze various premises, approaches, procedures and results related to sensors and actuators.
CO4 - Create analytical design and development solutions for sensors and actuators.
CO5 - Conduct experiments and measurements in laboratory and on real components, sensors and
actuators.
CO6 - Describe development and application of sensors and actuators and take part in team work and
be able to independently present various professional materials.

TEXT / REFERENCE BOOKS


1.
2.
3.
Springer Verlag NEwyork, Inc, 1997.
4. 4th
edition, Springer, 2010.
5.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


116
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

BLOCKCHAIN TECHNOLOGY FOR BUSINESS L T P EL Credits Total Marks


SCSB3016
INNOVATION AND APPLICATIONS 3 0 0 0 3 100

COURSE OBJECTIVES
To know how the structures and architecture of firms in blockchain.
To learn about collaborations of society in blockchain.
To develop blueprint for new social contract and understand various trust models.

UNIT 1 INTRODUCTION TO BUSINESS MODELS 9 Hrs.


Business models - Opportunities for blockchain to disrupt or displace traditional centralized business
models Bitcoin - Double spending problem - No-censorable content - Trustless transactions - Smart
contracts and autonomous agents.

UNIT 2 BLOCKCHAIN AND THE C-SUITE 9 Hrs.


Blockchain and the C-Suite - How blockchain changes the deep structures and architecture of the firm -
Impact of block chain on management and the roles of the C-Suite - Navigating the balance between
- Impact of blockchain technologies on businesses.

UNIT 3 THE NEXT ERA 9 Hrs.


Leadership for the Next Era - Blockchain as a tool - Costless verification - Blockchain technology and
last mile problem - Self-governance of blockchain through collaborations of civil society, private sector,
government, and stakeholders in non- state networks - The idea of blockchain governance networks -
How blockchain governance networks can support blockchain stewardship at three levels - The platform
level - The application level, and the ecosystem level - The conditions that are necessary for a blockchain
- based hub of innovation to succeed.

UNIT 4 DIGITAL CONTRACTING 9 Hrs.


Blueprint for a New Social Contract - Digital revolution unfolds - Global economy - Labour markets, old
institutions, and society as a whole - The potential of the blockchain revolution - Need of business leader
collaboration in a new social contract - Self-sovereign identity and web3.0 technological stack -
Bootstrapping network effects through blockchain technology and crypto economics.

UNIT 5 THE FUTURE OF BLOCKCHAIN TECHNOLOGY 9 Hrs.


Trust and vulnerability - impact of AI on block chain - Digital privacy - Short history of the scaling out of
human trust - High and low trust societies - Types of trust model: Peer-to-Peer, Leviathan, and
Intermediary.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Analysis opportunity in blockchain properly.
CO2 - Able to implement any problem by writing their own business idea.
CO3 - Define a Suitable Model.
CO4 - Analyzing business and propose model in blockchain.
CO5 - Design an efficient blockchain business administrator.
CO6 - Realize the trust and vulnerability in block chain.

B.E/B.Tech REGULAR REGULATIONS 2023


117
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Drescher, - Apress, 2017.
2. Narayanan, Arvind., Bonneau, Joseph., Felten, Edward., Miller, Andrew., Goldfeder, Steven,
Princeton University
Press, 2016.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


118
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3017 CYBER DIGITAL TWIN
3 0 0 0 3 100

COURSE OBJECTIVES
To gain knowledge in cyber security and digital firmware.
To understand about Risk Management and Twin Constructions.
To make students aware of security concerns while implementing cyber digital twin technology.

UNIT 1 INTRODUCTION 9 Hrs.


Introduction - Cyber Digital Twin - Definition Benefits - Need for digital twin - Working principle - Digital
thread - Digital shadow - Building blocks of digital twin - Digital twin technology drivers and enablers.

UNIT 2 DATA MODELLING ENVIRONMENT 9 Hrs.


Types of digital twin - Based on Product and Process - Based on Functionality - Based on Maturity -
Development considerations - Overview of Data Modelling Environment - Model and data management
- Managing data - Implementing the model - Cloud and IOT technologies.

UNIT 3 DIGITAL TWIN OPTIMIZATION 9 Hrs.


Cyber range vs digital twin - Human behavior modelling in digital twin - Optimization using digital twin -
Digital twin and cyber security - Techniques. Technologies - Industrial IOT and Digital Twin - Simulation
and Digital Twin - Machine Learning and Digital Twin - Virtual Reality and Digital Twin - Cloud Technology
and Digital Twin.

UNIT 4 RISK MANAGEMENT 9 Hrs.


Digital Twin and Risk Assessment - Digital Twin reference model Implementation - Development of risk
assessment plan - Development of communication and control system - Development of digital twin tools
Integration - platform validation Difficulties - Practical implications.

UNIT 5 APPLICATIONS 9 Hrs.


Applications: Digital Twin in Manufacturing - Digital Twin in Automotive - Digital Twin in Healthcare -
Digital Twin in Utilities - Digital Twin in Construction - Digital Twin in Education - Digital Twin in Medicine.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Implement fundamental Cyber System and Digital Twin Technology
CO2 - Understand types and data modeling of Digital twin
CO3 - Understand the optimization, simulation and validation
CO4 - Identify the risks and Control development
CO5 - Understand the application in different fields
CO6 - Develop applications using Cyber Digital Twin Technologies

B.E/B.Tech REGULAR REGULATIONS 2023


119
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Cyber-physical System and Digital Tw - Part of
the Lecture Notes in Networks and Systems book series.
2. Developm
Elsevier, 2020.
3. Hacking Exposed Industrial Control Systems: ICS and SCADA Security Secrets & Solutions
(1st Edition), by Clint Bodungen, Bryan Singer, Aaron Shbeeb, Kyle Wilhoit, and Stephen
Hilt, ISBN: 978-1259589713.
4. Applied Cyber Security and the Smart Grid: Implementing Security Controls into the Modern
Power Infrastructure (1st Edition), by Eric D. Knapp and Raj Samani.
5. The Art of Invisibility - Kevin Mitnick,2017.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


120
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB1461 BLOCKCHAIN DESIGN AND USE CASES 0
3 0 0 3 100

COURSE OUTCOMES
To learn blockchain basics and primitives along with architecture
To understand how to consensus, work along with design goals.
To create privacy and security policy and cryptography schemes

UNIT 1 INTRODUCTION TO BLOCKCHAIN 9 Hrs.


Digital Money to Distributed Ledgers, Design Primitives: Protocols, Security, Consensus, Permissions,
Privacy. Blockchain Architecture and Design: Basic crypto primitives: Hash, Signature,) Hashchain to
Blockchain, Basic consensus mechanisms.

UNIT 2 CONSENSUS 9 Hrs.


Requirements for the consensus protocols, Proof of Work (PoW), Scalability aspects of Blockchain
consensus protocols, Permissioned Blockchains: Design goals, Consensus protocols for
Permissioned Blockchains.

UNIT 3 HYPERLEDGER FABRIC 9 Hrs.


Hyperledger Fabric (A): Decomposing the consensus process, Hyperledger fabric components,
Chaincode Design and Implementation Hyperledger.
Fabric (B): Beyond Chaincode: fabric SDK and Front End (b) Hyperledger composer tool.

UNIT 4 USE CASES 1 AND 2 9 Hrs.


Use case 1: Blockchain in Financial Software and Systems (FSS): (i) Settlements, (ii) KYC, (iii)Capital
markets, (iv) Insurance
Use case 2: Blockchain in trade/supply chain: (i) Provenance of goods, visibility, trade/supply chain
finance, invoice management discounting, etc

UNIT 5 USE CASE 3 9 Hrs.


Blockchain for Government: (i) Digital identity, land records and other kinds of record keeping
between government entities, (ii) public distribution system social welfare systems Blockchain
Cryptography, Privacy and Security on Blockchain.

Max. 45 Hrs.
COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Describe basics of blockchain and hash functions..
CO2 - Understand the concepts of consensus and protocol.
CO3 - Define Hyperledger fabric components and design policies.
CO4 - Design use cases related to trade/supply chain finance.
CO5 - Ability to design real life situational problems like insurance, KYC, etc.
CO6 - Apply privacy and security policies and cryptography systems.

TEXT / REFERENCE BOOKS


1. Mstering Bitcoin: Unlocking Digital Cryptocurrencies, by Andreas Antonopoulos
Blockchain by Melanie Swa,
2. Hyperledger Fabric - https://www.hyperledger.org/projects/fabric.

B.E/B.Tech REGULAR REGULATIONS 2023


121
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

3. Zero to Blockchain - An IBM Redbooks course, by Bob Dill, David Smi.


https://www.redbooks.ibm.com/Redbooks.nsf/RedbookAbstracts/crse040
1.html.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


122
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB1562 ENTERPRISE BLOCKCHAIN PLATFORMS
3 0 0 0 3 100

COURSE OBJECTIVES
To teach the concepts of block chain technologies.
To cover the technical aspects of Hyperledger, applications of Ripple and Stellar and the use of
Corda and Quorum
To learn, how these systems work and how to engineer secure software that interacts with the Bit
coin network and other crypto currencies.

UNIT 1 INTRODUCTION 9 Hrs.


Block Chain: Architecture Challenges Applications Principles - Ecosystem - Consensus problem
Byzantine fault tolerance agreement: Synchronous and asynchronous - Block chain key protocols:
Analysis - Nakamoto consensus on permission P2P Block chain network - Abstract models for block
chain

UNIT 2 HYPERLEDGER 9 Hrs.


Hyperledger - Hyperledger Framework: Public and private ledgers - Hyperledger fabric - Hyperledger
sawtooth - Hyperledger Iroha - Hyperledger burrow - Hyperledger Indy. Hyperledger Tools: Hyperledger
Caliper - Hyperledger Cello - Hyperledger Composer - Hyperledger Explorer - Hyperledger Quilt.

UNIT 3 RIPPLE AND STELLAR 9Hrs.


Ripple framework - Consensus algorithm - Ledger - Case Study. Stellar framework - Consensus protocol
Ledger - Smart contract - Case Study - Comparison of Ripple and Stellar.

Unit 4 CORDA AND QUORUM 9 Hrs.


Corda framework - Consensus algorithm - Asynchronous Byzantine fault tolerance Ledger - Case
Study. Quorum framework - Consensus protocol Ledger - Smart contract - Case Study.

UNIT 5 TEZOS AND DRAGONCHAIN 9 Hrs.


Tezos framework - Consensus algorithm - Delegated proof of stake - Ledger-Case Study - Dragon Chain
framework-Consensus algorithm- Context-based verification with five levels of consensus Ledger -
Case Study.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Understand emerging abstract models for blockchain technology.
CO2 - Analyse the concept of hyperledger.
CO3 - Apply the tools for understanding the background of blockchain platforms.
CO4 - Identify major research challenges and technical gaps existing between various blockchain
platforms.
CO5 - Understanding of latest advances in blockchain platform.
CO6 - Identify the appropriate blockchain platform for an application

B.E/B.Tech REGULAR REGULATIONS 2023


123
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Reilly, first edition 2015.
2. Daniel st edition, 2017
3.
Smart Contracts E st edition 2012.
4. entials: A Beginner s Guide to Build Smart Contracts

5. https://developer.ibm.com/patterns/create-and-deploy-block chain-network-usingfabric-
sdk- java/.
6. https://www.leewayhertz.com/blockchain-platforms-for-top-blockchain-companies/.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


124
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3018 PYTHON FOR DATA SCIENCE
3 0 0 0 3 100

COURSE OBJECTIVES
To understand the fundamental and complex data structures in Python.
To clean, scale and normalize the data sets.
To develop skill sets that are required to build prediction models and visualize it.

UNIT 1 PYTHON FUNDAMENTALS 9 Hrs.


Basic data types and variables Operators - Complex data structures Control flow - Loops - Functions
and methods - Classes - Objects - Modules - Import packages - Documentation.

UNIT 2 PACKAGES FOR DATA SCIENCE 9 Hrs.


NumPy: NumPy Arrays Random array module Data distribution NumPy ufuncs -, Pandas: Pandas
series, Pandas dataframe, Read CSV, JSON Analyze data Pandas correlation.

UNIT 3 DATA PREPROCESSING USING PYTHON 9 Hrs.


Python data operations - Python data cleansing - Python processing CSV data, JSON data, XLS data -
Scaling Normalization - Relational databases - NoSQL Databases - Date and Time - Data wrangling -
Data aggregation - Reading HTML pages - Processing unstructured data - Word tokenization -
Stemming and lemmatization.

UNIT 4 MODELLING PROCESS USING SCIKIT LEARN 9 Hrs.


Scikitlearn : Splitting the dataset - Train the Model - Model Persistence: Dump and Load Estimator
API : Choose a class of model Choose model hyperparameters Arranging the data Model Fitting
Applying the model Predict(), Transform() - Refitting and Updating Parameters.

UNIT 5 ANALYSING AND VISUALIZING DATA 9 Hrs.


Data Analysis: Filtering - Cleaning data group by operations - Pivot tables -Data visualization - Plotting
with Matplotlib - Bar charts - Scatter plots - Histograms - Customizing visualizations Visualization of
normal, binomial, poisson, uniform, logistic, multinomial, exponential, distribution

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, the students will be able to
CO1 - Appreciate the beauty of various packages.
CO2 - Implement preprocessing techniques effectively.
CO3 - Represent data efficiently.
CO4 - Analyze the data at higher levels.
CO5 - Build a model using the various functions.
CO6 - Visualize the model using appropriate packages.

B.E/B.Tech REGULAR REGULATIONS 2023


125
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Python for Data Analysis , O'Reilly, 2017.
2. Machine Learning with Python Cookbook: Practical Solutions from Preprocessing
to Deep Learning , O'Reilly, 2017.
3. Automate the Boring Stuff with Python: Practical Programming for Total
Beginners , No Starch Press, 2015.
4. https://www.tutorialspoint.com/scikit_learn/index.htm.
5. https://www.tutorialspoint.com/python_data_science/index.htm.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


126
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

NEURAL NETWORKS AND DEEP L T P EL Credits Total Marks


SCSB1451
LEARNING 3 0 0 0 3 100

COURSE OBJECTIVES
To understand the foundational concepts of neural networks and deep learning.
To explore various activation functions and loss functions.
To investigate applications of CNNs and RNNs.

UNIT 1 NEURAL NETWORKS 9 Hrs.


Introduction Artificial Neurons- Neuron structure and functionality - Types of neural networks, Hebbian
Learning- -Limitations of Linear nets and -Activation Functions-Error Function-
Loss Function-Neural Network Architectures Single Layer-Multi Layer-Deep Networks.

UNIT 2 SUPERVISED AND UNSUPERVISED NETWORKS 9 Hrs.


Supervised Learning Networks - Adaptive Linear Neuron, Back-propagation Network. Associative
Memory Networks. Training Algorithms for pattern association, BAM and Hopfield Networks.
Unsupervised Learning Network - Fixed Weight Competitive Nets - Maxnet - Hamming Network,
Kohonen Self-Organizing Feature Maps - Adaptive Resonance Theory Networks.

UNIT 3 CNN AND RNN 9 Hrs.


CNN: Introduction-Convolution and Pooling Layers-CNN Architectures (LeNet, AlexNet, VGG,
ResNet)- Object Detection and Localization with CNNs-Image Classification and Transfer Learning-
Case Studies: Image Recognition and Analysis
RNN: Introduction- Vanishing and Exploding Gradients - LSTM (Long Short-Term Memory) Networks-
GRU (Gated Recurrent Unit) Networks-Applications of RNNs: Sequence Prediction - Language
Modeling and Text Generation -Time Series Analysis and Forecasting.

UNIT 4 DEEP LEARNING 9 Hrs.


Introduction to Deep Learning - Historical Trends in Deep learning - Autoencoders and Dimensionality
Reduction - Generative Adversarial Networks (GANs) - Reinforcement Learning and Deep Q-Networks
(DQN)-Attention Mechanisms and Transformer Networks-Transfer Learning.

UNIT 5 CASE STUDY 9 Hrs.


Implementing Neural Networks and Deep Learning Models using Frameworks like TensorFlow or
PyTorch, Case Studies: Image Recognition and Analysis- Object Recognition in Video Streams-
Sequence Prediction- Sentiment Analysis- Text Classification - Named Entity Recognition (using NLTK
Library).
Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Understand the concepts of Neural Networks
CO2 - Differentiate supervised and unsupervised learning networks.
CO3 - Implement SOM and ART Algorithms.
CO4 - Differentiate various types of neural networks, feedforward, convolutional, recurrent, and
deep networks

B.E/B.Tech REGULAR REGULATIONS 2023


127
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

CO5 - Implement neural networks and deep learning models using various frameworks
CO6 - Choose appropriate neural network architectures and techniques for specific applications.

TEXT / REFERENCE BOOKS


1. Ian Goodfellow, Yoshua Bengio, Aaron Courville, Deep Learning: An MIT Press Book ,
Alanna Maldonado Publishing, 2016.
2. Charu Aggarwal, Neural Springer International Publishing, 2023.
3. Charu Aggarwal, rd Edition,

Pearson Prentice Hall, 2009.


4. Deep Learning for Computer Vision, Expert Techniques to

END SEMESTER EXAMINATION QUESTION PAPER PATTERN


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 of internal choice; each carrying 16 marks 80 Marks

B.E/B.Tech REGULAR REGULATIONS 2023


128
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3020 SOCIAL NETWORK ANALYSIS
3 0 0 0 3 100

COURSE OBJECTIVES
To illustrate basic principles behind network analysis algorithms.
To introduce to computational study of people's opinions, sentiments, emotions, moods, and
attitudes.
To solve problems such as emotion detection and opinion mining.

UNIT 1 INTRODUCTION TO SOCIAL NETWORKS 9 Hrs.


Types of social networks: General random networks - Small world networks - Scale-free networks -
Examples of information networks - Network centrality measures - Strong and weak ties Homophily -
groups - Subgroups and Cliques, Clustering, block models, dyads and individuals - Ego networks
Reciprocity - Social capital - Structural holes - Equivalence.

UNIT 2 STRUCTURES, MODELS AND PROCESSES OF A SOCIAL NETWORK 9 Hrs.


Models and simulation of network evolution - Diffusion in networks, Contagion in networks - Complex
contagion - Percolation and information - Navigation in networks revisited - Small world experiments -
small world models -Origins of small world - Heavy tails, Small diameter - Clustering of connectivity - The
Erdos Renyi Model - Clustering models.

UNIT 3 NETWORKS AND LANGUAGE 9 Hrs.


Introduction: Integration of text and network analysis - Types of networks extracted from texts across
disciplines - Natural language processing and linguistics for information and relation extraction link
prediction - Feature based link prediction - Event Detection: Classification of text streams - Event
detection and tracking: Bag of words - Temporal, location, ontology based algorithms - Evolution analysis
in text streams.

UNIT 4 SENTIMENT AND EMOTION DETECTION 9 Hrs.


Introduction - Sentiment analysis applications - Sentiment analysis research -Sentiment analysis as mini-
NLP - Sentiment classification and clustering - Document sentiment classification - Supervised sentiment
classification - Unsupervised sentiment classification - Sentiment rating prediction - Temporal sentiment
analysis - Differences between sentiment analysis and emotion detection.

UNIT 5 SOCIAL INFLUENCE ANALYSIS AND OPINION ANALYSIS 9 Hrs.


Influence measures - Social similarity - Measuring influence - Influencing actions and interactions -
Influence maximization - Definition of opinion - Definition of opinion summary - Different types of opinions
- Opinion extraction - Irony detection in opinion mining.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, the students should be able to:
CO1 - Comprehend different types of social networks.
CO2 - Design the structure of a social network.
CO3 - Analyse real world networks.
CO4 - Build the model for sentimental analysis.
CO5 - Mine the interest of the user using NLP techniques.
CO6 - Discover interesting patterns for opinion analysis.

B.E/B.Tech REGULAR REGULATIONS 2023


129
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Sentiment Analysis in Social Networks
Bing Liu 2016.
2. Networks, Crowds and Markets Cambridge University
Press, 2010.
3. Freeman, Sociology of
Empirical Press, 2004.
4. Social and Economic Networks , Princeton University Press, 2010.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


130
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

ARTIFICIAL INTERNET OF THINGS L T P EL Credits Total Marks


SCSB3021
(AIoT) 3 0 0 0 3 100

COURSE OBJECTIVES
To get in-depth knowledge of the AIoT technology in emerging computing.
To apply Artificial Intelligence to the data and makes it possible to get the most out of them and make
sense of all this information.
To get intelligent solutions for cities, industry, the health and transportation sectors, among others.

UNIT 1 INTRODUCTION TO AIoT 9 Hrs.


AIoT (Artificial Intelligence of Things) From AI and IoT to AIoT - AI capable IoT platforms - Understand
the basic concepts of AIoT - Applications and examples of AIoT - Benefits and challenges of AIoT - Future
of AIoT - Importance of AIoT - Potential uses of AIoT.

UNIT 2 AIoT FOR SMART ENVIRONMENTS 9 Hrs.


Components in smart environment - Data pre-processing Data processing - Sensors - Environment
control (actuators) - Sensors for homes - Wireless sensor networks - Home-based sensor platform -
Sensor technologies - Smart monitoring and controlling hut Challenges.
UNIT 3 APPLICATION ORIENTED SMART CITIES BASED ON AIoT 9 Hrs.
Introduction - Smart cities overview and AIoT - The framework deployment and architecture of Smart City
- AIoT-powered Smart City transformation - Functions and features of Smart Cities - Instruments that aid
in the creation of a Smart City - AIoT and challenges in building Smart City
UNIT 4 AIoT BASED WASTE MANAGEMENT SYSTEMS 9 Hrs.
Various types and techniques for waste disposal - IoT-based waste management system - Main features
of AIoT-based framework for waste management - Data and proposed methodology - Design model -
Waste collection model - Working of intelligent bin process - Intelligent bin control by using AI.

UNIT 5 AIoT TECHNOLOGIES, APPLICATIONS AND FUTURE PERSPECTIVES 9 Hrs.


IoT in smart manufacturing system - Challenges for smart manufacturing - Challenges in the area of IoT and
Big Data analytics - Challenges in the area of IoT and blockchain computing - Security issues and challenges
- The concept of blockchain technology - The applications of blockchain technology utilized in the current
period - Potential challenges in AIoT technology - Future perspectives and research directions.

Max. 45 Hrs.
COURSE OUTCOMES
On completion of the course, the students would be able to:
CO1 - Remember the basic concepts of AI and IoT technologies to get the idea about AIoT.
CO2 - Understand the concept of analysing the data by using AI-integrated IoT devices to reveal
patterns and insights.
CO3 - Analyse continually to get improved decisions from the data collected by the devices used for
smart cities.
CO4 - Implement the AI-integrated IoT waste management devices to analyse data to reveal patterns
and insights and adjust system operations to become more efficient.
CO5 - Recognize the smart connected network of devices that seamlessly communicate over
powerful networks unleashing the power of data better and faster than ever.
CO6 - Construct a Real-time monitoring systems to save time, to reduce expensive business
interruptions and It involves constant supervision by the system to detect anomalies and make
predictions or make decisions based on the same.

B.E/B.Tech REGULAR REGULATIONS 2023


131
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Dirk Slama, Tanja Rückert, Sebastian Thrun, Ulrich Homann, Heiner Lasi eds, The Digital
ected Products and Solutions with AIoT ,
Springer Nature Switzerland AG, 1 ed. 2023.
st

2. Ajantha Devi, Anand Nayyar, Fadi Al-Turjman, Piyush Kumar Shukla, Intelligence of Things:
AI-IoT Based Critical-Applications and Innovations (AIoT Innovation) , Springer Nature, 1st
edtion, 2021.
3. Chenshu Wu, Kun Qian, Yi Zhang, Zheng Yang, Smart Wireless Sensing: From IoT to
AIoT 2021, Springer Verlag, 1st edition, 2021.
4. Chander Prakash, Lakhwinder Pal Singh, Ajay Gupta, Role of AIoT-based intelligent
automation in robotics, UAVs, and drones, ebook-Source: AIoT Technologies and Applications
for Smart Environments , IET Digital Library 2022.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


132
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

Total
L T P EL Credits
SCSB3022 PROBABILISTIC GRAPHICAL MODELS Marks
3 0 0 0 3 100
COURSE OBJECTIVES
To solve problems using graphical models and inference algorithms.
To learn the structure of the graphical model from data.
To develop the knowledge and skills required for design, implement and apply these models to solve
real problems.

UNIT 1 INTRODUCTION 9 Hrs.


Fundamentals of Probability Theory - Overview of graphs - Probabilistic graphical models with examples
- Probability theory Probability distributions - Random variables and joint distributions - Independence
and conditional independence - Graphs - The Bayesian network representation (Directed Models) - The
Naive Bayes Model (Conditional Independence) - Independencies in graphs Bayesian implementation
using Python.

UNIT 2 REPRESENTATION 9 Hrs.


Undirected Graphical Models Parameterization - Markov network independencies - Bayesian networks
and Markov networks - Partially directed models - Local probabilistic models Template-Based
representations Gaussian network models Construct Markov model using Python.

UNIT 3 INFERENCE 9 Hrs.


Exact Inference: Variable elimination Complexity and graph structure: Variable elimination
Conditioning - Clique trees Message passing: Sum product and belief propagation (Sum Product) -
Constructing a clique tree -Inference as optimization Particle-based approximate inference MAP
inference - Sampling based inference, Variational inference.

UNIT 4 LEARNING 9 Hrs.


Learning graphical models Goals - Learning as optimization - Parameter estimation - MLE for Bayesian
networks - Bayesian parameter estimation in Bayesian networks - Learning models with shared
parameters - Generalization analysis - Structure learning in Bayesian networks - Structure Scores and
search - Bayesian model averaging - Partially observed data - Approximate inference - Bayesian learning
with incomplete data - Learning structure using pgmpy.

UNIT 5 ACTIONS AND DECISIONS 9 Hrs.


Causal Models - Mechanisms and response variables - Partial identifiability in functional causal models -
Counterfactual queries - Learning causal models - Utilities and decisions - Utility curves - Utility elicitation -
Preference and utility independence - Decision trees - Influence diagrams - Backward induction in influence
Diagrams - Generalized variable elimination - Strategic relevance and global optimality - Ignoring irrelevant
information Case Study: Multinomial HMM implementation in Python.
Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, the students should be able to
CO1 - Comprehend the joint distributions and conditional independence.
CO2 - Understand the mathematical framework of probabilistic graphical models.
CO3 - Analyze the basic algorithms for probabilistic inference in graphical models.
CO4 - Implement the algorithms for learning graphical models.
CO5 - Recognize and apply Bayesian principles behind modeling domain knowledge under uncertainty.

B.E/B.Tech REGULAR REGULATIONS 2023


133
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

CO6 - Construct new methodologies for stating various statistical and causal models.

TEXT / REFERENCE BOOKS


1. Koller, D. and Friedman, N. Probabilistic Graphical Mod
Press, 2009.
2. Jensen, F. V. and Nielsen, T. D., Bayesian Networks and Decision Graphs. Information
Science and Statistics Springer, 2nd edition, 2002.
3. Kevin P. Murphy Machine Learning: A Probabilistic Perspective 4th Printing. MIT Press,
2013.
4. Barber, D. Bayesian Reasoning and Machine Learning Cambridge University Press,
1st edition, 2011.
5. Pattern Recognition and Machine Learning (Information Science and
Springer, 2nd printing, 2011.
6. Graphical Models, Exponential Families, and Variational
Inference. Foundations and Trends in Machine Learning , 2008.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


134
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3023 DATA VISULAIZATION TECHNIQUES
3 0 0 0 3 100

COURSE OBJECTIVES
To develop skills to both design and critique visualizations.
To introduce visual perception and core skills for visual analysis.
To understand visualization for correlation analysis and multivariate analysis.

UNIT 1 INTRODUCTION TO DATA VISUALIZATION 9 Hrs.


Value of Visualization What is visualization and why do it: visual perception - External representation
Interactivity Difficulty in Validation Effective data analysis Traits of meaningful data Visual
perception Making abstract data visible Building blocks of information visualization Analytical
interaction Analytical navigation Optimal quantitative scales Reference lines and regions Trellises
and crosstabs Multiple concurrent views Focus and context Details on demand Over-plotting
reduction Analytical patterns Pattern examples.

UNIT 2 TIME-SERIES, RANKING, AND DEVIATION ANALYSIS 9 Hrs.


Time-series analysis Time-series patterns Time-series displays Time-series best practices Part-
to-whole and ranking patterns Part-to-whole and ranking displays Best practices Deviation analysis
Deviation analysis displays Deviation analysis best practices.

UNIT 3 DISTRIBUTION, CORRELATION, AND MULTIVARIATE ANALYSIS 9 Hrs.


Distribution analysis Describing distributions Distribution patterns Distribution displays Distribution
analysis best practices Correlation analysis Describing correlations Correlation patterns
Correlation displays Correlation analysis techniques and best practices Multivariate analysis
Multivariate patterns Multivariate displays Multivariate analysis techniques and best practices.

UNIT 4 EXPLORATORY VISUALIZATION USING TABLEAU AND POWERBI 9 Hrs.


Introduction to Tableau Creating visualizations with Tableau - Sorting, Top N, bottom N-Filtering-
Mapping Editing, Building, and Formatting Views.
Introduction to PowerBI Connecting to data using power query Joining and Editing Data Building
visualization using power query- Adding interactivity to power view reports.

UNIT 5 INFORMATION DASHBOARD DESIGN 9 Hrs.


Introduction Dashboard design principles Dashboard design issues and assessment of needs
Building dashboards Formatting dashboards Adding interactivity to dashboards Building stories.
Canvas selection Tiled object Floating object Pixel perfect alignment Summary box Chart titles
and captions Adding image and text Adding shading Adding separator lines Dynamic chart title
Information icons - Creating a story.

Max. 45 Hrs.

B.E/B.Tech REGULAR REGULATIONS 2023


135
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

COURSE OUTCOMES
On completion of the course, the students should be able to
CO1 - Explain principles of visual perception.
CO2 - Apply core skills for visual analysis.
CO3 - Apply visualization techniques for various data analysis tasks.
CO4 - Design information dashboard.
CO5 - Prepare data for visualization.
CO6 - Demonstrate skills on creating visual representation of Data.

TEXT / REFERENCE BOOKS


1. Ben Fry, "Visualizing data: Exploring and Explaining Data with the Processing Environment",
O'Reilly, 2008.
2. Edward R. Tufte, "The Visual Display of Quantitative Information", Second Edition, Graphics
Press, 2001.
3. Evan Stubbs, "The Value of Business Analytics: Identifying the Path to Profitability", Wiley,
2011.
4. Gert H. N. Laursen and Jesper Thorlund, "Business Analytics for Managers: Taking business
intelligence beyond reporting", Wiley, 2010.
5. Nathan Yau, "Data Points: Visualization that means something", Wiley, 2013.
6. Stephen Few, "Information dashboard design: Displaying data for at-a-glance monitoring",
second edition, Analytics Press, 2013.
7. Stephen Few, "Now you see it: Simple Visualization techniques for quantitative analysis",
Analytics Press, 2009.
8. Tamara Munzner, Visualization Analysis and Design, AK Peters Visualization Series, CRC
Press, Nov. 2014.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


136
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3024 NATURAL LANGUAGE PROCESSING
3 0 0 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 Modeling: Grammar-based LM, Statistical LM
Regular Expressions - Finite-State Automata English morphology - Transducers for lexicon and rules,
Tokenization - Detecting and correcting spelling errors, Minimum edit distance.

UNIT 2 WORD LEVEL AND SYNTACTIC ANALYSIS 9Hrs.


Unsmoothed N-grams - Evaluating N-grams Smoothing - Interpolation and Backoff Word Classes -
Parts-of-speech tagging - Rule-based, Stochastic and Transformation - based tagging - Issues in PoS
tagging Hidden Markov and Maximum Entropy models.

UNIT 3 SYNTACTIC AND SEMANTIC 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.
Semantic Analysis - Requirements for representation - Lexical semantics and word-sense disambiguation
- Compositional semantics - Semantic role labeling and semantic parsing.

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

COURSE OUTCOMES
On completion of the course, student will be able to
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 - Analyse and compare the use of different statistical approaches for different types of NLP
applications.

B.E/B.Tech REGULAR REGULATIONS 2023


137
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Ric Natural Language Processing with Java , OReilly Media, 2015.
2. Nitin Handbook of Natural Language Processing , 2nd
Edition, Chapman and Hall, CRC Press, 2010.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


138
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

PREDICTIVE AND ADVANCED L T P EL Credits Total Marks


SCSB1612
ANALYTICS 3 0 0 0 3 100

COURSE OBJECTIVES
To learn the concepts and applications of data mining.
To explore the automated models for categorical and continuous targets.
To analyse the performance in different models.

UNIT 1 INTRODUCTION TO DATA MINING 9 Hrs.


Introduction to Data Mining - Concepts of data mining - Technologies used - Data mining process, KDD
process model, CRISP DM - Mining on various kinds of data - Applications of data mining -Challenges
of data mining.

UNIT 2 DATA UNDERSTANDING AND PREPARATION 9 Hrs.


Introduction - Reading data from various sources - Data visualization - Distributions and summary
statistics - Relationships among variables - Extent of missing data Segmentation - Outlier detection,
Automated data preparation - Combining data files - Aggregate data - Duplicate removal - Sampling data
- Data Caching - Partitioning data - Missing values.

UNIT 3 MODEL DEVELOPMENT AND TECHNIQUES 9 Hrs.


Data partitioning - Model selection - Model development techniques - Neural networks - Decision trees -
Logistic regression - Discriminant analysis - Support vector machine - Bayesian networks - Linear
regression - Cox regression - Association rules.

UNIT 4 MODEL EVALUATION AND DEPLOYMENT 9 Hrs.


Introduction - Model validation - Rule induction using CHAID - Automating models for categorical and
continuous targets - Comparing and combining models - Evaluation charts for model comparison Meta
level modeling.

UNIT 5 DEPLOYING MODEL 9 Hrs.


Assessing model performance - Updating a model Bias Variance and model complexity - Bias-
variance trade off - Optimism of the training error rate - Estimate of In-sample prediction error.

Max.45Hrs.

COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Understand the process of formulating business objectives, data selection/collection.
CO2 - Successfully design, build, evaluate models.
CO3 - Implement predictive models for various business applications.
CO4 - Compare the underlying predictive modeling techniques.
CO5 - Select appropriate predictive modeling approaches to identify cases to progress with.
CO6 - Deploy model and assess the performance.

B.E/B.Tech REGULAR REGULATIONS 2023


139
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Larose, Daniel Wiley, 2015.
2. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements of Statistical Learning-Data
Mi , Second Edition , Springer Verlag, 2009.
3. Pattern Recognition and Machine Learning , Springer,2006.
4. Wasserman, All of Ukraine, Springer
New York, 2013.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


140
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

APPLICATIONS OF MACHINE LEARNING L T P EL Credits Total Marks


SCSB3026
IN INDUSTRIES 3 0 0 0 3 100

COURSE OBJECTIVES
To determine the factors involved in decision support that can improve business performance
across the provider / payer ecosystem.
To identify opportunities for business applications in healthcare by applying journey mapping and
pain point analysis in a real world context.
To identify differences in methods and techniques in order to appropriately apply to pain points
using case studies.

UNIT 1 ADVANCED MACHINE LEARNING 9 Hrs.


Deep learning for customer services - Chatbot: Deep learning approach, AI powered marketing systems
- Deep learning in cyber security - Types of cyber-attacks in banks - Deep learning methods used in
cyber security - Deep learning v/s restricted Boltzmann machines - Convolution Neural Networks (CNNs)
- Recurrent neural networks - Machine learning techniques: Loan underwriting and sentiment/news
analysis - Sentiment or news analysis - Current challenges and opportunities: Banking and security
domain.

UNIT 2 MACHINE LEARNING IN BANKING AND SECURITIES 9 Hrs.


Role of machine learning in banking sector - Use of AI in banking and finance - Fraud detection -
Customer data management - Personalized marketing - Challenges of banking sector and securities -
Widely used machine learning algorithms in banking and security - Fraud prevention and detection
systems - Rule based and machine learning based approach in fraud detection - Anomaly detection:
Ways to expose suspicious transactions in banks - Advanced fraud detection systems - Risk
management systems.
Case study: Application of machine learning for financial risk management - Credit risk analysis using
machine learning classifier - Investment prediction systems.

UNIT 3 MACHINE LEARNING IN HEALTHCARE AND LIFE SCIENCES 9 Hrs.


Applications of machine learning in health and life sciences - Role of machine learning in drug discovery
- Medical image analysis - Why deep learning for medical image analysis - Neural network and deep
learning architecture - Comparisons between architecture of different types of deep learning models -
Machine learning in genetics and genomics - Genomics and AI background - Interpreting deep learning
models - Predictive medicine: Prognosis and diagnostics accuracy - Predictive medicine: Examples -
ML applications in breast cancer diagnosis and prognosis.

UNIT 4 MACHINE LEARNING IN EDUCATION 9 Hrs.


Advantages of machine learning in education, learning analytics, Academic analytics, Action research,
Educational data mining, Recommender system, Personalized adaptive learning, Learning analytics

education, Domain model, Learner model, Students classification algorithm, Recommendation model,
Case study:
description, Sample data sets, Visualization, Selection of machine learning technique.

UNIT 5 MACHINE LEARNING IN MEDIA AND COMMUNICATION 9 Hrs.


Machine learning in communication - media and entertainment - Usage of machine learning in media and
entertainment industry - Machine learning techniques for customer sentiment analysis - World embedding's
- Sentiment analysis with long short term memory networks - Real-time analytics in communication - media
and entertainment industries - Real time analytics and social media - Deep learning for social media analytics

B.E/B.Tech REGULAR REGULATIONS 2023


141
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

- Recommendations engines - Collaborative filtering - Memory based collaborative filtering - Model based
collaborative filtering - Content based filtering - Hybrid recommendation systems - Summary of
recommendation systems - Deep learning techniques on recommender systems.

Max.45 Hrs.

COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Comprehend advanced concepts of machine learning and deep learning.
CO2 - Analyze concepts of machine learning on banking domain.
CO3 - Apply concepts of Machine Learning in Healthcare sectors.
CO4 - Appreciate the various applications in Education sectors.
CO5 - Identify the applications in Media and Communication Sectors.
CO6 - Recognize and apply various machine learning concepts on case studies from different
business sectors.

TEXT / REFERENCE BOOKS


1. Building Cognitive Applications with IBM Watson Services: Volu N.p., IBM
Redbooks, 2017.
2. Machine Learning Algorithms for Industrial Applications, Studies in Computational
Intelligence , Springer Book series, 2021.
3. Pedro Larrañaga, David Atienza, Javier Diaz-Rozo, Alberto Ogbechie, Carlos Esteban Puerto-
Santana, Concha Bielza, Industrial Applications of Machine Learning , CRC press, 1st edition,
2020.
4. Goodfellow, Ian., Bengio, Yoshua., Courville, Aaron. Deep Learning. United Kingdom: MIT
Press, 2016.Trevor Hastie, Robert Tibshirani, and Jerome Friedman, The Elements of Statistical
Learning: Data Mining, Inference, and Prediction , Springer series in statistics, 2nd edition, 2019.
5. Drew Conway and John Myles White, Machine Learning for Hackers: Case Studies and Algorithms
to Get you Started .
6.
Predictive Data Analytics: Algorithms, Worked Examples, and Case Studies, MIT press, 1st edition,
2020.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


142
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3027 DATA SCIENCE AND SOCIETY
3 0 0 0 3 100

COURSE OBJECTIVES
To understand the mathematical foundations required for data science.
To provide solutions to societal challenges and gain knowledge on legal and ethical issues related
to data science.
To learn machine tools and techniques and interpret data using visualization libraries in Python.

UNIT 1 DESCRIBING RELATIONSHIPS 9 Hrs.


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

UNIT 2 INTRODUCTION TO DATA SCIENCE 9 Hrs.


Data Science: Importance, Benefits, uses and applications-Scope of Data Science- Data Science with
other fields - facets of data - Types of Data - Types of Variables -Describing Data with Tables and Graphs
Describing Data with Averages - Describing Variability - Normal Distributions and Standard (z) Scores-
Data Science Process: Overview - Defining research goals Retrieving data Data preparation -
Exploratory Data analysis build the mode l presenting findings and building applications - Data Mining
- Data Warehousing Basic Statistical descriptions of Data.

UNIT 3 DATA SCIENCE AND SOCIETY 9 Hrs.


Data Science for Social Good, Importance and Benefits of Data Science in Society, Business value of
Data Science, Data Types Used to Improve Public Health and Welfare, Solutions for societal challenges,
Private Law and data science, Legal and ethical issues related to data science. Intellectual Property
Rights, Data Science: Privacy, Security, and Protection.

UNIT 4 MACHINE LEARNING TOOLS, TECHNIQUES AND APPLICATIONS 9 Hrs.


Supervised Learning, Unsupervised Learning, Reinforcement Learning, Dimensionality Reduction,
Principal Component Analysis, Classification and Regression models, Tree and Bayesian network
models, Neural Networks, Testing, Evaluation and Validation of Models.

UNIT 5 DATA CLEANING, PREPARATION AND VISUALIZATION 9 Hrs.


Data Cleaning and Preparation: Handling Missing Data - Data Transformation: Removing Duplicates,
Transforming Data Using a Function or Mapping, Replacing Values, Detecting and Filtering Outliers-
String Manipulation: Vectorized String Functions in pandas.
Data Visualization - Basic principles, ideas and tools for data visualization- Need for Visualization-Plotting
with pandas: Line Plots, Bar Plots, Histograms and Density Plots, Scatter or Point Plots three dimensional
plotting - Geographic Data with Basemap - Visualization with Seaborn- Examples of exciting projects-
Case studies.
Max 45 Hrs.
COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Explain the basic terms of linear algebra and statistical inference.
CO2 - Describe the data science process and how its components interact.
CO3 - Apply machine learning algorithms to solve real-world problems.
CO4 - Analyze the performance of parameters that can be achieved by applying different models.
CO5 - Apply visualization Libraries in Python to interpret and explore data
CO6 - Apply the python libraries used for data analysis.

B.E/B.Tech REGULAR REGULATIONS 2023


143
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1.
Publications, 2016. (Unit I).
2. -Cambridge Press, 5th Edition.2016.
3. Applied Statistics and 2016.
4. tion, Wiley Publications, 2017.
5.
6. 2014.
7.
University Press, 2020.
8. Anne Beaulieu, Sabina Leonelli
2021.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


144
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

MATHEMATICAL TOOLS FOR DATA L T P EL Credits Total Marks


SCSB3028
SCIENCE 3 0 0 0 3 100

COURSE OBJECTIVES
To understand the mathematical foundations required for data science.
To provide a comprehensive calculus background required to solve standard Data Science problems.
To identify and implement standard solutions to generic problems of optimization and integration
encountered in data science.

UNIT 1 LINEAR ALGEBRA 9 Hrs.


Linear Algebra: Vector and matrices vectors 2D, 3D and ND-matrices - Systems of linear equations-
Null Space- Rank- Eigen values and Eigen vectors, Singular value decomposition - Matrix operations:
addition, multiplication, transpose, inverse - Principal component analysis (PCA).

UNIT 2 PROBABILITY AND STATISTICS 9 Hrs.


Basic probability- conditional probability- - Application to web search algorithms: Link analysis
and Page rank - Descriptive statistics- Covariance and covariance matrix- Normal distribution- probability
density function - Hypothesis testing - Differentiation and integration - Optimization techniques (gradient
descent, Newton's method) - Multivariable calculus - Partial derivatives - Probability and statistics: -
Probability theory and distributions - Bayesian statistics.

UNIT 3 FOUNDATIONS OF STATISTICAL LEARNING 9 Hrs.


Basics of statistical learning: Models - Regression- Curse of dimensionality - Overfitting- Optimization
and convexity -Gradient descent - .

UNIT 4 CLASSIFICATION AND CLUSTERING 9 Hrs.


Linear discriminant analysis - Logistic regression - Support vector machines (SVM)- Similarity and
distances- Nearest neighbour methods - Decision tress and application of entropy- Clustering algorithm.

UNIT 5 OPTIMIZATION AND INFORMATION THEORY 9 Hrs.


Linear programming - Nonlinear programming - Convex optimization - Entropy - Mutual information -
Compression algorithms - Numerical Methods - Root finding algorithms - Interpolation and extrapolation
- Numerical integration.

Max 45 Hrs.

COURSE OUTCOMES
On completion of the course, the student will be able to
CO1 - Explain the rationale behind second order conditions to optimize smooth multivariate functions
in the constrained and unconstrained scenarios.
CO2 - Describe, choose and apply numerical methods to optimize smooth and rough functions.
CO3 - Apply essential calculus concepts relevant to data science.
CO4 - Apply and use both analytical and numerical methods for integration .
CO5 - Implement some of these techniques in one of the standard programming languages.
CO6 - Analyze and correlate the results to the solutions.

B.E/B.Tech REGULAR REGULATIONS 2023


145
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Deisenroth, Marc Peter., Faisal, A. Aldo., Ong, Cheng Soon,
Cambridge University Press, 2020.
2. Goodfellow, I., Bengio, Y., Courville, A., , MIT Press, 2016.
3. Bishop, , Springer New York, 2006.
4. Lay, David C, Lay, Steven R., McDonald,
Edition, Pearson Education, 2021.
5. Blitzstein, Joseph K.., Hwang,
Press, 2019.
6. Press, William H., es:
Press, 3rd Edition, 2007.
7. Boyd, Stephen P, Vandenberghe, Cambridge University
Press, 2004.
8. Strang, Gilbert, 2016.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


146
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

MACHINE LEARNING FOR L T P EL Credits Total Marks


SCSB3029
DATA SCIENCE 3 0 0 0 3 100

COURSE OBJECTIVES
To impart knowledge of machine learning techniques for data handling.
To develop skills of using recent machine learning software for solving practical problems.
To describe a flow process for data science problems and tools for data visualization.

UNIT 1 INTRODUCTION TO MACHINE LEARNING 9 Hrs.


Introduction - Examples of various Learning Paradigms - Perspectives and Issues - Version Spaces -
Finite and Infinite Hypothesis Spaces - PAC Learning - VC Dimension.

UNIT 2 SUPERVISED LEARNING ALGORITHMS 9 Hrs.


Learning a class from examples Linear, Non-linear, Multi-class and Multi-label classification - Decision
Trees: ID3 - Classification and Regression Trees (CART) - Regression: Linear Regression - Multiple
Linear Regression - Logistic Regression - Neural Networks: Introduction - Perceptron - Multilayer
Perceptron - Support vector machines: Linear and nonlinear kernel functions K Nearest Neighbors.

UNIT 3 UNSUPERVISED LEARNING 9 Hrs.


Introduction to clustering - Hierarchical: AGNES - DIANA - Partitional: K-means clustering - K-Mode
clustering - Self-organizing map - Expectation maximization - Gaussian mixture models - Principal
Component Analysis (PCA) - Locally Linear Embedding (LLE) - Factor analysis.

UNIT 4 EXPLORATORY DATA ANALYSIS AND THE DATA SCIENCE PROCESS 9 Hrs.
Basic tools (plots, graphs and summary statistics) of EDA - Philosophy of EDA - Data science process -
Data visualization - Basic principles, ideas and tools for data visualization - Examples of exciting projects
- Data Visualization using Tableau.

UNIT 5 INTRODUCTION TO PYTHON 9 Hrs.


Data structures Functions Numpy Matplotlib Pandas - Series and Data frame - Manipulating data
frames - Extracting information Plotting - Scikit-learn - Partitioning the data - Standardization- Fitting
and prediction- Testing the model.

Max 45 Hrs.

COURSE OUTCOMES
On completion of the course, the student will be able to
CO1 - Understand complexity of machine learning algorithms and their limitations.
CO2 - Apply various supervised learning methods to appropriate problems.
CO3 - Apply common machine learning algorithms in practice and implement their own.
CO4 - Create probabilistic and unsupervised learning models for handling unknown patterns.
CO5 - Describe the data science process and how its components interact.
CO6 - Simulate data visualization in exciting projects.

B.E/B.Tech REGULAR REGULATIONS 2023


147
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1.
Edition 2014.
2. Doing Data Science, Straight Talk From The Frontline
2014.
3. D.P. Kroese, Z.I. Botev, T. Taimre, R. Vaisman Data Science and Machine Learning:
Mathe 2019.
4. Avrim Blum, John Hopcroft and Ravindran Kannan, Foundations of Data Science . Cambridge
University Press, 2020.
5. Mehryar Mohri, Afshin Rostamizadeh, Ameet Talwalkar,
MIT Press, 2012.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


148
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3030 PROGRAMMING IN R
3 0 0 0 3 100

COURSE OBJECTIVES
To understand the basic fundamentals of R language.
To fit some basic types of statistical models.
To appreciate and apply the R programming from a statistical perspective.

UNIT 1 INTRODUCTION TO R 9 Hrs.


Introduction - History and overview of R - elements and data structures - Sessions and Functions -
Variables - Data Types - Vectors - Scalars - Conclusion - Data Frames - Lists - Matrices - Arrays - Classes
- Data input/output - Data storage formats - Subsetting objects - Vectorization.

UNIT 2 MATRICES, ARRAYS AND LISTS 9 Hrs.


Matrices, Arrays and Lists - Creating matrices Matrix operations Applying Functions to Matrix Rows
and Columns Adding and deleting rows and columns Vector/Matrix Distinction Avoiding Dimension
Reduction Higher Dimensional arrays lists Creating lists General list operations Accessing list
components and values applying functions to lists recursive lists.

UNIT 3 DATA MANIPULATION 9 Hrs.


Math and Simulation in R, Functions, Math Function, Probability Calculation Cumulative Sums and
Products- Minima and Maxima- Data sorting - Linear Algebra Operation on Vectors and Matrices - Set
Operation.

UNIT 4 CONTROL STATEMENTS, FUNCTIONS, R GRAPHS 9 Hrs.


Control statements Arithmetic and Boolean operators and values Default values for arguments -
Returning Boolean values functions are objects Environment and Scope issues Writing Upstairs -
Recursion Replacement functions Tools for composing function code Math and Simulations in R
Creating Graphs Customizing Graphs Saving graphs to files Creating three-dimensional plots.

UNIT 5 INTERFACING 9 Hrs.


Interfacing R to other languages Parallel R Basic Statistics Linear Model Generalized Linear
models Non-linear models Time Series and Auto-correlation Clustering.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - State the capabilities of R and its data, variable types.
CO2 - Describe various operators, control statements and scoping rules in R.
CO3 - Apply R programming for manipulation of datasets.
CO4 - Analyse data using real time examples.
CO5 - Produce various graphs and distribution plots using R.
CO6 - Develop interfacing R to other languages.

B.E/B.Tech REGULAR REGULATIONS 2023


149
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Chris Brunsdon, Lex Comber, An Introduction to R for Spatial Analysis and Mapping , 2nd
Revised Edition, Sage Publications Ltd (UK), 2019.
2.
Press, 2011.
3. Mark Gardener, Beginning R -The Statistical Programming Language , John Wiley and Sons,
Inc., 2012.
4. -Wesley Data
and Analytics Series, 2013.
5.
al South Asia Services Inc, 2013.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


150
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB1712 COMPUTER VISION
3 0 0 0 3 100

COURSE OBJECTIVES
To discuss the different algorithms for 3D reconstruction and recognition.
To emphasize the core vision tasks of scene understanding and recognition.
To discuss the applications to 3D modeling, video analysis, and video surveillance, object recognition
and vision based control.

UNIT 1 INTRODUCTION 9 Hrs.


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 - image formation - Radiance, Irradiance, BRDF,
color etc. - Orthographic and 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
- 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 - Applications: In-vehicle vision system: Locating roadway Road markings Identifying road
signs Locating pedestrians.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, the student will be able to
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.

B.E/B.Tech REGULAR REGULATIONS 2023


151
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. David A. Forsyth, Jean Ponce, nd Edition, Pearson
Education Limited, 2015
2.
3. traction and Image Processing for Computer
rd Edition, Academic Press, 2012.

4. E. R. Davies, Computer and 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.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


152
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB1232 EXPLORATORY DATA ANALYSIS
3 0 0 0 3 100

COURSE OBJECTIVES
To focus on the significance of data and software tools.
To emphasize the relationship between variables and gain knowledge about univariate data analysis.
To explore multivariate data analysis and visualize the data.

UNIT 1 INTRODUCTION 9 Hrs.


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

UNIT 2 THE EXPLORATORY PERSPECTIVE 9 Hrs.


Introduction: Overview Sources of data Process for making sense of Data - Describing Data:
Observations and variables Types of variables Central tendency Distribution of the data
Confidence intervals Hypothesis tests - Distributions of single variables.
Displaying Data: Stem and leaf Summarizing data Resistant statistics and number summaries - The Box
and Whisker -Understanding data: Skewness Outliers Gaps and multiple peaks.

UNIT 3 RELATIONSHIPS BETWEEN VARIABLES 9 Hrs.


Preparing data tables: Cleaning - Displaying relationships - Scatter plot Summarizing relationships
Fitting a line Smoothing the data Median and hinge traces Examining residuals Understanding
relationships: Outliers Nonlinear monotonic relationships.

UNIT 4 REEXPRESSION AND UNIVARIATE ANALYSIS 9 Hrs.


Choosing Re-expressions: Nonlinear monotonic functions Non monotonic functions - Introduction to
single variable - Distribution variables Numerical summaries of level and spread - Scaling and
standardizing Inequality - Univariate data: Measures of center and spread, transformations.

UNIT 5 MULTIVARIATE ANALYSIS AND VISUALIZATION 9 Hrs.


Introducing a third variable Causal explanations Three-variable contingency tables and beyond -
Bivariate analysis Multivariate analysis Casual analysis - Basics of Matplotlib - Plotting with Pandas
and Seaborn - Other Python visualization tools.

Max: 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Understand about the significance of exploratory data analysis.
CO2 - Analyse the data statistically.
CO3 - Summarize data and understanding their relationship.
CO4 - Perform univariate data exploration and analysis.
CO5 - Apply multivariate data exploration and analysis.
CO6 - Perform data exploration and visualization techniques .

B.E/B.Tech REGULAR REGULATIONS 2023


153
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Gl f Data | A Practical Guide To Exploratory
Data Analysis And Data Mining , Second Edition
2. Frederick Hartwig, Brian E. Dearing, Exploratory Data Analysis 1979.
3. Suresh Kumar Mukhiya, Usman Ahmed, Hands-On Exploratory Data Analysis with Python ,
Packt Publishing, 2020.
4.
First Edition, O Reilly, 2017.
5. Catherine Marsh, Jane Elliott, Exploring Data: An Introduction to Data Analysis for Social
Scientists , Wiley Publications, 2nd Edition, 2008.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


154
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

PREDICTIVE ANALYTICS AND L T P EL Credits Total Marks


SCSB3034
SEGMENTATION 3 0 0 0 3 100

COURSE OBJECTIVES
To learn about fundamentals of data modelling techniques.
To gain knowledge about regression and classification.
To understand more about additive and boosting methods.

UNIT 1 INTRODUCTION TO PREDICTIVE ANALYTICS 9 Hrs.


Need for Analytics - Introduction to Tools and Environment - Application of Modeling in Business -
Databases and Types of data and variables - Data Modeling Techniques - Missing imputations etc. Need
for Business Modeling - Regression Concepts -Blue Property-Assumptions-Least Square Estimation
- Variable Rationalization - Model Building.

UNIT 2 REGRESSION AND CLASSIFICATION 9 Hrs.


Model theory - Model fit statistics - Model conclusion - Analytics applications to various business domains
etc. - Regression vs Segmentation - Supervised and unsupervised learning - Tree building Regression
- Classification - Over fitting - Pruning and complexity - Multiple decision trees etc.

UNIT 3 MODEL ASSESSMENT AND SELECTION 9 Hrs.


Bias, variance and model complexity - Bias-variance trade off - Optimism of the training error rate -
Estimate of in-sample prediction error - Effective number of parameters - Bayesian approach and BIC -
Cross- validation - Boot strap methods, conditional or expected test error.

UNIT 4 ADDITIVE MODELS AND TREES 9 Hrs.


Additive models, trees, and related methods: Generalized additive models Tree based methods
PRIM: Bump hunting - Multivariate adaptive regression splines - Hierarchical mixture of experts -
Boosting methods- Numerical optimization via gradient boosting Right-sized trees for boosting -
Regularization.

UNIT 5 SURVIVAL ANALYSIS 9 Hrs.


Survival Analysis: Survival analysis measurements - Kaplan Meier analysis - Parametric survival analysis
- Proportional hazards regression - Extensions of survival analysis models - Evaluating survival analysis
models.

Max: 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Understand the concept of data analytics and modeling.
CO2 - Analyze data and build models.
CO3 - Apply the models and predict error.
CO4 - Create additive models and trees.
CO5 - Understand the usage of survival analysis.
CO6 - Apply the prediction model for decision making for a given set of problems.

B.E/B.Tech REGULAR REGULATIONS 2023


155
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Gareth James Daniela Witten Trevor Hastie Robert Tibshirani, An Introduction to Statistical
Learning with Applications in R
2. John D. Kelleher, Brian Mac Namee, Aoife D'Arcy Fundamentals of Machine Learning for
Predictive Data Analytics: Algorithms Worked Examples , MIT Press, 2nd Edition, 2020.
3. Trevor Hastie, Robert Tibshirani, Jerome Friedman , The Elements of Statistical Learning-Data
Mining, Inference, and Prediction ,Second Edition , Springer Verlag, 2009.
4. Applied Predictive Analytics: Principles and Techniques for The Professional
Data Analyst
5. Anasse Bari, Mohammad Chaouchi, Tommy Jung, or Dummies , 2nd
Edition, 2017.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


156
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3035 COGNITIVE SCIENCE
3 0 0 0 3 100

COURSE OBJECTIVES
To learn basics and develop skills in Cognitive Science with focus on acquisition.
To understand the mind and intelligence that connects psychology, artificial intelligence,
neuroscience and linguistics.
To gain knowledge about the methods and tools to solve real time issues.

UNIT 1 INTRODUCTION TO COGNITIVE SCIENCE 9 Hrs.


Cognitive view Fundamental concepts Computers in cognitive science Applied cognitive science
Interdisciplinary nature of cognitive science.

UNIT 2 COGNITIVE PSYCHOLOGY 9 Hrs.


Cognitive Psychology: Architecture of the mind - Nature of cognitive psychology - Global view of the
cognitive architecture - Propositional representation - Schematic representation - Cognitive processes,
Working memory, and attention - Acquisition of skill- Connectionist approach to cognitive architecture.

UNIT 3 LANGUAGE ACQUISITION, SEMANTICS AND PROCESSING MODEL 9 Hrs.


Milestones in acquisition Theoretical perspectives- Semantics and cognitive science Meaning and
Entailment Reference Sense Cognitive and computational models of semantic processing
Information processing models of the mind- Physical symbol systems and language of thought- Applying
the symbolic paradigm- Neural networks and distributed information processing- Neural network models
of cognitive processes.

UNIT 4 INTEGRATION CHALLENGE 9 Hrs.


Cognitive Science and integration challenge: Levels of explanation - Local integration -Tackling the
Integration Challenge: Inter theoretic reduction - -level hypothesis - Models of mental
architecture.

UNIT 5 NEURAL NETWORK MODELS OF COGNITIVE PROCESSES 9 Hrs.


Language learning - - Challenges and applications
- The massive modularity hypothesis - Hybrid architectures - Tools: Working with concept maps.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Identify the relationships between cognitive systems with different cognitive disciplines.
CO2 - Enumerate the various neuro scientific theories of cognitive systems.
CO3 - Analyze the representation and use of knowledge by individual minds, brains, and machines.
CO4 - Perform neuroscience and linguistics based real time experiments.
CO5 - Implement the knowledge of neuro science with its advanced techniques towards the cognitive
field.
CO6 - Formulate hypothesis and computational models to draw conclusions that embeds cognitive
psychology and neuroscience.

B.E/B.Tech REGULAR REGULATIONS 2023


157
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1.
Cambridge University Press, New York, 2014.
2.
2nd Edition, MIT press, 1995.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


158
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3036 MALWARE DATA SCIENCE
3 0 0 0 3 100

COURSE OBJECTIVES
To understand the fundamental concepts and techniques of malware analysis and reverse
engineering.
To learn how to identify, classify, and analyze different types of malware, including viruses, worms,
trojans, ransomware and others.
To understanding the anatomy of malware, including how it spreads, hides, and communicates with
command and control servers.

UNIT 1 INTRODUCTION AND STATIC ANALYSIS 9 Hrs.


Introduction: Malware analysis Why malware analysis - Types of malware analysis Static analysis:
Determining the file type Fingerprinting the malware Extracting strings Determining file obfuscation
Comparing and classifying the malware.

UNIT 2 DYNAMIC ANALYSIS 9 Hrs.


Dynamic Analysis: System and network monitoring Dynamic analysis monitoring tools - Dynamic
analysis steps Tools Analyzing a malware executable Dynamic Link Library (DLL) analysis.

UNIT 3 MALWARE FUNCTIONALITIES AND PERSISTENCE 9 Hrs.


functionalities Downloader Dropper Keylogger Malware command control PowerShell-based
execution. Persistence methods: Scheduled tasks Startup folder Winlogon registry entries Image
file execution options COM hijacking Service.

UNIT 4 NETWORK CONSTRUCTION AND ANALYSIS 9 Hrs.


Identifying attack campaigns using malware networks: Nodes and edges - Bipartite networks - Visualizing
malware networks Building malware networks and shared image relationship network - Shared code
analysis: Preparing samples - Using the Jaccard index and using similarity matrices for evaluation.

UNIT 5 DETECTION, EVALUATION AND VISUALIZATION 9 Hrs.


Understanding ML based malware detectors: Steps for building ML based detector - Types of machine
learning algorithms - Evaluating malware detection systems - Building ML detectors: Decision Tree based
Detector - Basic visualization.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Understand the concepts and techniques of malwares for system security.
CO2 - Compare the techniques of static and dynamic methods to identify and classify malwares.
CO3 - Analyze the functionalities of malware by applying persistence methods.
CO4 - Construct the network and formulate the analysis test to detect malware for securing community
applications.
CO5 - Simulate a detector system and evaluate to scale better along with visualization.
CO6 - Design a case study for any network with a malware detector and compare the performance of
the various classifiers and algorithms.

B.E/B.Tech REGULAR REGULATIONS 2023


159
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1.
2.
September 2018.
3. Michael Ligh, Steven Stair,

4.
Packt
Publisher, 2019.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


160
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3037 COMPREHENSIVE LINUX
3 0 0 0 3 100

COURSE OBJECTIVES
To emphasize the significance of server management concepts of an Enterprise Linux operating
system.
To comprehend the importance of GIT repositories and security vulnerability in Linux operating
system.
To explore the cloud level services offered by Linux operating system

UNIT 1 STARTING WITH LINUX 9 Hrs.


Understanding what Linux is - Exploring Linux history - Understanding how Linux differs from other
operating systems - Understanding how Linux distributions emerged - Creating the perfect Linux desktop
- Lab: Ubuntu OS installation on virtual machines - Starting with the Ubuntu desktop live image - Handling
Ubuntu desktop - Using the desktop - Understanding the importance of threads - Lab: Understanding
basic desktop application management in Ubuntu - Adding an application launcher - Managing files and
folders - Installing and managing additional software - Lab: Knowing advanced desktop application
management in Ubuntu - Using tools - Lab: Configuring basic tools in Ubuntu OS - Working with shell in
UBUNTU - Lab1: Getting aquatinted with different types of shell - LAB3: Basic Shell management.

UNIT 2 GAINING ACCESS 9 Hrs.


Using the root user account - Exploring administrative commands, configuration files, and Log files -
Using other administrative accounts - Lab: Implementing privilege escalation - Using shell variables,
expanding arithmetic expressions Expanding variables - Lab: Manipulating environmental/shell
variable - Getting information about commands and help - Managing user accounts in UBUNTU -
User management - Lab: Managing regular user account - Group management - Lab: Group managemen
t- Moving around the file system UBUNTU - File management - Lab: Working with basic file system -
Permission management - Lab: Working with file system permissions - Access control lists - Lab:
Managing user and group permissions - Working with text files in UBUNTU.

UNIT 3 FILE MANIPULATIONS 9 Hrs.


Editing text files from shell prompt - Managing running processes - Process management - Lab:
Monitoring process activity - Writing simple shell scripts - Understanding shell scripts - Lab: Implementing
basic shell programs - Understanding server managing in RHEL - Install the server RHEL - Lab: RHEL 8
Installation on virtual machine - Initial server configuration - Lab: Configuring and verifying the initial
server settings - Remote server management - Lab: RHEL Remote server management - Initial server
configuration - Lab: Configuring and verifying the initial server settings -Remote server management-
Lab: RHEL Remote Server management - File Transfer - Lab: Securely coping files between Servers -
Log Management - Lab1: Monitoring system logs - Lab2: Recording and managing server logs - Server
monitoring - Lab: Monitoring the health of the server.

UNIT 4 MANAGING SOFTWARE IN RHEL 9 Hrs.


System software and package management - administering networking in RHEL - Lab: Examining and
configuring network in server - Starting and stopping services in RHEL - Lab: Managing daemons and
services in RHEL - Configuring a web server in RHEL - Lab: Managing a basic webserver - Advance
webserver management - Secure webserver - Lab: Securing the webserver effectively - Managing disks
and file systems - Lab: Making simple partitions - Logical volume management - Lab: Implementing
Logical Volume Management (LVM) - Configuring Samba server in RHEL - Lab: Deploy a samba share
directory - Configuring an NFS file server in RHEL - Lab: Deploy a NFS Share export - Introducing
container technology.

B.E/B.Tech REGULAR REGULATIONS 2023


161
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

UNIT 5 INTRODUCTION TO GIT 9 Hrs.


Getting started with GIT and its architecture - Lab: Installing and configuring GIT in RHEL - Remote
repositories - Lab : Exploring GIT remote repository - Branching and merging - Lab: Learning and
Exploring Branches in GIT - Configuring databases in LINUX - Lab: MariaDB (MYSQL) installation and
configuration in RHEL MongoDB - Lab: MongoDB installation and configuration in RHEL -
Understanding Linux Security Os - Lab: Kali Linux installation on virtual machine - Description about
different security tools in Kali Linux - Hands-on study on Nmap and Metasploit - Lab: Gathering
information using NMAP Metasploit - Lab: Vulnerability management using Metasploit - Knowing LINUX
as cloud workhorse - Amazon Web Service (AWS- Lab: Operating and Managing an EC2 Instance in
AWS Cloud.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Identify the need of a Linux operating system.
CO2 - Know the process management functions of a Linux operating system.
CO3 - Understand the need of users and group management in Linux operating system.
CO4 - Find the significance of GIT repositories and databases.
CO5 - Recognize the essentials of file management part of a Linux operating system.
CO6 - Gain an insight on the importance of cloud and security in Linux operating system.

TEXT / REFERENCE BOOKS


1. st Edition, 2023.

2. Petersen, Richard, Red Hat Enterprise Linux 8: Desktops and Administration, Surfing Turtle
Press, 2019.
3. Colino, Miguel Perez Red Hat Enterprise Linux 8 Administration: Master Linux Administration Skills
, Packt Publishing, 2021.
4. Günther, -By-step Course for the Complete Beginner,
Independently Published, 2017.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


162
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

ADVANCED COMPUTER L T P EL Credits Total Marks


SCSB3038
NETWORKS 2 0 2 0 3 100

COURSE OBJECTIVES
To introduce topics related to computer networks and internet operating system.
To gain knowledge on how to develop products.
To understand basics of Linux kernel architecture where the network devices based on and its
interface with various products developed for these devices.

UNIT 1 LINUX KERNEL 9 Hrs.


Linux kernel programming introduction - Static and dynamic linking of modules - User vs kernel space -
Systems calls - Makefile for modules. Shell Programming.
Practical: Write shell programs related to shell function - line count of several files and wait and sleep
commands.

UNIT 2 NETWORK DRIVERS 9 Hrs.


Introduction to Network device drivers - Character device driver development - Process synchronization
and scheduling - Interrupt handling - Kernel debugging.
Practical: Write a kernel program - compiling and inserting and removing a module in kernel

UNIT 3 eBPF - NETWORKING AND SECURITY 9 Hrs.


Basics of eBPF - Packet filters basics - Introduction to kernel's traffic control layer - Use of C for eBPF
Practical: Write a simple C program to interact with eBPF using syscall.

UNIT 4 NETWORK OPERATING SYSTEM PROGRAMMING MODULE 9 Hrs.


Introduction to Internet Operating System. Basics of Cisco IOS XR7 - Cisco IOS and Open Network Linux.
Socket basics - Basics of client-server architecture - Basics of overlay networking and virtualization -
Content delivery networks and network automation.
Practical: Write a simple C program on SNULL (Simple Network Utility for Loading Localities).
Write a C program to capture network packets.

UNIT 5 NETWORK DRIVERS TESTING 9 Hrs.


Socket basics - Loopback addressing - Structure of SNULL (Simple Network Utility for Loading Localities).

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Understand the fundamentals of Linux Kernel architecture.
CO2 - Develop products related to advanced computer networks.
CO3 - Deep knowledge in structure of networks to the protocol content and usage level.
CO4 - Understand the internet operating systems running in routers and switches.
CO5 - Develop products run in these networks and network devices.
CO6 - Test and maintain the products run in the networks.

B.E/B.Tech REGULAR REGULATIONS 2023


163
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERNCE BOOKS


1. Robert Love, Linux Kernel Development , 3rd edition, Addison Wesley, 2010.
2. Andrew S.Tanenbaum, David J.Wetherall, Computer Networks , 5th Edition, Pearson, 2019.
3. M J Bach, The Design of the Unix Operating System , 1st Edition, Pearson Education, 2015.
4. J Cooperstein, Writing Linux Device Drivers - A Guide with Exercises Createspace, 2009.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


164
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SITB3002 WEB DESIGNING
3 0 0 0 3 100

COURSE OBJECTIVES
To define the principles of Web page design.
To visualize the basic concept of HTML.
To understand the basics concept of CSS.

UNIT 1 WEB DESIGN PRINCIPLES 9 Hrs.


Basic principles involved in developing a web site - Planning process - Five golden rules of web designing
- Designing navigation bar - Page design - Home page layout - Design concept - Brief history of internet
- What is World Wide Web - Why create a web site - Web standards - Audience requirement.

UNIT 2 INTRODUCTION TO HTML 9 Hrs.


What is HTML - HTML documents - Basic structure of an HTML document - Creating an HTML document
- Mark up tags Heading - Paragraphs - Line breaks - HTML tags - Introduction to elements of HTML -
Working with text - Working with lists, tables and frames - Working with hyperlinks, images and multimedia
- Working with forms and controls.

UNIT 3 INTRODUCTION TO CASCADING STYLE SHEETS 9 Hrs.


Concept of CSS - Creating Style Sheet - CSS properties - CSS styling (Background, Text Format,
Controlling Fonts) - Working with block elements and objects - Working with lists and tables - CSS Id and
class - Box model (introduction, border properties, padding properties, margin properties) - CSS
advanced (grouping, dimension, display, positioning, floating, align, pseudo class, navigation bar, image
sprites, attribute sector) - CSS color - Creating page layout and site designs.

UNIT 4 INTRODUCTION TO WEB PUBLISHING OR HOSTING 9 Hrs.


Creating the web site - Saving the site - Working on the web site - Creating web site structure - Creating
Titles for web pages - Themes-Publishing web sites.

UNIT 5 RESPONSIVE WEB DESIGN WITH BOOTSTRAP 9 Hrs.


Introduction to responsive design - Common device dimensions Using CSS media queries View-port
tag Basic custom layout - Introduction to bootstrap Installation of bootstrap Grid system Forms
Buttons Icons integration.

Max.45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Infer web page design principles.
CO2 - Create simple webpage using HTML forms and controls.
CO3 - Design a webpage using CSS.
CO4 - Create and publish website.
CO5 - Develop web applications using responsive web design.
CO6 - Application of bootstrap in website design.

B.E/B.Tech REGULAR REGULATIONS 2023


165
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. India: Dreamtech Press, 2010.
2. th edition, Wiley India, 2011.

3.
India, 2011.
4. , 2009.
5. Murray,Tom .

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


166
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3006 SOFTWARE VULNERABILITY TESTING
3 0 0 0 3 100

COURSE OBJECTIVES
To understand the fundamentals of testing and analyse the different methodologies.
To conduct online web testing.
To understand about Ethical hacking and information gathering methodologies.

UNIT 1 FUNDAMENTALS OF TESTING AND ANALYSIS 9 Hrs.


A Framework Principles Test and Analysis Basic Techniques: Finite models Dependency and
data flow Symbolic executions Finite state verification.

UNIT 2 TESTING 9 Hrs.


Functional Combinational - Structural Data flow Model based Fault based Inspection Program
analysis OO Testing Integration and component based System Acceptance Regression.

UNIT 3 INTRODUCTION TO WEB APPLICATIONS SECURITY 9 Hrs.


Threats and principles - Introduction to secure design - Web server: Introduction a secure setup of apache
- Firewalling a server browser: General concepts Functionalities - Browsers war - Configuration - Attack
to browsers - Users tracking / profiling - Browser security and secure browsing.

UNIT 4 ETHICAL HACKING 9 Hrs.


Five stages of hacking-Vulnerability Research-Legal implication of hacking - Impact of hacking - Foot
printing and Social engineering. Information gathering methodologies: Competitive Intelligence- DNS
Enumerations- Social Engineering attacks - Scanning and enumeration port scanning - Network scanning
- Vulnerability Scanning - NMAP scanning tool - OS finger printing enumeration - System hacking
password.

UNIT 5 SNIFFERS and SQL INJECTION ACTIVE AND PASSIVE SNIFFING 9 Hrs.
ARP Poisoning - Session Hijacking - DNS Spoofing - Conduct SQL injection attack Counter measures
- Cracking techniques - Key loggers - Escalating privileges - Hiding Files - Steganography technologies
- Counter measures.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Comprehend the concepts of Testing.
CO2 - Gain knowledge of Vulnerability Testing,
CO3 - Test web applications for Vulnerability.
CO4 - Implement open password- protected files.
CO5 - Design and implement vulnerable software applications.
CO6 - Apply common phishing techniques.

B.E/B.Tech REGULAR REGULATIONS 2023


167
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Software Testing and Analysis: Process, Principles, and Techniques, Mauro Pezze,Michal
Young, wiley publications, 2008
2. The art of software security assessment : Mark Dowd, John McDonald, Justin Schuh, Pearson
Education, 20021
3. The Art of Software Security Testing: Chris Wysopal, Lucas Nelson, Elfriede Dustin, Dino Dai
Zovi, Pearson Education, 2006.
4. The Hacker Playbook 2: Peter Kim, Secure Planet, LLC, 2015.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


168
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB1231 DATA AND INFORMATION SCIENCE
3 0 0 0 3 100

COURSE OBJECTIVES
To learn how to process raw data into formats necessary for analysis.
To gain in-depth knowledge of fundamental data science concepts through motivating real-world
case studies.
To understand the methods of data handling and big data.

UNIT 1 DATA ACQUISITION 9 Hrs.


Data Acquisition Sources of acquiring the data - Internal systems and external systems - Web APIs,
Data preprocessing- Exploratory Data Analysis (EDA)- Basic tools (plots, graphs and summary statistics)
of EDA -Open data sources, Data APIs, Web scrapping -Relational database access (queries) to process
/ access data.

UNIT 2 DATA PREPROCESSING AND PREPARATION 9 Hrs.


Data munging, wrangling - Data visualization basics -Plyr packages - Cast/Melt. Tableau: Creating
visualizations in Tableau- Data hierarchies, filters, groups, sets, calculated fields - Map based
visualizations - Build interactive dashboards - Data stories.

UNIT 3 DATA QUALITY AND TRANSFORMATION 9 Hrs.


Data imputation -Data transformation (minmax, log transform, z-score transform etc.,). - Binning, classing
and standardization. Outlier / Noise and Anomalies.

UNIT 4 HANDLING TEXT DATA 9 Hrs.


Bag-of-words- Regular expressions - Sentence splitting and tokenization - Punctuations and stop words,
incorrect spellings - Properties of words and word cloud - Lemmatization and Term-Document TxD
computation -Sentiment analysis (Case Study).

UNIT 5 PRINCIPLES OF BIG DATA 9 Hrs.


Introduction to Big Data - Challenges of processing Big Data (Volume, Velocity and Variety perspective)
- Use Cases.

Max.45Hrs.

COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Explore the fundamental concepts of Data science.
CO2 - Identify the basic data formats.
CO3 - Apply data preprocessing and data visualization techniques to data.
CO4 - Improve the data quality through various transformations.
CO5 - Implement the methods of handling text data.
CO6 - Analyse the challenges in processing Big Data.

B.E/B.Tech REGULAR REGULATIONS 2023


169
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Jeroen Janssens Data Science at the Command Line , O'Reilly, 2015.
2. Python for Data Analysis .
3. Doing Data Science, Straight Talk from The Frontline

4. Avrim Blum, John Foundations of Data Science


University Press, 2020.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


170
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3032 CLOUD COMPUTING
3 0 0 0 3 100

COURSE OBJECTIVES
To understand the basic principles and implementation of cloud computing and different
architecture available to deploy the cloud environment.
To gain knowledge on the security issues that has to be considered on implementation of cloud.
To understand on the various cloud storage systems.

UNIT 1 INTRODUCTION 9 Hrs.


Origins of Cloud computing Cloud components - Essential characteristics On-demand self-service -
Broad network access - Location independent resource pooling -Rapid elasticity - measured service -
Comparing cloud providers with traditional IT service providers - Roots of cloud computing.

UNIT 2 CLOUD INFRASTRUCTURE 9 Hrs.


Data center components: IT equipment and facilities design considerations: Requirements, Power,
Efficiency and Redundancy Power Calculations - PUE and challenges in cloud data centers - Cloud
management and cloud software deployment considerations Virtualization - Types of virtualization
Implementation levels of virtualization (CPU, Memory, I/O).

UNIT 3 CLOUD ARCHITECTURE 9 Hrs.


Layers and models layers in cloud architecture - Software as a Service (SaaS) -features of SaaS and
benefits - Platform as a Service ( PaaS ) - Features of PaaS and benefits - Infrastructure as a Service
(IaaS) - Features of IaaS and benefits - Service providers - challenges and risks in cloud adoption.
Cloud deployment model: Public clouds Private clouds Community clouds - Hybrid clouds -
Advantages of cloud computing.

UNIT 4 CLOUD COMPUTING SOFTWARE SECURITY 9 Hrs.


Cloud information security objectives Confidentiality Integrity Availability - Cloud security services -
Relevant cloud security design principles - Secure cloud software requirements - Secure development
practices - Approaches to cloud software requirement engineering - Cloud security policy implementation.

UNIT 5 CLOUD STORAGE 9 Hrs.


Introduction to storage systems - Cloud storage concepts - Distributed File Systems (HDFS, Ceph FS) -
Cloud databases (HBase, MongoDB, Cassandra, Dynamo DB) - Cloud object storage (Amazon S3,
OpenStack Swift, Ceph).

Max 45 Hrs.

COURSE OUTCOMES
On completion of the course, the student will be able to
CO1 - Implement the fundamental cloud computing environment.
CO2 - Virtualize a cloud on the system .
CO3 - Understand the various architecture that can be implemented in cloud.
CO4 - Analyse various security issues while deploying the cloud.
CO5 - Understand the process of storing in the cloud.
CO6 - Develop applications by deploying a secured cloud environment.

B.E/B.Tech REGULAR REGULATIONS 2023


171
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. India: Prentice Hall India Pvt., Limited, 2015.
2. Comer, D., The Cloud Computing Book: The Future of Computing Explained United
Kingdom: CRC Press, 2021.
3. John Wtinghouse, J
, CRC Press.
4.
, Wiley.
5. Cloud ,
TATA McGraw- Hill , New Delhi, 2010

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


172
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

KNOWLEDGE MANAGEMENT L T P EL Credits Total Marks


SCSB3422
SYSTEMS 3 0 0 0 3 100

COURSEOBJECTIVES
To study the basic rudiments of knowledge management.
To learn the coding tools and procedures.
To explore the faster decision making with knowledge transfer systems.

UNIT 1 KNOWLEDGE MANAGEMENT 9 Hrs.


KM Myths KM LifeCycle Understanding Knowledge Knowledge, intelligence Experience Common
Sense Cognition and KM Types of Knowledge Expert Knowledge Human Thinking and Learning.

UNIT 2 KNOWLEDGE MANAGEMENT SYSTEM LIFE CYCLE 9 Hrs.


Challenges in building KM systems Conventional vs KM System Life Cycle (KMSLS) Knowledge
creation and knowledge architecture model of knowledge creation and transformation -
Knowledge architecture.

UNIT 3 CAPTURING KNOWLEDGE 9 Hrs.


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

UNIT 4 KNOWLEDGE CODIFICATION 9 Hrs.


Modes of knowledge conversion Codification tools and procedures Knowledge d
System testing and deployment Knowledge testing Approaches to logical testing, user acceptance
testing KM system deployment issues User training Post implementation.

UNIT 5 KNOWLEDGE TRANSFER AND SHARING 9 Hrs.


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

COURSEOUTCOMES
On completion of the course the student will be able to
CO1 - Understand the concept of knowledge and its types.
CO2 - Analyse the challenges in building knowledge management systems.
CO3 - Develop knowledge management capturing techniques.
CO4 - Test the coding tools for knowledge management systems.
CO5 - Understand the architecture and development of knowledge systems.
CO6 - Develop models with Knowledge management system tools.

B.E/B.Tech REGULAR REGULATIONS 2023


173
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCEBOOKS
1. Elias.M.Award, Hassan M.Ghaziri, , Pearson Education, 2007.
2. Becerra-Fernandez, Irma., Sabherwal, Rajiv. Knowledge Management: Systems and
Processes. United Kingdom: Taylor & Francis, 2014.
3. Husain, Shabahat., Ermine, Jean-
Emerald Publishing Limited, 2021.
4. C.W.Holsapple, on Knowledge Springer Berlin Heidelberg, 2013.
5. Becerra-Fernandez, I.Sabherwal, R. Knowledge Management: Systems and Processes
M.E.SharpeInc., 2010.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


174
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

KNOWLEDGE REPRESENTATION AND L T P EL Credits Total Marks


SCSB1511
REASONING 3 0 0 0 3 100

COURSE OBJECTIVES
To understand the foundations of KRR and the tradeoff between representation and reasoning.
To understand which knowledge-based techniques are appropriate for which tasks.
To apply KRR systems to research and challenging problems.

UNIT 1 INTRODUCTION 9 Hrs.


Introduction to Knowledge Base - Models and Knowledge-Based Agents - Challenges and issues in
knowledge representation and reasoning - Nature of knowledge - Knowledge acquisition techniques -
Classical logic.

UNIT 2 LOGIC BASED KNOWLEDGE REPRESENTATION 9 Hrs.


First-Order Logic: Syntax and semantics (predicates, variables, quantifiers), First-Order Logic Knowledge
representation language - Model, interpretation, inferences in First Order Logic - Forward chaining -
Backward chaining - Propositional Logic vs. First-Order Logic
Universal Instantiation - Existential Instantiation -Substitution and unification - Generalized MP rule -
Soundness of GMP - Resolution inference rule - CNF logic programming Prolog.

UNIT 3 NON LOGIC BASED KNOWLEDGE REPRESENTATION 9 Hrs.


Semantic networks: Nodes, arcs, and semantic inheritance. Frames and scripts: Representing structured
knowledge using attribute-value pairs and slots.
Conceptual graphs: Graphical representation of knowledge and its formal semantics.
Ontologies: Introduction to ontology languages (such as RDF, OWL) and their role in representing domain
knowledge.
.
UNIT 4 KNOWLEDGE REPRESENTATION AND PLANNING 9 Hrs.
Ontological engineering Categories and objects Events Mental objects and modal logic Reasoning
systems for categories Reasoning with default information - Classical planning Algorithms for classical
planning Heuristics for planning Hierarchical planning Non-deterministic domains time, schedule,
and resources Analysis.

UNIT 5 APPLICATIONS OF KRR 9 Hrs.


Case studies in Artificial Intelligence: Applications of knowledge representation and reasoning in
intelligent systems Planning Robotics - Natural language understanding and intelligent tutoring
systems Intelligent agents Robotics and automation.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Understand the fundamental principles and challenges of knowledge representation and
reasoning.
CO2 - Review critical properties of a knowledge-based system.
CO3 - Analyze different formalisms and languages used for representing knowledge.
CO4 - Apply reasoning techniques to derive new knowledge from existing knowledge.
CO5 - Design knowledge representation systems using logic-based and non-logic-based approaches.
CO6 - Apply different modeling approaches to solve KRR Problems.

B.E/B.Tech REGULAR REGULATIONS 2023


175
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERNCE BOOKS


1. Stuart Russell and Peter Norvig , "Artificial Intelligence: A Modern Approach", Prentice Hall,
2022 .
2. Ronald Brachman and Hector Levesque , "Knowledge Representation and Reasoning", MK
Publishers, 2004.
3. Dean Allemang and James Hendler,
Modeling in RDFS and OWL", Elsevier Science, 2011.
4. Michael Gelfond and Yulia Kahl , "Knowledge Representation, Reasoning, and the Design of
Intelligent Agents: The Answer-Set Programming Approach", Cambridge University Press,
2014. .

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


176
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SITB3004 FULL STACK WEB DEVELOPMENT
3 0 0 0 3 100

COURSE OBJECTIVES
To understand and familiarize with JavaScript and NodeJS environments.
To learn about NoSQL database and basics of MongoDB.
To acquire knowledge of connecting the ReactJS frontend and ExpressJS backend.

UNIT 1 INTRODUCTION 9 Hrs.


Introduction to JavaScript Brief history of NodeJS and its alternatives Installing and setting up NodeJS
environment Introduction to NPM package manager and registry - Introduction to callbacks and events
File system access and handling streams Introduction to common utility modules (OS, Path).

UNIT 2 NOSQL DATABASE WITH MONGODB 9 Hrs.


Introduction to NoSQL Benefits and disadvantages of NoSQL databases Introduction to MongoDB -
Installing and setting up MongoDB environment Data model design (Embedded and Normalized)
Database manipulation (Create, Drop, Create and Drop Collections) Document manipulation (Insert,
Delete, Update, Query (Limit, Sort, Aggregation )) Projection Introduction and setting up Mongoose
ORM Handling models and queries with Mongoose.

UNIT 3 FRONTEND DEVELOPMENT WITH REACTJS 9 Hrs.


Introduction to ReactJS Installation and creating a basic React application Introduction to JSX
Components and props State and lifecycle Events and effects Conditional rendering Introduction to
HTTP requests and fetch Making HTTP GET and POST requests Handling data from API.

UNIT 4 BACKEND DEVELOPMENT WITH EXPRESSJS 9 Hrs.


Introduction to ExpressJS- Separating the tasks of frontend and backend Installing and setting up
ExpressJS environment Introduction to APIs Routing and URL building Error handling Project
directory structuring - Handling form data and request data Handling and serving files Authentication
using session keys Handling request of multiple methods and their placement (GET, POST, DELETE,
PATCH) Documenting an API.

UNIT 5 CREATING A FULL STACK WEB APPLICATION 9 Hrs.


React page with input fields Extracting and validating data from input field(s) Making a HTTP request with
data from input field(s) Using Mongoose with an ExpressJS application Inserting document with data from
HTTP request Writing, handling URL query parameters and using its values to write queries with Mongoose
Displaying data returned from backend Handling errors in API requests.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Gain basic knowledge of JavaScript and its environment.
CO2 - Discuss NoSQL databases and delve deeper into it using MongoDB and performing basic
database operations in it.
CO3 - Apply the concepts of JSX and ReactJS to display and manipulate data in a webpage and to
make basic HTTP requests and handle them.
CO4 - Distinguish the roles of frontend and backend, and to work with ExpressJS.
CO5 - Develop a basic, complete API and interact with it from the ReactJS frontend.
CO6 - Create real time web applications.

B.E/B.Tech REGULAR REGULATIONS 2023


177
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT /REFERENCE BOOKS


1. Bradshaw, Shannon., Brazil, Eoin., Chodorow, MongoDB: The Definitive Guide:
United States: O'Reilly Media, 2019.
2. Ethan Brown,
United States: O'Reilly Media, 2019.
3. Stefanov, Stoyan, United States: O'Reilly Media, 2021.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


178
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

BLOCKCHAIN AND DISTRIBUTED L T P EL Credits Total Marks


SCSB3015
LEDGER TECHNOLOGY 3 0 0 0 3 100

COURSE OBJECTIVES
To understand conceptual elements for blockchain and distributed ledger technologies.
To acquire knowledge about blockchain, cryptocurrencies and distributed ledgers.
To use Hyper Ledger Fabric and Ethereum platform to implement blockchain applications.

UNIT 1 INTRODUCTION TO BLOCKCHAIN, CRYPTOCURRENCIES AND


DISTRIBUTED LEDGERS 9 Hrs.
Blockchain Distributed Ledgers - Cryptographic basics for cryptocurrency Hashing - Signature schemes
- Encryption schemes and elliptic curve cryptography - CAP theorem and blockchain - Categories of
blockchains: Public, Private blockchains -Permissioned Ledger - Tokenized blockchains, Tokenless
blockchains - Sidechains.

UNIT 2 ESSENTIALS OF CRYPTOCURRENCIES 9 Hrs.


Distributed identity: Public and private keys - Digital identification and wallets - Decentralized network -
Distributed ledger: Permissioning framework -Blockchain data structure - Double spending - Network
consensus - Sybil attacks - Block rewards and miners, Difficulty under competition - Forks and consensus
chain - the 51% attack - Confirmations and finality - The limits of proof-of-work - Alternatives to proof of
work.

UNIT 3 BLOCKCHAIN IMPLEMENTATION 9 Hrs.


Bitcoin: Bitcoin and Merkle Root - Eventual Consistency and Bitcoin - Byzantine Fault Tolerance - Bitcoin
and Secure Hashing - Bitcoin block-size - Bitcoin Mining - Proof of Work (PoW) - Bitcoin Scripting.
Blockchain Collaborative Implementations: Hyper ledger, Corda - ERC 20 and the token explosion.

UNIT 4 FUTURE USE CASES OF DISTRIBUTED LEDGER TECHNOLOGIES 9 Hrs.


Financial Services: Accounting and audit - Global payments - Programmable money - Citizen
Identification - Voting - Healthcare: Electronic health records system - Supply chain management - Trade
finance - Tokenization of real assets.

UNIT 5 DISTRIBUTED LEDGER TECHNOLOGY IN ALTERNATIVE BLOCKCHAIN 9 Hrs.


Alternative Blockchains: Kadena, Ripple, Stellar, Rootstock, Drivechain, Quorum - Transaction manager:
Crypto Enclave - Quorum Chain - Network manager: Tezos, Storj, Maidsafe, BigChainDB.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Understand the cryptographic basis for cryptocurrency.
CO2 - Choose a blockchain implementation based on real time scenario.
CO3 - Categorize the various types of blockchains.
CO4 - Examine the techniques for anonymity preservation.
CO5 - Identify and understand the use cases of distributed ledger technology.
CO6 - Evaluate alternative Blockchains and their applicability.

B.E/B.Tech REGULAR REGULATIONS 2023


179
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Treccani, A., Lipton Blockchain and Distributed Ledgers: Mathematics, Technology, And
Economics First Edition, Singapore: World Scientific Publishing Company, 2021.
2. Wattenhofer, R., Blockchain Science: Distributed Ledger Technology 3rd Edition,
United States: Independently Published, 2019.
3. Goldfeder, S., Bonneau, J., Miller, A., Felten, E., Narayanan, A. Bitcoin and
First Edition, Princeton University Press, 2016.
4. Bashir, I., Mastering Blockchain: A Deep Dive Into Distributed Ledgers, Consensus
Protocols, Smart Contracts, DApps, Cryptocurrencies, Ethereum, and More 3rd Edition,
United Kingdom: Packt Publishing, 2020.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


180
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3025 STATISTICAL MACHINE LEARNING
3 0 0 0 3 100

COURSE OBJECTIVES
To understand fundamental concepts, techniques of Statistical Learning.
To know how the computer programs, detect human actions, images using pattern recognition.
To understand Supervised Learning algorithms and Unsupervised Learning algorithms.

UNIT 1 STATISTICAL LEARNING 9 Hrs.


Statistical Learning: Estimate f - Supervised Vs Unsupervised Learning - Regression Vs Classification
problems - Accessing Model Accuracy - The learning problem: Risk functions, Bias and Variance - Curse
of Dimensionality.

UNIT 2 PREDICTION AND CLASSIFICATION 9 Hrs.


Linear Regression: Simple linear regression - Multiple linear regression - Multivariate regression -
Classification: Overview of classification - Logistic regression - Support vector machine - Decision tree -
Bayesian belief network - Comparison of classification methods.

UNIT 3 PATTERN RECOGNITION AND ANALYSIS 9 Hrs.


Means and distances - Fisher discriminant analysis - Singular value decomposition - PCA and LDA -
Learning paradigms - Bayesian decision theory: Minimum error rate classifier - Parameter estimation:
Maximum likelihood and Bayesian Estimation - Hidden markov models - Nonparametric techniques:
Nearest Neighbor rules (KNN) - Parzen windows.

UNIT 4 CLUSTERING AND ENSEMBLE METHODS 9 Hrs.


Clustering: Partitional Hierarchical - Ensemble models: Types and techniques Applications of
Ensemble modelling - Evaluation measures Hypothesis testing Cross-validation and Hyper parameter
optimization Bootstrapping and Uncertainties

UNIT 5 KERNEL METHODS, SURVIVAL ANALYSIS AND CASESTUDY 9 Hrs.


Kernel Methods: Mercel kernels - Kernel classification - Kernel PCA - Kernel tests of independence.
Survival Analysis: Survival and censoring times Censoring - Kaplan-Meier Survival Curve Log- rank
test - Regression models with survival response - Shrinkage for the Cox model.
Case Study: Survival analysis of brain cancer data, Publication data and Call Center data.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Apply appropriate statistical methods to analyze data.
CO2 - Recognize objects/actions by applying pattern recognition techniques.
CO3 - Apply Reasoning and Uncertainty using Supervised models.
CO4 - Prediction and analysis of data using Unsupervised models.
CO5 - Use Kernel methods to test data independence.
CO6 - Analyze and do prediction of real time data.

B.E/B.Tech REGULAR REGULATIONS 2023


181
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Gareth James, Daniela Witten, Trevor Hastie, Robert Tibshirani,
2nd Illustrated Edition, 2021.
2. , 2013.
3. John Shawe- , Cambridge
University Press, 2006.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


182
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

ARTIFICIAL INTELLIGENCE SEARCH L T P EL Credits Total Marks


SCSB1251
METHODS AND REASONING 3 0 0 0 3 100

COURSE OBJECTIVES
To learn the different search strategies in AI.
To gain knowledge in solving AI problems.
To master the concepts of learning and communication in AI.

UNIT 1 BASIC SCIENCE BEHIND AI 9 Hrs.


Intelligence Memory Computation Learning Intelligent Agents:
Features Behaviour in the environment Rationality Nature and its structure Case Study: AI
programming languages history: LISP Prolog Python.

UNIT 2 SEARCHING TOWARDS SOLUTION 9 Hrs.


Searching Strategies: Informed search: BFS DFS Depth Bounded DFS Uninformed search:
Heuristic functions Hill climbing search Best First Search Local Maxima Solution Space search
Adversarial search Constraint satisfaction problem Case Study: N-Queens problem.

UNIT 3 KNOWLEDGE: ROLE AND REPRESENTATION 9 Hrs.


Knowledge Definition and management Types: Declarative and procedural knowledge Knowledge
Engineering behind logical agents: Propositional Logic First Order Logic Inference: Forward and
Backward chaining Ontological engineering Case Study: Ontology based knowledge representation.

UNIT 4 APPROACHES BEHIND PLANNING AND REASONING 9 Hrs.


Algorithm for planning as state space search Analysis of planning approach Reasoning: Bayes Rule
Bayesian network and its approximation Hidden Markov Model Kalman Filters Decision networks
Case Study: Wumpus World Problem.

UNIT 5 DECODING AND LEARNING INTELLIGENCE 9 Hrs.


Learning algorithms: Classification and Regression with linear model Non-parametric models
Ensemble learning Explanation based learning Learning with hidden variables AI real time
applications Case Study: Nature inspired computation.

Max.45 Hrs.

COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Identify 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 Bayes rule to solve the problems of societal concern
CO6 - Design user centric applications using AI concepts.

B.E/B.Tech REGULAR REGULATIONS 2023


183
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. 4th Illustrated Edition,
Pearson Education, 2021.
2. Elaine rd Edition, Tata McGraw Hill, 2019.

3.
Bartlett Publishers, Inc., 1st Edition, 2008.
4. David L. Poole and Alan K. Mackworth, Artificial Intelligence: Foundations of Computational
Agents, 2nd Edition, 2010.
5. Ertel, Wolfgang, Introduction to Artificial Intelligence,1 st Edition ,2017.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


184
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


SCSB3039 ADVANCED DATA STRUCTURES
3 0 0 0 3 100

COURSE OBJECTIVES
To acquire knowledge of organizing the data in a nonlinear fashion.
To gain knowledge on balancing the height of trees to optimize the structure and search time.
To understand the method of designing the table data structure and its applications

UNIT 1 TREE STRUCTURES 9 Hrs.


AVL Trees - Single rotation - Double rotation - Splay Trees - Red-Black Trees, B-Trees: Definition of
B-trees, Basic operations on B-trees, Deleting a key from a B-tree. 2-3 Trees.

UNIT 2 DIGITAL SEARCH STRUCTURES 9 Hrs.


Digital Search trees, Binary tries and Patricia, Multiway Tries, Suffix trees, Standard Tries, Compressed
Tries pattern matching Introduction - The naive string-matching algorithm, The Rabin-Karp algorithm,
The Knuth-Morris - Pratt algorithm.

UNIT 3 HEAPS 9 Hrs.


Introduction - Binary Heaps - Basic Heap Operations - Binomial Heaps/Queues - Binomial Queue
Structure - Binomial Queue Operations - Implementation of Binomial Heaps.

UNIT 4 SETS 9 Hrs.


Sets: Representation - Operations on sets - The Disjoint sets class Equivalence relation - Basic data
structure - Union and find algorithms - Smart Union and Path compression algorithm - Applications.

UNIT 5 TABLES 9 Hrs.


Rectangular tables - Jagged tables - Inverted tables - Symbol tables - Static tree tables - Dynamic tree
tables - Hash tables- Hash function - Separate chaining - Linear probing - Quadratic probing - Double
hashing Rehashing - Universal hashing - Extendible hashing.

Max.45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Design and Implement operations on augmenting data structures.
CO2 - Apply string matching techniques for solving problems effectively.
CO3 - Apply the basic heap operations to design and implement various types of Heaps.
CO4 - Perform the operation like Union, find min, extract min and delete operation on sets.
CO5 - Design table data structure and apply it for many applications.
CO6 - Analyze the given scenario and choose appropriate Data Structure for solving problems.

B.E/B.Tech REGULAR REGULATIONS 2023


185
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Jean-Paul Tremblay, Paul G. Sorenson, An Introduction to Data Structures with ,
TMH, 2017.
2. Data Structures and Algorithm Analysis in C++ , 4th Edition, 2014.
3. Larry R. Nyhoff, ADTs, Data Structures, and Problem Solving with C++ , Pearson Education,
2009.
4. th Edition, MIT Press,

2022.
5. Goodrich MT, Tamassia R, Goldwasser MH., Data structures and algorithms in Python John
Wiley and Sons Ltd; 2013.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


186
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

INTELLIGENT ROBOTS AND DRONE L T P EL Credits Total Marks


SCSB3642
TECHNOLOGY 3 0 0 0 3 100

COURSE OBJECTIVES
To explore the knowledge of intelligent robots.
To explore the mechanism of drone technology.
To understand the various applications of drones in real world.

UNIT 1 INTRODUCTION 9 Hrs.


Overview of robotics - Robotics in AI - Embedded systems Agent task environment model - Embodied
systems - Sensors and signal processing - Planning approaches to robot control: STRIPS and SHAKEY-
Robot manipulator kinematics.

UNIT 2 APPROACHES 9 Hrs.


Control Theory: Feedback, feed forward and open loop control - Linear first order lag processes -
Limitations of control theory- Probability Based Approaches: Markov Decision Processes (MDPs) -
Navigation - Behaviour-Based Control: The subsumption architecture - Hybrid architectures - Formalising
behaviour based control (SMDPs) - Adaptive approaches to robot control- Reinforcement learning for
control- Model Based learning approaches to control- Learning maps - Evolutionary approaches.

UNIT 3 DRONE TECHNOLOGY 9 Hrs.


Drone Concepts - Terminologies - History of drone - Types of current generation of drones based on their
method of propulsion - Drone design and fabrication: Classifications of the UAV - Overview of the main
drone parts technical characteristics of the parts Function of the component parts.

UNIT 4 DRONE PROGRAMMING 9 Hrs.


- Methods of programming drone - Download program - Install program on
computer -Running Programs - Multirotor stabilization - Flight modes - Drone flying and operation -
Concept of operation for drone flight modes - Drone accessories - Sensors - Onboard storage capacity
Removable storage devices - Linked mobile devices and applications.

UNIT 5 DRONE MAINTENANCE 9 Hrs.


Drone commercial applications: Drones in agriculture - Drones in inspection of transmission lines and
power distribution - Drones in filming and panoramic picturing - Future of drones : Miniaturization of
drones - Increasing autonomy of drones - The use of drones in swarms.

Max.45 Hrs.

COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Understand the basics behind robotics and embedded systems.
CO2 - Explain basic approaches behind robotic controls.
CO3 - List out different terminologies and concepts behind drone.
CO4 - Develop programs for drone movement and configuration.
CO5 - Apply drone technology for various commercial applications.
CO6 - Develop drones for real time societal needs.

B.E/B.Tech REGULAR REGULATIONS 2023


187
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Nitin Goyal, Sharad Sharma, Arun Kumar Rana, Suman Lata Tripathi, Internet of Things
Robotic and Drone Technology , CRC Press, 2021.
2. Neil Wilkins, Robotics: What Beginners Need to Know about Robotic Process Automation,
Mobile Robots, Artificial Intelligence, Machine Learning, Autonomous Vehicles, Speech
Recognition, Drones, and Our Future , Independently Published,2019.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


188
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

PRIVACY AND SECURITY IN L T P EL Credits Total Marks


SCSB3474
ONLINE SOCIAL MEDIA 3 0 0 0 3 100

COURSE OBJECTIVES
To study the different encryption systems in social network
To understand the importance of K-Anonymity
To understand the types of attacks against
UNIT 1 ANALYSIS OF PRIVACY IN SOCIAL NETWORKS 9 Hrs.
Introduction to social media- Modern social media outlets Three layered framework-Characteristics
used to analyze social web privacy - Social Media : End users and Business - Privacy issues related
to social web users- Privacy issues related to service providers -Security and privacy for digital facets
- Identifiable facets - Private facets - Technological safeguards.

UNIT 2 ENCRYPTION FOR PEER-TO-PEER SOCIAL NETWORKS 9 Hrs.


Introduction to P2P bases OSN architecture -Essential criteria for the P2P encryption systems - Existing
P2P OSN architectures - Evaluations of existing encryption schemes based on our criteria - Broadcast
encryption - Predicate encryption -Survey of unethical behavior - Influencing factors.

UNIT 3 STEALING REALITY AND K-ANONYMITY 9 Hrs.


Stealing reality- Social attack model- Social learnability - k-anonymity - k-degree anonymity - k-
neighborhood anonymity - k-automorphism - k-isomorphism - L-diversity - Attack model and privacy
guarantee - -diversified graph- Anonymization techniques.

UNIT 4 LINKS RECONSTRUCTION ATTACK AND BITCOIN SYSTEM 9 Hrs.


Privacy in social networks- Link prediction - Feature extraction- Communities datasets- Electronic
currencies Anonymity - Bitcoin System - Transaction network - User network- Anonymity analysis-
Integrating off - Network information - Bitcoin faucet - Voluntary disclosures - TCP/IP layer information
- Context discovery - Flow and temporal analyses.

PRIVACY-PRESERVING DATA INTEGRATION USING DECOUPLED 9 Hrs.


UNIT 5
DATA
Record linkage - Privacy preserving computation - Use case and the threat model - Use case for
privacy- Preserving record linkage- Threat model for privacy-preserving record linkage - Information
and privacy - Sensitivity and identifiability - Decoupled data access model - Social Security numbers-
Need for chaffing.

Max.45Hrs.

COURSE OUTCOMES
On completion of the course the student will be able to
CO1 - Understand the concepts of privacy in social network.
CO2 - Apply the different encryption techniques.
CO3 - Apply the knowledge to steal and attack social model.
CO4 - Understand the importance of bitcoin system.
CO5 - Analyze the privacy preserving for decoupled data.
CO6 - Develop the use-case models for privacy preservation.

B.E/B.Tech REGULAR REGULATIONS 2023


189
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


Yaniv Altshuler, Yuval Elovici, Armin B. Cremers Nadav Aharony, Alex Pentland,
1.
, 2014.
2. Liang, Xiaohui, Springer New York, 2013.
Alex Pentland, Armin B. Cremers, Nadav Aharony, Yaniv Altshuler, Yuval Elovici Security
3.
and Privacy in Social Networks United States, Springer New York, 2014.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


190
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

PRINCIPLES AND PRACTICES OF L T P EL Credits Total Marks


SBAB4001
MANAGEMENT 3 0 0 0 3 100

COURSE OBJECTIVES
To analyse how the field of management has evolved and its significant contributions
To analyse and apply the critical role of managers in modern organizational settings.
To illustrate and evaluate the importance of planning, organizing, directing and controlling in decision
making.

UNIT 1 INTRODUCTION 9 Hrs.


Definition, Functions, Process, Scope and Significance of Management. Nature of Management,
Managerial Roles, Managerial Skills and Activities, Difference between Management and Administration.
Significance of Values and Ethics in Management.

UNIT 2 SCHOOLS OF MANAGEMENT 9 Hrs.


Evolution of Management Thought - Contributions of F.W. Taylor, Henry Fayol, Elton Mayo, Approaches
of Management Thought (including MBO and MBE) Functions of Management. Concept of Leadership-
Theories and Styles.

UNIT 3 PLANNING AND ORGANIZING 9 Hrs.


Nature, Scope, Objective and Significance of Planning, Elements and Steps of Planning, Decision Making
Organizing Principles, Span of Control, Line and Staff Relationship, Authority, Delegation and
Decentralization. Effective Organizing, Organizational Structures, Formal and Informal Organizations,
Staffing.

UNIT 4 DIRECTING 9 Hrs.


Effective Directing, Supervision, Motivation: Different Theories of Motivation - Maslow, Herzberg, Mc
Clelland, Vroom, Porter and Lawler, Job Satisfaction. Communication Process, Channels and Barriers,
Effective Communication.

UNIT 5 CONTROLLING AND COORDINATING 9 Hrs.


Elements of Managerial Control, Control Systems, Management Control Techniques, Effective Control
Systems. Coordination Concept, Importance, Principles and Techniques of Coordination, Concept of
Managerial Effectiveness.

Max. 45 Hrs.

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Understanding of basic management concepts, principles, and practices.
CO2 - Develop planning and decision-making strategies in an organization.
CO3 - Summarize the concept and complete the process of organizing.
CO4 - Develop an understanding of staffing, leadership, directing and motivation in an organization.
CO5 - Predict the dynamics of controlling and its emerging issues in management.
CO6 - Assess managerial practices and choices relative to ethical principles and standards.

B.E/B.Tech REGULAR REGULATIONS 2023


191
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Stephen P. Robbins, David A. Decenzo, Fundamentals of Management , Pearson Education,
9th Edition.
2. Harold Koontz, O'Donnell and Heinz Weihrich, New Delhi, 9th
edition, Tata McGraw Hill.
3. Management Fundamentals: Concepts, Applications, and Skill Development , 6th edition,
Sage.
4. Richard L. Daft, Principles of Management , Cengage Learning.
5. Prasad, L.M., Principles and Practice of Management , Sultan Chand.
6. Jhunjhunwala J Mohanty, Management Principles and Applications , Himalaya Publishing
House.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


192
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P EL Credits Total Marks


S41BPB41 VENTURE CREATION
2 0 0 3 3 100

COURSE OBJECTIVES
To develop an entrepreneurial mindset, understand the concept of entrepreneurship and identify
personal strengths and weaknesses.
To understand the design thinking process and apply design thinking to real-world problems.
To identify problems and opportunities and develop ideas for new ventures by assessing market
potential.
To develop a value proposition, business model canvas, build MVP to create sustainable
differentiation for the venture with a well-structured business plan, unit economics, go-to-market
strategies and funding plan for managing business growth.
To build an idea pitch and deliver it with confidence to potential stakeholders.

UNIT 1 INTRODUCTION TO ENTREPRENEURSHIP 9 Hrs.


Defining Entrepreneurship - evolution the concept and Emerging Trends in entrepreneurship (Domain
specific) - Understanding the unique opportunities - Why be an entrepreneur? - Entrepreneurship in
Indian Scenario and its role in economic development - Success stories of entrepreneur (Domain
specific) -Entrepreneurial style assessment tool - Developing the entrepreneurial mindset - Attributes and
skills - Recognizing your sweet spot for starting up -Principles of effectuation - Myths about
entrepreneurship - Types of entrepreneurs - Entrepreneur vs Intrapreneur - Role of entrepreneurial
teams.

UNIT 2 DESIGN THINKING AND OPPORTUNITY DISCOVERY 9 Hrs.


Introduction to Design Thinking for startups - Design thinking principles and process - Define the problem
using design thinking principles and validate problem - Generation of ideas - Idea generation techniques
and evaluating creative ideas - Identify problem worth solving - Sharpen your problem pitch.

UNIT 3 CUSTOMER, MARKETS AND CREATING A SUSTAINABLE


DIFFERENTIATION 9 Hrs.
Differentiate between a customer and a consumer -Who is your customer and what is your segment -
Customer job, pains, and gains using value proposition - Canvas - Build solution using value proposition
canvas - Market estimation -TAM,SAM,SOM - Competitive analysis - Minimum viable product What is
MVP - Build - Measure - Learn, differentiate between solution demo and MVP - How to validate MVP-
Achieve a product Market fit.

UNIT 4 BUSINESS MODEL, BUSINESS PLANNING AND GO TO MARKET


STRATEGIES 9 Hrs.
Introduction to Business model - Business plan - Lean approach 9 block lean canvas model - Financial
feasibility: Costs, revenue streams - Pricing - Financial projections - Key financial metrics using financial
template - Managing growth and targeting scale - Unit economics - Selecting the right channel -
Introduction to digital marketing and tools -Branding strategy.

UNIT 5 FUNDING STRATEGY 9 Hrs.


Sources of funds: Debt and equity -Map the start-up lifecycle to funding options - Build an investor ready
pitch deck.
COURSE OUTCOMES

B.E/B.Tech REGULAR REGULATIONS 2023


193
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

On completion of the course, student will be able to


CO1 - Define entrepreneurship and explain emerging trends in entrepreneurship.
CO2 - Identify and evaluate business opportunities and assess market potential.
CO3 - Conduct customer discovery, market research, build a lean canvas, develop a business plan
and marketing strategies.
CO4 - Identify sources of funding and develop a funding strategy, understand basic legal requirement
for starting and running a business.
CO5 - Build an idea pitch and deliver it with confidence to various stakeholders.

TEXT / REFERENCE BOOKS


1. Hisrich, R. D., Peters, M. P., and Shepherd, D. A. Entrepreneurship McGraw-Hill
Education, 10th edition, 2017.
2. Ries, E. The Lean Startup: How Today's Entrepreneurs Use Continuous Innovation to Create
Radically Successful Businesses Crown Business, 2011.
3. Blank, S. G., and Dorf, B., The Startup Owner's Manual: The Step-by-Step Guide for Building
a Great Company KandS Ranch, 2012.
4. Roy, R., Indian Entrepreneurship: Theory and Practice New Delhi: Oxford University Press,
2017.
5. Chandan, J. S., and Rana, S. S., Entrepreneur New
Delhi: McGraw Hill Education, 2019.
6. Sinek, S., Start with Why: How Great Leaders Inspire Everyone to Take Action. Portfolio ,
2011.
7. Choudhary, R., and Mehta, N., From Zero to One: How to Build a Success
Notion Press, 2019.
8. Osterwalder, A., and Pigneur, Y., Business Model Generation: A Handbook for Visionaries,
Game Changers, and Challengers John Wiley and Sons, 2010.
9. Mitra, P., and Banerjee, A. Startup Minds: The Entrepreneur
SAGE Publications India, 2019.
10. Thiel, P. Zero to One: Notes on Startups, or How to Bui Crown Business, 2014.
11. Zappos, T., Delivering Happiness: A Path to Profits, Passion, and Purpose. Business Plus ,
2010.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


194
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

SOFTWARE PROJECT L T P EL Credits Total Marks


SCSB4006
MANAGEMENT 3 0 0 0 3 100

COURSE OBJECTIVES
To understand the fundamental principles of software project management.
To have a good knowledge of responsibilities of project manager.
To be familiar with the different methods and techniques used for project management

UNIT 1 INTRODUCTION TO SOFTWARE PROJECT MANAGEMENT 9 Hrs.


Introduction to Software Project Management - Activities covered by software project management
Plans - Methods and methodologies - Categorizing software projects - Project evaluation and programme
management - Project portfolio management - Evaluation of individual projects Cost benefit evaluation
techniques - Risk evaluation - Programme management - Managing the allocation of resources within
programme management - An overview of project planning.

UNIT 2 SELECTION OF APPROPRIATE PROJECT APPROACH, EFFORT


ESTIMATION 9 Hrs.
Selection of an appropriate project approach - Choosing methodologies and technologies - Software
processes and process models - Choice of process models - Structure versus speed of delivery -
Software effort estimation - Problems with over and under-estimates - Software effort estimation
techniques - Bottom-up estimation - Top-down approach and Parametric models - Expert judgment -
Estimating by analogy - COCOMO model - Cost estimation - Staffing pattern - Effect of schedule
compression.

UNIT 3 ACTIVITY PLANNING AND RISK MANAGEMENT 9 Hrs.


Activity planning - Project schedules - Projects and activities - Sequencing and scheduling activities -
Network Planning models - Risk management - Categories of risk - Risk Management approaches - A
Framework for dealing with risk - Risk identification - Risk assessment - Risk planning - Risk management
- risks and counter measures - Resource allocation - Nature of resources - Identifying
resource requirements - Scheduling resources - Creating critical paths - Counting the cost.

UNIT 4 MONITORING AND CONTROL 9 Hrs.


Monitoring and control - Creating the framework - Collecting the data - Review - Visualizing progress -
Cost monitoring - Earned value analysis - Prioritizing monitoring - Getting the project back to target -
Change control - Software configuration management - Managing contracts - Managing people in
software environment - Understanding behavior - Organizational behavior - Selecting the right person
for the job - Instruction in the best methods - Motivation - The Oldham Hackman job characteristics model
- Stress management.

UNIT 5 SOFTWARE QUALITY 9 Hrs.


Software quality - Importance of software quality - Defining software quality - Software quality models -
ISO 9126 - Product and process metrics - Product versus process quality management - Quality
Management Systems - Process capability models - Techniques to help enhance software quality -
Testing - Software reliability - Quality plans.

Max. 45 Hrs.

B.E/B.Tech REGULAR REGULATIONS 2023


195
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

COURSE OUTCOMES
On completion of the course, student will be able to
CO1 - Apply project management concepts and techniques to an IT project.
CO2 - Identify issues that could lead to IT project success or failure.
CO3 - Explain project management in terms of the software development process.
CO4 - Describe the responsibilities of IT project managers.
CO5 - Apply project management concepts through working in a group as team leader
CO6 - Be an active team member on an IT project.

TEXT / REFERENCE BOOKS


1. Bob Hughes, Mike Cotterell, Rajib Mall, Software Project Management , TMH Edition 6, 2018.
2. Walker Royce, Software Project Management , Pearson Edition, 2005.
3. Stellman and Greene, Applied Software Project Management 1st Edition, Kindle Edition.
4. Richard Thayer, Edward Yourdon, Software Engineering Project Management , WILEY.
5. Jack Marchewka, Information Technology Project Management providing measurable
organizational value , 5th Edition, Wiley, 2016.

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


196
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

L T P Credits Total Marks


SCSB1714 SMART PRODUCT DEVELOPMENT
3 0 0 3 100

COURSE OBJECTIVES
To introduce basic working principles of sensor devices.
To understand the different interface mediums for communication.
To impart knowledge on different automation systems.

UNIT 1 INTRODUCTION TO SENSOR DEVICES 9 Hrs.


Piezoresistive pressure sensor - Piezoresistive accelerometer - Capacitive sensing- Accelerometer and
microphone - Resonant Sensor and vibratory Gyroscope Low power, low voltage sensors - Micro
electro mechanical systems analysis and design of MEMS devices- Nano sensors.

UNIT 2 INTERFACING SENSOR INFORMATION AND MCU 9 Hrs.


Amplification and signal conditioning - Integrated signal conditioning - Digital conversion - MCU control
MCUs for sensor interface techniques and system considerations - Sensor integration.

UNIT 3 CONTROL TECHNIQUES AND STANDARDS 9 Hrs.


Control of sensors using State Machines - Fuzzy Logic - Neural Networks - Adaptive control.
Control application using - CISC, RISC, DSP control and IEEE 1451 standards.

UNIT 4 COMMUNICATION FOR SMART SENSORS 9 Hrs.


Wireless data communications - RF Sensing Telemetry - Automotive protocols - Industrial networks
home automation - MCU protocols

UNIT 5 SMART CITY CASE STUDY 9 Hrs.


Smart adaptive advertising - Customized digital experience - Disaster prevention - Smart agriculture -
Smart health - Smart security and surveillance - Smart virtual assistance Leadership and policy maker
- Challenges and solutions in building AI - IoT - Case study: IoT application for water and waste
management.

Max.45 Hrs.

COURSE OUTCOMES
On completion of the course, the student will be able to
CO1 - Identify the requirements of product design.
CO2 - Analyse the different designs.
CO3 - Develop different interfaces.
CO4 - Work in different communication medium.
CO5 - Understand the automation process.
CO6 - Develop applications using AI technique.

B.E/B.Tech REGULAR REGULATIONS 2023


197
SATHYABMA INSTITUTE OF SCIENCE AND TECHNOLOGY SCHOOL OF COMPUTING

TEXT / REFERENCE BOOKS


1. Adrian McEwen and Designing the Internet of Things , Wiley, 2014.
2. Smart Sensors for Industrial Applications (Devices, Circuits, and Systems)
CRC Press, 2017.
3. IOT Google, Amazon Alexa, Signal Jammer, ESP 8266 NodeMCU and
Location Tracker :New model technology development , 2019 .

END SEMESTER EXAM QUESTION PAPER PATTERN


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

B.E/B.Tech REGULAR REGULATIONS 2023


198

You might also like