22SBS308 PROBABILITY, RANDOM PROCESSES SEMESTER

AND QUEUEING THEORY III

(Common to CSE and IT)

PREREQUISITES CATEGORY L T P C
NIL BS 3 1 0 4

Course To enhance the fundamental knowledge in probability concepts and its applications
Objectives relevant to various streams of Engineering and Technology. This is a foundation course
which mainly deals with topic such as probability, standard statistical distributions,
statistical averages regarding one or more random variables, random process, Markov
chains and queueing models with finite/infinite capacity in single/multi servers and
plays an important role in the understanding of Science, Engineering and Computer
Science among other disciplines.
UNIT – I PROBABILITY AND RANDOM VARIABLES 9+3
Sample spaces–Events – Probability Axioms–Conditional Probability–Independent Events –
Baye’sTheorem. RandomVariables: Distribution Functions–Expectation–Moments–Moment Generating
Functions.
UNIT – II PROBABILITY DISTRIBUTIONS 9+3
Binomial, Poisson, Geometric, Uniform, Exponential, Normal, Gamma, Weibull (Mean, Variance and
Simple problems). Functions of random variables.
UNIT – III MULTI DIMENSIONAL RANDOM VARIABLES 9+3
Two dimensional: Joint distributions – Marginal Distributions – Conditional distributions – Covariance
– Correlation and Regression lines.
Multidimensional: Mean vectors and covariance matrices.
UNIT – IV RANDOM PROCESSES 9+3
Definition and Examples – first and Second order, Strict sense stationary, Wide sense stationary and
ergodic processes- Markov processes – Poisson processes – Birth and Death processes – Markov chains
– Transition probabilities – Limiting distributions.
UNIT – V QUEUEING THEORY 9+3
Markovian models-M/M/1 and M/M/C, finite and infinite capacity, M/G/1 queue (steady state solutions
only) PollazackKhintchine formula-Problems only.
Contact Periods:
Lecture: 45 Periods Tutorial: 15 Periods Practical: 0 Periods Total: 60 Periods

TEXT BOOK :
1 Veerarajan T., Probability and Random Processes, with Queueing Theory and Queueing
Networks), Fourth Edition, McGraw Hill Education (India) Pvt Ltd, New Delhi, 2016.
2 Veerarajan T., Higher Engineering Mathematics, McGraw Hill Education (India) Pvt Ltd, New
Delhi, 2016.

REFERENCES:
1 Gupta S.C and Kapoor V.K.., Fundamentals of Mathematical Statistics, Sultan Chand & Sons, New
Delhi, 2015.
2 Gupta S.P., Statistical methods, Sultan Chand & Sons, New Delhi, 2015.
3 Trivedi K.S., Probability and Statistics with Reliability, Queueing and Computer Science
Applications, Prentice Hall of India, New Delhi.
4 Hwei Hsu., SchauPm’s outline series of Theory and Problems of Probability and Random Process,
Tata McGraw Hill Publishing Co., New Delhi, 2015.
5 Kandasamy, Thilagavathy and Gunavathy, , Probability and Random Process, S. Chand & Co.
Ramnagar, New Delhi , Reprint 2013.
6 Richard A. Johnson and Dean W. Wichern., AppliedMultivariate Statistical Analysis, Sixth Edition,
Pearson Education, Asia, 2012.
 COURSE OUTCOMES: Bloom’s
Taxonomy
On completion of the course, the students will be able to: Mapped
CO1 Apply the knowledge of basic probability concepts in engineering problems.
K5
CO2 Identify various standardprobability distributions and apply them in real
K5
life.
CO3 Find the correlation and regressionformulti dimensional random variables. K5
CO4 Apply the random process in Markovian and Birth- deathproblems. K5
CO5 Utilize queuing models in real life problems. K5

COURSE ARTICULATION MATRIX:

a) CO and PO Mapping (Times New Roman, Size 11 )
COs/P PO PO PO PO PO PO PO PO PO9 PO PO PO PS PS PS
Os 1 2 3 4 5 6 7 8 10 11 12 O1 O2 O3
CO1 3 3 2 2 2
CO2 3 3 2 2 2
CO3 3 3 2 2 2
CO4 3 3 2 2 2
CO5 3 3 2 2 2
3 3 2 2 2
22SBS308

1 – Slight, 2 – Moderate, 3 – Substantial

b) CO and Key Performance Indicators Mapping (Times New Roman, Size 11 )
CO1 1.1.1,1.1.2,1.2.1,1.3.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.2, 2.2.3, 2.3.1, 2.3.2, 2.4.1, 3.1.1, 3.1.5, 3.2.3, 3.3.1,
3.4.1, 4.1.1, 4.1.2, 4.2.1, 4.2.2, 12.1.2 , 12.2.1, 12.2.2
CO2 1.1.1, 1.1.2, 1.2.1, 1.3.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.2, 2.2.3, 2.3.1, 2.3.2, 2.4.1, 3.1.1, 3.1.5, 3.2.3, 3.3.1,
3.4.1, 4.1.1, 4.1.2, 4.2.1, 4.2.2, 12.1.2 , 12.2.1, 12.2.2
CO3 1.1.1, 1.1.2, 1.2.1, 1.3.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.2, 2.2.3, 2.3.1, 2.3.2, 2.4.1, 3.1.1, 3.1.5, 3.2.3, 3.3.1,
3.4.1, 4.1.1, 4.1.2, 4.2.1, 4.2.2, 12.1.2 , 12.2.1, 12.2.2
CO4 1.1.1, 1.1.2, 1.2.1, 1.3.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.2, 2.2.3, 2.3.1, 2.3.2, 2.4.1, 3.1.1, 3.1.5, 3.2.3, 3.3.1,
3.4.1, 4.1.1, 4.1.2, 4.2.1, 4.2.2, 12.1.2 , 12.2.1, 12.2.2
CO5 1.1.1, 1.1.2, 1.2.1, 1.3.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.2, 2.2.3, 2.3.1, 2.3.2, 2.4.1, 3.1.1, 3.1.5, 3.2.3, 3.3.1,
3.4.1, 4.1.1, 4.1.2, 4.2.1, 4.2.2, 12.1.2 , 12.2.1, 12.2.2

ASSESSMENT PATTERN – THEORY (Times New Roman, Size 11)

Test / Bloom’s Remembering Understand Applying Analyzing Evaluating Creating Total %
Category* (K1) % ing(K2) (K3) % (K4) % (K5) % (K6) %
%
CAT1 20 40 20 10 10 100
CAT2 20 40 20 10 10 100
Individual 20 40 20 10 10 100
Assessment 1
/Case Study 1/
Seminar 1 /
Project1
Individual 20 40 20 10 10 100
Assessment 2
/Case Study 2/
Seminar 2 /
Project 2
ESE 20 40 20 10 10 100
 SEMESTER
22SES306 DIGITAL SYSTEMS III

PREREQUISITES CATEGORY L T P C
NIL ES 3 0 0 3

Course The objective of the course is to learn the basic concepts of digital systems
Objectives components, to design combinational logic circuits and sequential logic circuits.
UNIT – I INTRODUCTION TO NUMBER SYSTEMS AND CODES 9
Binary Number Systems-Signed Binary Numbers-Binary Arithmetic-1’s and 2’s Complement- Binary
codes: BCD, Gray code, Excess 3 code, ASCII code -Introduction To Boolean Algebra -
Minimization Of Boolean Function Using Karnaugh Map-SOP-POS-Quine Mclusky Methods - Code
Conversion - Binary Code to Gray Code And Gray to Binary-BCD to Excess-3 and Excess 3 to BCD
Code
UNIT – II COMBINATIONAL LOGIC CIRCUITS 9
Introduction to combinational logic- Design procedure - Multiplexer/Demultiplexer -Decoders-
Encoders - Priority Encoders- Implementation of Combinational Logic Circuits using Multiplexer and
Decoder -Design of Integer Arithmetic Circuits Using Combinational Logic: Integer Adder - Ripple
Carry Adder And Carry Lookahead Adder-Integer Subtraction Using Adders - Design of
Combinational Circuits Using Programmable Logic Devices(PLDS):Programmable Read Only
Memories(PROM)-Programmable Logic Arrays(PLA)-Programmable Array Logic(PAL) Devices.
UNIT – III SEQUENTIAL CIRCUITS 9
Latches:RS Latch And JK Latch-Flipflops-RS,JK,T And D Flipflops-Master-Slave Flipflops-Edge
Triggered Flipflops-Analysis And Design of Synchronous Sequential Circuits: Introduction To
Sequential Circuits - Characteristics Table-Characteristic Equations And Excitation Table
UNIT – IV MODULAR SEQUENTIAL LOGIC CIRCUITS 9
Registers-Register with parallel load -Overview of Shift Register - Counters- Ripple counter -
Synchronous/Asynchronous counters-Up-Down counters, Ring counter-Johnson Counters
UNIT – V ALGORITHMS STATE MACHINES AND MEMORIES 9
RTL Notations - ASM Charts-Notations- VHDL : Introduction to HDL-VHDL-Library-Introduction
to memories - Read,Write Cycles - Random Access Memory- TTL RAM Cell - ROMs-EPROM -
MOS Static RAM Cell-Dynamic RAM Cell-Refreshing Memory Cycle.
Contact Periods:
Lecture: 45 Periods Tutorial: 0 Periods Practical: 0 Periods Total: 45 Periods

TEXT BOOK :
1 M. Morris Mano, Michael D. Ciletti “Digital Design” 5thedition,Pearson Education, 2013

REFERENCES:
1 A P Malvino,D P Leach And Gountansala “Digital Principles And Applications” 7th Edition,
Tata Mc Graw Hill, 2010
2 Stephen Brown,Zvonko Vranesic, “Fundamentals Of Digital Logic Design With VHDL”, 3rd
Edition, Tata Mc Graw Hill, 2008.
3 Mark K Bach, “Complete Digital Design”, Tata Mc Graw Hill, 2003
4 Wakerly Pearson, “Digital Design:Principles And Practices”, 4th Edition, Pearson Education,
2008
 COURSE OUTCOMES: Bloom’s
Taxonomy
On completion of the course, the students will be able to: Mapped
CO1 Apply knowledge of number systems and codes in problem solving related K3
to code conversion and number system.
CO2 Analyze and design combinational logic devices using logic gates. K4
CO3 Analyze and design sequential logic devices using flip flops. K4
CO4 Explain fundamentals of different types of memories. K2
CO5 Simulate of digital circuits using VHDL K6

COURSE ARTICULATION MATRIX:

a) CO and PO Mapping (Times New Roman, Size 11 )
COs/P PO PO PO PO PO PO PO PO PO9 PO PO PO PS PS PS
Os 1 2 3 4 5 6 7 8 10 11 12 O1 O2 O3
CO1 2 3 3 1 1 3 3
CO2 2 3 3 1 1 3 3
CO3 2 3 3 1 1 3 3
CO4 2 1 2 1 1 3 3
CO5 2 3 3 1 3 1 3 3
22SES3 2 3 3 1 1 1 3 3
06
1 – Slight, 2 – Moderate, 3 – Substantial
b) CO and Key Performance Indicators Mapping (Times New Roman, Size 11 )
CO1 1.2.1, 1.3.1, 1.4.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.3, 2.2.4, 2.3.1, 2.3.2, 2.4.1, 2.4.2, 2.4.3, 2.4.4 , 3.1.1, 3.1.2,
3.1.6, 3.2.1, 3.2.3, 3.3.1, 3.3.2, 3.4.1, 3.4.2, 4.3.1, 10.1.1
CO2 1.2.1, 1.3.1, 1.4.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.3, 2.2.4, 2.3.1, 2.3.2, 2.4.1, 2.4.2, 2.4.3, 2.4.4 , 3.1.1, 3.1.2,
3.1.6, 3.2.1, 3.2.3, 3.3.1, 3.3.2, 3.4.1, 3.4.2, 4.3.1, 10.1.2
CO3 1.2.1, 1.3.1, 1.4.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.3, 2.2.4, 2.3.1, 2.3.2, 2.4.1, 2.4.2, 2.4.3, 2.4.4 , 3.1.1, 3.1.2,
3.1.6, 3.2.1, 3.2.3, 3.3.1, 3.3.2, 3.4.1, 3.4.2, 4.3.1, 10.1.3
CO4 1.2.1, 1.3.1, 1.4.1, 2.1.1, 2.1.2, 3.1.2, 3.1.3, 3.1.4, 3.1.5, 3.2.2, 4.1.1, 4.1.2, 10.1.3
CO5 1.2.1, 1.3.1, 1.4.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.3, 2.2.4, 2.3.1, 2.3.2, 2.4.1, 2.4.2, 2.4.3, 2.4.4 , 3.1.1, 3.1.2,
3.1.6, 3.2.1, 3.2.3, 3.3.1, 3.3.2, 3.4.1, 3.4.2, 4.3.1, 5.1.1, 5.1.2, 5.2.1, 5.2.2, 5.3.1, 5.3.2, 10.1.1

ASSESSMENT PATTERN – THEORY (Times New Roman, Size 11)

Test / Bloom’s Rememberi Understanding Applying Analyzing Evaluating Creating Tota
Category* ng (K1) % (K2) % (K3) % (K4) % (K5) % (K6) % l%
CAT1 30 30 20 20 100
CAT2 30 30 20 10 10 100
Individual 50 50 100
Assessment 1
/Case Study 1/
Seminar 1 /
Project1
Individual 10 40 50 100
Assessment 2
/Case Study 2/
Seminar 2 /
Project 2
ESE 20 30 30 10 10 100
 22SES307 DISCRETE STRUCTURES SEMESTER
III

PREREQUISITES CATEGORY L T P C
NIL ES 3 0 0 3

Course The objective of the course is to equip students with the necessary skills to apply
Objectives propositional and predicate calculus to evaluate the truth value of statements, use
counting techniques to develop an understanding of relations, apply algebraic structures
and morphisms to solve related problems, analyze graphs, and understand the patterns
and laws of graph mining.
UNIT – I PROPOSITIONAL AND PREDICATE CALCULUS 9
Proposition: Logical connectives and its truth tables – Conditional and Biconditionals – Applications of
Propositions: Boolean Searches, Logic Puzzles – Logical Equivalences and Implications – Theory of
inference for statement calculus.
Predicate Calculus: Quantifiers – Formulas – Free & Bound variable – Inference theory of predicate
calculus.
UNIT – II COUNTING, RELATIONS AND FUNCTIONS 9
Counting: The Basics of Counting – The Pigeonhole Principle – Permutation and Combinations.
Relations: Graph and Matrix representation of a relation – Properties of Binary Relation – Closure of
relation – Warshall’s algorithm – Equivalence Relation and Partitions – Partial Ordering Relations and
Lattices.
Functions: Mathematical Induction - Types and Composition of Functions - Inverse Function.
UNIT – III ALGEBRAIC STRUCTURES AND MORPHISM 9
Groups: Subgroups – Generators and Evaluation of Powers – Cosets and Lagrange’s Theorem –
Permutation groups and Burnside Theorem – Codes and Group Codes.
Morphism: Isomorphism and Automorphism, Homomorphism and Normal Subgroups – Rings, Integral
domains and Fields.
UNIT – IV GRAPH THEORY 9
Introduction - Basic Terminology – Multigraphs and Weighted graphs - Digraphs and relations
representation of graphs - operations on graphs - Paths and Circuits - Graph traversals - shortest paths in
weighted graphs - Euclidian paths and circuits - Hamiltonian Paths and Circuits - The Traveling
Salesperson Problem - Planar Graphs - Graph Coloring – Case Study.
UNIT – V GRAPH MINING LAWS 9
Patterns in Static Graph –Patterns in Evolving Graph – Patterns in Weighted Graph – Structure of Specific
Graph : The Internet – The World Wide Web – Graph Generators : Random Graph Models – Generators
for Internet Topology.
Contact Periods:
Lecture: 45 Periods Tutorial: 0 Periods Practical: 0 Periods Total: 45 Periods

TEXT BOOK
1 C.L. Liu, D.P. Mohapatra “Elements of Discrete Mathematics: A Computer Oriented Approach”,
Third Edition Tata MCgraw Hill, (SIE), 2012.[Unit 1 – 4]
 2 Deepayan Chakrabarti, Christos Faloutsos “Graph Mining: Laws, Tools, and Case Studies”
Margon & Claypool publishers 2012.[Unit 5]

REFERENCES
1 Kenneth H Rosen, Discrete Mathematics and its Applications with Combinatorics and Graph
Theory, Seventh Edition, MCgraw Hill Education India Private Limited, New Delhi, 2013.
2 Krishnaiyan Thulasiraman, Subramanian Arumugam, Andreas Brandstädt, Takao Nishizeki,
“Handbook of Graph Theory, Combinatorial Optimization, and Algorithms”, CRC press,2016.
3 William Kocay, Donald L. Kreher “Graphs, Algorithms, and Optimization”, Second Edition, CRC
Press, 2017.
4 J.P. Tremblay and R. Manohar, “Discrete Mathematical Structure and Its Application to
Computer Science”, TMG Edition, Tata Mcgraw-Hill, 2015.

COURSE OUTCOMES: Bloom’s

Taxonomy
On completion of the course, the students will be able to: Mapped
CO1 Demonstrate the ability to use propositional and predicate calculus to K5
evaluate the truth value of statements and solve logic problems.
CO2 Apply counting techniques and develop an understanding of K3
relations and their properties, and use graph and matrix representation to
solve problems.
CO3 Demonstrate the ability to apply algebraic structures and morphism K3
to solve problems related to groups, subgroups, rings, and fields.
CO4 Analyze graphs and solve problems related to shortest path,Hamiltonian Paths K4
, and graph coloring
CO5 Use graph mining as a powerful pattern tool by understanding their K3
laws to derive valuable information.

COURSE ARTICULATION MATRIX:

a) CO and PO Mapping
COs/POs PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 2 1 2 3 3
CO2 3 2 1 2 3 3
CO3 3 2 1 2 3 3
CO4 3 2 2 1 2 3 3 3
CO5 3 3 3 1 1 2 3 3 3
22SES30 3 2 1 1 1 2 3 3 3
7
1 – Slight, 2 – Moderate, 3 – Substantial
b) CO and Key Performance Indicators Mapping
CO1 1.1.1, 1.1.2, 1.2.1, 1.3.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.2, 2.2.3, 2.2.4, 4.1.1, 12.1.1, 12.2.2, 12.3.2
CO2 1.1.1, 1.1.2, 1.2.1, 1.3.1, 2.1.1, 2.1.2, 2.1.3, 2.3.1, 2.3.2, 2.4.1, 4.3.3, 4.3.4, 12.1.1, 12.2.2, 12.3.2
CO3 1.1.1, 1.1.2, 1.3.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.3, 2.3.2, 2.4.3, 2.4.4, 4.1.1, 4.3.3, 12.1.1, 12.2.2, 12.3.2
CO4 1.1.1, 1.1.2, 1.3.1, 1.4.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.2, 2.3.1, 2.4.3, 2.4.4, 4.1.1, 4.3.3, 4.3.4, 5.1.2, 12.1.1,
12.2.2, 12.3.2
CO5 1.1.1, 1.1.2, 10.2.1, 1.3.1, 1.4.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.2, 2.2.3, 2.2.4, 2.3.1, 2.3.2, 2.4.1, 2.4.2, 2.4.3,
2.4.4, 4.1.1, 4.1.2, 4.1.3, 4.1.4, 4.2.1, 4.3.2, 4.3.3, 4.3.4, 5.1.2, 5.2.2, 8.2.2, 12.1.1, 12.1.2, 12.2.2, 12.3.2
ASSESSMENT PATTERN – THEORY
Test / Bloom’s Remembering Understanding Applying Analyzing Evaluatin Creatin Tota
Category* (K1) % (K2) % (K3) % (K4) % g (K5) g (K6) l
% % 100
%
CAT1 10 20 50 20 100
CAT2 20 60 20 100
Individual Assessment 1 30 40 30 100
/Case Study 1/ Seminar 1
/ Project1
Individual Assessment 2 30 30 40 100
/Case Study 2/ Seminar 2
/ Project 2
ESE 10 20 40 20 10 100
 22SPC301 DATA STRUCTURES SEMESTER
(Common to EEE,ECE and CSE ) III
PREREQUISITES CATEGORY L T P C
22SES101 PROGRAMMING IN C PC 3 0 0 3

Course Objectives The objective of the course is to enable the students to analyze the time
complexity of an algorithm, Understand and Use List, Stack, Queue, Tree
and graph Data structures and effectively use sorting and searching
Techniques.
UNIT – I INTRODUCTION AND ABSTRCT DATATYPES 9

Algorithm Analysis: Calculation of Running Time – Abstract Data Type- List ADT: Array
implementation of List, Linked Lists, Doubly Linked List, Circularly Linked Lists- Cursor
implementation of Linked List
UNIT – II STACK AND QUEUE ADT 9
Stack ADT: Stack Model, Implementation of stacks, Applications: Balancing Symbols, Postfix
expression evaluation, Infix to postfix conversion, Function Calls – Queue ADT:
Queue Model, Implementation of Queues, Applications.
UNIT – III TREE ADT 9
Preliminaries – Implementation of Trees – Tree Traversals – Binary Tree: Implementation,
Expression Tree – Search Tree ADT – AVL Trees - BTrees – Red Black Trees.
UNIT – IV GRAPH ALGORITHMS 9
Definitions – Representation of Graphs – Traversal- Topological sort – Shortest Path
Algorithms: Dijkstra’s Algorithm – Network Flow Problem – Minimum Spanning Tree: Prim’s
and Kruskal’s algorithm.
UNIT – V SORTING AND SEARCHING 9
Sorting: Insertion Sort – Shell Sort – Heap Sort – Merge Sort – Quick Sort – Bucket Sort – External
Sorting: Simple Algorithm, Multi way merge, Poly Phase Merge – Searching : Linear Search –
Binary Search – Hashing : Hash Functions– Collision Resolution: Separate Chaining – Open
Addressing – Linear Probing– Quadratic Probing – Double Hashing –
Rehashing.
Contact Periods:
Lecture: 45 Period Tutorial:0 Periods Practical: 0 Periods Total: 45 Periods

TEXT BOOK
1 Mark Allen Weiss “Data Structures and Algorithm Analysis in C” Second Edition, Pearson
Education Limited, 2002.

REFERENCES
1 Thomas H. Cormen , Charles E. Leiseron, Ronald L.Rivest, Clifford Stein, “Introduction to
Algorithms”, Third Edition, PHI learning Pvt. Ltd., 2011.
2 Sartaj Sahni, “Data Structures, Algorithms and applications in C++”, Second Edition,
Universities Press, 2005.
 COURSE OUTCOMES: Bloom’s
Taxonomy
On completion of the course, the students will be able to: Mapped
CO1 Analyze the time complexity of various algorithms K4
CO2 Define and use list, stack and queue Data Structures K3
CO3 Define and use Tree Data Structure K3
CO4 Define and use Graph Data Structure K4
CO5 Use appropriate sorting and searching Techniques K4

COURSE ARTICULATION MATRIX:

a) CO and PO Mapping
COs PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 1 2 1 1 3 3 2
CO2 2 2 2 2 2 2 1 1 3 3 2
CO3 2 2 2 2 2 2 1 1 3 3 2
CO4 2 2 2 2 2 2 1 1 3 3 2
CO5 2 2 1 1 1 3 3 2
22SPC 2 2 2 2 2 2 1 1 3 3 2
301
1 – Slight, 2 – Moderate, 3 – Substantial
b) CO and Key Performance Indicators Mapping
CO1 1.1.1,1.3.1, 1.4.1,2.1.2, 2.2.2, 2.3.1,2.4.1,3.1.6,3.2.2,3.2.3,3.3.1,3.3.2,3.4.1,4.2.2,4.3.1,12.2.2.
1.3.1,1.4.1,2.1.1,2.1.2,2.2.2,2.2.3,2.4.2,2.4.4,3.1.1.,3.1.3,3.1.6,3.2.3,3.3.1,3.4.1,4.1.2,4.1.3,4.2
CO2
.2, 4.3.4,5.1.2,5.2.2,5.3.2,6.1.1,7.2.2,10.2.2,11.3.1,12.1.1,12.2.2,12.3.2
CO3 1.3.1,1.4.1,2.1.1,2.1.2,2.2.2,2.2.3,2.4.2,2.4.4,3.1.1.,3.1.3,3.1.6,3.2.3,3.3.1,3.4.1,4.1.2,4.1.3,4.2
.2, 4.3.4,5.1.2,5.2.2,5.3.2,6.1.1,7.2.2,10.2.2,11.3.1,12.1.1,12.2.2,12.3.2
CO4 1.3.1,1.4.1,2.1.1,2.1.2,2.2.2,2.2.3,2.4.2,2.4.4,3.1.1.,3.1.3,3.1.6,3.2.3,3.3.1,3.4.1,4.1.2,4.1.3,4.2
.2, 4.3.4,5.1.2,5.2.2,5.3.2,6.1.1,7.2.2,10.2.2,11.3.1,12.1.1,12.2.2,12.3.2
CO5 1.3.1,1.4.1,2.1.2.2.1,2.2.3,2.3.1,2.4.4,3.1.3,3.1.6, 3 .2.3, 3.3.2, 4.1.2, 4.2.1,4.3.1,6.1.1, 10.3.1,
11.2.1, 12.1.1,12.2.2,12.3.2

ASSESSMENT PATTERN – THEORY

Test / Bloom’s Remembering Understanding Applyin Analyzing Evaluating Creatin Tota
Category* (K1) % (K2) % g (K3) (K4) % (K5) % g (K6) l
% % %
CAT1 20 30 50 100
CAT2 10 80 10 100
Individual
Assessment 1
/Case Study 1/ 80 20 100
Seminar 1 /
Project1
Individual
Assessment 2
/Case Study 2/ 80 20 100
Seminar 2 /
Project 2
ESE 30 50 20 100
 22SPC302 FOUNDATIONS OF DATA SCIENCE SEMESTER
III
(Common to CSE and IT)

PREREQUISITES CATEGORY L T P C
NIL PC 3 0 0 3

Course This course will introduce the fundamental concepts in the field of data
Objectives science required for solving data science problems
UNIT – I R FOR DATASCIENCE 9
Reading and getting data into R – ordered and unordered factors – arrays and matrices – lists and data
frames – reading data from files – probability distributions and statistical models in R - Introduction to
graphical analysis –plots – displaying multivariate data – matrix plots – multiple plots in one window -
exporting graph using graphics parameters.
UNIT – II INTRODUCTION TO DATA SCIENCE AND DESCRIBING 9
DATA
Data Science Process: Roles and stages. Basic Statistical descriptions 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
UNIT – III DESCRIBING RELATIONSHIPS 9
Correlation –correlation coefficient for quantitative data –computational formula for correlation
coefficient – Populations, Samples and Probability – Sampling distribution of the mean
UNIT – IV GENERALIZING BEYOND DATA 9
Hypothesis testing: z-test, Null Hypothesis and Alternate Hypothesis, One tailed and Two Tailed Tests,
Estimation of Confidence Interval
UNIT – V MODELING METHODS 9
Choosing and evaluating models -Linear and logistic regression: Building a model, Making Predictions,
Reading Model summary and characterizing co-efficient quality unsupervised methods: Cluster
Analysis
Contact Periods:
Lecture: 45 Periods Tutorial: 0 Periods Practical: 0 Periods Total: 45 Periods
 TEXT BOOK:

1 Nina Zumel, John Mount, “Practical Data Science with R”, Manning Publications, 2014. (Unit I and
V)
2 Robert S. Witte and John S. Witte, “Statistics”, Eleventh Edition, Wiley Publications, 2017. (Units
II, III and IV)

REFERENCES
1 W. N. Venables, D. M. Smith and the R Core Team, “An Introduction to R”, 2013.
2 Mark Gardener, “Beginning R - The Statistical Programming Language”, John Wiley & Sons, Inc.,
2012.
3 Tony Ojeda, Sean Patrick Murphy, Benjamin Bengfort, Abhijit Dasgupta, “Practical Data Science
Cookbook”, Packt Publishing Ltd., 2014
4 Montgomery, D. C. and G. C. Runger. Applied Statistics and Probability for Engineers. 5th Edition.
John Wiley & Sons, Inc., NY, USA, 2011

COURSE OUTCOMES: Bloom’s

On completion of the course, the students will be able to: Taxonomy
Mapped
CO1 Use R Libraries for Data Wrangling K3
CO2 Define the data science process K1

CO3 Analyze and interpret data using an ethically responsible approach. K4

CO4 Apply hypotheses and data into actionable predictions K3
CO5 Formulate and use appropriate models of data analysis to solve K4
problems
COURSE ARTICULATION MATRIX:
a) CO and PO Mapping
COs/ PO PO PO PO4 PO PO PO PO PO PO PO PO PSO PSO PSO
POs 1 2 3 5 6 7 8 9 10 11 12 1 2 3
CO1 1 1 2 1 3 1 2 2 2
CO2 1 1 1 1 2 2 2
CO3 3 3 3 3 3 3 3 2 2 2
CO4 3 3 3 3 2 2 2
CO5 3 3 3 3 1 2 2 2
22SP 3 3 3 3 2 1 1 1 1 2 2 2
C302
1 – Slight, 2 – Moderate, 3 – Substantial
b) CO and Key Performance Indicators Mapping
ASSESSMENT PATTERN – THEORY
Test / Remembering Understanding Applying Analyzing Evaluating Creating Total
Bloom’s (K1) % (K2) % (K3) % (K4) % (K5) % (K6) % %
Category*
CAT1 30 30 40 100
CAT2 30 30 40 100
Individual 30 20 40 5 5 100
Assessment
1 /Case
Study 1/
Seminar 1 /
Project1
Individual 30 20 30 10 5 5 100
Assessment
2 /Case
Study 2/
Seminar 2 /
Project 2
ESE 30 30 40 100
 OBJECT ORIENTED PROGRAMMING SEMESTER
22SPC303 (Common to CSE and IT) III

PREREQUISITES CATEGORY L T P C
NIL PC 3 0 2 4

Course The objective of the course is to create an understand on object oriented programming
Objectives concepts using Java programming language and to familiarize students with GUI
based application development and server side
programming.
UNIT – I INTRODUCTION TO OOP AND JAVA 9+6
Overview of OOP – Object oriented programming paradigms – Features of Object Oriented
Programming – Java Buzzwords – Overview of Java – Java Virtual Machine - Data Types, Variables
and Arrays – Operators – Control Statements – Programming Structures in Java –
Defining classes in Java – Constructors-Methods -Access specifiers - Static members- Java Doc
comments – Inheritance –Packages –interfaces
UNIT – II EXCEPTION HANDLING AND MULTITHREADING 9+6
Exception Handling basics – Multiple catch Clauses – Nested try Statements – Java’s Built-in
Exceptions – User defined Exception. Multithreaded Programming: Java Thread Model– Creating a
Thread and Multiple Threads – Priorities – Synchronization – Inter Thread Communication
Suspending –Resuming, and Stopping Threads –Multithreading. Wrappers –
Auto boxing
UNIT – III STRINGS ,STREAMS AND OBJECT SERIALIZATION 9+6
Strings: Basic String class, methods and String Buffer Class. I/O Basics – Working with files - Object
Streams and Serialization - Lambda expressions, Collection framework List, Map, Set, Generics
Annotations
UNIT – IV GUI AND DATABASE PROGRAMMING 9+6
Introducing swing – components and containers – swing controls and swing menus. Design of
JDBC – JDBC configuration – executing SQL statements – Query Execution – scrollable and
updatable result set – transactions - Connection Management in Web and Enterprise
Applications.
UNIT – V NETWORKING AND SERVER SIDE PROGRAMMING 9+6
Networking basics – Inent address –TCP/IP sockets – datagrams – introducing java.net.http
Introduction to servlet - servlet life cycle - Developing and Deploying Servlets - Exploring
Deployment Descriptor (web.xml) - Handling Request and Response – using Cookies -
Session Tracking Management.
Contact Periods:60
Lecture: 45 Periods Tutorial: 0 Periods Practical: 15 Periods Total: 60 Periods

List of Experiments
Program to demonstrate concepts like abstraction, encapsulation, inheritance, polyporphism
and packages.
Program to demonstrate the use of inbuilt and custom generated Java Exception handling
Methods
Program to demonstrate creation of thread and inter thread communication.
Program to demonstrate the application of String handling functions
Program to demonstrate the use of File handling methods
Program to demonstrate the need for object serialization and deserialization
Demonstrate the use of Java collection frameworks in reducing application development time
Build a simple GUI application using swing
Develop simple student management system using JDBC with MySQL Database
Develop simple multiuser chat application
Develop simple banking application using servlets.

TEXT BOOK
1 Herbert Schildt, “Java: The Complete Reference”, 11 th Edition, McGraw Hill
Education, New Delhi, 2019(Unit I,II,III,IV,V)
2 Cay S. Horstmann, “Core Java Fundamentals”, Volume 2, 9 th Edition, Prentice Hall,
2013.(unit III, IV)

REFERENCES
1 Cay S. Horstmann, “Core Java Fundamentals”, Volume 1, 12 th Edition, Prentice Hall,
2018.
2 Y. Daniel Liang, “Introduction to Java programming-comprehensive version”-Tenth
Edition, Pearson ltd 2015
3 Paul J. Deitel, Harvey Deitel, “Java SE8 for Programmers (Deitel Developer Series)” 3rd
Edition, 2014
4 NPTEL Course : Programming in Java, https://nptel.ac.in/courses/106105191
5 Nicholas S. Williams, “Professional Java for Web Applications”, Wrox Press, 2014.

COURSE OUTCOMES: Bloom’s

On completion of the course, the students will be able to: Taxonomy
Mapped
CO1 Apply object oriented concepts like classes , abstraction, K3
encapsulation
inheritance, interface , polymorphism and packages to solve simple
problems
CO2 Make use of exception handling mechanisms and multithreaded K3
model to solve real world problems
CO3 Build Java applications with I/O packages, files , string classes, K6
Collections and generics concept
CO4 Design and implement GUI based applications using swing and K6
applications involving Database Connectivity for real world
problems
CO5 Design, Develop and Deploy dynamic web applications using K6
Servlets and Java Server Pages
 COURSE ARTICULATION MATRIX:

a) CO and PO Mapping
COs/PO PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
s 1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3
CO1 2 3 2 3 2 3 2 2 2
CO2 2 3 2 3 2 0 2 2 2
CO3 2 3 2 3 2 0 2 2 2
CO4 2 3 2 3 2 2 3 2 2 3
CO5 2 3 2 3 2 1 2 3 2 2 3
22SPC3 2 3 2 3 1 2 2 2 2 3
03
1 – Slight, 2 – Moderate, 3 – Substantial
b) CO and Key Performance Indicators Mapping
CO1 1.3.1,1.4.1, 2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.2.4,2.3.1,2.3.2,2.4.1,2.4.2,2.4.3,2.4.4, 3.1.3,
3.1.6, 3.2.1, 3.2.2,3.2.3,3.3.1,3.4.1,3.4.2, 4.1.1,4.1.2,4.1.3,4.1.4,4.2.1,4.2.2,4.3.1,4.3.2,4.3.4,
10.1.1,10.1.2,10.1.3, 12.1.1,12.1.2,12.2.1,12.2.2,12.3.1
CO2 1.3.1,1.4.1, 2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.2.4,2.3.1,2.3.2,2.4.1,2.4.2,2.4.3,2.4.4, 3.1.3,
3.1.6, 3.2.1, 3.2.2,3.2.3,3.3.1,3.4.1,3.4.2, 4.1.1,4.1.2,4.1.3,4.1.4,4.2.1,4.2.2,4.3.1,4.3.2,4.3.4,
10.1.1,10.1.2,10.1.3
CO3 1.3.1,1.4.1, 2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.2.4,2.3.1,2.3.2,2.4.1,2.4.2,2.4.3,2.4.4, 3.1.3,
3.1.6, 3.2.1, 3.2.2,3.2.3,3.3.1,3.4.1,3.4.2, 4.1.1,4.1.2,4.1.3,4.1.4,4.2.1,4.2.2,4.3.1,4.3.2,4.3.4,
10.1.1,10.1.2,10.1.3
CO4 1.3.1,1.4.1, 2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.2.4,2.3.1,2.3.2,2.4.1,2.4.2,2.4.3,2.4.4, 3.1.3,
3.1.6, 3.2.1, 3.2.2,3.2.3,3.3.1,3.4.1,3.4.2, 4.1.1,4.1.2,4.1.3,4.1.4,4.2.1,4.2.2,4.3.1,4.3.2,4.3.4,
5.1.1,5.1.2,5.2.1,5.2.2, 10.1.1,10.1.2,10.1.3, 12.1.1,12.1.2,12.2.1,12.2.2,12.3.1
CO5 1.3.1,1.4.1, 2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.2.4,2.3.1,2.3.2,2.4.1,2.4.2,2.4.3,2.4.4, 3.1.3,
3.1.6, 3.2.1, 3.2.2,3.2.3,3.3.1,3.4.1,3.4.2, 4.1.1,4.1.2,4.1.3,4.1.4,4.2.1,4.2.2,4.3.1,4.3.2,4.3.4,
5.1.1,5.1.2,5.2.1,5.2.2, 10.1.1,10.1.2,10.1.3, 12.1.1,12.1.2,12.2.1,12.2.2,12.3.1

ASSESSMENT PATTERN – THEORY

Test / Remembe Understandi Applyin Analyzin Evaluatin Creati Total
Bloom’s ring (K1) ng (K2) % g (K3) g (K4) % g (K5) % ng (K6) %
Category* % % %
CAT1 20 40 20 20 100
CAT2 30 70 100
Individual 50 50 100
Assessment 1
/Case Study 1/
Seminar 1 /
Project1
Individual 100 100
Assessment 2
/Case Study 2/
Seminar 2 /
Project 2
ESE 20 40 20 20 100
 22SES308 ENGINEERING EXPLORATION SEMESTER III

PREREQUISITES CATEGORY L T P C
NIL ES 0 0 3 1.5

Course
The objective of the course is to provide an introduction to the engineering field. It is
Objectives
designed to help the student to learn about engineering and how it is useful in our
everyday life
Module – I Introduction 15
Introduction to Engineering and Engineering study: Difference between science and engineeirng,
scientist and engineer needs and wants, various disciplines of engineering, some misconceptions of
engineering, expectation for the 21st centuary engineer and Graduate Attribuites.
Module– II Engineering Design 15
Engineering Requirement, Knowledge within Engineering Disciplines, Engineering advancements,
Problem definition, Idea generation through brain storming and researching, solution creation through
evaluating and communicating, text/analysis, final solution and design improvement.
Module– Engineering Disciplines 15
III
Logic gates, algorithms, computer architecture, binary code
Contact Periods:
Lecture: 0 Periods Tutorial: 0 Periods Practical: 45 Periods Total: 45 Periods

REFERENCES:
1 Ryan A Brown, Joshua W. Brown and Michael Berkihiser: “Engineering Fundamentals:
Design, Principles and Careers”, Goodheart-Willcox Publisher, Second edition, 2014.
2 Saeed Moaveni, “Engineering Fundamentals: An Introduction to Engineering”,
Cengage learning, Fourth Edition, 2011.

COURSE OUTCOMES: Bloom’s

On completion of the course, the students will be able to: Taxonomy
Mapped
CO1 Understand the fundamentals of engineering and engineering study K2

CO2 Discuss the concept of need, constraints, objective(s) and create the problem K3
statement.
CO3 Design, develop and implement the concepts of the given problem statement. K3

CO4 Analyze the basic design problems in computer science and engineering. K5

CO5 Identify the importance of teamwork in exploring the project. K5

 COURSE ARTICULATION MATRIX :
a) CO and PO Mapping
COs/P PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
Os 1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3
CO1 3 2 1 3 3 2 3 3 3 3 2 1 2
CO2 3 2 2 3 3 3 3 3 3 3 3 3 3 3
CO3 3 3 3 3 3 3 1 3 3 3 3 3 3 3
CO4 3 3 3 3 3 3 1 3 3 3 3 3 3 3
22SES
3 3 3 3 3 3 1 3 3 3 3 3 3 3
308
1 – Slight, 2 – Moderate, 3 – Substantial

ASSESSMENT PATTERN – CDIO

Test / Rememberi Understanding Applying Analyzing Evaluating Creating Total

Bloom’s ng (K1) % (K2) % (K3) % (K4) % (K5) % (K6) % %
Category*

Exercise 1 25 25 25 25 100
Exercise 2 25 25 25 25 100
Exercise 3 25 25 25 25 100
Exercise 4 25 25 25 25 100
Exercise 5 25 25 25 25 100
Model Lab 25 25 25 25 100
ESE 25 25 25 25 100
 22SES309 DIGITAL SYSTEMS LABORATORY SEMESTER III

PREREQUISITES CATEGORY L T P C
NIL ES 0 0 3 1.5

Course The objective of this course is to design combinational logic circuits using logic
Objectives gates, to design sequential logic circuits like counters and registers using flip flops
and to simulate combinational logic circuits and sequential logic
circuits using VHDL.
LIST OF EXPERIMENTS
1. Verification of truth tables of logic gates.
2. Implementation of given Boolean function using logic gates in both SOP and POS form.
3. Design and verify the implementation of Half /Full Adder.
4. Design and verify the implementation of Half /Full Subtractor.
5. Implementation of combinational logic circuits using Multiplexer
6. Implementation of combinational logic circuits using Decoder.
7. Verification of State Tables of RS, J-K, T and D Flip-Flops using NAND gates.
8. Verification of State Tables of RS, J-K, T and D Flip-Flops using NOR gates.
9. Design and implementation of Shift registers.
10. Implementation of Sequence generators.
11. Simulation of Half /Full Adder, Half /Full Subtractor using VHDL.
12. Simulation of Multiplexer (8:1) and De_multiplexer (1:8): using VHDL.
13. Simulation of Encoder and Decoder using VHDL.
14. Simulation of Flip flops and counters using VHDL.
Contact Periods:
Lecture: 0 Periods Tutorial: 0 Periods Practical: 45 Periods Total: 45Periods

COURSE OUTCOMES: Bloom’s

On completion of the course, the students will be able to: Taxonomy
Mapped
CO1 Analyze and design combinational systems using standard gates and K6
minimization methods such as Karnaugh maps
CO2 Analyze and design combinational circuits using standard K6
combinational modules, such as multiplexers and decoders
CO3 Design and implement different sequential logic circuits like counters K6
and registers using flip flops.
CO4 Simulate combinational logic circuits and sequential logic circuits K6
using VHDL.

COURSE ARTICULATION MATRIX :

a) CO and PO Mapping
COs/P PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
Os 1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3
CO1 1 3 2 3 3 3 3 3
CO2 1 3 2 3 3 3 3 3
CO3 1 3 2 3 3 3 3 3
CO4 1 3 2 3 3 3 3 3
22SES 1 3 2 3 3 3 3 3
309
1 – Slight, 2 – Moderate, 3 – Substantial
b) CO and Key Performance Indicators Mapping (Times New Roman, Size 11 )
CO1 1.3.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.4, 2.3.1,2.3.2, 2.4.1, 2.4.2, 2.4.3, 2.4.4, 3.1.1, 3.1.2, 3.2.1,
3.2.2, 3.4.1, 3.4.2, 4.1.1, 4.1.2, 4.1.3, 4.2.1, 4.3.1, 4.3.3, 4.3.4, 5.1.1, 5.2.1, 5.2.2, 5.3.1, 5.3.2,
10.1.1, 10.1.2, 10.1.3, 10.3.1, 10.3.2
CO2 1.3.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.4, 2.3.1,2.3.2, 2.4.1, 2.4.2, 2.4.3, 2.4.4, 3.1.1, 3.1.2, 3.2.1,
3.2.2, 3.4.1, 3.4.2, 4.1.1, 4.1.2, 4.1.3, 4.2.1, 4.3.1, 4.3.3, 4.3.4, 5.1.1, 5.2.1, 5.2.2, 5.3.1, 5.3.2,
10.1.1, 10.1.2, 10.1.3, 10.3.1, 10.3.2
CO3 1.3.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.4, 2.3.1,2.3.2, 2.4.1, 2.4.2, 2.4.3, 2.4.4, 3.1.1, 3.1.2, 3.2.1,
3.2.2, 3.4.1, 3.4.2, 4.1.1, 4.1.2, 4.1.3, 4.2.1, 4.3.1, 4.3.3, 4.3.4, 5.1.1, 5.2.1, 5.2.2, 5.3.1, 5.3.2,
10.1.1, 10.1.2, 10.1.3, 10.3.1, 10.3.2
CO4 1.3.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.4, 2.3.1,2.3.2, 2.4.1, 2.4.2, 2.4.3, 2.4.4, 3.1.1, 3.1.2, 3.2.1,
3.2.2, 3.4.1, 3.4.2, 4.1.1, 4.1.2, 4.1.3, 4.2.1, 4.3.1, 4.3.3, 4.3.4, 5.1.1, 5.2.1, 5.2.2, 5.3.1, 5.3.2,
10.1.1, 10.1.2, 10.1.3, 10.3.1, 10.3.2
 DATA STRUCTURES LABORATORY SEMESTER
22SPC304
(Common to ECE,CSE) III

PREREQUISITES CATEGORY L T P C
22SES103 PROGRAMMING IN C LABORATORY PC 0 0 3 1.5

Course ObjectivesThe objective of the course is to Implement linear data structures and
nonlinear data structures, use appropriate data structures and implement
appropriate sorting and searching techniques.
LIST OF EXPERIMENTS
1. Implementation of Stack Operations using array and Linked List
2. Implementation of Queue operations using array and Linked List
3. Application of stacks in Recursion and Infix to postfix conversion
4. Application of Queue in Simulation of FCFS and Round Robin Scheduling
5. Implementation of Linear list, circularly linked list and Doubly linked list.
6. Application of Linked List in Polynomial Manipulations
7. Implementation of binary tree operations
8. Implementation of Tree Traversal Algorithms
9. Implementation of Graph Traversal Algorithms
10. Implementation of Minimum Spanning Algorithms
11. Implementation of hashing techniques.
12. Implementation of sorting techniques.
13. Implementation of searching techniques.
Contact Periods:
Lecture: 0 Period Tutorial:0 Periods Practical: 45 Periods Total: 45 Periods

COURSE OUTCOMES: Bloom’s

On completion of the course, the students will be able to: Taxonomy
Mapped
CO1 Implement queue and stack data structures using arrays and Linked Lists K5
CO2 Implement Tree Data structure and perform tree traversals. K5
CO3 Implement traversal on Graph Data structure. K5
CO4 Implement sorting and searching Techniques. K6
COURSE ARTICULATION MATRIX:

a) CO and PO Mapping
COs PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 3 1 2 3 3 1 3 3 2
CO2 3 2 2 3 3 2 2 2 3 3 2
CO3 3 2 2 3 3 2 2 2 3 3 2
CO4 3 2 2 3 3 2 2 2 3 3 2
CO5 3 2 2 3 3 1 3 3 2
22S 3 2 2 3 3 2 2 2 3 3 2
PC3
04
1 – Slight, 2 – Moderate, 3 – Substantial
b) CO and Key Performance Indicators Mapping
CO1 1.1.1,1.3.1, 1.4.1,2.1.2, 2.2.2, 2.3.1,2.4.1,3.1.6,3.2.2,3.2.3,3.3.1,3.3.2,3.4.1,4.2.2,4.3.1,12.2.2.
1.3.1,1.4.1,2.1.1,2.1.2,2.2.2,2.2.3,2.4.2,2.4.4,3.1.1.,3.1.3,3.1.6,3.2.3,3.3.1,3.4.1,4.1.2,4.1.3,4.2.2,
CO2
4.3.4,5.1.2,5.2.2,5.3.2,6.1.1,7.2.2,10.2.2,11.3.1,12.1.1,12.2.2,12.3.2
CO3 1.3.1,1.4.1,2.1.1,2.1.2,2.2.2,2.2.3,2.4.2,2.4.4,3.1.1.,3.1.3,3.1.6,3.2.3,3.3.1,3.4.1,4.1.2,4.1.3,4.2.2,
4.3.4,5.1.2,5.2.2,5.3.2,6.1.1,7.2.2,10.2.2,11.3.1,12.1.1,12.2.2,12.3.2
CO4 1.3.1,1.4.1,2.1.1,2.1.2,2.2.2,2.2.3,2.4.2,2.4.4,3.1.1.,3.1.3,3.1.6,3.2.3,3.3.1,3.4.1,4.1.2,4.1.3,4.2.2,
4.3.4,5.1.2,5.2.2,5.3.2,6.1.1,7.2.2,10.2.2,11.3.1,12.1.1,12.2.2,12.3.2
CO5 1.3.1,1.4.1,2.1.2.2.1,2.2.3,2.3.1,2.4.4,3.1.3,3.1.6, 3 .2.3, 3.3.2, 4.1.2, 4.2.1,4.3.1,6.1.1, 10.3.1,11.2.1,
12.1.1,12.2.2,12.3.2
 22SES410 ANALOG AND DIGITAL SEMESTER
COMMUNICATION IV

PREREQUISITES CATEGORY L T P C
NIL ES 3 0 0 3

After the completion of the course, the students are able to explain basic analog
Course modulation techniques, explore about wireless communication systems and Digital
Objectives transmission techniques, analyze about Spread spectrum techniques and multiple access
techniques and describe about working principles of mobile and satellite
communication system.
UNIT – I FUNDAMENTALS OF ANALOG COMMUNICATION 9
Principles of amplitude modulation-AM envelope - frequency spectrum – bandwidth - modulation
index percent modulation - Voltage and power distribution - AM detector – peak detector - Angle
modulation FM and PM waveforms - phase deviation and modulation index - frequency deviation and
percent modulation - Frequency analysis of angle modulated waves - Bandwidth requirements for
Angle modulated waves - FM detector – slope detector.
UNIT – II DIGITAL COMMUNICATION 9
Introduction- Shannon limit for information capacity- ASK transmitter, receiver and bandwidth-FSK
transmitter, receiver and bandwidth- BPSK transmitter, receiver and bandwidth- QPSK transmitter,
receiver and bandwidth- Quadrature Amplitude modulation – transmitter, receiver and bandwidth
efficiency- carrier recovery – squaring loop- Costas loop- DPSK – transmitter and receiver.
UNIT – III DIGITAL TRANSMISSION 9
Sampling theorem- reconstruction of message from its samples- Pulse modulation- PCM – PCM
sampling, quantization- signal to quantization noise rate-companding – analog and digital– percentage
error- delta modulation-transmitter and receiver- adaptive delta modulation- differential pulse code
modulation-transmitter and receiver- pulse transmission – Inter symbol interference- ISI-Nyquist
criteria for distortion less transmission.
UNIT – IV SPREAD SPECTRUM AND MULTIPLE ACCESS TECHNIQUES 9

Pseudo-noise sequence -Direct Sequence spread spectrum with coherent binary PSK- Frequency-hop
spread spectrum – slow and fast hopping. Multiple access techniques: FDMA- TDMA- CDMA –
SDMA wireless communication-frequency reuse and cell splitting- TDMA and CDMA in wireless
communication systems- source coding of speech for wireless communications.
UNIT – V MOBILE AND SATELLITE COMMUNICATIONS 9
Introduction to Cellular Concepts- Cellular Network Capacity- Cellular Channel Modelling- GSM
Network- Digital Cellular Communications Concepts- Equalisation, Channel Diversity, and Speech
Coding in Cellular Systems- CDMA and IS-95- UMTS W-CDMA and cdma2000- 4G Cellular
Networks and Beyond. Satellite Channel Modelling and Antennae- Satellite Communications Systems-
Satellite Applications: INTELSAT Series, INSAT, VSAT, Mobile satellite services: GSM, GPS,
INMARSAT, LEO, MEO.
Contact Periods:
Lecture: 45 Periods Tutorial: 0 Periods Practical: 0 Periods Total: 45Periods

TEXT BOOK:
1. Simon Haykin“Communication Systems” Third edition, John Wiley & Sons, 2004.( first
four units covered).
2. Wayne Tomasi“Electronic Communication Systems: Fundamentals Through
Advanced”,
Fifth edition, Pearson Education, 2004.( first four units few topics covered ).
 3. W.C.Y.Lee, "Mobile Communications Engineering: Theory and applications”, Second
Edition, McGraw-Hill International, 1998.( fifth unit covered ).
4. Dennis Roddy,”Satellite Communication”, 4th Edition, Mc Graw Hill International,
2006.( fifth unit covered ).
REFERENCES:
1. B.P.Lathi, “Modern Analog and Digital Communication systems”, Fourth Edition, Oxford
University Press, 2009.
2. T G Kennedy, B Davis and S R M Prasanna“Electronic communication systems”, Fifth
Edition, Tata Mc-Graw Hill Education Pvt Limited, 2011.

Bloom’s
COURSE OUTCOMES:
Taxonomy
On completion of the course, the students will be able to:
Mapped
Explain the principles of Amplitude modulation, Frequency modulation and
CO1 Phase K2
modulation
Describe the operation of transmitter and receiver system for digital
CO2 K2
communication.
Apply the concept of pulse code modulation for telecommunication
CO3 K3
networks.
CO4 Analyze the variousspread spectrum and multiple access techniques K4
CO5 Analyze the working principles of Mobile And Satellite Communications. K4

COs/ PO PO PO PO PO PO PO PO PO PO PO PO PSO PS PS
POs 1 2 3 4 5 6 7 8 9 10 11 12 1 O2 O3
CO1 1 2 2 2 2 1 2 2 2 1
CO2 1 2 2 2 2 1 2 2 2 1
CO3 1 3 2 3 2 1 2 2 2 1
CO4 1 3 2 3 2 2 1 2 2 2 1
CO5 1 3 2 3 2 2 1 2 2 2 1
22SE
1 3 2 3 2 1 1 2 2 2 1
S410

b) CO and Key Performance Indicators Mapping (Times New Roman, Size 11 )

CO1 1.3.1, 2.1.1, 2.1.2, 2.1.3, 2.2.2, 2.2.4, 2.4.1, 2.4.4, 3.1.1, 3.1.2, 3.1.3, 3.1.6, 3.2.1, 3.2.2,3.3.2, 3.4.1, 4.1.1, 4.1.2,
4.1.4, 4.2.1, 4.3.1, 4.3.2, 5.1.1, 5.1.2, 5.2.1, 5.2.2, 10.1.1, 10.2.1, 12.1.1, 12.1.2, 12.2.2, 12.3.2
CO2 1.3.1, 2.1.1, 2.1.2, 2.1.3, 2.2.2, 2.2.3, 2.2.4, 2.4.2, 2.4.4, 3.1.1, 3.1.2, 3.1.3, 3.1.6, 3.2.1, 3.2.2, 3.4.1, 4.1.1, 4.1.2,
4.1.4, 4.2.1, 4.3.1, 5.1.1, 5.1.2, 5.2.1, 5.2.2, 10.1.1, 10.2.1, 12.1.1, 12.1.2, 12.2.2, 12.3.2
CO3 1.3.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.2, 2.2.3, 2.2.4, 2.4.1, 2.4.4, 3.1.1, 3.1.2, 3.1.3, 3.1.6,3.2.1, 3.2.2, 3.3.2, 3.4.1,
4.1.1, 4.1.2, 4.1.3, 4.1.4, 4.2.1, 4.3.1, 4.3.2, 5.1.1, 5.1.2, 5.2.1, 5.2.2, 10.1.1, 10.2.1, 12.1.1, 12.1.2, 12.2.2, 12.3.2
CO4 1.3.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.2, 2.2.3,2.2.4, 2.4.1, 2.4.2, 2.4.4, 3.1.1, 3.1.2, 3.1.3, 3.1.6, 3.2.1, 3.2.2, 3.3.2,
3.4.1, 4.1.1, 4.1.2, 4.1.3, 4.1.4, 4.2.1, 4.3.1, 4.3.2, 4.3.4, 5.1.1, 5.1.2, 5.2.1, 5.2.2, 6.2.1, 10.1.1, 10.2.1, 12.1.1,
12.1.2, 12.2.2, 12.3.2
CO5 1.3.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.2, 2.2.3,2.2.4, 2.4.1, 2.4.2, 2.4.4, 3.1.1, 3.1.2, 3.1.3, 3.1.6, 3.2.1, 3.2.2, 3.3.2,
3.4.1, 4.1.1, 4.1.2, 4.1.3, 4.1.4, 4.2.1, 4.3.1, 4.3.2, 5.1.1, 5.1.2, 5.2.1, 5.2.2, 6.2.1, 10.1.1, 10.2.1, 12.1.1, 12.1.2,
12.2.2, 12.3.2
ASSESSMENT PATTERN – THEORY
Applyin Analyzi
Test / Bloom’s Remembering Understanding Evaluatin Creating Total
g (K3) ng (K4)
Category* (K1) % (K2) % g (K5) % (K6) % %
% %
CAT1 - 60% 40% 100%
CAT2 - - 40% 60% 100%
Individual
Assessment 1
/Case Study 1/ 50% 50% 100%
Seminar 1 /
Project1
Individual
Assessment 2
/Case Study 2/ 50% 50% 100%
Seminar 2 /
Project 2
ESE 40% 20% 40% 100%
 SEMESTER
22SPC405 COMPUTER ARCHITECTURE IV

PREREQUISITES CATEGORY L T P C
22SES306 DIGITAL SYSTEMS PC 3 0 0 3

Course The objective of the course is to introduce the concepts of computer architecture and
Objectives organization. It describes overview of MIPS architecture in terms of instruction set,
data path, pipelining and memory systems in detail along with performance metrics
for designing computer systems.
UNIT – I BASIC STRUCTURE OF A COMPUTER SYSTEM 9
Introduction - Eight Great Ideas in Computer Architecture -Technologies for Building Processors and
Memory – performance -The Power Wall - Amdahl’s law - The Switch from Uniprocessors to
Multiprocessors - Classes of Computing - High-Level Language to Language of Hardware -
Instructions: Operation, Operands, Representing Instructions, Logical operations, Decision making,
Supporting Procedures in Computer Hardware, MIPS
Addressing- Parallelism and Instructions: Synchronization.
UNIT – II ARITHMETIC FOR COMPUTERS 9
Signed Number Representation - Fixed and Floating Point Representations - Character
Representation. Computer Arithmetic - Addition and Subtraction - Multiplication - Division -Floating
point- Parallelism and Computer Arithmetic: Subword Parallelism and Matrix
multiplication.
UNIT – III PROCESSOR AND PIPELINING 9
Single-Cycle Datapath and Control-Multi-cycle Datapath and Control-Micro-programming and
Hardwired Control Units.Introduction to Pipelining: Pipelined Datapath and Control – Pipeline
Hazards: Structural, Data Hazards: Forwarding versus Stalling–Control Hazards – Exceptions-
Parallelism via Instructions.
UNIT – IV MEMORY SYSTEMS AND I/O INTERFACING 9
Introduction - Memory Technologies - The Basics of Caches - Measuring and Improving Cache
Performance - Dependable Memory Hierarchy - Virtual Machines - Virtual Memory - A Common
Framework for Memory Hierarchy –Finite State Machine to Control Simple Cache- Parallelism and
Memory Hierarchies: Cache Coherence - Redundant Arrays of
Inexpensive Disks.
UNIT – V PARALLEL PROCESSORS FROM CLIENT TO CLOUD 9
Introduction - Difficulty of Creating Parallel Processing Programs - SISD, MIMD, SIMD, SPMD, and
Vector - Hardware Multithreading - Multicore and Shared Memory Multiprocessors– Graphics
Processing Units - Clusters, Warehouse Scale Computers, and Message-Passing Multiprocessors -
Multiprocessor Network Topologies - Cluster Networking - Multiprocessor Benchmarks and
Performance Models.
Contact Periods: 45
Lecture: 45 Periods Tutorial: 0 Periods Practical: 0 Periods Total: 45 Periods

TEXT BOOK:
1 David. A. Patterson, John L. Hennessy “Computer Organization and Design: The
Hardware/Software Interface”, Fifth Edition, Morgan-Kaufmann Publishers Inc. 2014
REFERENCES:
1 Carl Hamachar, ZvoncoVranesic and SafwatZaky, “Computer Organization”, 5th edition,
McGraw Hill, 2011.
2 John P.Hayes, “Computer Architecture and Organization” Third Edition, Mc-Graw Hill
International, 1998.
3 William Stallings, “Computer Organization and Architecture: Designing for Performance”,
10th Edition, Pearson Education, 2016.
4 Morris Mano. M, “Computer system Architecture”, 3rd edition, PHI publication, 2008.
5 Carl Hamacher, Zvonko Vranesic, Safwat Zaky and Naraig Manjikian, “Computer Organization
and Embedded Systems”, Sixth Edition, Tata McGraw Hill, 2012.

COURSE OUTCOMES: Bloom’s

Taxonomy
On completion of the course, the students will be able to: Mapped
CO1 Describe and analyze the main functional units of a computer and its K3
performance evaluation.
CO2 Explain the Computer Arithmetic to demonstrate the performance impact of K2
sub word parallelism.
CO3 Identify different pipelining hazards and their inference. K4
CO4 Explain the Data path and Control and Micro-programming and Hard-wired K2
Control Units.
CO5 Understand virtual memory and caching. K2
CO6 Understand parallel processor from client to cloud. K2

COURSE ARTICULATION MATRIX:

a) CO and PO Mapping
COs/POs PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 3 1 2 2 2 1 3 3 3
CO2 3 2 2 2 2 1 3 3 3
CO3 3 3 2 3 2 2 1 3 3 3
CO4 3 3 2 3 2 2 1 3 3 3
CO5 3 3 2 3 2 2 1 3 3 3
CO6 3 3 2 3 2 2 1 3 3 3
22SPC40 3 3 2 3 2 2 1 3 3 3
5
1 – Slight, 2 – Moderate, 3 – Substantial
b) CO and Key Performance Indicators Mapping
CO1 1.1.1, 1.3.1, 1.4.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.3, 2.2.4, 2.3.1, 2.3.2, 2.4.1, 2.4.3, 3.2.2, 3.2.3, 3.3.1,
3.4.2, 4.1.2, 4.1.4, 4.2.1, 4.3.3, 7.1.2, 7.2.2, 11.2.1, 11.3.1, 12.1.1, 12.3.2
CO2 1.1.1, 1.1.2, 1.3.1, 1.4.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1,2.2.2, 2.2.4, 2.3.1, 2.3.2, 2.4.1,3.1.4, 3.2.1, 3.2.3,
3.3.1, 3.4.1, 3.4.2, 4.1.1, 4.1.2, 4.2.2, 4.3.2, 4.3.3, 7.1.2, 7.2.2, 12.1.2, 12.3.2
CO3 1.1.1, 1.1.2, 1.3.1, 1.4.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1,2.2.2, 2.2.3, 2.2.4, 2.3.1, 2.3.2, 2.4.1,2.4.3, 3.1.4,
3.2.1, 3.2.2, 3.2.3, 3.3.1, 3.4.1, 3.4.2, 4.1.1, 4.1.2, 4.1.4, 4.2.1, 4.2.2, 4.3.2, 4.3.3, 7.1.2, 7.2.2, 11.2.1,
11.3.1, 12.1.1, 12.3.2
CO4 1.1.1, 1.1.2, 1.3.1, 1.4.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1,2.2.2, 2.2.3, 2.2.4, 2.3.1, 2.3.2, 2.4.1,2.4.3, 3.1.4,
3.2.1, 3.2.2, 3.2.3, 3.3.1, 3.4.1, 3.4.2, 4.1.1, 4.1.2, 4.1.4, 4.2.1, 4.2.2, 4.3.2, 4.3.3, 7.1.2, 7.2.2, 11.2.1,
11.3.1, 12.1.1, 12.3.2
 CO5 1.1.1, 1.1.2, 1.3.1, 1.4.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1,2.2.2, 2.2.3, 2.2.4, 2.3.1, 2.3.2, 2.4.1,2.4.3, 3.1.4,
3.2.1, 3.2.2, 3.2.3, 3.3.1, 3.4.1, 3.4.2, 4.1.1, 4.1.2, 4.1.4, 4.2.1, 4.2.2, 4.3.2, 4.3.3, 7.1.2, 7.2.2, 11.2.1,
11.3.1,12.1.1, 12.3.2
CO6 1.1.1, 1.1.2, 1.3.1, 1.4.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1,2.2.2, 2.2.3, 2.2.4, 2.3.1, 2.3.2, 2.4.1,2.4.3, 3.1.4,
3.2.1, 3.2.2, 3.2.3, 3.3.1, 3.4.1, 3.4.2, 4.1.1, 4.1.2, 4.1.4, 4.2.1, 4.2.2, 4.3.2, 4.3.3, 7.1.2, 7.2.2, 11.2.1,
11.3.1, 12.1.1, 12.3.2

ASSESSMENT PATTERN – THEORY

Test / Bloom’s Rememberi Understanding Applying Analyzing Evaluating Creating Total
Category* ng (K1) % (K2) % (K3) % (K4) % (K5) % (K6) % %
CAT1 20 30 30 20 100
CAT2 10 25 35 30 100
Individual 10 20 30 40 100
Assessment 1
/Case Study 1/
Seminar 1 /
Project1
Individual 10 25 35 30 100
Assessment 2
/Case Study 2/
Seminar 2 /
Project 2
ESE 20 20 40 20 100
 SEMESTER
22SPC406 DATABASE MANAGEMENT SYSTEMS IV

PREREQUISITES CATEGORY L T P C
NIL PC 3 0 0 3

Course The objective of this course is to learn about database design and query
Objectives processing. To develop transaction processing applications considering
concurrency control and recovery issues. To learn about enhanced data models
UNIT – I DATABASE SYSTEM CONCEPTS AND DATA 9
MODELS
Data base approach: Characteristics, Advantages, Applications – Data Models - Three
Schema Architecture- Data base System Environment- Data Modeling with ER model-Enhanced ER
Model.
UNIT – II RELATIONAL DATA MODEL AND SQL 9
Relational Model: Concepts - Mapping ER and EER model to relations – Constraints -
Schemas – Basic SQL: Data Definition, Data types, Constraint Specification, Data retrieval
Queries - Relational Algebra – Triggers - Views
UNIT – III DATABASE DESIGN AND QUERY PROCESSING 9
Design Guidelines – Functional Dependencies – Normal Forms based on Primary Keys –Second
and Third Normal Forms – BCNF – Multi valued Dependencies and Fourth Normal
Form – Join Dependency and Fifth Normal Form - Strategies for Query Processing – Query
Optimization
UNIT – IV TRANSACTION PROCESSING, CONCURRENCY 9
CONTROL AND RECOVERY
Transaction: Desirable properties, Schedules based on recoverability and serializability - Transaction
support in SQL.
Concurrency Control: Locking technique -Time stamp based ordering - Multi version concurrency
control - Validation and snapshot isolation concurrency control.
Recovery Techniques: Concepts, NOUNDO/ REDO recovery based on deferred update, Recovery
based on immediate update, Shadow paging, ARIES algorithm, Recovery in multi database systems

UNIT – V NOSQL DATABASES AND ENHANCED DATA 9

MODELS
Introduction to NOSQL Systems: CAP Theorem, Document based systems, NOSQL Key-value
stores, CRUD operation using NOSQL- Enhanced Data models: Active Database,
Temporal Database, Spatial, multimedia and Deductive Databases.
Contact Periods:
Lecture: 45 Periods Tutorial: 0 Periods Practical: 0 Periods Total: 45 Periods

TEXT BOOK :
1 Ramez Elmasri, Shamkant B. Navathe “Fundamentals of Database Systems” Seventh
Edition, Pearson Education Limited, 2015
REFERENCES:
1 Abraham Silberschatz , Henry F. Korth and S. Sudarshan, “Database System Concepts”,
Sixth Edition, McGraw-Hill, 2012.
2 Raghu Ramakrishnan and Gehrke, “Database Management Systems”, Third Edition,
McGraw Hill, 2003
 COURSE OUTCOMES: Bloom’s
On completion of the course, the students will be able to: Taxonomy
Mapped
CO1 Design a database management system using ER and EER model K4
CO2 Design a relational database system and write SQL queries in an K4
optimized way
CO3 Write transaction processing applications considering concurrency K3
control and recovery issues
CO4 Perform CRUD operation using NOSQL database K4
CO5 Explain Active Database, Temporal Database, Spatial, multimedia K2
and Deductive Databases

COURSE ARTICULATION MATRIX :

a) CO and PO Mapping (Times New Roman, Size 11 )
COs/P PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
Os 1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3
CO1 2 3 3 2 1 3 3 1
CO2 2 3 3 2 1 3 3 1
CO3 2 3 3 2 1 3 3 1
CO4 2 3 3 2 1 3 3 1
CO5 2 2 2 2 1 3 3 1
22SPC 2 3 3 2 1 3 3 1
406
1 – Slight, 2 – Moderate, 3 – Substantial
b) CO and Key Performance Indicators Mapping (Times New Roman, Size 11 )
CO1 1.3.1, 1.4.1, 2.1.1, 2.1.2, 2.2.1, 2.2.2, 2.2.3, 2.2.4,2.3.2, 2.4.2, 2.4.3, 2.4.4, 3.1.1, 3.1.3, 3.1.5,
3.1.6, 3.2.1, 3.2.2, 3.2.3, 3.3.1, 3.3.2, 3.4.1, 3.4.2, 4.1.1, 4.1.2, 4.3.1, 4.3.3, 10.1.1
CO2 1.3.1, 1.4.1, 2.1.1, 2.1.2, 2.1.3, 2.2.1, 2.2.2, 2.2.3, 2.2.4, 2.3.2, 2.4.2, 2.4.3, 2.4.4, 3.1.1, 3.1.3,
3.1.5, 3.1.6, 3.2.1, 3.2.2, 3.2.3, 3.3.1, 3.3.2, 3.4.1, 3.4.2, 4.1.1, 4.1.2,4.1.3, 4.2.1, 4.3.1, 4.3.3,
5.1.1, 5.1.2, 5.2.1, 5.3.1, 10.1.1
CO3 1.3.1, 1.4.1, 2.1.1, 2.1.2, 2.2.1, 2.2.2, 2.2.3, 2.2.4, 2.3.2, 2.4.2, 2.4.3, 2.4.4, 3.1.1, 3.1.3, 3.1.5,
3.1.6, 3.2.1, 3.2.2, 3.2.3, 3.3.1, 3.3.2, 3.4.1, 3.4.2, 4.1.1, 4.1.2,4.1.3, 4.2.1, 4.3.1, 4.3.3, 5.1.1,
5.1.2, 5.2.1, 5.3.1, 10.1.1
CO4 1.3.1, 1.4.1, 2.1.1, 2.1.2, 2.2.1, 2.2.2, 2.2.3, 2.2.4, 2.3.2, 2.4.2, 2.4.3, 2.4.4, 3.1.1, 3.1.3, 3.1.5,
3.1.6, 3.2.1, 3.2.2, 3.2.3, 3.3.1, 3.3.2, 3.4.1, 3.4.2, 4.1.1, 4.1.2,4.1.3, 4.2.1, 4.3.1, 4.3.3, 5.1.1,
5.1.2, 5.2.1, 5.3.1, 10.1.1
CO5 1.3.1, 1.4.1, 2.1.1, 2.1.2, 2.2.4, 2.3.2, 2.4.2, 2.4.3, 2.4.4, 3.1.1, 3.2.3, 3.3.1, 3.3.2, 3.4.1, 3.4.2,
4.1.1, 4.1.2, 4.3.1, 4.3.3, 10.1.1
ASSESSMENT PATTERN – THEORY
Test / Remembe Understandi Applyin Analyzin Evaluatin Creating Tota
Bloom’s ring (K1) ng (K2) % g (K3) g (K4) % g (K5) % (K6) % l%
Category* % %
CAT1 20 30 40 10 100
CAT2 20 30 40 10 100
Individual 50 50 100
Assessment 1
/Case Study 1/
Seminar 1 /
Project1
Individual 50 50 100
Assessment 2
/Case Study 2/
Seminar 2 /
Project 2
ESE 20 30 50 100
 SEMESTER
22SPC407 SYSTEM PRORAMMING AND OPERATING SYSTEMS
IV
PREREQUISITES CATEGORY L T P C
NIL PC 3 0 0 3

Course The objective of the course is to form an understanding on basic working principle of
Objectives system software , role of OS services in process management, process synchronization
, CPU scheduling , memory management ,storage management, file management and
protection.
To understand concept behind virtual machine.
UNIT – I INTRODUCTION TO SYSTEM SOFTWARE 9
Introduction to system software – Overview of language processors – Assemblers – Elements of
Assembly language programming – pass structure of assemblers – two pass assembler – single pass
assembler - Macro definition and call –Macro expansion –advanced Macro facilities –Design of
Macro Preprocessor - relocation and linking concept –design of linker – self relocating programs –
loaders
UNIT – II PROCESS MANAGEMENT AND SYNCHRONIZATION 9
Operating System structure – Services - Process concepts - process scheduling – operation on
processes - inter process communication – examples of IPC systems – communication in client server
system – Threads - Multicore Programming - Multithreading Models - Threading Issues - Operating-
System Examples
Process synchronization: critical section problem - Peterson's Solution - synchronization Hardware –
Mutex lock – semaphores - classical problems of synchronization - monitors – synchronization
examples – alternative approaches
UNIT – III CPU SCHEDULING AND DEADLOCK 9
Basic Concepts - Scheduling Criteria - Scheduling Algorithms - Thread Scheduling - Multiple-
Processor Scheduling - Real-Time CPU Scheduling - Operating-System Examples - Algorithm
Evaluation
Deadlock - System model-Deadlock characterization- Methods for Handling Deadlocks - Deadlock
prevention- Deadlock avoidance - Deadlock detection- Recovery from deadlock.
UNIT – IV MEMORY AND STORAGE MANAGEMENT 9
Main Memory –Logical address and Physical address – Swapping – Continuous memory allocation -
segmentation – paging – Structure of page table - Example: ARM Architecture - Virtual memory
concepts - Demand paging - Copy-on-Write - Page replacement – Allocation of Frames -Thrashing -
Memory-Mapped Files - Allocating Kernel Memory - Other Considerations - Operating-System
Examples
Disk Structure-Disk Attachment - Disk scheduling- Disk Management - Swap Space Management –
File concept- Access methods- Directory and Disk Structure- File system Mounting - File sharing-
Protection - File system implementation – Free Space Management
UNIT – V PROTECTION AND VIRTUAL MACHINE 9
Goals of Protection - Principles of Protection - Access Matrix - Implementation of the Access
Matrix- Access Control - Revocation of Access Rights - Capability-Based Systems -Language-
Based Protection
Virtual Machines – history - Benefits and Features - Building Blocks - Types of Virtual
Machines and Their Implementations - Virtualization and Operating-System Components -
Examples
Contact Periods: 45
Lecture: 45 Periods Tutorial: 0 Periods Practical: 0 Periods Total: 0 Periods

TEXT BOOK:
1 D.M.Dhamdhere “System Programming”,Tata McGraw Hill Education Private Limited ,
2011
2 A. Silberschatz & Peter Baer Galvin and Greg Gagne “Operating System concepts” 9th
edition, John Wiley and sons Inc., 2012.

REFERENCES:
1 Andrew S. Tanenbaum, Albert S. Woodhull: “Operating Systems, Design and
Implementation”, 3rd Edition, Prentice Hall, 2011.
2 Gary Nutt: “Operating Systems”, 3rd Edition, Pearson Education, 2009
3 D M Dhamdhere, “Operating Systems: A Concept-based Approach”, 2nd Edition, Tata
McGraw-Hill Education, 2009.
4 NPTEL Course : “Operating System Fundamentals”
https://nptel.ac.in/courses/106105214

COURSE OUTCOMES: Bloom’s

On completion of the course, the students will be able to: Taxonomy
Mapped
CO1 Explain the working principle of Assembler, Macros, Linkers and K2
Loaders
CO2 Explore process management and process synchronization techniques K4

CO3 Identify and apply appropriate CPU scheduling algorithms and K4

Deadlock detection techniques for the given scenario
CO4 Apply appropriate memory management techniques and Storage K3
management techniques for the given scenario
CO5 Explain the concepts behind virtual machine and protection K2
mechanism in OS.

COURSE ARTICULATION MATRIX :

a) CO and PO Mapping
COs/PO PO PO PO PO PO PO PO PO PO PO PO PO P PS PS
s 1 2 3 4 5 6 7 8 9 10 11 12 S O2 O3
O
1
CO1 2 2 1 1 2 2 1 1
CO2 2 3 2 1 2 2 2 2 1
CO3 2 3 2 1 2 2 2 2 1
CO4 2 3 2 1 2 2 2 2 2
CO5 2 3 1 3 2 2 2 2 2 2
22SPC4 2 3 2 1 1 1 2 2 2 2 1
04
1 – Slight, 2 – Moderate, 3 – Substantial
 b) CO and Key Performance Indicators Mapping
CO1 1.3.1,1.4.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.3.2,2.4.1,3.1.3,3.1.6,5.2.2,10.1.1,10.1.3,
12.2.1,12.2.2,12.3.1,12.3.2
CO2 1.3.1,1.4.1,2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.2.4,2.3.2,2.4.1,3.1.3,3.1.6,3.2.2,3.2.3,3.3
.1,4.1.2,4.1.3,10.1.1,10.1.3, 12.2.1,12.2.2,12.3.1,12.3.2
CO3 1.3.1,1.4.1,2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.2.4,2.3.2,2.4.1,3.1.3,3.1.6,3.2.2,3.2.3,4.1
.2,4.1.3,10.1.1,10.1.3, 12.2.1,12.2.2,12.3.1,12.3.2
CO4 1.3.1,1.4.1,2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.2.4,2.3.2,2.4.1,3.1.3,3.1.6,3.2.2,3.2.3,4.1
.2,4.1.3,7.1.1,7.2.2,10.1.1,10.1.3, 12.2.1,12.2.2,12.3.1,12.3.2
CO5 1.3.1,1.4.1,2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.3.2,2.4.1,2.4.2,3.1.3,3.1.6,5.1.1,5.1.2,5.2
.1,5.2.2,5.3.1,7.1.1,7.2.2,10.1.1,10.1.3, 12.2.1,12.2.2,12.3.1,12.3.2

ASSESSMENT PATTERN – THEORY

Test / Remembe Understandi Applyin Analyzin Evaluatin Creating Tota
Bloom’s ring (K1) ng (K2) % g (K3) g (K4) % g (K5) % (K6) % l%
Category* % %
CAT1 40 40 20 100
CAT2 30 50 20 100
Individual
Assessment 1 70 30 100
/Case Study 1/
Seminar 1 /
Project1
Individual
Assessment 2 60 40 100
/Case Study 2/
Seminar 2 /
Project 2
ESE 40 50 10 100
 DESIGN AND ANALYSIS OF ALGORITHMS SEMESTER
22SPC408 (Common to CSE and IT) IV

PREREQUISITES CATEGORY L T P C
22SPC301 DATA STRUCTURES PC 3 1 0 4

Course
To apply important algorithmic design paradigms and methods of analysis and
Objectives
synthesize efficient algorithms in common engineering design situations
UNIT – I INTRODUCTION TO ALGORITHM ANALYSIS 9
Fundamentals of Algorithmic Problem Solving - Important Problem Types - Fundamentals of the
Analysis of Algorithm Efficiency - Asymptotic Notations and Basic Efficiency Classes -
Mathematical Analysis of Non-recursive Algorithms - Mathematical Analysis of Recursive
Algorithms - Amortized Analysis - Empirical Analysis of Algorithms – Algorithm Visualization
UNIT – II DECREASE AND CONQUER TECHNIQUE 9
Decrease by constant: Insertion sort - Topological algorithm. Decrease-by-a-Constant-Factor:Binary
Search - Fake-Coin Problem - Russian Peasant Multiplication - Josephus Problem.
Variable-SizeDecrease - Computing a Median and the Selection Problem - InterpolationSearch -
Searching and Insertion in a Binary Search Tree - The Game of Nim.
UNIT – III ALGORITHM DESIGN TECHNIQUES -I 9
Greedy Approach : Prim’s algorithm- Kruskal’s Algorithm- Dijkstra’s Algorithm - Huffman Trees
and codes .Divide and Conquer : Merge Sort – Quick sort - Matrix Multiplication of Large Integers -
Strassen’s Matrix Multiplication .Dynamic Programming : Matrix Chain
Multiplication – Knapsack problem and Memory Function – optimal binary search tree - Warshall’s
and Floyd’s Algorithms – Longest common Subsequence
UNIT – IV ALGORITHM DESIGN TECHNIQUES -II 9
Backtracking: n-Queen problem – Hamilton Circuit Problem – Subset sum problem - CNF –SAT.
Branch and Bound: Assignment problem – Knapsack problem - Travelling Salesman Problem.
UNIT – V NP COMPLETENESS 9
Introduction to NP Class – NP Completeness and Reducibility - Approximation Algorithm
for NP Hard Problems: TSP - Knapsack problem – Randomization and Linear Programming.
Contact Periods:
Lecture: 45 Periods Tutorial: 15 Periods Practical: 0 Periods Total: 60 Periods

TEXT BOOK (Maximum 2):

1 Anany Levitin “Introduction to the Design and Analysis of Algorithms” Third Edition,
Pearson Education, 2012
2 Thomas H Cormen, Charles E Lieserson, Ronald L Rivest and Clifford Stein
“Introduction to Algorithms” Third Edition, MIT Press/McGraw-Hill, 2009.

REFERENCES (Minimum 4 and Maximum 6):

1 Michael T Goodrich and Roberto Tamassia, “Algorithm Design: Foundations, Analysis,
and Internet Examples”, Second Edition, Wiley, 2006
2 Mark de Berg, Mark van Kreveld, Mark Overmars and OtfriedShwarzkopf (Cheong),
 “Computational Geometry: Algorithms and Applications”, Third edition, Springer-
Verlag, 2008.
3 Skiena S. Steven “The algorithm design manual”, Second edition, Springer 2008.
4 Dasgupta S., Papadimitriou C. and Vazirani U., “Algorithms”, Tata McGraw-Hill, 2009.

COURSE OUTCOMES: Bloom’s

On completion of the course, the students will be able to: Taxonomy
Mapped
CO1 Argue the correctness of algorithms and analyze the running time using K4
asymptotic
notations.
CO2 Describe the Decrease and Conquer techniques. K2
CO3 Identify and apply Greedy approach and Dynamic Programming K4
technique.
CO4 Analyze algorithms deploying Backtracking and Branch and Bound K6
technique.
CO5 Examine Approximation and randomized algorithm. K4

COURSE ARTICULATION MATRIX:

a) CO and PO Mapping
COs/P PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
Os 1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO1 1 1 3 3 1 2 3 3 3
CO2 2 3 3 3 1 2 3 3 3
CO3 3 3 3 3 1 2 3 3 3
CO4 3 3 3 3 1 2 3 3 3
CO5 2 3 3 3 1 2 3 3 3
22SPC4 2 3 3 3 1 2 3 3 3
08
1 – Slight, 2 – Moderate, 3 – Substantial
b) CO and Key Performance Indicators Mapping
CO1 1.1.1, 2.1.2, 2.1.3, 10,.1.3, 10.2.1, 10.2.2, 10.3.2, 12.1.1, 12.1.2, 12.2.2, 12.3.1
CO2 1.1.1, 1.3.1, 1.4.1, 2.1.1., 2.1.2, 2.1.3, 2.2.1 ,2.2.2, 2.2.3, 2.2.4, 2.3.1, 2.3.2, 3.1.1, 3.1.6, 3.2.1, 3.2.2,
3.2.3, 3.3.1, 3.3.2, 3.4.1, 3.4.2, 4.1.1, 4.1.2,4.1.4, 4.2.1, 4.2.2., 4.3.3., 4.3.4,10.2.1, 10.2.2, 10.3.2,
12.1.1, 12.1.2, 12.2.2, 12.3.1
CO3 1.1.1, 1.1.2, 1.3.1, 1.4.1, 2.1.1., 2.1.2, 2.1.3, 2.2.1 ,2.2.2, 2.2.3, 2.2.4, 2.3.1, 2.3.2, 3.1.1, 3.1.6, 3.2.1,
3.2.2, 3.2.3, 3.3.1, 3.3.2, 3.4.1, 3.4.2, 4.1.1, 4.1.2, 4.1.4, 4.2.1, 4.2.2., 4.3.3, 4.3.4,10.2.1, 10.2.2, 10.3.2,
12.1.1, 12.1.2, 12.2.2, 12.3.1
CO4 1.1.1, 1.1.2, 1.3.1, 1.4.1, 2.1.1., 2.1.2, 2.1.3, 2.2.1 ,2.2.2, 2.2.3, 2.2.4, 2.3.1, 2.3.2, 3.1.1, 3.1.6, 3.2.1,
3.2.2, 3.2.3, 3.3.1, 3.3.2, 3.4.1, 3.4.2, 4.1.1, 4.1.2, 4.1.4, 4.2.1, 4.2.2., 4.3.3, 4.3.4, 10.2.1, 10.2.2,
10.3.2, 12.1.1, 12.1.2, 12.2.2, 12.3.1
CO5 1.1.1, 1.3.1, 1.4.1, 2.1.1., 2.1.2, 2.1.3, 2.2.1 ,2.2.2, 2.2.3, 2.2.4, 2.3.1, 2.3.2, 3.1.1, 3.1.6, 3.2.1, 3.2.2,
3.2.3, 3.3.1, 3.3.2, 3.4.1, 3.4.2, 4.1.1, 4.1.2,4.1.4, 4.2.1, 4.2.2., 4.3.3., 4.3.4,10.2.1, 10.2.2, 10.3.2,
12.1.1, 12.1.2, 12.2.2, 12.3.1
ASSESSMENT PATTERN – THEORY
Test / Bloom’s Remembering Understanding Applying Analyzing Evaluating Creating Total
Category* (K1) % (K2) % (K3) % (K4) % (K5) % (K6) % %
CAT1 30 30 40 100
CAT2 20 40 40 100
Individual
Assessment 1
/Case Study 1/ 50 50 100
Seminar 1 /
Project1
Individual
Assessment 2
/Case Study 2/ 50 50 100
Seminar 2 /
Project 2
ESE 20 40 40 100
 SEMESTER
22SPC409 SOFTWARE ENGINEERING METHODOLOGIES IV

PREREQUISITES CATEGORY L T P C
NIL PC 3 0 2 4

Course The objective of the course is to enable the students to understand the role of software
Objectives process and a process model in a projects, the role of SRS in a project and how requirements
are validated, the techniques for estimation, design, testing and project
management of large software development projects.
UNIT – I SOFTWARE PROCESS MODEL 9+6
Principle of Software engineering – Software myths - Prescriptive process model: Waterfall Model -
Incremental Process Models - Evolutionary Process Models - Concurrent Models–Unified process –
Agile Development: Agility Principles - Extreme Programming - Other Agile Process Model.
UNIT – II SOFTWARE REQUIREMENT MODELING 9+6
Requirement Engineering – Eliciting Requirement - Quality Function Deployment - BuildingRequirement
model - Negotiating Requirement - Validating Requirement - Requirement Analysis -
Scenario Based Modeling - Data Modeling - Class Based Modeling - Flow Oriented Modeling - CaseStudy.

UNIT – III SOFTWARE DESIGN AND ESTIMATION 9+6

Design Process - Design Concepts – Design model - architectural design - component level design – User
interface design .Software Project Estimation – Decomposition techniques- Empirical Estimation model –
specialized estimation technique for Agile Development - project scheduling - risk
management.
UNIT – IV SOFTWARE QUALITY AND TESTING 9+6
Software Quality – Review Techniques – Software Quality Assurance – Strategic approach to software
testing – Testing Strategies for Conventional software- Object- Oriented software – Validation testing –
system testing –Art of Debugging – Testing Conventional Application – Testing
Object- Oriented Application - Case study Tarantula : Software testing tool for Agile Development.
UNIT – V SOFTWARE PROJECT MANAGEMENT 9+6
Software Configuration Management-The SCM repository-The SCM process-The Configuration
Management for Web apps- Project Management-The management Spectrum – The People - The Product –
The Process - The Project-The W5HH Principle-Critical Practices-Process and Project
Metrics.
Contact Periods:
Lecture: 45 Periods Tutorial: 0 Periods Practical: 15 Periods Total: 60 Periods

LIST OF EXPERIMENTS:
1. Identify a software system that needs to be developed.
2. Document the Software Requirements Specification (SRS) for the identified system.
3. Identify use cases and develop the Use Case model.
4. Identify the conceptual classes and develop a Domain Model and also derive a Class Diagram
from that.
5. Using the identified scenarios, find the interaction between objects and represent them using UML
Sequence and Collaboration Diagrams.
6. Draw relevant State Chart and Activity Diagrams for the same system.
7. Implement the system as per the detailed design
8. Test the software system for all the scenarios identified as per the usecase diagram
9. Improve the reusability and maintainability of the software system by applying appropriate design
patterns.
10. Implement the modified system and test it for various scenarios
 TEXT BOOK :
1 Roger Pressman.S, “Software Engineering: A Practitioner’s Approach”, Eighth Edition,
McGraw Hill, 2014.

REFERENCES :
1. Ian Sommerville, “Software Engineering”, Nineth Edition, Pearson Education Asia, 2011
2. Mark C. Layton , “Scrum For Dummies” John Wiley & Sons Inc,2015.
3. Shari Lawrence Pfleeger, Joanne M. Atlee, “Software Engineering: Theory and Practice”,
Fourth Edition, Pearson Education, 2011.

COURSE OUTCOMES: Bloom’s

On completion of the course, the students will be able to: Taxonomy
Mapped
CO1 Compare various Software Development Lifecycle Models K2
CO2 Design requirement model for a software project K3
Perform architectural design, component level design and UI design as well
CO3 as apply cost and schedule estimation strategies. K3
CO4 Apply testing strategies to verify and validate a software application. K3
CO5 Assess project progress using project management techniques K3

COURSE ARTICULATION MATRIX:

a) CO and PO Mapping
COs/ PO PO PO3 PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PS
POs 1 2 4 5 6 7 8 9 0 1 2 1 2 O3
CO1 2 3 2 3 2 3 2 2 2
CO2 2 3 2 3 2 2 2 2
CO3 2 3 2 3 2 2 2 2
CO4 2 3 2 3 2 2 3 2 2 3
CO5 2 3 2 3 2 1 1 2 3 2 2 3
22SPC4 2 3 2 3 1 2 2 2 2 3
09
1 – Slight, 2 – Moderate, 3 – Substantial
b) CO and Key Performance Indicators Mapping
CO1 1.3.1,1.4.1, 2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.2.4,2.3.1,2.3.2,2.4.1,2.4.2,2.4.3,2.4.4, 3.1.3, 3.1.6,
3.2.1, 3.2.2,3.2.3,3.3.1,3.4.1,3.4.2, 4.1.1,4.1.2,4.1.3,4.1.4,4.2.1,4.2.2,4.3.1,4.3.2,4.3.4,
10.1.1,10.1.2,10.1.3, 12.1.1,12.1.2,12.2.1,12.2.2,12.3.1
CO2 1.3.1,1.4.1, 2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.2.4,2.3.1,2.3.2,2.4.1,2.4.2,2.4.3,2.4.4, 3.1.3, 3.1.6,
3.2.1, 3.2.2,3.2.3,3.3.1,3.4.1,3.4.2, 4.1.1,4.1.2,4.1.3,4.1.4,4.2.1,4.2.2,4.3.1,4.3.2,4.3.4,
10.1.1,10.1.2,10.1.3
CO3 1.3.1,1.4.1, 2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.2.4,2.3.1,2.3.2,2.4.1,2.4.2,2.4.3,2.4.4, 3.1.3, 3.1.6,
3.2.1, 3.2.2,3.2.3,3.3.1,3.4.1,3.4.2, 4.1.1,4.1.2,4.1.3,4.1.4,4.2.1,4.2.2,4.3.1,4.3.2,4.3.4,
10.1.1,10.1.2,10.1.3
 CO4 1.3.1,1.4.1, 2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.2.4,2.3.1,2.3.2,2.4.1,2.4.2,2.4.3,2.4.4, 3.1.3, 3.1.6,
3.2.1, 3.2.2,3.2.3,3.3.1,3.4.1,3.4.2, 4.1.1,4.1.2,4.1.3,4.1.4,4.2.1,4.2.2,4.3.1,4.3.2,4.3.4,
5.1.1,5.1.2,5.2.1,5.2.2, 10.1.1,10.1.2,10.1.3, 12.1.1,12.1.2,12.2.1,12.2.2,12.3.1
CO5 1.3.1,1.4.1, 2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.2.4,2.3.1,2.3.2,2.4.1,2.4.2,2.4.3,2.4.4, 3.1.3, 3.1.6,
3.2.1, 3.2.2,3.2.3,3.3.1,3.4.1,3.4.2, 4.1.1,4.1.2,4.1.3,4.1.4,4.2.1,4.2.2,4.3.1,4.3.2,4.3.4,
5.1.1,5.1.2,5.2.1,5.2.2, 10.1.1,10.1.2,10.1.3, 12.1.1,12.1.2,12.2.1,12.2.2,12.3.1

ASSESSMENT PATTERN – THEORY

Test / Bloom’s Remembering Understanding Applying Analyzing Evaluating Creating Total
Category* (K1) % (K2) % (K3) % (K4) % (K5) % (K6) % %
CAT1 30 30 40 100
CAT2 20 40 40 100
Individual
Assessment 1
/Case Study 1/ 50 50 100
Seminar 1 /
Project1
Individual
Assessment 2
/Case Study 2/ 50 50 100
Seminar 2 /
Project 2
ESE 20 40 40 100
 DATA BASE MANAGEMENT SYSTEMS SEMESTER
22SPC410 IV
LABORATORY

PREREQUISITES CATEGORY L T P C
NIL PC 0 0 3 1.5

Course The objective of this course is to practice DDL, DML, DCL and TCL commands,
Objectives relational algebra operations, Views, stored procedures, cursors, functions, triggers
and to develop a simple application with front end and back
end design with report generation.
LIST OF EXPERIMENTS
Experiments should be implemented in MySQL/NoSQL
1. DDL and DML commands.
2. Views & Subqueries.
3. Relational Algebra Operations
4. Stored Procedures and Cursors.
5. Stored Functions.
6. Triggers.
7. DCL and TCL commands.
8. Form Design and report generation using PHP/Java/Django
9. Mini Project
Contact Periods:
Lecture: 0 Periods Tutorial: 0 Periods Practical: 45 Periods Total: 45Periods

COURSE OUTCOMES: Bloom’s

Taxonomy
On completion of the course, the students will be able to: Mapped
CO1 Create and Manipulate a database using DDL, DML, DCL and TCL K6
commands
CO2 Implement a database schema for any real world problem with K6
integrity constraints
CO3 Apply PL/SQL constructs for designing stored procedures, functions, K6
cursors, packages and triggers to access database.
CO4 Design and develop a simple application with front end and back end K6
design with report generation.

COURSE ARTICULATION MATRIX :

a) CO and PO Mapping (Times New Roman, Size 11 )
COs/P PO PO PO PO PO PO PO PO PO PO PO PO PS PS PS
Os 1 2 3 4 5 6 7 8 9 10 11 12 O1 O2 O3
CO1 2 3 3 3 3 3 3 3
CO2 2 3 3 3 3 3 3 3
CO3 2 3 3 3 3 3 3 3
CO4 2 3 3 3 3 3 3 3
22SPC 2 3 3 3 3 3 3 3
410
1 – Slight, 2 – Moderate, 3 – Substantial
b) CO and Key Performance Indicators Mapping
CO1 1.3.1,1.4.1, 2.1.1,2.1.2, 2.2.1, 2.2.2, 2.2.3, 2.2.4, 2.3.2, 2.4.2, 2.4.3, 2.4.4, 3.1.2, 3.1.3, 3.1.6,
3.2.1, 3.2.2, 3.2.3, 3.3.1, 3.3.2, 3.4.1, 3.4.2 , 4.1.1, 4.1.2, 4.1.3, 4.1.4, 4.3.1, 4.3.3, 4.3.4, 5.1.1,
5.1.2, 5.2.1, 5.2.2, 5.3.1, 10.1.1, 10.1.2, 10.1.3, 10.3.1, 10.3.2
CO2 1.3.1,1.4.1, 2.1.1,2.1.2, 2.2.1, 2.2.2, 2.2.3, 2.2.4, 2.3.2, 2.4.2, 2.4.3, 2.4.4, 3.1.2, 3.1.3, 3.1.6,
3.2.1, 3.2.2, 3.2.3, 3.3.1, 3.3.2, 3.4.1, 3.4.2 , 4.1.1, 4.1.2, 4.1.3, 4.1.4, 4.3.1, 4.3.3, 4.3.4, 5.1.1,
5.1.2, 5.2.1, 5.2.2, 5.3.1, 10.1.1, 10.1.2, 10.1.3, 10.3.1, 10.3.2
CO3 1.3.1,1.4.1, 2.1.1,2.1.2, 2.2.1, 2.2.2, 2.2.3, 2.2.4, 2.3.2, 2.4.2, 2.4.3, 2.4.4, 3.1.2, 3.1.3, 3.1.6,
3.2.1, 3.2.2, 3.2.3, 3.3.1, 3.3.2, 3.4.1, 3.4.2 , 4.1.1, 4.1.2, 4.1.3, 4.1.4, 4.3.1, 4.3.3, 4.3.4, 5.1.1,
5.1.2, 5.2.1, 5.2.2, 5.3.1, 10.1.1, 10.1.2, 10.1.3, 10.3.1, 10.3.2
CO4 1.3.1,1.4.1, 2.1.1,2.1.2, 2.2.1, 2.2.2, 2.2.3, 2.2.4, 2.3.2, 2.4.2, 2.4.3, 2.4.4, 3.1.2, 3.1.3, 3.1.6,
3.2.1, 3.2.2, 3.2.3, 3.3.1, 3.3.2, 3.4.1, 3.4.2 , 4.1.1, 4.1.2, 4.1.3, 4.1.4, 4.3.1, 4.3.3, 4.3.4, 5.1.1,
5.1.2, 5.2.1, 5.2.2, 5.3.1, 9.2.1, 9.2.2, 9.2.3, 9.2.4, 9.3.1, 10.1.1, 10.1.2, 10.1.3, 10.3.1, 10.3.2
 22SPC411 SYSTEM PROGRAMMING AND OPERATING
SEMESTER
SYSTEMS LABORATORY
IV

PREREQUISITES CATEGORY L T P C
NIL PC 0 0 3 1.5

Course The objective of the course is to understand the concepts behind the design ofsystem
Objectives software , process management, memory management, storage
management, file management ,protection mechanism and virtual machine.

PRACTICALS
EXERCISES ILLUSTRATING THE FOLLOWING CONCEPTS:

SYSTEM PROGRAMMING
(Experiments should be implemented in C)

1 Design of analysis phase in a two pass assembler

2 Design of synthesis phase in a two pass assembler
3 Design of single pass assembler
4 Design of macro processor
5 Design of linkers and loaders
OPERATING SYSTEMS
(Experiments should be implemented in C++/Java)

6 Implementation of Process synchronization strategy

7 Implementation of process scheduling
8 Implementation deadlock detection algorithm
9 Implementation of paging and Segmentation
10 Implementation of page replacement algorithms
11 Implementation of Disk Scheduling
12 Study on security and protection mechanism in Windows and Linux OS
13 Setting up a Virtual Machine
Contact periods: 45
Lecture: 0 Periods Tutorial: 0 Periods Practical: 45 Periods Total: 45 Periods
 COURSE OUTCOMES: Bloom’s
Taxonomy
On completion of the course, the students will be able to: Mapped
CO1 Simulate system software like single and two pass assemblers,
Macroprocessor , linker and loader K3
CO2 Implement Process synchronization , process scheduling and K6
deadlock detection methods
CO3 Implement to Virtual memory management and Disk management K6
techniques.
CO4 Explore on basic security and protection mechanisms in Windows and K2
Linux OS
CO5 Install and use virtual machine using tools like virtual box K3

COURSE ARTICULATION MATRIX :

a) CO and PO Mapping
COs/POs PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 3 3 2 1 3 2 1 1
CO2 2 3 3 3 1 3 2 2 2 1
CO3 2 3 3 3 1 3 2 2 2 1
CO4 2 3 3 3 1 2 3 2 2 2
CO5 2 3 3 3 3 1 3 3 2 2 2
22SPC4
11 2 3 3 3 1 1 3 2 2 2 1

1 – Slight, 2 – Moderate, 3 – Substantial

b) CO and Key Performance Indicators Mapping
CO1 1.3.1,1.4.1,2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.3.2,2.4.1,2.4.2,2.4.3,2.4.4,3.1.1,3.1.2,3.1.3,3.1.6,3.2.1,3.
2.2,3.2.3,3.3.1,3.3.2,3.4.2,4.1.2,4.1.3,4.1.4,4.3.1,4.3.4, ,5.1.1, 10.1.1,10.1.2,10.1.3,10.2.2,10.3.1,
12.2.1, 12.2.2,12.3.1, 12.3.2
CO2 1.3.1,1.4.1,2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.2.4,2.3.2,2.4.1,2.4.2,2.4.3,2.4.4,3.1.1,3.1.2,3.1.3,3.1.6,3.
2.1,3.2.2,3.2.3,3.3.1,3.3.2,3.4.2,4.1.1,4.1.2,4.1.3,4.1.4,4.2.1,4.2.2,4.3.1,4.3.3,4.3.4, 5.1.1, 10.1.1,10.1.2,
10.1.3,10.2.2, 10.3.1, 12.2.1,12.2.2,12.3.1,12.3.2
CO3 1.3.1,1.4.1,2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.2.4,2.3.2,2.4.1,2.4.2,2.4.3,2.4.4,3.1.1,3.1.2,3.1.3,3.1.6,3.
2.1,3.2.2,3.2.3,3.3.1,3.3.2,3.4.2,4.1.1,4.1.2,4.1.3,4.1.4,4.2.1,4.2.2,4.3.1,4.3.3,4.3.4,5.1.1, 10.1.1,10.1.2,
10.1.3, 10.2.2, 10.3.1 , 12.2.1,12.2.2,12.3.1,12.3.2
CO4 1.3.1,1.4.1,2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.2.4,2.3.2,2.4.1,2.4.2,2.4.3,2.4.4,3.1.1,3.1.2,3.1.3,3.1.6,3.
2.1,3.2.2,3.2.3,3.3.1,3.3.2,3.4.2,4.1.1,4.1.2,4.1.3,4.1.4,4.2.1,4.2.2,4.3.1,4.3.4,7.1.1,7.2.2,5.1.1,
10.1.1,10.1.2 ,10.1.3, 10.2.2,10.3.1, 12.2.1, 12.2.2,12.3.1,12.3.2
CO5 1.3.1,2.1.1,2.1.2,2.1.3,2.2.1,2.2.2,2.2.3,2.3.2,2.4.1,2.4.2,2.4.3,2.4.4,3.1.1,3.1.2,3.1.3,3.1.6,3.2.1,3.2.2,3.
2.3,3.3.1,3.3.2,3.4.2,4.1.1,4.1.2,4.1.3,4.1.4,4.2.1,4.2.2,4.3.1,4.3.4,5.1.1,51.2,5.2.1,5.2.2,5.3.1,5.3.2,7.2.
2,10.1.1,10.1.2,10.1.3,10.2.2,10.3.1,12.1.1,12.2.1,12.2.2,12.3.1,12.3.2