SRM - BCA - Curricula - 2020-2021-25-02-2020
SRM - BCA - Curricula - 2020-2021-25-02-2020
ACADEMIC CURRICULA
(B.C.A)
Three Years
Academic Year
2020 - 2021
H
H
H
H
Knowledge
M
Application of
2.
H
H
H
Concepts
M
M
Link with Related
3.
H
H
H
H
Disciplines
M
Procedural
4.
H
H
H
H
H
Knowledge
Skills in
5.
H
H
H
H
Specialization
M Ability to Utilize
6.
L
L
H
H
Knowledge
M
Skills in Modeling
7.
M
M
M
M
Analyze, Interpret
8.
L
L
H
H
Data
M
6. Consistency of PEO’s with Program Learning Outcomes (PLO)
SkillsInvestigative
9.
H
H
M
M
M
Problem Solving
H
H
H
Skills
M
M
10.
Program Learning Outcomes (PLO)
SkillsCommunication
H
H
H
M
M
11.
Analytical Skills
L
H
H
M
M
12.
ICT Skills
H
H
H
M
M
13.
BehaviorProfessional
H
H
M
M
M
14.
M
M
M
15.
7. Programme Structure- B.C.A. (Bachelor of Computer Applications)
Semester – II
Hours/ Week
Code Course Title C
L T P
Semester – I 20CSA201J Object Oriented Programming 4 0 4 6
Hours/ Week 20CSA202J Data Structures and Algorithms 4 0 2 5
Code Course Title C
L T P 20UATG201J Tamil-II
20CSA101J Programming for Problem Solving 4 0 4 6 20UAHG201J Hindi-II 2 0 2 3
20CSA102J Digital Logic Fundamentals 4 0 2 5 20UAFG201J French-II
20UATG101J Tamil-I
20CSAG201T Mathematical Foundation 3 1 0 4
20UAHG101J Hindi-I 2 0 2 3
20UAFG101J French-I 20UCAS002T Go programming 1 0 1 2
20CSAG101T Discrete Mathematical Structures 3 1 0 4 20UJK201T Universal Human Values 2 0 0 2
20UCAS001T Introduction to IT 2 0 0 2
20LEA201T Communication Lab 0 2 0 0
20CDS101T Soft Skills 0 2 0 0
20LEA101T English 4 0 0 4 20CDS201T Quantitative Techniques 0 2 0 0
20UNS201 NSS
Total Learning Credits 19 3 8 24
20UNC201 NCC
Total number of hours /week 30 0 0 0 0
20UNO201 NSO
20UYG201 YOGA
Total Learning Credits 16 5 9 22
Total number of hours /week 30
\
Semester – III
Hours/ Week Semester - IV
Code Course Title L T P C
Hours/
20CSA301J Programming in Java 4 0 4 6 Code Course Title Week C
20CSA302J Operating Systems 4 0 4 6 L T P
20CSAG301T Statistical Methods 3 1 0 4 20CSA401J Database Management Systems 4 0 4 6
20UJK301T My India Project 0 0 0 2 20CSA402J Web Programming 4 0 4 6
20CAE301J Web development using Node and Mongo 20CSA403T Resource Management Techniques 4 0 0 4
20CAE302J Web development using React and Mongo 4 0 4 6 20CAE401J Multimedia and Animation
20CAE303J Web development using Angular and Mongo 20CAE402J Windows Programming using VB.NET 4 0 4 6
20UJK301T Communication Skills 2 0 0 2 20CAE403J Artificial Intelligence
Total Learning Credits 17 1 12 26 20UJK401T Leadership Skills 2 0 0 2
Total number of hours /week 30 Total Learning Credits 18 0 12 24
Total number of hours /week 30
Semester –V
Hours/ Week Semester - VI
Code Course Title L T P C
Hours/ Week
20CSA501J Computer Networks 4 0 4 6 Code Course Title L T P C
20CSA502J Python Programming 4 0 2 5 20CSA601J Object Oriented Analysis and Design 4 0 4 6
20CSA503J Software Engineering and Testing 4 0 2 5 20CAE601J Multimedia Design
20UCAS003T Lua 1 0 1 2 20CAE602J Data Analysis using R 4 0 4 6
20UCAS004T Statistical Package for Social Sciences 1 0 1 2 20CAE603J Internet of Things
20CYA501T Environmental Studies 4 0 0 4 20CAE604J Project Work 0 2 12 6
20UJK501T Professional Skills 2 0 0 2 Total Learning Credits 8 2 20 18
Total Learning Credits 20 0 10 26 Total number of hours /week 30
Total number of hours /week 30
Application of Concepts
Communication Skills
Professional Behavior
Analytical Skills
Course
ICT Skills
Course Name
Code
Course Learning Rationale (CLR): The purpose of learning this course is to, Learning Program Learning Outcomes (PLO)
Communication
PSO – 3
CLR-5 : Establish interaction between stored files and the application code
PSO - 1
PSO - 2
Ethics
CLR-6 : Solve mathematical, scientific and engineering problems with reduced complexity
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:
CLO-1 : Apply the features of programming language 2 85 80 L H H H H - - M M L - H - - -
CLO-2 : Choose operators, control structures to solve the problem optimally 3 85 80 L H H H H - - M M L - H - - -
CLO-3 : Analyse the problem thoroughly and choose the prebuilt functions/ customize functions to solve the problem 3 85 80 L H H H H - - M M L - H - - -
CLO-4 : Able to use dynamic memory allocation concepts for problems that demand 3 85 80 L H H H H - - M M L - H - - -
CLO-5 : Defend the need for files storage and the access previledge modes 3 85 80 L H H H H - - M M L - H - - -
CLO-6 : Talk on the data flow 3 85 80 L H H H H - - M M L - H - - -
Duration (hour) 24 24 24 24 24
Understanding contiguous memory
SLO-1 Evolution of Programming Languages Relational and logical Operators Formal and Actual Parameters File Types: text and binary
allocation
S-1
SLO-2 Problem solving through programming Character and Numbers: Manipulation Array : Advantages and Limitations Functions: Returning values File operations:basics
Expressions with pre / post increment
SLO-1 Writing algorithms/pseudo codes String Basics Advantages of using Functions File permissions and access privileges
operator
S-2
Expression with conditional and
SLO-2 Drawing flowcharts String Declaration and Initialization Passing Array to Function Changing permissions
assignment operators
Understanding String Functions: gets(),
SLO-1 Evolution of C language Ternary operator Call by Value Writing contents to file
puts(), getchar(), putchar(), printf()
S-3
Call by Reference (An introduction on
SLO-2 Program structure L value and Rvalue in expression String Functions: atoi, strlen, strcat, strcmp Reading file contents
pointers shall be effective)
String Functions: sprint, sscanf, strrev,
SLO-1 Need for file header files Operator precedence Nested functions Appending an existing file
S-4 strcpy, strstr, strtok
SLO-2 Need for linkers and loaders Type conversion Need for tokenization Functions: advantages and limitations Difference: Append and write
S SLO-1
Lab 1: Algorithm, Flow Chart, Pseudo code Lab 4: Operators and Expressions Lab 7: Arrays : Multi dimensional Lab 10: Functions Lab 13: File: reading and writing
5-8 SLO-2
Control Statements : sequential, branching,
SLO-1 Input and output statements: scanf,printf Need for user-defined data types Pointers and address operator fscanf(),fprintf()
looping and jump
S-9 If, if ..else, else if ladder fseek(),ftell()
SLO-2 Variables and identifiers stuctures sizeof Pointer Variable and Pointer Operator
SLO-1 Constants, Keywords while loop Structure and arrays Function and call by reference fputw(),fgetw()
S-11
Functions and Returning array(use of
SLO-2 literals do while Accessing members of the structure End_of_file in file handling
pointers)
goto, break, continue, exit: Jump Structures and pointers :dynamic creation of
SLO-1 Scope and lifetime of variables Structure and arrays feof(), remove()
statements data structures(list)
S-12
Understanding jump statements with
SLO-2 Storage clauses Nested structures Incrementing Pointers ferror()
branch and iterative statements
S SLO-1 Lab 14: File Handling fputw(),fgetw(),
Lab 2: Input and Output Statements Lab 5: Control Statements Lab 8: Strings, structures and union Lab 11: Pointers
13-16 SLO-2 remove();
S-17 SLO-1 Data types Array Basic Functions declaration and definition Constant Pointers Processor Directives
classification:Basic,derived,user-defined
SLO-2 Numeric Data types: int, float, long, double Array Declaration, Initialization Prebuilt and user defined functions Pointers and strings include
SLO-1 Non-Numeric Data types: char and string Types Function prototypes Function Pointers
S-18 Predefined macros and macros
Manipulating one dimensional arrays with
SLO-2 Arithmetic operators Defining and calling functions Array of Function Pointers
indices
conditional compilation
SLO-1 Increment and decrement operator Methods: sort, append, reverse, traverse Multiple functions Null Pointers
S-19
Manipulating two dimensional arrays with
SLO-2 Bitwise and sizeof operator Recursion , recursive Functions Using sizeof(),malloc,calloc() #pragma
indices
SLO-1 Using boolean Problems: matrix manipulations Scope of variables across functions File Handling
S-20 Manipulating more than two dimensions in Creating include and macros
SLO-2 Comma, Arrow and Assignmentoperator Sharing Global variables Open(),close()
arrays
S SLO-1
Lab 3: Data Types Lab 6: Arrays – One Dimensional Lab 9: Functions Lab 12: Pointers Lab 15:
21-24 SLO-2
Learning 1. Zed A Shaw, Learn C the Hard Way: Practical Exercises on the Computational Subjects You Keep Avoiding (Like C), Addison Wesley, 2015 3. Bharat Kinariwala, TepDobry, Programming in C, eBook
Resources 2. W. Kernighan, Dennis M. Ritchie, The C Programming Language, 2nd ed. Prentice Hall, 1996 4. http://www.c4learn.com/learn-c-programming-language/
Learning Assessment
Continuous Learning Assessment (50% weightage)
Bloom’s Final Examination (50% weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Level of Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15% 15%
Create
Total 100 % 100 % 100 % 100 % 100 %
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs,
Certifications, Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
Course Course Course L T P C
20CSA102J DIGITAL LOGIC FUNDAMENTALS C Professional Core
Code Name Category 4 0 2 5
ExpectedProficiency(%)
LevelofThinking(Bloom)
ExpectedAttainment(%)
Engineering Knowledge
Analysis, Design,Research
Problem Analysis
Communication
Environment &Sustainability
CLR-6 : Strengthen the knowledge on logic circuits to design digital systems.
PSO– 3
PSO- 1
PSO- 2
Ethics
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:
CLO-1 : Understand fundamental concepts of different number systems, codes, logic gates and waveforms. 3 80 70 L H - H L - - - L L - H - - -
CLO-2 : Acquire basic knowledge about Boolean algebra to express and simplify logic expressions. 3 85 75 M H L M L - - - M L - H - - -
CLO-3 : Understand the basic Flip Flops concepts and used to construct the digital circuits, 3 75 70 M H M H L - - - M L - H - - -
CLO-4 : Application of acquired understanding for the analysis of combinational and sequential circuits 3 85 80 M H M H L - - - M L - H - - -
CLO-5 : Design of combinational and sequential circuits 3 85 75 H H M H L - - - M L - H - - -
CLO-6 : Design and Implementing the Registers and counters circuits 3 80 70 L H M H L - - - L L - H - - -
Duration
(hour) 18 18 18 18 18
SLO-1 Introduction-Number Systems Introduction -Boolean Functions Introduction -Sequential and combinational circuits Introduction-Registers and counters Introduction-Registers and counters
S-1 Synchronous sequential circuit & Asynchronous sequential Uses and applications of registers and
SLO-2 Number representation Boolean Postulates Overview of Combinational circuit
circuit counters
Arithmetic operations on binary numbers:
SLO-1 Theorems of Boolean Algebra Flip-Flops: understanding of flip flops Shift registers: Block diagram
Addition, Subtraction
S-2
Arithmetic operations on binary numbers:
SLO-2 Axioms and proofs RS Latch Operations of Shift registers classification of combinational circuit
Multiplication, and Division
SLO-1 Introduction - Conversions Duality principles Types of flip flops Serial in serial out shift register Half Adder
S-3 Conversion from decimal into binary, octal, Boolean algebra, Block diagram, Circuit diagram
SLO-2 Proofs Advantages and disadvantages of flip flops Circuit diagram and operations
hexadecimal and truth table
Conversion from Binary into octal, hexadecimal , Sum of product, Product of sums
SLO-1 Understanding of SR Flip flop Serial in parallel out Full Adder
decimal
S-4
Canonical Expression - min terms and Functions , circuit diagram and truth table-SR FF Boolean algebra, Block diagram, Circuit diagram
SLO-2 Conversion from octal and hexadecimal into binary Circuit diagram and operations
max terms and truth table
SLO-1 Lab4: Study and verify the K-map, Lab:13Design adder, subtractor circuit using a 4-
S
SLO-2 LAB1:Introduction to Digital Laboratory, Equipments & Verify the 2 variable k-map andtruth Lab7: Design and construct basic flip-flops, verify truth Lab:10 Realization of shift registers,
bit adder IC,
5-6 SLO-3 Integrated circuits table SR, JK,D and T FF SISO, SIPO,PIPO,PISO Realization
table Design subtractor circuit using a 4-bit adder IC
SLO-4
SLO-1 Boolean Algebra and properties K-map Using 2variable Understanding of JK Flip flop Parallel in serial out Full adder truth table with carry
S-7 Reduced expression using 2 variable Boolean algebra, Block diagram, Circuit diagram
SLO-2 Boolean Theorems and Postulates Construction of JK flip flop using NOR gate Circuit diagram and operations
Kmap and truth table
SLO-1 Basic logic gates: AND,OR,NOT K-map Using 3 variable Construction of JK flip flop using NAND gate Parallel in parallel out Half Subtractors
S-8 Reduced expression using 3 variable Boolean algebra, Block diagram, Circuit diagram
SLO-2 Logic operations and truth table Functions , circuit diagram and truth table-JK FF Circuit diagram and operations
Kmap and truth table
SLO-1 Complements:1's complement representation K-map Using 4 variable Understanding of T Flip flop Registers with parallel load Full subtractors truth table with carry
S-9 Reduced expression using 4 variable Boolean algebra, Block diagram, Circuit diagram
SLO-2 1's complement subtraction Functions , circuit diagram and truth table-TFF Circuit diagram and operations
Kmap and truth table
SLO-1 2'scomplement representation K-map Using 5 variable Understanding of D Flip flop Serial transfer Encoder
S-10 Reduced expression using 5 variable
SLO-2 2's complement subtraction Functions , circuit diagram and truth table-DFF Clear and clock input and mode control Octal to binary Encoder(8-3)
Kmap
SLO-1
S
Lab5:Verify the truth table of SOP Lab:8 Truth table verification of SR, Master slave SR flip
11-12 SLO-2 Lab11: divide by 2 counter Lab14: Design and implement encoder
SLO-3 LAB 2:Study the AND gate and verify the truth table, expression flop
SLO-4 OR and NOT gates and verify their truth tables
SLO-1 9's complement representation POS Understanding of SR Master & Slave Flip Flop Counters: Basics of counters Decoder
S-13 Functions , circuit diagram and truth table-SR Master &
SLO-2 9's complement subtraction Grouping of variables in pos terms Divide by 2 counter Binary to Octal decoder(3-8)
Slave FF
SOP: Grouping of variables in sop
SLO-1 10's complement representation Understanding of JK Master & Slave FF Ripple counter Multiplexer
terms
S-14
Simplify the expression using K map Functions , circuit diagram and truth table-JK Master & Circuit diagram and functions of Ripple
SLO-2 10's complement subtraction 4-1 Multiplexer and application
for sop Slave FF counter
Universal logic gates: NAND gate characteristics
SLO-1 POS:Simplification Triggering: Level triggering of flip flop Synchronous counter Application of multiplexer
and truth table
S-15
Simplify the expression using K map
SLO-2 Positive and negative level triggering Asynchronous counter Circuit Diagram and truth table
NOR gate characteristics and truth table for pos
Procedure for Mc-Clausky Tabulation
SLO-1 NAND gate implementation Edge triggering of flip flop Design of Synchronous counter De-Multiplexer
Method
S-16
Simplification using Mc-Clausky Procedure to design Synchronous
SLO-2 NOR gate implementation Positive and negative edge trigerring 1-4 De-Multiplexer
Tabulation Method counter
SLO-1 Lab15: design and implement multiplexer
Lab12: Design and construct of Design and implement De-multiplexer
S Lab 6:Verify the 4-variable kmap and Lab9: Truth table verification of D flip flop, Synchronous Counter,
SLO-2
17-18 LAB 3:Verify the characteristics of NAND gate truth the reduced expression, Truth table verification of T flipflop Design and construct Asynchronous
SLO-3 table, Verify the 5-variable kmap and the counter
SLO-4 Verify the characteristics of NOR gate truth table reduced expression
Learning
1. Mano M.M. (1994), “Digital Logic and Computer Design”, Prentice Hall of India
Resources 2. Bartee T.C. (1991), ‘Computer Architecture and logical Design’, McGraw Hill
Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage) Final Examination (50% weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Level of Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15%
Create \15%
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Dr. B.Rebecca Jeyavadhanam, SRMIST
2. Mrs. S. Chandrakala, SRMIST
3.
Mrs.A.Rajalakshmi,SRMIST
Course Course Course L T P C
20CSA201J OBJECT ORIENTED PROGRAMMING C Professional Core
Code Name Category 4 0 2 5
Pre-requisite Co-requisite Progressive
Nil Nil
Courses Courses Courses
Course Offering Department Computer Science Data Book / Codes/Standards Nil
Course Learning Rationale (CLR): The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
CLR-1 : Utilize class and build domain model for real-time programs 1 2 3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Problem Analysis
Communication
CLR-4 : Utilize exceptional handling and collections for real-time object oriented programming applications
PSO – 3
PSO - 1
PSO - 2
Ethics
CLR-5 : Create programs using object oriented approach and design methodologies for real-time application development
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:
CLO-1 : Identify the class and build domain model 3 80 70 H H M - - - - - H H - - M H H
CLO-2 : Construct programs using method overloading and operator overloading 3 85 75 H H H H H - M - H H - - M H H
CLO-3 : Create programs using inline, friend and virtual functions, construct programs using standard templates 3 75 70 H H M H H - M - H H - - M H H
CLO-4 : Construct programs using exceptional handling and collections 3 85 80 H H H - - - - - H M - - M H H
CLO-5 : Construct programs using object oriented concepts 3 85 75 H M M M M M M - H H - M M H H
CLO-6 : Create applications based on real world scenarios 3 80 70 H H M - - - - - H H - - M H H
Duration (hour) 24 24 24 24 24
Comparison of Procedural and Object Constructor Types: Default and
SLO-1 Inheritance and its types Introduction to Files Templates : Introduction
Oriented Programming Parameterized –
S-1
SLO-2 List of OOPS languages and its features Example Programs Inheritance: Single Classes For File Stream Operations Types of templates
Features: Classes, Objects, Inheritance, Constructor Types: Copy and Static, Class Templates
SLO-1 Inheritance: Multiple Types of files
Polymorphism, Encapsulation Private-
S-2
SLO-2 Data Hiding, Message Passing, Reusability Example Programs Example program Opening and Closing a File Example for class templates
Function templates
SLO-1 I/O Operations, Data Types, Destructor Inheritance: Multilevel Example Program
S-3
Variables, Constants and Type Introduction to STL – Containers and
SLO-2 Static Data members Example program Detecting End Of File
Conversion Iterators
SLO -1 Operators Static member functions Inheritance: Multiple Example program Example program
S4 Read and write functions- character and
SLO -2 Special operators Example program Visibility of access specifier Simple example for STL
string
S SLO-1 Lab 4: Function Overloading and Operator
Lab 1: I/O operations and operators Lab 7: Inheritance Lab 10 : Simple file programs Lab13 :Templates
5-8 SLO-2 overloading
Exceptional Handling: Types of exceptional
SLO-1 Control Structures Overloading Concept in OOP Inheritance : Hierarchial File Open Modes
handling
S-9
SLO-2 Examples of Control Structures Overloading types Example program Example program Exceptional Handling :Try and Catch
Function Overloading: Different parameter
SLO-1 Functions and types Inheritance : Hybrid Example Program Example program
with same data type
S-10
Exceptional Handling : Standard
SLO-2 Function declaration and definition Example Program Example program File Pointer Manipulations
exceptions
Function Overloading: Different parameter
SLO-1 Passing arguments, returning values Constructors and destructors in inheritance Example Program Example program
with different argument types
1
Exceptional Handling: Multilevel
SLO-2 default arguments, Constant arguments Example Program Example Program Sequential Input and Output Operations
exceptional
Function Overloading: Different parameter
SLO-1 Call by value , Call by reference Constructors and types of inheritance Functions to handle file pointer throw and throws
S-12 with different return values
SLO-2 Return by reference, Inlline Functions Example Program Example program Example program Example program
SLO-1
S Lab 11 : Working with files
Lab 2: Control structures and Functions Lab 5 : Function Overloading Lab 8 : Multiple ,Multilevel Inheritance Lab 14 :Multilevel exceptional programs
13-16 SLO-2
SLO-1 Visibility of access specifier Operator Overloading: Unary Operators Example Program Random Access –Updating a File Programs for user defined exceptions
S-18
SLO-2 Example program Example program Abstract Classes Example program Example program
SLO-1 Constructor Operator Overloading: binary Operators Example Program Error Handling in File Operations Exception Handling class
S-19
SLO-2 Example program Example program Virtual Functions Example program Example program
Operator Overloading: Assignment
SLO-1 Destructor this pointer Command Line Arguments User defined exceptional class
Operator
S-20 Example Programs using CPP
SLO-2 Example program Example program Inlijne functions Example Program
S SLO-1 Lab 9 : Abstract classes and Virtual Lab 15:User defined Exceptions and
Lab 3: Classes and Objects Lab 6 : Operator Overloading Lab 12: Random Access - Updating
21-24 SLO-2 Functions simple CPP application.
1. E Balagurusamy, Object Oriented Programming in C++, 7th ed., Tata McGraw-Hill , 2017
Learning 2. ReemaThareja, Object Oriented Programming with C++, 1st ed., Oxford University Press, 2015 4. Robert Lafore, Object-Oriented Programming in C++, 4th ed., SAMS Publishing, 2008
Resources 3. R S Salaria, Mastering Object Oriented Systems Development Programming in C++”, 6th ed., Khanna 5. SouravSahay, Object Oriented Programming with C++, 2nd ed., Oxford University Press, 2017
Publishing,2016
Learning Assessment
Continuous Learning Assessment (50% weightage)
Bloom’s Final Examination (50% weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Level of Thinking
Theory Lab Theory Lab Theory Lab Theory Lab Theory Lab
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15% 15%
Create
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs,
Certifications, Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
Course Course Course L T P C
20CSA202J DATA STRUCTURES AND ALGORITHMS C Professional Core
Code Name Category 4 0 2 5
Course Learning Rationale (CLR): The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
CLR-1 : Utilize the different data types; Utilize searching and sorting algorithms 1 2 3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Communication
CLR-5 : Utilize algorithms to find shortest data search in graphs for real-time application development
PSO – 3
PSO - 1
PSO - 2
Ethics
CLR-6 : Utilize the different types of data structures and its operations for real-time programming applications
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:
CLO-1 : Identify linear and non-linear data structures. Create algorithms for searching and sorting 2 80 70 L H - H L - - - L L - H - - -
CLO-2 : Create the different types of linked lists and evaluate its operations 2 85 75 M H L M L - - - M L - H - - -
CLO-3 : Construct stack and queue data structures and evaluate its operations 2 75 70 M H M H L - - - M L - H - - -
CLO-4 : Create tree data structures and evaluate its types and operations 2 85 80 M H M H L - - - M L - H - - -
CLO-5 : Create graph data structure, evaluate its operations, implement algorithms to identify shortest path 2 85 75 H H M H L - - - M L - H - - -
CLO-6 : Construct the different data structures and evaluate their types and operations 2 80 70 L H - H L - - - L L - H - - -
Duration (hour) 18 18 18 18 18
SLO-1 Introduction to theory of data structures Introduction to stack Tree Traversals – Inorder, preorder Introduction to sorting Graph Terminology
S-1
SLO-2 Data representation Representation of stack through array Tree Traversals - Postorder Efficiency of algorithm Representation of graph - Arrays
Time complexity and space complexity
SLO-1 Abstract Data type Representation of stack through linked list Binary Search Tree Representation of graph – Linked list
S-2
SLO-2 Classification of data types Operations on stack Threaded Binary Search Tree Different types of sorting Graph Traversal – BFS
SLO-1 Program design and algorithm Disadvantages of Stack, Polish notations Binary Search Tree :Construction Bubble sort Example
S-3
SLO-2 Problem Solving using algorithm Applications – Evaluation of expression Binary Search Tree : Insertion Example Graph Traversal – DFS
SLO-1 Recursion Infix to Postfix expression Binary Search Tree : Searchimg Insertion Sort Example
S-4
SLO-2 Example Tower of Hanoi, Recursion Example Example Topological Sorting
S SLO-1 Lab 10 : Implementaion of Bubble and Lab 13: Implementation of Graph using
Lab 1: Recursion Lab 4 : stack and its applications Lab 7 : Tree Traversals
5-6 SLO-2 Insertion sott Array
SLO-1 Asymptotic Notation Queue Applications of trees Selection sort Shortest Path Algorithm- Introduction
S-7
Representation of Queue using Arrays and
SLO-2 Algorithm Analysis Applicaitions of BST Example Shortest Path Algorithm: Dijkstra
Linked list
Minimum spanning tree – Prims
SLO-1 Introduction to Data structures Operations on Queue Expression trees Comparision of sorts
S-8
SLO-2 Data Structures and its uses Circular Queue Example Quick sort Example
SLO-1 Linear and Non Linear Data Structures Double ended Queue AVL Tree Example Minimum Spanning Tree - Kruskals
S-9
SLO-2 Operations on data structure Priority Queue AVL Tree Rotations Merge sort Example
SLO-1 Arrays and Pointers Reversing a Queue using another queue Example Example Network flow problem
S-10 Radix sort
SLO-2 Structure and Pointers Applications of Queue Applications of AVL tree Applications of Graph
S SLO-1 Lab 5: Queue implementation using array Lab 11 : Implementation of Qucik sort and Lab 14 : Implementation of shortest path
Lab 2: Arrays, structure using pointers Lab 8: Implementation of BST
11-12 SLO-2 and pointers merge sort algorithm
SLO-1 Array types Introduction to non linear data structures Heap Data Structure Shell sort Define Hashing
S-13
SLO-2 Array operations Tree ADT and Terminologies Minimum Heap Construction Example Hashing: Hash functions
SLO-1 Dynamic memory allocation Tree Terminologies Minimum Heap Deletion Construction Heap Sort Hashing : Collision avoidance
S-14 Introduction to lists
SLO-2 Tree Representation Example Example Hashing : Separate chaining
SLO-1 Linked list operations Tree Types and Operations Maximum Heap Construction Linear search Example
S-15
SLO-2 Types of Linked Lists Binary Tree Representation Maximum Heap Deletion Construction Binary search Open addressing
SLO-1 Linked list vs. Arrays Properties of binary tree Example Comparison of different search Example
S-16
SLO-2 Application of linked list Applications of Heaps and AVL trees Example Advantages ofHashing
S SLO-1 Lab 6: Implementation of binary tree using Lab 15 : Implementation of minimum
Lab 3 : Linked List Lab 9 :Heap Implementation Lab 12: Linear search and Binary search
17-18 SLO-2 Arrays spanning tree
1. Seymour Lipschutz, Data Structures with C, McGraw Hill Education, Special Indian ed.,, 2014 5. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2nd ed.,,
Learning 2. ISRD Group,Data structures using C ,second edition, McGraw Hil>,2013 Pearson Education.
Resources 3. R.F.Gilberg, B.A.Forouzan, Data Structures, Second Edition, Thomson India ed.,, 2005. 6. ReemaThareja, Data Structures Using C, Oxford Higher Education, First
4. A.V.Aho, J.E Hopcroft , J.D.Ullman, Data structures and Algorithms, Pearson Education, First ed., Reprint 2003. ed.,, 2011
Learning Assessment
Continuous Learning Assessment (100% weightage)
Bloom’s Final Examination
CLA – 1 (20%) CLA – 2 (30%) CLA – 3 (30%) CLA – 4 (20%)#
Level of Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15% 15%
Create
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs,
Certifications, Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
Course Course Course L T P C
20CSA301J PROGRAMMING IN JAVA C Professional Core
Code Name Category 4 0 4 6
ExpectedProficiency(%)
LevelofThinking(Bloom)
ExpectedAttainment(%)
To learn how to produce robust programs in Java using Exception Handling
Engineering Knowledge
Analysis, Design,Research
Problem Analysis
Communication
Environment &Sustainability
CLR-6 : To design and program stand-alone Java applications.
PSO– 3
PSO- 1
PSO- 2
Ethics
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:
CLO-1 : Use an integrated development environment to write, compile, run, and test simple object-oriented Java programs. 3 80 70 L H - H L - - - L L - H - - -
CLO-2 : Read and make elementary modifications to Java programs that solve real-world problems. 3 85 75 M H L M L - - - M L - H - - -
CLO-3 : Validate input in a Java program 3 75 70 M H M H L - - - M L - H - - -
CLO-4 : Identify and fix defects and common security issues in code. 3 85 80 M H M H L - - - M L - H - - -
CLO-5 : To design reading and writing files in Java. 3 85 75 H H M H L - - - M L - H - - -
CLO-6 : To develop various applications like banking, Inventory, etc 3 80 70 L H M H L - - - L L - H - - -
Duration (hour) 24 24 24 24 24
SLO-1 The Genesis of Java Introducing classes Inheritance Basics Java thread model, Creating a Thread Event Handling- Introduction
S-1 Types of Inheritance: Single Inheritance,
SLO-2 How java changed the internet Class fundamentals Extending Thread Event Classes:ActionEvent,ItemEvent
Multilevel Inheritance
Types of Inheritance: Hierarchical
SLO-1 Java’s magic: Byte Code Declaring Objects Creating multiple threads Event Classes:KeyEvent,MouseEvent
Inheritance
S-2 Java Buzzwords: Simple, Object
Event Classes:
SLO-2 Oriented,Robust,Multithreaded, Assigning object Reference variables using Super Thread priorities
TextEvent,WindowEvent,ComponentEvent
Architecture-Neutral
Java Buzzword: Interpreted and high
SLO-1 Introducing method Method Overriding synchronization Event Listener Interfaces
performance, Distributed, Dynamic
S-3
Dynamic method dispatch Event Listener Interfaces: ActionListener,
SLO-2 Evolution of Java Constructors: Characteristics Inter-thread communication
AdjustmentListener
Event Listener Interfaces:
Object oriented Concepts: Encapsulation,
SLO-1 Types of Constructors Abstract class Runnable Interface ContainerListener, ItemListener,
Polymorphism
S-4 ComponentListener
Abstract Method Event Listener Interfaces: KeyListener,
SLO-2 Object oriented Concepts: Inheritance The this Keyword Using isAlive() and join()
MouseListener
SLO-1
S SLO-2 Lab1: Simple Formula Conversion Lab 7: Inheritance, Method Overriding,
5-8 Lab 4: Classes and Objects Lab 10: Multithreading Lab 13: Event Handling
SLO-3 Programs Abstract classes and methods
SLO-4
Lexical Issues:Whitespaces,Identifiers,
SLO-1 Garbage Collection Using final with Inheritance Legacy Classes- Introduction AWT Controls- Introduction
Literals
S-9
Lexical Issues:
SLO-2 Finalize() method Packages: Introduction Vector class Labels
Comments,Separators,Keywords
SLO-1 Data types:byte,short,int,long Overloading methods Access Protection Examples using Vector class Handling Buttons
S-10 Data types:
SLO-2 Overloading constructors Importing packages Stack Handling CheckBoxes
float,double,characters,booleans
Variables: Declaring a variable, dynamic Using objects as parameters Examples using Stack class
SLO-1 Interfaces, Defining an Interface CheckBoxGroup
initialization
S-11
Argument Passing
SLO-2 Variables: Scope and lifetime of variables Implementing Interfaces Legacy Interfaces- Introduction Choice controls
Operators: Arithmetic, Relational, Logical
SLO-1 Returning Objects Applying Interfaces The Enumeration Interface Using Lists
Operators
S-12
Operators: Bitwise, Conditional, Recursion Interfaces can be extended
SLO-2 Examples using Enumeration interface Using a TextField
Assignment operators
SLO-1
S
Lab 4: Overloading Methods and
13-16 SLO-2 Lab2: Operators Lab 8: Packages and Interfaces Lab 11: Legacy Classes and Interfaces Lab 14: AWT Controls
SLO-3
Constructors, finalize() method
SLO-4
SLO-1 Arrays: Definition, Initialization Introducing Access Control Exception handling fundamentals Utility classes Layout Managers- Introduction
S-17 Types of Arrays: one dimensional array
SLO-2 Static variables and methods Exception Types StringTokenizer, Flow Layout
and Multidimensional array
Control Statements: Selection Statements-
SLO-1 Final variables and methods Using try and catch Date Border Layout
if,if else,if else if,Nested if,Switch
S-18
SLO-2 Nested Class Multiple catch clauses Calendar Grid Layout
Examples using Selection Statements
Iterative Statements:while, do-while,for,for
SLO-1 Inner Class Throw and throws GregorianCalendar I/O Streams-Introduction
each statements
S-19
SLO-2 String Class: Introduction finally Random Class Byte Streams
Examples using Iterative Statements
Jump Statements-break, continue and
SLO-1 String Handling Methods Built-in Exceptions Scanner Class Character Streams
return statements
S-20
Creating own Exception subclasses Examples using Byte and Character
SLO-2 Examples using Jump Statements Command Line arguments Examples using Scanner Class
Streams
SLO-1
S SLO-2 Lab 6: Programs Using String Class, Lab 15: Layout Managers, Byte and
21-24
Lab 3: Control Statements Lab 9: Exception Handling Lab 12: Utility Classes
SLO-3 Command Line Arguments Character Streams
SLO-4
1. Herbert Schildt (2007), “Java: The Complete Reference”, Seventh Edition, Tata McGraw publication.
Learning
Resources
Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage) Final Examination (50% weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Level of Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15%
Create \15%
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Mrs.D.S.Dayana, SRMIST
2. Mr.J.Venkata Subramaniyan, SRMIST
3. Mrs.A.Jenita Mary,
SRMIST
4. Mrs.K.Kanmani, SRMIST
Course L T P C
Course Code 20CSA302J Course Name DATABASE MANAGEMENT SYSTEMS Category C Professional Core
4 0 4 6
Communication
CLR-2 : Conceive the database design process through ER Model and Relational Model
Environment &
Sustainability
CLR-3 : Design Logical Database Schema and mapping it to implementation level schema through Database
PSO – 3
PSO - 1
PSO - 2
Ethics
CLR-4 : Familiarize queries using Structure Query Language (SQL) and PL/SQL
CLR-5 : Familiarize the Improvement of the database design using normalization criteria and optimize queries
CLR-6 : Understand the practical problems of concurrency control and gain knowledge about failures and recovery
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:
CLO-1 : Acquire the knowledge on DBMS Architecture and Languages 3 80 70 H M L L - - - - L L L H - - -
CLO-2 : Apply the fundamentals of data models to model an application’s data requirements using conceptual modeling 3 85 75 H H H H H - - - H H H H - - -
tools like ER diagrams
CLO-3 : Apply the method to convert the ER model to a database schemas based on the conceptual relational model 3 75 70 H H H H H - - - H H H H - - -
CLO-4 : Apply the knowledge to create, store and retrieve data using Structure Query Language (SQL) and PL/SQL 3 85 80 H H H H H - - - H H H H - - -
CLO-5 : Apply the knowledge to improve database design using various normalization criteria and optimize queries 3 85 75 H H L M L - - - M M M L - - -
CLO-6 : Appreciate the fundamental concepts of transaction processing- concurrency control techniques and recovery 3 85 75 H L L L L - - - H L L L
procedures.
Duration (hour) 24 24 24 24 24
What is Database Management
SLO-1 Basics of SQL-DDL,DML,DCL,TCL
System Decomposition using FD- dependency Serializability, Recoverability,
S-1
Advantage of DBMS over File preservation, Transaction support in SQL
SLO-2 Design process Structure Creation, alternation
Processing System
Introduction and applications of Defining Constraints-Primary Key,
SLO-1 Concurrent Executions
S-2 DBMS Entity Relation Model Foreign Key, Unique, not null, Codd Rules
SLO-2 Purpose of database system check, IN operator Concurrency control
Normalization – 1Nf, 2NF,
SLO-1 ER diagram Functions-aggregation functions
3NF, Concurrency Control : Lock based
S-3 Views of data Built-in Functions-numeric, date, Protocols
SLO-2 Case study for ER Diagram string functions, string functions, Set BCNF, 4NF and 5NF Two Phase Ccontrol Commit Protocol
operations,
SLO-1 Design Issues in ER Model Pl/SQL Introduction
SQL : Data Definition PL/SQL : Query Precessing and Stored
S-4 SQL : Joins PL/SQL : variable declaration
SLO-2 Commands SQL : Aggregate Functions Procedure
and icontrol structures
SLO-1 Lab 7 : Join Queries on sample
Lab 1: SQL Data Definition exercise.
Lab4 Lab 10: PL/SQL Conditional and Lab 13: PL/SQL Query Processing ,
Language Commands on * Frame and execute the
S 5-8 Inbuilt functions in SQL on sample Iterative Statements stored procedure
SLO-2 sample exercise Exercise.
appropriate
DDL,DML,DCL,TCL for the
project
Domain Constraints, Referential Concurrency Control : Time Stamp
SLO-1
S-9 Database system Architecture Keys , Attributes and Constraints Sub Queries, Integrity based
SLO-2 Secondary Storage Devices Validation based
SLO-1 Overview of SQL Buffering of blocks MultiGranularity, Deadlocking,
S-10 Mapping Cardinality Correlated sub queries
SLO-2 File organization Deadlock Prevention protocol
SLO-1 SQL : Data Manipulation Extended ER - Aggregation Recovery Concepts, Deferred update
Indexing Methods – Primary ,
S-11 Nested Queries, Views and its Types technique, Immediate update technique,
SLO-2 Commands Generalizaion and Specialization Secondary , Multilevel Indices
Shadow paging,
SLO-1 SQL : Views in SQL Transaction Control Commands PL/SQL : Exceptional Handling
S-12 SQL : Set Operations ISAM, B-trees Introduction
SLO-2 SQL Queries in SQL Commit, Rollback, Save point PL/SQL: Trigger
SLO-1 Lab 2: SQL Data Manipulation Lab 14: PL/SQL Trigger, Exceptional
Lab 11: PL/SQL Functions
Handling
S 13- Language Commands * Lab 8: Sub Queries * Frame and execute the
Lab 5: Simple Queries in SQL * Frame and execute the appropriate
16 SLO-2 Identification of project Modules appropriate Set Operators & Views
PL/SQL Cursors and Exceptional
and functionality for the project
Handling for the project
SLO-1 Relational Algebra – Fundamental Database security and Authorization
S-17 Transaction Management
Data Independence ER Diagram Issues Operators and syntax, relational Need forf Database security
SLO-2 Transaction Concept
algebra queries
S-19 SLO-1 Comparision of Data Models Conversion of ER to Relational Table Functional Dependency – definition, ACID Properties
SLO-2 Database Users and DBA
Statistical database security
SQL : Data Control
SLO-1 PL/SQL Cursor
Commads
S-20 SQL : Nested Queries trivial and non-trivial FD
SQL:Transaction Control PL/SQL : Functions and statements to
SLO-2 PL/SQL : Application Programs
Commands handle Cursor,
SLO-1 Lab 3: SQL Data Control
Language Commands and
SLO-2 Transaction control Lab 12: PL/SQL Cursors
Lab 6: Nested Queries on sample Lab 15 Student Progress report
* Frame and execute the
commands to the sample exercise Lab9: Correlated Subqueries Generation
S 21-24 appropriate PL/SQL
exercises * Construction of Relational Table from Employee payslip generation
Conditional and Iterative
* Identify the issues that can the ER Diagram
Statements for the project
arise in a business perspective
for the application
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, Database System Concepts‖, Sixth 4. Martin Gruber, Understanding SQL, Sybex,1990
Edition, Tata McGraw Hill,2011. 5. SharadMaheshwari,Introduction to SQLandPL/SQL,2ded.,LaxmiPublications,2016.
2. RamezElmasri, Shamkant B. Navathe, Fundamentals of Database Systems‖, Sixth 6. RaghuramaKrishnan,JohannesGehrke,Database Management
Edition, Pearson Education,2011. Systems,3rdEdition,McGrawHill Education,2003.
Learning
3. CJ Date,AKannan,SSwamynathan, An Introduction to Database Systems, Eight Edition,
Resources
Pearson Education,2006.
4. Rajesh Narang, Database Management Systems, 2nded., PHI Learning Private Limited,2011.
Learning Assessment
Bloom’s Continuous Learning Assessment Final Examination (50%
Level of (50%weightage) weightage)
Thinking CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15% 15%
Create
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study,
Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
Course Course Course L T P C
20CSA401J ADVANCED JAVA PROGRAMMING Professional Core
Code Name Category 4 0 4 6
ExpectedProficiency(%)
LevelofThinking(Bloom)
ExpectedAttainment(%)
Analysis, Design,Research
Problem Analysis
Communication
CLR-4 : Enterprise application using JavaBeans l
Environment &Sustainability
CLR-5 : Develop web application using Java Servlet and Server Pages technology
PSO– 3
PSO- 1
PSO- 2
Ethics
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:
L H - H L - - - L L - H - - -
CLO-1 : Advanced technology in Java such as Internationalization, and Remote method Invocation 3 80 70 M H L M L - - - M L - H - - -
CLO-2 : To write sophisticated Java applications 3 85 75 M H M H L - - - M L - H - - -
CLO-3 : To use Java language for writing well-organized, complex computer programs with both command-line and GUI 3 75 70 M H M H L - - - M L - H - - -
CLO-4 : Develop a JSP code to create a Web site 3 85 80 H H M H L - - - M L - H - - -
CLO-5 : Construct Web Application using Servlets 3 85 75 L H M H L - - - L L - H - - -
CLO-6 : Web application using Java Server Pages 3 80 70
Duration (hour) 24 24 24 24 24
SLO-1 Introduction To Swing Database Access: Overview of JDBC The core Java API Packages J2EE architecture Server side programming with Java Servlet
S-1
SLO-2 Swing is built on the AWT JDBC Drivers NIO fundamentals Enterprise application concepts HTTP and servlet
n-tier
SLO-1 The origins of Swing Connection Charsets and Selectors Servlet API
S-2 application concepts
SLO-2 Two key swing features Statement Using the NIO System J2EE platform Life Cycle
SLO-1 MVC Architecture ResultSet Regular expression processing HTTP protocol Configuration and context
S-3
SLO-2 MVC connection Metadata Reflection Web application Request and Response Objects
SLO-1 Components and container panes Example with JDBC connectivity RMI architecture Web containers and Application servers Session handling and Event handling
S-4 Introduction to filters with writing simple filter
SLO-2 A simple Swing application Study of JDBC, ODBC RMI registry Java Bean
application
SLO-1 Lab 4: program that makes a connection Lab 13: Create Servlet That Prints Today’s
S Lab 7: A simple Client/server application
SLO-2 Lab 1: implement Calculator using Swing with database using
using RMI
Lab 10 program to access java bean Date, Create Servlet that uses cookies to
5-8 SLO-3 Technology JDBC and prints metadata of this class: store the number of times a user
SLO-4 connection has visited the servlet.
Network Programming With java.net
SLO-1 The Swing Packages Overview of JNDI Java Bean properties JSP architecture
S-9 Package
SLO-2 Event handling Networking Basics Naming services Introspection JSP page life cycle
SLO-1 Applets The Networking Classes and Interfaces Naming And Directory Services Bound and constraint properties JSP elements
S-10
SLO-2 Create a swing Applet InetAddress Text Formatting Persistence Expression Language
SLO-1 Painting in Swing Inet4Address and Inet6Address DateFormat class Java Beans API Tag Extensions
S-11
SLO-2 Exploring Swing TCP/IP Client Sockets SimpleDateFormat Class Customizers Tag Extension API
SLO-1 JLable and image Icon URL Sample program using RMI Property descriptor JSP Fragments
S-12
SLO-2 JTextField URLConnectoion Methods in DateFormat class Event set descriptor Tag Files
SLO-1 Lab 3: Write a Program that displays two Lab 15: Create a web page that prints 1 to
Lab6: Write a java program for two way 10 using JSTL
S SLO-2 textboxes for entering a students’ TCP communication for server Lab 9: Java code for Linked List Lab 12: Java program to access JavaBean
21-24
SLO-3 Roll-no and Name with appropriate labels and client. It should look like a simple chat implementation class
and buttons. application
SLO-4
Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage) Final Examination (50% weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Level of Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15%
Create \15%
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Dr. R. Jayashree, SRMIST
2. K. Kanmani, SRMIST
Course Course Course L T P C
20CSA402J WEB PROGRAMMING C Professional Core
Code Name Category 4 0 4 6
ExpectedProficiency(%)
LevelofThinking(Bloom)
ExpectedAttainment(%)
To develop simple PHP programs
Engineering Knowledge
Analysis, Design,Research
Problem Analysis
Communication
Environment &Sustainability
CLR-6 : To create database-driven applications
PSO– 3
PSO- 1
PSO- 2
Ethics
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:
CLO-1 : Create files using Vi editor 3 80 70 L H - H L - - - L L - H - - -
CLO-2 : Write PHP scripts to handle HTML forms. 3 85 75 M H L M L - - - M L - H - - -
CLO-3 : Write regular expressions including modifiers, operators, and metacharacters. 3 75 70 M H M H L - - - M L - H - - -
CLO-4 : Create PHP programs that use various PHP library functions, and that manipulate files and directories 3 85 80 M H M H L - - - M L - H - - -
CLO-5 : Analyze and solve various database tasks using the PHP language 3 85 75 H H M H L - - - M L - H - - -
CLO-6 : Analyze and solve common Web application tasks by writing PHP programs. 3 80 70 L H M H L - - - L L - H - - -
Duration
(hour) 24 24 24 24 24
SLO-1 Introduction to Linux What Does PHP Do? Introduction to Function Introduction to Arrays Introduction to MySQL Database
S-1
SLO-2 History of Linux A Brief History of PHP Calling a Function Indexed Versus Associative Arrays Creating and using a database
SLO-1 Open Source software Language Basics Defining a Function Identifying Elements of an Array Dropping a database
S-2
SLO-2 Benefits of Open Source software Lexical Structure Introduction to Function Parameters Storing Data in Arrays MySQL Datatypes
SLO-1 Features of Linux Introduction to Data Types Passing parameters by value Multidimensional Arrays Creating a table
S-3
SLO-2 Pros and Cons of Linux Scalar Types Passing parameters by reference Extracting Multiple Values Dropping a table
Converting Between Arrays and
SLO-1 Compound Types Default Parameters Insert Query
Variables
S-4 Linux Distributions
SLO-2 Special Types Variable Parameters Traversing Arrays Select Query
SLO-1 Introduction to Expressions and Operators Variable Functions Introduction to Object Like Clause
S-10 Linux File Structure Arithmetic operators, Comparison operators, Bitwise
SLO-2 Anonymous Functions Creating an Object Sorting Results
operators
Logical operators, Casting operators & Miscellaneous
SLO-1 Introduction to File Types Operators
Introduction to Strings Accessing Properties and Methods Update Query
S-11
SLO-2 Types of Files in Linux Operator precedence Quoting String Constants Declaring a Class Working with Null values
SLO-1 Managing Directories Introduction to Flow-Control Statements Variable Interpolation Declaring methods and properties Using more than one table
S-12
SLO-2 mkdir, rmdir, cd and pwd commands Working with If & Switch Printing Strings Declaring constant Using Join
SLO-1
S
Lab2: Working with directory
13-16 SLO-2 Lab 5: Operators & Control Statements Lab 8: Functions & Strings Lab 11: Arrays & Objects Lab 14: Working with various MySQL Queries
SLO-3 commands
SLO-4
SLO-1 Listing directories Working with While, for, foreach, Accessing Individual Characters Inheritance Introduction to Working with MySQl Database using PHP
S-17
SLO-2 ls command Using exit, return, goto statements Cleaning Strings Interfaces and Traits Connecting to MySQL database
SLO-1 File and directory operations Including Code form another module Encoding and Escaping Abstract Methods Querying database
S-18
SLO-2 cp, mv, rm and ln commands Working with include and require construct Comparing Strings Constructors & Destructors Retrieving and displaying the results
SLO-1 File Access Permission Embedding PHP in Web Pages Manipulating and Searching Strings Introduction to Introspection Modifying data
S-19
SLO-2 Working with chmod command Standard (XML) Style, SGML Style Introduction to Regular expression Examining an Object Deleting data
Pattern matching and substituting new
SLO-1 Introduction to Vi editor ASP Style
text for matching text
Introduction to Serialization
S-20 Designing simple database application
Splitting a string into an array of smaller serialize ( ) and unserialize ( )
SLO-2 Working with Vi editor Script Style
chunks functions
SLO-1 Lab 15: Developing Simple Database Applications
S Lab 3: Working with file Lab 6: Embedding PHP script in HTML Lab 12:: Introspection and
SLO-2 commands, Creating and Lab 9: String Manipulation
21-24 SLO-3 modifying files using Vi Editor Serialization
SLO-4
Learning 1. Richard Petersen - Linux : The Complete Reference ,Sixth edition (2006)
Resources 2. Rasmus Lerdorf, Kevin Tatroe, Bob Kaehms, RicMcGredy (2002), Programming PHP, O’REILLY(SPD). 3. Lee Babin, Nathan A. Good, Frank M. Kromann, Jon Stephens (2005), “PHP 5 Recipes, A problem
solution approach”, après.
Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage) Final Examination (50% weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Level of Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15%
Create \15%
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Mrs. S. Chandrakala, SRMIST
2. Mrs. Surya, SRMIST
3. Mrs. J. Vasavi, SRMIST
4. Mrs. Ramla, SRMIST
Course Course Course L T P C
20CSA501J PYTHON PROGRAMMING C Professional Core
Code Name Category 4 0 4 6
Course Learning Rationale (CLR): The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
CLR-1 : Describe the core syntax and semantics of Python programming language. 1 2 3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
CLR-2 : Discover the need for working with the strings and functions.
Fundamental Knowledge
Application of Concepts
Skills in Specialization
Communication Skills
Professional Behavior
Analytical Skills
CLR-4 : Indicate the use of regular expressions and built-in functions to navigate the file system.
ICT Skills
CLR-5 : Infer the Object-oriented Programming concepts in Python.
CLR-6 :
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:
CLO-1 : Develop, document, and debug modular python programs to solve computational problems 3 80 70 L H - H L - - - L L - H - - -
CLO-2 : Select a suitable programming construct and data structure for a situation. 3 85 75 M H L M L - - - M L - H - - -
CLO-3 : Use built-in strings, lists, sets, tuples and dictionary in applications. 3 75 70 M H M H L - - - M L - H - - -
CLO-4 : Define classes and use them in applications 3 85 80 M H M H L - - - M L - H - - -
CLO-5 : Use files for I/O operations. 3 85 75 H H M H L - - - M L - H - - -
CLO-6 : 3 80 70 L H - H L - - - L L - H - - -
Duration (hour) 24 24 24 24 24
SLO-1 An introduction to python programming The Structure of Strings Introduction to Lists Introduction to function Introduction to classes
S-1
SLO-2 Structure of a Python program The Subscript Operator List literals Functions as Abstraction Mechanisms Design with Classes
SLO-1 understanding Python interpreter Program using subscript operator Basic list operators Functions Eliminate Redundancy Objects and Classes
S-2
SLO-2 understanding Python Shell Slicing for Substrings Replacing an Element in a List Functions Hide Complexity An example for class
Functions Support General Methods with
SLO-1 Datatypes Program for slicing substrings Replacing an Element in a List Docstrings
Systematic Variations
S-3
Example program to Replace an Element
SLO-2 Example program using all data types Testing for a Substring with the in Operator Functions Support the Division of Labor Method Definitions
in a List
SLO-1 String literals Program using substring List Methods for Inserting Elements Defining a Recursive Function The init Method
S-4
The Positional System for Representing Program to List Methods for Inserting
SLO-2 Escape Sequences Tracing a Recursive Function Instance Variables
Numbers Elements
SLO-1 Lab 7: Program to Transpose a Matrix
S Lab 1: Write a Python code to display Lab 13: Program using classes and
Lab 4:Make a simple calculator Program to List Methods for Inserting Lab 10: Program using recursive function
5-8 SLO-2 system information usingpywhois methods
Elements
Using Recursive Definitions to Construct
SLO-1 String Concatenation Converting binary to decimal List Methods for Removing Elements The str Method
S-9 Recursive Functions
SLO-2 Variables and the assignment statement Program to convert binary to decimal Searching a List Recursion in Sentence Structure Accessors
SLO-1 Example program using variables Converting decimal to binary Sorting a List Infinite Recursion Mutators
S-10
SLO-2 Program Comments and Doc Strings Program to convert decimal to binary Mutator Methods The Costs and Benefits of Recursion The Lifetime of Objects
SLO-1 Numerical Datatypes String Methods Aliasing Managing a Program’s Namespace Rules for Defining a Simple Class
S-11
Module Variables, Parameters, and Rational Number Arithmetic and Operator
SLO-2 Character sets Program using string method Aliasing side effects
Temporary Variables Overloading
SLO-1 Arithmetic expressions Octal and Hexadecimal Numbers Equality: Object Identity Scope Comparison Methods
S-12
SLO-2 Understanding error messages Text Files and Their Format Structural Equivalence Lifetime Equality and the eq Method
SLO-1 Lab 5: Find the Factorial of a Number Lab 8: Using a List to Find the Median of a Lab 11: Write the code for a mapping that
S Lab 2: The Magic 8 Ball is a toy used for Lab 14: Python Program for Operator
Python Program to Convert Decimal to Set of Numbers generates a list of the absolute values of
13-16 SLO-2 fortune-telling or seeking advice. overloading
Binary, Octal and Hexadecimal Program using sorting and searching the numbers in a list named numbers.
Using pickle for Permanent Storage of
SLO-1 Logical operators Writing Text to a File Tuples Default (Keyword) Arguments
Objects
S-17
Creation of several tuples Input of Objects and the try-except
SLO-2 Definite iteration : For loop Writing Numbers to a File Functions as First-Class Data Objects
Statement
SLO-1 Example program using for loop Reading Text from a File Dictionaries Mapping Inheritance Hierarchies and Modeling
S-18
SLO-2 Formatting text for output Reading Numbers from a File Dictionary Literals Filtering Polymorphic Methods
Example program to read and write text
SLO-1 Selection : if and if else statement Adding Keys and Replacing Values Reducing Abstract Classes
and numbers
S-19
Using lambda to Create Anonymous The Costs and Benefits of Object-Oriented
SLO-2 Example program using if and if else Accessing Files and Directories on Disk Accessing Values
Functions Programming
SLO-1 Conditional iteration :while loop Manipulating Files and Directories on Disk Removing Keys Creating Jump Tables Event-Driven Programming
S-20
Example program to access and
SLO-2 Example program using while loop Traversing a Dictionary Example program using functions Example for Event-Driven Programming
manipulate files
SLO-1 Lab 9: When the user enters a statement,
the program responds in one of two ways:
1 With a randomly chosen hedge, such as
Lab 3: Check whether a number is prime or “Please tell me more.” 2 By changing Lab 12: Write the code for a filtering that
Lab 6: Program to read and write text and
S not, numbers some key words in the user’s input string generates a list of the positive numbers in Lab 15: Program using polymorphism,
21-24 SLO-2 Python Program to Generate a Random and appending this string to a randomly a list named numbers. You should use a abstract classes
Number chosen qualifier. Thus, to “My teacher lambda to create the auxiliary function.
always plays favorites,” the program might
reply, “Why do you say that your teacher
always plays favorites?”
Learning Kenneth A. Lambert, The Fundamentals of Python: First Programs, 2011, Cengage Learning, ISBN: 978-
Resources 1111822705
Learning Assessment
Continuous Learning Assessment (50% weightage)
Bloom’s Final Examination (50% weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Level of Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15% 15%
Create
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Short Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
Course Course Course L T P C
20CSA502J OPERATING SYSTEMS C Professional Core
Code Name Category 4 0 2 5
Course Learning Rationale (CLR): The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
CLR-1 : Utilize operating systems based on its features and utility 1 2 3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
CLR-2 : Utilize the Process Management functions of an Operating system
Communication
PSO – 3
CLR-5 : Utilize the File Management functions of an Operating system
PSO - 1
PSO - 2
Ethics
CLR-6 : Analyze the practical operating systems and evaluate their utility
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:
CLO-1 : Identify functions of an operating system, analyze the process management functions 2 80 70 H H H H H M L M H M - H H H M
CLO-2 : Analyze CPU scheduling and synchronization process of an operating system 3 85 75 H H H H H M L M H M - H H H M
CLO-3 : Analyze the need of Memory management functions of an operating system 3 75 70 H H H H H M L M H M - H H H M
CLO-4 : Identify the significance of device management and file management’s role of an operating system 3 85 80 H H H H H M L M H M - H H H M
CLO-5 : Identify the essentials of interprocess communication in an operating system, evaluate hypervisors 3 85 75 H H H H H M L M H M - H H H M
CLO-6 : Analyze how operating systems are constructed, analyze the features and aspects of different operating environments 3 80 70 H H H H H M L M H M - H H H M
Duration (hour) 18 18 18 18 18
CPU Scheduling: Process Scheduler (long, Memory Management: Logical Vs Physical
SLO-1
Introduction Operating Systems (OS): short, medium term) address space, Swapping Communication Process Types:
S-1 Disk Management: File Systems, Types
Evolution, Functions, IOS Management CPU utilization, throughput, time: (a) Independent (b) Cooperative processes
SLO-2 Types of RAM (SRAM, DRAM)
(a) turnaround (b) waiting (c) response
Operations, Assembler, Compiler, loader, Partition Allocation Types: (a) single
SLO-1 Scheduling Types: FCFS, SJF
linker (b) contiguous (fixed, dynamic) Directories: Linear List, Hash Table Communication in Cooperative Processes
S-2
Types: Batch (simple, multiprogramming), Priority Scheduling: Preemptive, non- Contiguous Types: memory protection, Absolute and Relative path names (a) Shared Memory (b) Message Passing
SLO-2
Multiprocessor, Multicore, Time Sharing, preemptive allocation, fragmentation (c) partitioned
(a) Shared Memory (i) Accessing:
Network, Distributed (client-server, peer-to-
SLO-1 Other Scheduling Types: (a) Round Robin, Disk Formatting, Boot Block, Bad Block shmget(),(ii) Controlling: shmctl(), (iii)
peer), Real-Time (hard, soft) (d) paged memory management Attaching: shmat(), (iv) Detaching: shmdt()
S-3 (b) multilevel queue (c) multilevel feedback
Clustering (symmetric, asymmetric, queue (d) highest response ratio next (e) segmented memory management Types of File Directories (a) Single (b) Message Passing:
SLO-2
parallel) (b) Two level (i) Direct (ii) Indirect
Mechanism used for Message Passing
SLO-1 (c) Tree (d) Hierarchical
Examples: Linux, DOS, Windows, Mac, (e) lottery (f) thread scheduling (g) multiple Multiprogramming: (a) Variable Task (i) Pipe (ii) Named Pipe (iii) Socket
S-4
IOS, Android, Blackberry, bada, Cisco IOS processor (h) real-time CPU (MVT), (b) Fixed Number of Task (MFT) (iv) RPC (v) Message Queue
SLO-2 Advantages of File Directories
(vi) Semaphore (vii) Signals
S SLO-1 Lab 1: Comparison between various
Lab 4: CPU Scheduling Lab 7: Multiprogramming (MVT & MFT) Lab 10: File Directory Lab 13: IPC and Shared Memory
5-6 SLO-2 Operating Systems
Microkernel: Architecture, Kernel mode, Synchronization, Independent, Cooperative Paged memory management,
SLO-1 File Allocation (a) Continuous
user mode, Monolithic, differences Process, Critical Section Problem Paging technique (i) Pipe: One Way & Two Way
S-7
System Call Types Race condition and process Structure of Page Map Table, Page Table Communication (ii) Named Pipe: FIFO
SLO-2 (b) Linked (c) Indexed
(a) process control: fork(), exit(), wait() synchronization entries, Transition Lookaside Buffer (TLB)
S-8 SLO-1 (b)file manipulation: open(), read(), write(), Semaphores, Mutex, Monitors Inverted Page Table, Swap Space File mounting, sharing and protection (iii) Sockets: stream, datagram,
close() (c)device mgt: ioctl(), read(), write() Virtual Memory: Virtual Address Space sequential packet, raw
(d)maintenance: getpid(), alarm(), sleep()
Synchronization Problems: (a) Bounded Allocation methods: (a) first fit, (b) best fit,
SLO-2 (e)communication: pipe(),shmget(),mmap() (iv) RPC: Types and Usage
Buffer, (b) Readers-Writers, (c) worst fit, (d) next fit
(f)protection: chmod(), chown(), umask()
SLO-1
System Programs: file management, status (c)Sleeping Barber, (d) Dining Philosopher, Segmented Memory Management Secondary Memory: Track, Sector, Disk, (v) Message Queues: msgget(), msgsnd(),
S-9
SLO-2 info, file modification, language support (e) Producer-Consumer Types: virtual memory, simple Seek Time, Rotational Latency msgrcv(), msgctl()
Learning 1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating systems, 9th ed., John Wiley & Sons, 2013 3. Andrew S. Tanenbaum, Herbert Bos, Modern Operating systems, 4th ed., Pearson, 2015
Resources 2. William Stallings, Operating Systems-Internals and Design Principles, 7th ed., Prentice Hall, 2012 4. Bryant O’Hallaxn, Computer systems- A Programmer’s Perspective, Pearson, 2015
Learning Assessment
Continuous Learning Assessment (50% weightage)
Bloom’s Final Examination (50% weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Level of Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15% 15%
Create
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
Course Course Course L T P C
20CSA503J SOFTWARE ENGINEERING AND TESTING C Professional Core
Code Name Category 4 0 4 6
Course Learning Rationale (CLR): The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
CLR-1 : Familiarize the software life cycle models and software development process 1 2 3
CLR-2 : Understand the various techniques for requirements, planning and Testing
Environment &Sustainability
Analysis, Design,Research
Level of Thinking (Bloom)
Expected Proficiency (%)
Problem Analysis
Communication
CLR-5 : Acquire the latest industry knowledge like agile for development
CLR-6 : Usage of tools and comply the gloabal standards for testing
PSO– 3
PSO- 1
PSO- 2
Ethics
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:
L H - H L - - - L L - H - - -
CLO-1 : Identify the process of project life cycle model and process 3 80 70 M H L M L - - - M L - H - - -
CLO-2 : Analyze and specify software requirements through a productive working Relationship Customers. 3 85 75 M H M H L - - - M L - H - - -
CLO-3 : Design the system based on Functional Oriented and Object Oriented Approach for Software Design. 3 75 70 M H M H L - - - M L - H - - -
CLO-4 : Develop the correct and robust code for the software products 3 85 80 H H M H L - - - M L - H - - -
CLO-5 : Perform by applying the test plan and various testing techniques 3 85 75 L H M H L - - - L L - H - - -
CLO-6 : Analyze the key issues of Software maintenance 3 80 70
Duration (hour) 24 24 24 24 24
SLO-1 The Evolving Role of Software Computer-Based Systems Principles of Testing Integration testing Performance Testing
S-1
The System Engineering Hierarchy –
SLO-2 Software Engineering Definition Introduction-Testing Definition Top down Integration testing Factors of Governing
System Modeling
SLO-1 Software Characteristics System Simulation Phases of software Bottom up Integration testing Regression testing
S-3
SLO-2 Types Of Myths Quality assurance System Acceptance Testing Best practice in regression testing
Requirements Engineering process
S-4 SLO-1 Software Engineering : Layered Technology Software requirements specification Quality Control Functional testing Methodology for Performance Testing
S5-6 SLO-1 Lab :Problem Statement Preparation Lab: Drawing E-R Diagram for any project Lab : Test Case Design Lab : Manual Testing – Calculator Lab : Manual Testing – Triangle types
SLO-1 Software Process Characteristics of Good Requirements Testing verification and validation Non Functional testing Tools for Performance Testing
S-7
SLO-2 Software Process Models Types of Requirements White Box Testing Functional Vs Non Functional Testing Challenges for Performance Testing
Performing Initial Test, Understanding the
SLO-1 Linear Sequential Model Requirements Elicitation Techniques of White Box Testing System Testing
Criteria
S-8
SLO-2 Advantages And Disadvantages Requirements Analysis and Negotiation Black box testing Classifying Test Cases.
Design and Architectural Verification
S11-12 SLO-1 Lab :Problem Statement Preparation Lab: Drawing E-R Diagram for any project Lab : Test Case Design Lab : Manual Testing – Mark sheet Lab : Manual Testing – Sorting
Software Requirement Specification and
SLO-1 Evolutionary Process Models Challenges in white box testing Testing for Compliance Configuration testing
System Requirement Specifications
S-13
SLO-2 Incremental Model Characteristics of Good SRS Document Black Box Testing Scalability Testing compatibility testing
Techniques of
S-14 SLO-1 Advantages and Disadvantages Requirement Management Reliability testing Test plan with debugging
Black Box Testing
S-15 SLO-2 Spiral Model Software Prototyping Structural testing Stress testing Levels of testing
S-16 SLO-1 WIN WIN Model Selecting the prototyping approach Static testing Acceptance Testing Testing tools
S-19 SLO-1 Advantages and Disadvantages Specification Principles, Representation Verification Techniques Acceptance Criteria Testing tools
S-20 SLO-1 Concurrent Development Model Specification Review Validation Selecting Test Cases Key Issues in Software maintenance
S-21 SLO-1 Component Based Development Characteristics of Good E-R Diagrams Cyclomatic complexity Executing Tests Examples
Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage) Final Examination (50% weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Level of Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15%
Create \15%
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Mrs.M.R.Sudha, SRMIST
Course Learning Rationale (CLR): The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
CLR-1 : Understand the evolution of computer networks using the layered network architecture 1 2 3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
CLR-2 : Understand the addressing concepts and learn networks devices
Fundamental Knowledge
Application of Concepts
Skills in Specialization
Communication Skills
Professional Behavior
Analytical Skills
CLR-4 : Understand the error types, framing, flow control
ICT Skills
CLR-5 : Understand the various Medium Access Control techniques and also the characteristics of physical layer functionalities
CLR-6 : Know the algorithms behind the protocols that helps data transfer
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:
CLO-1 : Acquire the basics of computer network and its architecture 3 80 70 L H - H L - - - L L - H - - -
CLO-2 : Acquire the knowledge of various networks devices and addressing methods 3 85 75 M H L M L - - - M L - H - - -
CLO-3 : Design the network routing methods 3 75 70 M H M H L - - - M L - H - - -
CLO-4 : Find the error type that may happen during data transportation 3 85 80 M H M H L - - - M L - H - - -
CLO-5 : Understand the physical layer functions and components 3 85 75 H H M H L - - - M L - H - - -
CLO-6 : Speak on the topology chosen for a architecting a network that an organization demands 3 80 70 L H - H L - - - L L - H - - -
Duration (hour) 24 24 24 24 24
SLO-1 Evolution of Computer Networks Addressing Types Network layer functionalities Introduction- Error Types Physical layer
S-1
SLO-2 The Internet Physical , Logical addresses Delivery vs Forwarding Types of Error Overview of physical layer
SLO-1 The Internet today Port, specific addresses Unicast routing protocols Error Control Mechanism Functionalities
S-2
SLO-2 Data communications IPV4 addresses Intra domain routing Error Detection Analog and Digital
SLO-1 Components Notations Inter domain routing Error Correction Data, signals
S-3
SLO-2 Networks Classful addressing Multicast routing protocols Error Detection vs Error Correction Transmission impairment
SLO-1 Physical structures Categories of Classful addressing Application of Multicast routing protocols Parity Attenuation
S-4
SLO-2 Categories of Networks Categories Distance vector routing Checksum Distortion, Noise
S SLO-1 Lab 4:IP addressing and Lab 10: Implementation of EIGRP Lab 13: Implementation of Single-Area
Lab 1: Introduction of packet racer Lab 7: Implementation of static routing
5-8 SLO-2 subnetting(VLSM) configuration OSPF link costs and interface
SLO-1 Network Models Categories of addressing Application of Distance vector routing Hamming code Performance metrics
S-9
SLO-2 Protocols Classless addressing Node instability issues Application of Hamming code Bandwidth, Delay
SLO-1 Standards Categories of Classless addressing RIPv1 Correction vs Detection Throughput, Jitter
S-10
SLO-2 Standards Organizations Prefix usage RIPv2 Framing Wireless 802.11
SLO-1 Layered Tasks Network Address Translation (NAT) Difference of RIPV1 and RIPV2 Flow control Addressing mechanism
S-11
SLO-2 Hierarchy Types of NAT Link state routing Error control Transmission Media
SLO-1 OSI Model NAT Terminology Principle of Link state routing ARQ Twisted pair
S-12
SLO-2 Layered Approach Translation table Dijkstra’s Algorithm ARQ types Coaxial
S SLO-1 Lab 2: Implementation of various Topology Lab 11:Implementation of EIGRP Lab 14:Implementation of Multi-Area OSPF
Lab 5: Configuring Interfaces Lab 8: Implementation of Default routing
13-16 SLO-2 creation bandwidth and adjacencies with stub areas and authentication
SLO-1 Peer-Peer Approach IPV6 addresses Applications of Dijkstra’s Algorithm Random access Fibre
S-17
SLO-2 Layers in the OSI Model Types, Notation OSPF ALOHA Architecture of IEEE 802
SLO-1 TCP/IP Protocol Suite CIDR Applications of Path vector routing CSMA/CA IEEE 802.15.4
S-19
SLO-2 TCP/IP Reference Model Address Aggregation Stabilized routing table creation for AS Collision Detection VS Collision Avoidance Architecture
SLO-1 Comparison with OSI Model Networking devices BGP Controlled access IEEE 802.16
S-20
Comparison of the OSI and TCP/IP
SLO-2 Router,Switch,Hub,Bridges BGP sessions Channelization Architecture
Reference Models
S SLO-1 Lab 3: Implement the categories of Lab 6: Basic router configuration, creating Lab 12: Implementation of EIGRP Lab 15: Redistribution Between EIGRP
Lab 9: Implementation of RIPv1,v2
21-24 SLO-2 network(LAN,MAN,WAN) passwords authentication and timers and OSPF
Learning Assessment
Continuous Learning Assessment (50% weightage)
Bloom’s Final Examination (50% weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Level of Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15% 15%
Create
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Short Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. 1. 1. Dr.S.Kanchana, SRMIST
2. 2. 2.
Course Course Course L T P C
20CAE401J MULTIMEDIA AND ANIMATION C 20CAE401J
Code Name Category 4 0 4 6
ExpectedProficiency(%)
LevelofThinking(Bloom)
ExpectedAttainment(%)
Demonstrate the use of animation, digitized sound, video control, and scanned images
Engineering Knowledge
Analysis, Design,Research
Problem Analysis
Communication
Environment &Sustainability
CLR-6 : Will develop conceptual maps of content and process for interactive multimedia instructional programs
PSO– 3
PSO- 1
PSO- 2
Ethics
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:
CLO-1 : Understand Multimedia works 3 80 70 L H - H L - - - L L - H - - -
CLO-2 : Create a multimedia component using various tools and techniques 3 85 75 M H L M L - - - M L - H - - -
CLO-3 : Import graphics and textures created on other applications into a multimedia software program 3 75 70 M H M H L - - - M L - H - - -
CLO-4 : Create a movie using simple animation 3 85 80 M H M H L - - - M L - H - - -
CLO-5 : Create an effective interactive site for use on the internet 3 85 75 H H M H L - - - M L - H - - -
CLO-6 : Do simple scripting for a file 3 80 70 L H M H L - - - L L - H - - -
Duration (hour) 24 24 24 24 24
SLO-1 What Is Multimedia Photoshop Introduction Adjustments Flash – Introduction Introduction to Action Sciript
S-1
SLO-2 Interactive Multimedia Importance and Fundamentals Retouching Animation Actions – Button
SLO-1 Advantages Of Interactive Multimedia Opening Images Tonal Adjustment Interacting Button Actions
S-2
SLO-2 Where To Use Multimedia Importing Images Color Adjustment Basic Concepts Frame Action
SLO-1 Text ,Graphics Resolution Retouch by hand Drawing Lines Action scene
S-3
SLO-2 Audio, Film, Video Pixels Smudge Tool Shapes Movie Clip
SLO-1 Understanding Text Colour Models Effects Strokes Symbols
S-4
SLO-2 Typeface or Fonts Colour Spaces Filters Fill Browsers
SLO-1 API Paint Bucket, Gradient Tool Merge layer Importing Art Work Usage of Tools
S-11
UNDERSTANDING SOUND: Basic Sound
SLO-2 Erasers :Normal Guide Layer Manipulating Interface Elements
Concept
SLO-1 Audio Formats Background Eraser Effects Images : Animation Panels
S-12
SLO-2 Quality Levels Magic Eraser Filters Frame Animation Tools
SLO-1
S Lab2: Understanding the usage of selection
Lab 5: Clone an Image, Captain Kirk’s Lab 8: Apply readymade effects to image Lab 11: Text and Shape Tweening, Moving a
13-16 SLO-2 Tools: Marquee Selections and Lasso Lab 14: Masking Effect and Water Masking
SLO-3 Selections Myophia Effect using Filter menu bus from one end to other end of stage
SLO-4
SLO-1 AIF Format Fills and its Types Layer Palette Animating One Frame at a time Layer Folders
S-17
SLO-2 AU Format Selection and allied operations Layer effects Motion Tweening Layer Accessibility
SLO-1 EA Format Marquee selection Layer Sequence Object,Text Masking Layer
S-18
SLO-2 MIDI Format cropping Masking Effect Symbols Video
SLO-1 Mp3 Format Lasso selections-Paths Layer styles Instances User Interface Components
S-19
SLO-2 UNDERSTANDING VIDEO Combining Background layer Shape Tweening, Sound Changing the Appearance of Component
SLO-1 Digital Video Transforming Adding image to background Layer Bouncing Ball with Star shape Transforming view
S-20
SLO-2 Analog Video Selections Filters Moving a Truck with wheel Transition
1. Vishnu Priya Singh (2006), “A Text Book of Multimedia”, 1st Ed., Computech Pub. Ltd ,
Learning
New Delhi. (UNIT I)
Resources 2. Nigel Chapman and Jenny Chapman, “ Practical Multimedia ”, 2nd Ed., Wiley – Dream Tech Pvt.
Ltd. (UNITS II, III, IV & V)
Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage) Final Examination (50% weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Level of Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15%
Create \15%
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Mrs.D.S.Dayana, SRMIST
2. Mr.J.Venkata Subramaniyan, SRMIST
3. Mrs.A.Jenita Mary,
SRMIST
4. Mrs.K.Kanmani, SRMIST
Course Course Course L T P C
20CAE402J OBJECT ORIENTED ANALYSIS & DESIGN C Discipline Specific Elective Courses
Code Name Category 4 0 4 6
Fundamental Knowledge
Application of Concepts
Communication Skills
Skills in Specialization
Procedural Knowledge
CLR-3 : Understand Software Design Patterns
Professional Behavior
Analytical Skills
CLR-4 : Develop reliable software systems
ICT Skills
CLR-5 : Apply Standardized testing approaches
CLR-6 : Practical Approach for modeling simple real world applications
Duration (hour) 24 24 24 24 24
Behavioral Modeling Architectural Modeling
SLO-1 Introduction to OOAD Basics of Structural Modeling Patterns & frameworks
S-1
Classes Component
SLO-2 OO Basics Interactions Patterns & Architecture
Class Diagram Sequencing Components and Interfaces
SLO-1 Importance of Modelling Frameworks
S-2
Common Modeling Techniques for classes Interactions-Links And Associations Simple and Extended Components
SLO-2 Principles of Modelling Mechanisms
Relationships in classes Objects Creation Components And Classes Modeling Design Patterns
SLO-1 Overview of UML
S-3
Modeling Dependencies Modeling Flow Control by Time Components And Interfaces Modeling Architecture Patterns
SLO-2 Where can UML be used?
S-12 SLO-1 SDLC Other Adornments in UML Modeling Requirements using Deployment Issues in OO Testing –
usecases
Modeling New Building Blocks Use case Diagram with relationships Simple and Extended Nodes
SLO-2 SDLC Phases Unit Testing
1. Grady Booch, James Rumbaugh and Ivar Jacobson (2004). “The Unified Modeling Language
User Guide”. Addison Wesley Longman Pvt. Ltd., Singapore, 3. Ali Bahrami – Object Oriented Systems Development – McGraw Hill International Edition – 1999
Learning 2. Craig Larman, ―Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design
Resources and Iterative Development‖, Third Edition, Pearson Education, 2005.
Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage)
Final Examination (50% weightage)
Level of CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Thinking Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15% 15%
Create
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Short Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Anita Jasmine.R, SRMIST
2. Ramla.M SRMIST
Course Course Course L T P C
20CAE403J WINDOWS PROGRAMMING USING VB.NET C Discipline Specific Elective Courses
Code Name Category 4 0 4 6
ExpectedProficiency(%)
LevelofThinking(Bloom)
ExpectedAttainment(%)
Develop programs using primitives and constructs in VB .NET
Engineering Knowledge
Analysis, Design,Research
Problem Analysis
Communication
Understand various controls in VB.NET and able to develop programs using controls
Environment &Sustainability
CLR-5 :
CLR-6 : Connect database by using ADO.NET and manipulate the database
PSO– 3
PSO- 1
PSO- 2
Ethics
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:
L H - H L - - - L L - H - - -
CLO-1 : Design/develop programs with GUI interfaces 3 80 70 M H L M L - - - M L - H - - -
CLO-2 : Assemble multiple forms, modules, and menus into working VB.NET solutions 3 85 75 M H M H L - - - M L - H - - -
CLO-3 : Develop menu based program for text manipulation 3 75 70 M H M H L - - - M L - H - - -
CLO-4 : Implement lists and loops with VB.NET controls and iteration 3 85 80 H H M H L - - - M L - H - - -
CLO-5 : Understand ADO .NET and develop database applications 3 85 75 L H M H L - - - L L - H - - -
CLO-6 : Develop the applications using DataGrid for displaying records 3 80 70
Duration (hour) 24 24 24 24 24
SLO-1 Evolution of the .NET Framework Control Statements Inheritance Exception Handling Single Document Interface(SDI)
S-1
SLO-2 Overview of the .Net Framework If Statement Polymorphism Default Exception Handing Mechanism Multiple Document Interface (MDI)
User Defined Exception Handling
SLO-1 Components of .NET Framework Radio Button Control Virtual Methods Implementation for SDI and MDI
Mechanism
S-2
Implementation for Default and User
SLO-2 Common Language Runtime (CLR) Check Box Control Abstract classes Dialog Boxes
Defined Exception Handling
SLO-1 Common Type System(CTS) List Box Control Abstract Methods The Throw Statement Modal Dialog Box
S-3
SLO-2 Common Language Specification (CLS) Group Box Control Sealed Classes Implementation for Throw Statement Modeless Dialog Box
Implementation for Modal and Modeless
SLO-1 Framework Class Library (FCL) Checked List Box Control Interfaces - Definition of an Interface Custom Exception
S-4 Dialog Boxes
SLO-2 Base Class Library Combo Box Control Declaration of an Interface Implementation for Custom Exception Built-in Dialog Boxes
Lab 7: Link Label Application, Paint Brush Lab 10: Application using Default and User
SLO-1 Lab1:Understanding the IDE of Visual Lab 4: Wishlist Application, String Handling Application, Application Implementing the
S Defined Exception Handling Mechanism, Lab 13: Develop application using SDI and
5-8
SLO-2 Studio, Changing background and Functions, Applications using group box, concept Abstract class and abstract
SLO-3 methods Application using Throw statement and MDI
foreground color using toolbox controls list box, checked list box, combo box
SLO-4 Custom Exception
Learning
1. Muthu.C (2008), “Visual Basic.Net”, 2nd Ed, Vijay Nicole Imprints Pvt., Ltd,
Resources
Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage) Final Examination (50% weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Level of Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15%
Create \15%
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
Course Course Course L T P C
20CAE601J DATA MINING USING R C Professional Core
Code Name Category 4 0 4 6
ExpectedProficiency(%)
LevelofThinking(Bloom)
ExpectedAttainment(%)
Experimenting with different data mining techniques for knowledge discovery
Engineering Knowledge
Analysis, Design,Research
Problem Analysis
Communication
Environment &Sustainability
CLR-6 : Build an effective model and perform model evaluation based on performance metrics
PSO– 3
PSO- 1
PSO- 2
Ethics
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:
CLO-1 : Understand Data Mining and its various tasks 3 80 70 L H - H L - - - L L - H - - -
CLO-2 : Perform Linear Regression and Logistic Regression on a dataset 3 85 75 M H L M L - - - M L - H - - -
CLO-3 : Extract interesting rules from dataset using Association Rule Mining 3 75 70 M H M H L - - - M L - H - - -
CLO-4 : Apply various Classification Algorithms in data mining 3 85 80 M H M H L - - - M L - H - - -
CLO-5 : Perform unsupervised learning using various Clustering Techniques 3 85 75 H H M H L - - - M L - H - - -
CLO-6 : Effectively use R programming constructs and packages to perform mining on different datasets 3 80 70 L H M H L - - - L L - H - - -
Duration (hour) 24 24 24 24 24
Why Data Mining? Evolution of Information Introduction to Association Rules Basic Concepts-What is Classification> What is Cluster Analysis?
SLO-1 Technology Simple Linear Regression
S-1
SLO-2 What is data mining? Estimating the Coefficients What is an Association Rule? General Approach to Classification Overview of Basic Clustering Approaches
SLO-1 Data Mining Goals Estimating the Regression Coefficients Candidate Generation Tree Pruning Techniques Partitioning Algorithms
S-4 k-Means Clustering- Centroid Based
SLO-2 KDD Vs Data Mining Other Considerations in Regression Model Generating Frequent Item Sets-Example Rule Based Classifier
Technique
Lab: 4 Package RODBC to ODBC connect
SLO-1 databases
Lab 7: Association rule mining using
SLO-2 Lab 10: Build a decision tree for the iris
S Lab1: Installing R and RStudio, RStudio APRIORI algorithm for titanic dataset
Analyze correlation between variables in data with package party,rpart Lab 13: k-means clustering of iris data
5-8 Using Functions
SLO-3 Australian CPI dataset.
SLO-4
Apriori Algorithm-Examples Partitioning Method: k-Means Clustering-
SLO-1 Steps in KDD Process Multiple Linear regression Using IF-THEN rules for Classification
S-9 Example
SLO-2 What kind of data can be mined? Estimating the Regression Coeficients Improving the Efficiency of Apriori Rule Extraction from Decision Tree k-Medoids Algorithms
A Pattern Growth Approach for Mining
SLO-1 Data Mining Techniques K-Nearest Neighbour Bayes Classification Methods Example: k-Medoids
S-10 Frequent Item Sets
SLO-2 Data Mining Techniques -Continued K-NN Demonstration with example FP-Growth Algorithm – Basic Idea Bayes Theorem Hierarchical Methods
SLO-1 What kind of patterns can be mined? Compare LR with k-NN FP-Growth Algorithm with example Naïve Bayes Classifier Agglomerative and Divisive Methods
S-11
SLO-2 Are all patterns interesting? Evaluation for regression FP-Growth Algorithm –Examples Naïve Bayes –Example Distance Measures in Algorithmic Methods
SLO-1 Data Objects and Attribute Types Model selection and over-fitting Mining Closed and Max Patterns Model Evaluation and Selection Dendogram
S-12 Nominal, Binary, Ordinal, Numeric, Discrete Mining Frequent Item Sets Using Vertical Techniques to improve Classification
SLO-2 Logistic regression Density Based Methods: DBSCAN
data types Data format Accuracy
SLO-1
Lab 5: Prediction with Simple Linear
SLO-2 Lab 11: Classification using Naïve Bayes Lab 14: Implementation of DBSCAN
Lab2: Overview -Working in the Console Regression Lab 8: Inspection of Association rules
classifier algorithm using iris data
SLO-3 • Arithmetic Operators • Logical Operations
S
13-16
SLO-4
SLO-1 What technologies are used? The Logistic Model Which Patterns are Interesting? Ensemble Techniques-Bagging DBScan Algorithm
S-17 Strong Rules are not Necessarily
SLO-2 Data exploration and visualization Estimating the Regression Coefficients Boosting Evaluation of Clustering
Interesting
Interestingness Measure-Support,
SLO-1 Data Visualization Techniques Making Predictions Artificial Neural Network-Introduction Measuring Clustering Quality
S-18 Confidence
SLO-2 Visualizing Complex data and relations Multiple Logistic Regression Generalization of Association Patterns Defining the Network Topology Determining the number of Clusters
SLO-1 Issues and Challenges in Data mining Linear Discriminant Analysis Dynamic Item Set Counting Algorithm- Multi Layer Feed Forward Neural Network Scalable Clustering Algorithms
S-19 Dynamic Item Set Counting Algorithm-
SLO-2 Applications of Data Mining Using Bayes Theorem Back Propagation Applications of Data Mining in Finance
Example
SLO-1 Case Study: Weather Data LDA for p=1 Association Rules with Item Constraints Inside the Black Box- Back Propagation Applications of Data Mining in Business
S-20 Applications of Data Mining in Social
SLO-2 LDA for p>! Discussion on Different Algorithms Neural Network –Perceptron Example
Case Study – Discussion Networks
SLO-1
Lab 15: Demonstrate hierarchical clustering
S SLO-2 Lab 6: Predict the probability of occurrence Lab 9: Visualize association rules, including Lab 12: Classification using Perceptron
on iris data
21-24 Getting Help in R and Quitting RStudio with logistic regression. scatter plot, balloon plot, graph
SLO-3 Using Swril in R Stock Market Prediction
SLO-4
Learning 3. An Introduction to Statistical Learning with Applications in R by Gareth James, Daniela Witten,
Resources Trevor Hastie and Robert Tibshirani, 2013; Publisher: Springer
1. Arun K Pujari, Data Mining Techniques, Univeristy Press 4. R and Data Mining: Examples and Case Studies Yanchang Zhao yanchang@rdatamining.com
2. J Han and M Kamber , Data Mining : Concepts and Techniques, Third Edition, Morgan Kaufmann Publishers http://www.RDataMining.com
Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage) Final Examination (50% weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Level of Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15%
Create \15%
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Mrs.Anita Jasmine, SRM IST
2. Mrs. Ramla, SRM IST
3. Mrs.A.Jenita Mary,
SRMIST
4. Mrs.ChandraKala, SRMIST
Course Course Course L T P C
20CAE602J ARTIFICIAL INTELLIGENCE C Discipline Specific Elective Courses
Code Name Category 4 0 4 6
Course Learning Rationale (CLR): The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
CLR-1 : Discover problems that are agreeable to solution by AI methods. 1 2 3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
CLR-2 : Study the basics of designing intelligent agents that can solve general purpose problems
Fundamental Knowledge
Application of Concepts
Skills in Specialization
Communication Skills
Professional Behavior
Analytical Skills
CLR-4 : Perform intellectual task as decision making, problem solving, perception, understanding
ICT Skills
CLR-5 : Formalize a given problem using different AI methods
CLR-6 : Provides adaptive learning
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:
CLO-1 : Demonstrate fundamental understanding of the history of artificial intelligence and its foundations 3 80 70 L H - H L - - - L L - H - - -
Apply basic principles of AI in solutions that require problem solving, inference, perception, knowledge representation, M H L M L - - - M L - H - - -
CLO-2 : 3 85 75
and learning
Identify systems with Artificial Intelligence. M H M H L - - - M L - H - - -
CLO-3 : 3 75 70
evaluation of different algorithms on a problem formalization
CLO-4 : Use classical Artificial Intelligence techniques, such as search algorithms, 3 85 80 M H M H L - - - M L - H - - -
CLO-5 : Ability to apply Artificial Intelligence techniques for problem solving. 3 85 75 H H M H L - - - M L - H - - -
CLO-6 : Ability to learn the current Artificial Intelligence techniques. 3 80 70 L H - H L - - - L L - H - - -
Duration (hour) 24 24 24 24 24
Planning: designing programs to search for
SLO-1 Introduction to Artificial Intelligence Logical Reasoning-Introduction Uncertain Knowledge and reasoning Learning
S-1 data or solutions to problems
SLO-2 History of AI- AI Techniques Knowledge Representation Forward search and backward search Quantifying uncertainty Learning agents
SLO-1 Problem Solving with AI- AI models Logical Agents: Knowledge based Agents state-space search Probability Theory: Uncertain Knowledge Classification of learning
S-2
Data Acquisition and Learning Aspects in Axioms of probability
SLO-2 The Wumpus World & Logic Represent the current state and goal state Learning elements
AI
SLO-1 Problem-Solving Process Propositional logic Problems to solve: Water Jug Problem Bayes Theorem Inductive Learning methods
S-3
Propositional logic: Syntax & Syntax State representation: Initial, operator, goal
SLO-2 Formulating Problems Bayes’ Rules & uses Learning decision tree
grammar state
SLO-1 Problem Types and Characteristics Inference Train travel problem probabilistic Reasoning Attribute based representation
S-4 Uncertainty:
Implication by inference State representation: Initial, operator, goal
SLO-2 Problem Analysis and Representation Causes of uncertainty: Choosing an attributes
Types of reasoning state
SLO-1 Lab1: program showing the various La43: program for Tic Tac Toe game Lab13: Program which demonstrate the
Lab7: Program for building a magic square Lab10: Program for solving A* shortest
S possibilities involved in solving a water jug played by Single player against automated precedence properties of operators in C
of Odd number of Rows and columns. path algorithm.
5-8 SLO-2 problem. Computer player. language.
S-9 SLO-1 Agents- Examples of Agents First-Order logic partial-order planning Probability Decision tree learning
Syntax of First-Order logic Basic representation
SLO-2 Types of agents Probability of occurrence Hypothesis Spaces
Operator representation
General Search algorithm
Basic elements of First order logic
SLO-1 planning graphs Conditional probability Information theory
Reducing first-order inference
S-10 Uniformed Search Methods
Quantifiers in First-order logic
SLO-2 Heuristic Search Techniques Planning graph of feeding Probability occurrence for the problem Information gain
Inference in first order logic and
SLO-1 BFS, Uniform Cost Search Uses of planning graph Bayesian networks Explanation based learning
Generalized rules for FOL
S-11
Depth First search , Depth Limited search FOL inference rules for quantifier
SLO-2 Planning graph example Types of Bayesian Network Hypothesis
(DLS)
SLO-1 Iterative Deepening search algorithm Forward chaining Graph plan algorithm Building model op Bayesian Network Statistical Learning methods
S-12
SLO-2 Iterative Deepening search for DFS Properties of forward chaining Using planning graphs for heuristics Directed Acyclic Graph Naïve Bayes
SLO-1 Lab2: Program for solving a water jug Lab5: program for Tic Tac Toe game Lab8: Program for building a magic square
S problem using Breadth first search and Lab11: Program which demonstrates Best Lab14:program to calculate factorial of a
played by two different human players. of Even number of Rows and columns.
13-16 SLO-2 Depth first search (BFS & DFS). First Search. number
SLO-1 Informed Search-Introduction Fast conversion of forward chaining planning and acting in the real world Conditional probability Instance base learning
S-17
Properties of forward chaining Basic Planning
SLO-2 General tree search: Evaluation function Bayesian Network Graph Neural Networks
Examples for forward chaining
SLO-1 General graph search: Evaluation function Backward Chaining Real world: JOB shop scheduling Inferences in Bayesian networks Reinforcement Learning
S-18
Properties of Backward chaining
SLO-2 Generate and Test BFS Critical path method Components of Bayesian Network Elements of reinforce learning
Examples for Backward chaining
SLO-1 Generate and Test A* algorithm Unification Forward march Temporal models Reinforcement learning problem
S-19
Conditions for Unification & Unification
SLO-2 Generate and Test AO* algorithm Backward march Inference in temporal models Agent environment interface
algorithm
Resolution for inference rule Hidden Markov models
SLO-1 constraint satisfaction Limited resources Steps for Reinforcement learning
S-20
Steps for Resolution Hierarchical Planning
SLO-2 Perform the task for given CSP: HMM components Problem solving methods for RL
S SLO-1 Lab3: program to find out route distance Lab6:program to implement Tower of Lab 9:program to implement five House Lab15:program to implement five House
Lab12:program to solve 8-Queens problem
21-24 SLO-2 between two cities Hanoi logic puzzle problem logic puzzle problem
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Dr.B.Rebecca Jeyavadhanam, SRMIST
Course Course Course L T P C
20CAE603J INTERNET OF THINGS BASICS C Discipline Specific Elective Courses
Code Name Category 4 0 4 6
Fundamental Knowledge
Application of Concepts
Communication Skills
Skills in Specialization
Procedural Knowledge
CLR-3 : Categorize the various protocols that are used for developing IoT applications.
Professional Behavior
Analytical Skills
CLR-4 : Deploy an IoT application and connect to the cloud.
ICT Skills
CLR-5 : Develop IoT application for real time scenario
CLR-6 :
Duration (hour) 24 24 24 24 24
SLO-1 Introduction Introduction Introduction about Iot protocols IoT Platforms Design Methodology Introduction about RESTful API
Learning Assessment
Bloom’s Continuous Learning Assessment (50% weightage)
Final Examination (50% weightage)
Level of CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Thinking Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 20% 20% 15% 15% 15% 15% 15% 15% 15% 15%
Understand
Apply
Level 2 20% 20% 20% 20% 20% 20% 20% 20% 20% 20%
Analyze
Evaluate
Level 3 10% 10% 15% 15% 15% 15% 15% 15% 15% 15%
Create
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Short Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,
Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. <name>, <industry name>, <email id> 1. <name>, <institution name>, <email id> 1. Dr.S.Umarani, SRMIST
2. <name>, <industry name>, <email id> 2. <name>, <institution name>, <email id> 2. Ms.G.S.Gayathri, SRMIST