Bansilal Ramnath Agarwal Charitable Trust’s Vishwakarma ... · Trees :Basic terminology,...
Transcript of Bansilal Ramnath Agarwal Charitable Trust’s Vishwakarma ... · Trees :Basic terminology,...
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 1 of 141
Bansilal Ramnath Agarwal Charitable Trust’s
Vishwakarma Institute of Technology (An Autonomous Institute affiliated to Savitribai Phule Pune University)
Structure & Syllabus of
B.Tech. (Computer Engineering)
Pattern ‘B-18’
Effective from Academic Year 2018-19
Prepared by: - Board of Studies in Computer Engineering
Approved by: - Academic Board, Vishwakarma Institute of Technology, Pune
Signed by
Chairman – BOS Chairman – Academic Board
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 2 of 141
Content
Sr. No. Title Page
No.
1 Program Educational Objectives and Program Outcome of B.Tech (Computer
Engineering)
5
2 Course Structure - Module III 8
3 Course Syllabi for Courses - Module III
3.1 CS2001 C1:Data Structures 9
3.2 CS2002 C2:Logic Design and Processors 11
3.3 CS2003 C3:Automata Theory 13
3.4 CS2004 C4: Computer Organization and Architecture 16
3.5 CS2005 Discrete Mathematics 18
3.6 CS2006 EDD1 20
4 Course Structure - Module IV 22
5 Course Syllabi for Courses - Module IV
5.1 CS2007 C5:Advances in Data Structures 23
5.2 CS2008 C6:Operating Systems 25
5.3 CS2009 C7:Database Management Systems 27
5.4 CS2010 C8:Computer Networks 30
5.5 CS2011 Mathematical Transforms & Applications 34
5.6 CS2012 EDD2
36
5.7 CS2099 *PD1
5.8 CS2098
**GP2
6 Course Structure - Module V 38
7 Course Syllabi for Courses - Module V
7.1
CS3001
* Core Elective Group-1 CE1:Software Engineering
40
CS3008 CE1: Software Design Methodologies
44
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 3 of 141
7.2
CS3002
* Core Elective Group-2 CE2:Design Analysis of Algorithms
48
CS3009 Randomized & Approximation Algorithms
51
CS3010 Distributed Algorithms
54 7.3
CS3003 CS3005
**Special Elective Group -1
• SE1:Microprocessors & Microcontrollers
• SE1: Embedded Systems
56
58
CS3007 • SE1: Wireless Communications
7.4 CS3004
**Special Elective Group -2
• SE2: Computer Graphics
60
CS3006 • SE2: Augmented & Virtual Reality
7.5 CS3011 EDD3 63
7.6 CS3095 Seminar
8 Course Structure - Module VI 65
9 Course Syllabi for Courses - Module VI
9.1
CS3012
*Core Elective Group-3
• CE3:Compiler Design
67
CS3016 • CE3: System Programming 70
9.2
*Core Elective Group-4
CS3013 • CE4:Artificial Intelligence 72
CS3019 • CE4: Machine Learning 74
CS3021 • CE4: Neural Networks 76
9.3 **Special Elective Group -3
CS3014 • SE3:Web Technologies 76
CS3017 • SE3:Mobile Computing 78
CS3018 • SE3:Network Security 81
9.4 **Special Elective Group -4
CS3015 • SE4:Data Science 84
CS3020 • SE4:Business Intelligence 86
9.5 CS3022 EDD4 89
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 4 of 141
9.6 CS3094 Summer Training
9.6 CS3097 *PD2 -
9.7 CS3096 **GP3
10 Course Structure - Module VII/ Module VIII 91
11 Course Syllabi for Courses - Module VII/Module VIII
11.1 CS4001 CS4002 CS4013
*Elective Group 1 (OE1)
• Human Computer Interaction
• Enterprise Systems
• Convergence Technologies
94
96
100
11.2 *Elective Group 2 (OE2)
CS4003 • Cloud Computing 103
CS4004 • Parallel Computing 105
CS4011 • Natural Language Processing 108
11.3 *Elective Group 3 (OE-3)
CS4005 • Component-based System Construction 110
CS4006 • Data Mining & Data Warehousing 112
CS4007 • Modelling and Simulation 114
CS4008 • Internet of Things 117 CS4009 • Image Processing 121 CS4010 • Model-based Systems Engineering 123
CS4012 • Genetic Algorithms 126
CS4014 • Software Testing and Quality Assurance 128
CS4015 • Software Architecture and Design 132
CS4016 • Software Design Methodologies 135
11.4 *Major Project (1/2)
CS4000
• Major Project1
CS4099 • Major Project2
11.5 CS4093 **PD3 (Audit Course)
Module VII/ Module VIII 142
CS4098
Semester Internship
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 5 of 141
Program Educational Objectives (PEO)
B.Tech (Computer Engineering) List of Programme Education Objectives [PEO] and Programme Outcomes [PO]
PEO PEO Statement
PEO1 Preparation: Demonstrate application of sound engineering foundations to be a committed technology workforce
PEO2 Core competence: Apply mathematical and computing theory knowledge base to provide realistic computer engineering solutions
PEO3 Breadth: Exhibit problem solving skills and engineering practices to address problems faced by industry with innovative methods, tools and techniques
PEO4 Professionalism: Adopt professional and ethical practices adopting effective guidelines to acquire desired soft skills in societal and global context
PEO5 Learning Environment: Aim for continuing education and entrepreneurship in emerging areas of computing
List of Programme Outcomes [PO] Graduates will be able
PO PO Statement
PO1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering specialization to the solution of complex engineering problems.
PO2 Problem analysis: Identify, formulate, review research literature, and analyze complex engineering problems reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences.
PO3 Design/development of solutions: Design solutions for complex engineering problems and design system components or processes that meet the specified needs with appropriate consideration for the public health and safety, and the cultural, societal, and environmental considerations.
PO4 Conduct investigations of complex problems: Use research-based knowledge and research methods including design of experiments, analysis and interpretation of data, and synthesis of the information to provide valid conclusions.
PO5 Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools including prediction and modeling to complex engineering activities with an understanding of the limitations.
PO6 The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional engineering practice.
PO7 Environment and sustainability: Understand the impact of the professional engineering
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 6 of 141
solutions in societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable development.
PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice.
PO9 Individual and team work: Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary settings.
PO10 Communication: Communicate effectively on complex engineering activities with the engineering community and with society at large, such as, being able to comprehend and write effective reports and design documentation, make effective presentations, and give and receive clear instructions.
PO11 Project management and finance: Demonstrate knowledge and understanding of the engineering and management principles and apply these to one’s own work, as a member and leader in a team, to manage projects and in multidisciplinary environments.
PO12 Life-long learning: Recognize the need for, and have the preparation and ability to engage in independent and life-long learning in the broadest context of technological change.
PSO PSO Statement
PSO1 Select and incorporate appropriate computing theory principles, data structures and algorithms, programming paradigms to innovatively craft scientific solution addressing complex computing problems.
PSO2 Adapt to new frontiers of science, engineering and technology by getting acquainted with heterogeneous computing environments and platforms, computing hardware architectures and organizations through continuous experimentation.
PSO3 Conceive well-formed design specifications and constructs assimilating new design ideas and facts for identified real world problems using relevant development methodologies and practices, architecture styles and design patterns, modeling and simulation, and CASE tools.
PSO4 Exercise research and development aptitude focusing knowledge creation and dissemination through engineering artifacts construction, preparation and presentation of engineering evidences using procedures, techniques, guidelines, and standards considering technology migration and evolution.
Vis
hw
ak
arm
a I
nst
itu
te o
f M
OD
UL
E I
II
Vis
hw
ak
arm
a I
nst
itu
te o
f T
ech
nolo
gy
Issu
e 01 :
Rev
No. 1 :
Dt.
01/0
7/1
8
Str
uct
ure
an
d s
yll
abu
s o
f S
.Y.
B.T
ech
Co
mp
ute
r E
ngin
eeri
ng. P
atte
rn B
-18,
A.Y
. 2
01
8
MO
DU
LE
III
Issu
e 01 :
Rev
No. 1 :
Dt.
01/0
7/1
8
18,
A.Y
. 2
01
8-1
9
Pag
e 7
of
14
1
MO
DU
LE
III
Vis
hw
ak
arm
a I
nst
itu
te o
f
Tit
le:
Cou
rse
Str
uct
ure
Bra
nch
: C
om
pute
r Y
ear:
S.Y
. A
.Y.:
2018
Su
bje
ct
No.
Su
bje
ct
Cod
e S
ub
ject
Na
me
Tea
chin
g S
chem
e
Th
eory
S1
CS
2001
C1:D
ata
Str
uct
ure
s 3
S2
CS
2002
C2:L
ogic
Des
ign a
nd
Pro
cess
ors
3
S3
CS
2003
C3:A
uto
mat
a T
heo
ry
3
S4
CS
2004
C4:
Com
pute
r
Org
aniz
atio
n a
nd
Arc
hit
ectu
re
3
S5
CS
2006
ED
D1
1
S6
CS
2005
Dis
cret
e M
ath
emat
ics
2
T
OT
AL
15
Vis
hw
ak
arm
a I
nst
itu
te o
f T
ech
nolo
gy
Issu
e 01 :
Rev
No. 1 :
Dt.
01/0
7/1
8
Str
uct
ure
an
d s
yll
abu
s o
f S
.Y.
B.T
ech
Co
mp
ute
r E
ngin
eeri
ng. P
atte
rn B
-18,
A.Y
. 2
01
8
Issu
e 1, R
ev. 1 , D
t. 0
1
Tit
le:
Cou
rse
Str
uct
ure
2018
-19 M
od
ule
: II
I
P
att
ern
: B
-18.
1.
Tea
chin
g S
chem
e
(Hrs
/Wee
k)
Exam
inati
on
S
chem
e
Th
eory
L
AB
T
ut.
C
A
MS
E
(%)
HA
(%)
LA
B
(%)
ES
E
(%)
3
4
-
10
30
10
30
3
2
-
10
30
10
30
3
2
-
10
30
10
30
3
- -
10
- 10
60
1
2
2
10
30
10
30
2
-
--
20
- 30
30
15
10
2
Issu
e 01 :
Rev
No. 1 :
Dt.
01/0
7/1
8
18,
A.Y
. 2
01
8-1
9
Pag
e 8
of
14
1
Issu
e 1, R
ev. 1 , D
t. 0
1/0
7/2
018
F
F N
o. 653
Sch
eme
C
red
its
ES
A
Tota
l
ES
E
VIV
A
(%)
20
100
5
20
100
4
20
100
4
20
100
3
20
100
4
20
100
2
22
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS2001
Credits: 5
Section 1: Topics/Contents
Introduction: Types: Primitive, Non primitive, Linear, Nonlinear, Static, Dynamstructures, Pointers in C, Single and Multidimensional arrays: Memory representation and indexing, operations on multidimensional arrays. Time & Space Complexity Analysis. Sorting Techniques: Insertion, Bucket, Merge, Quick and heap sort. Binary seFibonacci search Stack: Fundamentals of stack, representation using array, Applications of stack: Recursion, Validity of parentheses, Expression conversions and evaluations, mazing problem. Queue: Fundamentals of queue, representation using array, Tof Queue: Job Scheduling, Josephus problem etc.Linked Lists: Dynamic memory allocation, Singly Linked Lists, Doubly linked Lists, Circular liked lists, and Generalized linked lists, Applications: Stack & Queue using linked list, Polynomial Manipulation using linked list. Dynamic memory allocation for multidimensional arrays.
Section2: Topics/Contents
Trees :Basic terminology, representation using array and linked list, Tree Traversals: Recursive And Non recursive, counting no of Nodes etc., Construction of binary tree from traversals, Binary Search trees(BST): Insertion, deletion of a node from BST. Threaded Binary tree (TBT): Creation and traversals on TBT, HeiExpression Trees, Gaming TreesGraph: Terminology and representation, Traversals, Connected components and Spanning trees: Prims and Kruskal’s Algorithm, Shortest Paths and Transitive Closures: Single Source All destinations (Dijkstra’s Algorithm), all pair shortest path algorithm, Topological Sort. Hashing techniques: Hash table, Hash functions, and Collision, Cuckoo Hashing, Overflow Handling Evaluation of Overflow techniques. Dynamic Hashing: Motivation for Dynamic Hashing, Dynamic Hashing using Directories, directory less Dynamic Hashing. Bloom Filters Bloom Filter Design, Count Min sketch
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS2001: DATA STRUCTURES
Teaching Scheme: Theory: 3 Hrs / Week
Lab: 4 Hours/Week
Types: Primitive, Non primitive, Linear, Nonlinear, Static, Dynamstructures, Pointers in C, Single and Multidimensional arrays: Memory representation and indexing, operations on multidimensional arrays. Time & Space Complexity Analysis. Sorting Techniques: Insertion, Bucket, Merge, Quick and heap sort. Binary se
Fundamentals of stack, representation using array, Applications of stack: Recursion, Validity of parentheses, Expression conversions and evaluations, mazing
Fundamentals of queue, representation using array, Types of queue, Applications of Queue: Job Scheduling, Josephus problem etc.
Dynamic memory allocation, Singly Linked Lists, Doubly linked Lists, Circular liked lists, and Generalized linked lists, Applications: Stack & Queue using
, Polynomial Manipulation using linked list. Dynamic memory allocation for
Basic terminology, representation using array and linked list, Tree Traversals: Recursive And Non recursive, Operations on binary tree: Finding Height, Leaf nodes, counting no of Nodes etc., Construction of binary tree from traversals, Binary Search trees(BST): Insertion, deletion of a node from BST. Threaded Binary tree (TBT): Creation and traversals on TBT, Height Balanced Tree (AVL): Rotations on AVL tree, Expression Trees, Gaming Trees
Terminology and representation, Traversals, Connected components and Spanning trees: Prims and Kruskal’s Algorithm, Shortest Paths and Transitive Closures:
All destinations (Dijkstra’s Algorithm), all pair shortest path algorithm,
: Hash table, Hash functions, and Collision, Cuckoo Hashing, Overflow Handling Evaluation of Overflow techniques. Dynamic Hashing: Motivation
Dynamic Hashing, Dynamic Hashing using Directories, directory less Dynamic Hashing. Bloom Filters Bloom Filter Design, Count Min sketch
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 9 of 141
FF No. :654
Teaching Scheme: Theory: 3 Hrs / Week
Lab: 4 Hours/Week
Types: Primitive, Non primitive, Linear, Nonlinear, Static, Dynamic Data structures, Pointers in C, Single and Multidimensional arrays: Memory representation and indexing, operations on multidimensional arrays. Time & Space Complexity Analysis. Sorting Techniques: Insertion, Bucket, Merge, Quick and heap sort. Binary search,
Fundamentals of stack, representation using array, Applications of stack: Recursion, Validity of parentheses, Expression conversions and evaluations, mazing
ypes of queue, Applications
Dynamic memory allocation, Singly Linked Lists, Doubly linked Lists, Circular liked lists, and Generalized linked lists, Applications: Stack & Queue using
, Polynomial Manipulation using linked list. Dynamic memory allocation for
Basic terminology, representation using array and linked list, Tree Traversals: Operations on binary tree: Finding Height, Leaf nodes,
counting no of Nodes etc., Construction of binary tree from traversals, Binary Search trees(BST): Insertion, deletion of a node from BST. Threaded Binary tree (TBT):
ght Balanced Tree (AVL): Rotations on AVL tree,
Terminology and representation, Traversals, Connected components and Spanning trees: Prims and Kruskal’s Algorithm, Shortest Paths and Transitive Closures:
All destinations (Dijkstra’s Algorithm), all pair shortest path algorithm,
: Hash table, Hash functions, and Collision, Cuckoo Hashing, Overflow Handling Evaluation of Overflow techniques. Dynamic Hashing: Motivation
Dynamic Hashing, Dynamic Hashing using Directories, directory less Dynamic
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
List of Practicals : (For THL, TLP courses)
1. Assignment based on Sorting and Searching.2. Assignment based on Stack Application3. Assignment based on Queue Application4. Assignment based on different operations on linked list.5. Assignment based on BST operations 6. Assignment Based on TBT operations7. Assignment based on AVL tree8. Assignment based on DFS and BFS9. Assignment based on MST10 Assignment Based on Shortest path problem11 Assignment based on Hashing12 Assignment based on Bloom Filters List of Project areas: (For THP, TLP courses)
1. Job Scheduling 2. String processing 3. Dictionary and Search engines4. Modeling the real world problems using graphs and trees5. Database management system using file strucures and Hashing techniques Text Books: 1. Fundamentals of Data Structures in C”, E. Horwitz , S. Sahani, Anderson
Edition, Universities Press.
2. Data structures using C and C++”, Y. Langsam, M.J. Augenstein, A.M.Tenenbaum, Pearson
Education, Second Edition
Reference Books:
1. An Introduction to data Structures with applications”, J. Tremblay, P. soresan, TMH
Publication, 2nd Edition.2.
Course Outcomes:
The student will be able to – 1. To interpret and diagnose the properties of data structures with their memory
representations and time complexity analysis. 2. To use linear data structures like stacks, queues etc3. To handle operations like searching, insertion, deletion, traversing mechanism etc. on
various data structures with the help of dynamic storage representation. 4. To demonstrate the use of binary tree traversals and to perform vario
non-linear data structures.5. To handle the operations on Graph data structure and to solve the applications of
Graph data structure. 6. To design and analyze the appropriate data structure by applying various hashing
techniques.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
: (For THL, TLP courses)
1. Assignment based on Sorting and Searching. on Stack Application
3. Assignment based on Queue Application 4. Assignment based on different operations on linked list. 5. Assignment based on BST operations 6. Assignment Based on TBT operations 7. Assignment based on AVL tree
S and BFS 9. Assignment based on MST 10 Assignment Based on Shortest path problem 11 Assignment based on Hashing 12 Assignment based on Bloom Filters
List of Project areas: (For THP, TLP courses)
Search engines 4. Modeling the real world problems using graphs and trees 5. Database management system using file strucures and Hashing techniques
1. Fundamentals of Data Structures in C”, E. Horwitz , S. Sahani, Anderson-Freed, Second
Data structures using C and C++”, Y. Langsam, M.J. Augenstein, A.M.Tenenbaum, Pearson
1. An Introduction to data Structures with applications”, J. Tremblay, P. soresan, TMH
To interpret and diagnose the properties of data structures with their memory representations and time complexity analysis. To use linear data structures like stacks, queues etc. with their applicationsTo handle operations like searching, insertion, deletion, traversing mechanism etc. on various data structures with the help of dynamic storage representation. To demonstrate the use of binary tree traversals and to perform various operations on
linear data structures. To handle the operations on Graph data structure and to solve the applications of
To design and analyze the appropriate data structure by applying various hashing
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 10 of 141
5. Database management system using file strucures and Hashing techniques
Freed, Second
Data structures using C and C++”, Y. Langsam, M.J. Augenstein, A.M.Tenenbaum, Pearson
1. An Introduction to data Structures with applications”, J. Tremblay, P. soresan, TMH
To interpret and diagnose the properties of data structures with their memory
. with their applications To handle operations like searching, insertion, deletion, traversing mechanism etc. on
us operations on
To handle the operations on Graph data structure and to solve the applications of
To design and analyze the appropriate data structure by applying various hashing
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS2002: LOGIC DESIGN AND PROCESSORS
Credits: 4
Section 1: Topics/Contents
Combinational Circuit: BCD code, Gray code, Excessbinary adder and Sub-tractor :7483,Multiplexers & Deencoders, Decoders: 74138,ALU: 74181,Parity generator and checker.Sequential Circuit: Introduction of flipJ-K F.F, race around condition, M/S Jtable, flip-flop characteristics, Shift Sequence generator, Sequences detector(Moore and Mealy).Introduction to 8086 microprocessor:address, Minimum & Maximum Mode, Ready and Reset pin significance ,study of 8086 supporting chips 8282(Latch), 8284Controller), Timing Diagram Read Write Machine Cycles, Real Mode.
Section2: Topics/Contents
Interrupts and Interfacing with 8254:service Routine, Interrupt Vector Table, Hardware and Software InterrupInterrupt Response, Execution of an ISR, Priority Interrupts, 8254Interval timer/counter) block diagram, control word & interfacing, Operating Modes of 8254. Interfacing with 8255, 8251:
diagram, control word, Operating Modes of 8255, 8251(USART): Features, Block Diagram, Control & status registers.Introduction of 80386: 80386Register Organization, Segmentation
management through Segmentation, logical to linear/physical address translation.
List of Practical’s: (For THL, TLP courses)
1. Verification of Logical Gates and Boolean Algebra.2. Code converters, e.g. Excess3. Multiplexer - e.g. 16:1 Mux using 4:1 Mux (IC 74153).4. Decoder – e.g. 2 bit comparator (IC 74138).5. Ripple Up/down counter using JK flip flop.6. Synchronous Up /down counter using JK flip7. Sequences detector using JK flip flop.8. Study of 8086 Architecture and Execution of sample programs.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
LOGIC DESIGN AND PROCESSORS
Teaching Scheme: Theory: 3 Hours / Week
Lab: 2 Hours/Week
BCD code, Gray code, Excess-3 code ,Code converter,4 bit tractor :7483,Multiplexers & De-multiplexers, Encoder: Priority
Decoders: 74138,ALU: 74181,Parity generator and checker. Introduction of flip-flop (F.F), 1 bit memory cell, clocked S
K F.F, race around condition, M/S J-K F.F,T F.F,D F.F, flip-flop truth table, excitation flop characteristics, Shift Register, Asynchronous and Synchronous counter,generator, Sequences detector(Moore and Mealy).
uction to 8086 microprocessor: Internal Architecture, Generation of physical address, Minimum & Maximum Mode, Ready and Reset pin significance ,study of 8086 supporting chips 8282(Latch), 8284 (Clock Generator), 8286 (Trans receiver), 8288Controller), Timing Diagram Read Write Machine Cycles, Real Mode.
Interrupts and Interfacing with 8254: Addressing Modes, Interrupt Structure ,Interrupt service Routine, Interrupt Vector Table, Hardware and Software Interrupts, INTR,NMI , Interrupt Response, Execution of an ISR, Priority Interrupts, 8254–(Programmable Interval timer/counter) block diagram, control word & interfacing, Operating Modes of
8251: 8255 (Programmable Peripheral Interface 8255): block diagram, control word, Operating Modes of 8255, 8251(USART): Features, Block Diagram, Control & status registers.
80386– Features and Architecture, 80386 Programming Model: Register Organization, Segmentation- related instructions, descriptors, and memory
management through Segmentation, logical to linear/physical address translation.
: (For THL, TLP courses)
of Logical Gates and Boolean Algebra. Code converters, e.g. Excess-3 to BCD and vice versa using logical gates
e.g. 16:1 Mux using 4:1 Mux (IC 74153). e.g. 2 bit comparator (IC 74138).
Ripple Up/down counter using JK flip flop. Synchronous Up /down counter using JK flip-flop.
s detector using JK flip flop. Study of 8086 Architecture and Execution of sample programs.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 11 of 141
FF No. :654
Teaching Scheme: Theory: 3 Hours / Week
Lab: 2 Hours/Week
code ,Code converter,4 bit multiplexers, Encoder: Priority
ked S-R F.F., flop truth table, excitation
Asynchronous and Synchronous counter,
Internal Architecture, Generation of physical address, Minimum & Maximum Mode, Ready and Reset pin significance ,study of 8086
(Trans receiver), 8288 (Bus
Addressing Modes, Interrupt Structure ,Interrupt ts, INTR,NMI , (Programmable
Interval timer/counter) block diagram, control word & interfacing, Operating Modes of
ce 8255): block diagram, control word, Operating Modes of 8255, 8251(USART): Features, Block
Features and Architecture, 80386 Programming Model: instructions, descriptors, and memory
management through Segmentation, logical to linear/physical address translation.
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
9. Write 8086 ALP to access marks of 5 subjects stored in array and find overall percentage and display grade according to it.10. Write 8086 ALP to perform blocData bytes in a block stored in one array transfer to another array. Use debugger to show execution of program. 11. Write 8086 ALP to perform block transfer operation. (Don’t use string operations) Data bytes in a block stored in one array transfer to another array. Use debugger to show execution of program. 12. Write 8086 ALP to find and count zeros, positive number and negative number from the array of signed number stored in memory and display magnitudenumbers. 13. Write 8086 ALP for following operations on the string entered by the user.
a. String length b. Reverse of the Stringc. Palindrome
Text Books: (As per IEEE format)
1. Douglas Hall, “Microprocessors and Interfacing”,2
Hill Publications, ISBN 0
2. “Advanced 80386, programming techniques ” , James Turley , Tata McGraw Hill
Publications, ISBN –
3. Intel 80386 Programmer's Reference Manual 1986, Intel Corporation, Order no.:
231630- 011, December 1995.4. R.P. Jain, “Modern Digital Electronics,
2003, ISBN 0 - 07 - 049492
Reference Books: (As per IEEE format)
1. Ray Duncan, “Advanced MS DOS Programming,” 2
ISBN 0 – 07 – 048677 2. M. Mano, “Digital Design
81 - 7808 – 555 – 0. 3. A. Malvino, D. Leach,
Tata McGraw Hill, 2003, ISBN 0
Course Outcomes:
The student will be able to – 1. Construct combinational circuits.
2. Design sequential circuits
3. Identify different operating modes of Microprocessor.
4. Design Microprocessor systems
5. Learn peripherals and their interfacing with Microprocessor.
6. Analyze different operating modes of Advance Processor
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Write 8086 ALP to access marks of 5 subjects stored in array and find overall percentage and display grade according to it.
Write 8086 ALP to perform block transfer operation. (Don’t use string operations) Data bytes in a block stored in one array transfer to another array. Use debugger to show
Write 8086 ALP to perform block transfer operation. (Don’t use string operations) ytes in a block stored in one array transfer to another array. Use debugger to show
Write 8086 ALP to find and count zeros, positive number and negative number from the array of signed number stored in memory and display magnitude of negative
Write 8086 ALP for following operations on the string entered by the user.
Reverse of the String
Douglas Hall, “Microprocessors and Interfacing”,2nd
Edition, Tata McGraw
Hill Publications, ISBN 0-07-025742-6.
“Advanced 80386, programming techniques ” , James Turley , Tata McGraw Hill
0-07-881342-5
Intel 80386 Programmer's Reference Manual 1986, Intel Corporation, Order no.:
011, December 1995. Modern Digital Electronics,”3
rdEdition, Tata McGraw-Hill,
049492 – 4.
(As per IEEE format)
Ray Duncan, “Advanced MS DOS Programming,” 2nd
Edition BPB Publications
048677 – 8. Digital Design”, 3
rd Edition, Pearson Education, 2002, ISBN
A. Malvino, D. Leach, “Digital Principles and Applications”, 5
th Edition,
Tata McGraw Hill, 2003, ISBN 0 - 07 - 047258 – 05.
Construct combinational circuits.
Design sequential circuits
Identify different operating modes of Microprocessor.
Design Microprocessor systems using peripheral components.
Learn peripherals and their interfacing with Microprocessor.
Analyze different operating modes of Advance Processor.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 12 of 141
Write 8086 ALP to access marks of 5 subjects stored in array and find overall
k transfer operation. (Don’t use string operations) Data bytes in a block stored in one array transfer to another array. Use debugger to show
Write 8086 ALP to perform block transfer operation. (Don’t use string operations) ytes in a block stored in one array transfer to another array. Use debugger to show
Write 8086 ALP to find and count zeros, positive number and negative number from of negative
Write 8086 ALP for following operations on the string entered by the user.
Edition, Tata McGraw
“Advanced 80386, programming techniques ” , James Turley , Tata McGraw Hill
Intel 80386 Programmer's Reference Manual 1986, Intel Corporation, Order no.:
Hill,
Edition BPB Publications
Edition, Pearson Education, 2002, ISBN -
Edition,
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS2003:
Credits: 4
Section 1: Topics/Contents
Finite Automata: Introduction to Automata, Computability and Complexity theory, Automaton as a model of computation, Central ConcAlphabets, Strings, Languages. Decision Problems Vs Languages. Finite Automata, Structural Representations, Deterministic Finite Automata(DFA)Simplified notation: State transition graph, transition table, Languaconstruction of DFAs for Languages andNondeterministic finite Automata (NFA), NFA with epsilon transition, Language of NFA, Conversion of NFA with epsilon transitions to DFA, Automata with output. Applications and Limitation of Finite AutomataRegular and Non Regular Languages:
Regular expression (RE), Definition, Operators of regular expression and their precedence, Algebraic laws for Regular expressions, Kleene’s Theorem: Equivalence Regular expressions and DFAs, Closure properties of Regular Languages(union, intersection, complementation, concatenation, Kleene clousure), Decision properties of Regular Languages, Applications of Regular expressions Myhillapplications: proving non-regularity, lower bound on number of states of DFA, State Minimization algorithm, Equivalence testing of DFAs. Non Regular Languages, Pumping Lemma for regular Languages.Context Free Grammars (CFG):
Derivation, Languages of CFG, Constructing CFG, correctness proof using induction. Closure properties of CFLs (Union, Concatenation, Kleene clousure, reversal). Derivation trees, Ambiguity in CFGs, Removing ambiguity, Inherent ambiguity. Simplification of CFGs, Normal forms for CFGs: CNF and GNF. Decision Properties of CFLs (Emptiness, Finiteness and Membership). Applications of CFG. Section2: Topics/Contents
Push Down Automata:Description and definition, Language of PDA, Acceptance by Final state, Acceptance by empty stack, Deterministic, NonPDA construction (with proof). Equivalence of PDA and CFG (without proof). Intersection of CFLs and Regular language.Pumping lemma for CFLs, nonDefinition and Examples of Context Sensitive Grammars, Linear Bounded Automata. Chomsky hierarchy. Turing Machines: Basic model, definition and representation, Instantaneous Description, Language acceptance by TM. Robustness of Turing Machine movarious variants: Two-way/One
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS2003: AUTOMATA THEORY
Teaching Scheme: Theory: 3 Hours / Week
Lab: 2 Hours/Week
Introduction to Automata, Computability and Complexity theory, Automaton as a model of computation, Central Concepts of Automata Theory: Alphabets, Strings, Languages. Decision Problems Vs Languages. Finite Automata, Structural Representations, Deterministic Finite Automata(DFA)-Formal Definition, Simplified notation: State transition graph, transition table, Language of DFA, construction of DFAs for Languages and proving correctness, Product construction,Nondeterministic finite Automata (NFA), NFA with epsilon transition, Language of NFA, Conversion of NFA with epsilon transitions to DFA, Automata with output.
lications and Limitation of Finite Automata
Regular and Non Regular Languages: Regular expression (RE), Definition, Operators of regular expression and their precedence, Algebraic laws for Regular expressions, Kleene’s Theorem: Equivalence
ions and DFAs, Closure properties of Regular Languages(union, intersection, complementation, concatenation, Kleene clousure), Decision properties of Regular Languages, Applications of Regular expressions Myhill-Nerode theorem and its
regularity, lower bound on number of states of DFA, State Minimization algorithm, Equivalence testing of DFAs. Non Regular Languages, PumpingLemma for regular Languages.
Context Free Grammars (CFG): Context Free Grammars: Definition, Examples, tion, Languages of CFG, Constructing CFG, correctness proof using induction.
Closure properties of CFLs (Union, Concatenation, Kleene clousure, reversal). Derivation trees, Ambiguity in CFGs, Removing ambiguity, Inherent ambiguity.
Normal forms for CFGs: CNF and GNF. Decision Properties of CFLs (Emptiness, Finiteness and Membership). Applications of CFG.
Description and definition, Language of PDA, Acceptance by ce by empty stack, Deterministic, Non-deterministic PDAs, CFG to
PDA construction (with proof). Equivalence of PDA and CFG (without proof). Intersection of CFLs and Regular language. Pumping lemma for CFLs, non-Context Free Languages, Context Sensitive Definition and Examples of Context Sensitive Grammars, Linear Bounded Automata.
Turing Machines: Basic model, definition and representation, Instantaneous Description, Language acceptance by TM. Robustness of Turing Machine model and equivalence with
way/One-way infinite tape TM, multi-tape TM, non-
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 13 of 141
FF No. :654
Teaching Scheme: Theory: 3 Hours / Week
Lab: 2 Hours/Week
Introduction to Automata, Computability and Complexity theory, epts of Automata Theory:
Alphabets, Strings, Languages. Decision Problems Vs Languages. Finite Automata, Formal Definition,
ge of DFA, proving correctness, Product construction,
Nondeterministic finite Automata (NFA), NFA with epsilon transition, Language of NFA, Conversion of NFA with epsilon transitions to DFA, Automata with output.
Regular expression (RE), Definition, Operators of regular expression and their precedence, Algebraic laws for Regular expressions, Kleene’s Theorem: Equivalence
ions and DFAs, Closure properties of Regular Languages(union, intersection, complementation, concatenation, Kleene clousure), Decision properties of
Nerode theorem and its regularity, lower bound on number of states of DFA, State
Minimization algorithm, Equivalence testing of DFAs. Non Regular Languages, Pumping
Context Free Grammars: Definition, Examples, tion, Languages of CFG, Constructing CFG, correctness proof using induction.
Closure properties of CFLs (Union, Concatenation, Kleene clousure, reversal). Derivation trees, Ambiguity in CFGs, Removing ambiguity, Inherent ambiguity.
Normal forms for CFGs: CNF and GNF. Decision Properties of
Description and definition, Language of PDA, Acceptance by deterministic PDAs, CFG to
PDA construction (with proof). Equivalence of PDA and CFG (without proof).
Context Free Languages, Context Sensitive Languages, Definition and Examples of Context Sensitive Grammars, Linear Bounded Automata.
Turing Machines: Basic model, definition and representation, Instantaneous Description, del and equivalence with
-deterministic
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
TM, Universal Turing Machines. TM as enumerator. Recursive and Recursively Enumerable languages and their Introduction to Undecidability
Church-Turing Thesis and intuitive notion of Algorithm. Introduction to countable and uncountable sets (countability of set of natural numbers, integers, rationals. Uncountability of set of real numbers, points in plane), Encoding for Turing macand countability of set of all Turing machines. languages via Cantor's diagonalization. Undecidability of Halting problem. Examples of undecidable problems: Post Correspondence Problem, Hilbert's 10problem (without proof). Example of Turing unrecognizable language. Decision properties of R, RE languages and Rice’s theorem
List of Practicals: (For THL, TLP courses)
All the assignments will be implemented using Object oriented conc
1. You want to spot duplicate occurrences of a phrase in a document and delete second occurrence. In essence, you want to substitute a sequence in a
2. Does a program contain an assertion violationcertain protocols when interacting with the kernel? The behaviour of a is a set of executions; in other words, a language. The correctness another language. The program correctness problem amounts to a inclusion check.
3. Can your software be stuck in an infinite loop? Does a distributed algorithm contain a livelock? We need languages over infinite words, but the language inclusion view still applies.
4. You want to build a sanitizer to detect maliciousapplication. The set of malicious strings is a language. The set of strings into the forms in another language. You want to determine if the of these languages is non
5. Run-time monitoring of reactive design a software monitor that oversees the operation of your chemical process or track updates to a financial database. These are at heart language inclusion and intersection problems.
6. Pattern recognition with its numerous applications. You want to detect patterns in genomic data, in text, in a series of bug reports. These are problems where we are given words from an unknown language and have to guess the language. These are language inference problems
7. Given a set of XML documents, you want to reverse engineer a schema that applies to these documents. XML documents can be idealised a trees. A is then a specification of a tree language and the schema inference language inference problem over tree languages.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
TM, Universal Turing Machines. TM as enumerator. Recursive and Recursively Enumerable languages and their closure properties.
cidability
Turing Thesis and intuitive notion of Algorithm. Introduction to countable and uncountable sets (countability of set of natural numbers, integers, rationals. Uncountability of set of real numbers, points in plane), Encoding for Turing macand countability of set of all Turing machines. Existence of Turing unrecognizable languages via Cantor's diagonalization. Undecidability of Halting problem. Examples of undecidable problems: Post Correspondence Problem, Hilbert's 10th Problem, Tiling problem (without proof). Example of Turing unrecognizable language. Decision properties of R, RE languages and Rice’s theorem
List of Practicals: (For THL, TLP courses)
All the assignments will be implemented using Object oriented concepts in Java
ou want to spot duplicate occurrences of a phrase in a document and delete second occurrence. In essence, you want to substitute a sequence in a language.
2. Does a program contain an assertion violation? Does a device driver rcertain protocols when interacting with the kernel? The behaviour of a is a set of executions; in other words, a language. The correctness property is another language. The program correctness problem amounts to a language
3. Can your software be stuck in an infinite loop? Does a distributed algorithm contain a livelock? We need languages over infinite words, but the language inclusion view still applies.
4. You want to build a sanitizer to detect malicious Javascript entered into a web application. The set of malicious strings is a language. The set of strings nto the forms in another language. You want to determine if the intersection
of these languages is non-empty.
time monitoring of reactive and mission-critical systems. You want to design a software monitor that oversees the operation of your chemical process or track updates to a financial database. These are at heart language inclusion and intersection problems.
with its numerous applications. You want to detect patterns in genomic data, in text, in a series of bug reports. These are problems where we are given words from an unknown language and have to guess the language. These are language inference problems.
Given a set of XML documents, you want to reverse engineer a schema that applies to these documents. XML documents can be idealised a trees. A is then a specification of a tree language and the schema inference problem is a
rence problem over tree languages.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 14 of 141
TM, Universal Turing Machines. TM as enumerator. Recursive and Recursively
Turing Thesis and intuitive notion of Algorithm. Introduction to countable and uncountable sets (countability of set of natural numbers, integers, rationals. Uncountability of set of real numbers, points in plane), Encoding for Turing machines
of Turing unrecognizable languages via Cantor's diagonalization. Undecidability of Halting problem. Examples of
Problem, Tiling problem (without proof). Example of Turing unrecognizable language. Decision
epts in Java
ou want to spot duplicate occurrences of a phrase in a document and delete the language.
? Does a device driver respect certain protocols when interacting with the kernel? The behaviour of a program
property is language
3. Can your software be stuck in an infinite loop? Does a distributed algorithm contain a livelock? We need languages over infinite words, but the language
entered into a web application. The set of malicious strings is a language. The set of strings entered
intersection
critical systems. You want to design a software monitor that oversees the operation of your chemical process or track updates to a financial database. These are at heart language inclusion
with its numerous applications. You want to detect patterns in genomic data, in text, in a series of bug reports. These are problems where we are given words from an unknown language and have to guess the
Given a set of XML documents, you want to reverse engineer a schema that applies to these documents. XML documents can be idealised a trees. A schema
problem is a
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
8. Many applications require automated arithmetic reasoning. Suppose we fix a logical theory such as Presburger arithmetic, in which we have the natural numbers, addition and the less represents a set of n-dimensional vectors. A vector is a sequence of digits and can be encoded as a word. A predicate is then a set of words; a language. Logical operations such a intersection, union and complement of languages (existential quantification is a kind of projection). 9. Write a interpreter with the help of Context free grammar10. Design a parser using deterministic
Text Books: (As per IEEE format)
1. Hopcroft J, Motwani R, Ullman, Addison
Languages and Computation”, Second
2. Michael Sipser, Course Technology, “Introduction
ISBN-10: 053494728X.
Reference Books: (As per IEEE format)
1. J. Martin, “Introduction to Languages and the Theory of Computation”, Third edition, Tata
McGraw-Hill, ISBN 0-07- 049939
2. Java: The Complete Reference, Herbert Schildt, TMG Publication, ISBN
7th Edition
Course Outcomes:
The student will be able to – 1. Infer the applicability of various automata theoretic models for recognizing formal languages. 2. Discriminate the expressive powers of various automata theoretic and formal language theoretic computational models.3. Illustrate significance of non determinism pertaining to expressive powers of various automata theoretic models. 4. Comprehend general purpose powers and machines and grammars. 5. Explain the relevance of ChurchTuring machine model with the general purpose computers.6. Grasp the theoretical limit of computation (indevia the concept of undecidability
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Many applications require automated arithmetic reasoning. Suppose we fix a logical theory such as Presburger arithmetic, in which we have the natural numbers, addition and the less-than predicate. A formula with n variables
dimensional vectors. A vector is a sequence of digits and can be encoded as a word. A predicate is then a set of words; a language. Logical operations such as conjunction, disjunction and negation become intersection, union and complement of languages (existential quantification is
Write a interpreter with the help of Context free grammar. 10. Design a parser using deterministic push down automata.
Text Books: (As per IEEE format)
Hopcroft J, Motwani R, Ullman, Addison-Wesley, “Introduction to Automata Theory,
Languages and Computation”, Second Edition, ISBN 81-7808-347-7.
2. Michael Sipser, Course Technology, “Introduction to Theory of Computation”, Third Edition,
Reference Books: (As per IEEE format)
. J. Martin, “Introduction to Languages and the Theory of Computation”, Third edition, Tata
049939-x, 2003.
e Reference, Herbert Schildt, TMG Publication, ISBN 9780070636774 ,
nfer the applicability of various automata theoretic models for recognizing formal
sive powers of various automata theoretic and formal language theoretic computational models.
llustrate significance of non determinism pertaining to expressive powers of various
omprehend general purpose powers and computability issues related to state
xplain the relevance of Church-Turing thesis, and the computational equivalence of Turing machine model with the general purpose computers.
rasp the theoretical limit of computation (independent of software or hardware used) via the concept of undecidability.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 15 of 141
Many applications require automated arithmetic reasoning. Suppose we fix a logical theory such as Presburger arithmetic, in which we have the natural
than predicate. A formula with n variables dimensional vectors. A vector is a sequence of digits and
can be encoded as a word. A predicate is then a set of words; a language. s conjunction, disjunction and negation become
intersection, union and complement of languages (existential quantification is
Wesley, “Introduction to Automata Theory,
to Theory of Computation”, Third Edition,
. J. Martin, “Introduction to Languages and the Theory of Computation”, Third edition, Tata
9780070636774 ,
nfer the applicability of various automata theoretic models for recognizing formal
sive powers of various automata theoretic and formal language
llustrate significance of non determinism pertaining to expressive powers of various
computability issues related to state
Turing thesis, and the computational equivalence of
hardware used)
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS2004: COMPUTER ORGANIZATION AND ARCHITECTURE
Credits: 3
Section 1: Topics/Contents
Computer Evolution
Organization & Architecture, Structure & Function, Neumann Architecture, Integer Representation, Integer Arithmetic 2’s Complement arithmetic, multiplication, Booth’s Algorithm, Division Restoring Algorithm, Non Restoring algorithm Processor Design &Control Unit
CPU Architecture, Register Organization, Instruction types, Instruction formats, addressing modeProcessors: RISC- Features, CISC Features, Comparison of RISC & CISC Superscalar Processors. Pipelining, Pipelining hazards. Fundamental Concepts: Single Bus CPU organization, Regarithmetic/ logic operations, fetching a word from memory, storing a word in memory, Execution of a complete instruction. MicroMultiplier CU. Micro-programmed Control: Microinstructionsequencing: Sequencing techniques, Microorganization.
Section2: Topics/Contents
Memory Organization
Hierarchical memory system, Characteristics, Main Memory Organization: ROM, RAM, EPROM, E2PROM, DRAM, Design of DRAM, Cache memory Organization: Address mapping, Replacement Algorithms, Cache Coherence. Virtual Memory: Translation Virtual to Physical, Parallel Processing
Necessity of high performance, ConstUniprocessor system, Evolution of parallel processors, Architectural Classification, Flynn’s, Classification, Multiprocessors architecture basics. Performance considerations : Amdahl’s law,performance Memory Organization of Parallel Computers
Distributed Memory Organization, Shared Memory Organization, Reducing memory access times, Thread-Level ParallelismConsumption of Processors, Multicore Processors, Architecture of Multicore Processors. Case study - Architecture of the Intel Core i7
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
COMPUTER ORGANIZATION AND ARCHITECTURE
Teaching Scheme: 3hrs /
Organization & Architecture, Structure & Function, and Brief History of computers, Von Neumann Architecture, Integer Representation, Integer Arithmetic 2’s Complement
multiplication, Booth’s Algorithm, Division Restoring Algorithm, Non
Control Unit
CPU Architecture, Register Organization, Instruction types, Types of operands, Instruction formats, addressing modes and address translation. Instruction cycles. RISC
Features, CISC Features, Comparison of RISC & CISC Superscalar Processors. Pipelining, Pipelining hazards. Case study of Processor. Fundamental Concepts: Single Bus CPU organization, Register transfers, Performing an arithmetic/ logic operations, fetching a word from memory, storing a word in memory, Execution of a complete instruction. Micro-operations, Hardwired Control, Example
programmed Control: Microinstructions, Microinstructionsequencing: Sequencing techniques, Micro-program sequencing, Multi Bus CPU
Hierarchical memory system, Characteristics, Main Memory Organization: ROM, RAM, PROM, DRAM, Design of DRAM, Cache memory Organization: Address
mapping, Replacement Algorithms, Cache Coherence. Virtual Memory: Translation Virtual to Physical, Segmentation, Paging.
Necessity of high performance, Constraints of conventional architecture, Parallelism in Uniprocessor system, Evolution of parallel processors, Architectural Classification, Flynn’s, Classification, Multiprocessors architecture basics. Performance considerations : Amdahl’s law,performance indications. Memory Organization of Parallel Computers
Distributed Memory Organization, Shared Memory Organization, Reducing memory Level Parallelism-Simultaneous Multithreading, Energy
onsumption of Processors, Multicore Processors, Architecture of Multicore Processors. Architecture of the Intel Core i7
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 16 of 141
FF No. :654 COMPUTER ORGANIZATION AND ARCHITECTURE
Teaching Scheme: 3hrs /Week
and Brief History of computers, Von Neumann Architecture, Integer Representation, Integer Arithmetic 2’s Complement
multiplication, Booth’s Algorithm, Division Restoring Algorithm, Non
Types of operands, s and address translation. Instruction cycles. RISC
Features, CISC Features, Comparison of RISC & CISC Superscalar
ister transfers, Performing an arithmetic/ logic operations, fetching a word from memory, storing a word in memory,
operations, Hardwired Control, Example- s, Microinstruction-
program sequencing, Multi Bus CPU
Hierarchical memory system, Characteristics, Main Memory Organization: ROM, RAM, PROM, DRAM, Design of DRAM, Cache memory Organization: Address
mapping, Replacement Algorithms, Cache Coherence. Virtual Memory: Address
raints of conventional architecture, Parallelism in Uniprocessor system, Evolution of parallel processors, Architectural Classification, Flynn’s, Classification, Multiprocessors architecture basics. Performance considerations
Memory Organization of Parallel Computers
Distributed Memory Organization, Shared Memory Organization, Reducing memory Simultaneous Multithreading, Energy
onsumption of Processors, Multicore Processors, Architecture of Multicore Processors.
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Text Books: (As per IEEE format)
1. William Stallings, “Computer Organization and Architecture: Designing for
7th Edition, Pearson Prentice Hall Publication, ISBN 81
2. C. Hamacher, V. Zvonko, S. Zaky, “Computer Organization”, 5
Publication, ISBN 007-120411-
3. Kai Hwang, "Advanced Computer Architecture", Ta
Reference Books: (As per IEEE format)
1. Hwang and Briggs,“Computer Architecture and Parallel Processing”, Tata McGraw Hill
Publication ISBN 13: 9780070315563.
2. A. Tanenbaum, “Structured Computer Organization”, Prentice
203 – 1553 – 7, 4th Edition.
Course Outcomes:
The student will be able to – 1. Understand the structure, function and characteristics of computer systems.
2. Describe the working of Central Processing Unit and RISC and CISC
3. Explore the knowledge about Control Unit Design.
4. Design memory with due consideration of tradeoffs and performance issues.
5. Analyze a pipeline for consistent execution of instructions with minimum hazards.
6. Acquaint the advanced concepts of
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
William Stallings, “Computer Organization and Architecture: Designing for Performance”,
Edition, Pearson Prentice Hall Publication, ISBN 81-7758-9 93-8.
2. C. Hamacher, V. Zvonko, S. Zaky, “Computer Organization”, 5th Edition, Tata McGraw Hill
-3.
3. Kai Hwang, "Advanced Computer Architecture", Tata McGraw-Hill ISBN 0-07-113342
(As per IEEE format)
Hwang and Briggs,“Computer Architecture and Parallel Processing”, Tata McGraw Hill
Publication ISBN 13: 9780070315563.
2. A. Tanenbaum, “Structured Computer Organization”, Prentice Hall Publication, ISBN 81
Understand the structure, function and characteristics of computer systems.
Describe the working of Central Processing Unit and RISC and CISC Architecture.
Explore the knowledge about Control Unit Design.
Design memory with due consideration of tradeoffs and performance issues.
Analyze a pipeline for consistent execution of instructions with minimum hazards.
Acquaint the advanced concepts of computer architecture.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 17 of 141
Performance”,
Edition, Tata McGraw Hill
113342-9
Hwang and Briggs,“Computer Architecture and Parallel Processing”, Tata McGraw Hill
Hall Publication, ISBN 81 –
Understand the structure, function and characteristics of computer systems.
Architecture.
Design memory with due consideration of tradeoffs and performance issues.
Analyze a pipeline for consistent execution of instructions with minimum hazards.
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS2005:
Credits: 02
Section 1: Topics/Contents
Propositional Logic, Applications of Propositional Logic, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference, Sets, Set Operations, Cardinality of Sets, Countable, Uncountable sets, Important Functions, RelationsEquivalence Relations, Partitions of a setchains, Hasse Diagram, Lattices, Topological Sorting Basic Counting Principles:
Permutation and Combination, Binomial Identities, principle, Ramsey theory, Mathematical Induction Section2: Topics/Contents
Sequences and Summation, RecurrenSolving Linear and non linearSolving recurrence relations via generating functions Graph Theory: Basic terminology of graphs, Types, Matrix representatGraph Models, Subgraphs, Representation of graphs,graphs, Eulerian graphs and a characterizationindependent sets. Connectivity,
graphs, Dual graph, graph coloring, Trees, Rooted Trees, Applications of Trees
Text Books: (As per IEEE format)
1. Discrete Mathematics and its applications with combinatorics and graph theory, by
Kenneth H Rosen. Special Indian Edition
2. Introduction to Graph Theory, 2nd Edition, by Douglas B West. Eastern Economy
Edition published by PHI Learning Pvt Ltd.
3. Discrete Mathematics, 2nd Edition, by Norman L Biggs. Indian Edition published by
Oxford University Press.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS2005: DISCRETE MATHEMATICS
Teaching Scheme: 2 Hours / Week
Propositional Logic, Applications of Propositional Logic, Propositional Equivalences, Quantifiers, Nested Quantifiers, Rules of Inference, Sets, Set Operations,
Cardinality of Sets, Countable, Uncountable sets, Russell's paradox, Functions,Relations, n-ary relations, Their Properties, Matrix Representation,
artitions of a set, Lexicographic order, Posets, chains, antiHasse Diagram, Lattices, Topological Sorting
Basic Counting Principles: Sum rule and Product rule, Inclusion-Exclusion Principle, Permutation and Combination, Binomial Identities, Pascal's triangle,
, Mathematical Induction
Sequences and Summation, Recurrence relations, Modeling with Recurrence Relationsand non linear Recurrence Relations, Solving recurrence relations
Solving recurrence relations via generating functions
Basic terminology of graphs, Types, Matrix representations, Representation of graphs, Konigsberg bridge problem, Eulerian
Eulerian graphs and a characterization, Graph isomorphism, Connectivity, connected components, cut edges, cut vertices, Planar
graphs, Dual graph, graph coloring, Trees, Rooted Trees, Applications of Trees
Discrete Mathematics and its applications with combinatorics and graph theory, by
Kenneth H Rosen. Special Indian Edition published by Tata McGraw-Hill.
Introduction to Graph Theory, 2nd Edition, by Douglas B West. Eastern Economy
Edition published by PHI Learning Pvt Ltd.
Discrete Mathematics, 2nd Edition, by Norman L Biggs. Indian Edition published by
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 18 of 141
FF No. :654
Teaching Scheme: 2 Hours / Week
Propositional Equivalences, Quantifiers, Nested Quantifiers, Rules of Inference, Sets, Set Operations,
unctions, Some ir Properties, Matrix Representation,
osets, chains, anti-
Exclusion Principle, , Pigeon-hole
ith Recurrence Relations, Solving recurrence relations,
ions, Graphs and
Konigsberg bridge problem, Eulerian cliques and
vertices, Planar graphs, Dual graph, graph coloring, Trees, Rooted Trees, Applications of Trees
Discrete Mathematics and its applications with combinatorics and graph theory, by
Hill.
Introduction to Graph Theory, 2nd Edition, by Douglas B West. Eastern Economy
Discrete Mathematics, 2nd Edition, by Norman L Biggs. Indian Edition published by
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Reference Books: (As per IEEE format)
1. “Applied Combinatorics” by Alan Tucker (Wiley Publishing company)
2. “Combinatorics: Topics, techniques, algorithms” by Peter J. Cameron (Cambridge
University Press)
3. Graph Theory by Reinhard Diestel (Springer Verlag
4. Introduction to Graph Theory by Douglas B. West ( Prentice
Course Outcomes:
The student will be able to – 2. Reason mathematically about elementary discrete structures
relations, sets, graphs, and 3. Describe the elementary properties of modular arithmetic
Computer Science like cryptography.4. Summarize graph theory fundamentals and their applications5. Develop recurrence relations fo6. Express mathematical properties via the formal language of propositional and
predicate logic 7. Demonstrate use of pigeon
elegant and important problems
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
(As per IEEE format)
“Applied Combinatorics” by Alan Tucker (Wiley Publishing company)
“Combinatorics: Topics, techniques, algorithms” by Peter J. Cameron (Cambridge
Graph Theory by Reinhard Diestel (Springer Verlag Publishing Company)
Introduction to Graph Theory by Douglas B. West ( Prentice-Hall publishers)
Reason mathematically about elementary discrete structures (such as functions, relations, sets, graphs, and trees) used in computer algorithms and systemsDescribe the elementary properties of modular arithmetic and their applications in Computer Science like cryptography. Summarize graph theory fundamentals and their applications Develop recurrence relations for a wide variety of interesting problems Express mathematical properties via the formal language of propositional and
Demonstrate use of pigeon-hole and inclusion-exclusion principle in solving elegant and important problems.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 19 of 141
“Combinatorics: Topics, techniques, algorithms” by Peter J. Cameron (Cambridge
Publishing Company)
Hall publishers)
(such as functions, trees) used in computer algorithms and systems
and their applications in
r a wide variety of interesting problems Express mathematical properties via the formal language of propositional and
exclusion principle in solving
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Credits: 04
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS2006: EDD1
Teaching Scheme Theory: 1 Hours / Week
Lab: 2 Hours / Week
Tutorial: 2 Hours / Week
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 20 of 141
Teaching Scheme Theory: 1 Hours / Week
Lab: 2 Hours / Week
Tutorial: 2 Hours / Week
Vis
hw
ak
arm
a I
nst
itu
te o
f T
ech
nolo
gy
,Pu
ne
S
tru
ctu
re a
nd
syll
abu
s o
f S
.Y.
B.T
ech
Co
mp
ute
r E
ngin
eeri
ng. P
atte
rn B
-18,
A.Y
. 2
01
8-1
9
Pag
e 2
1 o
f 1
41
M
OD
UL
E I
V
Vis
hw
ak
arm
a I
nst
itu
te o
f T
ech
nolo
gy
,Pu
ne
S
tru
ctu
re a
nd
syll
abu
s o
f S
.Y.
B.T
ech
Co
mp
ute
r E
ngin
eeri
ng. P
atte
rn B
-18,
A.Y
. 2
01
8-1
9
Pag
e 2
2 o
f 1
41
Issu
e 1, R
ev. 1 , D
t. 0
1/0
7/2
018
Tit
le:
Cou
rse
Str
uct
ure
F
F N
o. 653
Bra
nch
: C
om
pute
r Y
ear:
S.Y
. A
.Y.:
2018
-19 M
od
ule
: IV
P
att
ern
: B
-18.
8
.
Su
bje
ct
No.
Su
bje
ct
Cod
e S
ub
ject
Na
me
Tea
chin
g S
chem
e
(Hrs
/Wee
k)
Exam
inati
on
S
chem
e
C
red
its
Th
eory
L
AB
T
ut.
C
A
MS
E
(%)
ES
A
Tota
l
H
A
(%)
LA
B
(%)
ES
E
(%)
VIV
A
(%)
S1
CS
2007
C5:A
dvan
ces
in D
ata
Str
uct
ure
s 3
2
-
10
30
10
30
20
100
4
S2
CS
2008
C6:O
per
atin
g S
yst
ems
3
2
-
10
30
10
30
20
100
4
S3
CS
2009
C7:D
atab
ase
Man
agem
ent
Syst
ems
3
2
-
10
30
10
30
20
100
4
S4
CS
2010
C8:C
om
pute
r N
etw
ork
s 3
2
-
10
30
10
30
20
100
4
S5
CS
2012
ED
D2
1
2
2
10
30
10
30
20
100
4
S6
CS
2011
Mat
hem
atic
al
Tra
nsf
orm
s &
A
ppli
cati
ons
2
-
--
20
- 30
30
20
100
2
S7
CS
2099
*P
D1
-
T
OT
AL
15
10
2
22
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 23 of 141
FF No. :654
CS2007: ADVANCES IN DATA STRUCTURES
Credits: 4 Teaching Scheme: Theory: 3 Hours / Week
Lab: 2 Hours/Week
Section 1: Topics/Contents
Advanced Trees and Applications: Red-Black Trees, van Emde Boas tree, Fusion tree, Dynamic Finger Search Trees, B Trees and B+ Trees, Splay trees. Priority Queues and Applications: Amortized Analysis, Double Ended Priority queues, Leftist Trees, Binomial Heaps, Fibonacci Heaps, skew heaps, pairing heaps. Data Structures for Strings: String Searching: preliminaries, the DAWG, the position Heaps, tries and compressed tries, Suffix Trees and suffix arrays , Dictionaries Allowing Errors in Queries.
Section2: Topics/Contents
Randomized Data Structures: Preliminaries of randomized algorithm and probability theory, Skip Lists: Structural Properties of Skip Lists, Space Complexity of skip list. Treap: A Randomized Binary Search Tree. Spatial Data Structures: Multidimensional Spatial Data Structures: introduction, point data, region data, Rectangle data. Quad trees and Octrees: Quad trees for point data, spatial queries with region quad tree. Interval trees, Segment trees, Range trees, and Priority Search Trees. Binary Space Partitioning Trees, R-trees. Miscellaneous Data Structures: Google's Big Table, Data Structures for Sets: The Disjoint Set Union-Find Problem, concurrent Data structures, Succinct Representation of Data Structures: Bit vector, Succinct Dictionaries, Tree Representations. Persistent data structures. Cache-Oblivious Data Structures.
List of Practical’s:
1. Assignment based on operations on RED-Black trees and van Emde Boas trees. 2. Assignment based on B Trees and B+ Trees, 3. Assignment based on Priority Queues Application 4. Assignment based on tries. 5. Assignment based on Suffix Trees. 6. Assignment Based on Randomized Data Structures. 7. Assignment based on Quad trees and Oct trees 8. Assignment based on Interval trees, Segment trees, Range trees 9. Assignment based on R-trees 10 Assignment Based on Disjoint Set data structures.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 24 of 141
11 Assignment based on concurrent data structures. 12 Assignment based on Succinct data structures. List of Project areas:
1. Job Scheduling 2. String processing 3. Dictionary and Search engines 4. Modeling the real world problems using graphs and trees 5. Applications of B trees and B+ trees in Database management system 6. GIS 7. Image processing. 8. Internet routing 9. Computational biology 10. Computational geometry. 11. Data Mining. Text Books: 1. Sartaj Sahni, Dinesh P. Mehta; Handbook of Data Structures and Applications; 2
ndedition,
Chapman & Hall/CRC.
2. Fundamentals of Data Structures in C”, E. Horwitz, S. Sahani, Anderson-Freed, Second
Edition, Universities Press.
Reference Books:
1. T. Cormen, R.Rivest, C. Stein, C. Leiserson, “Introduction to Algorithms”, Second Edition,
PHI publication.
2. Peter Brass, Advanced Data Structures, First Edition, Cambridge University Press
Course Outcomes:
The student will be able to – 1. Model the real world problem with the help of appropriate tree data structure.
2. Analyze the amortized time complexity by applying suitable priority queue data
structure.
3. Comprehend and select the storage pattern for strings processing application.
4. Apply randomized data structures for real world problems.
5. Design suitable spatial data structure for the geometric problems.
6. Analyze the problem solutions based on state of the art Data structure representation.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 25 of 141
FF No. :654 CS2008: OPERATING SYSTEMS
Credits: 04 Teaching Scheme Theory :3 Hours / Week
Lab :2 Hours / Week
Section 1: Topics/Contents
Introduction to OS: What is OS, Interaction of OS and hardware, Goals of OS, Basic functions of OS, OS Services, System Calls, Types of system calls Types of OS: Batch, Multiprogramming, Time sharing, Parallel, Distributed & Real-time OS. Structures of OS: Monolithic, Layered, Virtualization-Virtual Machines, Microkernels Introduction to Mobile OS: Architecture & Overview of Android OS. Process Management: Shell: Linux commands, OS shell, Shell programming. Processes: Process Concept, Process States: 2, 5, 7 state models, Process Description, Process Control. Threads: Multithreading models, Thread implementations – user level and kernel level threads, Symmetric Multiprocessing. Concurrency: Issues with concurrency, Principles of Concurrency Mutual Exclusion: H/W approaches, S/W approach, OS/Programming Language support: Semaphores, Mutex and Monitors. Classical Problems of Synchronization: Readers-Writers problem, Producer Consumer problem, Dining Philosopher problem Process Scheduling: Uniprocessor Scheduling: Scheduling Criteria, Types of Scheduling: Preemptive, Non-preemptive, Long-term, Medium-term, Short-term. Scheduling Algorithms: FCFS, SJF, RR, Priority. Multiprocessor Scheduling: Granularity, Design Issues, Process Scheduling. Thread Scheduling, Real Time Scheduling.
Section2: Topics/Contents
Deadlocks: Principles of deadlock, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Deadlock Recovery Memory Management: Memory Management concepts: Memory Management requirements, Memory Partitioning: Fixed, Dynamic Partitioning, Buddy Systems, Fragmentation, Paging, Segmentation, Address translation. Placement Strategies: First Fit, Best Fit, Next Fit and Worst Fit. Virtual Memory: Concepts, Swapping, VM with Paging, Page Table Structure, Inverted Page Table, Translation Lookaside Buffer, Page Size, VM with Segmentation,VM with combined paging and segmentation.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 26 of 141
Page Replacement Policies: FIFO, LRU, Optimal, Clock. Swapping issues: Thrashing I/O and File Management: I/O management: I/O Devices - Types, Characteristics of devices, OS design issues for I/O management, I/O Buffering. Disk Scheduling: FCFS, SCAN, C-SCAN, SSTF. File Management: Concepts, File Organization, File Directories, File Sharing. Record Blocking, Secondary Storage Management, Free Space management, Security. Case study: Windows 7: Design Principles, Process Management, Scheduling, Memory Management, I/O Management and File Management List of Project areas:
1. Linux based application using Shell Scripting and POSIX threads. 2. Design and implementation of a Multiprogramming Operating System: Stage I
i. CPU/ Machine Simulation ii. Supervisor Call through interrupt
3. Design and implementation of a Multiprogramming Operating System: Stage II 1. Paging 2. Error Handling 3. Interrupt Generation and Servicing 4. Process Data Structure
Text Books:
1. Stalling William; “Operating Systems”, 6th
Edition, Pearson Education.
2. Silberschatz A., Galvin P., Gagne G.; “Operating System Concepts”, 9th
Edition, John
Wiley and Sons.
Reference Books:
1. Silberschatz A., Galvin P., Gagne G ; “Operating System Principles”; 7th
Edition,
John Wiley and Sons.
2. Yashavant Kanetkar; “Unix Shell Programming”, 2nd
Edition, BPB Publications.
3. Forouzan B. A., Gilberg R. F.; “Unix And Shell Programming”, 1st Edition, Australia
Thomson Brooks Cole.
4. Achyut S. Godbole , Atul Kahate; “Operating Systems”, 3rd
Edition, McGraw Hill.
Course Outcomes:
The student will be able to – 1. Examine the functions of a contemporary Operating system with respect to convenience, efficiency and the ability to evolve. 2. Demonstrate knowledge in applying system software and tools available in modern operating system (such as threads, system calls, semaphores, etc.) for software development. 3. Apply various CPU scheduling algorithms to construct solutions to real world problems. 4. Identify the mechanisms to deal with Deadlock. 5. Understand the organization of memory and memory management hardware. 6. Analyze I/O and file management techniques for better utilization of secondary memory.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 27 of 141
FF No. :654 CS2009: DATABASE MANAGEMENT SYSTEMS
Credits: 04 Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Section 1: Topics/Contents
Introduction: Need of Database Management System, Evolution, Data Abstraction, Data Independence, Database System Architecture of DBMS, Life cycle of relational database; Data Models: Entity Relationship (ER) Model, Extended ER Model, Relational Model, Codd's Rules; Database Design: Need of Normalization, Functional Dependency, Inference Rules, FD Closure, Minimal Cover, Decomposition Properties, Normal Forms (up to BCNF), Multi-valued Dependency, 4NF, Relational Synthesis Algorithm, Trade – off Query Languages: Relational Algebra, Tuple Relational Calculus, Domain Relational Calculus; SQL: DDL, DML, Select Queries, Join Queries, Sub queries, Date-Timestamp, String and Numerical Functions, DCL-Security and Authorization; PL/SQL: Procedure, Function, Trigger; Mapping of Relational Algebra to SQL
Section2: Topics/Contents
Storage and Querying: Storage and File structures, Indexed Files, Single Level and Multi Level Indexes, B+ Trees; Query Processing: Steps, Algorithms for Selection, Join Operation; Query Optimization: Transformation of Relational Expressions, Heuristics in Query Optimization, Selectivity and Cost Estimates in Query Optimization Transaction Management: Transaction: ACID Properties, State diagram, Lock based Concurrency Control Protocols, Timestamp based Concurrency Control Protocol, Log based Recovery techniques, ARIES Recovery algorithm Database Architectures: Centralized and Client-Server Architectures, 2 Tier and 3 Tier Architecture, Distributed Databases, Parallel Databases Emerging Database Technologies: Introduction to No SQL Databases- Internet Databases, Cloud Databases, Mobile Databases, SQLite Database, XML Databases, MongoDB. Data Warehouse and Data mining: Architecture and Components of Data Warehouse, OLAP, Goals of Data Mining, Data Mining Tasks
List of Practicals:
1. Choose a database system and perform requirements analysis. Design an entity-relationship (ER) data model for the selected database system and convert it to relational model. Create tables with appropriate constraints using DDL and write DML. 2. Execute "SELECT" queries using conditional, logical, like/not like, in/not in, between...and, is null/is not null operators in where clause, order by, group by, aggregate
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 28 of 141
functions, having clause, and set operators. Use SQL single row functions for date, time, string etc. 3. Write equijoin, non equijoin, self join and outer join queries. Write queries containing single row / multiple row / correlated sub queries using operators like =, in, any, all, exists etc. Write DML queries containing sub queries. Study a set of query processing strategies. 4. Write meaningful stored procedures in PL/SQL. Make use of cursors and different arguments. Write useful stored functions to perform complex computation. Write row level and statement level triggers in PL/SQL. 5. Execute DDL statements which demonstrate the use of views. Try to update the base table using its corresponding view. Also consider restrictions on updatable views and perform view creation from multiple tables. 6. Install and configure client and server for MySQL and MongoDB (Show all commands and necessary steps for installation and configuration). 7. Create a database with suitable example using MongoDB and implement Inserting and saving document (batch insert, insert validation), Removing document, Updating document (document replacement, using modifiers, upserts, updating multiple documents, returning updated documents) 8. Execute at least 10 queries on any suitable MongoDB database that demonstrates following querying techniques: find and findOne (specific values), Query criteria (Query conditionals, OR queries, $not, Conditional semantics), Type-specific queries (Null, Regular expression, Querying arrays) 9. Execute at least 10 queries on any suitable MongoDB database that demonstrates following: $ where queries, Cursors (Limits, skips, sorts, advanced query options), Database commands 10. Implement Map reduce concept with suitable example using MongoDB. Text Books: 1. Abraham Silberschatz, Henry F. Korth, S. Sudarshan; “Database System Concepts”;
6th
Edition, McGraw-Hill Education
2. Ramez Elmasri, Shamkant B. Navathe; “Fundamentals of Database Systems”; 6th
Edition; Pearson
Reference Books: 1. Thomas M. Connolly, Carolyn E. Begg,” Database Systems: A Practical Approach to
Design, Implementation, and Management, 6th
Edition; Pearson
2. Raghu Ramakrishnan, Johannes Gehrke; “Database Management Systems”, 3rd
Edition; McGraw Hill Education
3. Kristina Chodorow, MongoDB The definitive guide, O’Reilly Publications, ISBN: 978-
93-5110-269-4, 2nd Edition.
4. Dr. P. S. Deshpande, SQL and PL/SQL for Oracle 10g Black Book, DreamTech.
5. Ivan Bayross, SQL, PL/SQL: The Programming Language of Oracle, BPB Publication.
6. Reese G., Yarger R., King T., Williums H, Managing and Using MySQL, Shroff
Publishers and Distributors Pvt. Ltd., ISBN: 81 - 7366 - 465 – X, 2nd Edition.
7. Dalton Patrik, SQL Server – Black Book, DreamTech Press.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 29 of 141
8. Eric Redmond, Jim Wilson, Seven databases in seven weeks, SPD, ISBN: 978-93-5023-
918-6.
9. Jay Kreibich, Using SQLite, SPD, ISBN: 978-93-5110-934-1, 1st edition.
Course Outcomes:
The student will be able to – 1. Design data models as per data requirements of an organization 2. Synthesize a relational data model upto a suitable normal form 3. Develop a database system using relational queries and PL/SQL objects 4. Apply indexing techniques and query optimization strategies 5. Understand importance of concurrency control and recovery techniques 6. Adapt to emerging trends considering societal requirements
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 30 of 141
FF No. :654
CS2010: COMPUTER NETWORKS
Credits: 4 Teaching Scheme:Theory:3 Hours / Week
Lab:2 Hours / Week
Section 1: Topics/Contents
Physical Layer: Introduction: LAN, MAN, WAN, PAN. Reference Models: OSI, TCP/IP. Design Issues: OSI Model and Layers. Network Architectures: Client-Server; Peer To Peer. Network Types: Infrastructure and Ad-hoc mode. Transmission Methods: Broadcasts, Point-To-Point. Transmission Mediums: CAT5, 5e, 6, OFC. Network Topologies: Star, Ring and Hierarchical. Network Devices: Bridge, Switch, Modem, Router and Access Point. Logical Link Control: Design Issues: Services to Network Layer, Framing, Error Control and Flow Control. Error Control: Parity Bits, Hamming Codes and CRC. Flow Control Protocols: Unrestricted Simplex, Stop and Wait, Sliding Window Protocol, CSMA/CD, WAN Connectivity: PPP and HDLC, Examples on Network Performance, Ethernet To Wireless and Vice Versa. Medium Access Control: Channel Allocation: Static and Dynamic, Multiple Access Protocols: Pure and Slotted ALOHA, CSMA, WDMA. IEEE 802.3 Standard: Ethernet, Wiring Schemes and Frame Formats, CSMA/CD, Binary Exponential Back -off Algorithm. High Speed Standards: Fast Ethernet, Gigabit Ethernet Wireless Standards: Radio Spectrum, Frequency Hopping (FHSS) and Direct Sequence (DSSS), IEEE 802.11a/b/g/n and IEEE 802.15 and IEEE 802.16 Standards, CSMA/CA
Section2: Topics/Contents
Network Layer: Switching Techniques: Circuit, Message and Packet Switching. Logical Addressing: IPv4 and IPv6 is addressing, Sub-netting, NAT, CIDR. Network Layer Protocols: IP, ICMP, Routing Protocols: Distance Vector, Link State, and Path Vector. Routing in Internet: RIP, OSPF and BGP. MANET: AODV and DSR Protocol. Congestion Control and QoS, Sensor Node. Transport Layer: Services: Berkley Sockets, Addressing, Connection Establishment, Connection Release, Flow control and Buffering, Multiplexing. HTH Layer Protocols: TCP, TCP Timer management, UDP. Quality of Service: TCP Congestion Control. Traffic Shaping: AIMD. Application Layer: Address Resolution: Domain Name System (DNS). WWW: Hyper Text Transfer Protocol (HTTP) and HTTPS with SSL. Web Service. Email: SMTP, MIME, POP3 and Webmail. File Transfer: FTP, Dynamic Logical Addressing: Dynamic Host Control Protocol (DHCP).
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 31 of 141
List of Practicals:
Operating System recommended :- 64-bit Open source Linux or its derivative Programming tools recommended: - Open Source C,C++, JAVA, PYTHON, Programming tool like G++/GCC, Wireshark, Etheral and Packet Tracer
Operating System recommended: - 64-bit Open source Linux or its derivative
Programming tools recommended: - Open Source C, C++, JAVA, and PYTHON, Programming tool like G++ /GCC, Wireshark, Ethereal and Packet Tracer
1. Setting Up Small Network:
Setup a wired LAN using Layer 2 Switch and then IP switch of minimum four
computers. It includes preparation of cable, testing of cable using line tester,
configuration machine using IP addresses, test it using PING utility and capture the
packets using Wireshark Packet Analyzer Tool. Extend the same Assignment for
Wireless using Access Point
2. Understanding Data Link Layer Design Issues.
Write a program to configure RS232D ports on two nodes to demonstrate Framing, Flow control and Error control at data link layer. 3. Error Detecting Codes:
Write a program to simulate Cyclic Redundancy Check using polynomial method. 4. Error Correcting Codes:
Write a program to simulate error detection and correction for 7/8 bits ASCII and 4- Check bits using Hamming Codes. 5. Sliding Window Protocol:
Write a program to simulate Go back N and Selective Repeat Modes of Sliding Window Protocol in peer to peer mode using RS232D and capture the packets between client and server using Wireshark Packet Analyzer Tool for peer to peer mode. 6. TCP Socket Programming using Single Thread
Write a program using TCP sockets for following a. Say Hello to Each other
b. File transfer
c. Calculator
Capture the packets between client and server using Wireshark Packet Analyzer Tool for peer to peer mode.
7. UDP Socket Programming using Single Thread
Write a program using UDP Sockets to enable file transfer (Script, Text, Audio and Video one file each) between two machines. Capture the packets between client and server using Wireshark Packet Analyzer Tool for peer to peer mode.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 32 of 141
8. Understanding protocol stack of Intranet
Analyze packet formats of Ethernet, IP, TCP and UDP captured through Wireshark for wired network. 9. Distance Vector Routing Protocol
Write a program to find shortest path using Bellman Ford Equation for Distance Vector Routing Protocol which is used by Routing Information Protocol (RIP). 10. Link State Routing Protocol
Write a program to find shortest path using Dijkstra Equation for Link State Routing
Protocol which is used by Open Shortest Path First Protocol (OSPF) in the Internet. 11. Preparation of TCP, IP Packets (Demo Assignment)
Write a program to prepare TCP and UDP packets using header files and send the packets to destination machine in peer to peer mode. Demonstrate the packets captured traces using Wireshark Packet Analyzer Tool for peer to peer mode. Project Areas:
1. TCP based Multithreaded HTTP client server
2. TCP based Multithreaded FTP client server
3. UDP based Multithreaded TFTP client server
4. TCP based Multithreaded SMTP and POP3 mail client server
5. TCP based Multithreaded Chat client server
6. UDP based Multithreaded Chat client server
7. UDP based Multithreaded Audio Conferencing client server
8. UDP based Multithreaded Video Conferencing client server
9. Implementation of RIP/OSPF/BGP using Packet Tracer
10. Simulation of AODV routing protocol using NS2/NS3/OMNet
Text Books: 1. Andrew S. Tenenbaum, “Computer Networks”,5th Edition, PHI, ISBN 81-203-2175-8.
2. Fourauzan B., "Data Communications and Networking", 5th edition, Tata McGraw- Hill,
Publications, 2006
Reference Books: 1. Kurose, Ross “Computer Networking a Top Down Approach Featuring the Internet”,
Pearson; 6th edition (March 5, 2012), ISBN-10: 0132856204
2. Matthew S. Gast “802.11 Wireless Networks”, O’Reilly publications; 2nd
Edition.
3. C. Siva Ram Murthy and B. S. Manoj, “Ad Hoc Wireless Networks: Architectures and
Protocols” Prentice Hall, 2004
4. Holger Karl and Andreas Willig, “Protocols and Architectures for Wireless Sensor Networks”,
Wiley, ISBN: 0-470-09510-5
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 33 of 141
Course Outcomes:
The student will be able to – 1. Select network architecture, topology and essential components to design computer
networks. 2. Estimate reliability issues based on error control, flow control and pipelining by using
bandwidth, latency, throughput and efficiency. 3. Design mechanisms to demonstrate server channel allocation in wired and wireless
computer networks 4. Analyze data flow between peer to peer in an IP network using Application, Transport
and Network Layer Protocols 5. Demonstrate sustainable engineering practice indicating the scientific purpose and
utility of communication frameworks and standards.
6. Develop Client-Server architectures and prototypes by the means of correct standards, protocols and technologies
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 34 of 141
FF No. :654
CS2011: MATHEMATICAL TRANSFORMS AND APPLICATIONS
Credits: 2 Teaching Scheme: 2 Hours / Week
Section 1: Topics/Contents
Linear Differential equations of higher order: Homogeneous Linear Differential Equations of Second Order, Higher Order Homogeneous & Non Homogeneous Linear Differential Equations with Constant Coefficients, Complementary solution, particular integral by general method, undetermined coefficients and Variation of Parameters method, Euler – Cauchy Equation, Legendre equation and its solution, system of differential equations by matrix method. Complex Analysis: Complex differentiation, Analytical functions, Cauchy-Riemann equations, Complex Integration, Cauchy’s Integral Theorem and formula, Residue Theorem and applications to Engineering Problems, Power series, Taylor series, Laurent series, Radius of convergence. Laplace Transform: Introduction to Laplace Transform and its properties. Laplace Transform of Unit step function, Delta function and periodic function. Inverse Laplace Transform and its evaluation. Laplace Transform of special functions
Section2: Topics/Contents
Fourier Transform: Introduction to signals and their properties, mathematical operations on signals, Complex Fourier series and frequency spectrum, Fourier integrals, Fourier cosine and sine transforms, Fourier transforms, properties of Fourier transform, Discrete Fourier transform, Properties Applications of FT and DFT. Z Transform: Introduction to Z Transform, Standard Z transforms, Region of Convergence, properties of Z-Transform, Convolution Theorem for Z transform Inverse Z-Transform by Partial Fraction, Use of standard transform, Inversion Integral Method, Poles and Zeros of the Rational Z-Transform, Difference equations by Z transform method. Text Books:
1. “Advanced Engineering Mathematics”, Erwin Kreyszig, John Wiley and sons, inc.
2. “Higher Engineering Mathematics”, B V Ramana, Tata McGraw-Hill, 2007.
3. “Advanced Engineering Mathematics”, R.K. Jain, S.R.K. Iyengar, Narosa
Publications.
4. “Signals and Systems”, Alan V. Oppenheim (Author), Alan S. Willsky ; 2nd
edition,
Pearson Education Ltd.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 35 of 141
Reference Books:
1. Michael D. Greenberg; Advanced Engineering Mathematics; Pearson
Education Asia
2. Dennis G. Zill, Michael R. Cullen; Advanced Engineering Mathematics;
Narosa Publishing House
3. Peter V. O’Neil; Advanced Engineering Mathematics; 5th edition, Thomson
Brooks/Cole.
4. Robert A. Gabel, Richard A. Roberts; Signals and linear systems; John Wiley
& sons
Course Outcomes:
The student will be able to – 1. Relate the indispensible importance of Mathematics in Engineering and symbiosis
between both. 2. Summarize the concepts of mathematical transforms and their applications to
various engineering problems 3. Develop the ability to solve linear differential equations with constant coefficients
and apply it for analysis of electrical circuits. 4. Describe the basic concepts of complex differentiation and integration and their
application in mathematical and engineering problems. 5. Utilize Z transform and its properties in solving difference equations and system
analysis. 6. Translate a physical problem into a mathematical model and find solution of the
model by selecting and applying suitable mathematical method
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 36 of 141
CS2012: EDD2
Credits: 04 Teaching Scheme Theory: 1 Hours / Week
Lab: 2 Hours / Week
Tutorial: 2 Hours / Week
Vis
hw
ak
arm
a I
nst
itu
te o
f F
F N
o. 653
M
OD
UL
E
Vis
hw
ak
arm
a I
nst
itu
te o
f T
ech
nolo
gy
Issu
e 01 :
Rev
No. 1 :
Dt.
01/0
7/1
8
Str
uct
ure
an
d s
yll
abu
s o
f S
.Y.
B.T
ech
Co
mp
ute
r E
ngin
eeri
ng. P
atte
rn B
-18,
A.Y
. 2
01
8
Is
sue
4, R
ev. 1 , D
t. 1
6
MO
DU
LE
V
Issu
e 01 :
Rev
No. 1 :
Dt.
01/0
7/1
8
18,
A.Y
. 2
01
8-1
9
Pag
e 3
7 o
f 1
41
Issu
e 4, R
ev. 1 , D
t. 1
6/0
3/2
016
V
Vis
hw
ak
arm
a I
nst
itu
te o
f
Tit
le:
Cou
rse
Str
uct
ure
Bra
nch
: C
om
pute
r Y
ear:
T.Y
. A
.Y.:
2018
Su
bje
ct
No.
Su
bje
ct
Cod
e S
ub
ject
Na
me
S1
CS
3001
C
S3008
* C
ore
Ele
ctiv
e G
roup-1
C
E1:S
oft
war
e E
ngin
eeri
ng
CE
1:
Soft
war
e D
esig
n
Met
hodolo
gie
s
S2
CS
3002
CS
3009
CS
3010
* C
ore
Ele
ctiv
e G
roup-2
C
E2:
Des
ign A
nal
ysi
s of
Alg
ori
thm
. C
E2:
Ran
dom
ized
&
Appro
xim
atio
n A
lgori
thm
s C
E2:
Dis
trib
ute
d A
lgori
thm
s
Vis
hw
ak
arm
a I
nst
itu
te o
f T
ech
nolo
gy
Issu
e 01 :
Rev
No. 1 :
Dt.
01/0
7/1
8
Str
uct
ure
an
d s
yll
abu
s o
f S
.Y.
B.T
ech
Co
mp
ute
r E
ngin
eeri
ng. P
atte
rn B
-18,
A.Y
. 2
01
8
Issu
e 1, R
ev. 1 , D
t. 0
1
Tit
le:
Cou
rse
Str
uct
ure
2018-1
9 M
od
ule
: V
P
att
ern
: B
-18.
1.
Tea
chin
g S
chem
e
(Hrs
/Wee
k)
Exam
inati
on
S
chem
e
Th
eory
L
AB
T
ut.
C
A
MS
E
(%)
H
A
(%)
LA
B
(%)
ES
E
(%)
3
2
-
10
30
10
30
3
2
-
10
30
10
30
Issu
e 01 :
Rev
No. 1 :
Dt.
01/0
7/1
8
18,
A.Y
. 2
01
8-1
9
Pag
e 3
8 o
f 1
41
Issu
e 1, R
ev. 1 , D
t. 0
1/0
7/2
018
F
F N
o. 653
Sch
eme
C
red
its
ES
A
Tota
l
ES
E
(%)
VIV
A
(%)
30
20
100
4
30
20
100
4
Vis
hw
ak
arm
a I
nst
itu
te o
f
S
3
CS
3003
CS
3005
CS
3007
**S
pec
ial
Ele
ctiv
e G
rou
p -
1
SE
1:M
icro
pro
cess
ors
&
Mic
roco
ntr
oll
ers
SE
1:
Em
bed
ded
Syst
ems
SE
1:
Wir
eles
s C
om
mu
nic
atio
ns
S4
CS
3004
CS
3006
**S
pec
ial
Ele
ctiv
e G
rou
p -
2
SE
2:C
om
pute
r G
raphic
s S
E2:A
ugm
ente
d &
Vir
tual
R
eali
ty
S5
CS
3011
ED
D3
S6
CS
3095
Sem
inar
T
OT
AL
Vis
hw
ak
arm
a I
nst
itu
te o
f T
ech
nolo
gy
Issu
e 01 :
Rev
No. 1 :
Dt.
01/0
7/1
8
Str
uct
ure
an
d s
yll
abu
s o
f S
.Y.
B.T
ech
Co
mp
ute
r E
ngin
eeri
ng. P
atte
rn B
-18,
A.Y
. 2
01
8
3
2
-
10
30
10
30
3
2
-
10
30
10
30
1
2
2
10
30
10
30
- -
--
-
- -
13
10
2
Issu
e 01 :
Rev
No. 1 :
Dt.
01/0
7/1
8
18,
A.Y
. 2
01
8-1
9
Pag
e 3
9 o
f 1
41
30
20
100
4
30
20
100
4
30
20
100
4
- -
- 1
21
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS 3001: SOFTWARE ENGINEERING
Credits: 04
Section 1: Topics/Contents
Software Engineering Paradigms
Process Framework, Process Patterns, Personal and Team Process Models, Process Models: Code-and-Fix, Waterfall Model, Rapid Application Development, Incremental Models, Evolutionary Models, Iterative Development, The Unified Process, Cleanroom Methodology, Component-Based SoOutcomes, Process Selection and applicability, Software Engineering Principles and Practices Component-Assembly Process Model, Best Practices in Technology Selection, Formal Methods Requirement Engineering: Requirements Engineering Tasks, Requirement Elicitation Techniques, Software Requirements: Functional, Nonactivities, Requirements Characteristics and Characterization, Eliminating Requirement Ambiguities, Conflict IdentifSpecification, Requirement Traceability, Requirement Prioritization, Relationship of Requirement Engineering to other Framework Activities, System Scope Determination and Feasibility Study, StatemeValidation, Requirement Maturity, Technical Reviews, Stakeholder ManagementIntroduction to Agile Methodology
History and the Agile Manifesto, Agile RequiScrum Overview, Scrum Framework, Agile Principles, Sprints Design, TimeKanban, and Theory of Constraints, Requirements and User Stories, Stakeholders, User Personas, and User Experiences, Product Backlog,Velocity, Product Backlog, Technical Debt
Section2:Topics/Contents
Agile: Scrum and Sprints: Stakeholders, System Acceptability, Levels of Abstractions, System Interfaces, Organizational Roles and Missions, Problem, Solution Spaces, System Environment and Mission Analysis, System Operational Model, Agile Roles: Product Owner, Scrum Master, Development Team, Development Team, Managers, Agile Planning: Scrum Planning Principles, Multilevel Planning, PortPlanning, Envisioning (Product Planning), Release Planning (LongerSprinting: Sprint Planning, Sprint Execution, Sprint Review, Sprint Retrospective, Agile Architecture and Re-architecting with Flow, Agile Methods: Lean Software Development, DSDM, Extreme Programming, TDD, Ux Methodology, Lean Development
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS 3001: SOFTWARE ENGINEERING
Teaching Scheme: Theory 3 Hou
: Lab 2 Hours / Week
Software Engineering Paradigms: Overview of Software Engineering, Software Process Patterns, Personal and Team Process Models, Process
Fix, Waterfall Model, Rapid Application Development, Incremental Models, Evolutionary Models, Iterative Development, The Unified Process, Cleanroom
Based Software Engineering, CMMI, Impact of Processes and Outcomes, Process Selection and applicability, Software Engineering Principles and
Assembly Process Model, Best Practices in Technology Selection,
: Requirements Engineering Tasks, Requirement Elicitation Techniques, Software Requirements: Functional, Non-Functional, Domain Engineering activities, Requirements Characteristics and Characterization, Eliminating Requirement Ambiguities, Conflict Identification and Resolution, Requirement Qualities, Requirement Specification, Requirement Traceability, Requirement Prioritization, Relationship of Requirement Engineering to other Framework Activities, System Scope Determination and Feasibility Study, Statement of Work Generation, Requirements Verification and Validation, Requirement Maturity, Technical Reviews, Stakeholder ManagementIntroduction to Agile Methodology: Introduction to Agile Project Management, Agile History and the Agile Manifesto, Agile Requirements: Team, Program, Portfolio Level, Scrum Overview, Scrum Framework, Agile Principles, Sprints Design, TimeKanban, and Theory of Constraints, Requirements and User Stories, Stakeholders, User Personas, and User Experiences, Product Backlog, Agile Planning, Estimation and Velocity, Product Backlog, Technical Debt
: Stakeholders, System Acceptability, Levels of Abstractions, System Interfaces, Organizational Roles and Missions, Problem, Opportunity and Solution Spaces, System Environment and Mission Analysis, System Operational Model, Agile Roles: Product Owner, Scrum Master, Development Team, Development Team, Managers, Agile Planning: Scrum Planning Principles, Multilevel Planning, PortPlanning, Envisioning (Product Planning), Release Planning (Longer-Term Planning) Sprinting: Sprint Planning, Sprint Execution, Sprint Review, Sprint Retrospective, Agile
architecting with Flow, Agile Methods: Lean Software pment, DSDM, Extreme Programming, TDD, Ux Methodology, Lean
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 40 of 141
FF No. :654
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
: Overview of Software Engineering, Software Process Patterns, Personal and Team Process Models, Process
Fix, Waterfall Model, Rapid Application Development, Incremental Models, Evolutionary Models, Iterative Development, The Unified Process, Cleanroom
ftware Engineering, CMMI, Impact of Processes and Outcomes, Process Selection and applicability, Software Engineering Principles and
Assembly Process Model, Best Practices in Technology Selection,
: Requirements Engineering Tasks, Requirement Elicitation Functional, Domain Engineering
activities, Requirements Characteristics and Characterization, Eliminating Requirement ication and Resolution, Requirement Qualities, Requirement
Specification, Requirement Traceability, Requirement Prioritization, Relationship of Requirement Engineering to other Framework Activities, System Scope Determination
nt of Work Generation, Requirements Verification and Validation, Requirement Maturity, Technical Reviews, Stakeholder Management
: Introduction to Agile Project Management, Agile rements: Team, Program, Portfolio Level,
Scrum Overview, Scrum Framework, Agile Principles, Sprints Design, Time-Boxing, Kanban, and Theory of Constraints, Requirements and User Stories, Stakeholders, User
Agile Planning, Estimation and
: Stakeholders, System Acceptability, Levels of Abstractions, Opportunity and
Solution Spaces, System Environment and Mission Analysis, System Operational Model, Agile Roles: Product Owner, Scrum Master, Development Team, Development Team, Managers, Agile Planning: Scrum Planning Principles, Multilevel Planning, Portfolio
Term Planning) Sprinting: Sprint Planning, Sprint Execution, Sprint Review, Sprint Retrospective, Agile
architecting with Flow, Agile Methods: Lean Software pment, DSDM, Extreme Programming, TDD, Ux Methodology, Lean
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Software Design and Configuration Management
Methods, Analysis Modeling Techniques, Data Flow diagrams, System Analysis Scenarios and Model Generation, CoObject Models, Structured Methods Design Concepts, The Design Model, Design Qualities, Characteristics of Design activities, Design Principles, Cohesion and Coupling, Software Architecture Vs Software DesigInterface Design: Rules, User Interface Analysis and Steps in Interface Design, Design Evaluation, Source Code Management, Build Engineering, Environment Configuration, Change Control, Release Management, DeploymeStandards and Frameworks, CM Values, CM Practices, CM Practices for AgileProject Management Principles
Frameworks, Teamwork, Leadership, Project Planning, Project ScheduliAnalysis, Introduction to Function Points, Empirical Estimation, COCOMO II model, Foundations of Software Testing: Terms, Testing Cycle, Outcomes, Principles,Unit and Acceptance testing, Software Verification and Validation, Classic Mistakes, CompSystems, Critical Systems, Software Safety
List of Practicals: (For THL, TLP courses)
1. A real-world problem issue is required to be identified with manageable scope.
The problem scenarios are required to be identified for target system to be developed. The scenarios are stated in the form of StatementThe SOW document shall address the vision, goals, and objectives of the project.
2. The initial requirements and feature set for the target system is required to be identified. The requireparticipation. The project roles are assigned to the project team with clear indicator of responsibilities. The initial requirements summary document with adequate and minimal infrastructure is requirediterations.
3. A concise requirement specification document is required to be prepared using Agile Requirements Practices with the help of user stories narration, user personas and collaborative communication. The Agile tools lcommunications, Daily standups, and Customer Idea Management shall be practiced.
4. The product backlog project requirements shall be created- It should be dynamic and should be co
progresses. Agile projects generally use an iceberg strategy for grooming the product backlog.
- The items that are near the top of the iceberg and are closest to going into development should get the most attention.
- There should typically be about two to three sprints worth of stories at the top of the backlog that are wellorder to avoid a situation where the project team is waiting for work to do.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Software Design and Configuration Management: Analysis Concepts, Analysis Methods, Analysis Modeling Techniques, Data Flow diagrams, System Analysis Scenarios and Model Generation, Context Models, Behavioral Models, Data Models, Object Models, Structured Methods Design Concepts, The Design Model, Design Qualities, Characteristics of Design activities, Design Principles, Cohesion and Coupling, Software Architecture Vs Software Design, Software Reuse, Design Heuristics, User Interface Design: Rules, User Interface Analysis and Steps in Interface Design, Design Evaluation, Source Code Management, Build Engineering, Environment Configuration, Change Control, Release Management, Deployment, Hardware Configuration, Industry Standards and Frameworks, CM Values, CM Practices, CM Practices for AgileProject Management Principles: Project Management Activities, Structures and Frameworks, Teamwork, Leadership, Project Planning, Project ScheduliAnalysis, Introduction to Function Points, Empirical Estimation, COCOMO II model, Foundations of Software Testing: Terms, Testing Cycle, Outcomes, Principles,Unit and Acceptance testing, Software Verification and Validation, Classic Mistakes, CompSystems, Critical Systems, Software Safety
List of Practicals: (For THL, TLP courses)
world problem issue is required to be identified with manageable scope. The problem scenarios are required to be identified for target system to be
d. The scenarios are stated in the form of Statement-of-Work template. The SOW document shall address the vision, goals, and objectives of the project.The initial requirements and feature set for the target system is required to be identified. The requirements are required to be synthesized with stakeholder participation. The project roles are assigned to the project team with clear indicator of responsibilities. The initial requirements summary document with adequate and minimal infrastructure is required to be developed using multiple
A concise requirement specification document is required to be prepared using Agile Requirements Practices with the help of user stories narration, user personas and collaborative communication. The Agile tools like Facecommunications, Daily standups, and Customer Idea Management shall be
The product backlog for the project aimed at maintaining a prioritized queue of shall be created.
It should be dynamic and should be continuously groomed as the project progresses. Agile projects generally use an iceberg strategy for grooming the
The items that are near the top of the iceberg and are closest to going into development should get the most attention.
should typically be about two to three sprints worth of stories at the top of the backlog that are well-groomed and ready to go into development in order to avoid a situation where the project team is waiting for work to do.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 41 of 141
: Analysis Concepts, Analysis Methods, Analysis Modeling Techniques, Data Flow diagrams, System Analysis
ntext Models, Behavioral Models, Data Models, Object Models, Structured Methods Design Concepts, The Design Model, Design Qualities, Characteristics of Design activities, Design Principles, Cohesion and Coupling,
n, Software Reuse, Design Heuristics, User Interface Design: Rules, User Interface Analysis and Steps in Interface Design, Design Evaluation, Source Code Management, Build Engineering, Environment Configuration,
nt, Hardware Configuration, Industry Standards and Frameworks, CM Values, CM Practices, CM Practices for Agile
: Project Management Activities, Structures and Frameworks, Teamwork, Leadership, Project Planning, Project Scheduling, Risk Analysis, Introduction to Function Points, Empirical Estimation, COCOMO II model, Foundations of Software Testing: Terms, Testing Cycle, Outcomes, Principles,Unit and Acceptance testing, Software Verification and Validation, Classic Mistakes, Complex
world problem issue is required to be identified with manageable scope. The problem scenarios are required to be identified for target system to be
Work template. The SOW document shall address the vision, goals, and objectives of the project. The initial requirements and feature set for the target system is required to be
ments are required to be synthesized with stakeholder participation. The project roles are assigned to the project team with clear indicator of responsibilities. The initial requirements summary document with
to be developed using multiple
A concise requirement specification document is required to be prepared using Agile Requirements Practices with the help of user stories narration, user personas
ike Face-to-face communications, Daily standups, and Customer Idea Management shall be
maintaining a prioritized queue of
ntinuously groomed as the project progresses. Agile projects generally use an iceberg strategy for grooming the
The items that are near the top of the iceberg and are closest to going into
should typically be about two to three sprints worth of stories at the top groomed and ready to go into development in
order to avoid a situation where the project team is waiting for work to do.
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
5. The feasibility of the projecFeasibility Study document mentioning finalized requirement set and dropped feature list along with requirement prioritization and traceability matrix.
6. The project plan of the project shall be preparedindicating level of uncertainty, technology considerations, and related risk nomenclature.
7. Sprint-level planning activity accommodating story points, planning poker shall be performed. The Sprintplanner shall be developed.
8. The Software Configuration Management Plan (SCMP) shall be prepared to establish and maintain the integrity of the products of the software project throughout the project's software life cycle.The SCM prspecific configuration items/units are contained in the key process areas that describe the development and maintenance of each configuration item/unit.- Software configuration management activities are planned.- Selected software work - Changes to identified software work products are controlled.- Affected groups and individuals are informed of the status and content of
software baselines.9. Working software shall be developed by performing
software artifacts created shall be verified and validated using unit/module testing.
10. A Sprint Review document shall be prepared using the Summarize, Demonstrate, Discuss, and Adapt approaches indicatingSprint Review Issues and Sign
Text Books: 1. Ian Sommerville, ‘Software Engineering’, Addison
0137035151.
2. Roger S Pressman,’Software Engineering: A Practitioner's Approach’, McGraw Hill,
6/e,2005
Reference Books :
1. SorenLauesen, Software requirements: Styles and techniques, Addison Wesley, ISBN
0201745704, 2002
2. Kenneth S. Rubin, Essential SCRUM: A Practical Guide To The Most Popular Agile
Process, Addison-Wesley, ISBN
3. Dean Leffingwell, Agile Software Requirement
63584-6, 2011
4. Charles G. Cobb, The Project Manager’s Guide To Mastering Agile: Principles and
Practices for an Adaptive Approach, Wiley Publications, ISBN: 978
(paperback), ISBN 978-1-118
5. Bob Aiello and Leslie Sachs, Configuration Management Best Practices, Addison Wesley,
ISBN-13: 978-0-321-68586
6. Mario E. Moreira, Adapting Configuration Management for Agile Teams, Wiley
Publications, ISBN: 9780470746639, 2010
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
The feasibility of the project shall be prepared and stated in the form of Project Feasibility Study document mentioning finalized requirement set and dropped feature list along with requirement prioritization and traceability matrix. The project plan of the project shall be prepared using Agile Planning Practices indicating level of uncertainty, technology considerations, and related risk
level planning activity accommodating story points, planning poker shall be performed. The Sprint-plan and Sprint-design indicating detailed activity planner shall be developed. The Software Configuration Management Plan (SCMP) shall be prepared to establish and maintain the integrity of the products of the software project throughout the project's software life cycle.The SCM practices identifying specific configuration items/units are contained in the key process areas that describe the development and maintenance of each configuration item/unit.
Software configuration management activities are planned. Selected software work products are identified, controlled, and available.Changes to identified software work products are controlled. Affected groups and individuals are informed of the status and content of software baselines.
Working software shall be developed by performing Sprint Execution. The software artifacts created shall be verified and validated using unit/module
A Sprint Review document shall be prepared using the Summarize, Demonstrate, Discuss, and Adapt approaches indicatingSprint Review Issues and Sign
Ian Sommerville, ‘Software Engineering’, Addison-Wesley, 9th Edition, 2010, ISBN
Roger S Pressman,’Software Engineering: A Practitioner's Approach’, McGraw Hill,
requirements: Styles and techniques, Addison Wesley, ISBN
Kenneth S. Rubin, Essential SCRUM: A Practical Guide To The Most Popular Agile
Wesley, ISBN-13: 978-0-13-704329-3, 2012
Dean Leffingwell, Agile Software Requirements, Addison-Wesley, ISBN-13: 978
Charles G. Cobb, The Project Manager’s Guide To Mastering Agile: Principles and
Practices for an Adaptive Approach, Wiley Publications, ISBN: 978-1-118
118-99177-0 (epdf), 2015
Bob Aiello and Leslie Sachs, Configuration Management Best Practices, Addison Wesley,
68586-5, 2010
Mario E. Moreira, Adapting Configuration Management for Agile Teams, Wiley
Publications, ISBN: 9780470746639, 2010
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 42 of 141
t shall be prepared and stated in the form of Project Feasibility Study document mentioning finalized requirement set and dropped feature list along with requirement prioritization and traceability matrix.
using Agile Planning Practices indicating level of uncertainty, technology considerations, and related risk
level planning activity accommodating story points, planning poker shall cating detailed activity
The Software Configuration Management Plan (SCMP) shall be prepared to establish and maintain the integrity of the products of the software project
actices identifying specific configuration items/units are contained in the key process areas that describe the development and maintenance of each configuration item/unit.
products are identified, controlled, and available.
Affected groups and individuals are informed of the status and content of
Sprint Execution. The software artifacts created shall be verified and validated using unit/module
A Sprint Review document shall be prepared using the Summarize, Demonstrate, Discuss, and Adapt approaches indicatingSprint Review Issues and Sign-offs.
ISBN-13: 978-
Roger S Pressman,’Software Engineering: A Practitioner's Approach’, McGraw Hill,
requirements: Styles and techniques, Addison Wesley, ISBN
Kenneth S. Rubin, Essential SCRUM: A Practical Guide To The Most Popular Agile
13: 978-0-321-
Charles G. Cobb, The Project Manager’s Guide To Mastering Agile: Principles and
118-99104-6
Bob Aiello and Leslie Sachs, Configuration Management Best Practices, Addison Wesley,
Mario E. Moreira, Adapting Configuration Management for Agile Teams, Wiley
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Course Outcomes:
Upon completion of the course, graduates will be able to
1. Summarize capabilities and impact of Software Development Process Models and
justify process maturity through application of Software Engineering principles
and practices focusing tailo
demands of a modern software project.
2. Discriminate competing and feasible system requirements indicating correct real
world problem scope and prepare stepwise system conceptual model using
stakeholder analysis and requirement validation.
3. Formulate system specifications by analyzing User
software artifacts using agile principles, practices and Scrum framework
4. Propose and demonstrate realistic solutions supported by well
documentation with application of agile roles, sprint management, and agile
architecture focusing project backlogs and velocity monitoring.
5. Conform to Configuration Management principles and demonstrate cohesive
teamwork skills avoiding classic mistakes and emp
adhering to relevant standards.
6. Analyze the target system properties and recommend solution alternatives by
practicing project planning, scheduling, estimation and risk management
activities.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Upon completion of the course, graduates will be able to – Summarize capabilities and impact of Software Development Process Models and
justify process maturity through application of Software Engineering principles
and practices focusing tailored processes that best fit the technical and market
demands of a modern software project.
Discriminate competing and feasible system requirements indicating correct real
world problem scope and prepare stepwise system conceptual model using
alysis and requirement validation.
Formulate system specifications by analyzing User-level tasksand compose
software artifacts using agile principles, practices and Scrum framework
Propose and demonstrate realistic solutions supported by well
entation with application of agile roles, sprint management, and agile
architecture focusing project backlogs and velocity monitoring.
Conform to Configuration Management principles and demonstrate cohesive
teamwork skills avoiding classic mistakes and emphasizing on software safety
adhering to relevant standards.
Analyze the target system properties and recommend solution alternatives by
practicing project planning, scheduling, estimation and risk management
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 43 of 141
Summarize capabilities and impact of Software Development Process Models and
justify process maturity through application of Software Engineering principles
red processes that best fit the technical and market
Discriminate competing and feasible system requirements indicating correct real
world problem scope and prepare stepwise system conceptual model using
level tasksand compose
software artifacts using agile principles, practices and Scrum framework
Propose and demonstrate realistic solutions supported by well-formed
entation with application of agile roles, sprint management, and agile
Conform to Configuration Management principles and demonstrate cohesive
hasizing on software safety
Analyze the target system properties and recommend solution alternatives by
practicing project planning, scheduling, estimation and risk management
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS 3008: SOFTWARE DESIGN METHODOLOGIES
Credits: 04
Section 1: Topics/Contents
Business Process Management
Business Processes, Business Process Modeling Foundation, Process Orchestrations, Process Choreographies, Properties of Business Processes, Business Management Architectures, Business Process Methodology, Introduction to BPEL, Advantages of business modeling, Business process modeling methods, Discovery, analysis, design, validation, and implementation Modeling types, Definition of business area-BPM metadata, Importance of the BPMN standards ,Business process modeling standards, Flow objects, Connecting objects, Swimlanes, Artifacts, Steps in BPMsSystem Behavior Specification
Components, Use Case Diagram, Actor Generalization, Include and Extend, Template for Use Case Narrative, Building Domain Model, and capturing system behavior in use casesDynamic Behavior: Sequence diagrams, object lifelines and message types, Modeling collections multiobjects, Refining sequence diagrams, Collaboration diagrams, States, events and actions, Nested machines and concurrency, Modifying the object model to facilitate states, Modeling methods with activity diagrams, Activity Diagrams: Decisions and Merges, Synchronization, Iteration, Partitions, Parameters and Pins, Expansion Regions, Swimlanes, concurrency and synchronization, Communication Diagram, Interaction Overview Diagrams, Timing DiagramsSoftware Architecture Primitives
Architectures, Architectural Design: Software Architecture, Data Design and Architectural Design, Views, Viewpoints, Perspectives, Conceptual Architecture View, Module Architecture View, Execution Architecture View, Code Architecture View, Architecture styles: Repository, Layered, PipeSubscribe, Client-Server, Two
Section2:Topics/Contents
System Design Specification
Cohesion and Coupling between Objects, Coupling and Visibility, Interfaces, Interfaces with Ball and Socket Notation, Templates, Analysis model vs. design model classes, Categorizing classes: entity, boundary and control , Modeling associatcollections, Preserving referential integrity, Achieving reusability, Reuse through delegation, Identifying and using service packages, Improving reuse with design Packages and interfaces: Distinguishing between classes/interfaces, Exposing class package interfaces, Subscribing to interfaces Component and deployment diagrams:
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
3008: SOFTWARE DESIGN METHODOLOGIES
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Business Process Management: Introduction to Business modeling, Introduction to Business Processes, Business Process Modeling Foundation, Process Orchestrations, Process Choreographies, Properties of Business Processes, Business Management Architectures, Business Process Methodology, Introduction to BPEL, Advantages of business modeling, Business process modeling methods, Discovery, analysis, design, validation, and implementation Modeling types, Definition of business
BPM metadata, Importance of the BPMN standards ,Business process modeling standards, Flow objects, Connecting objects, Swimlanes, Artifacts, Steps in BPMsSystem Behavior Specification: Static Behavior: Use Cases, Use Case Diagram
agram, Actor Generalization, Include and Extend, Template for Use Case Narrative, Building Domain Model, and capturing system behavior in use casesDynamic Behavior: Sequence diagrams, object lifelines and message types, Modeling
Refining sequence diagrams, Collaboration diagrams, States, events and actions, Nested machines and concurrency, Modifying the object model to facilitate states, Modeling methods with activity diagrams, Activity Diagrams: Decisions
ion, Iteration, Partitions, Parameters and Pins, Expansion Regions, Swimlanes, concurrency and synchronization, Communication Diagram, Interaction Overview Diagrams, Timing Diagrams Software Architecture Primitives: Foundations of Software Architecture, ReArchitectures, Architectural Design: Software Architecture, Data Design and Architectural Design, Views, Viewpoints, Perspectives, Conceptual Architecture View, Module Architecture View, Execution Architecture View, Code Architecture View,
cture styles: Repository, Layered, Pipe-Filter, Call-Return, Peer-Peer, PublishServer, Two-Tier, Three-Tier, N-Tier, Heterogeneity in Architecture
System Design Specification: Design of Software Objects, Features and Methods, Cohesion and Coupling between Objects, Coupling and Visibility, Interfaces, Interfaces with Ball and Socket Notation, Templates, Analysis model vs. design model classes, Categorizing classes: entity, boundary and control , Modeling associatcollections, Preserving referential integrity, Achieving reusability, Reuse through delegation, Identifying and using service packages, Improving reuse with design Packages and interfaces: Distinguishing between classes/interfaces, Exposing class package interfaces, Subscribing to interfaces Component and deployment diagrams:
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 44 of 141
FF No. :654
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
: Introduction to Business modeling, Introduction to Business Processes, Business Process Modeling Foundation, Process Orchestrations, Process Choreographies, Properties of Business Processes, Business Process Management Architectures, Business Process Methodology, Introduction to BPEL, Advantages of business modeling, Business process modeling methods, Discovery, analysis, design, validation, and implementation Modeling types, Definition of business
BPM metadata, Importance of the BPMN standards ,Business process modeling standards, Flow objects, Connecting objects, Swimlanes, Artifacts, Steps in BPMs
: Static Behavior: Use Cases, Use Case Diagram agram, Actor Generalization, Include and Extend, Template for
Use Case Narrative, Building Domain Model, and capturing system behavior in use cases Dynamic Behavior: Sequence diagrams, object lifelines and message types, Modeling
Refining sequence diagrams, Collaboration diagrams, States, events and actions, Nested machines and concurrency, Modifying the object model to facilitate states, Modeling methods with activity diagrams, Activity Diagrams: Decisions
ion, Iteration, Partitions, Parameters and Pins, Expansion Regions, Swimlanes, concurrency and synchronization, Communication Diagram,
: Foundations of Software Architecture, Reference Architectures, Architectural Design: Software Architecture, Data Design and Architectural Design, Views, Viewpoints, Perspectives, Conceptual Architecture View, Module Architecture View, Execution Architecture View, Code Architecture View,
Peer, Publish-Tier, Heterogeneity in Architecture
es and Methods, Cohesion and Coupling between Objects, Coupling and Visibility, Interfaces, Interfaces with Ball and Socket Notation, Templates, Analysis model vs. design model classes, Categorizing classes: entity, boundary and control , Modeling associations and collections, Preserving referential integrity, Achieving reusability, Reuse through delegation, Identifying and using service packages, Improving reuse with design Packages and interfaces: Distinguishing between classes/interfaces, Exposing class and package interfaces, Subscribing to interfaces Component and deployment diagrams:
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Describing dependencies, Deploying components across threads, processes and processors Design Patterns: Introduction to Design Pattern, Describing Design Patterns, Catalogue of Design Patterns Creational Patterns: Abstract Factory, Builder, Factory Method, Prototype, Singleton, Structural Patterns: Adapter, Bridge, Composite, Decorator, Facade, Flyweight, Proxy, Behavioral Patterns: Chain of Responsibility, Command, Interpreter, Iterator, Mediator, Memento, Observer, State, Strategy, Template Method, Visitor, Antipatterns, Applications of Design Patterns Model Driven Development
Driven Engineering, Model Transformation, Introduction to Model Driven Architecture: MDA Terms and Concepts, Model Mappings, Marking Models, Executable Models, MOF, CWM, Introduction to XML, XMI, Introduction to UML Metamodel and UML 2.X diagrams, Extensibility Mechanisms and its usage, Introduction to OCL, Model Based Software Engineering, DomainArchitecture, MDA Applications
List of Practicals: (For THL, TLP courses)
1. To narrate Requirement Defin
three areas:Problem Identification, Problem Definition, and Problem Statement2. To narrate System Requirements Specification Document for target system with
reference to the IEEE 610.12.1990 Std guidelines.3. To create Business Process Diagrams for all the scenarios identified using BPMN
2.0 and BPM practices. Process modeling captures the ordered sequence of activities within a process along with supporting information from end to end. In process modeling, the business process is framed in a BPD to reflect the activities, the roles that conduct those activities, conditional branching, and the sequence of the workflow between the activities.
4. To decompose and organize the problem domain area into broad subject aidentify the boundaries of problem/system. Specify the behavior of the target system and map requirements to Use cases.
a. The System Context Diagram depicts the overall System behavioral trace and Requirement Capture diagram depicts the hierarchicaOrganization. The Use Case diagram should encompass
b. Actors (External Users) c. Transactions (Use Cases)d. Event responses related to transactions with external agents.e. Detection of System boundaries indicating scope of system.
5. To depict the dynamiSequence diagram should be based on the Scenarios generated by the interCommunication. The model should depict:
a. Discrete, distinguishable entities (class).b. Events (Individual stimulus fromc. Conditional events and relationship representation.
6. To depict the state transition with the life history of objects of a given class model. The model should depict:
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Describing dependencies, Deploying components across threads, processes and
: Introduction to Design Pattern, Describing Design Patterns, Catalogue of Design Patterns Creational Patterns: Abstract Factory, Builder, Factory Method, Prototype, Singleton, Structural Patterns: Adapter, Bridge, Composite, Decorator,
Proxy, Behavioral Patterns: Chain of Responsibility, Command, Interpreter, Iterator, Mediator, Memento, Observer, State, Strategy, Template Method, Visitor, Antipatterns, Applications of Design Patterns Model Driven Development: Overview of Model Driven Development and Model Driven Engineering, Model Transformation, Introduction to Model Driven Architecture: MDA Terms and Concepts, Model Mappings, Marking Models, Executable Models, MOF, CWM, Introduction to XML, XMI, Introduction to UML Metamodel and UML
.X diagrams, Extensibility Mechanisms and its usage, Introduction to OCL, Model Based Software Engineering, Domain-Specific Modeling: Fundamentals and Architecture, MDA Applications
List of Practicals: (For THL, TLP courses)
To narrate Requirement Definition Document for the target system with following three areas:Problem Identification, Problem Definition, and Problem StatementTo narrate System Requirements Specification Document for target system with reference to the IEEE 610.12.1990 Std guidelines. To create Business Process Diagrams for all the scenarios identified using BPMN 2.0 and BPM practices. Process modeling captures the ordered sequence of activities within a process along with supporting information from end to end. In
e business process is framed in a BPD to reflect the activities, the roles that conduct those activities, conditional branching, and the sequence of the workflow between the activities. To decompose and organize the problem domain area into broad subject aidentify the boundaries of problem/system. Specify the behavior of the target system and map requirements to Use cases.
The System Context Diagram depicts the overall System behavioral trace and Requirement Capture diagram depicts the hierarchicaOrganization. The Use Case diagram should encompass Actors (External Users) Transactions (Use Cases) Event responses related to transactions with external agents. Detection of System boundaries indicating scope of system.
To depict the dynamic behavior of the target system using sequence diagram. The Sequence diagram should be based on the Scenarios generated by the interCommunication. The model should depict:
Discrete, distinguishable entities (class). Events (Individual stimulus from one object to another). Conditional events and relationship representation.
To depict the state transition with the life history of objects of a given class model. The model should depict:
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 45 of 141
Describing dependencies, Deploying components across threads, processes and
: Introduction to Design Pattern, Describing Design Patterns, Catalogue of Design Patterns Creational Patterns: Abstract Factory, Builder, Factory Method, Prototype, Singleton, Structural Patterns: Adapter, Bridge, Composite, Decorator,
Proxy, Behavioral Patterns: Chain of Responsibility, Command, Interpreter, Iterator, Mediator, Memento, Observer, State, Strategy, Template Method,
evelopment and Model Driven Engineering, Model Transformation, Introduction to Model Driven Architecture: MDA Terms and Concepts, Model Mappings, Marking Models, Executable Models, MOF, CWM, Introduction to XML, XMI, Introduction to UML Metamodel and UML
.X diagrams, Extensibility Mechanisms and its usage, Introduction to OCL, Model Specific Modeling: Fundamentals and
ition Document for the target system with following three areas:Problem Identification, Problem Definition, and Problem Statement To narrate System Requirements Specification Document for target system with
To create Business Process Diagrams for all the scenarios identified using BPMN 2.0 and BPM practices. Process modeling captures the ordered sequence of activities within a process along with supporting information from end to end. In
e business process is framed in a BPD to reflect the activities, the roles that conduct those activities, conditional branching, and the sequence of
To decompose and organize the problem domain area into broad subject areas and identify the boundaries of problem/system. Specify the behavior of the target
The System Context Diagram depicts the overall System behavioral trace and Requirement Capture diagram depicts the hierarchical Use case
c behavior of the target system using sequence diagram. The
Sequence diagram should be based on the Scenarios generated by the inter-object
To depict the state transition with the life history of objects of a given class
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
a. Possible ways the object can respond to events from other objects.b. Determine of start, end, and transition states.
7. To depict the dynamic behavior using detailed Activity diagram. Activity is a parameterized behavior represented as coordinated flow of actions. The flow of execution is modeled as activity nodes connected - A node can be the execution of a subordinate behavior, such as an arithmetic
computation, a call to an operation, or manipulation of object contents. - Activities may form invocation hierarchies invoking other activities,
ultimately resolving to individual actions. 8. To develop logical static structure of target system with Software Class diagram.
To prepare Class Collaborationclasses traced from System analysis phase. The design model should depict
a. Relationship between classes: inheritance, Assertion, Aggregation, Instantiation
b. Identification of objects and their purpose.c. Roles / responsibilities entities tha
9. To enhance Software Class diagram to Architecture diagram with appropriate design patterns. The patterns selected shall be justifiable and applied to individual and distinct hierarchies. structural elements shall be well
10. To represent physical module that provides occurrence of classes or other logical elements identified during analysis and design of system using Component diagram. The model should depict allocaprecise Program Design Language constructs separating computation from interface. To represent deployment view of the system through Architecture Diagram.
Text Books: 1. Tom Pender, “UML Bible”, John Wiley & sons, ISBN
2. Jim Arlow, IlaNeustadt, “UML 2 and Unified Process: Practical Object Oriented Analysis
and Design.”, 2nd Edition, Addison
Reference Books: 1. Mellor, Scott, Uhl, Weise, “MDA Distilled”, Pearson Education, ISBN 81
2. Grady Booch, James Rambaugh, Ivar Jacobson, “Unified Modeling Language Users
Guide”, 2nd Edition, Addison
3. ErichGamma,RichardHelm
Oriented Software”(
Series),JohnVlissides,Publisher:Addison
ISBN-13: 978-0201633610
4. Steven Kelly, Juha-PekkaTolvanen, Domain
Generation, John Wiley & Sons, Inc.,
5. Paul Clements, Felix Bachmann, Len Bass, David Garlan, Documenting Software
Architectures: Views and Beyond Addison
ISBN-13: 9780201703726
6. Charles S. Wasson, System Analysis, Design
Practices, John Wiley & Sons, Inc.,ISBN
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Possible ways the object can respond to events from other objects.Determine of start, end, and transition states.
To depict the dynamic behavior using detailed Activity diagram. Activity is a parameterized behavior represented as coordinated flow of actions. The flow of execution is modeled as activity nodes connected by activity edges.
A node can be the execution of a subordinate behavior, such as an arithmetic computation, a call to an operation, or manipulation of object contents. Activities may form invocation hierarchies invoking other activities, ultimately resolving to individual actions.
To develop logical static structure of target system with Software Class diagram. To prepare Class Collaboration-Responsibility (CRC) cards for the Conceptual classes traced from System analysis phase. The design model should depict
Relationship between classes: inheritance, Assertion, Aggregation,
Identification of objects and their purpose. Roles / responsibilities entities that determine system behavior.
To enhance Software Class diagram to Architecture diagram with appropriate design patterns. The patterns selected shall be justifiable and applied to individual and distinct hierarchies. Suitable Architectural Styles shall be selected and the structural elements shall be well-documented. To represent physical module that provides occurrence of classes or other logical elements identified during analysis and design of system using Component diagram. The model should depict allocation of classes to modules. To narrate precise Program Design Language constructs separating computation from interface. To represent deployment view of the system through Architecture
Tom Pender, “UML Bible”, John Wiley & sons, ISBN – 0764526049
Jim Arlow, IlaNeustadt, “UML 2 and Unified Process: Practical Object Oriented Analysis
and Design.”, 2nd Edition, Addison- Wesley, ISBN – 0321321278.
Mellor, Scott, Uhl, Weise, “MDA Distilled”, Pearson Education, ISBN 81-297-
Grady Booch, James Rambaugh, Ivar Jacobson, “Unified Modeling Language Users
Guide”, 2nd Edition, Addison- Wesley, ISBN – 0321267974
m,RalphJohnson,“DesignPatterns:Elements of ReusableObject
ted Software”(Addison-WesleyProfessionalComputing
Series),JohnVlissides,Publisher:Addison-Wesley Professional, ISBN-10: 0201633612
PekkaTolvanen, Domain-Specific Modeling: Enabling Full Code
Generation, John Wiley & Sons, Inc., ISBN 978-0-470-03666-2, 2008
Paul Clements, Felix Bachmann, Len Bass, David Garlan, Documenting Software
Architectures: Views and Beyond Addison-Wesley Professional 2003, ISBN-10:0201703726,
Charles S. Wasson, System Analysis, Design, and Development: Concepts, Principles, and
Practices, John Wiley & Sons, Inc.,ISBN-13 978-0-471-39333-7, 2006
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 46 of 141
Possible ways the object can respond to events from other objects.
To depict the dynamic behavior using detailed Activity diagram. Activity is a parameterized behavior represented as coordinated flow of actions. The flow of
A node can be the execution of a subordinate behavior, such as an arithmetic computation, a call to an operation, or manipulation of object contents. Activities may form invocation hierarchies invoking other activities,
To develop logical static structure of target system with Software Class diagram. or the Conceptual
classes traced from System analysis phase. The design model should depict Relationship between classes: inheritance, Assertion, Aggregation,
t determine system behavior. To enhance Software Class diagram to Architecture diagram with appropriate design patterns. The patterns selected shall be justifiable and applied to individual
elected and the
To represent physical module that provides occurrence of classes or other logical elements identified during analysis and design of system using Component
tion of classes to modules. To narrate precise Program Design Language constructs separating computation from interface. To represent deployment view of the system through Architecture
Jim Arlow, IlaNeustadt, “UML 2 and Unified Process: Practical Object Oriented Analysis
-0529X
Grady Booch, James Rambaugh, Ivar Jacobson, “Unified Modeling Language Users
ents of ReusableObject-
WesleyProfessionalComputing
10: 0201633612
Specific Modeling: Enabling Full Code
Paul Clements, Felix Bachmann, Len Bass, David Garlan, Documenting Software
10:0201703726,
, and Development: Concepts, Principles, and
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
7. Essential Business Process Modeling,
Oreilly, ISBN 10: 0-596-00843
Course Outcomes:
Upon completion of the course, graduates will be able to
1. Examine and breakdown realdepicting static and dynamic behavior of the system management practices, objectDevelopment practices.
2. Identify and formulate software requirements and behavioral models using static and dynamic behavioral views indicating structured pstate-based exploration.
3. Compose system analysis and design specifications indicating logical, physical, deployment, and concurrency viewpoints using objectdesign principles and Model Driven Engineering pr
4. Construct and justify the evolutionary system description models expressing highlevel architecture accommodating applicable architectural styles compatible to requirements and behavioral models using UML
5. Comprehend the nature of design patterns by understanding a small number of examples from different pattern categories and apply these patterns in creating a correct design using design heuristics, published guidance, applicability, reasonableness, and relation to othersystem profiles to the engineering and social community.
6. Propose multi-faceted defendable solutions demonstrating teamaccommodating design patterns reducing the potential cost and performance impedance in order to realize system artifactsDevelopment practices.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Essential Business Process Modeling, Michael Havey, First Edition August 2005
00843-0 | ISBN 13: 9780596008437
Upon completion of the course, graduates will be able to –
Examine and breakdown real-world problem scenarios into structured partitions depicting static and dynamic behavior of the system using business process management practices, object-oriented analysis principles and Model Driven Development practices. Identify and formulate software requirements and behavioral models using static and dynamic behavioral views indicating structured problem partitioning and
based exploration. Compose system analysis and design specifications indicating logical, physical, deployment, and concurrency viewpoints using object-oriented analysis and design principles and Model Driven Engineering practices. Construct and justify the evolutionary system description models expressing highlevel architecture accommodating applicable architectural styles compatible to requirements and behavioral models using UML-supported modeling tools.
nature of design patterns by understanding a small number of examples from different pattern categories and apply these patterns in creating a correct design using design heuristics, published guidance, applicability, reasonableness, and relation to other design criteria resulting inwellsystem profiles to the engineering and social community.
faceted defendable solutions demonstrating teamaccommodating design patterns reducing the potential cost and performance
n order to realize system artifacts with the help of Model Driven Development practices.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 47 of 141
August 2005
world problem scenarios into structured partitions using business process
oriented analysis principles and Model Driven
Identify and formulate software requirements and behavioral models using static roblem partitioning and
Compose system analysis and design specifications indicating logical, physical, oriented analysis and
Construct and justify the evolutionary system description models expressing high-level architecture accommodating applicable architectural styles compatible to
supported modeling tools. nature of design patterns by understanding a small number of
examples from different pattern categories and apply these patterns in creating a correct design using design heuristics, published guidance, applicability,
design criteria resulting inwell-documented
faceted defendable solutions demonstrating team-skills accommodating design patterns reducing the potential cost and performance
Model Driven
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS304THL: DESIGN AND ANALYSIS OF ALGORITHM
Credits: 03
Section 1: Topics/Contents
Basic introduction, time complexity analysis, Divide and Conquer
Asymptotic notations (Big Oh, small oh, Big Omega, Theta notations). Best case, average case, and worst case time and space complexity of algorithms. Overview of searching, sorting algorithms. Adversary lower bounds (for comparison based sorting, for finding second minima). Using Recurrence relations and Mathematical Induction to get asymptotic bounds on time complexity. Master’s theorem and applications. Proving correctness of algorithms. Divide and Conquer: Analyzing Quick sort, Randomized Quick sort, Merge sort, Counting Inversions, Finding majority element, Finding Median, Efficient algorithms for Integer arithmetic (Euclid's algorithm, Karatsuba's algorithm for integer multiplication, fast exponentiation), Finding closest pair of points in plane, computing convexpoints in plane, basic idea of FFT algorithm and applications. Dynamic Programming: General strategy, simple dynamic programming based algorithms to compute Fibonacci numbers, binomial coefficients, Matrix Chain multiplication, Optimal binary(OBST) construction, Coin change problem, 0Problem, All pair shortest path algorithm, Longest increasing subsequence problem, Longest common subsequence problem, Largest independent set for trees. Greedy: Analysis and correctness proof of minimum spanning tree and shortest path algorithms, Huffman coding, conflict free scheduling, fractional knapsack.
Section 2: Topics/Contents
Backtracking Strategy, Linear Programming:
Backtracking: General strategy, nLinear Programming: Introduction to linear programming, geometric interpretation, LP duality, Simplex algorithm, Linear optimization problems and their LP formulation.Flows and Matchings: Flows: Flows in the network, Maxformulation of flow problem, Applications (e.g. image segmentation, airline scheduling)Matchings: Perfect matchings in bipartite graphs, LP formulation, Hall's marriage theorem, Konig's theorem, augmenting path algorithm for matchings. Introduction to NP-completeness, Approximation Algorithms:
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
DESIGN AND ANALYSIS OF ALGORITHM
Teaching Scheme: Theory: 3 Hours / Week
Lab: 2 Hours/Week
Basic introduction, time complexity analysis, Divide and Conquer notations (Big Oh, small oh, Big Omega, Theta notations). Best case, average
case, and worst case time and space complexity of algorithms. Overview of searching, sorting algorithms. Adversary lower bounds (for comparison based sorting, for finding
inima). Using Recurrence relations and Mathematical Induction to get asymptotic bounds on time complexity. Master’s theorem and applications. Proving
Analyzing Quick sort, Randomized Quick sort, Merge sort, ounting Inversions, Finding majority element, Finding Median, Efficient algorithms for
Integer arithmetic (Euclid's algorithm, Karatsuba's algorithm for integer multiplication, fast exponentiation), Finding closest pair of points in plane, computing convexpoints in plane, basic idea of FFT algorithm and applications.
General strategy, simple dynamic programming based algorithms to compute Fibonacci numbers, binomial coefficients, Matrix Chain multiplication, Optimal binary(OBST) construction, Coin change problem, 0-1 Knapsack, Traveling Salesperson Problem, All pair shortest path algorithm, Longest increasing subsequence problem, Longest common subsequence problem, Largest independent set for trees.
Analysis and correctness proof of minimum spanning tree and shortest path algorithms, Huffman coding, conflict free scheduling, fractional knapsack.
Backtracking Strategy, Linear Programming: strategy, n-queen problem, graph coloring, subset sum problem.
Linear Programming: Introduction to linear programming, geometric interpretation, LP duality, Simplex algorithm, Linear optimization problems and their LP formulation.
ws: Flows in the network, Max-flow min-cut theorem, Ford Fulkerson's algorithm, LP formulation of flow problem, Applications (e.g. image segmentation, airline scheduling)Matchings: Perfect matchings in bipartite graphs, LP formulation, Hall's marriage
orem, Konig's theorem, augmenting path algorithm for matchings. completeness, Approximation Algorithms:
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 48 of 141
FF No. : 654
DESIGN AND ANALYSIS OF ALGORITHM
3 Hours / Week
2 Hours/Week
notations (Big Oh, small oh, Big Omega, Theta notations). Best case, average case, and worst case time and space complexity of algorithms. Overview of searching, sorting algorithms. Adversary lower bounds (for comparison based sorting, for finding
inima). Using Recurrence relations and Mathematical Induction to get asymptotic bounds on time complexity. Master’s theorem and applications. Proving
Analyzing Quick sort, Randomized Quick sort, Merge sort, ounting Inversions, Finding majority element, Finding Median, Efficient algorithms for
Integer arithmetic (Euclid's algorithm, Karatsuba's algorithm for integer multiplication, fast exponentiation), Finding closest pair of points in plane, computing convex hull of
General strategy, simple dynamic programming based algorithms to compute Fibonacci numbers, binomial coefficients, Matrix Chain multiplication, Optimal binary search tree
1 Knapsack, Traveling Salesperson Problem, All pair shortest path algorithm, Longest increasing subsequence problem,
Analysis and correctness proof of minimum spanning tree and shortest path algorithms,
queen problem, graph coloring, subset sum problem. Linear Programming: Introduction to linear programming, geometric interpretation, LP duality, Simplex algorithm, Linear optimization problems and their LP formulation.
cut theorem, Ford Fulkerson's algorithm, LP formulation of flow problem, Applications (e.g. image segmentation, airline scheduling) Matchings: Perfect matchings in bipartite graphs, LP formulation, Hall's marriage
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Complexity classes P, NP, coNP, and their interrelation, Notion of polynomial time many one reductions reduction. Notion of NPand implication to P versus NP question. NPproblems (some selected examples from SAT, vertex cover problem, independent set probcircuit problem, subset sum problem.)Introduction to Approximation algorithms, NPalgorithm for Vertex Cover, Traveling Sales Person Problem(TSP), Set Text Books: (As per IEEE format) 1. Cormen, Leiserson, Rivest and Stein “Introduction to Algorithm” ,PHI 3
81-203-2141-3
2. Jon Kleinberg, Eva Tardos “Algorithm Design”, Pearson, 1
0310-6
Reference Books: (As per IEEE format)
1. Bressard, Bratley “Fundamentals of Algorithmics.” ,PHI, 2
1131-0
2. Horowitz, Sahani, “Fundamentals of computer Algorithms”, Galgotia. 2
81-7515-257-5 List of Practicals: (For THL, TLP courses)
1. Randomized quick sort2. Median Finding 3. FFT algorithm 4. Closest pair of points 5. All pair shortest path 6. Longest Increasing subsequence 7. Traveling Salesperson Problem8. Viterbi Algorithm 9. Huffman Coding 10. Ford Fulkerson Algorithm11. Augmenting Path algorithm for maximum m12. Application of Network Flows in image segmentation13. Solving NP-complete Problems using ILP solver14. Approximation algorithm for metric TSP
Course Outcomes:
The student will be able to – 1. Formulate computational problems in abstract and mathematically precise manner 2. Design efficient algorithms for computational problems using appropriate
algorithmic paradigm3. Analyze asymptotic complexity of the algorithm for a complex computational
problem using suitable mathematical techniques.4. Formulate computational problem as linear program and apply LP, network flow,
based techniques to design efficient algorithms for them.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Complexity classes P, NP, coNP, and their interrelation, Notion of polynomial time many one reductions reduction. Notion of NP-hardness and NP-completeness. Cook’s Theorem and implication to P versus NP question. NP-hardness of halting problem. NPproblems (some selected examples from - Satisfiability problem, Circuit-SAT, vertex cover problem, independent set problem, clique problem, Hamiltoniancircuit problem, subset sum problem.) Introduction to Approximation algorithms, NP-optimization problems, Approximation algorithm for Vertex Cover, Traveling Sales Person Problem(TSP), Set-cover.
Cormen, Leiserson, Rivest and Stein “Introduction to Algorithm” ,PHI 3
nd edition, 2009. ISBN
2. Jon Kleinberg, Eva Tardos “Algorithm Design”, Pearson, 1st edition, 2005. ISBN 978
(As per IEEE format) Bressard, Bratley “Fundamentals of Algorithmics.” ,PHI, 2
nd Edition, 1996, ISBN 81
2. Horowitz, Sahani, “Fundamentals of computer Algorithms”, Galgotia. 2nd
Edition, 1998.ISBN
(For THL, TLP courses)
Randomized quick sort
Longest Increasing subsequence Traveling Salesperson Problem
Ford Fulkerson Algorithm Augmenting Path algorithm for maximum matching Application of Network Flows in image segmentation
complete Problems using ILP solver Approximation algorithm for metric TSP
Formulate computational problems in abstract and mathematically precise manner Design efficient algorithms for computational problems using appropriate algorithmic paradigm Analyze asymptotic complexity of the algorithm for a complex computational
using suitable mathematical techniques. Formulate computational problem as linear program and apply LP, network flow, based techniques to design efficient algorithms for them.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 49 of 141
Complexity classes P, NP, coNP, and their interrelation, Notion of polynomial time many completeness. Cook’s Theorem
hardness of halting problem. NP-Complete -SAT, 3-CNF
lem, clique problem, Hamiltonian-
optimization problems, Approximation cover.
edition, 2009. ISBN
edition, 2005. ISBN 978-81-317-
Edition, 1996, ISBN 81-203-
Edition, 1998.ISBN
Formulate computational problems in abstract and mathematically precise manner Design efficient algorithms for computational problems using appropriate
Analyze asymptotic complexity of the algorithm for a complex computational
Formulate computational problem as linear program and apply LP, network flow,
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
5. Establish NPcompleteness of some decision problems, grasp the significance ofthe notion of NPcompleteness and its relation with intractability of the decision problems and design efficient approximation algorithms for standard NPoptimization problems.
6. Incorporate appropriate data structures, algorithmic paradigms to craft innovascientific solution for a complex computing problems.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
completeness of some decision problems, grasp the significance ofcompleteness and its relation with intractability of the decision
problems and design efficient approximation algorithms for standard NPoptimization problems. Incorporate appropriate data structures, algorithmic paradigms to craft innovascientific solution for a complex computing problems.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 50 of 141
completeness of some decision problems, grasp the significance of completeness and its relation with intractability of the decision
problems and design efficient approximation algorithms for standard NP-
Incorporate appropriate data structures, algorithmic paradigms to craft innovative
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS3009: RANDOMIZED AND APPROXIMATION ALGORITHMS
Credits:4
Section 1: Topics/Contents
Basic probability theory
Introduction to randomization in computation and some simple randomized algorithms. Basic discrete probability theory:independence of events, conditional probability, union bound, inclusion exclusion, Bayes’ rule, discrete random variables, expectation, variance, linearity of expectation, sum of independent random variGeometric), coupon collector problem, birthday paradox, probabilistic recurrences. Uniform generation of combinatorial structures. Indicator random variables and their role in algorithm analysis. Tail Inequalities and applications
Moments and deviation, occupancy problem, Markov and Chebyshev inequalities and some applications, randomized selection, weak law of large numbers, stable marriage problem and principle of deferred decision, coupon collector prthreshold, Chernoff’s bound and some applications, set balancing. Randomized Algorithms and Randomized Complexity Classes.
Las Vegas and Monte-Carlo algorithms (with examples: randomized quick sort, Karger’s min-cut algorithm). Basic compinterrelations, probability amplification in RP and BPP, randomness and nonuniformity, Adleman’s theorem. Yao’s mincomputations.
Section 2: Topics/Contents
Algebraic techniques
Polynomial identity testing, Schwartzverifying matrix multiplication, testing equality of strings, perfect matching problem for bipartite graphs), Mulmuleymatching problem. Number theoretic algorithms (finding quadratic nonprimality testing), introduction to probabilistic methods. Markov Chains and Random Walks
Markov chains: definition, representations, randomiclassifying states of Markov chains, Gambler’s ruin, stationary distributions. Random walks on undirected graphs, cover time, hitting time, commute time, graph connectivity,
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
FF No. : 654
RANDOMIZED AND APPROXIMATION ALGORITHMS
Teaching Scheme: Theory: 3 Hours / Week
Lab: 2 Hours/Week
Introduction to randomization in computation and some simple randomized algorithms. Basic discrete probability theory: basic counting, definition of probability, examples, independence of events, conditional probability, union bound, inclusion exclusion, Bayes’ rule, discrete random variables, expectation, variance, linearity of expectation, sum of independent random variables, standard distributions (Bernoulli, Binomial, Geometric), coupon collector problem, birthday paradox, probabilistic recurrences. Uniform generation of combinatorial structures. Indicator random variables and their role
nequalities and applications Moments and deviation, occupancy problem, Markov and Chebyshev inequalities and some applications, randomized selection, weak law of large numbers, stable marriage problem and principle of deferred decision, coupon collector problem and sharp threshold, Chernoff’s bound and some applications, set balancing. Randomized Algorithms and Randomized Complexity Classes.
Carlo algorithms (with examples: randomized quick sort, Karger’s cut algorithm). Basic complexity classes P, NP, RP, Co-RP, ZPP, BPP and their
interrelations, probability amplification in RP and BPP, randomness and nonuniformity, Adleman’s theorem. Yao’s min-max principle and lower bound for randomized
Polynomial identity testing, Schwartz-Zippel lemma and applications (with examples verifying matrix multiplication, testing equality of strings, perfect matching problem for bipartite graphs), Mulmuley-Vazirani-Vazirani isolation lemma and application to matching problem. Number theoretic algorithms (finding quadratic nonprimality testing), introduction to probabilistic methods.
Markov Chains and Random Walks Markov chains: definition, representations, randomized algorithm for 2-SAT and 3classifying states of Markov chains, Gambler’s ruin, stationary distributions. Random walks on undirected graphs, cover time, hitting time, commute time, graph connectivity,
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 51 of 141
FF No. : 654
RANDOMIZED AND APPROXIMATION ALGORITHMS
Hours / Week
Lab: 2 Hours/Week
Introduction to randomization in computation and some simple randomized algorithms. basic counting, definition of probability, examples,
independence of events, conditional probability, union bound, inclusion exclusion, Bayes’ rule, discrete random variables, expectation, variance, linearity of expectation,
ables, standard distributions (Bernoulli, Binomial, Geometric), coupon collector problem, birthday paradox, probabilistic recurrences. Uniform generation of combinatorial structures. Indicator random variables and their role
Moments and deviation, occupancy problem, Markov and Chebyshev inequalities and some applications, randomized selection, weak law of large numbers, stable marriage
oblem and sharp
Carlo algorithms (with examples: randomized quick sort, Karger’s RP, ZPP, BPP and their
interrelations, probability amplification in RP and BPP, randomness and nonuniformity, max principle and lower bound for randomized
Zippel lemma and applications (with examples verifying matrix multiplication, testing equality of strings, perfect matching problem for
tion lemma and application to matching problem. Number theoretic algorithms (finding quadratic non-residues,
SAT and 3-SAT, classifying states of Markov chains, Gambler’s ruin, stationary distributions. Random walks on undirected graphs, cover time, hitting time, commute time, graph connectivity,
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
electrical networks, introduction to expander random walks. Approximation Algorithms
Introduction to approximation algorithms, NPbounding OPT, Review of approximation algorithm for vertex cover, TSP. Example of set-cover ( O(log n) factor approxsuper-string problem, Knapsack and FPTAS algorithms. Linear programming based algorithms, LP relaxation, LP duality. LP rounding strategy and primal-dual schema, set-maximum satisfiability.
List of Practicals: (For THL, TLP courses)
1. Karger’s Mincut algorithm2. Majority finding 3. Order statistics and tail inequalities4. Monte Carlo algorithm for set balancing5. Testing equality of strings based on Schwartz6. Isolation Lemma and Algorithm for bipartite matching7. Matrix identities 8. Miller-Rabin Primality test9. Solovay-Strassen Primality test10. Random walks and efficient algorithm for 211. Sampling from convex bodies12. Page rank algorithm 13. Approximation algorithm for Knapsack14. Approximation algorithms based on Linear Programming
Text Books:) 1. Motwani, Raghavan “Randomized Algorithms” ,
ISBN: 9780521613903
2. Mitzenmatcher, Upfal “Probability and C
ISBN: 9780521835404
3.Vazirani “Approximation Algorithms”,
Reference Books:
1. Kai Lai Chung “A course in probability theory.” ,
2. William Feller ”An introduction to probability theory and its applications.” ,
Pvt Ltd ISBN: 9788126518050
Course Outcomes: The student will be able to –
1. To Formulate computational problems in abstract and mathematically precise manner
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
electrical networks, introduction to expander graphs. Expanders and rapidly mixing
Approximation Algorithms Introduction to approximation algorithms, NP-hard optimization problems, lower bounding OPT, Review of approximation algorithm for vertex cover, TSP. Example of
log n) factor approx-algorithm based on greedy strategy, layering), Shortest string problem, Knapsack and FPTAS algorithms.
Linear programming based algorithms, LP relaxation, LP duality. LP rounding strategy -cover and some other examples using LP based techniques,
(For THL, TLP courses) Karger’s Mincut algorithm
Order statistics and tail inequalities Monte Carlo algorithm for set balancing
strings based on Schwartz-Zipple lemma Isolation Lemma and Algorithm for bipartite matching
Rabin Primality test Strassen Primality test
Random walks and efficient algorithm for 2-SAT Sampling from convex bodies
Approximation algorithm for Knapsack Approximation algorithms based on Linear Programming
, Raghavan “Randomized Algorithms” ,Cambridge University Press, 2010,
2. Mitzenmatcher, Upfal “Probability and Computing”, Cambridge University Press
3.Vazirani “Approximation Algorithms”, Springer-verlag, 2004, ISBN: 9783540653677
“A course in probability theory.” ,Acp, 2008, ISBN: 9788181477156”An introduction to probability theory and its applications.” ,
Pvt Ltd ISBN: 9788126518050
To Formulate computational problems in abstract and mathematically precise
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 52 of 141
graphs. Expanders and rapidly mixing
hard optimization problems, lower bounding OPT, Review of approximation algorithm for vertex cover, TSP. Example of
algorithm based on greedy strategy, layering), Shortest
Linear programming based algorithms, LP relaxation, LP duality. LP rounding strategy me other examples using LP based techniques,
Cambridge University Press, 2010,
Cambridge University Press, 2005,
ISBN: 9783540653677
Acp, 2008, ISBN: 9788181477156 ”An introduction to probability theory and its applications.” ,Wiley India
To Formulate computational problems in abstract and mathematically precise
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
2. Design efficient algorithms for computational problems using appropriate algorithmic paradigm
3. Analyze asymptotic complexity of the algorithm for a complex computational problem using suitable mathematical techniques.
4. Formulate computational problem as linebased techniques to study problems such as bipartite graph matching problem.
5. Establish NPcompleteness of some decision problems, grasp the significance of the notion of NPcompleteness and its relation with intractaproblems and design efficient approximation algorithms for standard NPoptimization problems.
6. Incorporate appropriate data structures, algorithmic paradigms to craft innovative scientific solution for a complex computing problems.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Design efficient algorithms for computational problems using appropriate algorithmic paradigm Analyze asymptotic complexity of the algorithm for a complex computational problem using suitable mathematical techniques. Formulate computational problem as linear program and apply LP, network flow, based techniques to study problems such as bipartite graph matching problem.
completeness of some decision problems, grasp the significance of completeness and its relation with intractability of the decision
problems and design efficient approximation algorithms for standard NPoptimization problems. Incorporate appropriate data structures, algorithmic paradigms to craft innovative scientific solution for a complex computing problems.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 53 of 141
Design efficient algorithms for computational problems using appropriate
Analyze asymptotic complexity of the algorithm for a complex computational
ar program and apply LP, network flow, based techniques to study problems such as bipartite graph matching problem.
completeness of some decision problems, grasp the significance of bility of the decision
problems and design efficient approximation algorithms for standard NP-
Incorporate appropriate data structures, algorithmic paradigms to craft innovative
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS3010:
Credits:4
Section 1: Topics/Contents
Introduction: Introduction to distributed algorithms, First example: coloring paths. Coloring using unique identifier, Coloring with randomized algorithms, lower bound for 2-coloring of paths, Challenges of distributed algorithms.
Review of Prerequisite Topics:
Connectivity and DistancesPartitions, Directed Graphs and OrientationsProbability theory covering Markov’s inequality, Chebyshev’s inequality, Chernoff bounds, Markov chains and random walks. Models of computing: A distributed program, A model of distributed networks Port Numbering Model, Distributed algorithms in PN model: Coloring paths, bipartite graph maximum matching, verDirected pseudo forests, merging colorings. CONGEST models and bandwidth limitations. Message passing and shared memory models, synchronous and asynchronous timing models, failure models. Complexity measures likcomplexity. Global state of a distributed systemand future cones of an event, logical time, scalar and vector time.
Section 2: Topics/Contents
Global state and snapshot recording alg
definitions, Snapshot algorithms for FIFO channelsalgorithm, Snapshot algorithms for nonsystem, Monitoring global statesnapshots. Fundamental Problems on Distributed Networks:
Maximal independent set, minimum spanning tree, vertex coloring, dominating set, routing algorithms, leader election, Byzantine agreement, synchronizers,dynamic networks. Storage and retrieval of data in peernetworks, and rumor spreading in social networking.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
FF No. : 654
CS3010: DISTRIBUTED ALGORITHMS
Teaching Scheme: Theory: 3 Hours / Week
Lab: 2 Hours/Week
Introduction to distributed algorithms, First example: coloring paths. Coloring using unique identifier, Coloring with randomized algorithms, lower bound for
coloring of paths, Challenges of distributed algorithms.
Review of Prerequisite Topics: Graph theory covering graphs, subgraphs, walks, Connectivity and Distances, Isomorphism, Packing and Covering, Labeling and
Directed Graphs and Orientations. robability theory covering Markov’s inequality, Chebyshev’s inequality, Chernoff
rkov chains and random walks.
A model of distributed executions, Models of communication Port Numbering Model, Distributed algorithms in PN model: Coloring paths,
bipartite graph maximum matching, vertex cover. Local Models, unique identifiers. Directed pseudo forests, merging colorings. CONGEST models and bandwidth
Message passing and shared memory models, synchronous and asynchronous timing models, failure models. Complexity measures like time, space, and message complexity. Global state of a distributed system, Cuts of a distributed computation
, logical time, scalar and vector time.
Global state and snapshot recording algorithms: Introduction, System model and Snapshot algorithms for FIFO channels,Variations of the Chandy
Snapshot algorithms for non-FIFO channels, Snapshots in a causal delivery Monitoring global state, Necessary and sufficient conditions for consistent global
Fundamental Problems on Distributed Networks: Maximal independent set, minimum spanning tree, vertex coloring, dominating set, routing algorithms, leader election, Byzantine agreement, synchronizers, graph spanners,
Storage and retrieval of data in peer-to-peer computing, coverage and routing in sensor networks, and rumor spreading in social networking.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 54 of 141
FF No. : 654
Hours / Week
Lab: 2 Hours/Week
Introduction to distributed algorithms, First example: coloring paths. Coloring using unique identifier, Coloring with randomized algorithms, lower bound for
covering graphs, subgraphs, walks, Labeling and
robability theory covering Markov’s inequality, Chebyshev’s inequality, Chernoff
of communication Port Numbering Model, Distributed algorithms in PN model: Coloring paths,
tex cover. Local Models, unique identifiers. Directed pseudo forests, merging colorings. CONGEST models and bandwidth
Message passing and shared memory models, synchronous and asynchronous e time, space, and message
Cuts of a distributed computation, Past
System model and Variations of the Chandy–Lamport
Snapshots in a causal delivery sufficient conditions for consistent global
Maximal independent set, minimum spanning tree, vertex coloring, dominating set, graph spanners,
peer computing, coverage and routing in sensor
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Proving Impossibility results:
and applications. List of Practical’s:
1. Implement Coloring path problem.2. Implement Graph coloring.3. Implementation of Markov Chain model4. Implement Snapshot algorithms for FIFO channels5. Implement bipartite graph maximum 6. Implement Chandy–Lamport7. Implement Vertex Coloring problem.8. Implement minimum spanning tree in Distributed algorithms.
Text Books and Reference Books: 1. Distributed Algorithms, by Nancy Lynch.
2. Distributed Computing: Fundamentals,
Attiya and Jennifer Welch.
3. Distributed Computing: Principles,Systems and Algorithms. By
and Mukesh Singhal
4. Randomized Algorithms, by Rajeev Motwani and Prabhakar Raghavan.
5. Principles of Distributed Computing
6. Preprint of book by Jukka Suomela https://users.ics.aalto.fi/suomela/da/da
Course Outcomes: The student will be able to –
1. Understand various algorithms in the distributed systems2. Design efficient algorithms for computational methods in distributed systems3. Analyze various distributed algorithms4. Compare and contrast various methods in distributed 5. Use different algorithms to solve real life problem6. Apply various distributed system to solve computational intelligent problems
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Proving Impossibility results: Covering maps, Local neighborhoods, Ramsey theo
Implement Coloring path problem. Implement Graph coloring. Implementation of Markov Chain model
Snapshot algorithms for FIFO channels in Distributed Algorithms.Implement bipartite graph maximum matching.
Lamport algorithm. Implement Vertex Coloring problem. Implement minimum spanning tree in Distributed algorithms.
Text Books and Reference Books: 1. Distributed Algorithms, by Nancy Lynch.
2. Distributed Computing: Fundamentals, Simulations, and Advanced Topics, by Hagit
3. Distributed Computing: Principles,Systems and Algorithms. By Ajay D. Kshemkalyani
4. Randomized Algorithms, by Rajeev Motwani and Prabhakar Raghavan.
Principles of Distributed Computing, lecture notes by Roger Wattenhofer.
6. Preprint of book by Jukka Suomela https://users.ics.aalto.fi/suomela/da/da
Understand various algorithms in the distributed systems Design efficient algorithms for computational methods in distributed systemsAnalyze various distributed algorithms Compare and contrast various methods in distributed environment. Use different algorithms to solve real life problem Apply various distributed system to solve computational intelligent problems
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 55 of 141
, Local neighborhoods, Ramsey theory
in Distributed Algorithms.
Simulations, and Advanced Topics, by Hagit
Ajay D. Kshemkalyani
6. Preprint of book by Jukka Suomela https://users.ics.aalto.fi/suomela/da/da-print.pdf
Design efficient algorithms for computational methods in distributed systems
Apply various distributed system to solve computational intelligent problems
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS3003: MICROPROCESSORS AND MICROCONTROLLERS
Credits: 3
Section 1: Topics/Contents
Introduction to Pentium microprocessor:
processors. Pentium features and Architectures, Pentium Real mode, Pentium RISC features, Pentium super-scalar architecture prediction, Instruction and Data caches. The Floating point Unit fBUS cycles and Memory organization:
– Reset, Non pipelined and pipelined (read and write). Memory organization and I/O organization. Data transfer mechanism programmers model, Register set, Addressing modes, Data Types, BUS cycle.Microcontroller PIC Microntroller:
Applications, Processor - Interrupt Structure and ApplicationsTime Clock and Timers, Reset Circuitry and Watchdog Timer. Structural Units of Processor, Processor and Memory Selection, Memory Map, Interfacing Processors, Memories and I/O. Processor and Memory Selection. Section2: Topics/Contents
Microcontroller ARM Microntroller:
Modes of operation, Interrupt Structure and ApplicationsClocking Unit, Real Time Clock and Timers, Reset Circuitry and Watchdog Timer. Structural Units of Processor, Processor and Memory Selection, Memory Map, Interfacing Processors, Memories and I/O. Processor and Memory Selection.Microcontroller I/O interfacing:
using RS-232C. I/O devicesLED / LCD Display devices, Timers/Counters. Multitasking, Interrupts, Exceptions and I/O
data structures, Task switching, Nested task, I/O permission bit map. Virtual mode features, address generation, privilege level, instruction and registers available, entering and leaving V86 mode. Interrupt structure handling in Pentium, I/O instructions Comparison of all three modes.
List of Practical’s: (For THL, TLP courses)
1.File Operations
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS3003: MICROPROCESSORS AND MICROCONTROLLERS
Teaching Scheme: Theory: 3 Hours / Week
Lab: 2 Hours/Week
Introduction to Pentium microprocessor: Historical evolution of 80286, 386, 486 processors. Pentium features and Architectures, Pentium Real mode, Pentium RISC
scalar architecture - Pipelining, Instruction paring rules, Branch prediction, Instruction and Data caches. The Floating point Unit features & data types.BUS cycles and Memory organization: Initialization and configuration, Bus operations
Reset, Non pipelined and pipelined (read and write). Memory organization and I/O organization. Data transfer mechanism – 8bit, 16bit, 32bit. Data bus interface. Pentium programmers model, Register set, Addressing modes, Data Types, BUS cycle.Microcontroller PIC Microntroller: System hardware, Interrupt structure and
Architecture, Programmer’s model, Modes of operation, nterrupt Structure and Applications. Management of Power Supply, Clocking Unit, Real
Time Clock and Timers, Reset Circuitry and Watchdog Timer. Structural Units of Processor, Processor and Memory Selection, Memory Map, Interfacing Processors,
I/O. Processor and Memory Selection.
Microcontroller ARM Microntroller: Processor - Architecture, Programmer’s model, Modes of operation, Interrupt Structure and Applications. Management of Power Supply,
Real Time Clock and Timers, Reset Circuitry and Watchdog Timer. Structural Units of Processor, Processor and Memory Selection, Memory Map, Interfacing Processors, Memories and I/O. Processor and Memory Selection.Microcontroller I/O interfacing: Digital I/O interfacing, Serial Data Communication
232C. I/O devices-ADC / DAC and Stepper Motor, Optical Devices such as LED / LCD Display devices, Timers/Counters. Multitasking, Interrupts, Exceptions and I/O: Multitasking -support registers, related ata structures, Task switching, Nested task, I/O permission bit map. Virtual mode
features, address generation, privilege level, instruction and registers available, entering and leaving V86 mode. Interrupt structure - real, protected, virtual 8086 mode. handling in Pentium, I/O instructions Comparison of all three modes.
(For THL, TLP courses)
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 56 of 141
FF No. :654
CS3003: MICROPROCESSORS AND MICROCONTROLLERS
Hours / Week
Hours/Week
of 80286, 386, 486 processors. Pentium features and Architectures, Pentium Real mode, Pentium RISC
Pipelining, Instruction paring rules, Branch eatures & data types.
Initialization and configuration, Bus operations Reset, Non pipelined and pipelined (read and write). Memory organization and I/O
bus interface. Pentium programmers model, Register set, Addressing modes, Data Types, BUS cycle.
System hardware, Interrupt structure and Architecture, Programmer’s model, Modes of operation,
Management of Power Supply, Clocking Unit, Real Time Clock and Timers, Reset Circuitry and Watchdog Timer. Structural Units of Processor, Processor and Memory Selection, Memory Map, Interfacing Processors,
Architecture, Programmer’s model, Management of Power Supply,
Real Time Clock and Timers, Reset Circuitry and Watchdog Timer. Structural Units of Processor, Processor and Memory Selection, Memory Map, Interfacing Processors, Memories and I/O. Processor and Memory Selection.
O interfacing, Serial Data Communication ADC / DAC and Stepper Motor, Optical Devices such as
support registers, related ata structures, Task switching, Nested task, I/O permission bit map. Virtual mode -
features, address generation, privilege level, instruction and registers available, entering real, protected, virtual 8086 mode. I/O
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
2.Cache 3.Coprocessor 4. Flashing lights 5. LCD 6. Timer 7. ADC 8. Serial Communications 9. Digit LED 10. Stepper Motor 11. Mini Project Text Books: 1. Antonakos J., "The Pentium Microprocessor", Pearson Education, 2004, 2nd Edition.
2. Deshmukh A., "Microcontrollers
Reference Books: (As per IEEE format)1. ARM data Sheet.
2. Intel data Sheet.
Course Outcomes:
Upon completion of the course, graduates will be able to 1. Describe the Structure and Internal Architecture of Pentium Processor and
Microcontroller.
2. Develop simple Programs.
3. Utilize the Structures to
4. Comprehend Internal Components to conceive well
Specifications.
5. Design Effective Automation Solutions.
6. Lead Team to deliver Effective Designs.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Antonakos J., "The Pentium Microprocessor", Pearson Education, 2004, 2nd Edition.
Deshmukh A., "Microcontrollers - Theory and Applications", Tata McGraw
Reference Books: (As per IEEE format)
Upon completion of the course, graduates will be able to - Describe the Structure and Internal Architecture of Pentium Processor and
Develop simple Programs.
Utilize the Structures to effectively solve Computing Problems.
Comprehend Internal Components to conceive well-formed Design
Design Effective Automation Solutions.
Lead Team to deliver Effective Designs.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 57 of 141
Antonakos J., "The Pentium Microprocessor", Pearson Education, 2004, 2nd Edition.
Theory and Applications", Tata McGraw-Hill, 2004
Describe the Structure and Internal Architecture of Pentium Processor and
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS3005: EMBEDDED SYSTEMS
Credits: 3
Section 1: Topics/Contents
Introduction to Embedded Systems
and Characteristics of ES. Review ofProcessor Technology, ApplicationManagement of peripherals, Reset Ckt / Watch DMicroprocessor , Processor and ,Memory Selection ,Interfacing of Processor Memory, I/O Bus management techniques. Serial / Parallel Bus , Bus Design Issues ArbitrationStudy of Bus Parameter. Bus Technologies: I/O Bus, Bus Design Issues, Allocation , ArbitrationI2C, SPI.,USB, RS232C. RTOS: Device drivers, Interrupts, Interrupt Service Routines, Scheduling Algo, Inter Process Communication, Process Synchronization. Multiple Tasks, Threads, Processes. Shared Data / Priority Inversion Char: of RTOS, Real Time Scheduling of RTOSStudy of Embedded Systems in Detail.(H/W + S/W Algo) Section2: Topics/Contents
Structure of RTOS : Kernel Structure: Tasks, Task States, TCB, Ready list, Task Scheduling, Task Level Context Switching, Locking and unlocking of scheduler, Idle Task, Statistics Task, Interrupts, Clock Tick, Initialization, Starting the OS. Task Management: Creating/Deletchecking, Changing Task‟s Priority. Time Management: Delaying/Resuming task, System Time. Synchronization in RTOS:
Pending/Posting/Acceptance/Query. Mutual Exclusioending/Posting/Acceptance/Query. Event Flag Management: Internals, Creation/ Delation of Event Flag groups, Waiting/Setting/Clearing/Looking for/Querying an Event Flag Group. Communication in RTOS:
Mailbox, Waiting/ Sending /Getting without waiting a Message from Mailbox, Status of Mailbox, Alternate uses of Mailbox. Message Queue Management: Creating/Deleting/ Flushing a Message Queue, Waiting/Sending/Getting without waiting aQueue, Status and Alternate use of Message Queue. Memory Management: MCB, Crating a partition, Obtaining /Returning/Waiting for a memory Block, Partition Status.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS3005: EMBEDDED SYSTEMS
Teaching Scheme: 3 Hours / Week
Lab: 2 Hours/Week
Introduction to Embedded Systems: Embedded Systems: Components, Classification, and Characteristics of ES. Review of Microprocessors and Microcontrollers. Embedded Processor Technology, Application Specific System Processor. CISC, RISC , Power Management of peripherals, Reset Ckt / Watch Dog Timers, Structural Units of Microprocessor , Processor and ,Memory Selection ,Interfacing of Processor Memory, I/O Bus management techniques. Serial / Parallel Bus , Bus Design Issues Arbitration
I/O Bus, Bus management techniques. Serial / Parallel Bus , Bus Arbitration. Study of Bus Parameter. Detail study of
Device drivers, Interrupts, Interrupt Service Routines, Scheduling Algo, Inter nication, Process Synchronization. Multiple Tasks, Threads, Processes.
Data / Priority Inversion Char: of RTOS, Real Time Scheduling of RTOSStudy of Embedded Systems in Detail.(H/W + S/W Algo).
Kernel Structure: Tasks, Task States, TCB, Ready list, Task Scheduling, Task Level Context Switching, Locking and unlocking of scheduler, Idle Task, Statistics Task, Interrupts, Clock Tick, Initialization, Starting the OS. Task Management: Creating/Deleting and Suspending/Resuming Task, Task Stacks and
‟s Priority. Time Management: Delaying/Resuming task,
RTOS: Semaphore Management: Creation/Delation, Pending/Posting/Acceptance/Query. Mutual Exclusion Semaphores: Creation/Delation, ending/Posting/Acceptance/Query. Event Flag Management: Internals, Creation/ Delation of Event Flag groups, Waiting/Setting/Clearing/Looking for/Querying an Event Flag
RTOS: Message Mailbox Management: Creating/Deleting a Mailbox, Waiting/ Sending /Getting without waiting a Message from Mailbox, Status of Mailbox, Alternate uses of Mailbox. Message Queue Management: Creating/Deleting/ Flushing a Message Queue, Waiting/Sending/Getting without waiting a Message from Queue, Status and Alternate use of Message Queue. Memory Management: MCB, Crating a partition, Obtaining /Returning/Waiting for a memory Block, Partition Status.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 58 of 141
FF No. :654
Hours / Week
Lab: 2 Hours/Week
Components, Classification, Microprocessors and Microcontrollers. Embedded
Specific System Processor. CISC, RISC , Power og Timers, Structural Units of
Microprocessor , Processor and ,Memory Selection ,Interfacing of Processor Memory, I/O Bus management techniques. Serial / Parallel Bus , Bus Design Issues Arbitration
nagement techniques. Serial / Parallel Bus , Bus . Detail study of CAN,
Device drivers, Interrupts, Interrupt Service Routines, Scheduling Algo, Inter nication, Process Synchronization. Multiple Tasks, Threads, Processes.
Data / Priority Inversion Char: of RTOS, Real Time Scheduling of RTOS Case
Kernel Structure: Tasks, Task States, TCB, Ready list, Task Scheduling, Task Level Context Switching, Locking and unlocking of scheduler, Idle Task, Statistics Task, Interrupts, Clock Tick, Initialization, Starting the OS. Task
ing and Suspending/Resuming Task, Task Stacks and s Priority. Time Management: Delaying/Resuming task,
Semaphore Management: Creation/Delation, n Semaphores: Creation/Delation,
ending/Posting/Acceptance/Query. Event Flag Management: Internals, Creation/ Delation of Event Flag groups, Waiting/Setting/Clearing/Looking for/Querying an Event Flag
t: Creating/Deleting a Mailbox, Waiting/ Sending /Getting without waiting a Message from Mailbox, Status of Mailbox, Alternate uses of Mailbox. Message Queue Management: Creating/Deleting/
Message from Queue, Status and Alternate use of Message Queue. Memory Management: MCB, Crating a partition, Obtaining /Returning/Waiting for a memory Block, Partition Status.
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
List of Practical’s: (For THL, TLP courses)
1. RTOS porting on available micro controller board. 2. Interfacing of 4Χ4 Keyboard to a micro controller using RTOStask 3. Interfacing of 4Χ4 Keyboard, 16RTOS 4. Implement a semaphore for any given tas5. Implementation of mutual exclusion in tasks as per 3. 6. Implementation of mailbox and message queue management in tasks as per 3.7. Implementation of memory management in tasks as per 3. 8. Interfacing of LEDS and Keyboard using Linux OS 9. Interfacing of graphic LCD using Linux OS. 10. Interfacing ADC and DAC using Linux OS. List of Project areas: (For THP, TLP courses)
1.Mini Project Text Books:
1. Raj Kamal, “Embedded Systems edition, Mc Graw Hill 2. Christopher Hallinan, “Embedded Linux Primer ”2nd edition, Prentice Hall. Reference Books:
1. Dr. K.V.K.K. Prasad “Embedded / Real Time Systems Programming Black Book” Dreamtech Press 2. Frank Vahid and Tony Givargis, “Embedded System Design Software introduction” 3rd edition, Wiley.3 Course Outcomes:
The student will be able to – 1. Consider the different constraints of embedded system 2. Understand Real time syst3. Do the analysis Linux operating system as real time operating system. 4. To use RTOS for different embedded systems.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
(For THL, TLP courses)
1. RTOS porting on available micro controller board. 4 Keyboard to a micro controller using RTOStask 4 Keyboard, 16Χ2 LCD display and ADC to a micro controller using
4. Implement a semaphore for any given task switching on a micro controller 5. Implementation of mutual exclusion in tasks as per 3. 6. Implementation of mailbox and message queue management in tasks as per 3.7. Implementation of memory management in tasks as per 3.
Keyboard using Linux OS 9. Interfacing of graphic LCD using Linux OS. 10. Interfacing ADC and DAC using Linux OS.
(For THP, TLP courses)
1. Raj Kamal, “Embedded Systems – Architecture, Programming and
2. Christopher Hallinan, “Embedded Linux Primer -A Practical, Real-World Approach
Dr. K.V.K.K. Prasad “Embedded / Real Time Systems Programming Black Book”
2. Frank Vahid and Tony Givargis, “Embedded System Design – A Unified hardware/ Software introduction” 3rd edition, Wiley.
Consider the different constraints of embedded system Understand Real time systems concepts. Do the analysis Linux operating system as real time operating system. To use RTOS for different embedded systems.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 59 of 141
2 LCD display and ADC to a micro controller using
k switching on a micro controller
6. Implementation of mailbox and message queue management in tasks as per 3.
Design" 2nd
World Approach
Dr. K.V.K.K. Prasad “Embedded / Real Time Systems Programming Black Book”
A Unified hardware/
Do the analysis Linux operating system as real time operating system.
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS3004:
Credits: 04
Section 1: Topics/Contents
Introduction: Overview of Computer Graphics, Computer Graphics Application and Software, Display adapters, Display modes,Devices for Operator Interaction, Active and Passive Graphics Devices, Display Technologies, Storage Tube Graphics Displays, Raster Refresh (RasterDisplays, Cathode Ray Tube Basics, Color CRTstructure, Display file interpreterAspect Ratio, Normalized Device Coordinates
Scan Conversion: Scan Converting Linescriteria, Aliasing issues and Antialiasing techniquesThicklines and circle generation, Numerical problems on line and circle generation, Converting polygons, Polygon Segments and Clipping: Introduction to animationSegment table, Segment Creation, Closing, Delete and renaming, Image transformation, Display structures used for segment, to-Viewport Transformation, Liang-Barsky algorithm, Polygon clipping: Sutherland Hodgeman algorithm, Weller Atherton algorithm, Text clipping.
Section2: Topics/Contents
2D Transformations: Introduction
Conventions, 2D Transformations, Homogeneous Coordinates and Matrix Representation of 2D Transformations, Translations, Rotation, Reflection, Scaling, Combined Transformation, Transformation of Points, Transformation of The Unit Square, Solid Body Transformations, Rotation About an Arbitrary Point, Reflection through an Arbitrary Line, A Geometric Interpretation of Homogeneous Coordinates,Transformations, Numerical problems on 2D transformations.3D Transformations and Projections:
system, Right handed system,
Dimensional Scaling, Three-Dimensional Reflection, ThreeRotation about an Arbitrary Axis in Space, of 3D Transformations, Affine and Perspective Geometry, Techniques for Generating Perspective Views, Vanishing Points, Orthographic
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS3004: COMPUTER GRAPHICS
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Overview of Computer Graphics, Computer Graphics Application and Display adapters, Display modes, Pixel, Frame Buffer, Graphics devices, Input
Devices for Operator Interaction, Active and Passive Graphics Devices, Display Technologies, Storage Tube Graphics Displays, Raster Refresh (Raster-Scan) Graphics
de Ray Tube Basics, Color CRT, Raster Scan Basics, structure, Display file interpreter, Random-Scan Display Processor, LCD displays
Normalized Device Coordinates. Scan Converting Lines and circles, DDA, Bresenham
issues and Antialiasing techniques, line and circle drawing algorithms,Thicklines and circle generation, Numerical problems on line and circle generation,
Polygon Filling algorithms, Run length encoding algorithm.Introduction to animation, Need of segment in animation
Segment table, Segment Creation, Closing, Delete and renaming, Image transformation, ay structures used for segment, Introduction to Windowing and Clipping,
Viewport Transformation, Line clipping: Cohen Sutherland, Cyrus-Beck, MidPolygon clipping: Sutherland Hodgeman algorithm, Weller
Atherton algorithm, Text clipping.
Introduction to Transformations and Matrices, Transformation Conventions, 2D Transformations, Homogeneous Coordinates and Matrix Representation of 2D Transformations, Translations, Rotation, Reflection, Scaling, Combined
ormation, Transformation of Points, Transformation of The Unit Square, Solid Body Transformations, Rotation About an Arbitrary Point, Reflection through an Arbitrary Line, A Geometric Interpretation of Homogeneous Coordinates,
rical problems on 2D transformations. 3D Transformations and Projections: Introduction, 3D point representation, Left handed
system, Right handed system, Matrix Representation of 3D Transformations-Dimensional Shearing, Three-Dimensional Rotation, Three
Dimensional Reflection, Three-Dimensional Translation, Multiple Transformation, Rotation about an Arbitrary Axis in Space, Reflection about arbitrary axis, of 3D Transformations, Affine and Perspective Geometry, Perspective Techniques for Generating Perspective Views, Vanishing Points, Orthographic
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 60 of 141
FF No. :654
Hours / Week
: Lab 2 Hours / Week
Overview of Computer Graphics, Computer Graphics Application and raphics devices, Input
Devices for Operator Interaction, Active and Passive Graphics Devices, Display Scan) Graphics
Raster Scan Basics, Display file Scan Display Processor, LCD displays,
m, Mid-point line and circle drawing algorithms,
Thicklines and circle generation, Numerical problems on line and circle generation, Scan oding algorithm.
, Need of segment in animation, Segment table, Segment Creation, Closing, Delete and renaming, Image transformation,
Windowing and Clipping, Window-Mid-point and
Polygon clipping: Sutherland Hodgeman algorithm, Weller
Transformations and Matrices, Transformation Conventions, 2D Transformations, Homogeneous Coordinates and Matrix Representation of 2D Transformations, Translations, Rotation, Reflection, Scaling, Combined
ormation, Transformation of Points, Transformation of The Unit Square, Solid Body Transformations, Rotation About an Arbitrary Point, Reflection through an Arbitrary Line, A Geometric Interpretation of Homogeneous Coordinates, Inverse
3D point representation, Left handed
Matrix Representation of 3D Transformations, Three-Dimensional Rotation, Three-
Dimensional Translation, Multiple Transformation, Reflection about arbitrary axis, Composition
Perspective Projections, Techniques for Generating Perspective Views, Vanishing Points, Orthographic
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Projections, Axonometric Projections, Oblique Projections, volumes for projections, 3D clippingproblems on 3D transformations. Visible Surface Determination
Visible-Surface Algorithms, Categories of algorithms, Back face removal, The zAlgorithm, Scan-line method, Painter’s amethod, BSP trees, Visible-Representation, Parametric and Circle, Parametric Representation of a ParabolInterpolation, LeGrange interpolating algorithms, Curves, Bezier Curves, FractalSurface.
List of Practicals: (For THL, TLP
1. Line Drawing and Circle Drawing.
2. Polygon filling algorithms.
3. Line clipping algorithm.
4. Polygon clipping algorithm.
5. Animation.
6. 2D transformations
7. Applications of 2D transformations.
8. 3D transformations
9. Hidden surface removal
10. Curves and fractals
Text Books:
1. “Computer Graphics”, D. Hearn, M. Baker, 2nd Edition, Pearson Education, 2002,
ISBN 81-7808-794-4.
2. “Procedural Elements for Computer Graphics”, D. Rogers, 2nd Edition, Tata
McGraw-Hill Publication, 2001, ISBN 0
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Projections, Axonometric Projections, Oblique Projections, Projection Taxonomy, 3D clipping with parallel and perspective projections
problems on 3D transformations. Visible Surface Determination and Curve Generation: Techniques for efficient
Surface Algorithms, Categories of algorithms, Back face removal, The zline method, Painter’s algorithms (depth sorting), Area sub
-Surface Ray Tracing, comparison of the methods.and Nonparametric Curves, Parametric Representation of a
Circle, Parametric Representation of a Parabola and Hyperbola, Curve GInterpolation, LeGrange interpolating algorithms, Approximation method, Curves, Bezier Curves, Fractals, Hilbert and Koch curve, Generation of Frac
List of Practicals: (For THL, TLP courses)
Line Drawing and Circle Drawing.
Polygon filling algorithms.
Line clipping algorithm.
Polygon clipping algorithm.
2D transformations
Applications of 2D transformations.
3D transformations
Hidden surface removal
fractals
“Computer Graphics”, D. Hearn, M. Baker, 2nd Edition, Pearson Education, 2002,
2. “Procedural Elements for Computer Graphics”, D. Rogers, 2nd Edition, Tata
Hill Publication, 2001, ISBN 0-07-047371-4.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 61 of 141
Projection Taxonomy, View jections, Numerical
Techniques for efficient Surface Algorithms, Categories of algorithms, Back face removal, The z-Buffer
lgorithms (depth sorting), Area sub-division Surface Ray Tracing, comparison of the methods. Curve
Nonparametric Curves, Parametric Representation of a , Curve Generation,
Approximation method, B-spline Fractal line and
“Computer Graphics”, D. Hearn, M. Baker, 2nd Edition, Pearson Education, 2002,
2. “Procedural Elements for Computer Graphics”, D. Rogers, 2nd Edition, Tata
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Reference Books:
1. “Computer Graphics”, S. Harrington, 2nd Edition, McGraw
- 07 -100472 -6.
2. “Computer Graphics Principles and Practice”, J. Foley, V. Dam, S. Feiner, J.
Hughes, 2nd Edition, Pearson Education, 2003, ISBN 81
Course Outcomes:
The student will be able to – 1. Understand computer graphics fundamentals2. Utilize algorithms to draw and fill geometric shapes. 3. Construct animation based demonstrating system using segments and clipping
algorithms. 4. Use mathematics to achieve 2D transformations on different 2D geometrical
shapes 5. Systematically identify and solve numerical problems of 3D transformations and
projections 6. Detect hidden surfaces and Interpret the curve and fractals
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
1. “Computer Graphics”, S. Harrington, 2nd Edition, McGraw-Hill Publications, ISBN 0
2. “Computer Graphics Principles and Practice”, J. Foley, V. Dam, S. Feiner, J.
Hughes, 2nd Edition, Pearson Education, 2003, ISBN 81-7808-038-9.
Understand computer graphics fundamentals Utilize algorithms to draw and fill geometric shapes. Construct animation based demonstrating system using segments and clipping
mathematics to achieve 2D transformations on different 2D geometrical
Systematically identify and solve numerical problems of 3D transformations and
Detect hidden surfaces and Interpret the curve and fractals
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 62 of 141
Hill Publications, ISBN 0
2. “Computer Graphics Principles and Practice”, J. Foley, V. Dam, S. Feiner, J.
Construct animation based demonstrating system using segments and clipping
mathematics to achieve 2D transformations on different 2D geometrical
Systematically identify and solve numerical problems of 3D transformations and
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Credits: 04
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS3011: EDD3
Teaching Scheme Theory: 1 Hours / Week
Lab: 2 Hours / Week
Tutorial: 2 Hours / Week
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 63 of 141
Teaching Scheme Theory: 1 Hours / Week
Lab: 2 Hours / Week
Tutorial: 2 Hours / Week
Vis
hw
ak
arm
a I
nst
itu
te o
f T
ech
nolo
gy
,Pu
ne
Str
uct
ure
an
d s
yll
abu
s o
f S
.Y.
B.T
ech
Co
mp
ute
r E
ngin
eeri
ng. P
atte
rn B
-18,
A.Y
. 2
01
8-1
9
Pag
e 6
4 o
f 1
41
M
OD
UL
E V
I
Vis
hw
ak
arm
a I
nst
itu
te o
f T
ech
nolo
gy
,Pu
ne
Str
uct
ure
an
d s
yll
abu
s o
f S
.Y.
B.T
ech
Co
mp
ute
r E
ngin
eeri
ng. P
atte
rn B
-18,
A.Y
. 2
01
8-1
9
Pag
e 6
5 o
f 1
41
Issu
e 1, R
ev. 1 , D
t. 0
1/0
7/2
018
Tit
le:
Cou
rse
Str
uct
ure
F
F N
o. 653
Bra
nch
: C
om
pute
r Y
ear:
T.Y
. A
.Y.:
2018-1
9 M
od
ule
: V
P
att
ern
: B
-18.
1
.
Su
bje
ct
No.
Su
bje
ct
Cod
e S
ub
ject
Na
me
Tea
chin
g S
chem
e
(Hrs
/Wee
k)
Exam
inati
on
S
chem
e
C
red
its
Th
eory
L
AB
T
ut.
C
A
MS
E
(%)
ES
A
Tota
l
H
A
(%)
LA
B
(%)
ES
E
(%)
VIV
A
(%)
S1
C
S3012
C
S3016
* C
ore
Ele
ctiv
e G
roup-3
C
E3:
Com
pil
er D
esig
n
CE
3:
Sys
tem
s P
rogra
mm
ing
3
2
-
10
30
10
30
20
100
4
S2
CS
3013
CS
3019
CS
3021
* C
ore
Ele
ctiv
e G
roup-4
C
E4:
Art
ific
ial
Inte
llig
ence
C
E4:
Mac
hin
e L
earn
ing
CE
4:
Neu
ral
Net
wo
rks
3
2
-
10
30
10
30
20
100
4
Vis
hw
ak
arm
a I
nst
itu
te o
f T
ech
nolo
gy
,Pu
ne
Str
uct
ure
an
d s
yll
abu
s o
f S
.Y.
B.T
ech
Co
mp
ute
r E
ngin
eeri
ng. P
atte
rn B
-18,
A.Y
. 2
01
8-1
9
Pag
e 6
6 o
f 1
41
S
3
CS
3014
CS
3017
CS
3018
**S
pec
ial
Ele
ctiv
e G
rou
p -
3
SE
3:
Web
Tec
hnolo
gie
s S
E3:
Mobil
e C
om
puti
ng
SE
3:
Net
wo
rk S
ecu
rity
3
2
-
10
30
10
30
20
100
4
S4
CS
3015
CS
3020
**S
pec
ial
Ele
ctiv
e G
rou
p -
4
SE
4:D
ata
Sci
ence
S
E4:
Busi
nes
s In
tell
igen
ce
3
2
-
10
30
10
30
20
100
4
S5
CS
3022
ED
D4
1
2
2
10
30
10
30
20
100
4
S6
CS
3094
Sum
mer
Tra
inin
g
- -
--
-
- -
- -
- 1
C
S3097
*P
D2
C
S3096
**G
P3
T
OT
AL
13
10
2
21
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 67 of 141
FF No. :654
CS 3012: COMPILER DESIGN
Credits: 04 Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Section 1: Topics/Contents
Lexical Analysis and introduction to Syntax Analysis: Introduction to Compiler, Phases and Passes, Bootstrapping, Cross Compiler, Role of a Lexical Analyzer, Specification and Recognition of Tokens, LEX, Expressing Syntax, Top-Down Parsing, Predictive Parsers. Implementing Scanners, operator precedence parsers. Syntax and Semantic Analysis: Bottom-Up Parsing, LR Parsers: constructing SLR parsing tables, constructing Canonical LR parsing tables, Constructing LALR parsing tables, using ambiguous grammars, YACC, Type Checking, Type Conversion. Symbol-Table Structure. Syntax-Directed Translation and Intermediate Code Generation: Syntax-Directed Definitions, Bottom-Up Evaluation, Top-Down Translation, Intermediate Representations, Intermediate Code Generation. Error Detection & Recovery: Lexical Phase errors, syntactic phase errors semantic errors. More about translation: Array references in arithmetic expressions, case statements. Section2:Topics/Contents
Code Generation: Issues in Code Generation, Basic Blocks and Flow Graphs, Next-use information, A simple Code generator, DAG representation of Basic Blocks, Peephole Optimization. Generating code from dags. Code Optimization and Run Time Environments: Introduction, Principal Sources of Optimization, Optimization of basic Blocks, Introduction to Global Data Flow Analysis, Runtime Environments, Source Language issues. Storage Organization, Storage Allocation strategies, Access to non-local names, Parameter Passing
List of Practical’s:
1. Assignment to understand basic syntax of LEX specifications, built-in functions and Variables.
2. Implement a Lexical Analyzer using LEX for a subset of C.
3. Implement a parser for an expression grammar using YACC and LEX .
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 68 of 141
4. Generate and populate appropriate Symbol Table.
5. Implementation of Semantic Analysis Operations (like type checking, verification of function parameters, variable declarations and coercions) possibly using an Attributed Translation Grammar.
6. Implement the front end of a compiler that generates the three address code for a simple language.
7. Generate an appropriate Target Code from the given intermediate code assuming suitable processor details.
8. A Register Allocation algorithm that translates the given code into one with a fixed number of registers. (Optional)
9. Implementation of Instruction Scheduling Algorithm. (Optional)
10. Implement Local and Global Code Optimizations such as Common Sub-expression Elimination, Copy Propagation, Dead-Code Elimination, Loop and Basic-Block Optimizations. (Optional)
Text Books:
1. “Compilers: Principles, Techniques and Tools”, A. V. Aho, M. S. Lam, R. Sethi, J.
D. Ullman, Addison Wesley, ISBN 978-81317-2101-8, Second Edition, 2007.
2. “Engineering a Compiler”, K. Cooper, L. Torczon, Morgan Kaufmann, ISBN 1-
55860-698-X, First Edition, 2003.
Reference Books: 1. “Advanced Compiler Design and Implementation”, S. S. Muchnik, Morgan
Kaufmann, ISBN 8178672413, First Edition, 1997.
2. “Lex & Yacc”, J. R. Levine, T. Mason, D. Brown, “Lex & Yacc”, J. R. Levine, T.
Mason, D. Brown, O’Reilly, ISBN 1-56592-000-7, Second Edition, 1992.
Additional Reading
1. “Compiler Construction: Principles and Practice”, K. Louden, Course
Technology, ISBN 0-534-93972-4, First Edition, 1997.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 69 of 141
Course Outcomes:
Upon completion of the course, graduates will be able to - 1. Design basic components of compiler including scanner, parser and code generator. 2. Perform semantic analysis in a syntax directed fashion using attributed definitions. 3. Apply local and global code optimization techniques. 4. Synthesize machine code for runtime environment. 5. Develop software solutions for the problems related to compiler construction. 6. Adapt themselves to the emerging trends in language processing.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 70 of 141
FF No. :654
CS3016: SYSTEMS PROGRAMMING
Credits: 04 Teaching Scheme:Theory: 3 Hours / Week
Project Based Lab: 2 Hours/Week
Section 1: Topics/Contents
Introduction to System Software: Introduction, software types, software hierarchy, components of system software, machine structure, interfaces, address space, levels of system software, recent trends in software development. Language processors: Programming languages and language processors, fundamentals of language processing, life cycle of a source program, language processing activities, data structures for language processing: search data structures, allocation data structures. Macroprocessor: Introduction, macro definition and call, macro expansion, nested macro calls, design of macro processor, design issues of macro processors, two-pass macro processors, one-pass macro processors. Assembler: Elements of assembly language programming, design of the assembler, assembler design criteria, types of assemblers, two-pass assemblers, one-pass assemblers, assembler algorithms, multi-pass assemblers, variants of assemblers design of two pass assembler, machine dependent and machine independent assembler features. Compilers: Introduction to compiler phases, introduction to cross compiler, features of machine dependent and independent compilers, overview of types of compilers. Interpreters: compiler vs. interpreter, phases and working. Linkers: Relocation and linking concepts, static and dynamic linker, subroutine linkages. Loaders: Introduction to loader, loader schemes: compile and go, general loader scheme, absolute loaders, relocating loaders, direct linking loaders, MSDOS linker.
Section2: Topics/Contents
Systems Programming for Linux as Open Source OS: Essential concepts of linux system programming, APIs and ABIs, standards, program segments/sections, the elf format, linking and loading, linux dynamic libraries (shared objects), dynamic linking, API compatibility, dynamically linked libraries. Advanced system programming concepts: Operating system interfaces, stack smashing. Multitasking and paging, address translation, memory protection, comparison with windows. Encoding, Decoding: Encoding and decoding schemes for the X-86 processor. Device Driver: Types of drivers, driver history, driver issues, kernel level device drivers, virtual device drivers(VxD), device driver stack buses and physical devices, static device drivers, dynamic device drivers, PnP, device namespace, and named devices. DOS: Internals of DOS, DOS loading, DOS memory map, Internal commands, External commands, command interpreter, POST details, POST sequence, PSP (structure details), ‘.exe’ and ‘.com’ file structures, conversion of .exe to .com file. BIOS: what and why, BIOS calls: int 10h calls, dos calls: int 21h calls, difference between DOS and BIOS.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 71 of 141
TSR: types, structure, details of TSR loading, examples, writing TSRs.
List of Project areas:
1. Design and implementation of 2 Pass Macroprocessor. 2. Design and implementation of 2 Pass Assembler. 3. Simulation of linker & loader. 4. Implement a Lexical Analyzer using LEX for a subset of C. 5. Design and implementation of DLL on Linux shared library. 6. Design a device driver on Linux system.
Text Books: 1. D M Dhamdhere; "Systems Programming & Operating Systems"; Tata McGraw Hill
Publications, ISBN - 0074635794
2. John J Donovan; " Systems Programming " ; Tata Mc-Graw Hill edition , ISBN-13
978-0-07-460482-3
Reference Books: 1. Robert Love, " Linux System Programming " ;O’Reilly, ISBN 978-0-596-00958-8
2. Mahesh Jadhav; " Easy Linux Device Driver "; HighTechEasy publishing, Second
edition.
3. Ray Duncan; “Advanced MSDOS programming”; Microsoft press
Course Outcomes: The student will be able to – 1. Discriminate among different System software and their functionalities. 2. Design language translators like Macroprocessor and Assembler. 3. Develop approaches and methods for implementing compiler, linker and loader. 4. Adopt the skills and methods for implementing different system-level software. 5. Interpret the methods and techniques about instructions Encoding-Decoding and Implementing device drivers. 6. Design TSR programs for real world applications.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 72 of 141
FF No. :654
CS 3013: ARTIFICIAL INTELLIGENCE
Credits: 4 Teaching Scheme: 3 Hours / Week
Lab: 2 Hours/Week
Section 1: Topics/Contents
Fundamentals of Artificial Intelligence: Introduction, A.I. Representation, Non-AI & AI Techniques, Representation of Knowledge, Knowledge Base Systems, State Space Search, Production Systems, Problem Characteristics, types of production systems, Intelligent Agents and Environments, concept ofrationality, the nature of environments, structure of agents, problem solving agents, problem formulation. Searching: Depth First Search, Breadth First Search, Generate & test, Hill Climbing, Best First Search, A* and AO* Algorithm, Constraint satisfaction, Means-Ends Analysis. Game playing: Minimax Search, Alpha-Beta Cutoffs, Waiting for Quiescence. Planning: Blocks world, STRIPS, Implementation using goal stack, Partial Order Planning, Hierarchical planning, and least commitment strategy. Conditional Planning, Continuous Planning Machine Learning Algorithms. Section2: Topics/Contents
Knowledge Representation: Knowledge based agents, Wumpus world, Propositional Logic: Representation, Inference, Reasoning Patterns, Resolution, First order Logic: Representation, Inference, Reasoning Patterns, Resolution, Forward and Backward Chaining. Basics of PROLOG: Representation, Structure, Backtracking, Expert System. Uncertainty: Non Monotonic Reasoning, Logics for Non Monotonic Reasoning, Forward rules and Backward rules, Justification based Truth Maintenance Systems, Semantic Nets StatisticalReasoning, Probability and Bayes’ theorem, Bayesian Network, Markov Networks, HiddenMarkov Model,Basis of Utility Theory, Utility Functions. List of Lab assignments:
1. Analysis of AI and Non-AI technique by implementing any two player game 2. Analysis of Heuristic search techniques by Implementing any two Heuristic search techniques such as Hill Climbing, Best First Search, A*, AO* etc. 3. Analysis of Constraint satisfaction Problems 4. Implementation of Expert system in PROLOG. 5. Implementation of any real time problem using PROLOG. Text Books:
1.Elaine Rich and Kevin Knight: "Artificial Intelligence." Tata McGraw Hill
2. Stuart Russell & Peter Norvig : "Artificial Intelligence : A Modern Approach",
Pearson Education, 2nd Edition.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 73 of 141
Reference Books: 1. Ivan Bratko : "Prolog Programming For Artificial Intelligence" , 2nd Edition Addison
Wesley,
1990.
2. Eugene, Charniak, Drew Mcdermott: "Introduction to Artificial Intelligence.", Addison
Wesley
3. Patterson: “Introduction to AI and Expert Systems”, PHI
4. Nilsson : “Principles of Artificial Intelligence”, Morgan Kaufmann.
5. Carl Townsend, “Introduction to turbo Prolog”, Paperback, 1987
Course Outcomes:
Upon completion of the course, graduates will be able to – 1. Identify problems that are amenable to solution by AI methods, and which AI methods may be suited to solving a given problem. 2. Formalize a given problem in the language/framework of different AI methods (e.g., as a search problem, as a constraint satisfaction problem, as a planning problem, as a Markov decision process, etc). 3. Implement basic AI algorithms (e.g., standard search algorithms or dynamic programming). 4. Design and carry out an empirical evaluation of different algorithms on a problem formalization, and state the conclusions that the evaluation supports. 5. Use various symbolic knowledge representations to specify domains and reasoning tasks of a situated software agent.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 74 of 141
FF No. :654
CS 3019: MACHINE LEARNING
Credits: 4 Teaching Scheme: 3 Hours / Week
Section 1: Topics/Contents
Introduction to Machine Learning, Types of Learning: Supervised, Unsupervised, Reinforcement. Learning System: Well posed learning problem, Designing a learning system, Issues in machine learning. Hypothesis, Target Function, Cost Function, Gradient, Training, Testing, Cross-validation, Evaluating hypothesis accuracy, Sampling theory, Central limit theorem, hypothesis testing, comparing learning algorithms. Validation: Cross validation, Confusion matrix. Linear Regression and Logistic Regression, Decision Trees: Decision Tree Learning: representation, Basic decision tree learning algorithm, Hypothesis space, Issues in decision tree learning. Bayesian Learning: Bayes theorem, Maximum likelihood hypothesis, minimum description length principle, Gibbs algorithm, Bayesian belief networks, Expectation maximization algorithm
Section 2: Topics/Contents
SVM: Kernel functions, Linear SVM, Nonlinear SVM. Hidden Markov model, Genetic algorithm, Regression analysis, Multivariable regression Clustering Algorithm and recurrent Networks: k-means algorithm, k-nearest neighbor learning, weighted majority algorithm, Principal component Analysis (PCA), Collaborative Filtering, Artificial Neural Networks: activation functions, Learning Rules, Mc-Culloch-pitts Neuron model, single layer and multilayer perceptron, Back propagation algorithm
List of Project areas:
1. Implement the back propagation algorithm on a dataset obtained from UCI ML repository. 2. Apply the following machine learning algorithms on a dataset obtained from UCI ML repository. a. Support Vector Machine b. Genetic algorithm 3. Apply the following clustering algorithms on a dataset obtained from UCI ML repository. a. K-means b. PCA
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 75 of 141
Text Books: (As per IEEE format) 1. T. Mitchell, “ Machine Learning”, McGraw-Hill, 1997.
2. Anup Kumar Srivastava, Soft Computing, Alpha Science International limited. 2009.
Reference Books: (As per IEEE format) 1. Ethem Alpaydin, "Introduction to Machine Learning", MIT press, 2004.
2. Jacek M. Zurada, “Introduction to Artificial neural System”, JAICO publishing
house,2002,.
Course Outcomes:
Upon completion of the course, graduates will be able to – 1. Demonstrate knowledge of learning algorithms and concept learning through
implementation for sustainable solutions of applications. 2. Evaluate decision tree learning algorithms. 3. Analyze research based problems using Machine learning techniques. 4. Apply different clustering algorithms used in machine learning to generic datasets and specific multidisciplinary domains. 5. Formulate a given problem within the Bayesian learning framework with focus on building lifelong learning ability. 6. Evaluation of different algorithms on well formulated problems along with stating valid conclusions that the evaluation supports.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 76 of 141
FF No. :654
CS3014: WEB TECHNOLOGY
Credits: 4 Teaching Scheme: Theory:3 Hours / Week
Lab:2 Hours / Week
Section 1: Topics/Content
Web Development Process, Front End Tools: Introduction to web technology, internet and www, Web site planning and design issues, HTML5: structure of html document, HTML elements: headings, paragraphs, line break, colors & fonts, links, frames, lists, tables, images and forms, , CSS, Bootstrap , XML. Client Side Technologies: HTML5 forms Validation, JavaScript: Overview of JavaScript, Data types, Control Structures, Arrays, Functions and Scopes, Objects in JS, DOM: DOM levels, DOM Objects and their properties and methods, Manipulating DOM, JQuery: Introduction to JQuery, Loading JQuery, Selecting elements, changing styles, creating elements, appending elements, removing elements, handling events. Introduction to JSON Server Side Technologies –I: Server Side technology and TOMCAT, Servlet: Introduction to servlet, need and advantages ,Servlet Lifecycle, Creating and testing of sample servlet, session management. JSP: Introduction to JSP, advantages of JSP over Servlet , elements of JSP page: directives, comments, scripting elements, actions and templates, JDBC, MongoDB
Section 2: Topics/Content
Server Side Technologies-II: PHP: Introduction to PHP, Features, sample code, PHP script working, PHP syntax, conditions & Loops, Functions, String manipulation, Arrays & Functions, Form handling, Cookies & Sessions, File Handling, Exception Handling, E-mail, MySQL with PHP, AJAX Web Services: Web Services: Overview, types of application web services, SOAP, REST, EJB, JNDI lookup, Content Management System(CMS) Server Side Technologies –II: PHP: Introduction to PHP, Features, sample code, PHP script working, PHP syntax, conditions & Loops, Functions, String manipulation, Arrays & Functions, Form handling, Cookies & Sessions, File Handling, Exception Handling, E-mail, MySQL with PHP, AJAX Web Technology Frameworks: Angular JS : Overview, MVC architecture, directives, expression, controllers, filters, tables, modules, forms, includes, views, scopes, services, dependency injection, custom directives, Internationalization, NodeJS.
List of Practical’s: (For THP)
Operating System recommended: - 64-bit Open source Linux or its derivative
Programming tools recommended: - Eclipse, JavaBeans, WampServer
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 77 of 141
List of Project areas: (THP)
1. Design and deploy web based application using front end technologies HTML5, CSS, Bootstrap and XML. Perform validation using Java script/JQuery/HTML5. (For Example: Course Registration System, Voter System for Election, e-Shopping System,
e-Governance System, On-line Trading System etc )
2. Develop dynamic web application essence as an extension to project 1 using either (JSP/Servlet, Tomcat, MySQL/ MongoDB) or (PHP, Apache, MySQL/MongoDB) server side technologies. Text Books:
1. Achyut Godbole & Atul Kahate,” Web Technologies: TCP/IP to Internet Application
Architectures” , McGraw Hill Education publications, Third Edition, 2016
2. Ralph Moseley & M. T. Savaliya, “Developing Web Applications”, Wiley publications,
Second Edition, 2014
Reference Books:
1. Adam Bretz & Colin J Ihrig, “Full Stack Javascript Development with MEAN”, SPD,
First Edition 2015, Indian Reprint September 2015
2. GiulioZambon, “ Beginning JSP, JSF and Tomcat”, Apress Publication, Second
Edition, 2013
3. Jeremy McPeak& Paul Wilton,” Beginning JavaScript”, Wrox Publication, Fifth
Edition, 2015
4. Black Book, “ JDBC 4.2, Servlet 3.1 & JSP 2.3”, Dreamtech Press, 2016
5. Sandeep Panda, “Angular JS: Novice To Ninja”, SPD, First Edition 2014, Indian
Reprint 2015
6. J2EE Architecture, an illustrative gateway to enterprise solutions: concept to
Application Design and deployment by B. V. Kumar, S. Sangeetha, S. V.
Subrahmanya, Tata McGraw Hill Publishing Company.
Course Outcomes:
The student will be able to – 1. Design the front end view of web pages using HTML5, CSS with Bootstrap
framework
2. Perform client side web page forms validation.
3. Refine dynamic web pages with JSP, Servlet
4. Deliver realistic and extensible light weight web application using PHP.
5. Practice and utilize web framework paradigms and principles for Web development.
6. Develop reliable, efficient, scalable web services
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 78 of 141
FF No. :654
CS3017: MOBILE COMPUTING
Credits: 4 Teaching Scheme: Theory: 3 Hours / Week
Lab: 2 Hours / Week
Section 1: Topics/Content
Introduction to Cellular Networks: Personal Communication System (PCS), PCS Architecture, Cell phone generation-1G to 5G Mobile Station (UE), SIM, Base Station (enodeB), Base Station Controller, Mobile Switching Center, MSC Gateways, HLR and VLR, AuC/EIR/OSS, Radio Spectrum, Free Space Path Loss, S/N Ratio, Line of sight transmission, Length of Antenna, Fading in Mobile Environment. Cellular Network
Design: Performance Criterion, Frequency Reuse, Co-channel Interference and System Capacity, Channel Planning, Cell Splitting, Mobility Management in GSM and CDMA. Medium Access Control: Specialized MAC, SDMA, FDMA, TDMA, CDMA, Frequency Hopping Spread Spectrum (FHSS), Direct Sequence Spread Spectrum (DSSS), GMSK Modulation, 8PSK, 64 QAM, 128 QAM and OFDM
Section2: Topics/Content
GSM and CDMA : D-AMPS, GSM – Architecture, GSM Identifiers, Spectrum allocation, Physical and Logical Traffic and Control channels, GSM Bursts, GSM Frame, GSM Speech Encoding and decoding, Location Update, Incoming and Outgoing Call setup GPRS, EDGE, cdmaOne (IS-95: CDMA95), 3G and 4G Technologies for GSM
and CDMA:, W-CDMA, UMTS, HSPA (High Speed Packet Access), HSDPA, HSUPA, HSPA+, TD-SCDMA, LTE (E-UTRA) 3GPP2 family CDMA2000 1x, 1xRTT, EV-DO (Evolution-Data Optimized), Long Term Evolution (LTE) in 4G
List of Practical’s: (For THP)
Operating System recommended: - 64-bit Open source Linux or its derivative
Programming tools recommended: - Android Studio 3.x, JAVA
Project 1: Design a Mobile App for ( Learning How To Develop App)
Phone Call. Media Player Simple Calculator Sms Manager Google Map To Trace The Location Of Device Frame Animation
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 79 of 141
Project 2. : Design mobile app to perform the task of creating the splash screen for the application using timer, camera options and integrate google map api on the first page of the application. Make sure map has following features:
i) Zoom & View change
ii) Navigation to specific locations
iii) Marker & getting location with touch
iv) Monitoring of location Project 3. : Create an app to add of a product to SQLite database and make sure to add following features
i) SMS messaging and email provision ii) Bluetooth options iii) Accessing Web services iv) Asynchronous remote method call v) Use Alert box for user notification
Project 4. : Create an application for Bank using spinner, intent
a) Form 1: Create a new account for customer b) Form 2: Deposit money in customer account. c) Link both forms, after completing of first form the user should be directed to the
second form d) Provide different menu options
Project 5. : Create the module for payment of fees for College by demonstrating the following methods.
i) FeesMethod()- for calculation of fees ii) Use customized Toast for successful payment of fees iii) Implement an alarm in case someone misses out on the fee submission
deadline iv) Demonstrate the online payment gateway
Project 5. : Create the module for collecting cellular mobile network performance parameters using telephony API Manager
i) Nearest Base Station ii) Signal Strengths iii) SIM Module Details iv) Mobility Management Information
Text Books:
1. Jochen Schiller, “Mobile Communications “,Pearson Education,Second Edition, 2004,
ISBN: 13: 978-8131724262
2. Smith Collins, “3G Wireless Networks” McGraw Hill Communications, Second
Edition , Indian Print, 2016, ISBN-13 978-0-07-063692-7
3. Martin Sauter, “3G, 4G and Beyond: Bringing Networks, Devices and the Web
Together”, 2012, ISBN-13: 978-1118341483
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 80 of 141
Reference Books: 1. Wireless Communications – Principles and Practice by Theodore S Rappaport,
Pearson Education.
2. Wireless Communication and Networks by William Stallings, Second Edition, Prentice
Hall
3. https://developer.android.com
Course Outcomes:
The student will be able to –
1. Select components and radio spectrum for PCS based on bandwidth requirement. 2. Justify the Mobile Network performance parameters and design decisions. 3. Choose the modulation technique for setting up mobile network. 4. Formulate GSM/CDMA mobile network layout considering futuristic
requirements which conforms to the technology. 5. Deploy the 3G/4G technology based network with bandwidth capacity planning. 6. Adapt to the requirements of next generation mobile network and mobile
applications.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 81 of 141
FF No. :654
CS 3018: NETWORK SECURITY
Credits: 04 Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Section 1: Topics/Contents
Introduction: Introduction to Security: Vulnerabilities, Threats, Threat Modeling, Risk, attack and attack types, Avoiding attacks, Security services. Trustworthiness, Ethical issues and practices, Tradeoffs of balancing key security properties - Confidentiality, Integrity, Availability. Protocol Vulnerabilities: DoS and DDoS, session hijacking, ARP spoofing, Pharming attack, Dictionary Attacks. Software vulnerabilities: Phishing, buffer overflow, Cross-site scripting attack, Virus and Worm Features, Trojan horse, Social engineering attacks, ransomware, SYN-Flooding, SQL- injection, DNS poisoning, Sniffing Bitcoin and Crypto currency system. Private key cryptography: Mathematical background for cryptography: modulo arithmetic, GCD (Euclids algorithm), algebraic structures (Groups, Rings, Fields, Polynomial Field). Role of random numbers in security, Importance of prime numbers Data Encryption Standard: Block cipher, Stream cipher, Feistel structure, round function, block cipher modes of operation, S-DES, Attacks on DES, S-AES, AES. Public key cryptography: RSA: RSA algorithm, Key generation in RSA, attacks on RSA. Diffie-Hellman key exchange: Algorithm, Key exchange protocol, Attack. Elliptic Curve Cryptography (ECC): Elliptic Curve over real numbers, Elliptic Curve over Zp, Elliptic Curve arithmetic. Diffie-Hellman key exchange using ECC.Chinese remainder theorem Section2:Topics/Contents
Authentication and access control: Message authentication and Hash Function. Authentication: One-Way Authentication, Mutual Authentication, SHA-512, Centralized Authentication, The Needham-Schroeder Protocol. Authentication Applications: Kerberos, X.509 authentication service, public key infrastructure. Access Control in Operating Systems: Discretionary Access Control, Mandatory Access Control, Role Based Access Control. Security application and design: Network layer security: IPSec for IPV4 and IPV6. Transport layer security: SSL and TLS. Application layer security: Security services, S/MIME, PGP, Https, Honey pots. Security design: End-to-end security, Security composability, Open design, Cost and tradeoffs Cyber Security:Cyber Attack, Cyber Reconnaissance, Crimes in Cyber Space-Global Trends & classification, e-commerce security, Computer forensics, facebook forensic, mobile forensic, cyber forensic, digital forensic, Introduction to MQTT and CoAP for IoT.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 82 of 141
List of Practicals:
1. Implementation of Caesar and Vigenere Cipher 2. Implementation of Playfair Cipher 3. Implementation of Hill Cipher 4. Implementation of S-RC4 5. Implementation of S-DES 6. Implementation of S-AES 7. Implementation of RSA. 8. Implementation of Diffie-Hellman key exchange 9. Implementation of ECC algorithm. 10. Study of Nessus tool
Text Books:
1. “Cryptography and Network Security-Principles and Practices” by William Stallings, Pearson Education, 2006, ISBN 81-7758-774-9, 4th Edition.
2. “Network Security and Cryptography”, by Bernard Menezes, Cengage Learning, 2010, ISBN 81-315-1349-1, 1st Edition.
Reference Books :
1. “Computer Security: Art and Science”, by Matt Bishop, Pearson Education, 2002, ISBN 0201440997, 1st Edition.
2. “Network security, private communication in a public world”, by Charlie Kaufman, Radia Perlman and Mike Spencer, Prentice Hall, 2002, ISBN 9780130460196, 2nd Edition.
3. “Cryptography and Information Security”, by V.K. Pachghare, PHI, 2015, ISBN-978-81-203-
5082-3, Second Edition.
Additional Reading 1. “Security architecture, design deployment and operations”, by Christopher M. King, Curtis
Patton and RSA press, McGraw-Hill, 2001, ISBN 0072133856, 1st Edition.
2. ‘Inside Network Perimeter Security” by Stephen Northcott, Leny Zeltser, et al, Pearson
Education Asia, ISBN 8178087618, 1st Edition.
Course Outcomes:
Upon completion of the course, the students will be able to: 1. Analyze cryptographic techniques using a mathematical approach by examining
nature of attack.
2. Establish type of attack on a given system.
3. Identify different types of attacks.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 83 of 141
4. Justify various methods of authentication and access control for application of
technologies to various sections of industry and society.
5. Design a secure system for protection from the various attacks for 7 layer model
by determining the need of security from various departments of an organization.
6. Estimate future needs of security for a system by researching current environment
on a continuous basis for the benefit of society.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 84 of 141
FF No. :654 CS3015 DATA SCIENCE
Credits: 04 Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Section 1: Topics/Contents
Introduction: Big Data Analytics, Data Scientist Role, characteristics of Big Data, Data Analytics Lifecycle Descriptive Statistics: Data Objects and Attribute Types, Basic Statistical Descriptions of Data, Measuring Data Similarity and Dissimilarity, Data Visualization Data Preprocessing: An Overview, Data Cleaning, Data Integration, Data Reduction, Data Transformation and Data Discretization Predictive Analytics: Linear Regression, Logistic Regression Market Basket Analysis: Association Rules, Optimization Techniques Section2: Topics/Contents
Classification: Supervised learning, Bayesian Classification, k-Nearest Neighbors (k-NN), Decision tree, Support Vector Machines, Neural Networks, Overfitting/Underfitting, bagging/boosting and ensemble methods, Classifier performance measures, confusion matrix, Cross validation Clustering and Outlier Detection: Unsupervised learning, K-means algorithm, hierarchical clustering, Interpretation of clusters and validation, Introduction to outlier mining, Applications, Detection Techniques Text mining: Text preprocessing, text mining operations, Categorization, Text mining applications List of Practical: (For THL, TLP courses):
Implement following assignments Using R/Python
1. Getting Started with R/Python installation, R/Python objects and basic statistics. 2. Data preprocessing, exploratory analysis, visualization. 3. Correlation and regression analysis 4. Linear Regression and Logistic Regression 5. Association Rules 6. Decision tree classifier 7. Naive Bays classifier 8. K-means and hierarchical clustering 9. Social media analytics: Twitter/Facebook/Whats app sentiment analysis.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 85 of 141
Text Books:
1. Cathy O'Neil and Rachel Schutt. Doing Data Science, Straight Talk From The
Frontline. O'Reilly. 2014.
2. “Data Mining: Concepts and Techniques”, Jiawei Han and Micheline
Kamber, Morgan Kaufman, ISBN 978-81-312-0535-8, 2nd Edition.
Reference Books:
1. Peng, Roger D and Elizabeth Matsui, “The Art of Data Science." A Guide
for Who Works with Data. Skybrude Consulting 200 (2015): 162.
2. Evans, James R., and Carl H. Lindner, "Business analytics: the next
frontier for decision sciences." Decision Line 43.2 (2012): 4-6.
3. James, G., Witten, D., Hastie, T., Tibshirani, R. An introduction to
statistical learning with applications in R. Springer, 2013.
4. Albright, Winston “Business Analytics: Data Analysis and decision
making” Cengage Learning
5. Sahil Raj, “Business Analytics” , Cengage Learning
6. Camm, Cochran, Fry, Ohlmann, Anderson, Sweeney, Williams,
“Essentials of Business Analytics” Cengage Learning
Course Outcomes:
The student will be able to – 1. Perform exploratory data analysis. 2. Apply regression to real world examples. 3. Build and use classification model for given task. 4. Identify appropriate clustering algorithm based on data set. 5. Detect outliers in data set. 6. Analyze social media sentiments.
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 86 of 141
FF No. :654
CS3020: BUSINESS INTILEGENCE
Credits: 04 Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Section 1: Topics/Contents
Introduction: What is business intelligence and analytics? Need for BI&A, how businesses use BI&A. Evolution of BI&A. Interplay among Business Intelligence, Business Analytics, Data Science, Data Mining, Data Analytics, Data Warehousing, Statistics and Machine Learning. Drawing insights from data: DIKW pyramid, Categorization of Analytics: DIPP. Concept of a model and its characterization. Data Preprocessing: Typical preprocessing operations: combining values into one, handling incomplete or incorrect data, handling missing values, recoding values, subsetting, sorting, transforming scale, determining percentiles, data manipulation, removing noise, removing inconsistencies, transformations, standardizing, normalizing - min-max normalization, z-score standardization, rules of standardizing data. Descriptive Statistics: role of statistics in analytics, types of data (scales of measurement - NOIR), data distributions, measures of variability (range, quartile, five number summary, variance, std dev, coeff of variation), analyzing distributions, Chebychev’s Inequality, measures of shape (skewness, kurtosis), measures of association (covariance, correlation), outliers. Inferential Statistics: Role of probability in analytics. Need for sampling, generating samples, sampling and non-sampling error. Sampling Distribution of Mean, Central Limit Theorem, Standard Error. Estimation: Point and Interval Estimates, Confidence Intervals, level of confidence, sample size.
Section2:Topics/Contents
Hypothesis Testing: basic concepts, Errors in hypothesis testing, Power of test, Level of significance, p-value, general procedure for hypothesis testing. Parametric tests – z test, t test, chi-square test. Hypothesis testing of means: two tailed and one-tailed tests. Chi- square test for independence and goodness of fit. Hypothesis testing for comparing two related samples. Limitations of hypothesis testing. Picking up the right test for a given scenario.Similarity Measures: Design of recommender systems - user based and item based collaborative filtering. Regression Analysis: Correlation and regression, Simple Linear Regression Model,Least Squares Method. Making Data Models more flexible, making data models more selective, dealing with Categorical variables. Introduction to Time Series Analysis and Forecasting: Time series patterns, forecast accuracy, moving averages and exponential smoothing, casual models, using regression
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 87 of 141
analysis for forecasting.
List of Practicals: (For THL, TLP courses)
1. Getting started: understand what business do with their data with a scenario based application using QlikView tool 2. Designing an end to end warehousing solution for a real world scenario involving multi-dimensional modeling, designing data cube, doing ETL, OLAP and reporting 3. Getting started with R 4. Using R for data preprocessing, exploratory analysis, visualization, correlation and regression analysis, hypothesis testing, chi square test 5. Data analysis case study using R for a readily available data set 6. BigData Analytics - MapReduce and exposure to Hadoop, Using R over Hadoop 7. [Optional] A group mini-project: take a real world data analysis problem and solve it using the above learned concepts a. Getting Data from varied sources b. Data massaging to prepare it for analysis c. Generating visualizations to interpret descriptive analysis d. Implementing sampling and estimation techniques e. Regression analysis on data f. Hypothesis testing Text Books:
1. “Business Analytics” by James R Evans, Pearson 2. “Fundamentals of Business Analytics”, by R. N. Prasad, Seema Acharya, ISBN: 978-81-256-3203-2, Wiley-India
Reference Books: 1. “Data Mining: Concepts and Techniques”, Jiawei Han and Micheline Kamber, Morgan Kaufman, ISBN 978-81-312-0535-8, 2nd Edition 2. “Essentials of Business Analytics” by Camm, Cochran, Fry, Ohlmann, Anderson, Sweeney, Williams, Cengage Learning 3. “The Kimball Group Reader: Relentlessly Practical Tools for Data Warehousing and Business Intelligence” 2010, Ralph Kimball, Margy Ross, Wiley Publications
Course Outcomes:
The student will be able to – 1. Construct an end-to-end data warehousing solution for business intelligence involving
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 88 of 141
various data sources, ETL, multi-dimensional modeling, OLAP, reporting and analytics 2. Evaluate various data processing algorithms in their applicability to different problems 3. Display the process of converting data into a user defined format required for particular analysis 4. Utilize statistical tools in deriving insights from data
5. Describe various techniques for descriptive, predictive and prescriptive analytics 6. Apply various techniques to solve real-world data analysis problems
Vishwakarma Institute of Technology,Pune
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19 Page 89 of 141
CS3022: EDD4
Credits: 04 Teaching Scheme Theory: 1 Hours / Week
Lab: 2 Hours / Week
Tutorial: 2 Hours / Week
Vis
hw
ak
arm
a I
nst
itu
te o
f T
ech
nolo
gy
MO
DU
LE
VII
/ V
III
Tec
hn
olo
gy
Issu
e 01 :
Rev
No. 1 :
Dt.
01/0
7/1
8
Str
uct
ure
an
d s
yll
abu
s o
f S
.Y.
B.T
ech
Co
mp
ute
r E
ngin
eeri
ng. P
atte
rn B
-18,
A.Y
. 2
01
8
M
OD
UL
E V
II/
VII
I
18,
A.Y
. 2
01
8-1
9
Pag
e 9
0 o
f 1
41
MO
DU
LE
VII
/ V
III
Vis
hw
ak
arm
a I
nst
itu
te o
f T
ech
nolo
gy
Tit
le:
Cou
rse
Str
uct
ure
Bra
nch
: C
om
pute
r Y
ear:
B.T
ech.
A.Y
.: 2
01
8
Su
bje
ct
No.
Su
bje
ct
Cod
e S
ub
ject
Na
me
S1
CS
4001
CS
4002
CS
4013
*
OE
-1
•
Hum
an C
om
pute
r
Inte
ract
ion
•
Ente
rpri
se S
yst
ems
•
Conver
gen
ce
Tec
hnolo
gie
s
S2
CS
4003
CS
4004
* O
E-2
•
Clo
ud C
om
puti
ng
•
Par
alle
l C
om
puti
ng
•
Nat
ura
l L
angu
age
Pro
cess
ing Tec
hn
olo
gy
Issu
e 01 :
Rev
No. 1 :
Dt.
01/0
7/1
8
Str
uct
ure
an
d s
yll
abu
s o
f S
.Y.
B.T
ech
Co
mp
ute
r E
ngin
eeri
ng. P
atte
rn B
-18,
A.Y
. 2
01
8
Issu
e 1, R
ev. 1 , D
t. 0
1
Tit
le:
Cou
rse
Str
uct
ure
201
8-1
9 M
od
ule
: V
II
P
att
ern
: B
-18.
1.
Tea
chin
g S
chem
e
(Hrs
/Wee
k)
Exam
inati
on
S
chem
e
Th
eory
L
AB
T
ut.
C
A
MS
E
(%)
H
A
(%)
LA
B
(%)
ES
E
(%)
3
- -
10
- 10
60
3
2
-
10
30
10
30
18,
A.Y
. 2
01
8-1
9
Pag
e 9
1 o
f 1
41
Issu
e 1, R
ev. 1 , D
t. 0
1/0
7/2
018
F
F N
o. 653
Sch
eme
C
red
its
ES
A
Tota
l
ES
E
(%)
VIV
A
(%)
60
20
100
3
30
20
100
4
Vis
hw
ak
arm
a I
nst
itu
te o
f T
ech
nolo
gy
CS
4011
S
3
CS
4005
CS
4006
CS
4007
CS
4008
CS
4009
CS
4010
CS
4012
CS
4014
CS
4015
**O
E -
3
•
Com
ponen
t-bas
ed
Syst
em C
onst
ruct
ion
•
Dat
a M
inin
g &
Dat
a
War
ehousi
ng
•
Model
ling a
nd
Sim
ula
tion
•
Inte
rnet
of
Thin
gs
•
Imag
e P
roce
ssin
g
•
Model
-bas
ed
Syst
ems
En
gin
eeri
ng
•
Gen
etic
Alg
ori
thm
s
•
Soft
war
e T
esti
ng a
nd
Qual
ity A
ssura
nce
•
Soft
war
e
Arc
hit
ectu
re a
nd
Des
ign
PR
J.
CS
4000
C
S4099
Maj
or
Pro
ject
1
OR
M
ajor
Pro
ject
2
Tec
hn
olo
gy
Issu
e 01 :
Rev
No. 1 :
Dt.
01/0
7/1
8
Str
uct
ure
an
d s
yll
abu
s o
f S
.Y.
B.T
ech
Co
mp
ute
r E
ngin
eeri
ng. P
atte
rn B
-18,
A.Y
. 2
01
8
3
2
-
10
30
10
30
- 8
- -
- -
18,
A.Y
. 2
01
8-1
9
Pag
e 9
2 o
f 1
41
30
20
100
4
- -
100
4
Vis
hw
ak
arm
a I
nst
itu
te o
f T
ech
nolo
gy
PD
C
S4093
**P
D3 (
Audit
Cours
e)
T
OT
AL
Tec
hn
olo
gy
Issu
e 01 :
Rev
No. 1 :
Dt.
01/0
7/1
8
Str
uct
ure
an
d s
yll
abu
s o
f S
.Y.
B.T
ech
Co
mp
ute
r E
ngin
eeri
ng. P
atte
rn B
-18,
A.Y
. 2
01
8
- -
--
-
- -
9
12
-
18,
A.Y
. 2
01
8-1
9
Pag
e 9
3 o
f 1
41
- -
- -
15
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS4001: HUMAN COMPUTER INTERACTION
Credits: 04
Section 1: Topics/Contents
Introduction to Human-Computer Interaction
Human, Definition of Human Computer Interaction, Interdisciplinary Nature, Goals, Human Factors, Measurable Factors Early Focus on Users, Ergonomics, Usability, Types of UsabilitContexts - Web, Business, Mobile, Gaming Applications, Categorization of Applications based on Human Factors, Accessibility and Security.Principles and Models
Eight Golden Rules of Interface Design, Principles of Good Design, FaultMiller’s Principle, Norman’s Action Model, Gulf of Execution and Evaluation, Errors Mistakes, Slips, Lapses and Violations, Guidelines for Data Display, Guidelines for Data Entry, Conceptual, Semantic, Syntactic and Lexical Model, Task AnalysiKeystroke-Level Model, User Persona, UI Standards and GUI Libraries.Design Process and Interaction Styles
Design, Three Pillars of Design, Process of Design, Ethnographic Observations, Contextual Inquiry, Iterative Design, Participatory Design, NDesign, - Layout, Color, Fonts, Labeling, LUCID, Scenarios, Interaction Styles Manipulation, Menu Selection, FormInternationalization, Interaction Design Patterns.
Section2:Topics/Contents
Evaluation Techniques and Interface Categories
Expert-based Evaluation, UserWalkthrough, Semiotic Analysis, Expert Reviews, Usability Testing, User Surveys, Interviews, Think Aloud, AcceptPlace Interfaces, Wearable Interfaces, Tangible Interfaces, Intelligent Interfaces, Ubiquitous and Context-Aware Interaction.Documentation and Groupware
Classification of Documents, Printed ManualsTutorial, Error / Warning Messages, Groupware, Goals / Dimensions of Cooperation, Asynchronous Interactions, Synchronous Interactions, Online Communities, Communityware
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS4001: HUMAN COMPUTER INTERACTION
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Computer Interaction (HCI)
Human, Definition of Human Computer Interaction, Interdisciplinary Nature, Goals, Human Factors, Measurable Factors – Learn ability, Speed, Efficiency, Satisfaction. Early Focus on Users, Ergonomics, Usability, Types of Usability, User Interface (UI),
Web, Business, Mobile, Gaming Applications, Categorization of Applications based on Human Factors, Accessibility and Security.
Eight Golden Rules of Interface Design, Principles of Good Design, FaultMiller’s Principle, Norman’s Action Model, Gulf of Execution and Evaluation, Errors Mistakes, Slips, Lapses and Violations, Guidelines for Data Display, Guidelines for Data Entry, Conceptual, Semantic, Syntactic and Lexical Model, Task Analysi
Level Model, User Persona, UI Standards and GUI Libraries. Design Process and Interaction Styles
Design, Three Pillars of Design, Process of Design, Ethnographic Observations, Contextual Inquiry, Iterative Design, Participatory Design, Navigation Design, Visual
Layout, Color, Fonts, Labeling, LUCID, Scenarios, Interaction Styles Manipulation, Menu Selection, Form-Filling, Commands, Natural Language, Internationalization, Interaction Design Patterns.
Evaluation Techniques and Interface Categories
based Evaluation, User-based Evaluation, Heuristic Evaluation, Cognitive Walkthrough, Semiotic Analysis, Expert Reviews, Usability Testing, User Surveys, Interviews, Think Aloud, Acceptance Tests, Statistical Methods, Touch Interfaces, Public Place Interfaces, Wearable Interfaces, Tangible Interfaces, Intelligent Interfaces,
Aware Interaction. Documentation and Groupware
Classification of Documents, Printed Manuals, Reading from Displays, Online Help, Tutorial, Error / Warning Messages, Groupware, Goals / Dimensions of Cooperation, Asynchronous Interactions, Synchronous Interactions, Online Communities,
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 94 of 141
FF No. :654
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Human, Definition of Human Computer Interaction, Interdisciplinary Nature, Goals, Learn ability, Speed, Efficiency, Satisfaction.
y, User Interface (UI), Web, Business, Mobile, Gaming Applications, Categorization of Applications
Eight Golden Rules of Interface Design, Principles of Good Design, Faulty Designs, Miller’s Principle, Norman’s Action Model, Gulf of Execution and Evaluation, Errors – Mistakes, Slips, Lapses and Violations, Guidelines for Data Display, Guidelines for Data Entry, Conceptual, Semantic, Syntactic and Lexical Model, Task Analysis, GOMS,
Design, Three Pillars of Design, Process of Design, Ethnographic Observations, avigation Design, Visual
Layout, Color, Fonts, Labeling, LUCID, Scenarios, Interaction Styles - Direct Filling, Commands, Natural Language,
based Evaluation, Heuristic Evaluation, Cognitive Walkthrough, Semiotic Analysis, Expert Reviews, Usability Testing, User Surveys,
ance Tests, Statistical Methods, Touch Interfaces, Public Place Interfaces, Wearable Interfaces, Tangible Interfaces, Intelligent Interfaces,
, Reading from Displays, Online Help, Tutorial, Error / Warning Messages, Groupware, Goals / Dimensions of Cooperation, Asynchronous Interactions, Synchronous Interactions, Online Communities,
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Miscellaneous
Case Studies: Web Usability, Sites, Messengers, E-Governance Sites, Security Tools, e
List of Project areas: (For THL, TLP courses)
1. Identify specialized users and related facilities for a selected product /
make necessary suggestions for its improved accessibility design.2. Design user persona for the users of selected product / system.3. Conduct a contextual inquiry for selected product / system.4. Design an interface prototype for selected product / s5. Evaluate an interface using usability evaluation technique.
Text Books:
1. “Human-Computer Interaction”, Alan Dix, Janet Finlay, Gregory D. Abowd, Russell
Beale, Pearson Education, ISBN 81
2. “Designing the User Interface”,
7808-262-4, 3rd Edition
Reference Books:
1. “The Design of Everyday Things”, Donald Norman, Basic Books, ISBN 100
06710-7, 2002 Edition
2. “The Essential Guide to User Interface Design”, Wilbert O. Galitz,
India (P) Ltd., ISBN 81-265
3. “Human-Computer Interaction in the New Millennium”, John M. Carroll, Pearson
Education, ISBN 81-7808
Course Outcomes:
The student will be able to – 1. Identify human factors and usabili
2. Differentiate computing applications into categories based on human factors
3. Design a user interface by applying suitable design principles, models and usability
guidelines
4. Integrate ethno-cultural and accessibi
design
5. Display the impact of usability evaluation and testing in computing applications
6. Follow required processes and standards while designing user interfaces
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Case Studies: Web Usability, Mobile Usability, Embedded Systems, Social Networking Governance Sites, Security Tools, e-Health applications
: (For THL, TLP courses)
Identify specialized users and related facilities for a selected product /make necessary suggestions for its improved accessibility design. Design user persona for the users of selected product / system. Conduct a contextual inquiry for selected product / system. Design an interface prototype for selected product / system. Evaluate an interface using usability evaluation technique.
Computer Interaction”, Alan Dix, Janet Finlay, Gregory D. Abowd, Russell
Beale, Pearson Education, ISBN 81- 297-0409-9, 3rd Edition.
“Designing the User Interface”, Ben Shneiderman, Pearson Education, ISBN 81
“The Design of Everyday Things”, Donald Norman, Basic Books, ISBN 100
“The Essential Guide to User Interface Design”, Wilbert O. Galitz, Wiley
265-0280-0, 2nd Edition.
Computer Interaction in the New Millennium”, John M. Carroll, Pearson
7808-549-6.
Identify human factors and usability issues related with computing applications
Differentiate computing applications into categories based on human factors
Design a user interface by applying suitable design principles, models and usability
cultural and accessibility computing aspects into the user interface
Display the impact of usability evaluation and testing in computing applications
Follow required processes and standards while designing user interfaces
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 95 of 141
Mobile Usability, Embedded Systems, Social Networking Health applications
Identify specialized users and related facilities for a selected product / system and
Computer Interaction”, Alan Dix, Janet Finlay, Gregory D. Abowd, Russell
Ben Shneiderman, Pearson Education, ISBN 81-
“The Design of Everyday Things”, Donald Norman, Basic Books, ISBN 100-465-
Wiley-dreamtech
Computer Interaction in the New Millennium”, John M. Carroll, Pearson
ty issues related with computing applications
Differentiate computing applications into categories based on human factors
Design a user interface by applying suitable design principles, models and usability
lity computing aspects into the user interface
Display the impact of usability evaluation and testing in computing applications
Follow required processes and standards while designing user interfaces
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS 4002: ENTERPRISE SYSTEMS
Credits: 04
Section 1: Topics/Contents
Flexible Systems: The Reality of Imperfect Knowledge and Flexibility, Characterizing Flexible Software, Software Change, Evolution of Flexibility, Software basis: Outcome, Not Methodology, Software Engineering Shifts, Roles and Responsibilities in Traditional and Flexible Development, Guidelines for Flexible Software Design, The Importance of Stable Identifiers, Regulation: Managing Artificial Limits., Stable Information Structures, The Generic-Entity Cloud, Flexibility and Strategic Systems Planning, Requirements Determination for Flexible Systems, System Design with an Eye on Flexibility, Implementing Stable Identifiers, Testing and Maintenance of Flexible Software, Identifying, Managing Quality Flexible SoftwareSOA Fundamentals: ServiceOriented Computing, The Evolution of SOA, Principles of Serviceand Benefits of Service-Oriented Computing, ServiceService-Orientation, Challenges Introduced by ServiceOrientation on the Enterprise, Origins and Influences of ServiceUnderstanding Design Principles, Principle Profiles, Design Pattern References, Principles and Design Granularity Service Contracts (Standardization anContract Standardization, Contracts and Service Design, Versioning, Technology / Development Tool Dependencies Service Coupling (Intra-Service and Consumer Dependencies): Coupling principles, Service Contract Coupling Types, Service Consumer Coupling Types, Service Loose Coupling and Service Design, Enterprise Service Bus, Web Services and Primitive SOA, Web Services and Contemporary SOA, Service Layers SOA Design Principles: Service Abstraction (InformatTypes): Abstraction principles, Types of Meta Abstraction, Measuring Service Abstraction, Service Abstraction and Service Design, Risks with Service Abstraction Service Reusability (Commercial and Agnostic Design): Reuse PrReuse in SOA, Service Reusability and Service Design Service Autonomy (Processing Boundaries and Control): of Service Autonomy, Measuring Service Autonomy, Service Contract Autonomy (services with normalized contracts) Service Statelessness (State Management Deferral and Stateless Design): State Management, Measuring Service Statelessness, Statelessness and Service Design
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS 4002: ENTERPRISE SYSTEMS
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
: The Reality of Imperfect Knowledge and Flexibility, Characterizing Flexible Software, Software Change, Evolution of Flexibility, Software basis: Outcome, Not Methodology, Software Engineering Shifts, Roles and Responsibilities in Traditional
lexible Development, Guidelines for Flexible Software Design, The Importance of Stable Identifiers, Regulation: Managing Artificial Limits., Stable Information Structures,
Entity Cloud, Flexibility and Strategic Systems Planning, Requirements etermination for Flexible Systems, System Design with an Eye on Flexibility,
Implementing Stable Identifiers, Testing and Maintenance of Flexible Software, Identifying, Managing Quality Flexible Software
: Service-Oriented Computing and SOA , Introduction to ServiceOriented Computing, The Evolution of SOA, Principles of Service-Orientation, Goals
Oriented Computing, Service-Orientation, Problems Solved by Orientation, Challenges Introduced by Service-Orientation, Effects of Service
Orientation on the Enterprise, Origins and Influences of ServiceUnderstanding Design Principles, Principle Profiles, Design Pattern References, Principles and Design Granularity Service Contracts (Standardization and Design): Contracts principles, Types of Service Contract Standardization, Contracts and Service Design, Versioning, Technology / Development Tool Dependencies
Service and Consumer Dependencies): Coupling principles, act Coupling Types, Service Consumer Coupling Types, Service Loose
Coupling and Service Design, Enterprise Service Bus, Web Services and Primitive SOA, Web Services and Contemporary SOA, Service Layers
: Service Abstraction (Information Hiding and Meta Abstraction Types): Abstraction principles, Types of Meta Abstraction, Measuring Service Abstraction, Service Abstraction and Service Design, Risks with Service Abstraction Service Reusability (Commercial and Agnostic Design): Reuse Principle, Service Reuse in SOA, Service Reusability and Service Design Service Autonomy (Processing Boundaries and Control): Autonomy Principle, Types of Service Autonomy, Measuring Service Autonomy, Service Contract Autonomy
ntracts) Autonomy and Service Design Service Statelessness (State Management Deferral and Stateless Design): State Management, Measuring Service Statelessness, Statelessness and Service Design
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 96 of 141
FF No. :654
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
: The Reality of Imperfect Knowledge and Flexibility, Characterizing Flexible Software, Software Change, Evolution of Flexibility, Software basis: Outcome, Not Methodology, Software Engineering Shifts, Roles and Responsibilities in Traditional
lexible Development, Guidelines for Flexible Software Design, The Importance of Stable Identifiers, Regulation: Managing Artificial Limits., Stable Information Structures,
Entity Cloud, Flexibility and Strategic Systems Planning, Requirements etermination for Flexible Systems, System Design with an Eye on Flexibility,
Implementing Stable Identifiers, Testing and Maintenance of Flexible Software,
A , Introduction to Service-Orientation, Goals
Orientation, Problems Solved by tion, Effects of Service-
Orientation on the Enterprise, Origins and Influences of Service-Orientation, Understanding Design Principles, Principle Profiles, Design Pattern References,
d Design): Contracts principles, Types of Service Contract Standardization, Contracts and Service Design, Versioning, Technology /
Service and Consumer Dependencies): Coupling principles, act Coupling Types, Service Consumer Coupling Types, Service Loose
Coupling and Service Design, Enterprise Service Bus, Web Services and Primitive SOA,
ion Hiding and Meta Abstraction Types): Abstraction principles, Types of Meta Abstraction, Measuring Service Abstraction, Service Abstraction and Service Design, Risks with Service Abstraction
Service
Autonomy Principle, Types of Service Autonomy, Measuring Service Autonomy, Service Contract Autonomy
Service Statelessness (State Management Deferral and Stateless Design): State Management, Measuring Service Statelessness, Statelessness and Service Design
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
SOA Delivery Strategies, ServiceService-Oriented Design: Introduction, SOA Composition Guidelines), Service Design, Importance of WSDL, SOAP, The use of registries via UDDI
Section2:Topics/Contents
SOA Technology and Implementation
Communication): Discoverability, Types of Discovery and Discoverability, Measuring Service Discoverability, Discoverability and Service Service Composability (Composition Member Design and Complex Compositions): Composition, Composition Concepts and Terminology, Complex Service Composition, Measuring Service Composability and Composition Effectiveness Potential, Composition and Service Design, ServiceOrientation Principles to StrateEnterprise Architecture: Introduction to Enterprise Architecture, State of the Art and Foundations of Enterprise Architecture, Communication of Enterprise Architecture, Language for Enterprise Modeling, Viewpoints and Architecture Alignment, Tool Support, DomainArchitecture, Defining EAI, The EAI Process, DataLevel EAI, Method-Level EAI, User InterfaceEnterprise Architecture Frameworks
(TOGAF), Zachman Enterprise Architecture Framework, Extended Enterprise Architecture Framework (E2AF), Federal Enterprise Architecture Framework (FEAF), Treasury Enterprise Architecture Framework (TEAF), Capgemini’s Integrated Architecture Framework (IAF), Command, Control, Communications, Computers, Intelligence, Surveillance, and Reconnaissance, (C4ISR) and DoDAF, TAFIM, Computer Integrated Manufacturing OpReference Architecture (PERA), IEEE Std 1471
List of Practicals: (For THL, TLP courses)
1. To narrate concise Requirement Definition Document and System Requirements Specification Document for target Standard guidelines clearly indicating the requirements considerations.
2. To decompose and organize the problem domain area into broad subject areas and identify the boundaries of problem/system along with identiProcesses and develop full detail Business Process diagrams.
3. To develop Domain-lexicon and context-based terminologies.
4. To identify and categorize the target system services withspecifications modeled with component diagram incorporating appropriate architectural style and coupling.
5. To design the service layers and tiers modeled with deployment diagram accommodating abstraction, autonomy, statelessness and reuse.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
SOA Delivery Strategies, Service-Oriented Analysis: Introduction, Service Modeling, Oriented Design: Introduction, SOA Composition Guidelines), Service Design,
Importance of WSDL, SOAP, The use of registries via UDDI
SOA Technology and Implementation: Service Discoverability (Interpretability and Communication): Discoverability, Types of Discovery and Discoverability, Measuring Service Discoverability, Discoverability and Service Service Composability (Composition Member Design and Complex Compositions):
ion Concepts and Terminology, Complex Service Composition, Measuring Service Composability and Composition Effectiveness Potential, Composition and Service Design, Service-Orientation and Object-Orientation, Mapping Service
Strategic Goals, SOA Platforms : Introduction to Enterprise Architecture, State of the Art and
Foundations of Enterprise Architecture, Communication of Enterprise Architecture, Language for Enterprise Modeling, Viewpoints and Visualization, Architecture Analysis, Architecture Alignment, Tool Support, Domain-Driven Architecture, ResourceArchitecture, Defining EAI, The EAI Process, Data-Level EAI, Application Interface
Level EAI, User Interface-Level EAI, EAI InrteroperabilityEnterprise Architecture Frameworks: The Open Group Architecture Framework (TOGAF), Zachman Enterprise Architecture Framework, Extended Enterprise Architecture Framework (E2AF), Federal Enterprise Architecture Framework (FEAF),
asury Enterprise Architecture Framework (TEAF), Capgemini’s Integrated Architecture Framework (IAF), Command, Control, Communications, Computers, Intelligence, Surveillance, and Reconnaissance, (C4ISR) and DoDAF, TAFIM, Computer Integrated Manufacturing Open System Architecture (CIMOSA), Purdue Enterprise Reference Architecture (PERA), IEEE Std 1471-2000
List of Practicals: (For THL, TLP courses)
To narrate concise Requirement Definition Document and System Requirements Specification Document for target system with reference to the IEEE 610.12.1990 Standard guidelines clearly indicating the requirements considerations.To decompose and organize the problem domain area into broad subject areas and identify the boundaries of problem/system along with identification of Business Processes and develop full detail Business Process diagrams.
-driven vocabulary of the target system indicating domain based terminologies.
To identify and categorize the target system services with detailed service specifications modeled with component diagram incorporating appropriate architectural style and coupling. To design the service layers and tiers modeled with deployment diagram accommodating abstraction, autonomy, statelessness and reuse.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 97 of 141
duction, Service Modeling, Oriented Design: Introduction, SOA Composition Guidelines), Service Design,
nterpretability and Communication): Discoverability, Types of Discovery and Discoverability, Measuring
Service Composability (Composition Member Design and Complex Compositions): ion Concepts and Terminology, Complex Service Composition,
Measuring Service Composability and Composition Effectiveness Potential, Composition Orientation, Mapping Service-
: Introduction to Enterprise Architecture, State of the Art and Foundations of Enterprise Architecture, Communication of Enterprise Architecture,
Visualization, Architecture Analysis, Driven Architecture, Resource-Oriented
Level EAI, Application Interface-AI, EAI Inrteroperability
: The Open Group Architecture Framework (TOGAF), Zachman Enterprise Architecture Framework, Extended Enterprise Architecture Framework (E2AF), Federal Enterprise Architecture Framework (FEAF),
asury Enterprise Architecture Framework (TEAF), Capgemini’s Integrated Architecture Framework (IAF), Command, Control, Communications, Computers, Intelligence, Surveillance, and Reconnaissance, (C4ISR) and DoDAF, TAFIM, Computer
en System Architecture (CIMOSA), Purdue Enterprise
To narrate concise Requirement Definition Document and System Requirements system with reference to the IEEE 610.12.1990
Standard guidelines clearly indicating the requirements considerations. To decompose and organize the problem domain area into broad subject areas and
fication of Business
driven vocabulary of the target system indicating domain
detailed service specifications modeled with component diagram incorporating appropriate
To design the service layers and tiers modeled with deployment diagram
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
6. To map the service levels and primitives to appropriate Strategies for data processing using XML / XQuery/ JSON / JAXB.
7. To produce, invoke, compose Web Services using SOAP, WSDL and UDDI.8. To implement and integrate the components of the target system u
J2EE platforms adhering to Service specifications.9. To create the balanced scorecard for the target system indicating the standards and
principles applied. Text Books:
1. Mathias Weske, Business Process Management, Concepts, Languages,
Architectures, ISBN 978
2007
2. Thomas Erl, Service-
ISBN: 0-13-185858-0, Publisher: Prentice Hall PTR, 2005 Reference Books :
1. Thomas Erl, SOA Principles of
13-234482-3, 2007
2. Eric A. Marks, Michael Bell., Executive’s guide to service
John Wiley & Sons, Inc.ISBN
3. Daniel Minoli, Enterprise Architecture A to Z, Fram
Modeling, SOA, and Infrastructure Technology, Auerbach Publications, Taylor &
Francis Group, ISBN 978
4. SetragKhoshafian, Service Oriented Enterprises, Auerbach Publications, Taylor
& Francis Group, ISBN 0
5. Mike Rosen, Boris Lublinsky, Kevin T. Smith, Marc J. Balcer, Applied SOA:
Service-Oriented Architecture and Design Strategies, Wiley Publishing, Inc.,
ISBN: 978-0-470-22365
6. Marc Lankhorst et al., Enterprise Architecture at Work, Modelli
Communication and Analysis, Second Edition, ISBN 978
Springer-Verlag Berlin Heidelberg 2009
7. David S. Linthicum,Enterprise Application Integration, Addison
Professional 2003, ISBN
Course Outcomes:
Upon completion of the course, graduates will1. Model business requirements and business processes using BPMN 2.0 standard
encompassing Process Orchestrations and Choreographies.2. Discover the set of services with composite services creation and designing
services to facilitate integration and understand interrelationships among SOA, Web Services, OOD and IT infrastructure.
3. Explore the concepts, guidelines and technology for service orchestration to integrate a Business Process Management Solution in an Enterprisesocietal context.
4. Prepare well-formed specifications and reports for service composition and delivery to the stakeholders.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
To map the service levels and primitives to appropriate Strategies for data processing using XML / XQuery/ JSON / JAXB. To produce, invoke, compose Web Services using SOAP, WSDL and UDDI.To implement and integrate the components of the target system uJ2EE platforms adhering to Service specifications. To create the balanced scorecard for the target system indicating the standards and
Mathias Weske, Business Process Management, Concepts, Languages,
s, ISBN 978-3-540-73521-2 Springer Berlin Heidelberg New York,
-Oriented Architecture: Concepts, Technology, and Design.
0, Publisher: Prentice Hall PTR, 2005
Thomas Erl, SOA Principles of Service Design, Pearson Education, Inc., ISBN 0
Eric A. Marks, Michael Bell., Executive’s guide to service-oriented architecture,
John Wiley & Sons, Inc.ISBN-13: 978-0-471-76894-4, 2006
Daniel Minoli, Enterprise Architecture A to Z, Frameworks, Business Process
Modeling, SOA, and Infrastructure Technology, Auerbach Publications, Taylor &
Francis Group, ISBN 978-0-8493-8517-9, 2008
SetragKhoshafian, Service Oriented Enterprises, Auerbach Publications, Taylor
& Francis Group, ISBN 0-8493-5360-2, 2007
Mike Rosen, Boris Lublinsky, Kevin T. Smith, Marc J. Balcer, Applied SOA:
Oriented Architecture and Design Strategies, Wiley Publishing, Inc.,
22365-9, 2008
Marc Lankhorst et al., Enterprise Architecture at Work, Modelli
Communication and Analysis, Second Edition, ISBN 978-3-642
Verlag Berlin Heidelberg 2009
David S. Linthicum,Enterprise Application Integration, Addison
Professional 2003, ISBN-10: 1402052626
the course, graduates will be able to - Model business requirements and business processes using BPMN 2.0 standard encompassing Process Orchestrations and Choreographies. Discover the set of services with composite services creation and designing
s to facilitate integration and understand interrelationships among SOA, Web Services, OOD and IT infrastructure. Explore the concepts, guidelines and technology for service orchestration to integrate a Business Process Management Solution in an Enterprise
formed specifications and reports for service composition and delivery to the stakeholders.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 98 of 141
To map the service levels and primitives to appropriate Strategies for data
To produce, invoke, compose Web Services using SOAP, WSDL and UDDI. To implement and integrate the components of the target system using .NET /
To create the balanced scorecard for the target system indicating the standards and
Mathias Weske, Business Process Management, Concepts, Languages,
2 Springer Berlin Heidelberg New York,
Oriented Architecture: Concepts, Technology, and Design.
Service Design, Pearson Education, Inc., ISBN 0-
oriented architecture,
eworks, Business Process
Modeling, SOA, and Infrastructure Technology, Auerbach Publications, Taylor &
SetragKhoshafian, Service Oriented Enterprises, Auerbach Publications, Taylor
Mike Rosen, Boris Lublinsky, Kevin T. Smith, Marc J. Balcer, Applied SOA:
Oriented Architecture and Design Strategies, Wiley Publishing, Inc.,
Marc Lankhorst et al., Enterprise Architecture at Work, Modelling,
642-01309-6,
David S. Linthicum,Enterprise Application Integration, Addison-Wesley
Model business requirements and business processes using BPMN 2.0 standard
Discover the set of services with composite services creation and designing s to facilitate integration and understand interrelationships among SOA,
Explore the concepts, guidelines and technology for service orchestration to integrate a Business Process Management Solution in an Enterprise SOA in
formed specifications and reports for service composition and
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
5. Understand case studies and lessons learned with utilization of Enterprise Architecture Integration and Frameworks knowledge implementing complex enterprise projects.
6. Create sustainable Enterprise System design supported by enterprise modelling, architecture analysis and alignment.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Understand case studies and lessons learned with utilization of Enterprise Architecture Integration and Frameworks knowledge towards planning and implementing complex enterprise projects. Create sustainable Enterprise System design supported by enterprise modelling, architecture analysis and alignment.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 99 of 141
Understand case studies and lessons learned with utilization of Enterprise towards planning and
Create sustainable Enterprise System design supported by enterprise modelling,
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS 4003:
Credits: 04
Section 1: Topics/Contents
Overview of computing paradigm:
Cluster Computing, Distributed Computing, Utility Computing, Cloud Computing. Evolution of cloud computing Introduction to Cloud Computing:
Computing, History of Cloud Computing, Cloud service providersCharacteristics & DisadvantagesComputing, Cloud computing vs. Cluster computing vs. Grid computinStandards. Cloud Computing Architecture:
computing architecture (client/server), Services provided at various levels, How Cloud Computing Works, Role of Networks in Cloud computing, protocservices. Service Models (XaaS)Service(PaaS), Software as a Service(SaaS)cloud, Hybrid cloud, Community cloudInfrastructure as a Service (IaaS):
to virtualization, Different approaches to virtualization, Hypervisors, Machine Image, Virtual Machine(VM). Resource VirtualizationMachine(resource) provisioning and manageability, storage as a service, Data storage in cloud computing(storage as a service)Storage, pricing, customers. Platform as a Service (PaaS):
Architecture (SOA). Cloud Platform and ManagementSoftware as a Service (SaaS):
Case Study on SaaS
Section2:Topics/Contents
Service Management in Cloud Computing
& Accounting, Comparing Scaling Hardware: Traditional vs. Cloudscaling: Benefitting enormouslyServices, Database & Data Stores in
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS 4003: CLOUD COMPUTING
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
paradigm: Recent trends in Computing - Grid Computing, Cluster Computing, Distributed Computing, Utility Computing, Cloud Computing. Evolution of cloud computing - Business driver for adopting cloud computing.
Cloud Computing: Cloud Computing - Introduction to Cloud Computing, History of Cloud Computing, Cloud service providersCharacteristics & Disadvantages - Pros and Cons of Cloud Computing, Benefits of Cloud Computing, Cloud computing vs. Cluster computing vs. Grid computing. Role of Open
Cloud Computing Architecture: Cloud computing stack - Comparison with traditional computing architecture (client/server), Services provided at various levels, How Cloud Computing Works, Role of Networks in Cloud computing, protocols used, Role of Web
Service Models (XaaS) - Infrastructure as a Service(IaaS), Platform as a oftware as a Service(SaaS). Deployment Models, Public cloud
Community cloud Infrastructure as a Service (IaaS): Introduction to IaaS - IaaS definition, Introduction to virtualization, Different approaches to virtualization, Hypervisors, Machine Image,
Resource Virtualization - Server, Storage, NetworkMachine(resource) provisioning and manageability, storage as a service, Data storage in cloud computing(storage as a service). Renting, EC2 Compute Unit, Platform and
Platform as a Service (PaaS): Introduction to PaaS - What is PaaS, Service Oriented
Cloud Platform and Management - computation, storageSoftware as a Service (SaaS): Introduction to SaaS, Web services, Web 2.0, Web OS,
Cloud Computing: Service Level Agreements(SLAs)Comparing Scaling Hardware: Traditional vs. Cloud, Economics of
scaling: Benefitting enormously, Managing Data - Looking at Data, Scalability & Cloud Database & Data Stores in Cloud, Large Scale Data Processing
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 100 of 141
FF No. :654
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Grid Computing, Cluster Computing, Distributed Computing, Utility Computing, Cloud Computing.
Business driver for adopting cloud computing. Introduction to Cloud
. Properties, Pros and Cons of Cloud Computing, Benefits of Cloud
Role of Open
Comparison with traditional computing architecture (client/server), Services provided at various levels, How Cloud
ols used, Role of Web Platform as a
Public cloud, Private
IaaS definition, Introduction to virtualization, Different approaches to virtualization, Hypervisors, Machine Image,
Network. Virtual Machine(resource) provisioning and manageability, storage as a service, Data storage in
Renting, EC2 Compute Unit, Platform and
s PaaS, Service Oriented torage
Web services, Web 2.0, Web OS,
Service Level Agreements(SLAs), Billing Economics of
Looking at Data, Scalability & Cloud
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Cloud Security: Infrastructure Security Application level security. Data security and StorageJurisdictional issues raised by Data locatiControl, Trust, Reputation, Riskcloud, Cloud contracting Model, Commercial and business considerationsCase study on Open Source and Commercial Clouds
Compute Engine, Microsoft Azure List of Practical’s:
1. Hands on virtualization using XenServer
2. Hands on containerisation using Docker
3. Deployment and Configuration options in Amazon (AWS)
4. Deployment and Configuration options in Google Cloud
5. Deployment and Configuration options in Microsoft Azure
6. Building a 'HelloWorld' app for the cloud
7. Deploying the 'HelloWorld' app for the cloud
Text Books: 1. Cloud Computing for Dummies by Judith Hurwitz, R. Bl
(Wiley India Edition).
2. Enterprise Cloud Computing by Gautam Shroff,Cambridge.
3. Cloud Security by Ronald Krutz and Russell Dean Vines, Wiley
Reference Books : 1. Google Apps by Scott Granneman,Pearson.
2. Cloud Security & Privacy by Tim Malhar, S.Kumaraswammy, S.Latif
(SPD,O’REILLY)
3. Cloud Computing : A Practical Approach, Antohy T Velte, et.al McGraw Hill,
4. Cloud Computing Bible by Barrie Sosinsky, Wiley India.
5. Cloud Computing, Michael Miller, Que Publishing
Course Outcomes:
Upon completion of the course, graduates will
1. Describe the main concepts, key technologies, strengths, and limitations of cloud computing and the possible applications for state2. Explain the architecture and infrastructure of cloud computing, including SaaS, PaaS, IaaS, public cloud, private cloud, hybrid cloud, etc.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Infrastructure Security - Network level security, Host level security, Data security and Storage - Data privacy and security Issues,
Jurisdictional issues raised by Data location: Identity & Access Managementrust, Reputation, Risk, Authentication in cloud computing, Client access in
cloud, Cloud contracting Model, Commercial and business considerations
Case study on Open Source and Commercial Clouds – Amazon EMicrosoft Azure, Cloudfoundry, OpenStack
1. Hands on virtualization using XenServer
2. Hands on containerisation using Docker
3. Deployment and Configuration options in Amazon (AWS)
Configuration options in Google Cloud
5. Deployment and Configuration options in Microsoft Azure
6. Building a 'HelloWorld' app for the cloud
7. Deploying the 'HelloWorld' app for the cloud
Cloud Computing for Dummies by Judith Hurwitz, R. Bloor, M.Kanfman, F.Halper
Enterprise Cloud Computing by Gautam Shroff,Cambridge.
Cloud Security by Ronald Krutz and Russell Dean Vines, Wiley-India
1. Google Apps by Scott Granneman,Pearson.
acy by Tim Malhar, S.Kumaraswammy, S.Latif
3. Cloud Computing : A Practical Approach, Antohy T Velte, et.al McGraw Hill,
4. Cloud Computing Bible by Barrie Sosinsky, Wiley India.
5. Cloud Computing, Michael Miller, Que Publishing
Upon completion of the course, graduates will be able to -
1. Describe the main concepts, key technologies, strengths, and limitations of cloud computing and the possible applications for state-of-the-art cloud computing
rchitecture and infrastructure of cloud computing, including SaaS, PaaS, IaaS, public cloud, private cloud, hybrid cloud, etc.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 101 of 141
Network level security, Host level security, Data privacy and security Issues,
Identity & Access Management, Access Authentication in cloud computing, Client access in
Amazon EC2, Google
oor, M.Kanfman, F.Halper
3. Cloud Computing : A Practical Approach, Antohy T Velte, et.al McGraw Hill,
1. Describe the main concepts, key technologies, strengths, and limitations of cloud art cloud computing
rchitecture and infrastructure of cloud computing, including SaaS, PaaS,
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
3. Collaboratively research and write a paper on the state of the art (and open problems) in cloud computing. 4. Identify problems, and explain, analyze, and evaluate various cloud computing solutions. 5. Choose the appropriate technologies, algorithms, and approaches for the related issues.6. Display new ideas and innovations in cloud computing.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
3. Collaboratively research and write a paper on the state of the art (and open problems)
problems, and explain, analyze, and evaluate various cloud computing
5. Choose the appropriate technologies, algorithms, and approaches for the related issues.6. Display new ideas and innovations in cloud computing.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 102 of 141
3. Collaboratively research and write a paper on the state of the art (and open problems)
problems, and explain, analyze, and evaluate various cloud computing
5. Choose the appropriate technologies, algorithms, and approaches for the related issues.
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS4004
Credits: 4
Section 1: Topics/Contents
Introduction to Parallel Computing:
Computing, Parallelism Vs. Concurrency, Types and levels of parallelism, Flynn’s classification, Parallel Algorithms, Performance issues in algorithmsmemory systems ,Shared memory systems and cache coherence, Heterogeneous system architecture. Parallel programming models: Foster’s design methodology. Parallel Programming constructs: Synchronization, Deadlocks, CriticaComparison of GPU and CPU architectures,GPUs as Parallel Computers,Applications of GPU . Parallel Programming Languages and Models.Introduction to OpenMp:
Environment,Programming on MultiIssues: Example programming on Numerical & nonPthreads; Multi-Threaded I/O, MPIPerformance Visualization ToolsSoftware tools - PAPI - on MultiParallel Programming Model:
programming model, Concept of grid, block and thread, thread index generatiProgramming for GPU’s in C/C++ using CUDA API: Memory transfers, Writing and executing kernel functions, Writing device functions, Thread synchronization, Data Dependences and Race Conditions.,Organizing Parallel Threads.
Section2: Topics/Contents
GPU Architecture: GPU architecture, of GPU : Parallel streaming processors ,Multiprocessors ,Shared instruction caches ,Memory hierarchy – Global, Constant, Shared, and Texture memory;NVIDIA Kepler K20/K40/AMD.Memory Organization and Optimization:
memory. Memory coalescing, memory.Reduction operation, CUDA code optimization. Need of profileIntroduction to CUDA Tools: MemCheck, Command line & Visual Profilers.Problem solving using GPUs :
representations, Fast Fourier transforms, Binomial coefficients, light weight scientific computing exercises, Matrices etc .
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS4004: PARALLEL COMPUTING
Teaching Scheme: Theory 3 Hours / Week
Lab 2 Hours / Week
Introduction to Parallel Computing: Motivating Parallelism, Scope of Parallel Computing, Parallelism Vs. Concurrency, Types and levels of parallelism, Flynn’s
Parallel Algorithms, Analysis of parallel algorithms,Amdhal’s law, Performance issues in algorithms.Parallel computer architectures : PRAM, Distributed memory systems ,Shared memory systems and cache coherence, Heterogeneous system architecture. Parallel programming models: Foster’s design methodology. Parallel Programming constructs: Synchronization, Deadlocks, Critical sections, Data sharing etcComparison of GPU and CPU architectures,GPUs as Parallel Computers,Applications of GPU . Parallel Programming Languages and Models. Introduction to OpenMp: Multicore Architecture,Programming Environment,Programming on Multi-Core Processors, Pthreads & OpenMP,Performance Issues: Example programming on Numerical & non-numerical computations using
Threaded I/O, MPI-OpenMP, MPI-Pthreads,Example programs using Performance Visualization Tools- Intel Vtune Performance analyzer,Open source
on Multi-Core Processors; Compiler Optimization Techniques;Parallel Programming Model: Common Unified Device Architecture(CUDA), CUDA programming model, Concept of grid, block and thread, thread index generatiProgramming for GPU’s in C/C++ using CUDA API: Memory transfers, Writing and executing kernel functions, Writing device functions, Thread synchronization, Data Dependences and Race Conditions.,Organizing Parallel Threads.
GPU architecture, Overview of the graphics pipeline, Componentsof GPU : Parallel streaming processors ,Multiprocessors ,Shared instruction caches
Global, Constant, Shared, and Texture memory; Case sNVIDIA Kepler K20/K40/AMD. Memory Organization and Optimization: Global, Shared, constant and texture memory. Memory coalescing, memory banks and bank conflicts, Page memory.Reduction operation, CUDA code optimization. Need of profilers and analyzers, Introduction to CUDA Tools: MemCheck, Command line & Visual Profilers.Problem solving using GPUs : Single vs. double precision, Sparse matrix
Fast Fourier transforms, Binomial coefficients, light weight scientific ing exercises, Matrices etc .
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 103 of 141
FF No. :654
Teaching Scheme: Theory 3 Hours / Week Lab 2 Hours / Week
Motivating Parallelism, Scope of Parallel Computing, Parallelism Vs. Concurrency, Types and levels of parallelism, Flynn’s
Amdhal’s law, r architectures : PRAM, Distributed
memory systems ,Shared memory systems and cache coherence, Heterogeneous system architecture. Parallel programming models: Foster’s design methodology. Parallel
l sections, Data sharing etc.
Comparison of GPU and CPU architectures,GPUs as Parallel Computers,Applications of
Multicore Architecture,Programming ore Processors, Pthreads & OpenMP,Performance
numerical computations using Pthreads,Example programs using
analyzer,Open source Core Processors; Compiler Optimization Techniques; Common Unified Device Architecture(CUDA), CUDA
programming model, Concept of grid, block and thread, thread index generation, warp. Programming for GPU’s in C/C++ using CUDA API: Memory transfers, Writing and executing kernel functions, Writing device functions, Thread synchronization, Data
, Components of GPU : Parallel streaming processors ,Multiprocessors ,Shared instruction caches
Case studies:
Global, Shared, constant and texture locked host
rs and analyzers, Introduction to CUDA Tools: MemCheck, Command line & Visual Profilers.
Sparse matrix Fast Fourier transforms, Binomial coefficients, light weight scientific
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
List of Project areas: (For THP, TLP courses)
1. Analysis of Parallel Algorithms2. Implementation using OpenMP3. GPU kernel implementation for the given application.4. Performance analysis using GPU memories.5. Kernel reduction. 6. Profiling an application. Text Books:
1. CUDA: Programming Massively Parallel Processors: A Hands
Authors: David Kirk, Wen
2. CUDA by Example: An Introduction to General
Jason Sanders and Edward Kandrot
3. Parallel Programming in C with MPI and OpenMP by Michael J. Quinn, Tata
McGraw-Hill Edition
4. Advanced computer architecture by Kai Hwong, Tata McGraw
Reference Books: 1.Hwang and Briggs,“Computer Architecture and
McGraw Hill Publication ISBN 13: 9780070315563.
2. http://developer.nvidia.com/
3.www tutorials on introduction to parallel computing
4.Other references suggested by instructor
Course Outcomes:
Upon completion of the course, graduates will1. Analyze the real problem for exploiting maximum parallelism on GPU architecture 2. Solve the complex problems using GPUs 3. Compare serial and parallel executions.4. Code and optimize the parallel programs on GPU using CUDA. 5. Apply parallel computing methods to research oriented problems.
6. Evaluate success of CUDA projects
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
List of Project areas: (For THP, TLP courses)
1. Analysis of Parallel Algorithms 2. Implementation using OpenMP 3. GPU kernel implementation for the given application. 4. Performance analysis using GPU memories.
CUDA: Programming Massively Parallel Processors: A Hands-On Approach.
Authors: David Kirk, Wen-mei Hwu © ELSEVIER Inc.
CUDA by Example: An Introduction to General-Purpose GPU Programming by
rs and Edward Kandrot
Parallel Programming in C with MPI and OpenMP by Michael J. Quinn, Tata
Hill Edition
Advanced computer architecture by Kai Hwong, Tata McGraw-Hill Edition, 2001
Hwang and Briggs,“Computer Architecture and Parallel Processing”, Tata
McGraw Hill Publication ISBN 13: 9780070315563.
http://developer.nvidia.com/
3.www tutorials on introduction to parallel computing
4.Other references suggested by instructor
se, graduates will be able to - 1. Analyze the real problem for exploiting maximum parallelism on GPU architecture 2. Solve the complex problems using GPUs 3. Compare serial and parallel executions. 4. Code and optimize the parallel programs on GPU using CUDA. 5. Apply parallel computing methods to research oriented problems.
6. Evaluate success of CUDA projects
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 104 of 141
On Approach.
Purpose GPU Programming by
Parallel Programming in C with MPI and OpenMP by Michael J. Quinn, Tata
Hill Edition, 2001
Parallel Processing”, Tata
1. Analyze the real problem for exploiting maximum parallelism on GPU architecture
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS 4005: COMPONENT
Credits: 04
Section 1: Topics/Contents
Overview of CBSE: Introduction, Market versus technology, Standards, What a component is and is not, Components, interfaces, and reCBSE, Specification of Software Components, Architecting ComponentComponent Models and Technology,Software Composition: Different Views of Software Composition, Software Composition Mechanisms, Algebraic Composition Mechanisms, Mathematical Composition Operators, Semantic Integrity in CBD, RoleEngineering, Dispelling the Myth of Component Evaluation, Component Composition and Integration, Predicting System Trustworthiness, Polymorphism, Object versus class composition or how to avoid inheritance, Aspects of scale and granularity, Patterns, frameworks, architectures, Business Components: The Business Component Approach: Levels of Component Granularity, Architectural Viewpoints, Development Process, Business Component, Business Component Factory, Scenario, Applicability of the Approach, DistributComponent: Concepts, Internals, Externals, Business Component: Concepts, Internals, Externals, Development Lifecycle, Address Book Scenario, Relation to SE, Business Component System: Concepts, Internals, Externals, Federation of SystemComponents: The Business Problem, Interoperability Concepts, Federation Concepts, Architected Federation, Technical Architecture: Concepts, Technical Core, Services and Facilities, Extended Integrated Development Environment, Application Architecture: Concepts, Architectural Principles and Styles, Collaboration Patterns, Project Management Architecture: Concepts, SCM and Versioning, Dependency Management, Development Model and Environment, ComponentIdentification Strategies, Modeli
Section2:Topics/Contents
Component Architectures and implementations
Components, Component Models with Architectural Units as Components, Component Models with Encapsulated Components, Programming component “wiring” standards, The OMG way: CORBA, CCM, OMA, and MDA, The Sun way – Java, JavaBeans, EJB, and Java 2 editions, The Microsoft way: COM, OLE/ActiveX, COM+, and .NET CLR, Strategic cstandards, Ongoing concerns, Component architecture, Component frameworks, Component development, Component distribution and acquisition, Component assembly, Gamut of markets, New professions, A component marketing paradox
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS 4005: COMPONENT-BASED SYSTEM CONSTRUCTION
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Introduction, Market versus technology, Standards, What a component is and is not, Components, interfaces, and re-entrance, Basic Concepts in CBSE, Specification of Software Components, Architecting Component-Based Systems, Component Models and Technology, CBD Process, Adapting the V-Model for CBD
: Different Views of Software Composition, Software Composition Mechanisms, Algebraic Composition Mechanisms, Mathematical Composition Operators, Semantic Integrity in CBD, Role-Based ComponentEngineering, Dispelling the Myth of Component Evaluation, Component Composition and Integration, Predicting System Trustworthiness, Polymorphism, Object versus class composition or how to avoid inheritance, Aspects of scale and granularity, Patterns,
: The Business Component Approach: Levels of Component Granularity, Architectural Viewpoints, Development Process, Business Component, Business Component Factory, Scenario, Applicability of the Approach, DistributComponent: Concepts, Internals, Externals, Business Component: Concepts, Internals, Externals, Development Lifecycle, Address Book Scenario, Relation to SE, Business Component System: Concepts, Internals, Externals, Federation of System
: The Business Problem, Interoperability Concepts, Federation Concepts, Architected Federation, Technical Architecture: Concepts, Technical Core, Services and Facilities, Extended Integrated Development Environment, Application Architecture:
itectural Principles and Styles, Collaboration Patterns, Project Management Architecture: Concepts, SCM and Versioning, Dependency Management, Development Model and Environment, Component-Based Business Modeling: Concepts, Identification Strategies, Modeling the Processes, Modeling the Entities, Transitioning
Component Architectures and implementations: Component Models with Objects as Components, Component Models with Architectural Units as Components, Component
psulated Components, Programming – shades of gray, Object and component “wiring” standards, The OMG way: CORBA, CCM, OMA, and MDA, The
Java, JavaBeans, EJB, and Java 2 editions, The Microsoft way: COM, OLE/ActiveX, COM+, and .NET CLR, Strategic comparison, Efforts on domain standards, Ongoing concerns, Component architecture, Component frameworks, Component development, Component distribution and acquisition, Component assembly, Gamut of markets, New professions, A component marketing paradox
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 105 of 141
FF No. :654 BASED SYSTEM CONSTRUCTION
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Introduction, Market versus technology, Standards, What a entrance, Basic Concepts in
Based Systems, Model for CBD
: Different Views of Software Composition, Software Composition Mechanisms, Algebraic Composition Mechanisms, Mathematical
Based Component Engineering, Dispelling the Myth of Component Evaluation, Component Composition and Integration, Predicting System Trustworthiness, Polymorphism, Object versus class composition or how to avoid inheritance, Aspects of scale and granularity, Patterns,
: The Business Component Approach: Levels of Component Granularity, Architectural Viewpoints, Development Process, Business Component, Business Component Factory, Scenario, Applicability of the Approach, Distributed Component: Concepts, Internals, Externals, Business Component: Concepts, Internals, Externals, Development Lifecycle, Address Book Scenario, Relation to SE, Business Component System: Concepts, Internals, Externals, Federation of System-Level
: The Business Problem, Interoperability Concepts, Federation Concepts, Architected Federation, Technical Architecture: Concepts, Technical Core, Services and Facilities, Extended Integrated Development Environment, Application Architecture:
itectural Principles and Styles, Collaboration Patterns, Project Management Architecture: Concepts, SCM and Versioning, Dependency Management,
Based Business Modeling: Concepts, ng the Processes, Modeling the Entities, Transitioning
: Component Models with Objects as Components, Component Models with Architectural Units as Components, Component
shades of gray, Object and component “wiring” standards, The OMG way: CORBA, CCM, OMA, and MDA, The
Java, JavaBeans, EJB, and Java 2 editions, The Microsoft way: COM, omparison, Efforts on domain
standards, Ongoing concerns, Component architecture, Component frameworks, Component development, Component distribution and acquisition, Component assembly,
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Legacy Systems: Application, Data, and Time Stovepipes, Managing the Evolution of Enterprise Applications, Legacy Portfolio Analysis. Wrappers, Connectors, Mediators, Adapters, The Landscape of Legacy Wrappers, A Roadmap for Developing Wrappers, Modularizing Legacy Systems, Constructing WSDL/SOAPEnterprise Applications: Loosely Coupled versus Tightly Coupled Networked Enterprises, Single Organizations, Networked Organizations, Toward a Methodological Framework, Methodological FramewEngineering, Matching Phase, Adaptation Phase, Matching Phase: Structural Matching, Semantic Matching, MetamodelContracts, Adapter GenerationSoftware Reuse and Agile: Technical Aspects of Software Reuse, Nontechnical Aspects of Software Reuse, Installing a Reuse Program, Component Composition and Attributes, Domain Engineering, Component Engineering, Application Engineering, Software Documentation, Reuse DocumentaLiterate Programs, Documentation Reuse, On Components and the Nature of Reality: Introduction to the Metaworld, The Universal Perspective: Scope of Business, On the Nature of Change and Winged Pigs , ManaginGovernance of Change, Components in Product Line Architectures, Koala Component Model
List of Practicals: (For THL, TLP courses)
1. To narrate concise Requirement Definition Document and System Requirements Specification Document for target system with reference to the IEEE 610.12.1990 Standard guidelines clearly indicating the requirements considerations.
2. To decompose and organize the problem domain area into broad subject areas and identify the boundaries of problem/system aProcesses and develop full detail Business Process diagrams.
3. To develop Componentlexicon and context-based terminologies.
4. To identify and categorize the target systecomponent specifications modeled with component diagram incorporating appropriate architectural style and coupling.
5. To design the componentaccommodating abstraction, autonomy, statelessness and reuse.
6. To map the componentdata processing using
7. To produce, invoke, compose Wrapping-Wiring.
8. To implement and integrate the components of the target system using platforms adhering to
Text Books:
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
: Application, Data, and Time Stovepipes, Managing the Evolution of Enterprise Applications, Legacy Portfolio Analysis. Wrappers, Connectors, Mediators, Adapters, The Landscape of Legacy Wrappers, A Roadmap for Developing Wrappers,
Legacy Systems, Constructing WSDL/SOAP-Based Wrappers, Developing Enterprise Applications: Loosely Coupled versus Tightly Coupled Networked Enterprises, Single Organizations, Networked Organizations, Toward a Methodological Framework, Methodological Framework: Overview, Forward Engineering, Reverse Engineering, Matching Phase, Adaptation Phase, Matching Phase: Structural Matching, Semantic Matching, Metamodel-Driven Matching Component Adaptation, Parametric Contracts, Adapter Generation
: Technical Aspects of Software Reuse, Nontechnical Aspects of Software Reuse, Installing a Reuse Program, Component Composition and Attributes, Domain Engineering, Component Engineering, Application Engineering, Software Documentation, Reuse Documentation, Literate Programming, Reuse Measurement in Literate Programs, Documentation Reuse, On Components and the Nature of Reality: Introduction to the Metaworld, The Universal Perspective: Scope of Business, On the Nature of Change and Winged Pigs , Managing Emotions Unleashed by Change, Governance of Change, Components in Product Line Architectures, Koala Component
List of Practicals: (For THL, TLP courses)
To narrate concise Requirement Definition Document and System Requirements ment for target system with reference to the IEEE 610.12.1990
Standard guidelines clearly indicating the requirements considerations.To decompose and organize the problem domain area into broad subject areas and identify the boundaries of problem/system along with identification of Business Processes and develop full detail Business Process diagrams.
Component vocabulary of the target system indicating based terminologies.
To identify and categorize the target system component services with detailed specifications modeled with component diagram incorporating
appropriate architectural style and coupling. component layers and tiers modeled with deployment diagram
accommodating abstraction, autonomy, statelessness and reuse. component service levels and primitives to appropriate Strategies for
data processing using applicable application architectures. To produce, invoke, compose Component Services using Component
To implement and integrate the components of the target system using platforms adhering to Component specifications.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 106 of 141
: Application, Data, and Time Stovepipes, Managing the Evolution of Enterprise Applications, Legacy Portfolio Analysis. Wrappers, Connectors, Mediators, Adapters, The Landscape of Legacy Wrappers, A Roadmap for Developing Wrappers,
Based Wrappers, Developing Enterprise Applications: Loosely Coupled versus Tightly Coupled Networked Enterprises, Single Organizations, Networked Organizations, Toward a Methodological
ork: Overview, Forward Engineering, Reverse Engineering, Matching Phase, Adaptation Phase, Matching Phase: Structural Matching,
Driven Matching Component Adaptation, Parametric
: Technical Aspects of Software Reuse, Nontechnical Aspects of Software Reuse, Installing a Reuse Program, Component Composition and Attributes, Domain Engineering, Component Engineering, Application Engineering, Software
tion, Literate Programming, Reuse Measurement in Literate Programs, Documentation Reuse, On Components and the Nature of Reality: Introduction to the Metaworld, The Universal Perspective: Scope of Business, On the
g Emotions Unleashed by Change, Governance of Change, Components in Product Line Architectures, Koala Component
To narrate concise Requirement Definition Document and System Requirements ment for target system with reference to the IEEE 610.12.1990
Standard guidelines clearly indicating the requirements considerations. To decompose and organize the problem domain area into broad subject areas and
long with identification of Business
vocabulary of the target system indicating component
services with detailed specifications modeled with component diagram incorporating
layers and tiers modeled with deployment diagram
service levels and primitives to appropriate Strategies for
Component-Service
To implement and integrate the components of the target system using sufficient
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
1. IvicaCrnkovic, Magnus Larsson, Building Reliable Component
Systems, 2002 Artech House, Inc., ISBN 1
2. Johannes Sametinger, Software Engineering with Reusable Components,
Springer-Verlag, 1997, ISBN 978
Reference Books:
1. Kung-Kiu Lau, Simone Di Cola, An Introduction To Component
Development (Series On Component
Scientific Publishing Co. Pte. Ltd., ISBN
2. Peter Herzum, Oliver
Overview Of Component
Sons, Inc, 2000, ISBN
3. Willem-Jan van den Heuvel, Aligning Modern Business Processes and Legacy
Systems, 2007 MIT Press, ISBN
4. Clemens Szyperski, Component Software: Beyond Object
Pearson Education Limited 2002, ISBN 0
Course Outcomes:
Upon completion of the course, graduates will1. Model business requirements and business
encompassing Process Orchestrations and Choreographies.2. Discover the set of
designing services to facilitate integration 3. Explore the concepts, g
integrate a Component Designsocietal context.
4. Prepare well-formed specifications and reports for composition and delivery to the stake
5. Understand case studies and lessons learned with utilization of development patternsimplementing complex
6. Create sustainable Compoand testability.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
IvicaCrnkovic, Magnus Larsson, Building Reliable Component-Based Software
Systems, 2002 Artech House, Inc., ISBN 1-58053-327-2
Johannes Sametinger, Software Engineering with Reusable Components,
Verlag, 1997, ISBN 978-3-662-03345-6
Kiu Lau, Simone Di Cola, An Introduction To Component-Based Software
Development (Series On Component-Based Software Development), World
Scientific Publishing Co. Pte. Ltd., ISBN -13: 978-9813221871
Peter Herzum, Oliver -Sims, Business Component Factory: Comprehensive
Overview Of Component-Based Development For The Enterprise, John Wiley &
Sons, Inc, 2000, ISBN-13: 978-0471327608
Jan van den Heuvel, Aligning Modern Business Processes and Legacy
Systems, 2007 MIT Press, ISBN-13: 978-0-262-22079-8
Clemens Szyperski, Component Software: Beyond Object-Oriented Programming,
Pearson Education Limited 2002, ISBN 0-201-74572-0
Upon completion of the course, graduates will be able to - Model business requirements and business processes using BPMN 2.0 standard encompassing Process Orchestrations and Choreographies. Discover the set of component services with composite services creation and designing services to facilitate integration in IT infrastructure. Explore the concepts, guidelines and technology for component orchestration to
Component Design Solution in an Enterprise Component Systems
formed specifications and reports for component composition and delivery to the stakeholders as being a part of development teamUnderstand case studies and lessons learned with utilization of Componentdevelopment patterns and Frameworks knowledge towards planning and implementing complex business projects.
Component System design supported by reuse, documentation,
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 107 of 141
Based Software
Johannes Sametinger, Software Engineering with Reusable Components,
Based Software
Based Software Development), World
ctory: Comprehensive
Based Development For The Enterprise, John Wiley &
Jan van den Heuvel, Aligning Modern Business Processes and Legacy
Oriented Programming,
processes using BPMN 2.0 standard
services with composite services creation and
orchestration to Component Systems in
component service as being a part of development team.
Component-based and Frameworks knowledge towards planning and
reuse, documentation,
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS4006: DATA MINING AND DATA WAREHOUSING
Credits: 04
Section 1: Topics/Contents
Introduction to DWH : Data warehouse (DWH): Need, Definition, Advantages of DWH, OLTP Vs DWH, 3-tier Architecture, DWH Design Process, ETL Process, DWH Back-end Tools and Utilities, Metadata Warehouse, Data Mart, Virtual Warehouse, Comparison. Dimensional Modeling: Dimensional Model Vs ER Model, DWH Schemas: Star, Snowflake, Fact Constellation, their Comparison, Techniques to Handle Changing Dimensions, Aggregation, Families of Fact Tables, Fact Less Fact Tables; Data Warehouse Indexing: Factors used to select an InIndexing Technique for DWH, Indexing Techniques: Projection Index, Bitmap Index (Pure and Encoded), Join Index and their Comparison. Data Mining and Functionalities :
Database (KDD), Architecture of Data Mining System, Data Mining on Different kind of Data, Data Mining Functionalities; Data Preprocessing: Need, Cleaning, Integration, Transformation, Reduction, Discretization, Concept Hierarchy Generation.
Section2: Topics/Contents
Cluster Analysis: Categories of Clustering methods, Partitioning methods: kMedoids ; Prediction: Numerical Prediction, Linear, NonAnalysis: Applications, Techniques. Classification: Decision Tree ClassifieClassification, Neural Network Classification: Back Propagation Algorithm, Lazy Learner: kNN Classifier, CaseAccuracy Measures, Techniques for Evaluating ClassifMining: Interesting Item Set Mining: Market Basket Analysis, APriori Algorithm, Generating Association Rules, Types of Association Rules, Correlation Analysis. Data Mining on different Databases
Mining, Spatial Data Mining, Mining on Social Networks, Multi
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS4006: DATA MINING AND DATA WAREHOUSING
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Data warehouse (DWH): Need, Definition, Advantages of tier Architecture, DWH Design Process, ETL Process, DWH
end Tools and Utilities, Metadata Repository, Models of DWH: Enterprise Warehouse, Data Mart, Virtual Warehouse, Comparison.
Dimensional Model Vs ER Model, DWH Schemas: Star, Snowflake, Fact Constellation, their Comparison, Techniques to Handle Changing Dimensions, Aggregation, Families of Fact Tables, Fact Less Fact Tables; Data Warehouse Indexing: Factors used to select an Indexing Technique, Properties of a Good Indexing Technique for DWH, Indexing Techniques: Projection Index, Bitmap Index (Pure and Encoded), Join Index and their Comparison.
Data Mining and Functionalities : Need of Data Mining, Knowledge Discovery in ase (KDD), Architecture of Data Mining System, Data Mining on Different kind of
Data, Data Mining Functionalities; Data Preprocessing: Need, Cleaning, Integration, Transformation, Reduction, Discretization, Concept Hierarchy Generation.
Categories of Clustering methods, Partitioning methods: kMedoids ; Prediction: Numerical Prediction, Linear, Non-Linear Regression; Outlier Analysis: Applications, Techniques.
Decision Tree Classifier, Rule Based Classification, Bayesian Classification, Neural Network Classification: Back Propagation Algorithm, Lazy Learner: kNN Classifier, Case-Based Reasoning, Other: Fuzzy Set Approach, Classifier Accuracy Measures, Techniques for Evaluating Classifier Accuracy; Frequent Itemset Mining: Interesting Item Set Mining: Market Basket Analysis, APriori Algorithm, Generating Association Rules, Types of Association Rules, Correlation Analysis.
a Mining on different Databases: Multimedia Data Mining, Web Mining, Text Mining, Spatial Data Mining, Mining on Social Networks, Multi-relational Data Mining.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 108 of 141
FF No. :654
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Data warehouse (DWH): Need, Definition, Advantages of tier Architecture, DWH Design Process, ETL Process, DWH
Repository, Models of DWH: Enterprise
Dimensional Model Vs ER Model, DWH Schemas: Star, Snowflake, Fact Constellation, their Comparison, Techniques to Handle Changing Dimensions, Aggregation, Families of Fact Tables, Fact Less Fact Tables; Data
dexing Technique, Properties of a Good Indexing Technique for DWH, Indexing Techniques: Projection Index, Bitmap Index
Need of Data Mining, Knowledge Discovery in ase (KDD), Architecture of Data Mining System, Data Mining on Different kind of
Data, Data Mining Functionalities; Data Preprocessing: Need, Cleaning, Integration,
Categories of Clustering methods, Partitioning methods: k-Means, k-Linear Regression; Outlier
r, Rule Based Classification, Bayesian Classification, Neural Network Classification: Back Propagation Algorithm, Lazy
Based Reasoning, Other: Fuzzy Set Approach, Classifier ier Accuracy; Frequent Itemset
Mining: Interesting Item Set Mining: Market Basket Analysis, APriori Algorithm, Generating Association Rules, Types of Association Rules, Correlation Analysis.
Mining, Text relational Data Mining.
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
List of Practicals: (For THL, TLP courses)
1. Design a star / snowflake schema for a data warehouse for an organization.2. Use ETL tool for extract3. OLAP Data cube implementation and operations4. Data mining: Implement clustering algorithms5. Classification algorithms6. Association rule mining7. Prediction, Linear Regression8. Outlier analysis
Text Books: 1. “The Data Warehouse Lifecycle Toolkit”,
Wiley, ISBN 9971-51-4152. “Data Mining: Concepts and Techniques”, Jiawei Han and Micheline Kamber
Morgan Kaufman, ISBN 978
Reference Books: 1. “Decision Support and Data
Hill, ISBN 978-00704868432. “Mastering Data Mining: The art and science of customer relationship
management”, M Berry and G. Linoff, John Wiley, ISBN 9971
Edition. Course Outcomes:
The student will be able to – 1. Construct an end-to-end data warehousing solution.2. Evaluate various data processing algorithms in their applicability to different problems3. Display the process of converting data into a user defined format requiredparticular analysis 4. Utilize statistical tools in deriving insights from data5. Describe various techniques for clustering and classification6. Apply various techniques to solve real
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
List of Practicals: (For THL, TLP courses)
Design a star / snowflake schema for a data warehouse for an organization.Use ETL tool for extract-transform-load operations OLAP Data cube implementation and operations Data mining: Implement clustering algorithms Classification algorithms Association rule mining Prediction, Linear Regression
“The Data Warehouse Lifecycle Toolkit”, Kimball, Reeves, Ross, Thornthwaite415-X, 2002 Edition.
“Data Mining: Concepts and Techniques”, Jiawei Han and Micheline Kamber
978-81-312-0535-8, 2nd
Edition.
“Decision Support and Data Warehouse Systems”, Mallach Efrem G, Tata McGraw 0070486843, 2009 Edition.
“Mastering Data Mining: The art and science of customer relationship
management”, M Berry and G. Linoff, John Wiley, ISBN 9971-51-
end data warehousing solution.
2. Evaluate various data processing algorithms in their applicability to different problems3. Display the process of converting data into a user defined format required
4. Utilize statistical tools in deriving insights from data
5. Describe various techniques for clustering and classification
6. Apply various techniques to solve real-world data analysis problems
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 109 of 141
Design a star / snowflake schema for a data warehouse for an organization.
Kimball, Reeves, Ross, Thornthwaite, John
“Data Mining: Concepts and Techniques”, Jiawei Han and Micheline Kamber,
Warehouse Systems”, Mallach Efrem G, Tata McGraw
“Mastering Data Mining: The art and science of customer relationship
-369-2, 2001
2. Evaluate various data processing algorithms in their applicability to different problems for
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS4007:
Credits: 04
Section 1: Topics/Contents
Process of Modeling and Simulation:
Relationship between modeling and simulation Process of modeling: Problem identification and formulation, Real system data collection, Model development, Validation, Experiment design, Simulation runs and Results interpretation. Formal models and modeling techniques
Queuing theory: Little's Theorem and applications, M/M/1 Queuing System, Petri nets, Game theory, State spaces and transitions, Graph structures: directed graphs, trees, networks.
Discrete Event Simulation :
Simulation, Constructing dynamic stochastic simulation models, Time keeping, Event Scheduling, State transition, Time driven and event driven models, Pseudonumber generation.
Section2: Topics/Contents
Agent-based simulation : Modeling Complex Systems, Agents, environments, ABMS: When and Why, Agent based model design, Autonomous Agents, Agent Interaction, Topologies and Neighborhoods, Tools for ABMS: Repast, Swarm, NetLogo. M&S Applications and Awareness :
support, forecasting, safety considerations, training and education. ABMS Applications: Social networks, Organizations, Markets, Flows, Epidemiology, Diffusion. Advanced Topics: Model scalability, Virtual Reality, Virtual Worlds, Intro to Rare Event Simulation, Intro to Parallel Discrete Event Simulation, PDES Challenges.
List of Practicals: (For THL, TLP courses)
1. Develop a simple deterministic simulation to determine the loan Rs.X principal amount when the customer pays Rs.Y per month. Assume the fixed
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS4007: MODELING AND SIMULATION
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Process of Modeling and Simulation: What is M&S, Need for Abstraction, modeling and simulation Process of modeling: Problem
identification and formulation, Real system data collection, Model development, Validation, Experiment design, Simulation runs and Results interpretation.
Formal models and modeling techniques: Monte Carlo methods, Stochastic processes, Queuing theory: Little's Theorem and applications, M/M/1 Queuing System, Petri nets, Game theory, State spaces and transitions, Graph structures: directed graphs, trees,
Discrete Event Simulation : Deterministic vs. stochastic simulation, Static vs. Dynamic Simulation, Constructing dynamic stochastic simulation models, Time keeping, Event Scheduling, State transition, Time driven and event driven models, Pseudo
Modeling Complex Systems, Agents, environments, ABMS: When and Why, Agent based model design, Autonomous Agents, Agent Interaction, Topologies and Neighborhoods, Tools for ABMS: Repast, Swarm, NetLogo.
ations and Awareness : Application areas: optimization, decision making support, forecasting, safety considerations, training and education. ABMS Applications: Social networks, Organizations, Markets, Flows, Epidemiology, Diffusion.
scalability, Virtual Reality, Virtual Worlds, Intro to Rare Event Simulation, Intro to Parallel Discrete Event Simulation, PDES Challenges.
List of Practicals: (For THL, TLP courses)
1. Develop a simple deterministic simulation to determine the loan tenure forRs.X principal amount when the customer pays Rs.Y per month. Assume the fixed
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 110 of 141
FF No. :654
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
What is M&S, Need for Abstraction, modeling and simulation Process of modeling: Problem
identification and formulation, Real system data collection, Model development,
arlo methods, Stochastic processes, Queuing theory: Little's Theorem and applications, M/M/1 Queuing System, Petri nets, Game theory, State spaces and transitions, Graph structures: directed graphs, trees,
ic vs. stochastic simulation, Static vs. Dynamic Simulation, Constructing dynamic stochastic simulation models, Time keeping, Event Scheduling, State transition, Time driven and event driven models, Pseudo-random
Modeling Complex Systems, Agents, environments, ABMS: When and Why, Agent based model design, Autonomous Agents, Agent Interaction, Topologies and Neighborhoods, Tools for ABMS: Repast, Swarm, NetLogo.
Application areas: optimization, decision making support, forecasting, safety considerations, training and education. ABMS Applications:
scalability, Virtual Reality, Virtual Worlds, Intro to Rare Event Simulation, Intro to Parallel Discrete Event Simulation, PDES Challenges.
tenure for Rs.X principal amount when the customer pays Rs.Y per month. Assume the fixed
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
interest rate of 10% per year. 2. Develop a Monte Carlo simulation model for profit estimation before introducinga new product in the market. Consider the uncertaintcosts, competitive pricing and other market dynamics. 3. Develop a discrete event simulation of a typical fastconfiguration, business factors and customer behavior factors should be tunableparameters. (SimPy) 4. Agent based simulation : Marketing/Diffusion: Word of Mouth publicity,Epidemiology: spread of disease. (NetLogo) 5. Develop a parallel discrete event simulation for a network of routers using conservative event processing. Text Books: 1. Discrete Event Simulation: A First Course, L. Leemis and S. Park, 2006, Prentice
Hall. 2. Agent-Based Models, Nigel Gilbert, 2008, SAGE Publications.
3. System Simulation and Modeling, Sankar Sengupta, 2013, Pearson Education.
Reference Books: 1. Handbook of Simulation: Principles, Methodology, Advances, Applications, and
Practice, J. Banks, 1998, John Wiley & Sons.
2. Parallel and Distributed Simulation Systems, Fujimoto R.M., 2000, John Wiley &
Sons. Course Outcomes:
The student will be able to – 1. Demonstrate the effectiveness of modeling and simulation at predictingbehavior/performance/problems of systems under development.2. Develop a model for a given problem using appropriate modeling and simulationtechnique/formalism. 3. Implement discrete event simulation models using generallanguages or DES frameworks4. Design an agent-based simulation model for a complex system.5. Contribute towards increased utilization of modeling and simulation assolving approach for issues in governance and industry where it could be applied6. Adapt to the changing needs of the organizations and individuals during the development process.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
interest rate of 10% per year.
2. Develop a Monte Carlo simulation model for profit estimation before introducinga new product in the market. Consider the uncertainty in terms of sales, productioncosts, competitive pricing and other market dynamics.
3. Develop a discrete event simulation of a typical fast-food restaurant. Restaurantconfiguration, business factors and customer behavior factors should be tunable
4. Agent based simulation : Marketing/Diffusion: Word of Mouth publicity, Epidemiology: spread of disease. (NetLogo)
5. Develop a parallel discrete event simulation for a network of routers using conservative event processing.
1. Discrete Event Simulation: A First Course, L. Leemis and S. Park, 2006, Prentice
Based Models, Nigel Gilbert, 2008, SAGE Publications. 3. System Simulation and Modeling, Sankar Sengupta, 2013, Pearson Education.
. Handbook of Simulation: Principles, Methodology, Advances, Applications, and
Practice, J. Banks, 1998, John Wiley & Sons. 2. Parallel and Distributed Simulation Systems, Fujimoto R.M., 2000, John Wiley &
1. Demonstrate the effectiveness of modeling and simulation at predicting
behavior/performance/problems of systems under development. 2. Develop a model for a given problem using appropriate modeling and simulation
3. Implement discrete event simulation models using general-purpose programminglanguages or DES frameworks
based simulation model for a complex system. 5. Contribute towards increased utilization of modeling and simulation as a problem solving approach for issues in governance and industry where it could be applied6. Adapt to the changing needs of the organizations and individuals during the
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 111 of 141
2. Develop a Monte Carlo simulation model for profit estimation before introducing
y in terms of sales, production
food restaurant. Restaurant configuration, business factors and customer behavior factors should be tunable
5. Develop a parallel discrete event simulation for a network of routers using
1. Discrete Event Simulation: A First Course, L. Leemis and S. Park, 2006, Prentice-
3. System Simulation and Modeling, Sankar Sengupta, 2013, Pearson Education.
. Handbook of Simulation: Principles, Methodology, Advances, Applications, and
2. Parallel and Distributed Simulation Systems, Fujimoto R.M., 2000, John Wiley &
2. Develop a model for a given problem using appropriate modeling and simulation
purpose programming
a problem solving approach for issues in governance and industry where it could be applied
6. Adapt to the changing needs of the organizations and individuals during the
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Credits: 04
Section 1: Topics/Contents
Introduction & Application to
of IoT, Towards the IoT Universe IoT Strategic Researchnd Innovation Directions, IoT Applications, Future Internet Technologies, Infrastructure, Networks and Communication, Processes, Data Management,Smart Energy & Smart Grid, Smart Mobility & transport, Smart Home, Smart Building & Infrastructure, Smart Factory & Manufacturing, Smart Health, Smart Logistics & Retails Embedded Suite for IoT:
Processor, ARM Processor Architecture, Programmer’s model, Modes of operation, Interrupt Structure and Applications. Management of Power Supply, Introduction to Raspberry Pi, Understanding the Raspberry Pi board and its compInput/output, GPIO connectivity
WIRELESS TECHNOLOGIES supporting IoT:
Machine to machine (M2M) and WSN Protocols, Basics of RFID, RFID Protocols & NFC protocols, Issues with IoT Standardization, UnIEEE 802.15.4, ZigBee, IPv6 technologies for the IoT
Section2:Topics/Contents
IoT Networking: Networking Architectures: Star, Mesh, Tree, and Overview of networking Protocols: TCP/IP, 6LowPan, RPL: Routing protocol for network. IoT Devices Application Level Protocols: Introduction to MQTT, Quality of Service parameter in MQTT, CoAP, XMPP
IoT:PRIVACY, SECURITY& GOVERNANCE:
Security Issues, Contribution from FP7 ProjectsPlatforms for Smart Cities, First Steps towards a Secure Platform, Smart Approach. Data Aggregation for the IoT in Smart Cities
Connecting IoT to Cloud:Introduction to cloud computing, Difference betweeComputing and IoT, Fog Computing: The Next Evolution of Cloud Computing, Role of Cloud Computing in IoT. Livingon the Edge, Connecting IoT to cloud, Cloud Storage for IoT. Cloud-to-Device Connectivity,Challenge in integration of IoT with Cloud
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS4008: INTERNET OF THINGS
Teaching Scheme: Theory: 3 Hours / Week
Project Based Lab: 2 Hours/Week
Introduction & Application to Internet of Things: The Internet of Thingsof IoT, Towards the IoT Universe IoT Strategic Researchnd Innovation Directions, IoT Applications, Future Internet Technologies, Infrastructure, Networks and Communication, Processes, Data Management, Iot Smart X Application: Smart Cities, Smart Energy & Smart Grid, Smart Mobility & transport, Smart Home, Smart Building & Infrastructure, Smart Factory & Manufacturing, Smart Health, Smart Logistics & Retails
Embedded Suite for IoT: Introduction to ARM Processor, introduction to ARM Processor, ARM Processor Architecture, Programmer’s model, Modes of operation, Interrupt Structure and Applications. Management of Power Supply, Introduction to Raspberry Pi, Understanding the Raspberry Pi board and its components, recognizing the Input/output, GPIO connectivity.
WIRELESS TECHNOLOGIES supporting IoT:Protocol Standardization for IoT, Machine to machine (M2M) and WSN Protocols, Basics of RFID, RFID Protocols & NFC protocols, Issues with IoT Standardization, Unified Data Standards, Protocols IEEE 802.15.4, ZigBee, IPv6 technologies for the IoT.
Networking Architectures: Star, Mesh, Tree, and Overview of networking Protocols: TCP/IP, 6LowPan, RPL: Routing protocol for lossy& low power network. IoT Devices Application Level Protocols: Introduction to MQTT, Quality of Service parameter in MQTT, CoAP, XMPP
PRIVACY, SECURITY& GOVERNANCE:Overview of Governance, Privacy and Security Issues, Contribution from FP7 Projects, Security, Privacy and Trust in IoTPlatforms for Smart Cities, First Steps towards a Secure Platform, Smart Approach. Data Aggregation for the IoT in Smart Cities, Security,
Introduction to cloud computing, Difference betweeComputing and IoT, Fog Computing: The Next Evolution of Cloud Computing, Role of Cloud Computing in IoT. Livingon the Edge, Connecting IoT to cloud, Cloud Storage for
Device Connectivity,Challenge in integration of IoT with Cloud
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 112 of 141
FF No. :654
Theory: 3 Hours / Week
Project Based Lab: 2 Hours/Week
The Internet of Things, Importance of IoT, Towards the IoT Universe IoT Strategic Researchnd Innovation Directions, IoT Applications, Future Internet Technologies, Infrastructure, Networks and
Iot Smart X Application: Smart Cities, Smart Energy & Smart Grid, Smart Mobility & transport, Smart Home, Smart Building & Infrastructure, Smart Factory & Manufacturing, Smart Health, Smart Logistics & Retails.
Processor, introduction to ARM Processor, ARM Processor Architecture, Programmer’s model, Modes of operation, Interrupt Structure and Applications. Management of Power Supply, Introduction to
onents, recognizing the
Protocol Standardization for IoT, Machine to machine (M2M) and WSN Protocols, Basics of RFID, RFID Protocols &
ified Data Standards, Protocols –
Networking Architectures: Star, Mesh, Tree, and Overview of lossy& low power
network. IoT Devices Application Level Protocols: Introduction to MQTT, Quality of
Overview of Governance, Privacy and , Security, Privacy and Trust in IoT-Data-
Platforms for Smart Cities, First Steps towards a Secure Platform, Smart Approach. Data
Introduction to cloud computing, Difference between Cloud Computing and IoT, Fog Computing: The Next Evolution of Cloud Computing, Role of Cloud Computing in IoT. Livingon the Edge, Connecting IoT to cloud, Cloud Storage for
Device Connectivity,Challenge in integration of IoT with Cloud.
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
List of Project areas:
1. Being Social on Twitter & update status on Twitter through Arduino.2. IoTTemperature monitor for green house.3. Arduino Based Home Security System.4. Arduino Based Heart Rate Monitor:5. A fall detection system based on Arduino, Windows and 6. Voice Controlled Mini Home Automation using Android Smartphone7. Control Devices using Localhost Web Server for Home Automation.8. Minimizing Electricity Theft by Internet of Things9. Internet-of-Things Base10. A Design of the IOT Gateway for Agricultural Greenhouse
Text Books: 1. Jan Holler, VlasiosTsiatsis, Catherine Mulligan, Stefan Avesand, StamatisKarnouskos,
David Boyle, “From Machine
New Age of Intelligence”, 1st Edition, Academic Press, 2014.
2. Francis daCosta, “Rethinking the Internet of Things: A Scalable Approach to
Connecting Everything”, 1st Edition, Apress Publications, 2013
Reference Books: 1. Marco Schwartz, “Internet of Things with the Arduino Y
2. Daniel Minoli John Wiley &Sons ,Building the internet of things with ipv6 and mipv6,
The Evolving World of M2M Communications, ISBN: 978
3. Cassimally, Hakim, “Designing the Internet of Things”, Wiley Publica
111843062X
Course Outcomes: The student will be able to 1. Learn the terminology, technology and its applications of IoT2. Analyze Embedded suite widely used in IoT. 3 . Describe the concept of M2M with necessary protocols 4. Uunderstand the cloud storage for IoT applications. 5. Optimize resources for different IoT applications
6. Understand Real world IoT Design constr
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Being Social on Twitter & update status on Twitter through Arduino.IoTTemperature monitor for green house. Arduino Based Home Security System. Arduino Based Heart Rate Monitor: A fall detection system based on Arduino, Windows and Azure Voice Controlled Mini Home Automation using Android SmartphoneControl Devices using Localhost Web Server for Home Automation. Minimizing Electricity Theft by Internet of Things.
Things Based Ubiquitous Healthcare Systems. the IOT Gateway for Agricultural Greenhouse.
Jan Holler, VlasiosTsiatsis, Catherine Mulligan, Stefan Avesand, StamatisKarnouskos,
David Boyle, “From Machine-to-Machine to the Internet of Things: Introduction to a
, 1st Edition, Academic Press, 2014.
Francis daCosta, “Rethinking the Internet of Things: A Scalable Approach to
Connecting Everything”, 1st Edition, Apress Publications, 2013
Marco Schwartz, “Internet of Things with the Arduino Yun”, Packt Publishing, 2014.
2. Daniel Minoli John Wiley &Sons ,Building the internet of things with ipv6 and mipv6,
The Evolving World of M2M Communications, ISBN: 978-1-118-47347-4
3. Cassimally, Hakim, “Designing the Internet of Things”, Wiley Publications, ISBN 10:
1. Learn the terminology, technology and its applications of IoT 2. Analyze Embedded suite widely used in IoT. 3 . Describe the concept of M2M with necessary protocols
stand the cloud storage for IoT applications. 5. Optimize resources for different IoT applications
6. Understand Real world IoT Design constraint.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 113 of 141
Being Social on Twitter & update status on Twitter through Arduino.
Voice Controlled Mini Home Automation using Android Smartphone.
Jan Holler, VlasiosTsiatsis, Catherine Mulligan, Stefan Avesand, StamatisKarnouskos,
Machine to the Internet of Things: Introduction to a
Francis daCosta, “Rethinking the Internet of Things: A Scalable Approach to
un”, Packt Publishing, 2014.
2. Daniel Minoli John Wiley &Sons ,Building the internet of things with ipv6 and mipv6,
tions, ISBN 10:
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS4009:
Credits: 04
Section 1: Topics/Contents
Introduction, Elements of image processing system, Scenes and Images, Vector Algebra, Human Visual System, color vision color model:some basic relationships between pixels, linear and nonlinear operations. Image types (optical and microwave), Image file formats (BMP, tiff, jpeg, ico, ceos, GIF,png, raster image format). Image sampling and quantization.
Thresholding, Spatial domain techniques { Image Negative, Contrast stretching, gray level slicing, bit plane slicing, histogram and histogram equalization, local enhancement technique, image subtraction and image average, Image filters, median filtering, Image Frequency domain techniquespass filter, Homo-morphic filters. Image segmentation- Classification of imaSegmentation, Edge-based Segmentation, region approach, clustering techniques, edgebased, classification of edges and edge detection, watershed transformation Feature Extraction- Boundary representation( Chain code, descriptor) Region representation (Area, Euler number, Eccentricity, Shape matrix, moment based descriptor), texture based features.
Section2: Topics/Contents
Introduction to Image compression and its need, Coding reducompression techniques (Lossy and losslessscalar and vector quantization Object Recognition { Need, Automated object recognition system, pattern and pattern class, relationship between image prrecognition, approaches to object recognition. Introduction to two dimensional orthogonal and unitary transforms, properties of unitary transforms. One-two dimensional discrete Fourier Transform (DFT). Cosine, Slant, KL, affine transforms. Singular Value Decomposition, Applications of transforms in Image processing.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS4009: IMAGE PROCESSING
Teaching Scheme: Theory: 3Hours / Week
Lab: 2 Hours/Week
Introduction, Elements of image processing system, Scenes and Images, Vector Algebra, Human Visual System, color vision color model: RGB, HVS, YUV, CMYK, YCsome basic relationships between pixels, linear and nonlinear operations. Image types
Image file formats (BMP, tiff, jpeg, ico, ceos, GIF,png, raster image format). Image sampling and quantization.
Thresholding, Spatial domain techniques { Image Negative, Contrast stretching, gray level slicing, bit plane slicing, histogram and histogram equalization, local enhancement technique, image subtraction and image average, Image Smoothening: lowfilters, median filtering, Image Sharpening: high-pass spatial filter, derivative filters, Frequency domain techniques- Ideal low-pass filter, Butterworth low-pass filter, High
morphic filters.
Classification of image segmentation techniques: Watershed based Segmentation, region approach, clustering techniques, edge
based, classification of edges and edge detection, watershed transformation Feature Boundary representation( Chain code, B-spline representation, Fourier
descriptor) Region representation (Area, Euler number, Eccentricity, Shape matrix, moment based descriptor), texture based features.
Introduction to Image compression and its need, Coding redundancy, classification of compression techniques (Lossy and lossless- JPEG, RLE, Huffman, Shannon fano), scalar and vector quantization Object Recognition { Need, Automated object recognition system, pattern and pattern class, relationship between image processing and object recognition, approaches to object recognition.
Introduction to two dimensional orthogonal and unitary transforms, properties of unitary two dimensional discrete Fourier Transform (DFT). Cosine, Slant, KL,
rms. Singular Value Decomposition, Applications of transforms in Image
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 114 of 141
FF No. :654
3Hours / Week
Lab: 2 Hours/Week
Introduction, Elements of image processing system, Scenes and Images, Vector Algebra, RGB, HVS, YUV, CMYK, YCbCr and
some basic relationships between pixels, linear and nonlinear operations. Image types Image file formats (BMP, tiff, jpeg, ico, ceos, GIF,png, raster
Thresholding, Spatial domain techniques { Image Negative, Contrast stretching, gray level slicing, bit plane slicing, histogram and histogram equalization, local enhancement
low-pass spatial pass spatial filter, derivative filters,
pass filter, High-
ge segmentation techniques: Watershed based Segmentation, region approach, clustering techniques, edge-
based, classification of edges and edge detection, watershed transformation Feature spline representation, Fourier
descriptor) Region representation (Area, Euler number, Eccentricity, Shape matrix,
ndancy, classification of JPEG, RLE, Huffman, Shannon fano),
scalar and vector quantization Object Recognition { Need, Automated object recognition ocessing and object
Introduction to two dimensional orthogonal and unitary transforms, properties of unitary two dimensional discrete Fourier Transform (DFT). Cosine, Slant, KL,
rms. Singular Value Decomposition, Applications of transforms in Image
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Sub band coding, Haar Transform expansions, Wavelet Transform in one dimensions; Wavelet transforms in two dimensions.DB4, Fast Wavelet Transform, Other Applications of Wavelet in image processing
List of Assignments: (THL course)
1. Write matlab code to display following binary images Square Triangle Circle
Write matlab code to perform following operations on images Flip Image along horizontal and vertical direction. Enhance quality of a given image by changing brightness of image. Image negation operation. Change contrast of a given Image.2. Write Matlab code to implement pseudo colouring operation of a given image. Write Matlab Code for Pseudo Colour of Image by using Gray to colour transform. 3. Study of different file formats e.g. BMP, TIFF aBMP. 4. Write matlab code to find following statistical properties of an image. Mean Median Variance Standard deviation Covariance. 5. Write matlab code to enhance image q Logarithmic transformation Histogram Equalization Gray level slicing with and without background. Inverse transformation.6. Read an Image and Perform singular value decompositi singular values and reconstruct the image. Also Compute the Compression ratio. 7. Write matlab code to enhance image quality by using following techniques Low pass and weighted low pass filter. Median filter. Laplacian mask.8. Write matlab code for edge detection using Sobel, Prewitt and Roberts operators.9. Write C-language code to find out Huffman code for the following word COMMITTEE. 10. Write matlab code to design encoder and decoder by using Arithmetic coding for the following word MUMMY. (Probabilities of symbols M 0.1 ). 11. Write matlab code to find out Fourier spectrum, phase angle and power spectrum of binary image and gray scale image.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Sub band coding, Haar Transform – it’s application as a Wavelet, multi resolution expansions, Wavelet Transform in one dimensions; Wavelet transforms in two
4, Fast Wavelet Transform, Other Applications of Wavelet in image
List of Assignments: (THL course)
Write matlab code to display following binary images Square Triangle
Write matlab code to perform following operations on images Flip Image along horizontal and vertical direction. Enhance quality of a given image by changing brightness of image. Image negation operation.
ange contrast of a given Image. Write Matlab code to implement pseudo colouring operation of a given image.
Write Matlab Code for Pseudo Colour of Image by using Gray to colour
Study of different file formats e.g. BMP, TIFF and extraction of attributes of
Write matlab code to find following statistical properties of an image.
Write matlab code to enhance image quality by using following techniquesLogarithmic transformation Histogram Equalization
Gray level slicing with and without background. Inverse transformation.
Read an Image and Perform singular value decomposition. Retain only k largestsingular values and reconstruct the image. Also Compute the Compression ratio.
Write matlab code to enhance image quality by using following techniquesLow pass and weighted low pass filter. Median filter. Laplacian mask.
Write matlab code for edge detection using Sobel, Prewitt and Roberts operators.language code to find out Huffman code for the following word
esign encoder and decoder by using Arithmetic coding for the following word MUMMY. (Probabilities of symbols M-0.4, U-0.2, X
Write matlab code to find out Fourier spectrum, phase angle and power spectrumof binary image and gray scale image.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 115 of 141
it’s application as a Wavelet, multi resolution expansions, Wavelet Transform in one dimensions; Wavelet transforms in two
4, Fast Wavelet Transform, Other Applications of Wavelet in image
Write matlab code to display following binary images Square Triangle
Write Matlab code to implement pseudo colouring operation of a given image. Write Matlab Code for Pseudo Colour of Image by using Gray to colour
nd extraction of attributes of
uality by using following techniques
on. Retain only k largest singular values and reconstruct the image. Also Compute the Compression ratio.
Write matlab code to enhance image quality by using following techniques
Write matlab code for edge detection using Sobel, Prewitt and Roberts operators.
esign encoder and decoder by using Arithmetic coding for 0.2, X-0.3,Y-
Write matlab code to find out Fourier spectrum, phase angle and power spectrum
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Text Books: 1. Rafael Gonzalez & Richard Woods, “Digital Image Processing,”
publications, ISBN 0132345633.
2. Anil K. Jain, “Fundamental of Digital Image Processing,”
publication, ISBN 13: 9780133361650.
Reference Books:
1. Pratt, “Digital Image Processing,” Wiley Publication,
37407-5.
2. K.R. Castleman, “Digital Image Processing,”
Saddle River, NJ, 3, ISBN
3. K. D. Soman and K. I. Ramchandran, “Insight into wavelets
practice,” 2nd
Edition PHI, 2005.
Course Outcomes:
The student will be able to 1. Describe image model. 2. Perform spatial filtering on image3. Identify Image Segmentation techniques.4. Apply lossless and lossy compression techniques for image compression.5. Use various image transforms to analyze and modify image. 6. Understand Wavelet transform for Image Processing Applications.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Rafael Gonzalez & Richard Woods, “Digital Image Processing,” 3rd
Edition
0132345633.
Anil K. Jain, “Fundamental of Digital Image Processing,” 5th
Edition, PHI
13: 9780133361650.
Pratt, “Digital Image Processing,” Wiley Publication, 3rd
Edition , ISBN
K.R. Castleman, “Digital Image Processing,” 3rd
Edition, Prentice Hall: Upper
Saddle River, NJ, 3, ISBN 0-13-211467 -4.
K. D. Soman and K. I. Ramchandran, “Insight into wavelets - From theory to
Edition PHI, 2005.
2. Perform spatial filtering on image. Segmentation techniques.
4. Apply lossless and lossy compression techniques for image compression. 5. Use various image transforms to analyze and modify image. 6. Understand Wavelet transform for Image Processing Applications.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 116 of 141
Edition, Pearson
PHI
, ISBN 0-471-
, Prentice Hall: Upper
From theory to
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS 4010: MODEL
Credits: 04
Section 1: Topics/Contents
System Specifications: Static Behavior specification using Use Case diagrams, Dynamic Behavior specification using Sequence diagrams, Collaboration diagrams, State Chart diagrams, Activity Diagrams, Communication Diagram, Interaction Overview Diagrams, Timing Diagrams, Metamodel discussion of behavioral diagrams, System Design Specification with Class diagrams, Interface and architectural specifications, Metamodel discussion of Structural diagrams, CMOF-EMOF Infrastructure Specifications, OMG’s profiles for objectservice-oriented technologiesMDA and Enterprise Computing
Centric Computing, ApplicationPressures on Enterprise-Centric Computing, Pressure on Production Costs, Bringing Model-Centrism to Intermediate Tiers, EAI, and B2Bi, Syntactic Abstraction versus Semantic Abstraction, B2Bi and MDA, Flexibility in Choosing the Abstraction Level, EAI and MDA, The Limits of Declarative Specification, Metadata Integration, MDA and Component-Based Development,MDA-Based Modeling Languages, Synchronizing among Multiple Tiers, Middleware and the Abstraction Gap, Design by Contract, The Role of UML in MDA, The Meta Object Facility (MOF), Extending and Creating ModCompilation of Class Models, Abstraction Levels, Modeling Transformations with CWM, Sample Transaction MetamodelIntroduction to Graph Transformation Systems
Theory, A Short Introduction to SignatGrammars and Graph, The Main Ideas of the Algebraic Graph Transformation, Approach, Graphs, Typed Graphs, and the Gluing Construction, Graph Transformation Systems, Adhesive High-Replacement Systems, Embedding and Local Confluence, Constraints and Application Conditions
Section2: Topics/Contents
Systems Engineering Overview, Introduction to modelMBSE concepts, Process modeling with MBIntroduction to SysML and systems modeling, The SysML Basic Feature Set, Viewing SysML Models with Diagrams, Organizing The Model With Packages, Modeling Structure With Blocks, Modeling Constraints with Parametrics, ModelingBehavior with Activities. Modeling Message
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
MODEL-BASED SYSTEMS ENGINEERING
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
: Static Behavior specification using Use Case diagrams, Dynamic using Sequence diagrams, Collaboration diagrams, State Chart
diagrams, Activity Diagrams, Communication Diagram, Interaction Overview Diagrams, Timing Diagrams, Metamodel discussion of behavioral diagrams, System Design Specification with Class diagrams, Component, Deployment, Package, Profile diagrams, Interface and architectural specifications, Metamodel discussion of Structural diagrams,
EMOF Infrastructure Specifications, OMG’s profiles for object-oriented technologies
Enterprise Computing: Challenges Facing the Software Industry, MachineCentric Computing, Application-Centric Computing, Enterprise-Centric Computing,
Centric Computing, Pressure on Production Costs, Bringing ermediate Tiers, EAI, and B2Bi, Syntactic Abstraction versus
Semantic Abstraction, B2Bi and MDA, Flexibility in Choosing the Abstraction Level, EAI and MDA, The Limits of Declarative Specification, Metadata Integration, MDA and
Based Development, Model Driven Enterprise Architecture, Standardized Based Modeling Languages, Synchronizing among Multiple Tiers, Middleware
and the Abstraction Gap, Design by Contract, The Role of UML in MDA, The Meta Object Facility (MOF), Extending and Creating Modeling Languages, Building Compilation of Class Models, Abstraction Levels, Modeling Transformations with CWM, Sample Transaction Metamodel Introduction to Graph Transformation Systems: A Short Introduction to Category Theory, A Short Introduction to Signatures and Algebras, General Overview of Graph Grammars and Graph, The Main Ideas of the Algebraic Graph Transformation, Approach, Graphs, Typed Graphs, and the Gluing Construction, Graph Transformation
-Level Replacement Categories, Adhesive HighReplacement Systems, Embedding and Local Confluence, Constraints and Application
Systems Engineering Overview, Introduction to model-based systems engineering, MBSE concepts, Process modeling with MBSE, Expanded Process modeling, Introduction to SysML and systems modeling, The SysML Basic Feature Set, Viewing SysML Models with Diagrams, Organizing The Model With Packages, Modeling Structure With Blocks, Modeling Constraints with Parametrics, ModelingBehavior with Activities. Modeling Message-Based Behavior with Interactions,
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 117 of 141
FF No. :654
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
: Static Behavior specification using Use Case diagrams, Dynamic using Sequence diagrams, Collaboration diagrams, State Chart
diagrams, Activity Diagrams, Communication Diagram, Interaction Overview Diagrams, Timing Diagrams, Metamodel discussion of behavioral diagrams, System Design
Component, Deployment, Package, Profile diagrams, Interface and architectural specifications, Metamodel discussion of Structural diagrams,
-oriented and
: Challenges Facing the Software Industry, Machine-Centric Computing,
Centric Computing, Pressure on Production Costs, Bringing ermediate Tiers, EAI, and B2Bi, Syntactic Abstraction versus
Semantic Abstraction, B2Bi and MDA, Flexibility in Choosing the Abstraction Level, EAI and MDA, The Limits of Declarative Specification, Metadata Integration, MDA and
Model Driven Enterprise Architecture, Standardized Based Modeling Languages, Synchronizing among Multiple Tiers, Middleware
and the Abstraction Gap, Design by Contract, The Role of UML in MDA, The Meta eling Languages, Building
Compilation of Class Models, Abstraction Levels, Modeling Transformations with
: A Short Introduction to Category ures and Algebras, General Overview of Graph
Grammars and Graph, The Main Ideas of the Algebraic Graph Transformation, Approach, Graphs, Typed Graphs, and the Gluing Construction, Graph Transformation
hesive High-Level Replacement Systems, Embedding and Local Confluence, Constraints and Application
based systems engineering, SE, Expanded Process modeling,
Introduction to SysML and systems modeling, The SysML Basic Feature Set, Viewing SysML Models with Diagrams, Organizing The Model With Packages, Modeling Structure With Blocks, Modeling Constraints with Parametrics, Modeling Flow-Based
Based Behavior with Interactions,
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Modeling Text-Based Requirements, Modeling CrossAllocations, Customizing SysML for Specific DomainsManaging the Quality of UML Models
Examples and Evidences, Integrating Quality Criteria and Methods of Evaluation for Software Models, Evaluating Performance of Software Architecture Models with the Palladio Component Model, Integrating Measures and RedesigDomain Specific Visual Languages, Measuring Models, ModelRefactoring, A Pattern Approach to Increasing the Maturity Level of Class Models, Transitioning from Code-Centric to Modelin Industry and Academia, From Requirements to Java Code: An ArchitectureApproach for Producing Quality Systems, QualityRequirements to UML Class Diagrams, A Framework for Understanding and Addressingthe Semiotic Quality of Use Case Models, QualityEngineering, Model-Driven Integration in Complex Information Systems: Experiences from Two Scenarios Models of Reactive Systems
Based Integration, Metamodelling: State of the Art and Research Challenges, Semantics of UML Models for Dynamic Behavior, A Survey of Different Approaches, Modeling Languages for Real-Time and Embedded Systems, Requirements and StandardsSolutions, Requirements Modeling for Embedded RealSafety and Certification: ModelIntensive Systems, Model Evolution and Management, ModelDevelopment of Dependable, Tools
List of Practical’s: (For THL, TLP courses)
1. To narrate System Requirements Specification Document for target system with reference to the IEEE 610.12.1990 Std guidelines.
2. To classify and structure functional and nonsubject areas. The requirements structures shall be indicated by Requirement Structure diagrams using SysMLprofiles for requirement management.
3. To decompose and organize the proidentify the boundaries of problem/systemusing system representation shall be specified using Use Case Metamodel and OCL.
4. To depict the dynamic behavior of the target system using Sequence diagram should be based on the Scenarios generated by the interCommunication. The target system representation shall be specified using Interaction diagram Metamodel and OCL.
5. To depict the state transition with the lmodel. The model should depict:
a. Possible ways the object can respond to events from other objects.b. Determine of start, end, and transition states. c. The target system representation shall be specified using State
Metamodel and OCL.6. To depict the dynamic behavior using detailed Activity diagram. Activity is a
parameterized behavior represented as coordinated flow of actions.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Based Requirements, Modeling Cross-Cutting Relationships with Allocations, Customizing SysML for Specific Domains Managing the Quality of UML Models: Quality in Model Driven Engineering, Examples and Evidences, Integrating Quality Criteria and Methods of Evaluation for Software Models, Evaluating Performance of Software Architecture Models with the Palladio Component Model, Integrating Measures and Redesigns in the Definition of Domain Specific Visual Languages, Measuring Models, Model-Driven Software Refactoring, A Pattern Approach to Increasing the Maturity Level of Class Models,
Centric to Model-Driven Industrial Projects: Empiricin Industry and Academia, From Requirements to Java Code: An ArchitectureApproach for Producing Quality Systems, Quality-Driven Model Transformations: From Requirements to UML Class Diagrams, A Framework for Understanding and Addressingthe Semiotic Quality of Use Case Models, Quality-Aware Model-Driven Service
Driven Integration in Complex Information Systems: Experiences
Models of Reactive Systems: Communication, Concurrency, and Causality, Modelased Integration, Metamodelling: State of the Art and Research Challenges, Semantics
of UML Models for Dynamic Behavior, A Survey of Different Approaches, Modeling Time and Embedded Systems, Requirements and Standards
quirements Modeling for Embedded Real-time Systems, UML for Software Safety and Certification: Model-Based Development of Safety-Critical SoftwareIntensive Systems, Model Evolution and Management, Model-Based Analysis and Development of Dependable, Tools and Languages for Real-time Systems
: (For THL, TLP courses)
To narrate System Requirements Specification Document for target system with reference to the IEEE 610.12.1990 Std guidelines.
classify and structure functional and non-functional requirements . The requirements structures shall be indicated by Requirement
Structure diagrams using SysMLprofiles for requirement management. To decompose and organize the problem domain area into broad subject areas and
he boundaries of problem/systemusing Use Case diagramssystem representation shall be specified using Use Case Metamodel and OCL.To depict the dynamic behavior of the target system using sequence diagram. The Sequence diagram should be based on the Scenarios generated by the inter
The target system representation shall be specified using Interaction diagram Metamodel and OCL. To depict the state transition with the life history of objects of a given class
model. The model should depict: Possible ways the object can respond to events from other objects.Determine of start, end, and transition states. The target system representation shall be specified using State Metamodel and OCL.
To depict the dynamic behavior using detailed Activity diagram. Activity is a parameterized behavior represented as coordinated flow of actions.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 118 of 141
Cutting Relationships with
lity in Model Driven Engineering, Examples and Evidences, Integrating Quality Criteria and Methods of Evaluation for Software Models, Evaluating Performance of Software Architecture Models with the
ns in the Definition of Driven Software
Refactoring, A Pattern Approach to Increasing the Maturity Level of Class Models, Driven Industrial Projects: Empirical Studies
in Industry and Academia, From Requirements to Java Code: An Architecture-Centric Driven Model Transformations: From
Requirements to UML Class Diagrams, A Framework for Understanding and Addressing Driven Service
Driven Integration in Complex Information Systems: Experiences
: Communication, Concurrency, and Causality, Model-ased Integration, Metamodelling: State of the Art and Research Challenges, Semantics
of UML Models for Dynamic Behavior, A Survey of Different Approaches, Modeling Time and Embedded Systems, Requirements and Standards-Based
time Systems, UML for Software Critical Software-
Based Analysis and
To narrate System Requirements Specification Document for target system with
functional requirements into broad . The requirements structures shall be indicated by Requirement
Structure diagrams using SysMLprofiles for requirement management. blem domain area into broad subject areas and
diagrams. The target system representation shall be specified using Use Case Metamodel and OCL.
sequence diagram. The Sequence diagram should be based on the Scenarios generated by the inter-object
The target system representation shall be specified using
ife history of objects of a given class
Possible ways the object can respond to events from other objects.
The target system representation shall be specified using State diagram
To depict the dynamic behavior using detailed Activity diagram. Activity is a parameterized behavior represented as coordinated flow of actions. The target
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
system representation shall be specified using Activity diagram MetamodelOCL.
7. To develop logical static structure of target system with Software Class diagram. To prepare Class Collaborationclasses traced from System analysis phase. be specified using Class diagram Metamodel and OCL.
8. To represent physical module that provides occurrence of classes or other logical elements identified during analysis and design of system using Component diagram. The model should depict allocation of classcomponent specifications shall be narrated using precise Program Design Language constructs separating computation from interface.
9. To represent deployment view of the system through Architecture Diagram encompassing both hardware and sorepresentation shall be specified using Component and Deployment
Text Books: 1. David S. Frankel, Model Driven Architecture: Applying MDA to Enterprise
Computing, 2003, Wiley Publishing, Inc, ISBN: 0
2. Prof. Dr. HartmutEhrig, Dr. KarstenEhrig, Ulrike Prange, Dr. Gabriele
Taentzer, Fundamentals of Algebraic Graph Transformation, Springer
Berlin Heidelberg 2006, ISBN
Reference Books :
1. Holger Giese, Gabor Karsai, Edward Lee, Ber
Model-Based Engineering of Embedded Real
Berlin Heidelberg 2010, ISBN
2. JörgRech, Christian Bunse, Model
Quality Assurance, 2009 IGI Glo
3. Jon Holt, Simon Perry, SysML for Systems Engineering 2nd Edition: A model
based approach, The Institution of Engineering and Technology 2008, ISBN 978
1-84919-651-2
4. Sanford Friedenthal, Alan Moore, Rick Steiner, A Practical
Systems Modeling Language, Third edition, Elsevier Inc, ISBN: 978
800202-5
5. Sami Beydeda, Matthias Book, Volker Gruhn, Model
Development, Springer
25613-7
6. Tom Pender, “UML Bible”, John Wiley & sons, ISBN
7. Jim Arlow, IlaNeustadt, “UML 2 and Unified Process: Practical Object Oriented
Analysis and Design.”, 2nd Edition, Addison
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
system representation shall be specified using Activity diagram Metamodel
To develop logical static structure of target system with Software Class diagram. To prepare Class Collaboration-Responsibility (CRC) cards for the Conceptual classes traced from System analysis phase. The target system representation shall
specified using Class diagram Metamodel and OCL. To represent physical module that provides occurrence of classes or other logical elements identified during analysis and design of system using Component diagram. The model should depict allocation of classes to modules. The component specifications shall be narrated using precise Program Design Language constructs separating computation from interface. To represent deployment view of the system through Architecture Diagram encompassing both hardware and software profiles. The target system representation shall be specified using Component and Deployment Metamodel.
David S. Frankel, Model Driven Architecture: Applying MDA to Enterprise
Computing, 2003, Wiley Publishing, Inc, ISBN: 0-471-31920-1
Prof. Dr. HartmutEhrig, Dr. KarstenEhrig, Ulrike Prange, Dr. Gabriele
Taentzer, Fundamentals of Algebraic Graph Transformation, Springer
Berlin Heidelberg 2006, ISBN-13 978-3-540-31187-4
Holger Giese, Gabor Karsai, Edward Lee, Bernhard Rumpe, Bernhard Schätz,
Based Engineering of Embedded Real-Time Systems, Springer
Berlin Heidelberg 2010, ISBN-13 978-3-642-16276-3
JörgRech, Christian Bunse, Model-Driven Software Development: Integrating
Quality Assurance, 2009 IGI Global, ISBN 978-1-60566-007-3
Jon Holt, Simon Perry, SysML for Systems Engineering 2nd Edition: A model
based approach, The Institution of Engineering and Technology 2008, ISBN 978
Sanford Friedenthal, Alan Moore, Rick Steiner, A Practical Guide to SysML: The
Systems Modeling Language, Third edition, Elsevier Inc, ISBN: 978
Sami Beydeda, Matthias Book, Volker Gruhn, Model-Driven Software
Development, Springer-Verlag Berlin Heidelberg 2005, ISBN-13 978
“UML Bible”, John Wiley & sons, ISBN – 0764526049
Jim Arlow, IlaNeustadt, “UML 2 and Unified Process: Practical Object Oriented
Analysis and Design.”, 2nd Edition, Addison- Wesley, ISBN – 0321321278.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 119 of 141
system representation shall be specified using Activity diagram Metamodel and
To develop logical static structure of target system with Software Class diagram. Responsibility (CRC) cards for the Conceptual
The target system representation shall
To represent physical module that provides occurrence of classes or other logical elements identified during analysis and design of system using Component
es to modules. The component specifications shall be narrated using precise Program Design
To represent deployment view of the system through Architecture Diagram ftware profiles. The target system
Metamodel.
David S. Frankel, Model Driven Architecture: Applying MDA to Enterprise
Prof. Dr. HartmutEhrig, Dr. KarstenEhrig, Ulrike Prange, Dr. Gabriele
Taentzer, Fundamentals of Algebraic Graph Transformation, Springer-Verlag
nhard Rumpe, Bernhard Schätz,
Time Systems, Springer-Verlag
Driven Software Development: Integrating
Jon Holt, Simon Perry, SysML for Systems Engineering 2nd Edition: A model-
based approach, The Institution of Engineering and Technology 2008, ISBN 978-
Guide to SysML: The
Systems Modeling Language, Third edition, Elsevier Inc, ISBN: 978-0-12-
Driven Software
13 978-3-540-
0764526049
Jim Arlow, IlaNeustadt, “UML 2 and Unified Process: Practical Object Oriented
0321321278.
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Course Outcomes:
Upon completion of the course, 1. Model requirements using
requirement structures and catalogue2. Discover the set of behavioral and structural properties of complex systems by
making use of UML Superstructure speci3. Explore the concepts, guidelines and technology for
orchestration to integrate in Enterprise 4. Prepare well-formed specifications and reports for
composition and delivery to the stakeholders5. Understand case studies and lessons learned with utilization of
development conceptsimplementing complex
6. Create sustainable System design supported by testability.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Upon completion of the course, graduates will be able to - Model requirements using SysML specifications and profiles encompassing requirement structures and catalogue.
behavioral and structural properties of complex systems by making use of UML Superstructure specifications and OCL. Explore the concepts, guidelines and technology for System Designelementsorchestration to integrate in Enterprise Component Systems in societal context.
formed specifications and reports for component d delivery to the stakeholders as being a part of development team
Understand case studies and lessons learned with utilization of development concepts and specification knowledge towards planning and implementing complex systems. Create sustainable System design supported by reuse, documentation, and
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 120 of 141
encompassing
behavioral and structural properties of complex systems by
System Designelements in societal context.
component service as being a part of development team.
Understand case studies and lessons learned with utilization of Model-based knowledge towards planning and
reuse, documentation, and
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS4011:
Credits: 4
Section 1: Natural Language Processing
Origins of NLP, Challenges of NLP, Language and Knowledge, Processing Indian Languages, Formal Language Theory:
Automata:, Basic Regular Expression Patterns, Disjunction, Grouping and Precedence, Advanced Operators, Substitution, Finite State Automata, NFSA, Transducers: Morphology, Inflectional Morphology, Derivational Morphology, Finite State Morphological Parsing, Construction of Finite State Lexicon, Finite State Transducers, FST for Morphological Parsing, language models, lexical functional Grammar(LFG), Government and Binding (GB), Lexical functional Grammar Model, Generative grammars, Syntactic Analysis: Context Free Grammar, parsing, Topparsing, Probabilistic parsing, Indian Languages parsing Representation, Lexical Semantic, Am
Section2: Computational Linguistics Using Machine Learning
Mathematical Foundations for Machine Learning
Function, Gradient, Training, Testing, CrossK-Nearest Neighbor, K-Means Statistical Language modeling
Phonology and Stress Analysis based and Statistical based, Support vector machine, Memory Entropy Model, Conditional Random FieldsMachine Translation: RuleSRTLM and Moses
List of Practical’s: (For TH
Operating System recommended
Programming tools recommended
Programming tool like G++ /GCC, WEKA, GIZA++, MOSES, SRTLM
1. Project 1 :
POS Taggers For Indian Languages2. Project 02:
Rule based Machine Translation for phrases/form labels3. Project 02:
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS4011: Computational Linguistics
Teaching Scheme: Theory: 3 H
Lab: 2 Hours / Week
Natural Language Processing
Origins of NLP, Challenges of NLP, Language and Knowledge, Processing Indian Formal Language Theory: Basic Notions, Regular Expressions and
Automata:, Basic Regular Expression Patterns, Disjunction, Grouping and Precedence, Advanced Operators, Substitution, Finite State Automata, NFSA,
Morphology, Inflectional Morphology, Derivational Morphology, Finite ate Morphological Parsing, Construction of Finite State Lexicon, Finite State
Transducers, FST for Morphological Parsing, Language Modelling: Grammarlanguage models, lexical functional Grammar(LFG), Government and Binding (GB),
rammar Model, Generative grammars, Theory of parsing /
Context Free Grammar, parsing, Top-down Parsing, Bottomparsing, Probabilistic parsing, Indian Languages parsing Semantic Analysis:
Representation, Lexical Semantic, Ambiguity, Word Sense Disambiguation
Computational Linguistics Using Machine Learning
Mathematical Foundations for Machine Learning: Hypothesis, Target Function, Cost Function, Gradient, Training, Testing, Cross-validation, Linear and Logistic Regression,
Means Statistical Language modeling: N-gram model, Machine Transliteration: Rule
s Analysis based and Statistical based, Support vector machine, Memory Entropy Model, Conditional Random Fields
Rule-Based, Statistical-Based using MT Tools
List of Practical’s: (For THP)
recommended: - 64-bit Open source Linux or its derivativeProgramming tools recommended: - Open Source C, C++, JAVA, and PYTHON, Programming tool like G++ /GCC, WEKA, GIZA++, MOSES, SRTLM
POS Taggers For Indian Languages
Rule based Machine Translation for phrases/form labels
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 121 of 141
FF No. :654
3 Hours / Week
2 Hours / Week
Origins of NLP, Challenges of NLP, Language and Knowledge, Processing Indian xpressions and
Automata:, Basic Regular Expression Patterns, Disjunction, Grouping and Precedence, Advanced Operators, Substitution, Finite State Automata, NFSA, Words and
Morphology, Inflectional Morphology, Derivational Morphology, Finite ate Morphological Parsing, Construction of Finite State Lexicon, Finite State
Grammar-based language models, lexical functional Grammar(LFG), Government and Binding (GB),
Theory of parsing /
down Parsing, Bottom-up Semantic Analysis: Meaning
: Hypothesis, Target Function, Cost validation, Linear and Logistic Regression,
gram model, Machine Transliteration: Rule-based, s Analysis based and Statistical based, Support vector machine,
Based using MT Tools - GIZA++,
bit Open source Linux or its derivative
, and PYTHON,
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Machine Translation/Transliteration using Statistical Machine Translation
Text Books: 1. Tanveer Siddiqui and U S Tiwary, “Natural Language Processing and Information
Retrieval” Fourth Impression, Oxford, ISBN
2. Daniel Jurafsky and James H Martin., "Speech and Language Processing", 2
edition, Pearson, Second Impression
Reference Books:
4. Alexander Clark, Chris Fox and
Linguistics and Natural Language Processing”,Wiley
118-34718-8
Course Outcomes:
Upon completion of the course, graduates will be able to 1. Analyze Morphology for given natural languag2. Apply different approaches to design Lexical Analyzer for given natural language3. Evaluate and devise Syntactic Analyzer design for given natural language4. Design Type Dependency Parser using pragmatic approach for given natural language5. Develop machine transliteration for given natural language using statistical approach6. Develop machine translation for given natural language using statistical approach
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Machine Translation/Transliteration using Statistical Machine Translation
Tanveer Siddiqui and U S Tiwary, “Natural Language Processing and Information
Retrieval” Fourth Impression, Oxford, ISBN-13:978-019-569232-7.
Daniel Jurafsky and James H Martin., "Speech and Language Processing", 2
edition, Pearson, Second Impression-2014,ISBN: 978-93-325-1841-4
Alexander Clark, Chris Fox and Shalom Lappin “The Handbook of Computational
Linguistics and Natural Language Processing”,Wiley-Blackwell-2013, ISBN
Upon completion of the course, graduates will be able to –
Analyze Morphology for given natural language. Apply different approaches to design Lexical Analyzer for given natural languageEvaluate and devise Syntactic Analyzer design for given natural languageDesign Type Dependency Parser using pragmatic approach for given natural language
machine transliteration for given natural language using statistical approachDevelop machine translation for given natural language using statistical approach
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 122 of 141
Machine Translation/Transliteration using Statistical Machine Translation
Tanveer Siddiqui and U S Tiwary, “Natural Language Processing and Information
Daniel Jurafsky and James H Martin., "Speech and Language Processing", 2nd
Shalom Lappin “The Handbook of Computational
2013, ISBN-978-1-
Apply different approaches to design Lexical Analyzer for given natural language. Evaluate and devise Syntactic Analyzer design for given natural language. Design Type Dependency Parser using pragmatic approach for given natural language.
machine transliteration for given natural language using statistical approach. Develop machine translation for given natural language using statistical approach.
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS 4012:
Credits: 04
Section 1: Topics/Contents
A GENTLE INTRODUCTION TO GENETIC ALGORITHMS
Algorithms? ,Robustness of Traditional Optimization and Search Methods. The Goals of Optimization, How Are Genetic Algorithms Different from Traditional Methods? A Simple Genetic Algorithm. Genetic Algorithms at Workfor the Search Mill—Important Similarities 18 Similarity Templates (Schemata) 19 Learning the Lingo. GENETIC ALGORITHMS REVISITED: MATHEMATICAL FOUNDATIONS:
and Who Shall Die? The Fundamental Theorem, Schema Processing at Work: AExample by Hand Revisited. The TwoSchemata Are Processed Usefully. The Building Block Hypothesis, Another Perspective: The Minimal Deceptive Problem, Schemata Revisited: Similarity Templates as Hyper planes. COMPUTER IMPLEMENTATION OF A GENETIC ALGORITHM:
Reproduction, Crossover, and Mutation, A Time to Reproduce, a Time to Cross, Get with the Main Program, How Well Does it Work?, Mapping Objective Functions to Fitness Form, Fitness Scaling, CDiscretization , Constraints. Section2: Topics/Contents
SOME APPLICATIONS OF GENETIC ALGORITHMS:
Genetic Algorithm Applications of Historical Interest , De Jong and Function Optimization, Improvements in Basic Technique , Current Applications of Genetic Algorithms. ADVANCED OPERATORS AND TECHNIQUES IN GENETIC SEARCH
Diploidy, and Abeyance . Inversion and Other Reordering Operators .Other Microoperators, Niche and Speciation, Multiobjective Optimization, KnowledgeTechniques, Genetic Algorithms and Parallel Processors .INTRODUCTION TO GENETICS
Learning: Whence It Came 218 What is a Classifier System? Rule and Message System. Apportionment of Credit: The Bucket Brigade , Genetic Algorithm . A Simple Classifier System in Pascal, Results Using the Sim
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS 4012: GENETIC ALGORITHMS
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
GENTLE INTRODUCTION TO GENETIC ALGORITHMS : What Are Genetic Algorithms? ,Robustness of Traditional Optimization and Search Methods. The Goals of Optimization, How Are Genetic Algorithms Different from Traditional Methods?A Simple Genetic Algorithm. Genetic Algorithms at Work—a Simulation by ha
Important Similarities 18 Similarity Templates (Schemata) 19
GENETIC ALGORITHMS REVISITED: MATHEMATICAL FOUNDATIONS: Who Shall Live and Who Shall Die? The Fundamental Theorem, Schema Processing at Work: AExample by Hand Revisited. The Two-armed and й-armed Bandit Problem, How Many Schemata Are Processed Usefully. The Building Block Hypothesis, Another Perspective: The Minimal Deceptive Problem, Schemata Revisited: Similarity Templates as Hyper
OMPUTER IMPLEMENTATION OF A GENETIC ALGORITHM: Data Structures, Reproduction, Crossover, and Mutation, A Time to Reproduce, a Time to Cross, Get with the Main Program, How Well Does it Work?, Mapping Objective Functions to Fitness Form, Fitness Scaling, Coding, A Multiparameter, Mapped, Fixed-Point Coding,
SOME APPLICATIONS OF GENETIC ALGORITHMS: The Rise of Genetic Algorithms , Genetic Algorithm Applications of Historical Interest , De Jong and Function Optimization, Improvements in Basic Technique , Current Applications of Genetic
ADVANCED OPERATORS AND TECHNIQUES IN GENETIC SEARCH : Diploidy, and Abeyance . Inversion and Other Reordering Operators .Other Microoperators, Niche and Speciation, Multiobjective Optimization, KnowledgeTechniques, Genetic Algorithms and Parallel Processors . INTRODUCTION TO GENETICS-BASED MACHINE LEARNING : Genetics-Based Machine Learning: Whence It Came 218 What is a Classifier System? Rule and Message System. Apportionment of Credit: The Bucket Brigade , Genetic Algorithm . A Simple Classifier System in Pascal, Results Using the Simple Classifier System .
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 123 of 141
FF No. :654
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
: What Are Genetic Algorithms? ,Robustness of Traditional Optimization and Search Methods. The Goals of Optimization, How Are Genetic Algorithms Different from Traditional Methods?
a Simulation by hand. Grist Important Similarities 18 Similarity Templates (Schemata) 19
Who Shall Live and Who Shall Die? The Fundamental Theorem, Schema Processing at Work: An
armed Bandit Problem, How Many Schemata Are Processed Usefully. The Building Block Hypothesis, Another Perspective: The Minimal Deceptive Problem, Schemata Revisited: Similarity Templates as Hyper
Data Structures, Reproduction, Crossover, and Mutation, A Time to Reproduce, a Time to Cross, Get with the Main Program, How Well Does it Work?, Mapping Objective Functions to
Point Coding,
The Rise of Genetic Algorithms , Genetic Algorithm Applications of Historical Interest , De Jong and Function Optimization, Improvements in Basic Technique , Current Applications of Genetic
Dominance, Diploidy, and Abeyance . Inversion and Other Reordering Operators .Other Micro-operators, Niche and Speciation, Multiobjective Optimization, Knowledge-Based
Based Machine Learning: Whence It Came 218 What is a Classifier System? Rule and Message System. Apportionment of Credit: The Bucket Brigade , Genetic Algorithm . A Simple Classifier
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
APPLICATIONS OF GENETICS
Development of CS-1, the First Classifier System , Smith's Poker Player , Other Early GBML Efforts , A Potpourri of Current Applications .
List of Practical’s:
1. Implement Genetic Algorithm for following basic applications
• Word Guess
• Locating an Emergency Response Unit
2. Implement Genetic Algorithm for
• Travelling Sales Person Problem,
• Bin Packing
• Set Covering
3. Implement Genetic Algorithm for
• Pattern recognition
• Image Classification
4. Implement Genetic Algorithm for
• Economic Forecasting
• Evaluating credit risks
• Detecting stolen credit cards before customer reports it is stolen
5. Implement Genetic Algorithm for
• Studying health risks for a population exposed to toxins
• Feature Selection
Text Books:
1. Gentic Algorithms in Search, Optimization & Machine Learning, David E.
Goldberg, Pearson Education.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
APPLICATIONS OF GENETICS-BASED MACHINE LEARNING: The Rise of GBML, 1, the First Classifier System , Smith's Poker Player , Other Early
GBML Efforts , A Potpourri of Current Applications .
Implement Genetic Algorithm for following basic applications
Locating an Emergency Response Unit
Implement Genetic Algorithm for Combinatorial Optimization Problems:
Travelling Sales Person Problem,
Genetic Algorithm for Image Processing Problems:
Image Classification
Implement Genetic Algorithm for Business Problems:
Economic Forecasting
Evaluating credit risks
Detecting stolen credit cards before customer reports it is stolen
Implement Genetic Algorithm for Medical Problems:
Studying health risks for a population exposed to toxins
Gentic Algorithms in Search, Optimization & Machine Learning, David E.
Goldberg, Pearson Education.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 124 of 141
The Rise of GBML, 1, the First Classifier System , Smith's Poker Player , Other Early
Gentic Algorithms in Search, Optimization & Machine Learning, David E.
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Reference Books:
1. Handbook of Genetic Algorithms, Lawrence Davis, Editor, Van Nostrand Reinhold,
1991.
2. Genetic Programming, John R. Koza, MIT Press, 1992
3. Adaptation in Natural and Artificial Systems, John H. Holland, MIT Press, 1992
Course Outcomes:
Upon completion of the course, graduates will be able to 1. Identify various problems which can be solved by Genetic Algorithms.2. Model problems in the space of genetic algorithms.3. Understand mathematical foundation of Genetic Algorithms.4. Explore the concepts, operators and technology for Genetic Algorithms to solve
various problems of different domains.5. Apply Genetic Algorithm based Machine Learning approaches.6. Analyze difference in performance of Machine Learning approaches and Genetic
Algorithm based Machine Learning.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
1. Handbook of Genetic Algorithms, Lawrence Davis, Editor, Van Nostrand Reinhold,
2. Genetic Programming, John R. Koza, MIT Press, 1992
3. Adaptation in Natural and Artificial Systems, John H. Holland, MIT Press, 1992
Upon completion of the course, graduates will be able to – Identify various problems which can be solved by Genetic Algorithms.Model problems in the space of genetic algorithms. Understand mathematical foundation of Genetic Algorithms.
concepts, operators and technology for Genetic Algorithms to solve various problems of different domains. Apply Genetic Algorithm based Machine Learning approaches. Analyze difference in performance of Machine Learning approaches and Genetic
d Machine Learning.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 125 of 141
1. Handbook of Genetic Algorithms, Lawrence Davis, Editor, Van Nostrand Reinhold,
3. Adaptation in Natural and Artificial Systems, John H. Holland, MIT Press, 1992
Identify various problems which can be solved by Genetic Algorithms.
concepts, operators and technology for Genetic Algorithms to solve
Analyze difference in performance of Machine Learning approaches and Genetic
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS4013:
Credits: 04
Section 1: Topics/Contents
Introduction to digital and IP Telephony:
networks, SS7, ISDN, Exchanges, E.164 Numbering Plans. IP Telephony: Packet Switched Networks, Signaling & Media separation, Media Encapsulation RTP and RTCP, Audio and Video Codecs.VoIP Protocols: H.323 Network ElemeControl Unit. H.323 Protocol: RAS Channel, H.225 Call signaling, H.245 Media signaling.H.323 Call flows: Basic Audio and Video Call flows. SIP Network Elements: Registrar, Proxy, UAS, UAC, B2BUA. SIP ProtHeaders & Parameters, Message Structure, Transactions & Dialogs, Session Description Protocol. SIP Call Flows: Basic Audio and Video Call Flows. H.248 Protocol: Media Gateways, Media Gateway Controllers, Commands, TransTerminations, Descriptors, PackagesUnified Communications: Automatic Call Back, User Displays, Resource Optimization. Voice & Data Integration:IM, presence, voice mail. CollaborContent integration. Mobility: Mobile Clients, Session Border Controllers. Business Applications: Framework for custom applications, Computer Telephony Interface, Application Sequencing. Section2: Topics/Contents
Contact Center and Applications:
Centers to Context Centers, Services to Markets, ACD, VDN, Skills, Agents & States, Selection Algorithms, Service Observing, Call Recording, Assisted Service, SelfIntelligent Routing, Business use cases. Inbound/Outbound Contact Centers: Introduction, Services to Markets,Email & Chat), Text-to-Speech Analytics, Agent and Notification Campaigns, Pacing Algorithms, Business use cases. Reporting & Analytics: Blended Contact centers, Realtime and Historical reporting, Types of Reports, Business use cases. Analytics: Agent Performance, Occupancy, Campaign details, CollectionsEmerging technologies in Telecommun
Reliability, Failover & Failback, Location Redundancy, Hardware footprint, Cloud Computing: Applications in Telecommunications Analytics in Voice & Data, Diagnostics
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS4013: CONVERGENCE TECHNOLOGIES
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Introduction to digital and IP Telephony: Digital Telephony: Circuit Switched networks, SS7, ISDN, Exchanges, E.164 Numbering Plans. IP Telephony: Packet Switched Networks, Signaling & Media separation, Media Encapsulation RTP and RTCP, Audio and Video Codecs.
H.323 Network Elements: Terminals, Gateway, Gatekeeper, Multipoint Control Unit. H.323 Protocol: RAS Channel, H.225 Call signaling, H.245 Media
H.323 Call flows: Basic Audio and Video Call flows. SIP Network Elements: Registrar, Proxy, UAS, UAC, B2BUA. SIP Protocol: Requests & Responses, Methods, Headers & Parameters, Message Structure, Transactions & Dialogs, Session Description Protocol. SIP Call Flows: Basic Audio and Video Call Flows. H.248 Protocol: Media Gateways, Media Gateway Controllers, Commands, Transactions, Contexts, Terminations, Descriptors, Packages
Local and Network features: Call Forward, Call Coverage, Automatic Call Back, User Displays, Resource Optimization. Voice & Data Integration:IM, presence, voice mail. Collaboration: Call Conferencing, Voice, Video, Data &
Mobility: Mobile Clients, Session Border Controllers. Business Applications: Framework for custom applications, Computer Telephony Interface,
Contact Center and Applications: Contact Centers : Introduction & evolution of Call Centers to Context Centers, Services to Markets, ACD, VDN, Skills, Agents & States, Selection Algorithms, Service Observing, Call Recording, Assisted Service, Self
Business use cases. Inbound/Outbound Contact Centers: Introduction, Services to Markets, Inbound channels/ outbound channels (Voice, SMS,
Speech Analytics, Agent and Notification Campaigns, Pacing rithms, Business use cases. Reporting & Analytics: Blended Contact centers, Real
time and Historical reporting, Types of Reports, Business use cases. Analytics: Agent Performance, Occupancy, Campaign details, Collections Emerging technologies in Telecommunications: High Availability: Load balancing, Reliability, Failover & Failback, Location Redundancy, Hardware footprint, Cloud Computing: Applications in Telecommunications Analytics in Voice & Data, Diagnostics
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 126 of 141
FF No. :654
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Circuit Switched networks, SS7, ISDN, Exchanges, E.164 Numbering Plans. IP Telephony: Packet Switched Networks, Signaling & Media separation, Media Encapsulation RTP and
nts: Terminals, Gateway, Gatekeeper, Multipoint Control Unit. H.323 Protocol: RAS Channel, H.225 Call signaling, H.245 Media
H.323 Call flows: Basic Audio and Video Call flows. SIP Network Elements: ocol: Requests & Responses, Methods,
Headers & Parameters, Message Structure, Transactions & Dialogs, Session Description Protocol. SIP Call Flows: Basic Audio and Video Call Flows. H.248 Protocol: Media
actions, Contexts,
Local and Network features: Call Forward, Call Coverage, Automatic Call Back, User Displays, Resource Optimization. Voice & Data Integration:
ation: Call Conferencing, Voice, Video, Data & Mobility: Mobile Clients, Session Border Controllers. Business
Applications: Framework for custom applications, Computer Telephony Interface,
Introduction & evolution of Call Centers to Context Centers, Services to Markets, ACD, VDN, Skills, Agents & States, Selection Algorithms, Service Observing, Call Recording, Assisted Service, Self Service,
Business use cases. Inbound/Outbound Contact Centers: outbound channels (Voice, SMS,
Speech Analytics, Agent and Notification Campaigns, Pacing rithms, Business use cases. Reporting & Analytics: Blended Contact centers, Real-
time and Historical reporting, Types of Reports, Business use cases. Analytics: Agent
High Availability: Load balancing, Reliability, Failover & Failback, Location Redundancy, Hardware footprint, Cloud Computing: Applications in Telecommunications Analytics in Voice & Data, Diagnostics
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
& Management Emerging Technologies: List of Practical:
1. Study of audio and video data.2. Signal passing through network for voice data3. Simulation model for transfer of data from DS0, DS1, DS3 lines to E1/T1, E3/T3
lines or vice versa 4. Study of E/T cables 5. Simulation model based on SIP 6. Study of Gateways and Gatekeepers7. Simulation project for use of Audio and Video 8. Simulation of ATM network9. Study of ISDN devices.10. Study of SS7 implementation. 11. Comparison of ISDN and B
Text Books: 1. “ISDN and Broadband ISDN
Education, 2003, ISBN 81-7808
2. “Voice over IP Technologies” by Mark A. Miller, P.E., Wiley Publications, 2002, ISBN 81
265-0286-X, 1st Edition.
3. MPLS fundamentals by Luc De Ghein, CCIE No. 189,7
Reference Books: 1. “Computer Communications and Networking Technologies”, by Michael A. Gallo, William M.
Hancock, Cengage Learning, 2002, ISBN81
2. “ATM network concepts and protocols”, by Sumeet Kasera and Pankaj Sethi, Tata
McGraw Hill, 2001, ISBN 0
Course Outcomes:
The student will be able to – 1. Design a network to support voice and data services.2. Use of Standard Tools for converged3. Judge the impact and benefits of converged network in exploitation on environment and society. 4. Participate individually and collaboratively to examine the performance of converged- network. 5. Prepare cost effective solutions technology. 6. Analyze the requirements of the society and propose efficient solutions using convergence technology.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
& Management Emerging Technologies: Google Glass, webRTC, Cloud Hosting.
Study of audio and video data. Signal passing through network for voice data Simulation model for transfer of data from DS0, DS1, DS3 lines to E1/T1, E3/T3
tion model based on SIP Study of Gateways and Gatekeepers Simulation project for use of Audio and Video Simulation of ATM network Study of ISDN devices. Study of SS7 implementation. Comparison of ISDN and B-ISDN.
“ISDN and Broadband ISDN with frame relay and ATM” by William Stallings, Pearson
7808-422-8, 4th Edition.
“Voice over IP Technologies” by Mark A. Miller, P.E., Wiley Publications, 2002, ISBN 81
MPLS fundamentals by Luc De Ghein, CCIE No. 189,7 Cisco Press.
“Computer Communications and Networking Technologies”, by Michael A. Gallo, William M.
Hancock, Cengage Learning, 2002, ISBN81-315-0364-X, 1st Edition.
s and protocols”, by Sumeet Kasera and Pankaj Sethi, Tata
McGraw Hill, 2001, ISBN 0-07-463776-2, 1st Edition.
1. Design a network to support voice and data services. 2. Use of Standard Tools for converged network design. 3. Judge the impact and benefits of converged network in exploitation on environment
4. Participate individually and collaboratively to examine the performance of
5. Prepare cost effective solutions to fulfill the need of society by convergence
6. Analyze the requirements of the society and propose efficient solutions using
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 127 of 141
Glass, webRTC, Cloud Hosting.
Simulation model for transfer of data from DS0, DS1, DS3 lines to E1/T1, E3/T3
with frame relay and ATM” by William Stallings, Pearson
“Voice over IP Technologies” by Mark A. Miller, P.E., Wiley Publications, 2002, ISBN 81-
“Computer Communications and Networking Technologies”, by Michael A. Gallo, William M.
s and protocols”, by Sumeet Kasera and Pankaj Sethi, Tata
3. Judge the impact and benefits of converged network in exploitation on environment
4. Participate individually and collaboratively to examine the performance of
to fulfill the need of society by convergence
6. Analyze the requirements of the society and propose efficient solutions using
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
\ CS 4014: SOFTWARE TESTING AND QUALITY ASSURANCE
Credits: 04
Section 1: Topics/Contents
Software Measurement: Measurement TheoryMeasurement Scales, Classification of Software Measures, Measurement Framework, Theory of Program Testing, Graph Theory for Testers, Software Complexity, Measuring Internal Product Attributes: Size, MeasHalstead’s Software Science, Product Quality Metrics, InSoftware Reliability: Measurement and Prediction, The Rayleigh Model, SRE process, Reliability Concepts: Hardware and Software,Principles of Testing: Testing Concepts: Purpose of Software Testing, Testing Principles, Goals of Testing, Testing aspects: Requirements, Test Scenarios, Test cases, Test scripts/procedures, Strategies for Software Testing, Testing ActivitiFaults & Failures, Planning for Verification and Validation, Software Inspections, Automated Static Analysis, Verification and Formal Methods, Levels of TestingWhite-Box Testing: Test Adequacy Criteria, Static Testing, Structural Testing, CoComplexity Testing, Mutation Testing, Data Flow TestingBlack-Box Testing: Test Case Design Criteria, Requirement Based Testing, Positive and Negative Testing, Boundary Value Analysis, Equivalence Partitioning State Based Testing, Domain Testing Functional Testing: Test Plan, Test Management, Test Execution and Reporting, Test Specialist Skills, Tester’s Workbench and Tool Categories, Test Maturity Model and Test Process Assessment, Debugging & Root Cause Analysis, Software Items, Component & Units, Test Bed, Traceability and Testability, Attributes of Testable Requirements, Test Matrix, Types of Testing Documentation, Verification Testing, Validation Testing, Integration Testing, System and Acceptance Testing, GUI Testing,Regression Testing, Selection, Minimization and Prioritization of Test Cases for Regression Testing, Creating Test Cases from Requirements and Use cases, Software Defects: Origins of Defects, Defect Classes, Defect Repository / Test Design,
Section2: Topics/Contents
Higher Order Testing: Object Oriented Testing, Specification Based Testing, Performance Testing, Ad-hoc Testing, Usability and Accessibility Testing, RiskTesting, Exploratory Testing, ScenarioTesting, User Documentation Testing, ClientConfiguration Testing, Testing internal Controls, Multiplatform Environment Testing, Security Testing, Web-based System Testing, Reliability Testing, Efficiency Testing,
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS 4014: SOFTWARE TESTING AND QUALITY ASSURANCE
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Measurement Theory, Software Measurement and Models, Measurement Scales, Classification of Software Measures, Measurement Framework, Theory of Program Testing, Graph Theory for Testers, Software Complexity, Measuring Internal Product Attributes: Size, Measuring Internal Product Attributes : Structure, Halstead’s Software Science, Product Quality Metrics, In-Process Quality Metrics, Software Reliability: Measurement and Prediction, The Rayleigh Model, SRE process, Reliability Concepts: Hardware and Software, Deploying SRE
: Testing Concepts: Purpose of Software Testing, Testing Principles, Goals of Testing, Testing aspects: Requirements, Test Scenarios, Test cases, Test scripts/procedures, Strategies for Software Testing, Testing Activities, Mistakes, Faults & Failures, Planning for Verification and Validation, Software Inspections, Automated Static Analysis, Verification and Formal Methods, Levels of Testing
Box Testing: Test Adequacy Criteria, Static Testing, Structural Testing, CoComplexity Testing, Mutation Testing, Data Flow Testing
Box Testing: Test Case Design Criteria, Requirement Based Testing, Positive and Negative Testing, Boundary Value Analysis, Equivalence Partitioning State Based
: Test Plan, Test Management, Test Execution and Reporting, Test Specialist Skills, Tester’s Workbench and Tool Categories, Test Maturity Model and Test Process Assessment, Debugging & Root Cause Analysis, Software Items, Component &
t Bed, Traceability and Testability, Attributes of Testable Requirements, Test Matrix, Types of Testing Documentation, Verification Testing, Validation Testing, Integration Testing, System and Acceptance Testing, GUI Testing,Regression Testing,
Minimization and Prioritization of Test Cases for Regression Testing, Creating Test Cases from Requirements and Use cases, Software Defects: Origins of Defects, Defect Classes, Defect Repository / Test Design, Defect Repository
: Object Oriented Testing, Specification Based Testing, hoc Testing, Usability and Accessibility Testing, Risk
Testing, Exploratory Testing, Scenario-based Testing, Random Testing Compatibility r Documentation Testing, Client–Server System Testing, RAD Testing,
Configuration Testing, Testing internal Controls, Multiplatform Environment Testing, based System Testing, Reliability Testing, Efficiency Testing,
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 128 of 141
FF No. :654
CS 4014: SOFTWARE TESTING AND QUALITY ASSURANCE
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Measurement and Models, Measurement Scales, Classification of Software Measures, Measurement Framework, Theory of Program Testing, Graph Theory for Testers, Software Complexity, Measuring
uring Internal Product Attributes : Structure, Process Quality Metrics,
Software Reliability: Measurement and Prediction, The Rayleigh Model, SRE process,
: Testing Concepts: Purpose of Software Testing, Testing Principles, Goals of Testing, Testing aspects: Requirements, Test Scenarios, Test cases,
es, Mistakes, Faults & Failures, Planning for Verification and Validation, Software Inspections, Automated Static Analysis, Verification and Formal Methods, Levels of Testing
Box Testing: Test Adequacy Criteria, Static Testing, Structural Testing, Code
Box Testing: Test Case Design Criteria, Requirement Based Testing, Positive and Negative Testing, Boundary Value Analysis, Equivalence Partitioning State Based
: Test Plan, Test Management, Test Execution and Reporting, Test Specialist Skills, Tester’s Workbench and Tool Categories, Test Maturity Model and Test Process Assessment, Debugging & Root Cause Analysis, Software Items, Component &
t Bed, Traceability and Testability, Attributes of Testable Requirements, Test Matrix, Types of Testing Documentation, Verification Testing, Validation Testing, Integration Testing, System and Acceptance Testing, GUI Testing,Regression Testing,
Minimization and Prioritization of Test Cases for Regression Testing, Creating Test Cases from Requirements and Use cases, Software Defects: Origins of Defects,
: Object Oriented Testing, Specification Based Testing, hoc Testing, Usability and Accessibility Testing, Risk-based
based Testing, Random Testing Compatibility Server System Testing, RAD Testing,
Configuration Testing, Testing internal Controls, Multiplatform Environment Testing, based System Testing, Reliability Testing, Efficiency Testing,
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Maintainability Testing, Portability Testing, Introduction to Performance Testing, Application Performance Testing, Process of Performance Testing, Effective Rootanalysis, Testing VS Test Automation, Tool evaluation and selection, Automation team roles, Architectures, Planning and implementing test automation processIntroduction to Software Quality Assurance
of software quality, Software quality factors , Software Quality Lessons Learned, The components of the software components: Contract Review, Development and quality plans, SQA components in the project life cycle: Integrating quality activities in the project life cycle, Assuring the quality of software maintenaparticipants’ contributions, CASE tools, Software quPareto Principles, Total Quality Management, Ishikawa’s Seven Basic ToolsSoftware Quality Assurance Management
quality: Project progress control, Software quality metrics, Costs of software quality, Standards, certification and assessment: Quality management standards, SQA project process standards – IEEE software engineering standsoftware quality assurance, The SQA unit and other actors in the SQA system, Inspection as an Up-Front Quality Technique, Software Audit Methods, Software Safety and Its Relation to Software Quality Assurance, SQA for SmallAssurance, Quality Management in IT, Introduction to ITIL, Software Quality Assurance Metrics, Software Benchmarks and Baselines
List of Practicals: (For THL, TLP courses)
1. To Prepare Test Plan for the implemented system un
be based on System Requirement Specification. following issues.
a. Purpose of the test. /Location and schedule of the test. b. Test descriptions. /Pass and Fail Criteria.
2. To identify and narrate Test caseReport identifier for the system under test. Refer Use case analysis document to prepare mentioned/ identified test documents. behaviors can be stated with the help of Test Oracle.
3. To perform Unit testing especially indicating the traced Independent data paths, Control paths and Error handling paths. Prepare control flow graphs for the unit under test. Compute the Cyclomatic complexity of the unit.
4. To perform Data Flow testing for tDefinition-Use chain and type of data flow anomaly.
5. To perform Mutation Analysis of the Program Segments along with mutant history, mutation score and type of mutation by using any Code analysis Tool / Mutation Testing Tool (JUNIT, MuJava).
6. To perform Black-Box Testing for all the units contained in the architectural segments using Equivalence Partitioning, Boundary Value Analysis and Orthogonal Array testing methods. To study exploratory Testing for the Module under Test and merits/demerits of this technique.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
sting, Portability Testing, Introduction to Performance Testing, Application Performance Testing, Process of Performance Testing, Effective Root
Testing VS Test Automation, Tool evaluation and selection, Automation team , Planning and implementing test automation process
Introduction to Software Quality Assurance: The software quality challenge, Meaning of software quality, Software quality factors , Software Quality Lessons Learned, The components of the software quality assurance system, Pre-project software quality components: Contract Review, Development and quality plans, SQA components in the project life cycle: Integrating quality activities in the project life cycle, Assuring the quality of software maintenance components, Assuring the quality of external participants’ contributions, CASE tools, Software quality infrastructure components, Pareto Principles, Total Quality Management, Ishikawa’s Seven Basic ToolsSoftware Quality Assurance Management: Management components of software quality: Project progress control, Software quality metrics, Costs of software quality, Standards, certification and assessment: Quality management standards, SQA project
IEEE software engineering standards, Management and its role in software quality assurance, The SQA unit and other actors in the SQA system, Inspection
Front Quality Technique, Software Audit Methods, Software Safety and Its Relation to Software Quality Assurance, SQA for Small Projects, Development Quality Assurance, Quality Management in IT, Introduction to ITIL, Software Quality Assurance Metrics, Software Benchmarks and Baselines
List of Practicals: (For THL, TLP courses)
To Prepare Test Plan for the implemented system under test. The Test Plan shall be based on System Requirement Specification. The Test plan consists of
Purpose of the test. /Location and schedule of the test. Test descriptions. /Pass and Fail Criteria.
To identify and narrate Test cases, Test scripts/procedures and Test incident Report identifier for the system under test. Refer Use case analysis document to prepare mentioned/ identified test documents. The expected specifications/ behaviors can be stated with the help of Test Oracle.
o perform Unit testing especially indicating the traced Independent data paths, Control paths and Error handling paths. Prepare control flow graphs for the unit under test. Compute the Cyclomatic complexity of the unit. To perform Data Flow testing for the Program Segments by identifying the
Use chain and type of data flow anomaly. To perform Mutation Analysis of the Program Segments along with mutant history, mutation score and type of mutation by using any Code analysis Tool /
ng Tool (JUNIT, MuJava). Box Testing for all the units contained in the architectural
segments using Equivalence Partitioning, Boundary Value Analysis and Orthogonal Array testing methods. To study exploratory Testing for the Module
Test and merits/demerits of this technique.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 129 of 141
sting, Portability Testing, Introduction to Performance Testing, Application Performance Testing, Process of Performance Testing, Effective Root-Cause
Testing VS Test Automation, Tool evaluation and selection, Automation team
: The software quality challenge, Meaning of software quality, Software quality factors , Software Quality Lessons Learned, The
project software quality components: Contract Review, Development and quality plans, SQA components in the project life cycle: Integrating quality activities in the project life cycle, Assuring the
nce components, Assuring the quality of external ality infrastructure components,
Pareto Principles, Total Quality Management, Ishikawa’s Seven Basic Tools Management components of software
quality: Project progress control, Software quality metrics, Costs of software quality, Standards, certification and assessment: Quality management standards, SQA project
ards, Management and its role in software quality assurance, The SQA unit and other actors in the SQA system, Inspection
Front Quality Technique, Software Audit Methods, Software Safety and Its Projects, Development Quality
Assurance, Quality Management in IT, Introduction to ITIL, Software Quality Assurance
The Test Plan shall The Test plan consists of
s, Test scripts/procedures and Test incident Report identifier for the system under test. Refer Use case analysis document to
The expected specifications/
o perform Unit testing especially indicating the traced Independent data paths, Control paths and Error handling paths. Prepare control flow graphs for the unit
he Program Segments by identifying the
To perform Mutation Analysis of the Program Segments along with mutant history, mutation score and type of mutation by using any Code analysis Tool /
Box Testing for all the units contained in the architectural segments using Equivalence Partitioning, Boundary Value Analysis and Orthogonal Array testing methods. To study exploratory Testing for the Module
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
7. To perform Regression Testing / GUI Testing of the System under construction with Unit and Integration profiles by using any Functional Testing Tool.
8. To perform Automated Testing using suitable CASE tool addreOrder testing strategies.
9. To perform Web Based Testing for Web Application incorporating any Open Source Tool. To study Performance Testing, Load Testing, Security Testing, Stress Testing, Demonstrate on link Test expectation.
10. To perform Software Audit (Checklist and Templatedeveloped and improve the Code Quality.
Text Books: 1. Burnstein, “Practical Software Testing”, Springer International Edition, ISBN
81-8128-089-X
2. William E. Perry, “ Effective Methods for Software
Sons, ISBN 9971-51-345
3. Daniel Galin, Software Quality Assurance: From theory to implementation,
Pearson Education Limited, 2004, ISBN 0201 70945 7
Reference Books: 1. KshirasagarNaik, PriyadarshiTripathy, Software Testing and Qualit
Theory and Practice, John Wiley & Sons, Inc., 2008, ISBN 978
2. Fenton, Pfleeger, “Software Metrics: A Rigourous and practical Approach”,
Thomson Brooks/Cole, ISBN 981
3. Desikan, Ramesh, “Software Testing: principles and
Education, ISBN 81-7758
4. Anne MetteJonassen Hass, Guide to Advanced Software Testing, ARTECH
HOUSE, INC., 2008, ISBN
5. Ian Molyneaux,The Art of Application Performance Testing, O’Reilly Media, Inc.,
2009, ISBN: 978-0-596
6. Jamie L. Mitchell, Rex Black, Advanced Software Testing
Rocky Nook, 2015, ISBN: 978
7. G. Gordon Schulmeyer, Handbook of Software Quality Assurance Fourth Edition,
ARTECH HOUSE, INC., 2008, ISBN
Course Outcomes:
Upon completion of the course, graduates will be able to 1. Select and classify measurement scales and models, software metrics and
measures addressing software quality and reliability. 2. Conduct unit and integration tests by d
coverage criteria using testing frameworks and test adequacy assessment using control flow, data flow, and program mutations.
3. Apply suitable higher order testing techniques and methods in order to achieve verified and validated software by following testing best practices.
4. Demonstrate the skillset as a tester to neutralize the consequences of wicked problems by narrating effective test cases and test procedures.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
To perform Regression Testing / GUI Testing of the System under construction with Unit and Integration profiles by using any Functional Testing Tool. To perform Automated Testing using suitable CASE tool addressing HigherOrder testing strategies. To perform Web Based Testing for Web Application incorporating any Open Source Tool. To study Performance Testing, Load Testing, Security Testing, Stress Testing, Demonstrate on link Test expectation.
ware Audit (Checklist and Template-based) for the software developed and improve the Code Quality.
Burnstein, “Practical Software Testing”, Springer International Edition, ISBN
William E. Perry, “ Effective Methods for Software Testing”, John Wiley and
345-5
Daniel Galin, Software Quality Assurance: From theory to implementation,
Pearson Education Limited, 2004, ISBN 0201 70945 7
KshirasagarNaik, PriyadarshiTripathy, Software Testing and Qualit
Theory and Practice, John Wiley & Sons, Inc., 2008, ISBN 978-0-471
Fenton, Pfleeger, “Software Metrics: A Rigourous and practical Approach”,
Thomson Brooks/Cole, ISBN 981-240-385-X.
Desikan, Ramesh, “Software Testing: principles and Practices”, Pearson
7758-121-X.
Anne MetteJonassen Hass, Guide to Advanced Software Testing, ARTECH
HOUSE, INC., 2008, ISBN-13: 978-1-59693-285-2
Ian Molyneaux,The Art of Application Performance Testing, O’Reilly Media, Inc.,
596-52066-3
Jamie L. Mitchell, Rex Black, Advanced Software Testing—Vol. 3, 2nd Edition,
Rocky Nook, 2015, ISBN: 978-1-937538-64-4
G. Gordon Schulmeyer, Handbook of Software Quality Assurance Fourth Edition,
OUSE, INC., 2008, ISBN-13: 978-1-59693-186-2
Upon completion of the course, graduates will be able to – Select and classify measurement scales and models, software metrics and measures addressing software quality and reliability. Conduct unit and integration tests by determining test design, test automation, test coverage criteria using testing frameworks and test adequacy assessment using control flow, data flow, and program mutations. Apply suitable higher order testing techniques and methods in order to achieve
fied and validated software by following testing best practices. Demonstrate the skillset as a tester to neutralize the consequences of wicked problems by narrating effective test cases and test procedures.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 130 of 141
To perform Regression Testing / GUI Testing of the System under construction with Unit and Integration profiles by using any Functional Testing Tool.
ssing Higher-
To perform Web Based Testing for Web Application incorporating any Open Source Tool. To study Performance Testing, Load Testing, Security Testing,
based) for the software
Burnstein, “Practical Software Testing”, Springer International Edition, ISBN
Testing”, John Wiley and
Daniel Galin, Software Quality Assurance: From theory to implementation,
KshirasagarNaik, PriyadarshiTripathy, Software Testing and Quality Assurance-
471-78911-6
Fenton, Pfleeger, “Software Metrics: A Rigourous and practical Approach”,
Practices”, Pearson
Anne MetteJonassen Hass, Guide to Advanced Software Testing, ARTECH
Ian Molyneaux,The Art of Application Performance Testing, O’Reilly Media, Inc.,
Vol. 3, 2nd Edition,
G. Gordon Schulmeyer, Handbook of Software Quality Assurance Fourth Edition,
Select and classify measurement scales and models, software metrics and
etermining test design, test automation, test coverage criteria using testing frameworks and test adequacy assessment using
Apply suitable higher order testing techniques and methods in order to achieve
Demonstrate the skillset as a tester to neutralize the consequences of wicked
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
5. Adapt to various test processes, types of errortest generation from requirements for continuous quality improvement of the software system along with Software Quality best practices usage.
6. Apply software testing cycle in relation to software development and project management focusing incidents and risks management within a project towards efficient delivery of software solutions and implement improvements in the software development processes by making use of standards and baselines.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Adapt to various test processes, types of errors and fault models and methods of test generation from requirements for continuous quality improvement of the software system along with Software Quality best practices usage. Apply software testing cycle in relation to software development and project
nagement focusing incidents and risks management within a project towards efficient delivery of software solutions and implement improvements in the software development processes by making use of standards and baselines.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 131 of 141
s and fault models and methods of test generation from requirements for continuous quality improvement of the
Apply software testing cycle in relation to software development and project nagement focusing incidents and risks management within a project towards
efficient delivery of software solutions and implement improvements in the software development processes by making use of standards and baselines.
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS 4015: SOFTWARE ARCHIECTURE AND DESIGN
Credits: 04
Section 1: Topics/Contents
Introduction to Software Architecture
Motivation, Overview of the Framework, Architectures and Architecture Disciplines (What), Architecture Perspectives (Where), Architecture Requirements (Why), Architecture Means (With What), Organizations and IndividualMethod (How), Architectures and Architecture Disciplines (What): Classic Architecture as Starting Point, From Classic Architecture to Software Architecture, Architecture and the System Concept, Architecture and the Building Blocks of Perspectives (Where): Architecture Levels, Organizational Level, System Level, Building Block Level, Architecture Views, Architecture Requirements (Why): Requirements Characteristics and Types, Organizational Requirements, System RBlock Requirements, Qualities and Constraints, Requirements in the Context of Architecture, Architecture Means (With What): Architecture Principles, Basic Architecture Concepts, Architecture Tactics, Styles, and Patterns, OrganizaIndividuals (Who), Architecture Method (How) Software Architecture Styles
Organization for Explaining a Style, Choosing Which Element and Relation Properties to Document, Notations for ArchiDecomposition Style, Uses Style, Generalization Style, Layered Style, Aspects Style, Data Model Component-and-Connector Views: Overview, Elements, Relations, and Properties of C&C Views, C&C Views applicabilityNotations for C&C Views, Relation to Other Kinds of Views, ComponentStyles: Data Flow Styles, PipePeer-to-Peer Style, Service-Subscribe Style, Repository Styles, SharedStyles, Allocation Views and Allocation Styles: Deployment Style, Install Style, Work Assignment Style, Other Allocation Architectural Decisions: Refinement, Descriptive Completeness, Documenting Context Diagrams, Documenting Variation Points, Documenting Architectural Decisions, Combining Views, Documenting Software Interfaces: Interface Documentation, Showing the Existence of Interfaces in Diagrams, A Standard Organization for Interface Documentation, Coming to Terms: Error Handling, Stakeholders of Interface Documentation, Conveying Syntactic Information, Conveying Semantic Information, Coming to Terms: Signature,Documenting Behavior, Building the Architecture Documentation, Building the Documentation Package, Reviewing an Architecture Document
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
CS 4015: SOFTWARE ARCHIECTURE AND DESIGN
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / W
Introduction to Software Architecture: Architecture Orientation Framework: Motivation, Overview of the Framework, Architectures and Architecture Disciplines (What), Architecture Perspectives (Where), Architecture Requirements (Why), Architecture Means (With What), Organizations and Individuals (Who), Architecture Method (How), Architectures and Architecture Disciplines (What): Classic Architecture as Starting Point, From Classic Architecture to Software Architecture, Architecture and the System Concept, Architecture and the Building Blocks of a System, Architecture Perspectives (Where): Architecture Levels, Organizational Level, System Level, Building Block Level, Architecture Views, Architecture Requirements (Why): Requirements Characteristics and Types, Organizational Requirements, System Requirements, Building Block Requirements, Qualities and Constraints, Requirements in the Context of Architecture, Architecture Means (With What): Architecture Principles, Basic Architecture Concepts, Architecture Tactics, Styles, and Patterns, OrganizaIndividuals (Who), Architecture Method (How) Software Architecture Styles: Three Categories of Styles, Style Guides: A Standard Organization for Explaining a Style, Choosing Which Element and Relation Properties to Document, Notations for Architecture Views, Module Views, Module Styles: Decomposition Style, Uses Style, Generalization Style, Layered Style, Aspects Style,
Connector Views: Overview, Elements, Relations, and Properties of C&C Views, C&C Views applicability, Perspectives: Choosing Connector Abstractions, Notations for C&C Views, Relation to Other Kinds of Views, Component-andStyles: Data Flow Styles, Pipe-and-Filter Style, Call-Return Styles, Client-
-Oriented Architecture Style, Event-Based Styles, PublishSubscribe Style, Repository Styles, Shared-Data Style, Crosscutting Issues for C&C Styles, Allocation Views and Allocation Styles: Deployment Style, Install Style, Work Assignment Style, Other Allocation Styles
: Refinement, Descriptive Completeness, Documenting Context Diagrams, Documenting Variation Points, Documenting Architectural Decisions, Combining Views, Documenting Software Interfaces: Interface Documentation, Showing
Existence of Interfaces in Diagrams, A Standard Organization for Interface Documentation, Coming to Terms: Error Handling, Stakeholders of Interface Documentation, Conveying Syntactic Information, Conveying Semantic Information, Coming to Terms: Signature, Interface, API, Architectural Documentation Relevance: Documenting Behavior, Building the Architecture Documentation, Building the Documentation Package, Reviewing an Architecture Document
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 132 of 141
FF No. :654
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
: Architecture Orientation Framework: Motivation, Overview of the Framework, Architectures and Architecture Disciplines (What), Architecture Perspectives (Where), Architecture Requirements (Why),
s (Who), Architecture Method (How), Architectures and Architecture Disciplines (What): Classic Architecture as Starting Point, From Classic Architecture to Software Architecture, Architecture and
a System, Architecture Perspectives (Where): Architecture Levels, Organizational Level, System Level, Building Block Level, Architecture Views, Architecture Requirements (Why): Requirements
equirements, Building Block Requirements, Qualities and Constraints, Requirements in the Context of Architecture, Architecture Means (With What): Architecture Principles, Basic Architecture Concepts, Architecture Tactics, Styles, and Patterns, Organizations and
: Three Categories of Styles, Style Guides: A Standard Organization for Explaining a Style, Choosing Which Element and Relation Properties to
tecture Views, Module Views, Module Styles: Decomposition Style, Uses Style, Generalization Style, Layered Style, Aspects Style,
Connector Views: Overview, Elements, Relations, and Properties of , Perspectives: Choosing Connector Abstractions,
and-Connector -Server Style,
Based Styles, Publish-Data Style, Crosscutting Issues for C&C
Styles, Allocation Views and Allocation Styles: Deployment Style, Install Style, Work
: Refinement, Descriptive Completeness, Documenting Context Diagrams, Documenting Variation Points, Documenting Architectural Decisions, Combining Views, Documenting Software Interfaces: Interface Documentation, Showing
Existence of Interfaces in Diagrams, A Standard Organization for Interface Documentation, Coming to Terms: Error Handling, Stakeholders of Interface Documentation, Conveying Syntactic Information, Conveying Semantic Information,
Interface, API, Architectural Documentation Relevance: Documenting Behavior, Building the Architecture Documentation, Building the
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Section2: Topics/Contents
Collaborative Architecture
Scalability, Roles for the Scalable Technology Organization, Designing Organizations, Leadership 101, Management 101, Making the Business Case, Understanding Why Processes Are Critical to Scale, ManaginEscalations, Controlling Change in Production Environments, Exploring Architectural Principles, Joint Architecture Design, Architecture Review BoardArchitecting Scalable Solutions
Performance and Stress Testing, Barrier Conditions and Rollback, Designing for Any Technology, Creating Fault Isolative Architectural Structures, Introduction to the AKF Scale Cube, Splitting Applications for Scale, Splitting Databases foPerformance and Scale, Asynchronous Design for Scale, Large Scale Data, Clouds and Grids, Soaring in the Clouds, Plugging in the Grid, Monitoring Applications, Planning Data Centers, Introduction to Middleware Technologies, Reaching foDefining the Clouds for the Enterprise, Making the Business Case for Clouds, Working from Data, Services, Processes to the CloudsSoftware Architecture Practices
Enterprise Architecture FramewArchitecture Documents and Artifacts into the SOALeased Business Applications, Transforming Governance to Support SOA, SOA System Development Life Cycle, Capacity PlanniProcess, Implementing an Effective SOA Strategy under a Decentralized Business or IT Model, SOA Business Strategy and Roadmap
List of Practical’s: (For THL, TLP courses)
1. To narrate Requirement Definition Document
three areas: Problem Identification, Problem Definition, and Problem Statement2. To narrate System Requirements Specification Document for target system with
reference to the IEEE 610.12.1990 Std guidelines.3. To narrate System Architecture Requirement Specification Document for target
system with stakeholder and roles description.4. To select appropriate Architectural View and Style and prepare Architecture
Diagram for the target system.5. To prepare Architecture Decision docu
Software Interfaces, and behaviors along with Architectural Review.6. To implement the target system using the Technical Architecture conforming to
technology availability and scalability. 7. To create Test Plan, Test
of the system implemented.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Collaborative Architecture Determination: The Impact of People and Leadership on Scalability, Roles for the Scalable Technology Organization, Designing Organizations, Leadership 101, Management 101, Making the Business Case, Understanding Why Processes Are Critical to Scale, Managing Incidents and Problems, Managing Crisis and Escalations, Controlling Change in Production Environments, Exploring Architectural Principles, Joint Architecture Design, Architecture Review Board Architecting Scalable Solutions: Focus on Core Competencies: Build Versus Buy, Performance and Stress Testing, Barrier Conditions and Rollback, Designing for Any Technology, Creating Fault Isolative Architectural Structures, Introduction to the AKF Scale Cube, Splitting Applications for Scale, Splitting Databases for Scale, Caching for Performance and Scale, Asynchronous Design for Scale, Large Scale Data, Clouds and Grids, Soaring in the Clouds, Plugging in the Grid, Monitoring Applications, Planning Data Centers, Introduction to Middleware Technologies, Reaching for the Clouds, Defining the Clouds for the Enterprise, Making the Business Case for Clouds, Working from Data, Services, Processes to the Clouds Software Architecture Practices: SOA and Channels, Service-Oriented Architecture Enterprise Architecture Framework and Methodology, Incorporating Existing Enterprise Architecture Documents and Artifacts into the SOA∼EAF, Dealing with Purchased or Leased Business Applications, Transforming Governance to Support SOA, SOA System Development Life Cycle, Capacity Planning under SOA, People Involved in the SOA Process, Implementing an Effective SOA Strategy under a Decentralized Business or IT Model, SOA Business Strategy and Roadmap
: (For THL, TLP courses)
To narrate Requirement Definition Document for the target system with following three areas: Problem Identification, Problem Definition, and Problem StatementTo narrate System Requirements Specification Document for target system with reference to the IEEE 610.12.1990 Std guidelines.
ystem Architecture Requirement Specification Document for target system with stakeholder and roles description. To select appropriate Architectural View and Style and prepare Architecture Diagram for the target system. To prepare Architecture Decision document describing Architectural Decisions, Software Interfaces, and behaviors along with Architectural Review. To implement the target system using the Technical Architecture conforming to technology availability and scalability. To create Test Plan, Test Cases and apply them to test the performance adequacy of the system implemented.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 133 of 141
: The Impact of People and Leadership on Scalability, Roles for the Scalable Technology Organization, Designing Organizations, Leadership 101, Management 101, Making the Business Case, Understanding Why
g Incidents and Problems, Managing Crisis and Escalations, Controlling Change in Production Environments, Exploring Architectural
Build Versus Buy, Performance and Stress Testing, Barrier Conditions and Rollback, Designing for Any Technology, Creating Fault Isolative Architectural Structures, Introduction to the AKF
r Scale, Caching for Performance and Scale, Asynchronous Design for Scale, Large Scale Data, Clouds and Grids, Soaring in the Clouds, Plugging in the Grid, Monitoring Applications, Planning
r the Clouds, Defining the Clouds for the Enterprise, Making the Business Case for Clouds, Working
Oriented Architecture ork and Methodology, Incorporating Existing Enterprise
EAF, Dealing with Purchased or Leased Business Applications, Transforming Governance to Support SOA, SOA System
ng under SOA, People Involved in the SOA Process, Implementing an Effective SOA Strategy under a Decentralized Business or IT
for the target system with following three areas: Problem Identification, Problem Definition, and Problem Statement To narrate System Requirements Specification Document for target system with
ystem Architecture Requirement Specification Document for target
To select appropriate Architectural View and Style and prepare Architecture
Architectural Decisions,
To implement the target system using the Technical Architecture conforming to
Cases and apply them to test the performance adequacy
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Text Books: 1. Paul Clements, Felix Bachmann, Len Bass, David Garlan, Documenting
Software Architectures: Views and Beyond Addison
ISBN-10:0201703726, ISBN
2. Martin L. Abbott, Michael T. Fisher, The A
Architecture, Processes, and Organizations for the Modern Enterprise, Pearson
Education, Inc., 2010, ISBN
Reference Books: 1. Rick Sweeney, Achieving Service
Architecture Approach, John Wiley Publications, 2010, ISBN 978
2. David S. Linthicum, Cloud Computing and SOA Convergence in Your Enterprise,
2010 Pearson Education, Inc., ISBN
3. Arno Puder, Kay Römer, Frank Pilhofer, Distributed Systems Architecture, A
Middleware Approach, 2006 by Elsevier Inc., ISBN 13: 978
4. ParthaKuchana, Software Architecture Design Patterns in Java, 2004 by CRC
Press LLC, ISBN 0-8493
5. C.E. Dickerson, D.N. Mavris, Architecture And Principles Of Systems
Engineering, 2010 by Taylor and Francis Group, LLC, ISBN 978
Course Outcomes:
Upon completion of the course, graduates will be able to
1. Examine and breakdown realdepicting static and dynamic behavior of the system using Requirements Capture
2. Identify and formulate Architectural Assessment of architectural views.
3. Compose system design specifications indicating logical, physical, deployment, and concurrency viewpoints using and architectural reviews
4. Construct and justify the evolutionary system description models expressing highlevel technical architecture accommodating applicable architectural styles compatible to requirements using
5. Comprehend the nature of numerous examples from different applicability, reasonableness, and relation to other design criteria resulting inwell-documented system profiles to the engineering and social community.
6. Propose multi-faceted defendable solutions demonstrating teamaccommodating architectural views and stylesperformance impedance in order to realize system artiArchitecture Derivation and
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Paul Clements, Felix Bachmann, Len Bass, David Garlan, Documenting
Software Architectures: Views and Beyond Addison-Wesley Professional 2003,
ISBN-13: 9780201703726
Martin L. Abbott, Michael T. Fisher, The Art of Scalability, Scalable Web
Architecture, Processes, and Organizations for the Modern Enterprise, Pearson
Education, Inc., 2010, ISBN-13: 978-0-13-703042-2
Achieving Service-Oriented Architecture, Applying an Enterprise
Architecture Approach, John Wiley Publications, 2010, ISBN 978-0-470
David S. Linthicum, Cloud Computing and SOA Convergence in Your Enterprise,
2010 Pearson Education, Inc., ISBN-13: 978-0-13-600922-1
Arno Puder, Kay Römer, Frank Pilhofer, Distributed Systems Architecture, A
Middleware Approach, 2006 by Elsevier Inc., ISBN 13: 978-1-55860
ParthaKuchana, Software Architecture Design Patterns in Java, 2004 by CRC
8493-2142-5
C.E. Dickerson, D.N. Mavris, Architecture And Principles Of Systems
Engineering, 2010 by Taylor and Francis Group, LLC, ISBN 978-1-4200
Upon completion of the course, graduates will be able to –
Examine and breakdown real-world problem scenarios into structured partitions depicting static and dynamic behavior of the system using Software Architecture Requirements Capture practices. Identify and formulate software requirements and behavioral models using Architectural Assessment of behavioral views by selecting appropriate
. Compose system design specifications indicating logical, physical, deployment, and concurrency viewpoints using software interface explorations, error handling, and architectural reviews. Construct and justify the evolutionary system description models expressing high
architecture accommodating applicable architectural styles compatible to requirements using CASE tools. Comprehend the nature of architectural styles implementation by understanding
examples from different technology categories and publishapplicability, reasonableness, and relation to other design criteria resulting in
system profiles to the engineering and social community.faceted defendable solutions demonstrating teamarchitectural views and styles reducing the potential cost and
performance impedance in order to realize system artifacts with the help of Architecture Derivation and Development practices.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 134 of 141
Paul Clements, Felix Bachmann, Len Bass, David Garlan, Documenting
Wesley Professional 2003,
rt of Scalability, Scalable Web
Architecture, Processes, and Organizations for the Modern Enterprise, Pearson
Oriented Architecture, Applying an Enterprise
470-60451-9
David S. Linthicum, Cloud Computing and SOA Convergence in Your Enterprise,
Arno Puder, Kay Römer, Frank Pilhofer, Distributed Systems Architecture, A
55860-648-7
ParthaKuchana, Software Architecture Design Patterns in Java, 2004 by CRC
C.E. Dickerson, D.N. Mavris, Architecture And Principles Of Systems
4200-7253-2
world problem scenarios into structured partitions Software Architecture
and behavioral models using by selecting appropriate
Compose system design specifications indicating logical, physical, deployment, xplorations, error handling,
Construct and justify the evolutionary system description models expressing high-architecture accommodating applicable architectural styles
by understanding publish guidance,
applicability, reasonableness, and relation to other design criteria resulting in system profiles to the engineering and social community. faceted defendable solutions demonstrating team-skills
reducing the potential cost and with the help of
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
CS4022: SOFTWARE DESIGN METHODOLOGIES
Credits: 04
Section 1: Topics/Contents
Agile - High level overview:
Challenges of Waterfall project, Iron triangleDevelopment in Agile vs waterfallManifesto, Extreme programming, Agile Ceremonies, Daily standups, Retrospective, Important agile activities, Backlog Grooming, Spring PlaTDD(Test Driven development), BDD( Behavior Driven development), ATDD(Acceptance Test Driven development), Tools used for Agile Rallyroles: Scrum Master, Product Owner, Team Member, Agile Metrics: Do/Say, VelocityAngularJs Overview : Single Page application architecture, MVVM framework Binding in AngularJs, Services and dependency injection, Data Binding and Directives, Custom Directives Debugging in AngularJs. Nodejs Overview : Nodejs overview, AsynchronouTesting, Security. Junit : Junit Overview, Test Driven Development with JunitSpring Boot - Creating micro
(Java Persistence API) – Overview, Writing microGit / SVN: Committing, Browsing, Tagging and Branching, Merging.
Section2: Topics/Contents
AWS - Overview: AWS Overview: Different services available, Advantages of AWS,Multi-AZ, Region. IAM: Roles, Policy, EC2, Terminology, EC2 Setup. OTerminology, Lifecycle management.Search Technologies: Apache Solr: Text centric search engine, Inverted Index, How to setup first apache solr instance?, Tokenizer, Filters, How to integrate Apache Solr with your spring application?, ContexSolr. Elastic Search: Mapping in Elastic Search, Integrating Elastic Search with spring application, How is Elastic search different than Solr?DevOps – Jenkins: What is DevOps?, Tools in DevOps, Jenkisetup Jenkins Jobs?, How to create CI/CD pipeline?.Design pattern & clean code practices:
Factory, Proxy, Strategy, Template, Chain of responsibility.J2EE Design Patterns: DAO
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
SOFTWARE DESIGN METHODOLOGIES
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
High level overview: Concept of iterative development: Waterfall vs Agile, Challenges of Waterfall project, Iron triangle of project management upside down, Development in Agile vs waterfall Agile in nutshell: Principles behind the Agile Manifesto, Extreme programming, Agile Ceremonies, Daily standups, Retrospective, Important agile activities, Backlog Grooming, Spring Planning, Agile methodologies, TDD(Test Driven development), BDD( Behavior Driven development), ATDD(Acceptance Test Driven development), Tools used for Agile Rallyroles: Scrum Master, Product Owner, Team Member, Agile Metrics: Do/Say, Velocity
Single Page application architecture, MVVM framework Binding in AngularJs, Services and dependency injection, Data Binding and Directives,
Nodejs overview, Asynchronous Nodejs, Deploying nodejs app,
Junit Overview, Test Driven Development with Junit Creating micro-services: Spring REST, Spring Boot – overview, JPA
Overview, Writing micro-services with Spring Boot.Committing, Browsing, Tagging and Branching, Merging.
AWS Overview: Different services available, Advantages of AWS,AZ, Region. IAM: Roles, Policy, EC2, Terminology, EC2 Setup. Overview of S3:
Terminology, Lifecycle management. : Apache Solr: Text centric search engine, Inverted Index, How to
setup first apache solr instance?, Tokenizer, Filters, How to integrate Apache Solr with your spring application?, Contextual Search, Solr Cloud – Zookeeper ensemble, Tuning Solr. Elastic Search: Mapping in Elastic Search, Integrating Elastic Search with spring application, How is Elastic search different than Solr?
What is DevOps?, Tools in DevOps, Jenkins, DeployIT, How to setup Jenkins Jobs?, How to create CI/CD pipeline?. Design pattern & clean code practices: Core Design Patterns: Singleton, Abstract Factory, Proxy, Strategy, Template, Chain of responsibility.J2EE Design Patterns: DAO
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 135 of 141
FF No. :654
Teaching Scheme: Theory 3 Hours / Week
: Lab 2 Hours / Week
Concept of iterative development: Waterfall vs Agile, of project management upside down,
Agile in nutshell: Principles behind the Agile Manifesto, Extreme programming, Agile Ceremonies, Daily standups, Retrospective,
nning, Agile methodologies, TDD(Test Driven development), BDD( Behavior Driven development), ATDD(Acceptance Test Driven development), Tools used for Agile Rally Agile Team roles: Scrum Master, Product Owner, Team Member, Agile Metrics: Do/Say, Velocity.
Single Page application architecture, MVVM framework - Binding in AngularJs, Services and dependency injection, Data Binding and Directives,
s Nodejs, Deploying nodejs app,
overview, JPA pring Boot.
AWS Overview: Different services available, Advantages of AWS, verview of S3:
: Apache Solr: Text centric search engine, Inverted Index, How to setup first apache solr instance?, Tokenizer, Filters, How to integrate Apache Solr with
Zookeeper ensemble, Tuning Solr. Elastic Search: Mapping in Elastic Search, Integrating Elastic Search with spring
ns, DeployIT, How to
Core Design Patterns: Singleton, Abstract Factory, Proxy, Strategy, Template, Chain of responsibility.J2EE Design Patterns: DAO
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
design pattern, Front Controller, Inversion of Control, Intercepting Filter Pattern. Design Principles: SOLID- single responsibility, opensegregation and dependency inversion. Clean Code Practices: SRP(Single Responsibility Principle), DRY (Do not repeat yourself), KISS (Keep it short and simple).
List of Practicals: (For THL, TLP courses)
1. To narrate Requirement Definition Document for the target system with following
three areas:Problem Identification, Problem Definition, and 2. To narrate System Requirements Specification Document for target system with
reference to the IEEE 610.12.1990 Std guidelines.3. To create Business Process Diagrams for all the scenarios identified using BPMN
2.0 and BPM practices. Process activities within a process along with supporting information from end to end. In process modeling, the business process is framed in a BPD to reflect the activities, the roles that conduct those activities, conditthe workflow between the activities.
4. To decompose and organize the problem domain area into broad subject areas and identify the boundaries of problem/system. Specify the behavior of the target system and map requiremen
a. The System Context Diagram depicts the overall System behavioral trace and Requirement Capture diagram depicts the hierarchical Use case Organization. The Use Case diagram should encompass
b. Actors (External Users) c. Transactions (Use d. Event responses related to transactions with external agents.e. Detection of System boundaries indicating scope of system.
5. To depict the dynamic behavior of the target system using sequence diagram. The Sequence diagram should be based on the ScenariCommunication. The model should depict:
a. Discrete, distinguishable entities (class).b. Events (Individual stimulus from one object to another).c. Conditional events and relationship representation.
6. To depict the state transitionmodel. The model should depict:
a. Possible ways the object can respond to events from other objects.b. Determine of start, end, and transition states.
7. To depict the dynamic behavior using detailed Activity diparameterized behavior represented as coordinated flow of actions. The flow of execution is modeled as activity nodes connected by activity edges. - A node can be the execution of a subordinate behavior, such as an arithmetic
computation, a call to an operation, or manipulation of object contents.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Front Controller, Inversion of Control, Intercepting Filter Pattern. Design single responsibility, open-closed, Liskov substitution, interface
segregation and dependency inversion. Clean Code Practices: SRP(Single Responsibility e), DRY (Do not repeat yourself), KISS (Keep it short and simple).
List of Practicals: (For THL, TLP courses)
To narrate Requirement Definition Document for the target system with following three areas:Problem Identification, Problem Definition, and Problem StatementTo narrate System Requirements Specification Document for target system with reference to the IEEE 610.12.1990 Std guidelines. To create Business Process Diagrams for all the scenarios identified using BPMN 2.0 and BPM practices. Process modeling captures the ordered sequence of activities within a process along with supporting information from end to end. In
, the business process is framed in a BPD to reflect the activities, the roles that conduct those activities, conditional branching, and the sequence of the workflow between the activities. To decompose and organize the problem domain area into broad subject areas and identify the boundaries of problem/system. Specify the behavior of the target system and map requirements to Use cases.
The System Context Diagram depicts the overall System behavioral trace and Requirement Capture diagram depicts the hierarchical Use case Organization. The Use Case diagram should encompass Actors (External Users) Transactions (Use Cases) Event responses related to transactions with external agents. Detection of System boundaries indicating scope of system.
To depict the dynamic behavior of the target system using sequence diagram. The Sequence diagram should be based on the Scenarios generated by the interCommunication. The model should depict:
Discrete, distinguishable entities (class). Events (Individual stimulus from one object to another). Conditional events and relationship representation.
To depict the state transition with the life history of objects of a given class model. The model should depict:
Possible ways the object can respond to events from other objects.Determine of start, end, and transition states.
To depict the dynamic behavior using detailed Activity diagram. Activity is a parameterized behavior represented as coordinated flow of actions. The flow of execution is modeled as activity nodes connected by activity edges.
A node can be the execution of a subordinate behavior, such as an arithmetic n, a call to an operation, or manipulation of object contents.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 136 of 141
Front Controller, Inversion of Control, Intercepting Filter Pattern. Design closed, Liskov substitution, interface
segregation and dependency inversion. Clean Code Practices: SRP(Single Responsibility
To narrate Requirement Definition Document for the target system with following Problem Statement
To narrate System Requirements Specification Document for target system with
To create Business Process Diagrams for all the scenarios identified using BPMN modeling captures the ordered sequence of
activities within a process along with supporting information from end to end. In , the business process is framed in a BPD to reflect the activities,
ional branching, and the sequence of
To decompose and organize the problem domain area into broad subject areas and identify the boundaries of problem/system. Specify the behavior of the target
The System Context Diagram depicts the overall System behavioral trace and Requirement Capture diagram depicts the hierarchical Use case
To depict the dynamic behavior of the target system using sequence diagram. The
os generated by the inter-object
with the life history of objects of a given class
Possible ways the object can respond to events from other objects.
agram. Activity is a parameterized behavior represented as coordinated flow of actions. The flow of
A node can be the execution of a subordinate behavior, such as an arithmetic
n, a call to an operation, or manipulation of object contents.
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
- Activities may form invocation hierarchies invoking other activities, ultimately resolving to individual actions.
8. To develop logical static structure of target system with Software Class diagTo prepare Class Collaborationclasses traced from System analysis phase. The design model should depict
a. Relationship between classes: inheritance, Assertion, Aggregation, Instantiation
b. Identification of c. Roles / responsibilities entities that determine system behavior.
9. To enhance Software Class diagram to Architecture diagram with appropriate design patterns. The patterns selected shall be justifiable and applied to individual and distinct hierarchies. structural elements shall be well
10. To represent physical module that provides occurrence of classes or other logical elements identified during analysis and design odiagram. The model should depict allocation of classes to modules. To narrate precise Program Design Language constructs separating computation from interface. To represent deployment view of the system through Architecture Diagram.
Text Books: 1. Tom Pender, “UML Bible”, John Wiley & sons, ISBN
2. Jim Arlow, IlaNeustadt, “UML 2 and Unified Process: Practical Object Oriented Analysis
and Design.”, 2nd Edition, Addison
Reference Books: 1. Mellor, Scott, Uhl, Weise, “MDA Distilled”, Pearson Education, ISBN 81
2. Grady Booch, James Rambaugh, Ivar Jacobson, “Unified Modeling Language Users
Guide”, 2nd Edition, Addison
3. ErichGamma,RichardHelm
Oriented Software”(
Series),JohnVlissides,Publisher:Addison
ISBN-13: 978-0201633610
4. Steven Kelly, Juha-PekkaTolvanen, Domain
Generation, John Wiley & Sons, Inc., ISBN 978
5. Paul Clements, Felix Bachmann, Len Bass, David Garlan, Documenting Software
Architectures: Views and Beyond Addison
ISBN-13: 9780201703726
6. Charles S. Wasson, System Analysis, Design, and Development: Concepts, Principles, and
Practices, John Wiley & Sons, Inc.,ISBN
7. Essential Business Process Modeling,
Oreilly, ISBN 10: 0-596-00843
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Activities may form invocation hierarchies invoking other activities, ultimately resolving to individual actions.
To develop logical static structure of target system with Software Class diagTo prepare Class Collaboration-Responsibility (CRC) cards for the Conceptual classes traced from System analysis phase. The design model should depict
Relationship between classes: inheritance, Assertion, Aggregation,
Identification of objects and their purpose. Roles / responsibilities entities that determine system behavior.
To enhance Software Class diagram to Architecture diagram with appropriate design patterns. The patterns selected shall be justifiable and applied to individual
d distinct hierarchies. Suitable Architectural Styles shall be selected and the structural elements shall be well-documented. To represent physical module that provides occurrence of classes or other logical elements identified during analysis and design of system using Component diagram. The model should depict allocation of classes to modules. To narrate precise Program Design Language constructs separating computation from interface. To represent deployment view of the system through Architecture
Tom Pender, “UML Bible”, John Wiley & sons, ISBN – 0764526049
Jim Arlow, IlaNeustadt, “UML 2 and Unified Process: Practical Object Oriented Analysis
and Design.”, 2nd Edition, Addison- Wesley, ISBN – 0321321278.
Mellor, Scott, Uhl, Weise, “MDA Distilled”, Pearson Education, ISBN 81-297-
Grady Booch, James Rambaugh, Ivar Jacobson, “Unified Modeling Language Users
Guide”, 2nd Edition, Addison- Wesley, ISBN – 0321267974
m,RalphJohnson,“DesignPatterns:Elements of ReusableObject
ted Software”(Addison-WesleyProfessionalComputing
Series),JohnVlissides,Publisher:Addison-Wesley Professional, ISBN-10: 0201633612
PekkaTolvanen, Domain-Specific Modeling: Enabling Full Code
Generation, John Wiley & Sons, Inc., ISBN 978-0-470-03666-2, 2008
Paul Clements, Felix Bachmann, Len Bass, David Garlan, Documenting Software
Architectures: Views and Beyond Addison-Wesley Professional 2003, ISBN-10:0201703
Charles S. Wasson, System Analysis, Design, and Development: Concepts, Principles, and
Practices, John Wiley & Sons, Inc.,ISBN-13 978-0-471-39333-7, 2006
Essential Business Process Modeling, Michael Havey, First Edition August 2005
00843-0 | ISBN 13: 9780596008437
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 137 of 141
Activities may form invocation hierarchies invoking other activities,
To develop logical static structure of target system with Software Class diagram. Responsibility (CRC) cards for the Conceptual
classes traced from System analysis phase. The design model should depict Relationship between classes: inheritance, Assertion, Aggregation,
Roles / responsibilities entities that determine system behavior. To enhance Software Class diagram to Architecture diagram with appropriate design patterns. The patterns selected shall be justifiable and applied to individual
Suitable Architectural Styles shall be selected and the
To represent physical module that provides occurrence of classes or other logical f system using Component
diagram. The model should depict allocation of classes to modules. To narrate precise Program Design Language constructs separating computation from interface. To represent deployment view of the system through Architecture
Jim Arlow, IlaNeustadt, “UML 2 and Unified Process: Practical Object Oriented Analysis
-0529X
Grady Booch, James Rambaugh, Ivar Jacobson, “Unified Modeling Language Users
ents of ReusableObject-
WesleyProfessionalComputing
10: 0201633612
fic Modeling: Enabling Full Code
Paul Clements, Felix Bachmann, Len Bass, David Garlan, Documenting Software
10:0201703726,
Charles S. Wasson, System Analysis, Design, and Development: Concepts, Principles, and
August 2005
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Course Outcomes:
Upon completion of the course, graduates will be able to
1. Examine and breakdown realdepicting static and dynamic behavior of the system using business process management practices, objectDevelopment practices.
2. Identify and formulate software requirements and behavioraand dynamic behavioral views indicating structured problem partitioning and state-based exploration.
3. Compose system analysis and design specifications indicating logical, physical, deployment, and concurrency viewpoints using objedesign principles and Model Driven Engineering practices.
4. Construct and justify the evolutionary system description models expressing highlevel architecture accommodating applicable architectural styles compatible to requirements and behavioral models using UML
5. Comprehend the nature of design patterns by understanding a small number of examples from different pattern categories and apply these patterns in creating a correct design using design heuristicsreasonableness, and relation to other design criteria resulting inwellsystem profiles to the engineering and social community.
6. Propose multi-faceted defendable solutions demonstrating team
accommodating design patterns reducing the potential cost and performance
impedance in order to realize system artifacts with the help of Model Driven
Development practices.
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Upon completion of the course, graduates will be able to –
Examine and breakdown real-world problem scenarios into structured partitions depicting static and dynamic behavior of the system using business process management practices, object-oriented analysis principles and Model Driven Development practices. Identify and formulate software requirements and behavioral models using static and dynamic behavioral views indicating structured problem partitioning and
based exploration. Compose system analysis and design specifications indicating logical, physical, deployment, and concurrency viewpoints using object-oriented analysis and design principles and Model Driven Engineering practices. Construct and justify the evolutionary system description models expressing highlevel architecture accommodating applicable architectural styles compatible to
and behavioral models using UML-supported modeling tools. Comprehend the nature of design patterns by understanding a small number of examples from different pattern categories and apply these patterns in creating a correct design using design heuristics, published guidance, applicability, reasonableness, and relation to other design criteria resulting inwellsystem profiles to the engineering and social community.
faceted defendable solutions demonstrating team
accommodating design patterns reducing the potential cost and performance
impedance in order to realize system artifacts with the help of Model Driven
Development practices.
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 138 of 141
structured partitions depicting static and dynamic behavior of the system using business process
oriented analysis principles and Model Driven
l models using static and dynamic behavioral views indicating structured problem partitioning and
Compose system analysis and design specifications indicating logical, physical, oriented analysis and
Construct and justify the evolutionary system description models expressing high-level architecture accommodating applicable architectural styles compatible to
supported modeling tools. Comprehend the nature of design patterns by understanding a small number of examples from different pattern categories and apply these patterns in creating a
, published guidance, applicability, reasonableness, and relation to other design criteria resulting inwell-documented
faceted defendable solutions demonstrating team-skills
accommodating design patterns reducing the potential cost and performance
impedance in order to realize system artifacts with the help of Model Driven
Vishwakarma Institute of
Structure and syllabus of S.Y. B.Tech
Vishwakarma Institute of Technology Issue 01 : Rev No. 1 : Dt. 01/07/18
Structure and syllabus of S.Y. B.Tech Computer Engineering. Pattern B-18, A.Y. 2018-19
Issue 01 : Rev No. 1 : Dt. 01/07/18
19 Page 139 of 141
Vis
hw
ak
arm
a I
nst
itu
te o
f T
ech
nolo
gy
,Pu
ne
S
tru
ctu
re a
nd
syll
abu
s o
f S
.Y.
B.T
ech
Co
mp
ute
r E
ngin
eeri
ng. P
atte
rn B
-18,
A.Y
. 2
01
8-1
9
Pag
e 1
40
of
14
1
M
OD
UL
E V
II/
VII
I
Vis
hw
ak
arm
a I
nst
itu
te o
f T
ech
nolo
gy
,Pu
ne
S
tru
ctu
re a
nd
syll
abu
s o
f S
.Y.
B.T
ech
Co
mp
ute
r E
ngin
eeri
ng. P
atte
rn B
-18,
A.Y
. 2
01
8-1
9
Pag
e 1
41
of
14
1
Is
sue
1, R
ev. 1 , D
t. 0
1/0
7/2
018
Tit
le:
Cou
rse
Str
uct
ure
F
F N
o. 653
Bra
nch
: C
om
pute
r Y
ear:
B.T
ech.
A.Y
.: 2
018-1
9 M
od
ule
: V
II/V
III
P
att
ern
: B
-18.
1
.
Su
bje
ct
No.
Su
bje
ct
Cod
e S
ub
ject
Na
me
Tea
chin
g S
chem
e
(Hrs
/Wee
k)
Exam
inati
on
S
chem
e
C
red
its
Th
eory
L
AB
T
ut.
C
A
MS
E
(%)
ES
A
Tota
l
H
A
(%)
LA
B
(%)
ES
E
(%)
VIV
A
(%)
INT
. C
S4098
Sem
este
r In
tern
ship
. -
-
-
-
- -
- -
100
15
T
OT
AL
-
- -
15