Annexure-A

Study Scheme UG Programme: BE in Computer Science and Engineering

Semester-I
S No Sub Code Subject Name L T P Hrs. Credits
1 BSMA-401 Engineering Mathematics I 3 1 0 4 4
2 BSPH-401 Applied Physics 3 1 0 4 4
Elements of Electrical
3 ESEE-401 2 1 0 3 3
Engineering
Elements of Computer
4 ESCS-401 2 0 0 2 2
Engineering
Elements of Electronics
5 ESEC-401 2 0 0 2 2
Engineering
6 BSPH-402 Applied Physics Lab 0 0 2 2 1
Elements of Electrical
7 ESEE-402 0 0 2 2 1
Engineering Lab
Elements of Computer
8 ESCS-402 0 0 4 4 2
Engineering Lab
Elements of Electronics
9 ESEC-402 0 0 2 2 1
Engineering Lab
Total 12 3 10 25 20

Semester-II A

S No Sub Code Subject Name L T P Hrs. Credits

1 BSMA-402 Engineering Mathematics II 3 1 0 4 4
2 BSCH-401 Applied Chemistry 3 1 0 4 4
Elements of Mechanical
3 ESME-401 2 1 0 3 3
Engineering
Workshop Technology and
4 ESME-402 1 0 0 1 1
Practice
English Communication and Soft
5 HSMC-401 1 0 0 1 1
Skills
6 BSCH-402 Applied Chemistry Lab 0 0 2 2 1
Elements of Mechanical
7 ESME-403 0 0 2 2 1
Engineering Lab
8 ESME-404 Engineering Drawing 0 0 4 4 2
Workshop Technology and
9 ESME-405 0 0 4 4 2
Practice Lab
English Communication and Soft
10 HSMC-402 0 0 2 2 1
Skills Lab
11 MCCH-401 Environmental Studies 3 0 0 3 0
Total
13 3 14 30 20

1
 Semester-IIB
Practical Training During Summer
1 TPIN-421 Vacations (In-house) 02 weeks 40 1 (S/US)
2 TPIN-422 Technical Competency 40 1 (S/US)

Semester-III

S No Sub Code Subject Name L T P Hrs. Credits

1 BSMA-501 Numerical and Statistical Methods 3 0 0 3 3
2 PCCS-511 Digital Electronics 3 0 0 3 3
3 PCCS-512 Object Oriented Programming 2 1 0 3 3
4 PCCS-513 Data Structures 2 1 0 3 3
5 BSBL-501 Biology for Engineers 2 0 0 2 2
Numerical and Statistical Methods
6 BSMA-502 0 0 2 2 1
Lab
7 PCCS-514 Digital Electronics Lab 0 0 2 2 1
Object Oriented Programming
8 PCCS-515 0 0 4 4 2
Lab
9 PCCS-516 Data Structures Lab 0 0 4 4 2
Total 12 2 12 26 20

Semester-IVA

S No Sub Code Subject Name L T P Hrs. Credits

1 ESME-501 Engineering Mechanics 3 1 0 4 4
Computer Organization and
2 PCCS-521 3 0 0 3 3
Architecture
3 PCCS-522 Operating System 3 0 0 3 3
4 PCCS-523 Database Management System 2 1 0 3 3
5 HSMC-501 Principles of Management 3 0 0 3 3
6 PCCS-524 Operating System Lab 0 0 4 4 2
Database Management System
7 PCCS-525 0 0 4 4 2
Lab
8 MCMH-501 Indian Constitution 3 0 0 3 0
Total 17 2 8 27 20

2
 Semester-IVB

1 TPID-521 Industrial Training 02 weeks 40 1 (S/US)

Fractional credit course/Extra
EAA-521+ Academic Activity 40 1 (S/US)
2 +GROUP A/B/C

Semester-VA
S No Sub Code Subject Name L T P Hrs. Credits
1 PCCS-611 Discrete Mathematics 2 1 0 3 3
2 PCCS-612 Computer Networks 2 1 0 3 3
3 OECS-611 Open Elective-1 3 0 0 3 3
4 OECS-612 Open Elective-2 3 0 0 3 3
5 PECS-611 Professional Elective-1 3 0 0 3 3
6 HSMC-601 Technical Communication 2 0 0 2 2
7 PCCS-613 Computer Networks Lab 0 0 4 4 2
8 HSMC-602 Technical Communication Lab 0 0 2 2 1
Total 15 2 6 23 20

Semester-V B
Fractional credit course/Extra
1 EAA-611+ Academic Activity 40 1 (S/US)
+GROUP A/B/C

Semester-VI A
S No Sub Code Subject Name L T P Hrs. Credits
1 PCCS-621 Design and Analysis of Algorithm 2 1 0 3 3
Automata Theory and Formal
2 PCCS-622 2 1 0 3 3
Languages
3 OECS-621 Open Elective-3 3 0 0 3 3
4 OECS-622 Open Elective-4 3 0 0 3 3
5 PECS-621 Professional Elective-2 3 0 0 3 3
Engineering Economics and
6 3 0 0 3 3
HSMC-603 Entrepreneurship
Design and Analysis of Algorithm
7 PCCS-623 0 0 4 4 2
Lab
Total 16 2 4 22 20

Semester-VI B
1 TPID-621 Industrial Training 04 weeks 40 2 (S/US)
Fractional credit course/Extra
EAA-622+ Academic Activity 40 1 (S/US)
2 +GROUP A/B/C

3
 Semester-VII
S No Sub Code Subject Name L T P Hrs. Credits
1 PCCS-711 Internet Programming 2 1 0 3 3
2 PCCS-712 Compiler Design 3 1 0 4 4
3 PECS-711 Professional Elective-3 3 0 0 3 3
4 PECS-712 Professional Elective-4 3 0 0 3 3
5 OECS-711 Open Elective-5 3 0 0 3 3
6 PCCS-713 Internet Programming Lab 0 0 4 4 2
7 PRCS-711 Project Stage I and Seminar 0 0 4 4 2
Total 14 2 8 24 20

Semester-VIII
S No Sub Code Subject Name L T P Hrs. Credits
1 PECS-721 Professional Elective-5 3 0 0 3 3
2 PECS-722 Professional Elective-6 3 0 0 3 3
3 PRCS-721 Project Stage II 0 0 12 12 6
Total 6 0 12 18 12
OR
S No Sub Code Subject Name L T P Hrs. Credits
1 INID-721 Internship in Industry 6
2 PRCS-721 Project Stage II 0 0 12 12 6
Total 0 0 12 12 12

4
LIST OF OPEN ELECTIVES
S. No Sub. Code Subject Name L T P Hrs. Credits
1 Open Elective-I 3 0 0 3 3
OECS-611A Software Engineering 3 0 0 3 3
OECS-611B Enterprise Resource Planning 3 0 0 3 3
OECS-611C Cyber Laws and Ethics 3 0 0 3 3
OECS-611D Programming Methodology 3 0 0 3 3
OECS-611E Data Preparation and Analysis 3 0 0 3 3

2 Open Elective-II 3 0 0 3 3
OECS-612A Software Project Management 3 0 0 3 3
OECS-612B Decision Support System 3 0 0 3 3
OECS-612C Computer Networks 3 0 0 3 3
OECS-612D Object Oriented Programming 3 0 0 3 3
OECS-612E Database Management System 3 0 0 3 3

3 Open Elective-III 3 0 0 3 3
OECS-621A Requirement Engineering 3 0 0 3 3
OECS-621B Management Information
3 0 0 3 3
System
OECS-621C System Installation and
3 0 0 3 3
Troubleshooting
OECS-621D Internet Programming 3 0 0 3 3
OECS-621E Database Integrity and Security 3 0 0 3 3

4 Open Elective-IV 3 0 0 3 3
OECS-622A Object Oriented Analysis and
Design 3 0 0 3 3
5
 OECS-622B E-Commerce 3 0 0 3 3
OECS-622C Computer Network Security 3 0 0 3 3
OECS-622D Computer Graphics 3 0 0 3 3
OECS-622E Data Analytics 3 0 0 3 3

5 Open Elective-V 3 0 0 3 3
OECS-711A Software Reliability and Testing 3 0 0 3 3
OECS-711B Human Resource Management 3 0 0 3 3
OECS-711C Client Server Architecture 3 0 0 3 3
OECS-711D Multimedia and Animation 3 0 0 3 3
OECS-711E Data Mining 3 0 0 3 3

6
List of Professional Electives:
Sr.No Sub. Code Subject Name L T P Hrs. Credits
1 Professional Elective-I
PECS-611A Computer Graphics 3 0 0 3 3
PECS-611B Data Mining 3 0 0 3 3
PECS-611C Cyber Laws and Ethics 3 0 0 3 3
PECS-611D Software Engineering 3 0 0 3 3
PECS-611E Enterprise Resource Planning 3 0 0 3 3
PECS-611F Network Operating System 3 0 0 3 3

2 Professional Elective-II
PECS-621A Multimedia and Animation 3 0 0 3 3
PECS-621B Artificial Intelligence 3 0 0 3 3
PECS-621C Mobile Communication 3 0 0 3 3
PECS-621D Software Project Management 3 0 0 3 3
PECS-621E Decision Support System 3 0 0 3 3
Advanced Computer
PECS-621F 3 0 0 3 3
Architecture

3 Professional Elective-III
PECS-711A Image Processing 3 0 0 3 3
PECS-711B Soft Computing 3 0 0 3 3
PECS-711C Computer Network and Security 3 0 0 3 3
PECS-711D Requirement Engineering 3 0 0 3 3
Management Information
PECS-711E 3 0 0 3 3
System
PECS-711F Distributed System 3 0 0 3 3

7
4 Professional Elective-IV
PECS-712A Simulation and Modeling 3 0 0 3 3
PECS-712B Machine Learning 3 0 0 3 3
Adhoc and Wireless Sensor
PECS-712C 3 0 0 3 3
Networks
Object Oriented Analysis and
PECS-712D 3 0 0 3 3
Design
PECS-712E E-Commerce 3 0 0 3 3
PECS-712F Parallel Computing 3 0 0 3 3

5 Professional Elective-V
PECS-721A Digital Signal Processing 3 0 0 3 3

Neural Networks and Deep

PECS-721B 3 0 0 3 3
Learning

PECS-721C Client Server Architecture 3 0 0 3 3

PECS-721D Software Reliability and Testing 3 0 0 3 3

PECS-721E Business Management System 3 0 0 3 3

PECS-721F Cloud Computing 3 0 0 3 3

6 Professional Elective-VI
PECS-722A Python Programming 3 0 0 3 3

PECS-722B Computer Vision 3 0 0 3 3

High Speed Communication

PECS-722C 3 0 0 3 3
Networks

PECS-722D Software Quality Assurance 3 0 0 3 3

PECS-722E Human Resource Management 3 0 0 3 3

PECS-722F Embedded Systems 3 0 0 3 3

8
 MINOR DEGREE

Semester-III

S
Sub Code Subject Name L T P Hrs. Credits
No
1 MDCS-511 Internet Technologies 3 1 0 4 4
Total 3 1 0 4 4

Semester-IV

S
Sub Code Subject Name L T P Hrs. Credits
No
1 MDCS-521 Operating System 3 1 0 4 4
Total 3 1 0 4 4

Semester-V

S
Sub Code Subject Name L T P Hrs. Credits
No
Application development using
1 MDCS-611 3 1 0 4 4
Python
Total 3 1 0 4 4

Semester-VI

S
Sub Code Subject Name L T P Hrs. Credits
No
1 MDCS-621 Artificial Intelligence 3 1 0 4 4
Total 3 1 0 4 4

Semester-VII

S
Sub Code Subject Name L T P Hrs. Credits
No
1 MDCS-711 Soft Computing 3 1 0 4 4
Total 3 1 0 4 4

9
 HONORS DEGREE

Semester-V

S
Sub Code Subject Name L T P Hrs. Credits
No
1 HDCS-611 Data Analytics 3 1 0 4 4
2 HDCS-612 Internet of Things 3 1 0 4 4
Total 6 2 0 8 8

Semester-VI

S
Sub Code Subject Name L T P Hrs. Credits
No
1 HDCS-621 Optimization Techniques 3 1 0 4 4
Total 3 1 0 4 4

Semester-VII

S
Sub Code Subject Name L T P Hrs. Credits
No
Cryptography and Network
1 HDCS-711 3 1 0 4 4
Security
Total 3 1 0 4 4

Semester-VIII
S
Sub Code Subject Name L T P Hrs. Credits
No
1 PHCS-721 Project Hon's 0 0 08 08 4
Total 0 0 08 08 4

10
SEMESTER-I

11
Title of the course : Elements of Computer Engineering
Subject code : ESCS-401
Weekly load : 2 Hrs LTP 2-0-0
Credits :2

Course Outcomes: At the end of the course, the student will be able to:
CO1 Get acquainted with basics of computer system along with its various components
CO2 Know about various operating systems and memory
CO3 Study the C programming basics and learn the concept of operators
CO4 Understand the concept of decision statements and loops
CO5 Learn the use of functions, pointers, arrays, structures, union etc. for modular programming

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 1 3 1 3 0 0 0 3 1 3 2 3 3
CO2 3 1 3 3 3 0 0 0 3 2 3 2 3 3
CO3 3 2 3 1 3 3 0 0 2 2 3 2 3 3
CO4 3 2 3 3 3 3 0 0 3 3 3 3 3 3
CO5 3 3 3 3 3 3 0 0 3 3 3 3 3 3

Theory
Unit Main Topics Course outlines Lecture(
s)
Unit-1 1. Introduction Introduction and characteristics of computer system, 04
Generations, Classifications, Applications, Central Processing
Unit, Memory, I/O devices, Introduction to operating system
and its types, Algorithm, Flowchart.
2. C Basic program construction, Structure of a C program, 04
Programming Compilation process, preprocessor directives, Comments, Data
Basics types, Type conversions, Operators - Arithmetic, Relational,
Logical, Conditional, Increment/decrement, Library functions,
Header files.
3. Loops and for loop, while loop, do loop, Various forms of 04
Decision ifstatement,switch statement, break statement, continue state
Statements ment, go to statement.
4. Functions Defining functions, Passing arguments to functions, Returning 04
values from functions, Reference arguments, Storage classes.

12
Unit-2 5. Pointers Pointers, Pointers to pointers, Declaring and initializing 04
pointers, Pointer expressions, Pointers and arrays, Pointers and
strings.
6. Arrays Arrays and strings, Declaring an array, Initializing arrays, 04
Accessing the array elements, Working with multidimensional
arrays, Declaring and initializing string variables, String
handling functions.
7. Structures Declaring and initializing a structure, Accessing the members of 04
and Union a structure, Nested structures, Array of structures, Using
structures in functions, Pointers and structures, Declaring and
initializing a union.
8. Files Reading and writing to text and binary files, Character I/O, 04
String I/O, File pointers, Error handling, Redirection, Command
line arguments.
Total=32

Recommended Books:
1. Raja Raman V., Fundamentals of Computers, PHI.
2. Kernighan Brian W. and Ritchie, Dennis M., The C Programming language, Dorling
Kingsley.
3. Balagurusamy E., Programming in ANSI C, TMH Publications

13
Title of the course : Elements of Computer Engineering Lab
Subject Code : ESCS-402
Weekly load : 4 Hrs LTP 0-0-4
Credit :2

Course Outcomes: At the end of the course, the student will be able to:
CO1 Solve basic mathematical problems using programming
CO2 Demonstrate the use of loop statements to solve iteration problems
CO3 Implement the concept of modular programming and recursion using functions
CO4 Implementation of decision statements and loops
CO5 Create a file and add, append or retrieve data using file handling

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 2 3 3 0 0 3 3 3 2 3 2
CO2 3 3 3 2 2 2 0 0 3 3 3 2 3 2
CO3 3 3 3 2 3 2 0 0 3 2 3 3 3 3
CO4 3 3 3 3 3 3 0 0 3 2 3 3 3 3
CO5 3 3 3 3 3 3 0 0 3 3 3 3 3 3

LIST OF PRACTICALS
1. WAP to find multiplication and addition of two numbers.
2. WAP to swap two numbers without using third variable.
3. WAP to calculate temperature in Fahrenheit to Celsius using formula C= (F- 32)/1.8.
4. WAP to calculate Sum and Average of N numbers using sequence of statements.
5. WAP to implement the concept of switch and break statement.
6. WAP to find maximum out of 3 numbers a, b &c using Control Statements (if, else, nested if,
nested else).
7. WAP to find minimum out of 3 numbers a, b & c using Control Statements (if, else, nested if, else)
8. WAP to find whether entered number is palindrome or not.
9. WAP to check entered number is even or odd.
10. WAP to find whether entered year is leap year or not.
11. WAP to find factorial of positive integer using for loop.

14
12. WAP to input a number from 1 to 10 and print its table.
13. WAP to print all the number between 1 to 100 which are divisible by7 using the concept of loops.
14. WAP to generate Fibonacci series up to n using loops.
15. WAP to implement the concept of continue statements.
16. Write a program to calculate area of circle using function.
17. Write an iterative function to calculate factorial of given number.
18. Write a recursive function to calculate factorial of given number
19. WAP to find even & odd up to a given limit using the concept of array and loops.
20. WAP to calculate the addition of one dimensional array elements.
21. WAP to reverse a string.
22. WAP to find addition of two matrix of n*n order using the concept of 2 dimensional array
23. WAP to find multiplication of two matrix of n*n order using the concept of 2 dimensional
array.
24. WAP to study the concept of structure.
25. WAP to study the concept of union.
26. Write a program to study the concept of pointer.
27. WAP to create a data file, retrieve data from the file.
28. WAP to write and retrieve records from a file.
Note: The above mentioned list of experiments is suggested list. Teacher may add more programs/
experiments as per requirement.

15
SEMESTER-II

16
Title of the course : Elements of Computer Engineering
Subject code : ESCS-401
Weekly load : 2 Hrs LTP 2-0-0
Credits :2

Course Outcomes: At the end of the course, the student will be able to:
CO1 Get acquainted with basics of computer system along with its various components
CO2 Know about various operating systems and memory
CO3 Study the C programming basics and learn the concept of operators
CO4 Understand the concept of decision statements and loops
CO5 Learn the use of functions, pointers, arrays, structures, union etc. for modular programming

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 1 3 1 3 0 0 0 3 1 3 2 3 3
CO2 3 1 3 3 3 0 0 0 3 2 3 2 3 3
CO3 3 2 3 1 3 3 0 0 2 2 3 2 3 3
CO4 3 2 3 3 3 3 0 0 3 3 3 3 3 3
CO5 3 3 3 3 3 3 0 0 3 3 3 3 3 3

Theory
Unit Main Topics Course outlines Lecture(
s)
Unit-1 1. Introduction Introduction and characteristics of computer system, 04
Generations, Classifications, Applications, Central Processing
Unit, Memory, I/O devices, Introduction to operating system
and its types, Algorithm, Flowchart.
2. C Basic program construction, Structure of a C program, 04
Programming Compilation process, preprocessor directives, Comments, Data
Basics types, Type conversions, Operators - Arithmetic, Relational,
Logical, Conditional, Increment/decrement, Library functions,
Header files.
3. Loops and for loop, while loop, do loop, Various forms of if 04
Decision statement,switch statement, break statement, continue state
Statements ment, go to statement.
4. Functions Defining functions, Passing arguments to functions, Returning 04
values from functions, Reference arguments, Storage classes.

17
Unit-2 5. Pointers Pointers, Pointers to pointers, Declaring and initializing 04
pointers, Pointer expressions, Pointers and arrays, Pointers and
strings.
6. Arrays Arrays and strings, Declaring an array, Initializing arrays, 04
Accessing the array elements, Working with multidimensional
arrays, Declaring and initializing string variables, String
handling functions.
7. Structures Declaring and initializing a structure, Accessing the members of 04
and Union a structure, Nested structures, Array of structures, Using
structures in functions, Pointers and structures, Declaring and
initializing a union.
8. Files Reading and writing to text and binary files, Character I/O, 04
String I/O, File pointers, Error handling, Redirection, Command
line arguments.
Total=32

Recommended Books:
1. Raja Raman V., Fundamentals of Computers, PHI.
2. Kernighan Brian W. and Ritchie, Dennis M., The C Programming language, Dorling
Kingsley.
3. Balagurusamy E., Programming in ANSI C, TMH Publications

18
Title of the course : Elements of Computer Engineering Lab
Subject Code : ESCS-402
Weekly load : 4 Hrs LTP 0-0-4
Credit :2

Course Outcomes: At the end of the course, the student will be able to:
CO1 Solve basic mathematical problems using programming
CO2 Demonstrate the use of loop statements to solve iteration problems
CO3 Implement the concept of modular programming and recursion using functions
CO4 Implementation of decision statements and loops
CO5 Create a file and add, append or retrieve data using file handling

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 2 3 3 0 0 3 3 3 2 3 2
CO2 3 3 3 2 2 2 0 0 3 3 3 2 3 2
CO3 3 3 3 2 3 2 0 0 3 2 3 3 3 3
CO4 3 3 3 3 3 3 0 0 3 2 3 3 3 3
CO5 3 3 3 3 3 3 0 0 3 3 3 3 3 3

LIST OF PRACTICALS
1. WAP to find multiplication and addition of two numbers.
2. WAP to swap two numbers without using third variable.
3. WAP to calculate temperature in Fahrenheit to Celsius using formula C= (F- 32)/1.8.
4. WAP to calculate Sum and Average of N numbers using sequence of statements.
5. WAP to implement the concept of switch and break statement.
6. WAP to find maximum out of 3 numbers a, b &c using Control Statements (if, else, nested if,
nested else).
7. WAP to find minimum out of 3 numbers a, b & c using Control Statements (if, else, nested if, else)
8. WAP to find whether entered number is palindrome or not.
9. WAP to check entered number is even or odd.
10. WAP to find whether entered year is leap year or not.
11. WAP to find factorial of positive integer using for loop.

19
12. WAP to input a number from 1 to 10 and print its table.
13. WAP to print all the number between 1 to 100 which are divisible by7 using the concept of loops.
14. WAP to generate Fibonacci series up to n using loops.
15. WAP to implement the concept of continue statements.
16. Write a program to calculate area of circle using function.
17. Write an iterative function to calculate factorial of given number.
18. Write a recursive function to calculate factorial of given number
19. WAP to find even & odd up to a given limit using the concept of array and loops.
20. WAP to calculate the addition of one dimensional array elements.
21. WAP to reverse a string.
22. WAP to find addition of two matrix of n*n order using the concept of 2 dimensional array
23. WAP to find multiplication of two matrix of n*n order using the concept of 2 dimensional
array.
24. WAP to study the concept of structure.
25. WAP to study the concept of union.
26. Write a program to study the concept of pointer.
27. WAP to create a data file, retrieve data from the file.
28. WAP to write and retrieve records from a file.
Note: The above mentioned list of experiments is suggested list. Teacher may add more programs/
experiments as per requirement.

20
SEMESTER-III

21
 Title of the course : Digital Electronics
Subject Code : PCCS-511
Weekly load : 3 Hrs LTP 3-0-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Perform conversions among different number systems, became familiar with basic logic
gates and understand Boolean algebra.
CO2 Simplify Boolean functions by using basicBoolean properties &K-Map.
CO3 Design of combinational circuits such as MUX, DEMUX, Encoder, Decoder etc.
CO4 Understand the design of sequential Circuits such as Flip-Flops, Registers, and Counters.
CO5 Obtain a basic level of Digital Electronics knowledge and set the stage to perform the analysis
and design of Complex Digital electronic Circuits.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO’s)/ Program Specific Outcomes (PSO’s)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 1 2 2 2 1 0 0 2 0 0 2 2 2
CO2 3 2 3 2 2 2 0 0 2 0 0 2 2 2
CO3 3 3 3 2 2 2 0 0 3 3 3 2 2 2
CO4 3 3 3 2 2 3 0 0 3 3 3 3 3 3
CO5 3 3 3 2 2 3 0 0 3 3 3 3 3 3

Theory

Unit Main Topics Course outlines Lecture(s)

1. Introduction, Introduction to the concept of Digital Electronics, Number 07
Number Systems systems, binary number system, octal number system,
and codes hexadecimal number system, signed and unsigned numbers,
Arithmetic using Different Number Systems; Representation
of Binary Number in Sign-Magnitude, Sign 1's & 2's
Complement Notation; Rules for Addition and Subtraction
with Complement.

2. Introduction BCD, ASCII, Gray and other Codes. 05

Unit-1 to various types
of codes
3. Boolean Simplification of Boolean Function using Boolean theorems; 07
Function and its Canonical and Standard Forms(SOP and POS) for Boolean
Minimization Functions; Objectives of the Minimization Procedures;

22
 Karnaugh Map Method; Don’t Care Conditions, Realization
of Boolean Functions Using Only NAND and NOR Gates.

4. Combinational Half & Full Adder; Half & Full Subtractor; Parity Generator 05
Logic Circuits and Checker; Code Converters; Carry look ahead generator;
Using Discrete Binary Multiplier; Majority Circuits, Magnitude
Logic Gates Comparator.

5. Combinational Binary Parallel; BCD Adder; Encoder, Priority Encoder, 07

Logic Using Decoder; Multiplexer and De-multiplexer Circuits;
MSI Circuits Implementation of Boolean Functions Using Decoder and
Multiplexer; ALU; BCD to 7-Segment Decoder.
6. Introduction Basic Concepts of Sequential Circuits; Cross Coupled SR 07
to Flip-flop Flip-Flop Using NAND or NOR Gates; D-Type and Toggle
Circuits Flip-Flops JK Flip-Flop & race Condition; Clocked Flip-
Flops; Truth Tables & Excitation Tables for Flip-Flops;
Unit-2 Edge & Level Triggering; Master Slave Configuration; Edge
triggered D flip-flop; Flip-Flops With Preset & Clear.

7. Sequential Sequential circuit; state table and state diagram; Design 06

Logic Circuit procedure; Basic Concepts of Counters and Registers; Shift
Design & Left and Right Register; Registers With Parallel Load; SIPO
Counters and PISO

8. Ripple Up Down and Mod-N ripple counters; Design of 04

(asynchronous) Synchronous Counter Using State Diagrams and Table; BCD
counters Counters; Modulo-N Counter; Up Down Counter; Ring
counter.

Total=48
Recommended Books:
1. Morris Mano: “Digital Logic and Computer Design”, PHI.
2. Bartee Thomas: “Digital Computer Fundamentals”, McGraw-Hill.
3. Richard Sandige: “Modern Digital Design”, McGraw-Hill.
4. Taub and Schilling: “Digital Integrated Electronics”, McGraw-Hill.
5. Fletcher W.I.: “Engineering Approach to Digital Design”, PHI.
6. Malvino& Leech: “Digital Principles & Applications”, TMH.
7. J. F. Wakerly: “Digital design: principles and practice package”, Pearson

23
 Title of the course : Object Oriented Programming
Subject Code : PCCS-512
Weekly load : 3 Hrs LTP 2-1-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand the difference between object oriented programming and procedural programming
CO2 Choose data types and structures to solve mathematical and scientific problems
CO3 Write programs using C++ features such as composition of objects, operator overloading,
inheritance, polymorphism etc.
CO4 Simulate the real world problems into object-oriented programs
CO5 Illustrate the process of data file manipulations using C++

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
CO's PO PSO1
PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO2
1
CO1 3 2 2 1 0 0 0 0 0 0 0 2 3 1
CO2 3 3 3 3 3 3 0 0 3 3 3 3 3 3
CO3 3 3 3 3 3 3 0 0 3 3 3 3 3 3
CO4 3 3 3 3 3 3 0 0 3 3 3 3 3 3
CO5 3 3 3 3 3 3 0 0 3 3 3 3 3 3

Theory
Unit Main Topics Course outlines Lecture(s)
1. Introduction Basic concepts of object-oriented programming, Characteristics 06
of object-oriented programming, Comparison between
procedural programming paradigm and object-oriented
programming paradigm.
2. Classes and Specifying a class, Creating class objects, Accessing class 06
Objects members, Access specifiers – public, private, and protected,
Unit-1 Static members variables and functions, Static class objects, The
const keyword, Friend functions, Friend classes, Empty classes,
Nested classes, Local classes, Abstract classes, Container
classes.
3. Constructors Need for constructors and destructors, Default constructor, 06
and Parameterized constructor, Copy constructor, Dynamic
Destructors constructors, Destructors, Constructors and destructors with
static members.

24
 4. Inheritance Introduction, Defining derived classes, Forms of inheritance, 06
Ambiguity in multiple and multipath inheritance, Virtual base
class, Object slicing, Overriding member functions, Object
composition and delegation, Order of execution of constructors
and destructors.
5. Virtual Concept of Binding - Early binding and late binding, Virtual 06
Functions and functions, Pure virtual functions, Abstract classes, Virtual
Polymorphism destructors & polymorphism.
6. Operator Defining operator overloading, Rules for overloading operators, 06
Overloading Overloading of unary operators and binary operators,
and Type Overloading of new and delete operators, Type conversion -
Conversion Basic type to class type, Class type to basic type, Class type to
another class type.
7. Pointers and Understanding pointers, Accessing address of a variable, 06
Unit-2 Dynamic Declaring & initializing pointers, Accessing a variable through
Memory its pointer, Pointer arithmetic, Pointer to a pointer, Pointer to a
Management function, Dynamic memory management - new and
delete Operators, Pointers and classes, Pointer to an object,
Pointer to a member, this Pointer, Self-referential classes,
Possible problems with the use of pointers - Dangling/wild
pointers, Null pointer assignment, Memory leak and allocation
failures.
8. Exception Exception and its types, Exception handling mechanisms, File 06
Handling and streams, Hierarchy of file stream classes, Error handling during
Managing Data file operations, Reading/Writing of files, Accessing records
Files randomly, Updating files, Data formatting in memory buffers.
Total=48

Recommended Books:
1. Lippman, S.B. and Lajoie, J., C++Primer, Pearson Education.
2. Stroustrup, Bjarne, The C++ Programming Language, Pearson Education.
3. YashwantKanetkar, Let Us C++, BPB
4. Robert Lafore, Turbo C++, Pearson India

25
 Title of the course : Data Structures and Algorithms
Subject Code : PCCS-513
Weekly load : 3Hrs LTP 2-1-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Introduce various techniques for representation of the data in the real world
CO2 To design and implement various data structure algorithms
CO3 Familiar with the utilization of the data structures in problem solving
CO4 Learn how to analyse the time and space requirements of a given algorithm
CO5 To develop application using various data structure algorithms.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 3 2 0 0 0 2 0 0 0 1 0
CO2 3 3 3 3 3 2 0 0 3 3 3 2 3 2
CO3 3 3 3 3 3 2 0 0 3 3 3 3 3 3
CO4 3 3 3 3 3 2 0 0 3 3 2 2 3 3
CO5 3 3 3 3 3 3 0 0 3 3 2 3 3 3

Theory
Unit Main Topics Course Outlines Lecture(s)
1. Introduction Basic concepts and notations; Data structures and data 04
structure operations; Mathematical notation and functions;
Algorithmic complexity, time-space trade off and recursion.

2. Arrays Introduction of an array, Representation of an array, One- 08

Unit-1 dimensional array , Multidimensional arrays, Address
calculation,String processing, memory representation of a
strings, operation on a string, Pattern matching.
3. Linked List Introduction; Basic concepts of linked list – memory 06
representation, building a linked list, traversing, insertion,
deletion, searching; Doubly linked list; Merging two lists;
Header linked list; Circular linked list.
4. Stacks & Stack, Representation of stack, Implementation of stack; 06
Queues Polish notation; Queues; Implementation of queues; Circular
queues; Double ended queues; Priority queues.

26
 5. Trees Binary trees; Complete binary trees; Extended binary tree; 06
Representation of binary tree; Insertion and deletion from
the binary tree; Tree traversals using in-order, pre-order and
Unit-2 post-orders; Applications of binary tree; search tree; Heap
tree, Balanced binary tree; B-trees.
6. Graphs Basic concepts &definitions; Representation of graph – 06
Adjacency list, Adjacency matrix; Path matrix, Graph
traversal– BFS, DFS; Shortest path algorithms.
7. Sorting & Linear search; Binary search; Bubble sort; Insertion sort; 06
Searching Quick sort; Selection sort; Merge sort; Heap sort; Selection
sort, Hashing Techniques.
8. File File streams, Hierarchy of file stream classes, Error handling 06
Handling during file operations, Reading/Writing of files, Accessing
records randomly, Updating files,
Total=48

Recommended Books:
1. Lipschutz,Schaum Series, Data Structures ,TMH.
2. A.M. Tanenbaum, Data Structures using C and C++, Pearson Education.
3. Trembley Sorenson, Introduction to Data Structures with Applications, TMH.

27
Title of the course : Digital Electronics Lab
Subject Code : PCCS-514
Weekly load : 2 Hrs LTP 0-0-2
Credit :1

Course Outcomes: At the end of the course, the student will be able to:
CO1 Implement the various logic gates such as AND, OR, NOT, NAND, NOR, XOR
CO2 Simplify the given expression and realize it using basic gates and universal gates.
CO3 Design and implement the various combinational such as adder and subtractorusing logic gates
CO4 Design and implement the multiplexer and demultiplexer circuits using NAND gates
CO5 Design and implement the various sequential circuits such as flip-flops using logic gates.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO’s)/ Program Specific Outcomes (PSO’s)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 3 2 2 2 0 0 2 2 2 2 2 2
CO2 3 2 2 2 2 2 0 0 2 2 2 2 2 2
CO3 3 2 2 1 2 2 0 0 3 2 2 3 3 2
CO4 3 3 3 2 2 2 0 0 3 3 3 3 3 3
CO5 3 3 3 2 2 2 0 0 3 3 3 3 3 3

LIST OF PRACTICALS
1. Study of Logic gates- AND, OR, NOT,NAND,NOR,XOR on different inputs.
2. To simplify the given expression and to realize it using Basic gates and Universal gates.
3. Design and realization of Half adder/Substractor using NAND gates.
4. Design and realization of Full adder using Logic gates.
5. Realization of R-S Flip-flop.
6. Realization of J-K Flip-flop.
7. To design and set up the following circuit
a. 4:1 Multiplexer (MUX) using only NAND gates.
b. 1:4 Demultiplexer(DE-MUX) using only NAND gates.

28
Note: The above mentioned list of experiments is suggested list. Teacher may add more programs/
experiments as per requirement.

Title of the course : Object Oriented Programming Lab

Subject Code : PCCS-515
Weekly load : 4 Hrs LTP 0-0-4
Credit :2

Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand the basic concepts of writing a program in C++.
CO2 Apply various object-oriented features like classes, inheritance and polymorphism to solve
various computing problems using C++ language.
CO3 Solve mathematical and scientific problems using object oriented concepts.
CO4 Understanding the concepts of pointers and dynamic memory managements.
CO5 Create a file and perform the operation like addition, deletion, append or retrieve data using
file handling

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 2 3 2 2 0 0 3 2 1 3 3 2
CO2 3 3 2 3 3 2 0 0 3 2 2 2 3 2
CO3 3 3 2 3 3 3 0 0 3 3 2 2 3 2
CO4 3 3 3 3 3 2 0 0 3 3 2 2 3 2
CO5 3 3 3 3 3 3 0 0 3 3 3 3 3 3

LIST OF PRACTICALS
1. WAP to check a given number is even or odd using function.
2. WAP to generate Fibonacci series up to n using loops
3. Write an iterative function to calculate factorial of given number.
4. Write a recursive function to calculate factorial of given number.
5. Write a program using function to calculate the addition of array elements.
6. Write a program that uses a class where the member functions are defined inside a class.
7. Write a program that uses a class where the member functions are defined outside a class.
8. WAP to create a Class Employee with the following specifications:

29
 private members: name [20] characters,
Employee_ ID int,
Basic, DA, HRA Float
salary Float
calculate_sal() function computes the salary and returns it. Salary is the
sum of Basic, DA and HRA.
public members: Readdata() function accepts the data values and invokes the calculate()
function.Display () function shows the results on screen.

9. Write a program to demonstrate the use of static data members.

10. Write a program to demonstrate the use of const data members.
11. Write a program to demonstrate the use of zero argument andparameterized constructors.
12. Write a program to demonstrate the use of copy constructors.
13. Write a programs which show the concept of Single/Multiple/Multilevel/Hybrid Inheritance.

14. Write a program to show the concept of function overloading.

15. Write a program to demonstrate the compile time polymorphism.
16. Write a program to demonstrate the runtime polymorphism.
17. Write a program to demonstrate the overloading of binary arithmetic operators.
18. Write a program to demonstrate the overloading of increment anddecrement operators.
19. Write a program to demonstrate the typecasting of basic type to class type.
20. Write a program to demonstrate the typecasting of class type to basic type.
21. Write a program to demonstrate the typecasting of class type to class type.
22. Write a program to show the concept of pointer.
23. Write a program to illustrate the use of friend function.
24. Write a program to copy the contents of a file to another file.
25. Write a program to demonstrate the reading and writing of mixed type of data in file.
26. Write a program to demonstrate the reading and writing of objects in file.

Note: The above mentioned list of experiments is suggested list. Teacher may add more programs/
experiments as per requirement.

30
Title of the course : Data Structures and Algorithms
Subject Code : PCCS-516
Weekly load : 4Hrs LTP 0-0-4
Credit :2
Course Outcomes: At the end of the course, the student will be able to:
CO1 To impart the basic concepts of data structures and algorithms
CO2 Design, implement, test, and debug programs using a variety of data structures including
linked lists, stacks, queues, binary search trees, heaps and graphs
CO3 Familiar with the utilization of the data structures in problem solving
CO4 Implement and know when to apply standard algorithms for searching and sorting
CO5 Learn to choose the appropriate data structure and algorithm design method for a specified
application

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 1 0 0 0 1 0 0 2 2 2
CO2 3 3 3 2 3 2 0 0 3 3 3 2 3 3
CO3 3 3 3 2 3 2 0 0 2 2 3 2 3 3
CO4 3 3 3 3 3 3 0 0 3 2 2 3 3 2
CO5 3 3 3 3 3 3 0 0 3 3 3 3 3 3

LIST OF PRACTICALS
1) WAP that insert an element in beginning of Linear Link List.
2) WAP that delete an element from the beginning of the Linear Link List.
3) WAP that delete an element from the end of the Linear Link List.
4) WAP that delete an element after a given element of the given Linear Link List.
5) WAP that reverse the element of the Linear Link List.
6) WAP that concatenate two Linear Linked List.
7) WAP to Insert and remove the Top element of Stack.
8) WAP to insertan element at the end of queue and remove the first element of the queue.
9) WAP to insert and delete an element in a circular queue.

31
 10) WAP of implementation of queue using stack.
11) WAP to create a Tower of Hanoi.
12) WAP to illustrate the implementation of Binary Search Tree.
13) WAP to sort an array of integer in Ascending Order using Bubble Sort.
14) WAP to sort an array of integer in Ascending Order using Insertion Sort.
15) WAP to sort an array of integer in Ascending Order using Quick Sort.
16) WAP to search an element using Linear Search Method.
17) WAP to search an element using Binary Search Method.

Note: The above mentioned list of experiments is suggested list. Teacher may add more programs/
experiments as per requirement.

32
 Subject Name : Internet Technologies

Subject Code : MDCS-511

Weekly load : 4Hrs LTP 3-1-0
Credit :4

Course Outcomes: At the end of the course, the student will be able to:
CO1 Understanding of Web fundamentals and its working around the world
CO2 Understanding and Web Development skills using different flavours of HTML along with
CSS technology and interactive validations of different elements using JavaScript/ vbscript
CO3 Understanding E-commerce market and being aware of prime security issues while
developing applications
CO4 Understanding the programming skills using java as Internet programming tool,
developing client-server applications, Swings & Events Exception Handling, Servletand
JDBC applications
CO5 The Practicability of all above contents is covered in Lab-Sessions

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 2 1 2 2 2 0 0 1 2 2 2 3 2
CO2 2 3 3 2 3 2 0 0 3 3 3 2 3 2
CO3 2 1 1 2 2 2 0 0 3 2 2 2 3 3
CO4 3 3 3 2 3 2 0 0 3 2 2 2 3 3
CO5 3 3 3 3 3 2 0 0 3 3 3 2 3 3

Theory

Unit Main Topics Course outlines Lecture(s)

1. Introduction Understanding Web fundamentals, URL, ISP, W3C – 08
Architecture, Evolution, Website Designing strategies, major
issues in Web Development, Web Browsers, Web-Servers,
Search Engines.

33
 2. E-Commerce Definition, Types of E-commerce, merits & demerits, 08
Problems and issues related to Internet based E-commerce,
Unit-1 M-Commerce, E-commerce laws & forms of agreements, E-
governance & role of government.

3. HTML5 Features of HTML5, Revisiting basic tags in HTML5, New 08

& markup elements of HTML5, New Forms, Tables, Images,
CSS3 List & Links, Audio & Video attributes of HTML5,
Introduction to VB Script – variables, arrays, looping &
conditional statements, printing text using Vbscript.
Enhancing web page features using CSS3, Advanced Java
script.
4. Security E-commerce & security, Web security schemes, 08
Cryptography, VPN, Firewalls, IDS.
Unit-2 5. Advanced Core Java and advanced Java-AWT GUI components, 08
JAVA Swings & Events Exception Handling JDBC.
6. Server-side Introduction to XML, XML-DTD, JSP, Servlet technology, 08
Programming J2EE &RMI.
Total=48

Recommended Books:
1. Uttam K. Roy, Web technologies; Oxford.
2. Zak Ruvalcaba& Anne Boehm, Murach’s HTML5 and CSS3; SPD.
3. FiruzaAibara, HTML5 for beginners; SPD.
4. Jim Farley and William Crawford, Java Enterprise in a nutshell; SPD-O’reilly.
5. Michael Morrison, Head First Java Script; SPD-O’reilly.

34
SEMESTER-IV

35
 Title of the course : Computer Organization and Architecture
Subject Code : PCCS-521
Weekly load : 3Hrs LTP 3-0-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand the evolution and trends of Computer Architecture and Organization
CO2 Understand the micro-operations executed in the system and thereby construction of ALU
CO3 Understand the instruction format, classification and execution in the system
CO4 Understand the organization of CPU and Control Unit
CO5 Understand the process of input/output in the system which includes the interfacing of I/O
devices

CO/PO Mapping : (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 2 2 2 2 2 0 0 2 2 2 2 2 2
CO2 2 2 2 2 2 2 0 0 2 2 2 2 3 2
CO3 1 2 2 2 2 2 0 0 2 2 2 2 2 2
CO4 3 2 2 2 3 2 0 0 2 3 2 2 2 3
CO5 2 2 2 2 2 2 0 0 2 3 2 2 2 2

Theory

Unit Main Topics Course outlines Hour(s)

1. Introduction Computer architecture, organization and designing. Historical 06
architectural trends, Data representation: Number system and
conversion, compliments, Fixed point Representation, floating
point representation,Computer arithmetic(addition, subtraction
and multiplication),

36
Unit-1 2. Register Register transfer language, Register transfer language, Bus & 06
Transfer memory transfer, arithmetic, logic and shift micro-operations,
Language and constructing an arithmetic logic shift unit.
Micro-
Operations
3. Basic Computer registers, Instructions, Instruction codes, Instruction 07
Computer formats, Instruction classifications, Memory reference
Architecture instruction, Register reference instruction, Input/Output&
and Design Interrupts Instruction set completeness, Instruction Execution
cycle, Interrupts, interrupt cycle, Timing & control unit,
complete computer description & design of basic computer
4. Central General Register Organization. Stack Organized CPU. 05
Processing Addressing Modes. Data Transfer and Manipulation. RISC Vs
Unit CISC. Introduction to Parallelprocessing and Pipeline
Processing
5. Control Hardwired and micro-programmed control organization. 06
Organization Horizontal and Vertical Microprogramming.
6. Input Output I/O interfacing, Asynchronous data transfer, Modes of transfer, 06
Organization Priority interrupt, DMA, Input Output processor
7. Memory Memory Systems: principle of locality, principles of memory 06
Unit-2 Organization hierarchy Caches, associative memory, main memory, Virtual
memory, Paging and Segmentation
8. Case Studies Case studies of the contemporary architecture for processors of 06
families like Intel and AMD

Total=48

Recommended Books:
1. Hamacher, Vranesic “Computer Organization”, McGraw Hill.
2. Stalling , “Computer Organization, TMH.
3. John. P. Hays, “Computer Architecture and Organization,McGraw Hill.
4. Carpirdli, “Computer Architecture & Organization, Pearson Education Asia
5. M. Mano, “Computer Architecture & Organization”, PHI

37
 Title of the course : Operating System
Subject Code : PCCS-522
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Learn basic concepts of Operating System along with implementation of scheduling
algorithms in process management
CO2 Analyze critical section problem in Inter process communication and use of memory
management techniques
CO3 Implement page replacement algorithms and use virtual memory concepts
CO4 Know about file structure, file management and disk management
CO5 Learn the concept of deadlock and implement various algorithms used for its detection and
recovery

CO/PO Mapping : (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 3 1 3 2 0 0 2 2 2 2 2 2
CO2 3 2 2 2 2 2 0 0 2 3 3 2 3 3
CO3 3 3 2 2 0 3 0 0 3 2 2 2 3 2
CO4 3 2 2 2 2 2 0 0 3 3 2 2 2 2
CO5 3 2 1 2 0 2 0 0 3 2 2 2 3 3

Theory

Unit Main Topics Course outlines Lecture(s)

Unit-1 1. Basic Concept Evolution of operating system, operating system 06
of Operating classifications, structure of operating system, types of
System operating system (Batch, Multiprogramming,

38
 Multiprocessing, Time-sharing systems and real time
systems etc.), concept of virtual machine, case study on
UNIX and windows operating system.

2. Process Process overview, process states, PCB, levels of scheduler 06

Management and CPU scheduling algorithms, multiple-processor
scheduling, scheduling criteria, threads, process scheduling
objects and techniques.
3. Inter-process Concurrent processes - The Critical Section & Mutual 06
Communication Exclusion problem - Algorithms - Semaphores, Critical
Region, Conditional Critical Region, Race condition,
Monitors, Messages passing - Examples in Contemporary
OS - Classical Process Co-ordination Problems
4. Memory Memory hierarchy, static and dynamic memory allocation, 06
Management overview of swapping, multiple partitions, contiguous and
non-contiguous memory allocation, internal and external
fragmentation, concepts of paging, segmentation.
Unit-2 5. Virtual Virtual Memory Concepts - Demand paging - Performance - 08
Memory Fragmentation & Compaction. Concept of page fault and
dirty page/ dirty bit, Page replacement and Allocation
algorithms -Memory Protection - System Calls –
Linux/Windows Virtual Memory Techniques.
6. File File concepts, Access methods, Directory structure, File 08
Management protection, File System structure, Allocation methods,
Secondary storage management - Disk structure, Disk
scheduling algorithms, Disk management, Swap-space
management, Disk reliability.
7. Deadlock Introduction to deadlock, necessary and sufficient 08
conditions, deadlock prevention & avoidance, Bankers
algorithm, deadlock detection & recovery.

Total=48

Recommended Books:
1. Silberschatz A & Galvin, Operating System Concepts, John Wiley & Sons
2. W. Stallings, Operating Systems: Internals and Design Principles, Pearson Pub.
3. Andrew S Tanenbaum, Operating Systems - Design and Implementation, PHI
4. Crawley, Operating Systems - An Object oriented Approach, McGraw Hill

39
 Title of the course : Database Management System
Subject Code : PCCS-523
Weekly load : 3 Hrs LTP 2-1-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Gain a good understanding of the architecture and functioning of database management
systems as well as associated tools and techniques
CO2 Understand principles of data modelling using entity relationship to develop a good database
design and normalization techniques to normalize a database
CO3 Understand and use structured query language to query, update, and manage a database
CO4 Evaluate and optimize queries
CO5 Understand transaction processing, backup and recovery techniques

CO/PO Mapping : (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation):

Programme Outcomes (POs)
COs PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 2 2 2 0 0 2 2 2 3 3 2
CO2 3 2 2 2 2 2 0 0 2 2 2 2 2 2
CO3 2 2 3 2 2 2 0 0 2 2 2 2 3 2
CO4 2 3 2 3 2 2 0 0 2 2 2 2 2 3
CO5 3 2 2 2 3 3 0 0 3 3 3 2 3 3

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Introduction: Data, data processing requirement, desirable characteristics of 04
an ideal data processing system, traditional file based system,
its drawback, concept of data dependency, Def of database,
database management system.

40
 2. Database 3-schema architecture: external-conceptual-internal, database 06
concepts terminology, benefits of DBMS, Database development
process - conceptual data modeling, logical database design,
physical database design, database implementation, database
maintenance.
3. Database Conceptual data modeling using E-R data model -entities, 06
Analysis attributes, relationships, generalization, specialization,
specifying constraints: total and partial participation. 5 – 6
practical problems based on E-R data model.
4. Database Logical database design and relational data model: 08
Design Introduction to relational database theory: def of relation,
relational model operators, relational model integrity rules,
Normalization- 1NF, 2NF, 3NF, 4NF, BCNF & practical
problems based on these forms. Denormalization
Unit-2 5. Database Introduction to SQL, DDL aspect of SQL, DML aspect of 08
Implementati SQL – update, insert, delete & various form of SELECT-
on simple, using special operators, aggregate functions, group by
clause, sub query, joins, co-related sub query, union clause.
6. Query Introduction, Query plan,ways of evaluating a given query, 06
optimization Overview of optimization process, expression transformation,
database statistics, A divide and conquer strategy.
7. Transaction Transaction concept, transaction state, Implementation of 04
processing atomicity and durability, concurrent execution, Serializability,
recoverability, Implementation of isolation, transaction
definition in SQL.
8. Overview of Failure classification, Storage structure, recovery and 06
backup and atomicity, log based recover , shadow paging, recovery with
recovery concurrent transaction, buffer management, failure with loss of
process non- volatile storage, advance recovery techniques.
Total=48

Recommended Books:
1. A Silberschatz, H. F. Korth, and S Sudarshan, Database System Concepts, TMH.
2. McFadden, F.Hoffer, M. B Modern database management, Prescott.
3. C.J Date, An Introduction to Database Systems, Addison, Wesley.
4. Raghu Ramakrishnan and Gehrke,Database Management System, McGraw-Hill.
5. Margaret.H.Dunham , Data Mining. Introductory and advanced topics, Pearson.

41
 Title of the course : Operating System Lab
Subject Code : PCCS-524
Weekly load : 4 Hrs LTP 0-0-4
Credit :2
Course Outcomes: At the end of the course, the student will be able to:
CO1 Implement CPU scheduling algorithms
CO2 Implement Page replacement algorithms
CO3 Implement Deadlock handling algorithms
CO4 Implement various memory management techniques
CO5 Implement various file allocation strategies

CO/PO Mapping : (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 3 2 2 0 0 2 2 2 2 3 3
CO2 3 2 2 2 2 2 0 0 2 2 3 2 3 2
CO3 3 2 2 2 1 2 0 0 3 3 2 2 3 2
CO4 3 3 2 2 2 2 0 0 3 2 2 3 3 2
CO5 3 3 2 2 2 2 0 0 2 3 2 2 3 2

LIST OF PRACTICALS
1. WAP to implement following CPU scheduling algorithms:
• FCFS
• SJF
• Priority
• Round Robin
2. WAP to implement MVT and MFT.
3. WAP to implement Bankers algorithm for deadlock avoidance.

42
 4. WAP to implement Bankers algorithm for deadlock prevention.
5. WAP to implement following page replacement algorithms:
• FIFO
• LRU
6. WAP to implement paging technique of memory management.
7. WAP to implement following file allocation strategies:
• Sequential
• Indexed
• Linked

Note: The above mentioned list of experiments is suggested list. Teacher may add more programs/
experiments as per requirement.

Title of the course : Database Management System Lab

Subject Code : PCCS-525
Weekly load : 4Hrs LTP 0-0-4
Credit :2
Course Outcomes: At the end of the course, the student will be able to:

CO1 Understand, analyze and apply common SQL statements including DDL, DML and DCL statements to
perform different operations.
CO2 Apply various constraints on database tables using different keys.
CO3 Implement relational algebra and relational calculus query.
CO4 Develop programs using PL/SQL.
CO5 Create views, forms and reports.

CO/PO Mapping : (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 3 2 3 0 0 2 2 2 2 3 3
CO2 3 2 3 3 3 3 0 0 3 3 2 3 3 3
CO3 2 2 3 3 2 3 0 0 3 2 2 2 2 2
CO4 3 3 2 2 2 2 0 0 2 2 1 2 2 2
CO5 2 2 2 3 3 3 0 0 3 3 2 2 2 2

LIST OF PRACTICALS
1. Introduction to various constraints such as Primary key, secondary key, Super key, etc.
2. To implement Data Definition Commands (create, drop).
3. To implement Data Manipulation Commands (insert, delete, update, select)
4. To implement Data Control Commands (Commit, revoke, rollback, connect, execute)
5. Create Table, SQL for Insertion, Deletion, Update and Retrieval using aggregating

43
 functions.
6. Write Programs in PL/SQL, Understanding the concept of Cursors.
7. Write Program for Join, Union & intersectionetc.
8. Creating Views, Writing Assertions, and Triggers.
9. Creating Forms, Reports etc.
10. WAP in PL/SQL for adding two numbers.
11. WAP in PL/SQL for reversing the number. For e.g. the number is 12345 and reverse
number will be 54321)
12. WAP in PL/SQL to find the number is even or odd.
13. WAP in PL/SQL to count numbers from 1 to 100.
14. WAP to test MAX, MIN, GROUP BY and ORDER BY commands.
Note: The above mentioned list of experiments is suggested list. Teacher may add more programs/
experiments as per requirement.

Title of the course : Operating System

Subject Code : MDCS-521
Weekly load : 4Hrs LTP 3-1-0
Credit :4

Course Outcomes: At the end of the course, the student will be able to:
CO1 Learn basic concepts of Operating System along with implementation of scheduling
algorithms in process management
CO2 Analyze critical section problem in Inter process communication and use of memory
management techniques
CO3 Implement page replacement algorithms and use virtual memory concepts
CO4 Know about file structure, file management and disk management
CO5 Learn the concept of deadlock and implement various algorithms used for its detection and
recovery

CO/PO Mapping : (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 3 1 3 2 0 0 2 2 2 2 2 2
CO2 3 2 2 2 2 2 0 0 2 3 3 2 3 3
CO3 3 3 2 2 0 3 0 0 3 2 2 2 3 2
CO4 3 2 2 2 2 2 0 0 3 3 2 2 2 2
CO5 3 2 1 2 0 2 0 0 3 2 2 2 3 3

Theory

44
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Basic Concept Evolution of operating system, operating system 06
of Operating classifications, structure of operating system, types of
System operating system (Batch, Multiprogramming,
Multiprocessing, Time-sharing systems and real time
systems etc.), concept of virtual machine, case study on
UNIX and windows operating system.

2. Process Process overview, process states, PCB, levels of scheduler 06

Management and CPU scheduling algorithms, multiple-processor
scheduling, scheduling criteria, threads, process scheduling
objects and techniques.
3. Inter-process Concurrent processes - The Critical Section & Mutual 06
Communication Exclusion problem - Algorithms - Semaphores, Critical
Region, Conditional Critical Region, Race condition,
Monitors, Messages passing - Examples in Contemporary
OS - Classical Process Co-ordination Problems
4. Memory Memory hierarchy, static and dynamic memory allocation, 06
Management overview of swapping, multiple partitions, contiguous and
non-contiguous memory allocation, internal and external
fragmentation, concepts of paging, segmentation.
Unit-2 5. Virtual Virtual Memory Concepts - Demand paging - Performance - 08
Memory Fragmentation & Compaction. Concept of page fault and
dirty page/ dirty bit, Page replacement and Allocation
algorithms -Memory Protection - System Calls –
Linux/Windows Virtual Memory Techniques.
6. File File concepts, Access methods, Directory structure, File 08
Management protection, File System structure, Allocation methods,
Secondary storage management - Disk structure, Disk
scheduling algorithms, Disk management, Swap-space
management, Disk reliability.
7. Deadlock Introduction to deadlock, necessary and sufficient 08
conditions, deadlock prevention & avoidance, Bankers
algorithm, deadlock detection & recovery.

Total=48

Recommended Books:
1. Silberschatz A & Galvin, Operating System Concepts, John Wiley & Sons
2. W. Stallings, Operating Systems: Internals and Design Principles, Pearson Pub.
3. Andrew S Tanenbaum, Operating Systems - Design and Implementation, PHI
4. Crawley, Operating Systems - An Object oriented Approach, McGraw Hill

45
SEMESTER-V

46
 CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):
Programme Outcomes (POs)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 3 3 2 0 0 2 0 2 3 2 2
CO2 3 2 3 2 3 2 0 0 2 0 2 3 2 2
CO3 3 3 3 3 3 2 0 0 2 0 2 3 3 2
CO4 3 3 2 2 2 2 0 0 2 0 2 3 3 2

Title of the course : Discrete Mathematics

Subject Code : PCCS- 611
Weekly load : 3 Hrs LTP 2-1-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand sets, relations, functions and basic principles of counting and probability
CO2 Apply Propositional logic, Formulate and solve various graph problems
CO3 Understand the concept of Recurrence Relations and Recursive Algorithms and their Solutions
by the method of generating functions and know about various Boolean algebra concepts
CO4 Understand the theoretical workings of Basic Probability and Probability Distribution
CO5 Demonstrate various real world scenarios using concepts of Basic Probability , sampling theory

47
CO5 3 3 2 2 2 2 0 0 2 0 2 3 2 2

Theory:
Unit Main Topics Course outlines Lecture(s)
1. Introduction to Introduction, Combinations of sets, Finite and infinite
Sets and sets, Mathematical induction, Principle of inclusion and 04
Propositions exclusion, Multisets, Ordered sets, Propositions.
2.Basic principles Counting Principles: Basics of counting, Pigeonhole
of counting Principle, Permutations, Combinations, Generation of 05
permutations and combinations.
Unit-1 3.Basic principles Discrete probability, Conditional probability, Information
and mutual information. 03
of probability
4.Relations and Introduction, A relational model for data bases, Properties
Functions of binary relations, Equivalence relations and partitions,
Partial ordering relations and lattices, Definition & 05
properties of Lattice, Sub lattice, Distributive & Boolean
algebra, a job scheduling problem.
5. Mathematical Propositions, logical operators & propositional algebra.
03
logic
6. Graphs and Introduction, Basic terminology, Multigraphs and
Planer graphs weighted graphs, Paths and Circuits, Shortest paths in 04
weighted graphs, Eulerian paths and circuits.
7. Recurrence Introduction, Linear recurrence relations with constant
Unit-2 Relations and coefficients, Homogeneous solutions, Particular
Recursive solutions, Total solutions, Solutions by the method of 04
Algorithms generating functions, Recursive definitions, Recursive
algorithms.
8. Groups, rings Group rings and Boolean algebra: Binary operations, semi
and Boolean groups and monoids, integers, groups, subgroups, rings 04
algebra and fields, principle of duality, Boolean lattices.
Total=32

Recommended Books:
1. Liu C.L., “Elements of Discrete Mathematics”, MGH.
2. Joshi , “Maths Foundation of Discrete Mathematics”, Wiley Eastern
3. Kolman B., Busby R.C. & Ross S., “Discrete Mathematical Structure”, 5/E, PHI.
4. DeoNarsingh., “Graph theory with applications to Engineering & Computer Science”,
PHI.

48
 Title of the course : Computer Networks
Subject Code :PCCS-612
Weekly load : 3 Hrs LTP 2-1-0
Credit : 3 (Lecture 3)
Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand basics of computer networks
CO2 Learn use of physical and datalink layer in networking
CO3 Understand the concept of MAC and Network layer
CO4 Learn various protocols used in transport and application layer
CO5 Understand OSI and TCP/IP models

49
 Theory
Unit Main Topics Course outlines Lecture(s)
1. Introduction Need & Evolution of Computer Networks, Description of
LAN, MAN, WAN and wireless Networks, OSI and TCP/IP
Unit-1 models with description of Data Encapsulation & peer to 06
peer communication, Comparison of OSI and TCP/IP.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Programme Outcomes (POs)
Cos PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 0 0 1 0 0 0 0 0 0 2 1 1
CO2 2 2 0 0 2 0 0 0 0 2 0 2 2 2
CO3 2 3 2 2 2 2 0 0 2 2 0 2 2 2
CO4 2 2 3 2 2 2 0 0 2 2 0 2 2 2
CO5 2 2 2 2 2 2 0 0 2 2 0 0 3 2
2. Basics of Basic terminology of computer networks - bandwidth,
Computer physical and logical topologies, Media – 10 base Z, 10base
Networks S, 10base T, 100baseTX, 100base FX, 1000baseLX and 06
wireless. LAN & WAN devices – Router, bridge, Ethernet
switch HUB, Modem.

3. Physical Layer Representation, one bit on physical modem i.e. in wired

network, optical Network and wireless N/W, Encoding /
Modulation – Manchester Encoding, AM, FM and PM.
Dispersion, Jitter, Latency and collision. Different types of 06
Media – Shielded twisted pair, Unshielded twisted pair,
Coaxial cable, Optical Fiber cable and wireless.

4. Data link Framing, Error control and Flow control, Data link control
Layer and protocols – Simplex protocol, Sliding window protocol 06

5. Medium Channel Allocations, Multiple Access protocols- ALOHA,

Access CSMA, CSMA/CD protocols, Collision free protocols, 06
Unit-2 Sublayer Token Ring, FDDI, Bridges and recent developments.
6. Network Segmentation and autonomous system path determination,
06
Layer Network layer addressing, Network-layer data gram, IP

50
 addressed classes. Subnetting – Sub network, Subnet mask.
Routing algorithm – optimality Principle, Shortest path
routing, Hierarchical routing, Broadcast routing, Multicast
routing, tunneling Fragmentation and DHCP. Routing
Protocol – RIP, IGRP, OSPF and EIGRP.

7. Transport Layer 4 Protocol TCP & UDP. Three-way handshakes open

Layer connection. Session Layer design issue, Presentation layer 06
design issue, and Application layer design issue.

8. Application Application Layer protocols: TELNET, FTP, HTTP,SNMP,

Layer DNS, SMTP, FTP, HTTP, WWW and recent development. 06

Total=48

Recommended Books:
1. Tanenbaum, Computer Network, Prentice Hall India
2. William Stalling, Data and Computer Communication, Prentice Hall
3. Douglas E. Comer, Internetworking with TCP/IP Volume – I, Prentice Hall India
4. W. Richard Stevens, TCP/IP Illustrated Volume-I, Pub. Addison Wesley
5. B. Forouzan, Data Communication And Networking, TMH

Title of the course : Computer Networks Lab

Subject Code : PCCS-613
Weekly load : 4 Hrs LTP 0-0-4
Credit :2
Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand the concept of different network and its components
CO2 Configure cable connection and testing using various commands

51
CO3 Configure different wireless networks.
CO4 Implement the connection between different nodes by using different topologies
CO5 Understand how to share resources on the network.

CO/PO Mapping : (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation):

Programme Outcomes (POs)
Cos PS01 PS02
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 2 2 1 2 0 0 2 3 2 2 3 2
CO2 2 2 2 2 2 2 0 0 2 3 2 2 2 2
CO3 2 2 3 2 2 2 0 0 2 3 2 2 2 2
CO4 2 3 3 3 2 3 0 0 2 3 2 2 2 2
CO5 3 2 3 2 2 1 0 2 2 3 2 2 3 2

LIST OF PRACTICALS
1. Introduction to LAN with its cables, network connectors and topologies.
2. Making of a network cable (straight thru and cross over twisted pair) to connect two
personnel computer.
3. Introduction to motherboard and installation of LAN card and Wi-fi dongle.
4. Case study of Ethernet (10 base 5,10 base 2,10 base T).
5. Create a simple network with two PCs using a hub.
a. Identify the proper cable to connect the PCs to the hub
b. Configure workstation IP address information.
c. Test connectivity using the Ping command
d. Installation and working of Telnet.
6. Configuration of Wireless Access point.
7. Punching of information outlet (I/O box) using punching tool.
8. Procedure to share hardware resources over network.
9. Various troubleshooting tools used in computer network.
Note: The above mentioned list of experiments is suggested list. Teacher may add more programs/
experiments as per requirement.

Title of the course : Computer Graphics

Subject Code : PECS-611A
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:

52
CO1 Provide comprehensive introduction about computer graphics system and design algorithms
CO2 Familiar with two dimensional and three dimensional transformations
CO3 Familiar with techniques of clipping, hidden surface removal and shading
CO4 Provide information about Projections and shading techniques
CO5 To recognize the software utilized in constructing computer graphics applications.

Theory:
Unit Main Topics Course outlines Lecture(s)
1. Overview of Display devices, physical input and output devices:
Unit-1 graphics systems storage tube graphic displays, Raster Refresh, 04
Plasma Panel Displays, Liquid Crystals

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Programme Outcomes (POs)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 0 2 0 2 0 0 0 0 0 0 2 3 2
CO2 2 0 2 2 1 0 0 0 0 0 0 2 3 2
CO3 2 3 2 2 2 0 0 0 2 0 2 2 3 3
CO4 2 3 2 2 2 0 0 0 2 0 2 2 3 2
CO5 2 3 2 2 2 0 0 0 2 0 2 2 3 2
2. Output Point plotting, Line Drawing algorithms – Slope
Primitives Line Method, DDA algorithms, Bresenham’s Line 06
algorithm
3. Two-dimensional Basic transformations-translation, scaling, rotation,
Transformations Matrix representation and homogenous coordinates,
06
composite transformations, Rotation about an
arbitrary point, scaling relative to a fixed point
4. Windowing and Windowing concepts, clipping algorithms-Line
Clipping clipping– Cohen-Sutherland algorithm, Polygon 06
Techniques Clipping algorithms, Text Clipping.
5. Projections and Parallel projections, perspective projections,
Unit 2 Shading Polygon shading methods: Flat shading, Gouraud 06
Shading, Phong Shading.
6. Visible Surface Back face removal method, Depth-buffer method,
Detection and Scan-line method
04
Hidden-Surface
Removal
Total=32
Recommended Books:
1. Computer Graphics, Hearn & Baker, PHI
2. Principles of Interactive Graphics, Newman &Sproul, Mcgraw Hill
3. Computer Graphics-A Programming Approach, Steven Harrington, Mcgraw Hill

53
 4. Computer Graphics, Sinha&Udai, Mcgraw Hill

Title of the course : Data Mining

Subject Code : PECS-611B
Weekly load : 3 Hrs LTP 3-0-0

54
 Credit :3
Course Outcomes: On successful completion of this course, students will be able to:
CO1 Design a data mart for any organization
CO2 Develop skills to write queries using DMQL
CO3 Extract knowledge using data mining techniques
CO4 Adapt to new data mining tools
CO5 Explore recent trends in data mining such as web mining, spatial-temporal mining

Theory

Unit Main Topics Course outlines Lecture(s)

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Programme Outcomes (POs)
Cos PSO1 PSO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
2
CO1 2 1 2 1 1 2 0 0 2 0 0 2 3 2
CO2 2 3 3 2 2 2 0 0 2 2 2 2 2 3
CO3 2 3 3 3 2 3 0 0 3 2 2 2 3 3
CO4 2 3 3 3 2 3 0 0 2 2 2 2 2 3
CO5 2 2 2 2 2 2 0 0 2 0 2 2 3 3
1. Introduction Data Mining Concepts, Input, Instances, Attributes and
Output, Knowledge Representation & Review of Graph 06
Theory, Lattices, Probability & Statistics

2. Machine Supervised Learning Framework, concepts & hypothesis,

learning Training & Learning, Boolean functions and formulae,
Monomials, Disjunctive Normal Form & Conjunctive 06
concepts and
approaches Normal Form, A learning algorithm for monomials
Unit-1 3. Data Data Cleaning, Data Integration & Transformation, Data
Reduction 05
Preparation
4. Mining Associations, Maximal Frequent & Closed Frequent item
Association sets, Covering Algorithms & Association Rules, Linear
Rules Models & Instance-Based Learning, and Mining Association
Rules from Transactional databases, Mining Association 07
Rules from Relational databases, Correlation analysis &
Constraint-based Association Mining.

5. Classification Issues regarding Classification & Prediction, Classification

and Prediction by Decision Tree induction, Bayesian classification,
Unit-2 Classification by Back Propagation, k-Nearest 08
NeighborClassifiers, Genetic algorithms, Rough Set &
Fuzzy Set approaches

55
 6. Cluster Types of data in Clustering Analysis, Categorization of
Analysis Major Clustering methods, Hierarchical methods, Density-
based methods, Grid-based methods, Model-based 08
Clustering methods

7. Mining Multidimensional analysis & Descriptive mining of

Complex Complex data objects, Mining Spatial Databases, Mining
Types of Data Multimedia Databases, Mining Time-series & Sequence 08
data, Mining Text databases, Mining World -Wide Web

Total=48

Recommended Books:
1. Jiawei Han and MichelineKamber, “Data Mining: Concepts and Techniques”, Morgan
Kaufmann Publishers, 2000 (ISBN: 1-55860-489-8).
2. Ian H. Witten and Eibe Frank, “Data Mining: Practical Machine Learning Tools and
Techniques with Java implementations”, Morgan Kaufmann Publishers, San Fransisco,
CA (2000).
3. Dorian Pyle, “Data Preparation for Data Mining”, Morgan Kaufmann, (1999)
4. Korth, Silbertz, Sudarshan, “Database Concepts”, McGraw Hill
5. Elmasri, Navathe, “Fundamentals Of Database Systems”, Addision Wesley

Title of the course : Cyber Laws and Ethics

56
 Subject code : PECS-611C
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 To identify and analyze statutory, regulatory, constitutional, and organizational laws that
affects the information technology professional.
CO2 To locate and apply case law and common law to current legal dilemmas in the technology
field.
CO3 To understand the basics of the four primary forms of intellectual property rights.
CO4 To compare and contrast the different forms of intellectual property protection in terms of
their key differences and similarities.
C05 To understand the basics of Copyright & Related Rights and protection from copyright.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 0 3 1 3 2 0 0 3 1 3 2 1 2
CO2 3 3 3 3 3 0 0 0 3 1 3 2 2 3
CO3 3 0 3 0 0 0 0 0 0 0 0 2 1 1
CO4 3 0 3 3 0 0 0 0 0 0 0 3 1 1
CO5 3 2 3 1 0 0 0 1 0 0 1 2 1 1
Theory
Unit Main Topics Course outlines Lecture(s)
1. Introduction Overview of Computer and Web Technology, Need for Cyber
Law, CyberJurisprudence at International and Indian Level,
Jurisdictional Aspects in CyberLaw Issues of jurisdiction in
06
cyberspace, Types of jurisdiction, MinimumContacts Theory,
Sliding Scale Theory, Effects Test and International targeting,
Jurisdiction under IT Act, 2000.
2. Jurisdiction Jurisdictional Aspects in CyberLaw Issues of jurisdiction in
cyberspace, Types of jurisdiction, MinimumContacts Theory,
Sliding Scale Theory, Effects Test and International targeting, 06
Unit-1
Jurisdiction under IT Act, 2000.
3. Cyber Cyber Crimes against Individuals, Institution and State,
Crimes Hacking, Digital Forgery, Cyber Stalking/Harassment, Ethics
06
and Etiquettes of Cyber World, Cyber Pornography, Identity
Theft & Fraud, Cyber Terrorism, Cyber Defamation.
4. Legal Right to Privacy and Data Protection on Internet, Concept of
Framework privacy, Threat to privacy on internet, Self-regulation approach 06
to privacy.
5. Intellectual Introduction and the need for intellectual property right (IPR),
Unit-2 06
Property IPR in India – Genesis and Development IPR in abroad.

57
 6. Patents Macro-economic impact of the patent system, Patent and kind of
inventions protected by a patent, Patent document How to 06
protect your inventions?, Granting of patent, Rights of a patent.
7. Copyright Copyright, latest editions, duration of copyright last, how to
& Related protect copyright. Related rights and its distinction with 06
Rights copyright.
8. Trademarks Trademark and rights of trademark, kind of signs can be used as
trademarks, types of trademark,trademark protection and 06
registration process.
Total=48

Recommended Books:
1. AnirudhRastogi. Cyber Law-Law Of Information Technology And Internet, LexisNexis.
2. Vakul Sharma. Information Technology Law and Practice Cyber Laws and LawsRelating to
E-Commerce, Universal Law Publishing.
3. Dr. S.K. Singh. Intellectual Property Rights, Central Law Agency.

Title of the course : Software Engineering

58
 Subject Code :PECS-611D
Weekly load : 3 Hrs LTP 3-0-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Gain understanding of software development life cycle
CO2 Prepare SRS document for a software project
CO3 Apply software design and development techniques
CO4 Apply estimation techniques for software development
CO5 Implement testing at each phase of SDLC
CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):
Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 2 1 1 0 0 2 0 3 3 1 1
CO2 3 3 3 2 2 1 0 0 2 0 2 2 2 2
CO3 3 0 3 2 2 1 0 0 2 0 2 2 2 3
CO4 2 0 2 2 2 2 0 0 2 0 3 2 2 3
CO5 3 0 2 3 2 2 0 0 2 0 2 2 2 3
Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Evolving role of Introduction to Software Engineering, importance of 06
Software Software, The Software Evolution, Software
Characteristics, Software Applications
2.Software Waterfall model, Prototyping Model, RAD Model, 06
Development Life Incremental Model, Spiral Model, Selection of a life
Cycle Models cycle model
3. S/W scope Resources, estimation, decomposition techniques, 06
empirical estimation models. Project scheduling
4. Software reliability Software reliability models, Software quality, software 06
quality ISO standards, Capability Maturity Model,
requirement analysis, analysis principles
Unit-2 5. Software Testing Software testing Fundamentals, Test Case design, White 06
box testing, Basis path testing, Black box testing.
6. Post implementation Review plan. S/W maintenance and enhancement 06
review procedure.
7. Reverse Scope, Levels of reverse engineering, tools, software re- 06
Engineering engineering, documentation
8.Control Measures Threats & control measures, disaster/recovery planning, 06
ethics in system development, ethics codes & standard
of behavior.
Total=48

Recommended Books:

59
1. Roger S. Pressman, Software Engineering, A Practitioner’s
Approach, McGrawHill International Edition.
2. Ian Sommerville, Software Engineering, Addison-Wesley Publishing Company
3. James F. Peter, Software Engineering - An Engineering Approach, John Wiley
4. Pankaj Jalote, An integrated Approach to Software Engineering, Narosa.

Title of the course : Enterprise Resource Planning

60
 Subject Code : PECS-611E
Weekly load : 3 Hrs LTP 3-0-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Learn fundamental concepts of ERP system and ERP related technologies.
CO2 Acquire knowledge of different ERP modules and manufacturing perspectives of ERP
CO3 Use ERP system in different business organizations by having knowledge of latest scenario
of ERP market in e-business.
CO4 Understand the concept of ERP implementation strategies and use the ERP module in real
time projects.
CO5 Develop skills necessary for building and managing relationships with customers, and
stakeholders.
CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):
Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 1 3 2 2 0 1 3 3 3 2 1 2
CO2 3 2 1 3 2 2 0 1 3 3 3 2 2 1
CO3 3 2 1 3 2 2 0 1 3 3 3 2 1 3
CO4 1 1 1 2 2 2 0 1 2 2 3 2 1 2
CO5 2 2 2 3 2 2 0 1 3 3 3 3 1 2

Theory
Unit Main Topics Course outlines Hour(s)
1. Introduction to Introduction and evolution of ERP, Reasons for the growth 04
ERP of the ERP market, Advantages of ERP, Introduction to
ERP packages
2. Enterprise- An Integrated Management information, Business Modeling, 04
overview Integrated Data Model.
Unit-1 3. ERP and Related BRP (Business Process Reengineering), MIS (Management 08
Technologies Information System), DSS (Decision Support System), EIS
(Executive Information system), Data Warehousing, Data
Mining, OLAP (On-Line Analytical Processing), Supply
Chain Management.
4. ERP-A ERP, CAD/CAM, MRP (Material Requirement Planning), 08
Manufacturing BOM (Bill of Material), Closed loop MRP, MRP-II, DRP
Perspective (Distributed Requirement Planning), PDM (Product Data
Management) and its benefits, Data Management, MTO,
MTS, ATO, ETO, CTO
5. ERP Modules Finance, Plant Maintenance, Quality Management, Material 06
Management.
6. Benefits of ERP Benefits of ERP, SAP, BAAN, Oracle Corporation, People 06
Unit-2 and ERP Market Soft

61
 7. ERP ERP Implementation Life Cycle, In-house Implementation 06
Implementation – pros & cons, Vendors, Consultants, End-users.
8. Future directions in Future Directions in ERP and ERP Case Studies 06
ERP
Total=48

Recommended Books:
1. Alexis Leon “Enterprise Resource Planning”, TMH.

Title of the course : Network Operating System

62
 Subject Code :PECS-611F
Weekly load : 3 Hrs LTP 3-0-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Study the basics of Linux based Operating System.
CO2 Learn the installation, configuring and setup of Linux Operating System.
CO3 Develop the skill of shell programming in Linux.
CO4 Access advanced configuration and system management features of Linux.
CO5 Learn GUI features including Applications Manager, Text Editor, printing
CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):
Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 0 3 0 0 0 0 0 0 0 3 0 3 1 2
CO2 0 3 2 2 0 0 0 0 0 3 0 3 3 3
CO3 0 3 2 3 0 0 0 0 0 3 0 3 2 2
CO4 0 3 0 2 0 0 0 0 0 3 0 3 2 1
CO5 0 2 1 0 0 3 0 2 1 1 0 1 2 2

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Introduction History of Linux and Unix, Linux overview, Linux releases, 06
toLinuxOperatin Open Linux
g System
2. Installing Hardware, software and information requirements; opening 06
Linux disk space for Linux partitions; creating the open Linux
install disks; installing Linux;

3. Installing Installing and configuring X-windows; installing sound 06

Drivers drivers.

4. Linux Startup User accounts; accessing the Linux system; Linux 06

and Setup commands; online manual; online documentation; installing
software packages

Unit-2 5. Shell The command line: special characters and file arguments; 06
standard input/ output and redirection; pipes; redirecting
and piping with standard errors; shell scripts; jobs.

6. Linux file Linux files; file structure; listing, displaying and printing 06
Structure

63
 files; managing directories; file and directory operations

7. VI editor vi editing commands; advanced vi editing commands; line 06

editing commands; options in v i

8. System System management, managing users; installing and 06

Administratio managing devices
n
Total=48
Recommended Books:
1. Linux the Complete Reference, Richard Peterson TMH, New Delhi.
2. CISCO Network Design Handbook, Michal Salvagno IDG books, Delhi

64
 Title of the course : Software Engineering
Subject Code : OECS-611A
Weekly load : 3 Hrs LTP 3-0-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Gain understanding of software development life cycle
CO2 Prepare SRS document for a software project
CO3 Apply software design and development techniques
CO4 Apply estimation techniques for software development
CO5 Implement testing at each phase of SDLC

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 2 1 1 0 0 2 0 3 3 1 1
CO2 3 3 3 2 2 1 0 0 2 0 2 2 2 2
CO3 3 0 3 2 2 1 0 0 2 0 2 2 2 3
CO4 2 0 2 2 2 2 0 0 2 0 3 2 2 3
CO5 3 0 2 3 2 2 0 0 2 0 2 2 2 3

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Evolving role of Introduction to Software Engineering, importance of 05
Software Software, The Software Evolution, Software Characteristics,
Software Applications, Software Crisis: Problem and
Causes.
2.Software Build and fix model, Waterfall model, Prototyping Model, 07
Development RAD Model, Incremental Model, Spiral Model, Selection of
Life Cycle a life cycle model
Models
3. S/W scope Resources, estimation, decomposition techniques, empirical 06
estimation models. Project scheduling, refinement of major
tasks, scheduling project plan,
4. Software Software reliability models, Software quality, software 06
reliability quality ISO standards, Capability Maturity Model, The
system engineering hierarchy information engineering,
information strategy planning, requirement analysis,
analysis principles
Unit-2 5. Software Software testing Fundamentals, Test Case design, White 08
Testing box testing, Basis path testing, Control structure testing,
Black box testing.
6. Post Review plan. S/W maintenance and enhancement 05

65
 implementation procedure. System security.
review
7. Reverse Scope, Levels of reverse engineering, tools, software re- 05
Engineering engineering, documentation

8.Control Threats & control measures, disaster/recovery planning, 06

Measures ethics in system development, ethics codes & standard of
behavior.
Total=48

Recommended Books:
1. Roger S. Pressman, Software Engineering, A Practitioner’sApproach, McGrawHill International
Edition.
2. Ian Sommerville, Software Engineering, Addison-Wesley Publishing Company
3. James F. Peter, Software Engineering - An Engineering Approach, John Wiley
4. Pankaj Jalote, An integrated Approach to Software Engineering, Narosa.

66
 Title of the course : Enterprise Resource Planning
Subject Code : OECS-611B
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Learn fundamental concepts of ERP system and ERP related technologies.
CO2 Acquire knowledge of different ERP modules and manufacturing perspectives of ERP
CO3 Use ERP system in different business organizations by having knowledge of latest scenario
of ERP market in e-business.
CO4 Understand the concept of ERP implementation strategies and use the ERP module in real
time projects.
CO5 Develop skills necessary for building and managing relationships with customers, and
stakeholders.
CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):
Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 1 3 2 2 0 1 3 3 3 2 1 2
CO2 3 2 1 3 2 2 0 1 3 3 3 2 2 1
CO3 3 2 1 3 2 2 0 1 3 3 3 2 1 3
CO4 1 1 1 2 2 2 0 1 2 2 3 2 1 2
CO5 2 2 2 3 2 2 0 1 3 3 3 3 1 2

Theory
Unit Main Topics Course outlines Hour(s)
1. Introduction to Introduction and evolution of ERP, Reasons for the growth 04
ERP of the ERP market, Advantages of ERP, Introduction to
ERP packages
2. Enterprise- An Integrated Management information, Business Modeling, 04
overview Integrated Data Model.
3. ERP and Related BRP (Business Process Reengineering), MIS (Management 08
Technologies Information System), DSS (Decision Support System), EIS
Unit-1 (Executive Information system), Data Warehousing, Data
Mining, OLAP (On-Line Analytical Processing), Supply
Chain Management.
4. ERP-A ERP, CAD/CAM, MRP (Material Requirement Planning), 08
Manufacturing BOM (Bill of Material), Closed loop MRP, MRP-II, DRP
Perspective (Distributed Requirement Planning), PDM (Product Data
Management) and its benefits, Data Management, MTO,
MTS, ATO, ETO, CTO
5. ERP Modules Finance, Plant Maintenance, Quality Management, Material 06
Management.
6. Benefits of ERP Benefits of ERP, SAP, BAAN, Oracle Corporation, People 06
Unit-2 and ERP Market Soft

67
 7. ERP ERP Implementation Life Cycle, In-house Implementation 06
Implementation – pros & cons, Vendors, Consultants, End-users.
8. Future directions Future Directions in ERP and ERP Case Studies 06
in ERP
Total=48

Recommended Books:
1. Alexis Leon “Enterprise Resource Planning”, TMH.

68
 Title of the course : Cyber Laws and Ethics
Subject code : OECS-611C
Weekly load : 3 Hrs LTP 3-0-0
Credits :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 To identify and analyze statutory, regulatory, constitutional, and organizational laws that
affects the information technology professional.
CO2 To locate and apply case law and common law to current legal dilemmas in the technology
field.
CO3 To understand the basics of the four primary forms of intellectual property rights.
CO4 To compare and contrast the different forms of intellectual property protection in terms of
their key differences and similarities.
CO5 To understand the basics of Copyright & Related Rights and protection from copyright.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 0 3 1 3 2 0 0 3 1 3 2 1 2
CO2 3 3 3 3 3 0 0 0 3 1 3 2 2 3
CO3 3 0 3 0 0 0 0 0 0 0 0 2 1 1
CO4 3 0 3 3 0 0 0 0 0 0 0 3 1 1
CO5 3 2 3 1 0 0 0 1 0 0 1 2 1 1

Theory
Unit Main Topics Course outlines Lecture(s)
1. Introduction Overview of Computer and Web Technology, Need for Cyber 06
Law, CyberJurisprudence at International and Indian Level,
Jurisdictional Aspects in CyberLaw Issues of jurisdiction in
cyberspace, Types of jurisdiction, MinimumContacts Theory,
Sliding Scale Theory, Effects Test and International targeting,
Jurisdiction under IT Act, 2000.
2. Jurisdiction Jurisdictional Aspects in CyberLaw Issues of jurisdiction in 06
cyberspace, Types of jurisdiction, MinimumContacts Theory,
Unit-1 Sliding Scale Theory, Effects Test and International targeting,
Jurisdiction under IT Act, 2000.
3. Cyber Cyber Crimes against Individuals, Institution and State, 06
Crimes Hacking, Digital Forgery, Cyber Stalking/Harassment, Ethics
and Etiquettes of Cyber World, Cyber Pornography, Identity
Theft & Fraud, Cyber Terrorism, Cyber Defamation.
4. Legal Right to Privacy and Data Protection on Internet, Concept of 06
Framework privacy, Threat to privacy on internet, Self-regulation approach

69
 to privacy.

5. Intellectual Introduction and the need for intellectual property right (IPR), 06
Property IPR in India – Genesis and Development IPR in abroad.
6. Patents Macro-economic impact of the patent system, Patent and kind of 06
inventions protected by a patent, Patent document How to
protect your inventions?, Granting of patent, Rights of a patent.
Unit-2 7. Copyright Copyright, latest editions, duration of copyright last, how to 06
& Related protect copyright. Related rights and its distinction with
Rights copyright.
8. Trademarks Trademark and rights of trademark, kind of signs can be used as 06
trademarks, types of trademark,trademarkprotection and
registration process.
Total=48

Recommended Books:
1. AnirudhRastogi. Cyber Law-Law Of Information Technology And Internet, LexisNexis.
2. Vakul Sharma. Information Technology Law and Practice Cyber Laws and LawsRelating to
E-Commerce, Universal Law Publishing.
3. Dr. S.K. Singh. Intellectual Property Rights, Central Law Agency.

70
Title of the course : Programming Methodology
Subject Code : OECS-611D
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand the different problem representation, flow chart, algorithm etc.
CO2 Choose data types and operators to solve mathematical and scientific problems
CO3 Understand the flow control of program
CO4 Basic knowledge of object-oriented programs and file handling in c
CO5 To understand the use of pointer in real time problems.

CO/PO Mapping: (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 3 1 1 0 0 0 0 0 0 0 2 1 1
CO2 3 3 3 2 2 0 0 0 0 0 0 3 1 1
CO3 3 3 3 3 2 0 0 0 1 0 0 3 1 1
CO4 3 3 3 3 3 1 1 0 1 0 0 3 2 1
CO5 3 2 3 2 2 1 0 0 0 0 0 3 2 1

Unit Main Topics Course outlines Lecture(s)

1. Programming Steps in development of a program, Brief discussion of
Techniques Flow chart, algorithm development & program
debugging. Procedural Programming, Functional 06
Programming, Structured programming, Object oriented
Programming
2. Program Character set, comments, data types, logical, relational &
Structure binary operators, variables, constants, Standard I/O
06
statements, Expressions, Automaticconversion & casting
Unit-1 in data types.
3. Flow control If, If-Else, Nested if, Go-to, Switch, Break, continue,
while, do-while, for loop. 06
4. Functions & Void functions, function declaration, parameter passing,
Arrays call by value,call by reference, return statement Function
Overloading.Friend Functions, Virtualfunctions,
06
Declaration& Initialization of arrays, Accessing array
elements, Array ofstructures, two dimensional & multi-
dimensional arrays.
5. Structures & Declaration of a structure, Initialization, accessing
Scope structure members, nested structures, structures as
Unit-2 function arguments, Typedef, unions Enumerated 06
data,Block Local & Global variables, Auto Static & External
Variables
71
 6. Objects & Classes & objects in C++, Accessing data & member
Classes functions, private & public qualifiers, # include,#define &
#undef directives, Base & derived classes ,multiple 06
inheritance, constructors in derived classes, constructors
in multiple inheritance, operator overloading.
7. Pointers in C++ Pointers, Pointers as function argument, Pointer as a
structure member,Pointer arithmetic in objects and 06
classes,pointers and strings, pointers to objects.
8. File I/O Opening & closing a file, Reading & writing a file.
Random access files. Updatingdata in random access files,
06
Exception handling, Throwing of a function or an object
as anexception,Multiple catch statements.

Total=48

Recommended Books:

1. Turbo C++ Robert Lafore Pearson India

2. Let Us C++ YashwantKanetkar BPB
3. Thinking In C++ P B Mahapatra PHI

72
Title of the course : Data Preparation and Analysis
Subject Code : OECS-611E
Weekly load : 3Hrs LTP 3-0-0
Credit :3
Course Outcomes: On successful completion of this course, students will be able to:
CO1 Learn how to prepare data for analysis, perform exploratory data analysis, and develop
meaningful data visualization.
CO2 Learn how to prepare data sets for analysis by cleaning and reformatting.
CO3 Learn to apply a variety of data exploration techniques.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Programme Outcomes (POs)
COs PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 1 0 0 0 0 0 0 1 0 1 1 1 2
CO2 1 1 1 0 2 0 0 0 1 1 1 1 1 2
CO3 2 1 1 0 3 0 0 2 2 2 2 1 2 3
Theory

Unit Main Topics Course outlines Lecture(s)

Unit 1.Defining Data Knowing the client, Understanding the question 02
-1 Analysis
Problems
2. Data Data formats, parsing and transformation, Scalability and 07
Gathering and real-time issues.
Preparation
3. Data Cleaning Consistency checking, Heterogeneous and missing data, 11
Data Transformation and segmentation
Unit 4. Exploratory Descriptive and comparative statistics, Clustering and 13
-2 Analysis association, Hypothesis generation
5. Visualization Designing visualizations, Time series, Geolocated data, 15
Correlations and connections, Hierarchies and networks,
interactivity.
Total=48

Recommended Books:
1. Making sense of Data: A practical Guide to Exploratory Data Analysis and Data mining, by
Glenn J. myatt

73
 Title of the course : Software Project Management
Subject Code : OECS-612A
Weekly load : 3 Hrs LTP 300
Credit :3
Course Outcomes: At the end of the course, the student will be able to:

CO1 Comprehend software project management activities

CO2 Understand various steps required for project planning
CO3 Create an estimation and effective cost benefit evaluation techniques
CO4 Design framework for risk management
CO5 Comprehend resource management

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Programme Outcomes (POs)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 3 2 3 0 0 0 0 0 1 1
CO2 3 3 2 2 2 2 3 0 0 2 0 0 1 2
CO3 3 2 2 2 3 2 3 2 0 2 0 0 1 2
CO4 2 2 2 3 3 2 3 2 0 0 0 0 1 2
CO5 3 3 2 2 3 2 2 0 0 0 2 0 1 1

Theory

Unit Main Topics Course outlines Lecture(s)

Unit-1 1. Introduction Introduction to software project management, types of 12
project, project attributes, project constraints, importance of
management, problems with software projects, management
control, role of project manager, steps in project planning,
Programme management, managing resources within
Programme.
2. Software A system view of project management, stakeholder 12
Cost and management Assessment of projects, Cost-benefit Analysis,
Time Cash flow forecasting, Cost-benefit evaluation techniques,
Estimation Selection of an appropriate project technology, Choice of
process model, developing the project schedule, Estimation
Techniques, Problem with over and under estimates,
COCOMO Model

3. Planning Objective of Planning, Project Schedule, Activities – 12

Sequencing and Scheduling, Development of Project

74
 Network, Time Estimation, Forward and backward Pass,
Critical Path and Activities. Introduction to project risk
Unit-2 management, Risk categories, identification, assessment,
planning, management, Software Configuration Management
Process: Version Control, Change Control management,
PERT and CPM Models, project implementation

4. Software Resources, Nature of Resources, developing the project 12

Project budget, monitoring and controlling the project, project
Management metrics, Project targets, Management Spectrum, associating
human resource with job, Motivation, Oldham- job
Characteristics Model, Decision Making, Leadership, Stress
Management, Health and Safety

Total=48
Recommended Books:
1. Bob Hughes, Mike Cotterell, “Software Project Management”, Tata McGraw Hill.
2. Prasanna Chandra, “Projects: Panning, Analysis, Selection, Financing, Implementation
and Review”, Tata McGraw Hill Publication.
3. Jeffrey K. Pinto, “Project Management”, Pearson Publications.

75
 Title of the course : Decision Support System
Subject Code : OECS-612B
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand fundamental concepts associated with DSS
CO2 Develop skill in the system analysis, design and implementation of computerized DSS
CO3 Learn various knowledge representation techniques
CO4 Learn different types of Data warehouse, different framework of datamining
CO5 To understand the concept of Business Analytics,Knowledge Discovery in Databases
Theory
CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):
Programme Outcomes (POs)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 3 1 0 2 3 3 3 2 1 1
CO2 3 2 2 2 3 1 0 2 3 3 3 2 1 1
CO3 3 2 2 2 3 1 0 2 3 3 3 2 1 2
CO4 3 2 1 2 2 1 0 1 1 1 2 2 1 2
CO5 3 2 1 2 2 1 0 1 1 1 2 2 1 2
Unit Main Topics Course outlines Hour(s)
1. Introduction to Concepts of Data, Information, Information Systems & End 06
DSS Users, Systems Concepts: Open System, Closed System;
Information Systems and Systems Concept
2. Building System Analysis and Design – Systems Development Cycle 06
Information (Identification of Requirements, Feasibility Study, System
Unit-1 System Analysis, Design And Implementation), Prototyping
3. Decision Making Introduction and Definitions, Simons Decision Making 06
Model, How Decisions are Supported, DSS Configurations,
DSS Characteristics and Capabilities
4. Components of DSS Classifications DSS Modeling-Static and Dynamic 06
DSS Models, Certainty, Uncertainty, and Risk, Sensitivity
Analysis, What-IF, and Goal Seeking
5. Knowledge Definition and types of Knowledge, Frame work for 06
Management Knowledge Management, Knowledge Representation
System Techniques: Rules, Frames, Semantic Networks
6. Data Warehouse Data Warehousing Definitions and Concepts, Types of 06
and Data Mining Data warehouse, Data Mining Concepts and Applications,
Unit-2 Framework of datamining, Text Mining, Web Mining
Usage, Benefits, and Success of Business Analytics
7. Business Online Analytical Processing (OLAP), Reporting and 06
Analytics Queries, Multidimensionality, Knowledge Discovery in
Databases(KDD), framework of KDD
8. Future directions Future Directions in DSS and DSS Case Studies 06
Total=48

76
Recommended Books:
1. Turban, Efrain : Decision Support & Business Intelligent Systems(8e)- Pearson Education
2. Marakas, George.M. : Decision Support Systems in the 21st century – Pearson Education
3. Mallach, EfremG. : Decision Support & data Warehouse Systems – Tata McGraw-Hill

77
 Title of the course : Computer Networks
Subject Code :OECS-612C
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand basics of computer networks
CO2 Learn use of physical and datalink layer in networking
CO3 Understand the concept of MAC and Network layer
CO4 Learn various protocols used in transport and application layer
CO5 Understand OSI and TCP/IP models

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Programme Outcomes (POs)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 2 0 0 1 0 0 0 0 0 0 2 1 1
CO2 2 2 0 0 2 0 0 0 0 2 0 2 2 2
CO3 2 3 2 2 2 2 0 0 2 2 0 2 2 2
CO4 2 2 3 2 2 2 0 0 2 2 0 2 2 2
CO5 2 2 2 2 2 2 0 0 2 2 0 0 3 2

Theory

Unit Main Topics Course outlines Lecture(s)

1. Introduction Need & Evolution of Computer Networks, Description of 06
LAN, MAN, WAN and wireless Networks, OSI and TCP/IP
models with description of Data Encapsulation & peer to
peer communication, Comparison of OSI and TCP/IP.

2. Basics of Basic terminology of computer networks - bandwidth, 06

Computer physical and logical topologies, Media – 10 base Z, 10base
Networks S, 10base T, 100baseTX, 100base FX, 1000baseLX and
Unit-1 wireless. LAN & WAN devices – Router, bridge, Ethernet
switch HUB, Modem.

3. Physical Layer Representation, one bit on physical modem i.e. in wired 06

network, optical Network and wireless N/W, Encoding /
Modulation – Manchester Encoding, AM, FM and PM.
Dispersion, Jitter, Latency and collision. Different types of
Media – Shielded twisted pair, Unshielded twisted pair,
Coaxial cable, Optical Fiber cable and wireless.

78
 4. Data link Framing, Error control and Flow control, Data link control 06
Layer and protocols – Simplex protocol, Sliding window protocol

5. Medium Channel Allocations, Multiple Access protocols- ALOHA, 06

Access CSMA, CSMA/CD protocols, Collision free protocols,
Sublayer Token Ring, FDDI, Bridges and recent developments.
6. Network Segmentation and autonomous system path determination, 06
Layer Network layer addressing, Network-layer data gram, IP
addressed classes. Subnetting – Sub network, Subnet mask.
Unit-2 Routing algorithm – optimality Principle, Shortest path
routing, Hierarchical routing, Broadcast routing, Multicast
routing, tunneling Fragmentation and DHCP. Routing
Protocol – RIP, IGRP, OSPF and EIGRP.

7. Transport Layer 4 Protocol TCP & UDP. Three-way handshakes open 06

Layer connection. Session Layer design issue, Presentation layer
design issue, and Application layer design issue.

8. Application Application Layer protocols: TELNET, FTP, HTTP,SNMP, 06

Layer DNS, SMTP, FTP, HTTP, WWW and recent development.

Total=48

Recommended Books:
1. Tanenbaum, Computer Network, Prentice Hall India
2. William Stalling, Data and Computer Communication, Prentice Hall
3. Douglas E. Comer, Internetworking with TCP/IP Volume – I, Prentice Hall India
4. W. Richard Stevens, TCP/IP Illustrated Volume-I, Pub. Addison Wesley
5. B. Forouzan, Data Communication And Networking, TMH

79
 Title of the course : Object Oriented Programming
Subject Code : OECS-612D
Weekly load : 3 Hrs LTP 3-0-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand the difference between object oriented programming and procedural programming
CO2 Choose data types and structures to solve mathematical and scientific problems
CO3 Write programs using C++ features such as composition of objects, operator overloading,
inheritance, polymorphism etc.
CO4 Simulate the real world problems into object-oriented programs
CO5 Illustrate the process of data file manipulations using C++

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
CO's PO PSO1
PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO2
1
CO1 3 2 2 1 0 0 0 0 0 0 0 2 3 1
CO2 3 3 3 3 3 3 0 0 3 3 3 3 3 3
CO3 3 3 3 3 3 3 0 0 3 3 3 3 3 3
CO4 3 3 3 3 3 3 0 0 3 3 3 3 3 3
CO5 3 3 3 3 3 3 0 0 3 3 3 3 3 3

Theory
Unit Main Topics Course outlines Lecture(s)
1. Introduction Basic concepts of object-oriented programming, Characteristics 06
of object-oriented programming, Comparison between
procedural programming paradigm and object-oriented
programming paradigm.
2. Classes and Specifying a class, Creating class objects, Accessing class 06
Objects members, Access specifiers – public, private, and protected,
Unit-1 Static members variables and functions, Static class objects, The
const keyword, Friend functions, Friend classes, Empty classes,
Nested classes, Local classes, Abstract classes, Container
classes.
3. Constructors Need for constructors and destructors, Default constructor, 06
and Parameterized constructor, Copy constructor, Dynamic
Destructors constructors, Destructors, Constructors and destructors with
static members.
4. Inheritance Introduction, Defining derived classes, Forms of inheritance, 06
Ambiguity in multiple and multipath inheritance, Virtual base
class, Object slicing, Overriding member functions, Object
composition and delegation, Order of execution of constructors
and destructors.

80
 5. Virtual Concept of Binding - Early binding and late binding, Virtual 06
Functions and functions, Pure virtual functions, Abstract classes, Virtual
Polymorphism destructors & polymorphism.
6. Operator Defining operator overloading, Rules for overloading operators, 06
Overloading Overloading of unary operators and binary operators,
and Type Overloading of new and delete operators, Type conversion -
Conversion Basic type to class type, Class type to basic type, Class type to
another class type.
7. Pointers and Understanding pointers, Accessing address of a variable, 06
Unit-2 Dynamic Declaring & initializing pointers, Accessing a variable through
Memory its pointer, Pointer arithmetic, Pointer to a pointer, Pointer to a
Management function, Dynamic memory management - new and
delete Operators, Pointers and classes, Pointer to an object,
Pointer to a member, this Pointer, Self-referential classes,
Possible problems with the use of pointers - Dangling/wild
pointers, Null pointer assignment, Memory leak and allocation
failures.
8. Exception Exception and its types, Exception handling mechanisms, File 06
Handling and streams, Hierarchy of file stream classes, Error handling during
Managing Data file operations, Reading/Writing of files, Accessing records
Files randomly, Updating files, Data formatting in memory buffers.
Total=48

Recommended Books:
1. Lippman, S.B. and Lajoie, J., C++Primer, Pearson Education.
2. Stroustrup, Bjarne, The C++ Programming Language, Pearson Education.
3. YashwantKanetkar, Let Us C++, BPB
4. Robert Lafore, Turbo C++, Pearson India

81
 Title of the course : Database Management System
Subject Code : OECS-612E
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Gain a good understanding of the architecture and functioning of database management
systems as well as associated tools and techniques
CO2 Understand principles of data modeling using entity relationship to develop a good database
design and normalization techniques to normalize a database
CO3 Understand and use structured query language to query, update, and manage a database
CO4 Evaluate and optimize queries
CO5 Understand transaction processing, backup and recovery techniques

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Programme Outcomes (POs)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 2 2 0 0 0 0 0 0 3 2 3
CO2 3 2 2 2 2 0 0 0 2 0 2 2 2 2
CO3 2 2 3 2 2 2 0 0 3 2 2 2 2 2
CO4 2 2 2 2 2 2 0 0 2 0 2 2 2 3
CO5 3 3 2 2 3 2 0 0 2 2 2 2 2 3

Theory
Unit Main Topics Course outlines Lecture(s)
1. Introduction Data, data processing requirement, desirable characteristics of
an ideal data processing system, traditional file based system,
04
its drawback, concept of data dependency, Def of database,
database management system.
2. Database 3-schema architecture: external-conceptual-internal, database
concepts terminology, benefits of DBMS, Database development process
- conceptual data modeling, logical database design, physical 06
database design, database implementation, database
maintenance.
Unit-1
3. Database Conceptual data modeling using E-R data model -entities,
Analysis attributes, relationships, generalization, specialization,
06
specifying constraints: total and partial participation. 5 – 6
practical problems based on E-R data model.
4. Database Logical database design and relational data model:
Design Introduction to relational database theory: def of relation,
relational model operators, relational model integrity rules, 08
Normalization- 1NF, 2NF, 3NF, 4NF, BCNF & practical
problems based on these forms. Denormalization.

82
 5. Database Introduction to SQL, DDL aspect of SQL, DML aspect of SQL
Implementat – update, insert, delete & various form of SELECT- simple,
ion using special operators, aggregate functions, group by clause, 08
sub query, joins, co-related sub query, union clause.
6. Query Introduction, Query plan,ways of evaluating a given query,
optimization Overview of optimization process, expression transformation, 06
database statistics, A divide and conquer strategy.
Unit-2 7. Transaction Transaction concept, transaction state, Implementation of
processing atomicity and durability, concurrent execution, Serializability,
recoverability, Implementation of isolation, transaction 04
definition in SQL.
8. Overview of Failure classification, Storage structure, recovery and atomicity,
backup and log based recover , shadow paging, recovery with concurrent
06
recovery transaction, buffer management, failure with loss of non-
process volatile storage, advance recovery techniques.
Total=48

Recommended Books:
1. A Silberschatz, H. F. Korth, and S Sudarshan, Database System Concepts, TMH.
2. McFadden, F.Hoffer, M. B Modern database management, Prescott.
3. C.J Date, An Introduction to Database Systems, Addison, Wesley.
4. Raghu Ramakrishnan and Gehrke,Database Management System, McGraw-Hill.
5. Margaret.H.Dunham , Data Mining. Introductory and advanced topics, Pearson.

83
 Title of the course : Application Development using Python
Subject code : MDCS-611
Weekly load : 4 Hrs LTP 3-1-0
Credits :4
Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand why Python is a useful scripting language for developers.
CO2 Learn how to design and program Python applications.
CO3 Learn how to use lists, tuples, and dictionaries in Python programs.
CO4 Learn how to design object‐oriented programs with Python classes.
CO5 Learn how to use exception handling in Python applications for error handling.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 2 3 3 3 1 0 0 1 0 2 3 1 3
CO2 1 2 3 3 3 1 0 0 1 0 3 3 2 2
CO3 0 1 3 2 3 0 0 0 0 0 0 2 3 2
CO4 0 1 3 3 3 0 0 0 0 0 0 2 3 2
CO5 0 1 3 2 3 0 0 0 0 0 0 2 3 2

Theory
Unit Main Topics Course outlines Lecture(s)
Unit 1. Fundamental Concept of an algorithm, program, programming languages, need 09
-1 concepts of of programming, scenario, development of code from an algorithm,
the concept, need and use of pseudo code, variables, datatypes,
programming operators, implicit/explicit type conversion, functions in programs.
2. Control Selection and iteration control statements: if, else, nested if else, for 09
statements while and nested loops; break, continue, pass
3. Testing and Unit testing (path coverage and boundary value analysis), 05
debugging introduction of debugging, introduction of Eclipse: basic, tip to
handle infinite loop
Unit 4. Collections Introduction to collections, list, array, tuple, string, set, dictionary, 09
-2 basic operations and built-in method/function of: list, array, tuple,
string, set, dictionary
5. Function Definition of function, arguments, argument behavior, types of 09
argument, variables and its scope, function calling, types of
function, recursive function, revisiting function
6. Exception Introduction and need of Exception handling in code 02
handling
7. Modules and Introduction to modules, package, libraries, introduction to math, 05
libraries random, combination, itertools, Numpy library
Total=48

84
Recommended Books:
1. Mark Lutz, Learning Python, O’Reilly.
2. David Beazley and Brian K. Jones, Python Cookbook, O’Reilly.
3. David Beazley, Python Essential Reference, Developer’s Library.
4. John V. Guttag, Introduction to Computation and Programming Using Python, The MIT
Press.
5. Zed Shaw, Learn Python the Hard Way, Pearson.

85
 Title of the course : Big Data Analytics
Subject Code : HDCS-611
Weekly load : 4 Hrs LTP 3-1-0
Credit :4
Course Outcomes: At the end of the course, the student will be able to:
CO1 Summarize the workflow of analytics process model, its requirements and applications.
CO2 Apply suitable data pre-processing techniques for the given dataset.
CO3 Demonstrate different predictive, Descriptive and text analytic models.
CO4 Examine Survival Analysis model and learn through Social Network Analytics.
CO5 Define the Text Analytics method, Text Analytics Metrics and their applications
CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):
Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 1 0 0 0 0 0 0 1 0 0 0 1 1
CO2 1 1 1 0 2 0 0 0 1 1 0 0 3 2
CO3 2 1 1 0 3 0 0 2 2 2 0 0 1 2
CO4 3 2 2 1 3 1 0 1 2 2 0 0 2 1
CO5 1 1 1 0 2 0 0 2 1 1 0 0 1 2

Theory

Unit Main Topics Course outlines Lecture(s)

1. Introduction What is big data, why big data, convergence of key trends, 08
unstructured data,industry examples of big data, web
analytics, big data and marketing, fraud and big data, risk and
big data, credit risk management, big data and algorithmic
trading, big data and healthcare, big data in medicine,
advertising and big data, big data technologies, introduction to
Hadoop, open source technologies, cloud and big data, mobile
business intelligence, Crowd sourcing analytics, inter and
Unit-1 trans firewall analytics
2. NoSQL Introduction to NoSQL, aggregate data models, aggregates, 08
key-value and document data models, relationships, graph
databases, schemaless databases, materialized views,
distribution models, sharding, master-slave replication, peer
peer replication, sharding and replication, consistency,
relaxing consistency ,version stamps, map-reduce, partitioning
and combining, composing map-reduce calculations.
3. Hadoop Data format, analyzing data with Hadoop, scaling out, 08
Hadoop streaming, Hadoop pipes, design of Hadoop
distributed file system (HDFS), HDFS concepts, Java
interface, data flow, Hadoop I/O, data integrity, compression,
serialization, Avro, file-based data structures

86
 4. MapReduce MapReduce workflows, unit tests with MRUnit, test data and 08
local tests, anatomy of MapReduce job run, classic Map-
reduce, YARN, failures in classic Map-reduce and YARN,
job scheduling, shuffle and sort, task execution, MapReduce
types, input formats, output formats
Unit-2 Hbase, data model and implementations,Hbaseclients, Hbase
5. Hbase and 08
Cassandra examples, praxis Cassandra, Cassandra data model, Cassandra
examples, Cassandra clients, Hadoop integration
6. High Level Pig, Grunt, pig data model, Pig Latin, developing and testing 08
utilities(Pig, Pig Latin scripts.Hive, data types and file formats, HiveQL
Grunt, Hive) data definition, HiveQL data manipulation, HiveQL queries.

Total=48
Recommended Books:
1. Michael Minelli, Michelle Chambers, and AmbigaDhiraj, "Big Data, Big Analytics: Emerging
2. Business Intelligence and Analytic Trends for Today's Businesses", Wiley, 2013.
3. P. J. Sadalage and M. Fowler, "NoSQL Distilled: A Brief Guide to the Emerging World of
Polyglot Persistence", Addison-Wesley Professional, 2012.
4. Tom White, "Hadoop: The Definitive Guide", Third Edition, O'Reilley, 2012.
5. Eric Sammer, "Hadoop Operations", O'Reilley, 2012.
6. E. Capriolo, D. Wampler, and J. Rutherglen, "Programming Hive", O'Reilley, 2012.
7. Lars George, "HBase: The Definitive Guide", O'Reilley, 2011.
8. Eben Hewitt, "Cassandra: The Definitive Guide", O'Reilley, 2010.
9. Alan Gates, "Programming Pig", O'Reilley, 2011.

87
 Title of the course : Internet of Things
Subject Code : HDCS-612
Weekly load :4 LTP 310
Credit :4
Course Outcomes: At the end of the course, the student will be able to:
CO1 Effective usage of IoT deployment for different sectors.

CO2 Developing and modifying code for various sensor based applications using wireless
sensor modules and working with variety of modules like environmental and security
module.
CO3 Exploring the features of predictive data analytics for IoT applications.
CO4 Modular hands on training will enable participants to conduct IoT related activities in
academic environment and initiate new projects in Industrial sectors.
CO5 Design a simple IoT system comprising sensors, edge devices and wireless network
connections involving prototyping, programming and data analysis.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 0 0 0 0 0 0 2 0 1 2
CO2 3 3 3 3 2 0 0 0 0 0 0 0 3 1
CO3 3 2 2 2 2 2 1 0 0 0 0 0 1 2
CO4 3 3 2 3 3 1 2 0 0 0 2 0 3 1
CO5 2 2 3 1 3 2 1 0 0 0 1 1 3 2

Main Topics Course outlines Lecture(s)

Unit-1 Introduction to IoT Introduction to IoT Defining IoT, Characteristics of IoT, Physical 08
design of IoT, Logical design of IoT, Functional blocks of IoT,
Communication models & API’s
IoT& M2M Machine to Machine, Difference between IoT and M2M, Software 08
define network
Network and Wireless medium access issues, MAC protocol survey, Survey 08
communication routing protocols, sensor deployment & Node Discovery, Data
aspects aggregation & dissemination
Unit-2 Domain specific Home automation, Industry applications, Surveillance applications, 08
applications of IoT other IOT applications
Challenges in IOT Design challenges, Development challenges, security challenges, 08
other challenges
Developing IOT’s Introduction to Python, Introduction to different IOT tools, 08
Developing applications through IOT tools, Developing Sensor based
application through embedded system platform, Implementing IOT
concepts with Python
Total=48
88
Recommended Books:

1. SAMuel Greengard, “the Internet of Things”.

2. Klaus Schweb, “The Fourth Industrial revolution”.
3. CunoPfister, “Getting Started with Internet of Things”
4. Peter Wahel, “Learning Internet of Things.

89
SEMESTER-VI

90
 Title of the course : Design and Analysis of Algorithms
Subject code : PCCS-621
Weekly load : 3 Hrs LTP 2-1-0
Credits :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand about algorithm complexities
CO2 Have an understanding of elementary and advanced data structures
CO3 Acquire knowledge about various advanced design and analysis techniques such as divide-
and-conquer, greedy algorithms, dynamic programming, branch-and-bound
CO4 Know the concept of tractable and intractable problems and the P, NP, NP-complete
problems
CO5 Utilize data structures and/or algorithmic design techniques for developing efficient
computer algorithm for solving real-world problems

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 2 3 2 2 0 0 2 0 2 2 2 2
CO2 3 3 3 2 2 2 0 0 2 0 2 2 2 2
CO3 3 2 2 2 3 2 0 0 3 3 3 3 3 2
CO4 3 3 3 3 3 3 0 0 3 2 3 3 2 2
CO5 3 3 3 2 3 2 0 0 3 3 3 3 3 3

Theory
Unit Main Topics Course Outline Lecture(s)
Unit-1 1. Introduction Notion of an algorithm; Fundamentals of algorithmic problem 06
solving; Performance analysis: space complexity, time
complexity; Asymptotic notations: big-oh notation (O), omega
notation (Ω), theta notation (Θ);Mathematical analysis of non-
recursive algorithms; Mathematical analysis of recursive
algorithmsthrough recurrence relations (substitution method,
iteration method, recursion tree method,Master’s theorem)
2. Searching and Searching: linear search, binary search; Sorting: insertion sort, 02
Sorting selection sort, quick sort, merge sort; priority queues; heaps
3. Graphs and Graphs:Introduction; Graph exploration: BFS, DFS; 06
Search Trees Applications of BFS: shortest path for unweighted graph,
cycle detection in undirected graph, finding all nodes within
one connected component; Applications of DFS: cycle
detection in a graph, finding strongly connected components
of a graph; Directed acyclic graphs; Network flow algorithm;
Search trees: Introduction; Traversals; Insertions; Deletions;
Balancing (AVL trees)

91
 4. Divide and Introduction; Median of two sorted arrays; Counting 02
Conquer inversions; Nearest pair of points; Quick sort vs. merge sort
Unit-2 5. Greedy Introduction; Finding minimum number of coins; Knapsack 04
Method problem; Job sequencing problem; Minimum cost spanning
trees: Prim’s algorithm, Kruskal’s algorithm; Single source
shortest paths: Dijkstra’s algorithm; Optimal tree problem:
Huffman coding
6. Dynamic Memorization; General method with examples; Coin change 06
Programming problem; Edit distance; Longest ascending subsequence;
Matrix multiplication; All-pairs shortest paths: Floyd’s
algorithm; Knapsack problem; Bellman-Ford algorithm
7. Backtracking Backtracking:General method; N-queens problem; Sum of 04
and Branch subsets problem; Graph coloring; Hamiltonian cycles; Branch
and Bound and bound:Job assignment problem;Travelling salesperson
problem; 0/1 knapsack problem
8. Tractable and Computability of algorithms; Computability classes – P,NP, 02
Intractable NP-complete and NP-hard; Cook’s theorem; Standard NP-
Problems complete problems and reduction techniques.
Total=32

Recommended Books:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein,
Introduction to Algorithms, The MIT Press.
2. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman, The Design and Analysis of
Computer Algorithms, Addison-Wesley Pub. Co.
3. Jon Kleinberg, and EvaTardos, Algorithm Design, Pearson Education.
4. Ellis Horowitz, and Sartaj Sahni, Fundamentals of Computer Algorithms, Galgotia
Publications.
5. Robert Sedgewick, and Kevin Wayne, Algorithms, Addison-Wesley Pub. Co.
6. S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani, Algorithms, McGraw-Hill
Education.

92
 Title of the course : Automata Theory and Formal Languages
Subject Code : PCCS-622
Weekly load : 3 Hrs LTP 2-1-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand basic properties of deterministic and nondeterministic finite automata
CO2 Understand the relation between types of languages and types of finite automata
CO3 Design grammars and recognizers for different formal languages
CO4 Prove or disprove theorems in automata theory using its properties
CO5 Determine the decidability and intractability of computational problems

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Programme Outcomes (POs)
Cos PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3 3 2 1 2 0 0 2 2 2 2 2 2
CO2 2 3 3 2 1 2 0 0 2 2 2 3 3 2
CO3 2 3 3 2 2 3 0 0 3 2 2 3 3 2
CO4 2 3 3 3 3 2 0 0 2 2 2 3 3 3
CO5 2 3 3 3 3 3 0 0 2 2 2 3 2 3
Theory

Unit Main Topics Course outlines Lecture(s)

Unit-1 1. Finite Finite state systems, Deterministic, non deterministic finite 08
Automata automata, equivalence of deterministic and non-deterministic
finite automata, Finite automates with & without Ɛ-moves, 2
way finite automata with output, equivalence of Mealy and
Moore machines.
2. Regular Identification of Regular expressions, Finite Automata and 04
Languages Regular expression

3. Properties of The pumping lemma for regular sets, closure properties of 05

Regular Sets: regular sets, decision algorithms of regular sets, The Myhill-
Nerode Theorem & minimization of finite Automata.
4. Context free Introduction to context free grammars, derivation trees, top- 05
grammars down & bottom up parsing methods, ambiguous context free
grammars, Chomsky and Greibach normal forms.

Unit-2 5. Pushdown Deterministic and Non-deterministic pushdown automata, 04

Automata: Equivalence of context free languages and sets accepted by
pushdown automata, Deterministic context free languages.

93
 6. Properties of The pumping Lemma for context free languages, closure 06
Context free properties of context free languages, decision algorithms for
Languages context free languages, Coke-Kasmi-Young algorithm.

7. Turning Introduction to Turing Machines, Deterministic, non- 08

Machines: deterministic, two way infinite tape, multi tape,
Constructions of Turing Machines for n!, n*n.
8. Turning Post Correspondence problem, Unsolvability of the halting 08
Machines problems.
Total=48

Recommended Books:
1. Daniel A. Cohen, Introduction to Computer Theory, John Wiley and Sons (1996)
2. Hopcroft John E., Ullman Jeffrey D. and Motwani R., Introduction to Automata Theory,
Languages and Computation, Pearson Education (2006).
3. Michael Sipser, Introduction to the Theory of Computation, Thomson (2007).
4. Lewis Harry R., Elements of Theory of Computation, PHI (1997).
5. K.L.P. Mishra, N. Chandrasekaran, “Theory of Computer Science: Automata.

94
 Title of the course : Design and Analysis of Algorithms Lab
Subject Code : PCCS-623
Weekly load : 4 Hrs LTP 0-0-4
Credit :2

Course Outcomes: At the end of the course, the students will be able to:
CO1 Learn how to analyse a problem and design a solution for the problem
CO2 Acquire hands-on skills to implement various advanced algorithm design such as divide-
and-conquer, greedy algorithms
CO3 implement Quick sort ,Merge sort algorithm, BFS and DFS algorithms
CO4 Implement Dynamic Programming algorithm for the 0/1 Knapsack problem
CO5 Utilize data structures and/or algorithmic design techniques for developing efficient
computer algorithm for solving real-world problems

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 2 2 0 0 0 0 0 0 2 1 2
CO2 3 3 3 2 2 0 0 0 0 0 0 0 2 2
CO3 3 3 2 2 0 2 2 0 0 0 0 0 3 3
CO4 0 0 1 1 0 1 0 2 1 2 0 1 2 3
CO5 3 3 3 2 2 0 0 0 0 0 0 0 2 2

LIST OF PRACTICALS
1. Use divide and conquer method to recursively implement:
a) Binary search
b) Linear search
2. Sort a given set of elements using the insertion sort method.
3. Sort a given set of elements using the selection sort method.
4. Sort a given set of elements using the quick sort method and determine the time required to sort
the elements. Repeat the experiment for different values of n, the number of elements in the list
to be sorted and plot a graph of the time taken versus n. The elements can be read from a file or
can be generated using the random number generator.
5. Implement merge sort algorithm to sort a given set of elements and determine the time
required to sort the elements. Repeat the experiment for different values of n, the number of
elements in the list to be sorted and plot a graph of the time taken versus n. The elements can

95
 be read from a file or can be generated using the random number generator.
6. Sort a given set of elements using the heap sort method and determine the time required to
sort the elements. Repeat the experiment for different values of n, the number of elements in
the list to be sorted and plot a graph of the time taken versus n. The elements can be read
from a file or can be generated using the random number generator.
7. From a given vertex in an unweighted connected graph, find shortest paths to other vertices
using BFS.
8. Given an undirected graph, use BFS to check if there is a cycle in the graph.
9. Use BFS to find all connected components in a graph and finding all vertices within a
connected component.
10. Given a directed graph, use DFS to check if there is a cycle in the graph.
11. Check whether a given graph is connected or not using DFS method.
12. Use DFS to find all strongly connected components in a directed graph.
13. Obtain the topological ordering of vertices in a given directed graph.
14. For a given set of elements, construct an AVL Tree and also display balance factor for
each node.
15. Find the median of the two sorted arrays of different sizes using divide and conquer
approach.
16. Count the number of inversions in an array with the help of merge sort.
17. Find out the closest pair of points in the array using divide and conquer approach.
18. Given a value V, if we want to make change for V Rs., and we have infinite supply of each
of the denominations in Indian currency, i.e., we have infinite supply of {1, 2, 5, 10, 20, 50,
100, 200, 2000} valued coins/notes, what is the minimum number of coins and/or notes
needed to make the change? Implement the greedy algorithm to find minimum number of
coins.
19. Find the minimum cost spanning tree of a given undirected graph using:
a) Kruskal’s algorithm
b) Prim’s algorithm
20. From a given vertex in a weighted connected graph, find shortest paths to other vertices
using Dijkstras’s algorithm.
21. Implement the longest ascending subsequence problem using dynamic programming.

96
 22. Implement matrix chain multiplication problem using dynamic programming.
23. Implement 0/1 Knapsack problem using dynamic programming.
24. Write a program to find the shortest path using Bellman-Ford algorithm.
25. Implement branch and bound scheme to find the optimal solution for:
a) Job assignment problem
b) Traveling salesperson problem.
Note: The above mentioned list of experiments is suggested list. Teacher may add more programs/
experiments as per requirement.

97
 Title of the course : Multimedia and Animation
Subject Code : PECS- 621A
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand all the basic in the multimedia technologies.
CO2 with all phases like digital images, digital audio & video, compression & standards etc.
CO3 Use and apply tools for image processing, video, sound and animation.
CO4 Apply methodology to develop a multimedia system.
CO5 Understand the fundamental principles of animation in addition to an invaluable
appreciation for observational techniques & the art of planning.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 3 3 1 0 0 0 0 1 3 1 2
CO2 3 2 3 2 3 1 0 0 0 0 1 3 2 3
CO3 3 3 3 3 3 0 0 0 0 0 1 3 2 3
CO4 2 1 0 0 0 2 1 0 0 2 0 0 2 2
CO5 3 2 3 2 3 1 0 0 0 0 1 3 2 3

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Introduction Introduction to Multimedia, Design Processes, Hypertext, Links, 08
Frames, Files, HTML, HGML, Morphing, and Media Control
interfaces. Multimedia Tools, Elements of Multimedia, Sound
Input, Video Input, Data Automation, General Devices.
2. Text and Types of text, Font, insertion, compression, File formats. Types 08
Image of images, color models, Basic steps for image processing,
principle and working of scanner and digital camera, Gamma
and gamma correction.
3. Audio and Fundamental characteristics of sound, sensors for TV cameras, 08
Video color fundamentals, additive and subtractive color mixing,
technology Liquid crystal display (LCD), Plasma Display Panel (PDP), file
formats , Video for Window, QuickTime
Unit-2 4. Multimedia Overview, multimedia authoring metaphor, multimedia 08
presentation production, presentation and automatic authoring, Design
and authoring paradigms and user interface, overview of tools like adobe
premiere, director, flash and Dreamweaver.

98
 5. Animation Introduction and examples of Animation. Types of Animation 08
Cel Animation, Stop Motion Animation, Computer Animation,
2-D Animation, 3-D Animation.
6. Basic Illusion of Life, straight action and pose to pose Timing, 08
Principles of Exaggeration, Drama and Psychological Effect, Fade in and
Animation Fade out, Squash and Stretch, Anticipation, staging, follow
through and overlapping action, Arcs, Solid Drawing ,Appeal,
slow in and slow out, Secondary Action.
Total=48
Recommended Books:
1.Principles of Multimedia by Ranjan Parekh. Tata McGraw-Hill
2.Multimedia technologies by Ashok banerji
3.Prabhat K. Andleigh and Kiran Thakrar, “Multimedia Systems Design”, PHI publication
4.John F. Koegal Buford, “Multimedia systems”, Pearson Education.
5. The complete animation course by Chris Patmore Pub.-Baron’s Educational Series.(New York)
Animation Unleashed by Ellen Bessen, Michael Weise Productions,2008(U.S.A)

99
 Title of the course : Artificial Intelligence
Subject code : PECS-621B
Weekly load : 3 Hrs LTP 3-0-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Solve a problem as a state space problem.
CO2 Apply suitable search technique for a random search problem.
CO3 Understand probabilistic reasoning.
CO4 Understand optimization and inference algorithms for model learning
CO5 Design and develop programs for an agent to learn and act in a structured environment.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 2 2 2 2 1 0 0 0 0 0 2 2 1
CO2 2 3 2 3 2 2 0 0 0 2 2 2 3 2
CO3 2 2 2 3 3 3 0 0 2 2 2 3 3 2
CO4 2 2 2 3 3 3 0 0 2 3 3 3 3 2
CO5 2 2 2 2 3 2 0 0 2 2 2 2 2 3

Theory
Unit Main Topics Course Outline Lecture(s)
Unit-1 1. Introduction Concept of AI, history, current status, scope, agents, 08
environments, Problem Formulations, Review of tree and graph
structures, State space representation, Search graph and Search
tree.
2. Search Random search, Search with closed and open list, Depth first 08
Algorithms and Breadth first search, Heuristic search, Best first search, A*
algorithm, Game Search.
3. Probabilistic Probability, conditional probability, Bayes Rule, Bayesian 08
Reasoning Networks-representation, construction and inference, temporal
model, hidden Markov model.
Unit-2 4. Markov MDP formulation, utility theory, utility functions, value 12
Decision iteration, policy iteration and partially observable MDPs.
process
5. Reinforcement Passive reinforcement learning, direct utility estimation, 12
Learning adaptive dynamic programming, temporal difference learning,
active reinforcement learning-Q learning.
Total=48

100
Recommended Books:
1. Stuart Russell and Peter Norvig, “Artificial Intelligence: A Modern Approach”,
3rdEdition, Prentice Hall.
2. Elaine Richand Kevin Knight, “Artificial Intelligence”, Tata McGraw Hill.
3. Trivedi, M.C., “A Classical Approach to Artificial Intelligence”, Khanna Publishing
House, Delhi.
4. Saroj Kaushik, “Artificial Intelligence”, Cengage Learning India, 2011.
5. David Poole and Alan Mackworth, “Artificial Intelligence: Foundations for
Computational Agents”, Cambridge University Press 2010.

101
 Title of the course : Mobile Communication
Subject Code : PECS-621C
Weekly load : 3 Hrs LTP 3-0-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Make students familiar with fundamentals of mobile communication systems.
CO2 Identify the requirements of mobile communication as compared to static communication.

CO3 Identify the limitations of 2G and 3G wireless mobile communication and use design of 4G
and beyond mobile communication systems.
CO4 Outline cellular mobile communication standards.
CO5 Analyze various methodologies to improve the cellular capacity

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 0 0 0 0 2 0 0 2 2 2 2 3 2
CO2 2 2 2 0 0 2 0 0 2 3 2 2 2 2
CO3 2 2 2 2 2 2 0 0 2 3 3 2 2 2
CO4 3 2 2 2 2 2 0 0 2 3 2 3 2 3
CO5 2 2 2 2 2 2 0 0 2 3 2 2 3 3

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1.Introduction History of wireless communication, Need of mobility, 06
Application of wireless communication, Cellular concept
2.First Generation Advanced Mobile Phone System (AMPS) and Nordic 08
(1G) Mobile Mobile Telephony (NMT), frequency allocation, channels,
Systems modulation, multiple access scheme, network operation.
3.Second Network architecture, channels and operation of GSM, 10
Generation (2G) CDMAOne (IS-95), and IS-41, mobility management,
Mobile Systems Network operations of GPRS, CDMATwo (IS-95B),
CDPD, and HCSD.
Unit-2 4.Third 3G spectrum requirements, enabling technologies, service 12
Generation (3G) classes, applications and radio access standards (WCDMA
Mobile Systems and CDMA2000), Introduction to EDGE and WLAN.
Introduction to 4G.

102
 5.Network Layer Mobile IP, Goals, Assumptions and requirements, Entities 12
Mobility and terminology, IP packet delivery, Agent advertisement
and discovery, Registration, Tunnelling and Encapsulation
, Optimisation , Reserve Tunnelling, ipv6 Protocol,
Dynamic Host configuration Protocol(DHCP), Micro-
mobility.
Total=48
Recommended Books:
1. J.Schiller, Mobile Communications, Pearson Education.
2. Pomportsis, Wireless Networks, John Wiley and Sons.

103
 Title of the course : Software Project Management
Subject Code : PECS-621D
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:

CO1 Comprehend software project management activities

CO2 Understand various steps required for project planning
CO3 Create an estimation and effective cost benefit evaluation techniques
CO4 Design framework for risk management
CO5 Comprehend resource management

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2
CO1 3 2 2 2 3 2 3 0 0 0 0 1 1
CO2 3 3 2 2 2 2 3 0 0 2 0 2 2
CO3 3 2 2 2 3 2 3 2 0 2 0 2 3
CO4 2 2 2 3 3 2 3 2 0 0 0 1 3
CO5 3 3 2 2 3 2 2 0 0 0 2 2 2

Theory

Unit Main Topics Course outlines Lecture(s)

Unit-1 1. Introduction Introduction to software project management, types of 12
project, project attributes, project constraints, importance of
management, problems with software projects, management
control, role of project manager, steps in project planning,
Programme management

2. Software A system view of project management, stakeholder 12

Cost and management Assessment of projects, Cost-benefit Analysis,
Time Cash flow forecasting, Cost-benefit evaluation techniques,
Estimation Choice of process model, developing the project schedule,
Estimation Techniques, COCOMO Model

Unit-2 3. Planning Objective of Planning, Project Schedule, Activities – 12

Sequencing and Scheduling, Development of Project
Network, Time Estimation, Critical Path and Activities.
Introduction to project risk management, Risk categories,
identification, assessment, planning, management, Software

104
 Configuration Management Process: Version Control, Change
Control management

4. Software Resources, Nature of Resources, developing the project 12

Project budget, monitoring and controlling the project, project
Management metrics, Project targets, associating human resource with job,
Motivation, Oldham- job Characteristics Model, Decision
Making, Leadership, Stress Management, Health and Safety

Total=48
Recommended Books:
1. Bob Hughes, Mike Cotterell, “Software Project Management”, Tata McGraw Hill.
2. Prasanna Chandra, “Projects: Panning, Analysis, Selection, Financing, Implementation
and Review”, Tata McGraw Hill Publication.
3. Jeffrey K. Pinto, “Project Management”, Pearson Publications.

105
 Title of the course : Decision Support System
Subject Code : PECS-621E
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand fundamental concepts associated with DSS
CO2 Develop skill in the system analysis, design and implementation of computerized DSS
CO3 Learn various knowledge representation techniques
CO4 Identify decision support tools that can aid decision making.
CO5 Develop a functional prototype of a decision support system for a given case.
CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):
Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 3 1 0 2 3 3 3 2 1 1
CO2 3 2 2 2 3 1 0 2 3 3 3 2 2 2
CO3 3 2 2 2 3 1 0 2 3 3 3 2 2 3
CO4 3 2 2 2 3 1 0 2 3 3 3 2 2 2
CO5 3 2 2 1 3 2 0 2 3 3 2 1 2 2

Theory
Unit Main Topics Course outlines Hour(s)
1. Introduction to Concepts of Data, Information, Information Systems & End 06
DSS Users, Systems Concepts: Open System, Closed System;
Information Systems and Systems Concept
2. Building System Analysis and Design – Systems Development Cycle 06
Information (Identification of Requirements, Feasibility Study, System
Unit-1 System Analysis, Design And Implementation), Prototyping
3. Decision Making Introduction and Definitions, Simons Decision Making 06
Model, How Decisions are Supported, DSS Configurations,
DSS Characteristics and Capabilities
4. Components of DSS Classifications DSS Modeling-Static and Dynamic 06
DSS Models, Certainty, Uncertainty, and Risk, Sensitivity
Analysis, What-IF, and Goal Seeking
5. Knowledge Definition and types of Knowledge, Frame work for 06
Management Knowledge Management, Knowledge Representation
System Techniques: Rules, Frames, Semantic Networks
6. Data Warehouse Data Warehousing Definitions and Concepts, Types of 06
and Data Mining Data warehouse, Data Mining Concepts and Applications,
Unit-2 Framework of datamining, Text Mining, Web Mining
Usage, Benefits, and Success of Business Analytics
7. Business Online Analytical Processing (OLAP), Reporting and 06
Analytics Queries, Multidimensionality, Knowledge Discovery in
Databases(KDD), framework of KDD
8. Future directions Future Directions in DSS and DSS Case Studies 06
Total=48

106
Recommended Books:
1. Turban, Efrain : Decision Support & Business Intelligent Systems(8e)- Pearson Education
2. Marakas, George.M. : Decision Support Systems in the 21st century – Pearson Education
3. Mallach, Efrem G. : Decision Support & data Warehouse Systems – Tata McGraw-Hill

107
 Title of the course : Advance Computer Architecture
Subject Code : PECS-621F
Weekly load : 3 Hrs LTP 3-0-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand uniprocessor and multiprocessor system
CO2 Design issues of vector and pipeline computers
CO3 Learn SIMD computer design and its effects on computation
CO4 Understand inter-processing element communication
CO5 Interpret performance of different pipelined processors.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 2 2 1 2 2 0 0 0 0 2 2 1 1
CO2 2 2 2 2 2 2 0 0 0 0 2 2 2 2
CO3 2 2 2 2 2 2 0 0 0 2 2 2 2 2
CO4 2 2 2 2 2 2 0 0 0 2 2 2 2 2
CO5 2 1 2 0 2 2 0 0 0 2 2 0 3 2

Theory

Unit Main Topics Course outlines Lecture(s)

Unit-1 1. Introduction to Evolution of Computer Architecture, Parallelism in 06

Parallel Uniprocessor systems, Parallel Computer Structures,
Processing Architectural Classifications schemes, Multiprocessors and
Multicomputers, Multivector and SIMD Computers,
Parallel processing applications

2. Memory and Hierarchical Memory structure, Virtual memory system, 06

Input-Output Memory Allocation and Management, Cache Memories
Subsystems and Management, Input-Output Subsystems.

3. Pipelining and Pipelining, Instruction and Arithmetic Pipelines, Principles 06

Vector of Designing Pipelined Processors, Vector Processing
Processing Requirements.
4. Pipeline Vector Super Computers, Scientific attached Processors, 06
Computers and Architecture of Cray-I, Pipeline Chaining and Vector
Vectorization Loops, Vectorization and Optimization Methods.
Methods

108
Unit-2 5. Array Processors SIMD Array Processors, SIMD Interconnection Networks 08
and Static & Dynamic Networks, Mesh Connected Network,
Interconnection Cube interconnection networks
networks
6. Parallel SIMD matrix multiplication, Parallel sorting for array 08
Algorithms for processors, Associative Array Processing
Array Processors
7. Multi-processor Functional Structures, Multi stage networks for 08
Architecture multiprocessors, Parallel Memory Organization
Total - 48

Recommended Books
1. Hawang Kai, Briggs F.A, “Computer Architectures and Parallel Processing”, McGraw-
Hill.
2. Kain Richard Y, “Advanced Computer Architecture”, PHI
3. Hwang Kai, “Advanced Computer Architecture”, McGraw-Hill
4. Mano M. “Computer System Architecture”, PHI

109
 Title of the course : Requirement Engineering
Subject Code : OECS-621A
Weekly load : 3 Hrs LTP 300
Credit :3
Course Outcomes: At the end of the course, the student will be able to:

CO1 Comprehend software engineering knowledge and principles

CO2 Understand requirement engineering and requirement elicitation
CO3 Comprehend requirement analysis and specifications
CO4 Design framework for software engineering projects
CO5 Make a reasoned choice about the best approach for requirements modelling given the
context of a project

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PO
PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
1
CO1 3 3 3 0 0 0 0 0 2 0 3 3 2 1
CO2 3 3 3 2 2 0 0 0 0 0 2 2 2 2
CO3 3 0 3 1 1 0 0 0 0 0 1 2 2 2
CO4 2 0 1 0 0 0 0 0 0 0 3 1 3 3
CO5 0 0 0 0 2 0 2 0 1 0 2 0 2 2

Theory

Unit Main Topics Course outlines Lecture(s)

Unit-1 1. Introduction Software engineering knowledge, process guidance 12
to software principles, practice guiding principles, framework guiding
engineering principles, communication principles, planning principles,
principles modelling principles, construction principles, deployment
principles
2. Requirement Introduction to requirement engineering, steps of 12
engineering requirement engineering, present state of practice, types of
and requirements, identifying stakeholders, recognizing multiple
requirements viewpoints, working toward collaboration, requirements
elicitation elicitation, interviews, brainstorming sessions, facilitated
application specific technique, quality function deployment
3. Requirement Requirements analysis, data flow diagrams, data dictionaries, 12

110
 analysis & Entity relationship diagrams, software prototyping, Software
specifications requirement specifications, nature of SRS, characteristics,
organization of SRS, introduction, overall description,
Unit-2
specific requirements, change management process,
approvals, supporting information.
4. Design Conceptual design and technical design, modularity, design 12
concepts strategy, bottom up design, top down design, hybrid design,
function-oriented design, object-oriented design, steps to
analyze object-oriented design
Total=48
Recommended Books:

1. Software Engineering, Roger S. Pressman, McGraw Hill publication.

2. Ian Sommerville, Software Engineering, Addison-Wesley Publishing Company
3. James F. Peter, Software Engineering - An Engineering Approach, John Wiley
4. Pankaj Jalote, An integrated Approach to Software Engineering, Narosa.

111
 Title of the course : Management Information System
Subject Code : OECS-621B
Weekly load : 3Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Describe relationship between concept of information system, organization, management
and strategies
CO2 Evaluate the role of information system in today's competitive business environment
CO3 Effectively communicate strategic alternatives to facilitate decision making
CO4 Explain how enterprise systems and industrial networks create new efficiencies for
businesses.
CO5 Analyze the principal causes of information system failure.
CO/PO Mapping : (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation):
Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 3 3 0 3 0 0 2 3 3 3 2 1 3
CO2 2 3 3 0 3 1 1 2 3 3 3 2 2 3
CO3 2 3 3 2 3 1 0 2 3 3 3 2 2 3
CO4 0 0 0 3 0 0 2 1 0 0 2 1 2 2
CO5 0 0 1 0 0 3 2 0 0 1 0 0 3 2

Theory
Unit Main Topics Course outlines Hour(s)
1. Understanding Introduction to Management Information Systems, History 06
MIS of MIS, Impact of MIS, Role and Importance, MIS
Categories, Managers and Activities in IS, Types of
Computers Used by Organizations in Setting up MIS,
Hardware support for MIS
Unit-1 2. Conceptual Introduction, The Decision Making Process, System 06
Foundations Approach to Problem Solving, The Structure of
Management Information System, Types of Management
Systems Concepts of Management Organization
3. MIS Planning, Introduction, Differences between planning and control 06
Control and information, Systems Analysis, Systems Design,
Development Development
4. MIS and BPR Introduction, Business Process Re – Engineering, 06
Improving a process in BPR, Object Oriented
methodology, BPR – Current Focus
5. MIS Organization Introduction, MIS at Management levels, Strategic Level 06
Structure Planning, Operational Level Planning, Economic and
Behavior Theories

112
 6. MIS – Support Introduction, Philosophy of Modeling, DSS: Deterministic 06
Models Systems, Market Research Methods, Ratio Analysis for
Unit-2 and Knowledge Financial Assessment, Management Science Models
Management
7. Strategic Introduction, Background, Performance, Product 06
Management differentiation and Value Chain, How IT influences
Information Organizations’ goals, The five levels, Governance Modes
System in the use of IT
8. Security, Ethical Introduction, Control Issues in Management Information 06
Issues and Case Systems, Security Hazards, Ethical Issues, Technical
Studies solutions for Privacy Protection and MIS Case Studies
Total=48
Recommended Books:
1. Kenneth C. Laudon : Management Information Systems- Pearson Education
2. Kenneth C. Laudon : Essentials of Management Information System – Pearson Education

113
 Title of the course : System Installation and Troubleshooting
Subject Code : OECS-621C
Weekly load : 3Hrs LTP 3-0-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand the functioning of various hardware components of computer and the installation
procedure of operating systems & drives required for functioning of the devices.
CO2 Understand the installation procedure of the latest software, peripheral devices and the
modems.
CO3 Understand about computer hardware and the installation procedure of system software and
application software.
CO4 A hands-on approach will be used to provide the student with a basic skill level to work on a
computer
CO5 Recognition and solution of common hardware-software problems including the replacement
or upgrading of components will be addressed

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PSO1 PSO2
CO1 0 3 2 2 0 0 0 0 0 3 2 3
CO2 0 3 2 2 0 0 0 0 0 3 1 3
CO3 0 3 2 2 0 0 0 0 0 3 2 2
CO4 2 0 0 1 0 2 2 3 3 0 2 1
CO5 1 0 0 0 1 0 1 0 0 0 1 2

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1.Introduction & Functioning of various hardware components i.e. CPU, 06
functioning RAM, ROM, Mother Board (AT, ATX, NLX), power supply

2. Introduction Ports (serial, parallel, USB etc), CD-ROM drive, sound card 06
& functioning , LAN card

3. Installation of The necessary steps for loading of various operating systems 06

various operating to a new computer system:
systems a) DOS / Linux / Unix
b) Windows XP
c) Window NT-Workstation / Server
d) Windows Vista / 7
4. Installation Installation procedure for various drives required for the 06
procedure for functioning of various devices, i.e. CD-ROM, MOUSE and

114
 various drives VGA or (Graphics Acceleration Card).

Unit-2 5. Installation of Installation of MS-Office 2003/2007/2010, Flash Player, 06

various software Photoshop, Antivirus in the system
packages
6. Installation of Installing of Digital Camera / Web Camera 06
peripheral device
7. Installation of Installing various printers and activating them to print text 06
Printer pages.

8. Installation of Installing an internal and external modem to a system 06

Modem including configuring the port to which the modem is
connected.

Total=48
Recommended Books:
1. W. L. Rosch, Hardware Bible, Que
2. Muller &Zacker, Upgrading and Repairing PC’s, PHI

115
 Title of the course : Internet Programming
Subject Code : OECS-621D
Weekly load : 3 Hrs LTP 3-0-0
Credit : 3 (Lecture 3)
Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand the concept of object oriented programming
CO2 Learn data type and variables of Java
CO3 Write programs using various features of Java
CO4 Understand the concept of applet and multi-threading
CO5 Learn the concept of AWT and event handling

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 3 1 1 0 0 0 0 0 0 0 2 2 1
CO2 3 3 3 2 2 0 0 0 0 0 0 3 1 1
CO3 3 3 3 3 2 0 0 0 1 0 0 3 3 2
CO4 3 3 3 3 3 1 1 0 1 0 0 3 3 3

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Introduction Programming; Need of Programming; Representation of 8
to Algorithms; Need for OOP; Class and Objects; Abstraction;
Programming Association; Composition; Aggregation; Inheritance: simple
and OOP inheritance, hierarchical inheritance, multilevel inheritance,
Basics hybrid inheritance; Encapsulation; Polymorphism: static
polymorphism, dynamic polymorphism;
2. Introduction Introduction to Java; Environment variables; JAVA-Home 8
to Java directory; Steps to develop a Java Program; Command line
arguments, Variables: value type, reference type;
Identifiers; Data Types: primitive data types, abstract data
types; Instance variables and Local Variables; Access
Specifiers; Access Modifiers; Keywords.
3. Operators, Unary Operators; Binary Operators; Types of Operators: 8
Classes and arithmetic operator, relational operator, logical operator,
Methods assignment operator, increment operator, decrement
operator, negation operator, bitwise operator, shift operator,
concatenation operator, new operator, instance operator;
Type Casting: implicit type casting, explicit type casting;
Methods and Parameters; Constructors; Overloading
Constructors; Overloading member functions; Abstract
class; Final class; Variables, Interfaces, Object;

116
 Constructors: default constructor, parameterized
constructor; Wrapper classes; Adapter Classes; Anonymous
Classes; Utility Classes; Generics.

Unit-2 4. Programming Selection control Structures; Iteration control Structure; 12

using Java Arrays: array initialization, array creation, multidimensional
array; Strings; Recursion; Regular Expression; Packages;
Exception Handling: errors in software engineering,
exception classes, keywords used in exception handling,
hierarchy of run time exception; Multithreading: life cycle
of a thread, creation of child thread, working with multiple
child thread, thread priorities, thread synchronization, and
monitors; Abstract Window Toolkit; Event Handling;
Window listener; Working With Menus; Dialog box; Card
Layout; Applets; Collections; Framework; Loading an
Image onto the Frame and Applet; Insets.
5. Debugging, Debugging; Code Analysis using Programming Mistake 12
Code Analysis Detector (PMD); Unit Testing using JUnit and Code
and Unit coverage
Testing
Total=48

Recommended Books:
1. Bert bates, Kathy Sierra, Head First Java, O’Reilly Media.
2. Steven Holzer, Java 8 programming, Dreamtech Press.

117
 Title of the course : Database Integrity and Security
Subject Code : OECS-621E
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: On successful completion of this course, students will be able to:
CO1 Describe the three schema architecture of DBMS.
CO2 Explain the join dependency and its types with an example.
CO3 Illustrate the role of different components in Data Base system environment.
CO4 Discuss the categories classified for data base management systems.
CO5 Review where and how the database users and passwords are maintained.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 2 2 0 0 0 0 0 0 3 2 3
CO2 3 2 2 2 2 0 0 0 2 0 2 2 2 2
CO3 2 2 3 2 2 2 0 0 3 2 2 2 2 2
CO4 2 2 2 2 2 2 0 0 2 0 2 2 2 3
CO5 3 3 2 2 3 2 0 0 2 2 2 2 2 3

Theory

Unit Main Topics Course outlines Lecture(s)

Unit-1 1. Database DBMS characteristics and advantages 04
System Data Model
Concepts and DBMS system environment and architecture
Architecture
2. Database E-R Diagram , Relational Constraints, Algebra, Normal 06
Design Forms and Decompositions
Theory and
Methodology
3. SQL - The Basic Integrity constraints and queries , Indexes and Views , 08
Relational Database connectivity
Database
Standard
4.Transaction Transaction concept, transaction state, Implementation of 06
processing atomicity and durability, concurrent execution,
Serializability, recoverability, Implementation of isolation,
transaction definition in SQL.
5. Database Database Security within the General Security Landscape 09
Security and and a Defense in-Depth Strategy, Application Security,

118
 Authorization Securing database-to-database communications,
Unit-2 Authentication and Password Security
6. Granular Advances in Access Control - Managing and Querying 08
Access Encrypted Data –Database Watermarking - Copyright
Control and Protection, Regulations and Compliance
Encryption
7. Trust Trust Negotiation - Auditing Categories - Auditing 07
Management Architectures
and Auditing
Total=48

Recommended Books:
1. Elamsri, Navathe, Somayajulu and Gupta, Database Concepts, Pearson Edu, 2006.
2. Michael Gertz, Sushil Jajodia, Handbook of Database Security: Applications and Trends,
Springer,2008.
3. Nilesh Shah, “Database Systems using Oracle”, 2nd edition, Prentice Hall of India Pvt
Ltd,2007.
4. Ron Ben Natan, “Implementing Database Security and Auditing”, Elsevier, 2005.
5. Alfred Basta, Melissa Zgola, Dana Bullaboy, Thomas L.Whitlock Sr.,” Database
Security”,Cencage Learning, 2012.
6. Bhavani Thuraisingham, “Database and Applications security – Integrating Information
security and Data Management”, Taylor & Francis Group, 2005.

119
 Title of the course : Object Oriented Analysis and Design
Subject Code : OECS-622A
Weekly load : 3 Hrs LTP 300
Credit :3
Course Outcomes: At the end of the course, the student will be able to:

CO1 Understand the concept of object-oriented development and create a static object model and
a dynamic behavioural model and a functional model of the system.
CO2 Understand the approaches to system design and object design, and the techniques of
translating design to implementation.
CO3 Implement the object-oriented modelling and design patterns to provide solutions to the
real-world software design problems.
CO4 Become familiar with the Unified modelling Language.
CO5 Understand the difference between writing programs for the software and doing analysis
and design.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 0 0 0 0 0 2 0 3 3 2 1
CO2 3 3 3 2 2 0 0 0 0 0 2 2 3 1
CO3 3 0 3 1 1 0 0 0 0 0 1 2 3 2
CO4 0 0 0 3 0 2 2 0 1 1 0 1 2 2
CO5 0 0 0 2 2 1 0 0 2 2 1 0 2 3

Theory

Unit Main Topics Course Outlines Lecture(s)

Unit-1 1. Introduction Object orientation; Development; Modeling; Object 04
modeling technique.
2. Object Modeling Objects and classes; Links and associations; 04
Generalization and inheritance; Grouping constructs;
Aggregation; Abstract classes; Generalization as
extension and restriction; Multiple inheritance; Meta
data; Candidate keys; Constraints.
3. Dynamic Modeling Events and states; Nesting; Concurrency; Advanced 06
and Functional dynamic modeling concepts.
Modeling Functional models; Data flow diagrams; Specifying
operations; Constraints; Relation of functional model
to object and dynamic models.
4. Design Object modeling; Dynamic modeling; Functional 04
Methodology and modeling; Adding operations; Iterating the analysis.
Analysis

120
 5. System Design and Subsystems concurrency; Allocating subsystems to 06
Object Design processors and tasks; Management of data stores;
Handling global resources; Handling boundary
conditions; Setting trade-off priorities; Overview of
object design; Combining the three models; Designing
algorithms; Design optimization; Implementation of
control; Adjustment of inheritance; Design of
associations; Object representation; Physical
packaging; Document design decisions.

6. Comparison of Structured Analysis/Structured Design (SA/SD); 04

Methodologies Jackson Structured Development (JSD).

7. Implementation and Implementation using a programming language; 06

Programming Implementation using a database system;
Style Implementation outside a computer.
Object-oriented programming style; Reusability;
Unit-2 Extensibility; Robustness; Programming-in-the-large.

8. UML Basics; Emergence of UML; Types of diagrams. 04

9. Use Case Actors; Use Case Diagram; Relationships between Use 04

Cases.

10. Classes Class diagram; Classes; Objects; Attributes; 06

Operations; Methods; Interfaces; Constraints;
Generalization; Specialization; Association;
Aggregation.

Total=48
Recommended Books:
1. James E. Rumbaugh, “Object Oriented Modeling and Design”, Pearson Education.
2. Bernd Oestereich, “Developing Software With UML”, Pearson Education.
3. Grady Booch, “Object Oriented Analysis and Design”, Addison Wesley.
4. Pierre-Alain, Muller, “Instant UML”, Shroff Publishers.
5. Grady Booch, James Rumbaugh, Lvar Jacobson, “The Unified Modeling Language User
Guide”, Addison Wesley.
6. Grady Booch, James Rumbaugh, Lvar Jacobson, “The Unified Modeling Language
Reference Manual”, Addison Wesley.
7. Rebecca Wirfs-Brock, “Design Object Oriented Software”, PHI.
8. E. Charnaik, D. McDermott, “Introduction to Artificial Intelligence”, Addison-Wesley
Publishing Company.
9. Nils J. Nilsson, “Principles of Artificial Intelligence”, Narosa Publishing Co.

121
 Title of the course : E-Commerce
Subject Code : OECS-622B
Weekly load : 3Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand the concept of evolution of E-commerce
CO2 Analyze various E-commerce process models
CO3 Identify current issues and case studies in E-commerce
CO4 Categorize advantages and disadvantages of different online payment options
CO5 Assess e-commerce strategies and applications, including online marketing, e-government,
e-learning and global e-commerce
CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):
Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 3 3 0 3 0 0 2 3 3 3 2 1 2
CO2 2 3 3 0 3 1 1 2 3 3 3 2 2 2
CO3 2 3 3 2 3 1 0 2 3 3 3 2 1 3
CO4 0 0 0 1 1 2 1 0 0 0 1 3 2 2
CO5 0 0 1 0 0 2 2 1 0 1 0 0 3 2

Theory
Unit Main Topics Course outlines Hour(s)
1. Introduction to E- Introduction, E-commerce or Electronic Commerce- An 06
commerce Overview, Electronic Commerce– Cutting edge,
Electronic Commerce Framework
2. Evolution of E- Introduction, History of Electronic Commerce, Advantages 06
commerce and Disadvantage of E-commerce, Roadmap of e-
Unit-1 commerce in India
3. E-commerce Introduction, E-commerce Infrastructure-An Overview, 06
Infrastructure Hardware, Server Operating System, Software, Network
Website
4. Managing the e- Introduction, e-Enterprise, Managing the e-Enterprise, E- 06
Enterprise business Enterprise, Comparison between Conventional
Design and E-organization, Organisation of Business in an
e-Enterprise
5. e-Commerce Introduction, Business Models, E-business Models Based 06
Process Models on the Relationship of Transaction Parties, e-commerce
Sales Life Cycle (ESLC) Model
6. Electronic Electronic Payment Systems, Electronic Cash, Smart Cards 06
Payment Systems and Electronic Payment Systems, Credit Card Based
Unit-2 Electronic Payment Systems, Risks and Electronic
Payment Systems

122
 7. Electronic Data The Meaning of EDI, History of EDI, EDI Working 06
Interchange Concept, Implementation difficulties of EDI, Financial
EDI, EDI and Internet
8. E-Marketing, The scope of E-Marketing, Internet Marketing 06
Current issues and
Case Studies Techniques, Current issues in E-commerce and Case
studies on E-commerce
Total=48
Recommended Books:
1. Kenneth C. Laudon: E-Commerce: Business, Technology, Society, 4th Edition, Pearson
2. S. J. Joseph, E-Commerce: An Indian perspective, PHI

123
 Title of the course : Computer Network Security
Subject Code : OECS-622C
Weekly load : 3 Hrs LTP 3-0-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Comprehend and implement various cryptographic algorithms to protect the confidential
data.
CO2 Identify network vulnerabilities and apply various security mechanisms to protect networks
from security attacks.
CO3 Apply security tools to locate and fix security leaks in a computer network/software.
CO4 Secure a web server and web application.
CO5 Configure firewalls and Intrusion Detection System

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 3 3 3 3 3 0 0 3 2 2 3 2 1
CO2 2 3 3 2 3 3 0 0 3 2 2 3 2 2
CO3 2 3 3 3 3 3 0 0 3 2 2 3 1 1
CO4 0 3 3 2 3 3 0 0 2 0 2 3 2 2
CO5 0 3 3 0 3 3 0 0 0 0 0 3 2 2

Theory

Unit Main Topics Course outlines Lecture(s)

Unit-1 1. Introduction: Security Attacks, Security Services, Security 06
Mechanisms and Principles, Security goals, Malicious
software, Worms, Viruses, Trojans, Spyware, Botnets
2. Basics of Symmetric and asymmetric cryptography, cryptographic 06
Cryptography: hash functions, authentication and key establishment,
Message Authentication Codes (MACs), digital
signatures, PKI.

3. Security DoS attacks, Buffer Overflow, Race Conditions, Access 06

Vulnerabilities: Control Problems, Spoofing and Sniffing attacks, ARP
Poisoning, Social Engineering and countermeasures.

4. Internet Security: TCP/IP Security, Secure Sockets Layer (SSL), Transport 06

Layer Security (TLS), HTTPS, Secure Shell (SSH),
IPsec, Email Security, DNS Security, DNSSEC,
Authentication Protocols

124
Unit-2 5. Web Security: Phishing attack, SQL Injection, Securing databases and 08
database access, Cross Site Scripting Attacks, Cookies,
Session Hijacking, E-commerce security
6. System Security: Firewalls, Types: Packet filter (stateless, stateful), 08
Application layer proxies, Firewall Location and
Configurations, Intruders, Intrusion Detection System,
Anomaly and misuse detection.
7. Wireless IEEE 802.11i Wireless LAN Security, Wireless 08
Network Application Protocol Overview, Wireless Transport
Security: Layer Security, WAP End-to-End Security
Total=48
Recommended Books:
1. Stallings, W., Network Security Essentials, Prentice Hall (2017) 6th Edition.
2. Cheswick, R., W., Bellovin, M., S., and Rubin, D., A., Firewalls and Internet Security,
AddisonWesley Professional (2003) 2nd Edition.
3. Graves, K., Certified Ethical Hacking Study Guide,Sybex (2010) 1st Edition.
4. Stallings, W., Cryptography and Network Security, Prentice Hall (2013), 6th Edition.

125
 Title of the course : Computer Graphics
Subject Code : OECS-622D
Weekly load : 3 Hrs LTP 3-0-0
Credit : 3 (Lecture 3)
Course Outcomes: At the end of the course, the student will be able to:

CO1 Provide comprehensive introduction about computer graphics system and design
algorithms
CO2 Familiar with two dimensional and three dimensional transformations
CO3 Familiar with techniques of clipping, hidden surface removal and shading
CO4 Provide information about Projections and shading techniques
CO5 Render projected objects to naturalize the scene in 2D view and use of illumination
models for this
CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):
Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 0 2 0 2 0 0 0 0 0 0 2 3 2
CO2 2 0 2 2 1 0 0 0 0 0 0 2 3 2
CO3 2 3 2 2 2 0 0 0 2 0 2 2 3 3
CO4 2 3 2 2 2 0 0 0 2 0 2 2 3 2
CO5 2 3 2 2 2 0 0 0 2 0 2 2 3 2
Theory
Unit Main Topics Course outlines Lecture(s)
1. Overview of Display devices, physical input and output 06
graphics systems devices: storage tube graphic displays, Raster
Refresh, Plasma Panel Displays, Liquid Crystals
2. Output Point plotting, Line Drawing algorithms – Slope 06
Primitives Line Method, DDA algorithms, Bresenham’s
Line algorithm
3. Two-dimensional Basic transformations-translation, scaling, 06
Unit-1 Transformations rotation, Matrix representation and homogenous
coordinates, composite transformations, Rotation
about an arbitrary point, scaling relative to a fixed
point
4. Windowing and Windowing concepts, clipping algorithms-Line 06
Clipping clipping– Cohen-Sutherland algorithm, Polygon
Clipping algorithms, Text Clipping.
Techniques
5.Three- dimensional Scaling, Rotation, Translation, Rotation about 06
Transformations arbitrary axis.

126
Unit 2 6. Projections Parallel projections, perspective projections 06
7. Surface Detection Back face removal method, Depth-buffer method, 06
and Hidden- Scan-line method
Surface Removal
8. Shading Overview Polygon shading methods: Flat shading, Gouraud 06
Shading, Phong Shading.

Total=48
Recommended Books:
1. Computer Graphics, Hearn & Baker, PHI
2. Principles of Interactive Graphics, Newman & Sproul, Mcgraw Hill
3. Computer Graphics-A Programming Approach, Steven Harrington, Mcgraw Hill
4. Computer Graphics, Sinha &Udai, Mcgraw Hill

127
 Title of the course : Data Analytics
Subject Code : OECS-622E
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Summarize the workflow of analytics process model, its requirements and applications.
CO2 Apply suitable data pre-processing techniques for the given dataset.
CO3 Demonstrate different predictive, Descriptive and text analytic models.
CO4 Examine Survival Analysis model and learn through Social Network Analytics.
CO5 Acquire fundamental enabling techniques and scalable algorithms data analytics.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 1 0 0 0 0 0 0 1 0 0 0 2 1
CO2 1 1 1 0 2 0 0 0 1 1 0 0 2 1
CO3 2 1 1 0 3 0 0 2 2 2 0 0 3 2
CO4 3 2 2 1 3 1 0 1 2 2 0 0 2 3
CO5 0 0 0 2 0 2 2 0 0 0 2 0 2 2

Theory
Unit Main Topics Course outlines Lecture(s)
1. Data Analytics Process Model – Analytics – Analytical Model 04
Analytics an Requirements.
Overview

2. Data Types of Data Sources and Data Elements– Sampling – Visual 09

Collection, Data Exploration – Missing Values –Classification-Clustering
Sampling and and Outlier detection – Standardizing data – Categorization.
Preprocessin
Unit-1 g
3. Predictive Linear Regression – Logistic Regression – Ensemble Methods 09
Analytics – Multiclass Classification Techniques – Evaluating Predictive
Models.

4. Descriptive Association rules – sequence rules –segmentation. 02

Analytics

5. Survival Kaplan Meier Analysis –Parametric Survival Analysis – 06

Analytics Evaluating Survival Analysis Models.

128
Unit-2 6. Text Overview, key terms used – Text Analytics Methods – Text 06
Analytics Analytics Metrics – Applications.

7. Social Social network definitions – Social network metrics –Social 12

Network network learning Relational Neighbor classifier -Probabilistic
Analytics relational Neighbor classifier– Case Study on Real-Time
Applications like Twitter data , dataset from Kaggle website,
Data analytics for security applications and deep learning
applications.

Total=48

Recommended Books:
1. Bart Baesens, “Analytics in a Big Data World”, The Essential Guide to Data Science and its
Applications, Wiley, First edition, 2014.
2. Jesus Rogel- Salazar, “Data Science and Analytics with Python “, CRC Press, First Edition,
2017.
3. Michael Berthold, David J. Hand, “Intelligent Data Analysis”, Springer, Second edition,
2007.
4. Thomas H. Davenport, Jeanne G. Harris, “Competing on Analytics: The New Science of
Winning”, Harvard Business Review Press ,First edition,2007
5. Paul C. Zikopoulos, Chris Eaton, “Understanding Big Data”, McGraw-Hill, 2012 (eBook
from IBM)
6. Chris Eaton, Dirk DeRoos, Tom Deutsch, George Lapis, Paul Zikopoulos, “Understanding
Big Data: Analytics for Enterprise Class Hadoop and Streaming Data”, McGraw-Hill
Publishing, 2012.

129
 Title of the course : Artificial Intelligence
Subject code : MDCS-621
Weekly load : 4 Hrs LTP 3-1-0
Credits :4

Course Outcomes: At the end of the course, the student will be able to:
CO1 Solve a problem as a state space problem.
CO2 Apply suitable search technique for a random search problem.
CO3 Understand probabilistic reasoning.
CO4 Understand optimization and inference algorithms for model learning
CO5 Design and develop programs for an agent to learn and act in a structured environment.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 2 2 2 2 1 0 0 0 0 0 2 2 1
CO2 2 3 2 3 2 2 0 0 0 2 2 2 3 2
CO3 2 2 2 3 3 3 0 0 2 2 2 3 3 2
CO4 2 2 2 3 3 3 0 0 2 3 3 3 3 2
CO5 2 2 2 2 3 2 0 0 2 2 2 2 2 3

Theory
Unit Main Topics Course Outline Lecture(s)
1. Introduction Concept of AI, history, current status, scope, agents, 03
environments, Problem Formulations, Review of tree and graph
structures, State space representation, Search graph and Search
tree.
2. Search Random search, Search with closed and open list, Depth first 09
Unit-1 Algorithms and Breadth first search, Heuristic search, Best first search, A*
algorithm, Game Search.
3. Probabilistic Probability, conditional probability, Bayes Rule, Bayesian 12
Reasoning Networks-representation, construction and inference, temporal
model, hidden Markov model.
4. Markov MDP formulation, utility theory, utility functions, value 12
Decision iteration, policy iteration and partially observable MDPs.
process
5. Reinforcement Passive reinforcement learning, direct utility estimation, 12
Unit-2 Learning adaptive dynamic programming, temporal difference learning,
active reinforcement learning-Q learning.
Total=48

130
Recommended Books:
1. Stuart Russell and Peter Norvig, “Artificial Intelligence: A Modern Approach”,
3rdEdition, Prentice Hall.
2. Elaine Richand Kevin Knight, “Artificial Intelligence”, Tata McGraw Hill.
3. Trivedi, M.C., “A Classical Approach to Artificial Intelligence”, Khanna Publishing
House, Delhi.
4. Saroj Kaushik, “Artificial Intelligence”, Cengage Learning India, 2011.
5. David Poole and Alan Mackworth, “Artificial Intelligence: Foundations for
Computational Agents”, Cambridge University Press 2010.

131
 Title of the course : Optimization Techniques
Subject code : HDCS-621
Weekly load : 4 Hrs LTP 3-1-0
Credits :4

Course Outcomes: At the end of the course, the student will be able to:
CO1 Describe clearly a problem, identify its parts and analyze the individual functions.
Feasibility study for solving an optimization problem.
CO2 Becoming a mathematical translation of the verbal formulation of an optimizationproblem.
CO3 To design algorithms, the repetitive use of which will lead reliably to finding an
approximate solution.
CO4 Evaluate and measure the performance of an algorithm. Discovery, study and solve
optimization problems.
CO5 Understand optimization techniques using algorithms. Investigate, study, develop, organize
and promote innovative solutions for various applications.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 3 3 0 0 0 0 0 1 0 2 2
CO2 3 3 3 3 0 0 0 0 2 0 0 1 3 2
CO3 2 2 3 2 0 0 2 0 0 0 0 0 3 3
CO4 2 2 2 2 2 0 0 0 0 1 0 0 2 3
CO5 0 0 2 1 0 2 0 0 3 1 1 0 2 1

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Introduction and Historical Development; Engineering applications of 08
Basic Concepts Optimization; Art of ModelingObjective function;
Constraints and Constraint surface; Formulation of design
problems as mathematical programming problems
Classification of optimization problems. Optimization
techniques – classical and advanced techniques
2. Optimization Stationary points; Functions of single and two variables; 08
using Calculus Global OptimumConvexity and concavity of functions of
one and two variablesOptimization of function of one
variable and multiple variables; Gradient vectors;

132
 Examples
Optimization of function of multiple variables subject to
equality constraints; Lagrangian functionOptimization of
function of 1 multiple variables subject to equality
constraints; Hessian matrix formulation; Eigen values
Kuhn-Tucker Conditions; Examples
3.Linear Standard form of linear programming (LP) problem; 08
Programming Canonical form of LP problem; Assumptions in LP
Models; Elementary operationsGraphical method for two
variable optimization problem; Examples Motivation of
simplex method, Simplex algorithm and construction of
simplex tableau; Simplex criterion; Minimization versus
maximization problems
4. Linear Use of software for solving linear optimization problems
Programming using graphical and simplex methodsExamples for
Applications transportation, assignment, water resources, structural and
other optimization problems
Unit-2 5. Dynamic Sequential optimization; Representation of multistage 12
Programming decision process; Types of multistage decision problems;
Concept of sub optimization and the principle of
optimality Recursive equations – Forward and backward
recursions; 2 Computational procedure in dynamic
programming (DP) D
6. Dynamic Problem formulation and application in Design of 06
Programming continuous beam and Optimal geometric layout of a truss
Applications Water allocation as a sequential process.
7. Integer Integer linear programming; Concept of cutting plane 06
Programming methodMixed integer programming; Solution algorithms;
Examples

Total=48
Recommended Books:

1. Kapoor, V.K.: Operation Research, Sultan Chand & Co., New Delhi.
2. Manmohan Gupta, P.K.: Operation Research, Sultan Chand & Co., New Delhi.
3. Pronsen, Richard: Theory and Problems of Operation Research, McGraw Hill, 1983.
4. Hiller, F.S. & Liberman, G.J., 1974: Introduction to Operations Research, 2nd Edn. Holden
5. Rao, S. S., 1978: Introduction to Optimization: Theory & Applications, Wiley Eastern.
6. Srinath, L.S.: Linear Programming, East-West, New Delhi.

133
SEMESTER-VII

134
 Title of the course : Internet Programming
Subject code : PCCS-711
Weekly load : 3 Hrs LTP 2-1-0
Credits :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand the concept of object oriented programming
CO2 Learn data type and variables of Java
CO3 Write programs using various features of Java
CO4 Understand the concept of applet and multi-threading
CO5 Learn the concept of AWT and event handling

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 3 1 1 0 0 0 0 0 0 0 2 2 1
CO2 3 3 3 2 2 0 0 0 0 0 0 3 1 1
CO3 3 3 3 3 2 0 0 0 1 0 0 3 3 2
CO4 3 3 3 3 3 1 1 0 1 0 0 3 3 3

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Introduction Programming; Need of Programming; Representation of 8
to Algorithms; Need for OOP; Class and Objects; Abstraction;
Programming Association; Composition; Aggregation; Inheritance: simple
and OOP inheritance, hierarchical inheritance, multilevel inheritance,
Basics hybrid inheritance; Encapsulation; Polymorphism: static
polymorphism, dynamic polymorphism;
2. Introduction Introduction to Java; Environment variables; JAVA-Home 8
to Java directory; Steps to develop a Java Program; Command line
arguments, Variables: value type, reference type;
Identifiers; Data Types: primitive data types, abstract data
types; Instance variables and Local Variables; Access
Specifiers; Access Modifiers; Keywords.
3. Operators, Unary Operators; Binary Operators; Types of Operators: 8
Classes and arithmetic operator, relational operator, logical operator,
Methods assignment operator, increment operator, decrement
operator, negation operator, bitwise operator, shift operator,
concatenation operator, new operator, instance operator;
Type Casting: implicit type casting, explicit type casting;
Methods and Parameters; Constructors; Overloading
Constructors; Overloading member functions; Abstract

135
 class; Final class; Variables, Interfaces, Object;
Constructors: default constructor, parameterized
constructor; Wrapper classes; Adapter Classes; Anonymous
Classes; Utility Classes; Generics.
Unit-2 4. Programming Selection control Structures; Iteration control Structure; 12
using Java Arrays: array initialization, array creation, multidimensional
array; Strings; Recursion; Regular Expression; Packages;
Exception Handling: errors in software engineering,
exception classes, keywords used in exception handling,
hierarchy of run time exception; Multithreading: life cycle
of a thread, creation of child thread, working with multiple
child thread, thread priorities, thread synchronization, and
monitors; Abstract Window Toolkit; Event Handling;
Window listener; Working With Menus; Dialog box; Card
Layout; Applets; Collections; Framework; Loading an
Image onto the Frame and Applet; Insets.
5. Debugging, Debugging; Code Analysis using Programming Mistake 12
Code Analysis Detector (PMD); Unit Testing using JUnit and Code
and Unit coverage
Testing
Total=48

Recommended Books:
1. Bert bates, Kathy Sierra, Head First Java, O’Reilly Media.
2. Steven Holzer, Java 8 programming, Dreamtech Press.

136
 Title of the course : Compiler Design
Subject Code : PCCS-712
Weekly load : 3Hrs LTP 2-1-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Introduce the major concept areas of language translation and compiler design
CO2 Enrich the knowledge in various phases of compiler ant its use, code optimization
techniques, machine code generation, and use of symbol table
CO3 Extend the knowledge of parser by parsing LL parser and LR parser
CO4 Provide practical programming skills necessary for constructing a compiler
CO5 Understands Intermediate Code Generation and Code Optimization

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 2 1 2 0 2 2 0 0 1 0 1 2 3 3
CO2 2 2 2 2 2 2 0 0 2 0 2 2 2 2
CO3 3 2 2 2 2 2 0 0 2 2 2 3 2 2
CO4 3 2 2 2 2 3 0 0 2 2 2 2 2 2
CO5 3 2 2 2 2 2 0 0 3 0 1 2 2 2

Theory

Unit Main Topics Course outlines Lecture(s)

Unit-1 1. Introduction: Introduction to translators (assemblers, compilers, 06
interpreters)
2. Introduction to Lexical & Syntax analysis, Intermediatecode generation 06
phases of optimization, bookkeeping, error handling, regular
compiler expressions, finite automata.

3. Parsing: Context free grammar, Derivation & Parse Trees, parsers: 06

shift reduce, operatorprecedence, top down predictive,
efficient parsers; LR parser, LR(O), SLR, LALR,
implementation of parsers.

4. Syntax Directed Different schemes & implementation, immediate code, 06

Translation: Parsetrees, syntax-trees.

Unit-2 5. Intermediate Three address code, quadruples triple, translation of 06

code generation assignment statements, Boolean expressions, postfix
notation any parser.

137
 6. Error Detection Errors, Lexical-phase errors, syntactic-phase 06
& Recovery: errors,semantic errors.

7. Code Sources of optimization, loop optimization DAG 06

Optimization: representation of basicblocks, Value number & algebraic
laws, Global data-flow analysis, Dominators, Reducible
flow graphs, loop invariant computations, Induction
variables eliminations, Backward flow problems.
8. Code Object programs, problems in code generation, Register 06
Generation: allocation &assignment code generation from DAG‘s.

Total=48
Recommended Books:
1. Aho A. V., Ullman J. D., Sethi R., Compilers Principles, Techniques and Tools, Pearson
Education.
2. John Levine, Tony Mason, Doug Brown, Lex and Yacc, O’REILLY.
3. Kenneth C. Louden, Compiler Construction and Practice, Thomson Publication.
4. Dhamdhere, Compiler Construction, Macmillan Publication.

138
 Title of the course : Internet Programming Lab
Subject Code : PCCS-713
Weekly load : 4 Hrs LTP 0-0-4
Credit :2

Course Outcomes: At the end of the course, the students will be able to:
CO1 Implement programs using various control structure
CO2 Implement command line argument and various input methods
CO3 Write programs using various features of Java like vector, string, string buffer class
CO4 Implement programs using applet and multi-threading
CO5 Develop applications using applet, AWT and event handling

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 3 3 2 3 1 0 0 1 0 1 3 2 1
CO2 1 3 3 2 3 1 0 0 1 0 1 3 2 1
CO3 1 3 3 2 3 1 0 0 1 0 1 3 3 2
CO4 1 3 3 2 3 1 0 0 1 0 1 3 3 2
CO5 1 3 3 2 3 1 0 0 1 0 1 3 3 2

LIST OF PRACTICALS
1. Write a Java program to print Unicode characters.
2. Write a Java program to find the largest of three numbers.
3. Write a Java program for multi-dimensional array initialization and perform various
operations (such as insertion, deletion, and searching).
4. Write a Java program to find a number of command line Arguments and to display them.
5. Write a Java program to find the sum of two numbers using command line arguments.
6. Write a Java program for converting a string to any numeric type (parsing).
7. Design a class with the name employee which contains three member data (empno, ename, sal)
and two methods (getData() and setData).
8. Write a program to show the concept of function overloading by defining the methods with
same name and different arguments within a class.
9. Design a program having two classes B and A. Class B is a child class of class A and class A is
superclass of B. The object of class B can invoke the member data and member function of its

139
 own class and that of super class A.
10. Design a program where same method signatures are defined in the child class and also in the
super class (overriding member function).
11. Write a Java program to show the usage of different access specifiers (public, private protected,
and default) and access modifiers (final, static, transient, volatile, and abstract).
12. Write a Java program that shows the implementation of abstract class.
13. Design an interface that tells us that whichever classes are implemented form the interface has
got the functionalities of adding two numbers and subtracting two numbers.
14. Write a Java program to show the inheritance in interface.
15. Write a program with the class “Nums” contains two methods i.e. to add two numbers and to
subtract two numbers. Nums.class should be placed in the user defined package “Pack1”.
16. Write a Java program to use the functionalities of Nums.class present in the package Pack1.
17. Write a Java program to show different types exception defined in java.lang…..(Arithmetic,
ArrayIndexOutofBounds, numberFormat, StringIndexOutofBounds, and NullPointer) and
keywords used in java language for exception handling (try, catch, finally, throw, and
throws).
18. Design a user defined exception class with name “InvalidPEException” and place it “Payroll
package”.
19. Write a program to check the presence of a thread in the Java application.
20. Design a program to create a child thread that should display 1 to 10 and the main thread
should also display 1 to 10.
21. Design a java application to demonstrate a stop and watch (counter), that should be executed
by two threads, one with low priority and other with high priority for 10 seconds.
22. Write a program to display all the Java files present in C:/CJava directory (Dir *.java)
23. Write a Java program to implement the DOS COPY command.
24. Write a Java program to save the empno, salary and working status of an employee in a file
called “Emp.txt” and to read the data.
25. Write a Java program to read the contents of the file line by line.
26. Write a Java program to read the data from the keyboard at runtime.
27. Implement abstract window toolkit (awt) GridLayout, button, checkbox, ItemListener,
choice, list, combo box, drop down list box, scrollbar, working with menus, dialog, file

140
 dialog, card layout, text listener, event Mouse Listener, Mouse Motion Listener, and Mouse
Wheel Listener.
28. Implement collection framework (list, set, Map, sorted set, and sorted map) and utility
classes (date, string tokenizer,, stack, arrays, Random, currency, properties, timer and timer
task, vector, enumeration, iterator, hash table).
29. Write a Java program to show working of user defined Generic classes.
30. Write a simple Java program to show multiple type parameters in java generics.
31. Write a program for loading an image onto the frame.
32. Write a program for loading an image into an applet.

Note: The above mentioned list of experiments is suggested list. Teacher may add more programs/
experiments as per requirement.

141
 Title of the course : Image Processing
Subject Code : PECS-711A
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Learn the fundamental concepts and applications of image processing
CO2 Cover the basic theory and algorithms that are widely used in image processing
CO3 Provide mathematical foundations for digital manipulation of images such as image
acquisition, segmentation, Fourier transformation and compression
CO4 Understand the basic concepts of performing Image restoration, Image compression, Color
image processing, Image segmentation and Object Recognition
CO5 Understand and review image transforms

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 0 0 0 0 0 0 0 0 0 2 2 2
CO2 2 3 2 2 2 2 0 0 2 2 2 2 3 2
CO3 3 3 3 3 2 2 0 0 2 2 2 3 3 2
CO4 2 2 2 3 2 2 0 0 2 2 2 2 3 2
CO5 2 0 0 0 0 0 0 0 0 0 0 2 3 2
Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Introduction Image model, human vision, digital images representation, 06
image acquisition, storage, processing, communication
and display, Image Geometry, Image transformations,
2. Fourier Discrete Fourier transformation, Fast Fourier 06
Transformation Transformation, other represent able image
transformation.
3. Image Image enhancement, special domain and frequency 06
Enhancement domain methods, enhancement by point frequency,
4. Filters Special filtering, enhancement in frequency domain, color 06
image frequency.
Unit-2 5. Image Image restoration, degradation model, algebraic approval 06
Restoration to restoration, constrained least square restoration,
Interactive restoration, restoration in special domain.
6. Image Image compression, image compression models, loss less 06
Compression and glossy image compressions methods.
7. Image Image segmentation, detection of discontinuities, Region 06
Segmentation oriented segmentation.

142
 8. Image Detection edge detection and boundary detection, shareholding, 06

Total=48

Recommended Books:
1. Rafacl C. Gonzalez, Digital image processing, Addison Wesley.
2. Jain Tenber, Digital Image Processing, PHI

143
 Title of the course : Soft Computing
Subject code : PECS-711 B
Weekly load : 3 Hrs LTP 3-0-0
Credits :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand fuzzy logic and its applications.
CO2 Acquire knowledge of artificial neural networks and their applications.
CO3 Solve single-objective optimization problems using genetic algorithms.
CO4 Apply soft computing to solve problems in varieties of application domains.
CO5 To familiarize with soft computing concepts.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 2 2 2 0 0 2 2 2 3 2 2

CO2 3 3 3 3 3 2 0 0 3 2 2 3 2 3

CO3 3 3 3 2 2 2 0 0 3 3 3 3 3 2

CO4 3 3 3 2 2 3 0 0 3 3 3 3 3 3

CO5 2 3 2 2 2 3 0 0 3 3 3 2 3 3

Theory
Unit Main Topics Course outlines Lecture(s)
1. Introduction Concept of computing systems; “Soft” computing versus 02
to Soft “Hard” computing; Characteristics of soft computing; Some
Computing applications of soft computing techniques
2. Fuzzy Logic Introduction to fuzzy logic; Fuzzy sets and membership 10
functions; Operations on fuzzy sets; Fuzzy relations, rules,
Unit-1 propositions, implications and inferences; Defuzzification
techniques; Fuzzy logic controller design; Some applications
of fuzzy logic
3. Genetic Concept of “Genetics” and “Evolution” and its application to 12
Algorithms probabilistic search techniques; Basic GA framework and
(GAs) different GA architectures; GA operators: encoding,
crossover, selection, mutation, etc.; Solving single-objective
optimization problems using GAs
4. Artificial Biological neurons and their working; Simulation of 12
Unit- biological neurons to problem solving; Different ANN
Neural
II architectures; Training techniques for ANNs; Applications of
Networks
ANNs to solve some real-life problems

144
 5. Unsupervised Competitive learning networks;Kohonen self-organizing 12
Learning networks; Hebbian learning; The Hopfield network
Total=48

Recommended Books:
1. F. Martin McNeill, and Ellen Thro, Fuzzy Logic: A Practical Approach, Morgan
Kaufmann Pub.
2. Timothy J. Ross, Fuzzy Logic with Engineering Applications, Wiley.
3. Nikola K. Kasabov, Foundations of Neural Networks, Fuzzy Systems, and Knowledge
Engineering, MIT Press.
4. Melanie Mitchell, An Introduction to Genetic Algorithms, MIT Press.
5. David E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning,
Pearson Education.
6. S. Rajasekaran, and G. A. Vijayalakshmi Pai, Neural Networks, Fuzzy Logic and Genetic
Algorithms: Synthesis, and Applications, Prentice Hall of India.
7. D. K. Pratihar, Soft Computing, Narosa, 2008.

145
 Title of the course : Computer Network and Security
Subject Code : PECS-711C
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:

CO1 To understand the basics of computer networks and wireless networks.

CO2 To understand the cryptographic techniques and Internet security protocols.
CO3 To learn how to implement biometric security and software security techniques.
CO4 Describe the functions of each layer in OSI and TCP/IP model.
CO5 Explain the functions of Application layer and Presentation layer paradigms and Protocols.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PO PSO PSO
PO1 PO2 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
3 1 2
CO1 2 2 0 0 1 0 0 0 0 0 0 2 1 1
CO2 2 2 0 0 2 0 0 0 0 2 0 2 2 2
CO3 2 3 2 2 2 2 0 0 2 2 0 2 2 2
CO4 2 2 3 2 2 2 0 0 2 2 0 2 2 2
CO5 2 2 2 2 2 2 0 0 2 2 0 0 3 2

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Introduction Computer Network & Security: Data and Computer 06
Communication Networks, Data Communication,
Transmission Methodologies, Data Link Layer, Multiple
Access & Local Area Networks.

2. Connecting Connecting Devices and Backbone Networks, Network 04

Devices Layer and Transport Layer, Application Layer.
3. Wireless Wireless networking, wireless LANS & PANS, ad-hoc 06
Networks wireless networks & security, wireless sensor networks.

4. Cellular Cellular Mobile Wireless Networks, Evolution of 06

Networks Modern Mobile Wireless Communication System.
Unit-2 5. Cryptography Introduction to the Concept of Security, Cryptographic 06
and Network Techniques, Computer-based Symmetric and Asymmetric
Security Key Cryptographic Algorithms, Public Key Infrastructure
(PKI), Internet Security Protocols, Network Security.

146
 6. Database Data management technologies, Information security, 06
Security: Information Management Technologies, Security policies,
Policy enforcement & related issues, Design principles,
Multilevel relational data models, Security impact on
database function, inference problem.

7. Software Defining a discipline, A Risk Management Framework, 06

Security: Code review with a tools, Architectural risk analysis,
Software penetrating testing, Risk Based security Testing,
An Enterprise S/W security program, Security knowledge.

8. Biometric Biometric Fundamentals, Types of Biometrics, 08

Security: Fingerprints and Hand Geometry, Facial and Voice
Recognition, Iris and Retina scanning, Signature
Recognition and Keystroke Dynamics, Behavioral and
Esoteric Biometric Technologies, Issues Involving
Biometrics, Privacy, Policy and Legal Concerns Raised
by Biometrics.
Total=48

Recommended Books:
1. Tanenbaum, Computer Network, Prentice Hall India
2. William Stalling, Data and Computer Communication, Prentice Hall
3. Douglas E. Comer, Internetworking with TCP/IP Volume – I, Prentice Hall India
4. W. Richard Stevens, TCP/IP Illustrated Volume-I, Pub. Addison Wesley
5. B. Forouzan, Data Communication And Networking, TMH

147
 Title of the course : Requirement Engineering
Subject Code : PECS-711D
Weekly load : 3 Hrs LTP 300
Credit :3
Course Outcomes: At the end of the course, the student will be able to:

CO1 Comprehend software engineering knowledge and principles

CO2 Understand requirement engineering and requirement elicitation
CO3 Comprehend requirement analysis and specifications
CO4 Design framework for software engineering projects
CO5 Convert the requirements model into the design model and demonstrate use of software
and user interface design principles

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PO PO PO1 PO1 PSO1 PSO2
PO1 PO2 PO5 PO6 PO7 PO8 PO9 PO12
3 4 0 1
CO1 3 3 3 2 1 1 0 0 2 0 3 3 1 1
CO2 3 3 3 2 2 1 0 0 2 0 2 2 2 2
CO3 3 0 3 2 2 1 0 0 2 0 2 2 2 3
CO4 2 0 2 2 2 2 0 0 2 0 3 2 2 3
CO5 3 0 2 3 2 2 0 0 2 0 2 2 2 3

Theory

Unit Main Topics Course outlines Lecture(s)

Unit-1 1. Introduction to Software engineering knowledge, process guidance 12

software principles, practice guiding principles, framework guiding
engineering principles, communication principles, planning principles,
principles modelling principles, construction principles, deployment
principles

2. Requirement Introduction to requirement engineering, steps of requirement 12

engineering engineering, present state of practice, types of requirements,
and identifying stakeholders, recognizing multiple viewpoints,
requirements working toward collaboration, requirements elicitation,
elictation interviews, brainstorming sessions, facilitated application
specific technique, quality function deployment,

148
Unit-2 3. Requirement Requirements analysis, data flow diagrams, data dictionaries, 12
analysis & Entity relationship diagrams, software prototyping, Software
specifications requirement specifications, nature of SRS, characteristics,
organization of SRS, introduction, overall description,
specific requirements, change management process,
approvals, supporting information.

4. Design Conceptual design and technical design, modularity, design 12

concepts strategy, bottom up design, top down design, hybrid design,
function-oriented design, object-oriented design, steps to
analyze object-oriented design

Total=48
Recommended Books:

1. Software Engineering, Roger S. Pressman, McGraw Hill publication.

2. Ian Sommerville, Software Engineering, Addison-Wesley Publishing Company
3. James F. Peter, Software Engineering - An Engineering Approach, John Wiley
4. Pankaj Jalote, An integrated Approach to Software Engineering, Narosa.

149
 Title of the course : Management Information System
Subject Code : PECS-711E
Weekly load : 3Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Describe relationship between concept of information system, organization, management and
strategies
CO2 Evaluate the role of information system in today's competitive business environment
CO3 Effectively communicate strategic alternatives to facilitate decision making
CO4 Understand the leadership role of Management Information Systems in achieving business
competitive advantage through informed decision making.
CO5 Effectively communicate strategic alternatives to facilitate decision making.
CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):
Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 2 3 1 0 2 3 3 3 2 1 1
CO2 3 2 2 2 3 1 0 2 3 3 3 2 2 2
CO3 3 2 2 2 3 1 0 2 3 3 3 2 2 3
CO4 3 2 2 2 3 1 0 2 3 3 3 2 2 2
CO5 3 2 2 1 3 2 0 2 3 3 2 1 2 2

Theory
Unit Main Topics Course outlines Hour(s)
1. Understanding Introduction to Management Information Systems, History 06
MIS of MIS, Impact of MIS, Role and Importance, MIS
Categories, Managers and Activities in IS, Types of
Computers Used by Organizations in Setting up MIS,
Hardware support for MIS
Unit-1 2. Conceptual Introduction, The Decision Making Process, System 06
Foundations Approach to Problem Solving, The Structure of
Management Information System, Types of Management
Systems Concepts of Management Organization
3. MIS Planning, Introduction, Differences between planning and control 06
Control and information, Systems Analysis, Systems Design,
Development Development
4. MIS and BPR Introduction, Business Process Re – Engineering, 06
Improving a process in BPR, Object Oriented
methodology, BPR – Current Focus
5. MIS Organization Introduction, MIS at Management levels, Strategic Level 06
Structure Planning, Operational Level Planning, Economic and
Behavior Theories

150
 6. MIS – Support Introduction, Philosophy of Modeling, DSS: Deterministic 06
Models Systems, Market Research Methods, Ratio Analysis for
Unit-2 and Knowledge Financial Assessment, Management Science Models
Management
7. Strategic Introduction, Background, Performance, Product 06
Management differentiation and Value Chain, How IT influences
Information Organizations’ goals, The five levels, Governance Modes
System in the use of IT
8. Security, Ethical Introduction, Control Issues in Management Information 06
Issues and Case Systems, Security Hazards, Ethical Issues, Technical
Studies solutions for Privacy Protection and MIS Case Studies
Total=48
Recommended Books:
1. Kenneth C. Laudon : Management Information Systems- Pearson Education
2. Kenneth C. Laudon : Essentials of Management Information System – Pearson Education

151
 Title of the course : Distributed Systems
Subject Code : PECS-711F
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand the components of distributed computing, its networks, protocols,
communication and interconnection architecture
CO2 Recognize the inherent difficulties that arise due to distributed-ness of computing resources
CO3 Learn and explore mobile & wireless computing and their applications to real world
problems
CO4 Understand the basics of distributed object & file based system. Also familiarize with the
design, implementation and security issues of distributed system
CO5 To develop a simple distributed system.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 2 2 2 2 0 0 2 3 2 2 3 2
CO2 2 2 2 2 2 2 0 2 2 3 2 2 2 2
CO3 3 2 2 2 2 2 0 2 2 3 2 3 3 2
CO4 3 2 3 2 2 2 0 2 2 3 2 3 2 2
CO5 3 3 2 2 3 3 0 2 2 2 2 3 1 2

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Introduction to Definition of distributed systems, their objectives, types, 06
Distributed hardware and software concepts, architecture.
Systems
2. Web Services Introduction to XML, SOAP, Web and Grid services 06
Concepts concepts.
3. Communication Inter process communication, Remote Procedure Call 08
(RPC), Remote Method Invocation (RMI), Remote Object
Invocation, and Message Oriented Communication.
4. Processes Introduction to threads, Threads in distributed and non 06
distributed systems, Client side software, Design issues for
Servers, Software agents.
Unit-2 5. Naming General issues with respect to naming, Name resolution, 06
implementation of a name space, Domain name Systems,
X.500 name space.

152
 6. Security Introduction to security in distributed systems, General 08
issues in authentication and access control, Security
management: Key management, secure group
management, authorization management; examples:
Kerberos, x.509 certificates.
7. Distributed Introduction to distributed object based systems, Overview 04
Object-based of CORBA and DCOM and their comparison.
Systems
8. Distributed File Introduction to distributed file system, distributed 04
System and document-based systems, their examples.
Document Based
Systems
Total=48

Recommended Books:
1. Andrew S Tanenbaum, Principles and Paradigms of Distributed Sytsems, Pearson Education.
2. George Coulouris, Distributed Systems, Addison Wesley.

153
 Title of the course : Simulation and Modelling
Subject Code : PECS-712A
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Analyze the system and its behavior so that the physical behavior of a system can
transform into a mathematical model that can in turn transform into an efficient algorithm
for simulation purpose.
CO2 Understand the methodology for modeling& simulation of continuous, discrete and
combined systems using simulation languages.
CO3 Have basic knowledge on simulation software and use it in solving of engineering
problems, analysis and validation of the results.
CO4 Understand how simulation modeling can aid in effective decision-making.
CO5 Knowledge about a system and develop the capability to apply the same to study systems
through available software.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 2 2 2 2 0 0 2 1 2 2 2 2
CO2 2 2 2 3 2 3 0 0 3 2 2 3 3 2
CO3 2 2 2 2 2 2 0 0 3 2 2 3 2 2
CO4 2 2 2 2 2 3 0 0 2 2 2 3 2 2
CO5 1 2 2 2 2 2 0 0 3 3 2 2 3 2
Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Introduction Concept of a system, stochastic activities, continue and 08
discrete system, system modeling, mathematical modeling,
principle used in modeling.
2. Simulation of Concepts of simulation of continuous systems with the help 08
Systems of two examples; use of integration formulas; concepts of
discrete system simulation with the help of two examples,
Generation of random numbers, Generation of non-
uniformly distributed numbers.
3. Simulation of Rudiments of queuing theory, Simulation of Single-Server 08
Queuing queue, two-server queue, general queues.
Systems
Unit-2 4. Simulation in Elements of inventory theory, inventory models, Generation 08
Inventory of Poisson and Erlang variants, forecasting and regression
Control and analysis.
Forecasting:

154
 5. Design and Experimental layout and validation. Simulation Languages: 08
Evaluation of Continuous and discrete simulation languages, Block-
Simulation Structured continuous simulation languages, expression
Experiments: based languages,
6. Discrete Discrete system simulation languages, simscript, GPSS, 08
simulation SIMULA, Simpack, GASP IV, CSIM, factors in selection of
languages a discrete system simulation languages.
Total=48

Recommended Books:
1. Narsingh Deo, System Simulation with Digital Computer, Prentice-Hall of India.
2. Gordon, System Simulation, Prentice Hall of India.

155
 Title of the course : Machine Learning
Subject code : PECS-712 B
Weekly load : 3 Hrs LTP 3-0-0
Credits :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand about machine learning algorithms.
CO2 Learn the concept of how to learn patterns and concepts from data without being explicitly
programmed in various IOT nodes.
CO3 Explore supervised and unsupervised learning paradigms of machine learning.
CO4 Explore Deep learning technique and various feature extraction strategies.
CO5 To mathematically analyze various machine learning approaches and paradigms.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 3 3 0 0 0 0 0 1 0 2 2
CO2 3 3 3 3 0 0 0 0 2 0 0 1 3 2
CO3 2 2 3 2 0 0 2 0 0 0 0 0 3 3
CO4 2 2 2 2 2 0 0 0 0 1 0 0 2 3
CO5 0 0 2 1 0 2 0 0 3 1 1 0 2 1

Theory
Unit Main Topics Course Outline Lecture(3)
1. Supervised Learning Basic Methods: Distance-based methods, Nearest- l0
(Regression/Classificat Neighbours,Decision Trees, Naïve Bayes. Linear
ion) models: Linear Regression, Logistic Regression,
Generalized Linear models. support Vector machines,
Nonlinearity and Kernelmethods. Beyond Binary
Classification: multi-class/structured
Outputs,Ranking.
Unit-l 2. Unsupervised Learning Clustering: K-means/KernelK-means. Dimensionality 07
Reduction: PCA and kernelPCA. matrix Factorization
and matrixCompletion. Generative models (mixture
models and latent factormodels).
3. Evaluations of Evaluating machine Learning algorithms and model 07
machine learning selection, Introduction to statistical Learning Theory,
techniques Ensemble methods (Boosting, Bagging, Random
Forests)

156
 4. modeling & deep sparse modeling and Estimation, modeling 09
learning sequence/Time-series Data, Deep Learning and
Feature Representation Learning
5. Other machine Learning scalable machine Learning (Online and Distributed 09
Techniques Learning). A selection from some other advanced
topics, e.g., semi-supervised Learning, Active
Unit- Learning, Reinforcement Learning, Inference in
2 Graphical models, Introduction to Bayesian Learning
and Inference
6. Recent Trends in Recent trends in various learning techniques of 06
learning techniques machine learning and classification methods for IOT
applications. Various models for IOT applications.

Total=48

Recommended Books:
1. Kevin murphy, machine Learning: A Probabilistic Perspective, IT Press.
2. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements of statistical
Learning, springer (freely availableonline)
3. Christopher Bishop, Pattern Recognition and machine Learning, springer.

157
 Title of the course : Adhoc and Wireless Sensor Networks
Subject Code : PECS-712C
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:

CO1 To understand the basics of Adhoc networks and sensor based networks.
CO2 To understand the challenges in designing routing and transport protocols for wireless Ad-
hoc/sensor networks.
CO3 To analyzeadhoc& sensor based networks and compute various parameters associated with
it.
CO4 Discuss the challenges in designing MAC.
CO5 Comprehend the various sensor network Platforms, tools and applications.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 2 0 0 1 0 0 0 0 0 0 2 1 1
CO2 2 2 0 0 2 0 0 0 0 2 0 2 2 2
CO3 2 3 2 2 2 2 0 0 2 2 0 2 2 2
CO4 2 2 3 2 2 2 0 0 2 2 0 2 2 2
CO5 2 2 2 2 2 2 0 0 2 2 0 0 3 2

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Introduction Introduction to ad hoc wireless networks: characteristics of 06
MANETs, Application of MANETs, challenges, topology
based routing protocols, positions based routing.
2. Routing Issues in designing a routing and Transport Layer protocol 08
Protocols for Ad hoc networks- proactive routing, reactive routing
(on-demand), hybrid routing- Classification of Transport
Layer solutions-TCP over Ad hoc wireless Networks.
3. Data Data Transmission In Manets: The broadcast storm 06
Transmission multicasting, geo-casting.
4. TCP over Tcp Over Ad Hoc Networks: TCP protocol overview, TCP 06
Ad-hoc and MANETs, solutions for TCP over Ad-Hoc.
Unit-2 5. Wireless Basics of wireless sensors and applications: The Mica 06
Sensor Mote, Sensing and Communication Range, Design Issues,
Networks Energy consumption, clustering of Sensors, Applications.

158
 6. Classification Data retrieval in sensor networks: classification of WSNs, 06
and Data MAC layer routing layer, high level application layer
Retrieval support, adapting to the inherent dynamic nature of WSNs.
7. Security 10. SECURITY: security in ad-hoc wireless networks, key 06
management, secure routing cooperation in MANETs,
instruction detection system.
8. Sensor 11. Sensor network platforms and tools: Sensor network 04
Programming hardware, sensor network programming challenges, Node-
Level software Platforms.
Total=48

Recommended Books:
1. C. Siva Ram Murthy, and B. S. Manoj, "Ad Hoc Wireless Networks: Architectures and
Protocols ", Prentice Hall Professional Technical Reference, 2008.
2. Wireless Ad Hoc Mobile wireless Networks- principle, protocols and applications, Subir
Kumar Sarkar , et al.,Auerbach publications, Taylor & Francis Group, 2008

159
 Title of the course : Object Oriented Analysis and Design
Subject Code : PECS-712D
Weekly load : 3 Hrs LTP 300
Credit :3
Course Outcomes: At the end of the course, the student will be able to:

CO1 Understand the concept of object-oriented development and create a static object model and
a dynamic behavioural model and a functional model of the system.
CO2 Understand the approaches to system design and object design, and the techniques of
translating design to implementation.
CO3 Implement the object-oriented modelling and design patterns to provide solutions to the
real-world software design problems.
CO4 To develop robust object-based models for Systems
CO5 To inculcate necessary skills to handle complexity in software design

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 0 0 0 0 0 2 0 3 3 2 1

CO2 3 3 3 2 2 0 0 0 0 0 2 2 3 1

CO3 3 0 3 1 1 0 0 0 0 0 1 2 3 2

CO4 0 0 0 3 0 2 2 0 1 1 0 1 2 2

CO5 0 0 0 2 2 1 0 0 2 2 1 0 2 3

Theory

Unit Main Topics Course Outlines Lecture(s)

Unit-1 1. Introduction Object orientation; Development; Modeling; Object 04
modeling technique.
2. Object Modeling Objects and classes; Links and associations; 04
Generalization and inheritance; Grouping constructs;
Aggregation; Abstract classes; Generalization as
extension and restriction; Multiple inheritance; Meta
data; Candidate keys; Constraints.
3. Dynamic Modeling Events and states; Nesting; Concurrency; Advanced 06
and Functional dynamic modeling concepts.
Modeling Functional models; Data flow diagrams; Specifying
operations; Constraints; Relation of functional model
to object and dynamic models.
4. Design Object modeling; Dynamic modeling; Functional 04

160
 Methodology and modeling; Adding operations; Iterating the analysis.
Analysis
5. System Design and Subsystems concurrency; Allocating subsystems to 06
Object Design processors and tasks; Management of data stores;
Handling global resources; Handling boundary
conditions; Setting trade-off priorities; Overview of
object design; Combining the three models; Designing
algorithms; Design optimization; Implementation of
control; Adjustment of inheritance; Design of
associations; Object representation; Physical
packaging; Document design decisions.

6. Comparison of Structured Analysis/Structured Design (SA/SD); 04

Methodologies Jackson Structured Development (JSD).

7. Implementation and Implementation using a programming language; 06

Programming Implementation using a database system;
Style Implementation outside a computer.
Object-oriented programming style; Reusability;
Unit-2 Extensibility; Robustness; Programming-in-the-large.

8. UML Basics; Emergence of UML; Types of diagrams. 04

9. Use Case Actors; Use Case Diagram; Relationships between Use 04

Cases.

10. Classes Class diagram; Classes; Objects; Attributes; 06

Operations; Methods; Interfaces; Constraints;
Generalization; Specialization; Association;
Aggregation.

Total=48
Recommended Books:
1. James E. Rumbaugh, “Object Oriented Modeling and Design”, Pearson Education.
2. Bernd Oestereich, “Developing Software With UML”, Pearson Education.
3. Grady Booch, “Object Oriented Analysis and Design”, Addison Wesley.
4. Pierre-Alain, Muller, “Instant UML”, Shroff Publishers.
5. Grady Booch, James Rumbaugh, Lvar Jacobson, “The Unified Modeling Language User
Guide”, Addison Wesley.
6. Grady Booch, James Rumbaugh, Lvar Jacobson, “The Unified Modeling Language
Reference Manual”, Addison Wesley.
7. Rebecca Wirfs-Brock, “Design Object Oriented Software”, PHI.
8. E. Charnaik, D. McDermott, “Introduction to Artificial Intelligence”, Addison-Wesley
Publishing Company.
9. Nils J. Nilsson, “Principles of Artificial Intelligence”, Narosa Publishing Co.

161
 Title of the course : E-Commerce
Subject Code : PECS-712E
Weekly load : 3Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand the concept of evolution of E-commerce
CO2 Analyze various E-commerce process models
CO3 Identify current issues and case studies in E-commerce
CO4 Understand the processes of developing and implementing information systems
CO5 Be aware of the ethical, social, and security issues of information systems.
CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):
Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PO PS01 PSO
PO1 PO2 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
3 2
CO1 3 2 2 2 3 1 0 2 3 3 3 2 1 1
CO2 3 2 2 2 3 1 0 2 3 3 3 2 2 2
CO3 3 2 2 2 3 1 0 2 3 3 3 2 2 3
CO4 3 2 2 2 3 1 0 2 3 3 3 2 2 2
CO5 3 2 2 1 3 2 0 2 3 3 2 1 2 2

Theory
Unit Main Topics Course outlines Hour(s)
1. Introduction to E- Introduction, E-commerce or Electronic Commerce- An 06
commerce Overview, Electronic Commerce– Cutting edge,
Electronic Commerce Framework
2. Evolution of E- Introduction, History of Electronic Commerce, Advantages 06
commerce and Disadvantage of E-commerce, Roadmap of e-
Unit-1 commerce in India
3. E-commerce Introduction, E-commerce Infrastructure-An Overview, 06
Infrastructure Hardware, Server Operating System, Software, Network
Website
4. Managing the e- Introduction, e-Enterprise, Managing the e-Enterprise, E- 06
Enterprise business Enterprise, Comparison between Conventional
Design and E-organization, Organisation of Business in an
e-Enterprise
5. e-Commerce Introduction, Business Models, E-business Models Based 06
Process Models on the Relationship of Transaction Parties, e-commerce
Sales Life Cycle (ESLC) Model

162
 6. Electronic Electronic Payment Systems, Electronic Cash, Smart Cards 06
Payment Systems and Electronic Payment Systems, Credit Card Based
Unit-2 Electronic Payment Systems, Risks and Electronic
Payment Systems
7. Electronic Data The Meaning of EDI, History of EDI, EDI Working 06
Interchange Concept, Implementation difficulties of EDI, Financial
EDI, EDI and Internet
8. E-Marketing, The scope of E-Marketing, Internet Marketing 06
Current issues and
Case Studies Techniques, Current issues in E-commerce and Case
studies on E-commerce
Total=48
Recommended Books:
1. Kenneth C. Laudon:E-Commerce: Business, Technology, Society, 4th Edition, Pearson
2. S. J. Joseph, E-Commerce: An Indian perspective, PHI

163
 Title of the course : Parallel Computing
Subject Code : PECS-712F
Weekly load : 3 Hrs LTP 3 0 0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand the concepts related to parallel computing
CO2 Learn how to measure the performance of parallel computers
CO3 Understand the advanced processor technology and memory hierarchy
CO4 Learn the concepts behind multithreaded architecture and multicore programming
CO5 Analyse the efficiency of a parallel processing system and evaluate the types of
application for which parallel programming is useful.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2
CO1 2 1 2 2 0 0 0 0 0 0 0 1 1
CO2 2 2 3 3 2 2 0 0 2 2 0 2 2
CO3 2 2 3 2 2 2 0 0 2 2 2 3 2
CO4 3 2 2 2 2 2 0 0 2 2 2 2 2
CO5 3 3 2 3 3 2 0 0 2 3 2 3 3

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Parallel The State of Computing, Multiprocessors and 06
Computer Multicomputers, Multivector and SIMD Computers,
Models Architectural Development Tracks.
2. Program and Conditions of Parallelism, Program Partitioning and 06
Network Scheduling, Program Flow Mechanisms, System
Properties Interconnect Architecture.
3. Metrics and Performance Metrics and Measures, Parallel Processing 06
Scalability Applications, Speedup Performance Laws, Scalability
Analysis and Approaches.
4. Advanced Processor Technology, Superscalar and Vector 06
ProcessorHierarc Processors.
hy
Unit-2 5. Memory Memory Hierarchy Technology, Virtual Memory 06
Hierarchy Technology.
6. Bus, Cache, and Bus Systems, Cache Memory Organizations, Shared-
Shared Memory Memory Organizations, Sequential and Weak Consistency
Models, Cache Coherence and Synchronization

164
 Mechanisms, Message-Passing Mechanisms.

7. Pipelining and Linear Pipeline Processors, Nonlinear Pipeline Processors, 06

Superscalar Instruction Pipeline Design, Arithmetic Pipeline Design,
Techniques and Superscalar Pipeline Design, Vector Processing Principles,
Multivector Compound Vector Processing, Latency-Hiding
Computers Techniques.
8. Principles of Threads Versus Processes, Types of Thread-Level 06
Multithreading Parallelism: Chip-Level Multiprocessing, Interleaved
Multithreading, Simultaneous Multithreading,
Hyperthreading.
Total=48
Recommended Books:
1. Kai Hwang, Advanced Computer Architecture, McGraw-Hill.
2. Kai Hwang, F Briggs, Computer Architecture and Parallel Processing, McGraw Hill.
3. M Flynn, Computer Architecture: Pipelined and Parallel Processor Design, 1/E, Jones
and Bartlett.
4. Harry F Jordan, Fundamentals of Parallel Processing, Prentice Hall.
5. Hesham El-Rewini, Mostafa Abd-El-Barr, Advanced Computer Architecture and Parallel
Processing, Wiley-Interscience.
6. Shameem Akhter, Jason Roberts, Multi-Core Programming, Intel Press.

165
 Title of the course : Software Reliability & Testing
Subject Code : OECS-711A
Weekly load : 3 Hrs LTP 3-0-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand the concept of reliability and access the difference between H/W & S/W
reliability and evaluate different S/W engineering technologies
CO2 Understand and anticipate the possible causes of failure and knowledge of how to prevent
them and know about various parameter determination methods
CO3 Analyze and test a S/W system, when it is evolved to accommodate a set of change
requirements such as adding new functionalities, bug fixing etc
CO4 How to test software appropriately and effectively and have hands-on experience with test
generation and test automation.
CO5 Design reliability models for software systems.

CO/PO Mapping: (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3 2 1 1 0 0 2 0 3 3 1 1
CO2 3 3 3 2 2 1 0 0 2 0 2 2 2 2
CO3 3 0 3 2 2 1 0 0 2 0 2 2 2 3
CO4 2 0 2 2 2 2 0 0 2 0 3 2 2 3
CO5 3 0 2 3 2 2 0 0 2 0 2 2 2 3

Theory

Unit Main Topics Course outlines Lecture(s)

Unit-1 1. Introduction Software Reliability & Hardware Reliability, Basic 08
Concepts, Availability, Modeling.
2. Selected Execution Time Component, Calendar Time Component, 08
Models Model Choice.

3. Applications: System Engineering, Project Management, Management of 08

Operational Phase, Evaluation of S/W Engineering
Technologies.
Unit-2 4. System Failure definition, System Configuration, Text Run 08
Definition Selection.

5. Parameter Execution Time Component, Calendar Time Component. 08

Determination

166
 6. Project Unobserved Failures, Failure Time Measurement, Evolving 08
Specific Programs, Changes in Environment, Other Consideration.
Techniques
Total=48
Recommended Books:
1. Pressman, Software Engineering concepts, TMH.

167
 Title of the course : Human Resource Management
Subject Code : OECS-711B
Weekly load : 3Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Identify scope and importance of human resource management in industry.
CO2 Facilitate and support effective employee and labour relations in both non-union and union
environments.
CO3 Define strategic HR planning and the HRM process to the organization’s strategic management
and decision-making process
CO4 Research and support the development and communication of the organization's total
compensation plan.
CO5 List training and development processes as well as future trends for HRM globalization

CO/PO Mapping : (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COS
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 3 3 0 3 0 0 2 3 3 3 2 1 2
CO2 2 3 3 0 3 1 1 2 1 2 3 2 3 2
CO3 3 0 0 2 3 3 0 2 2 1 2 1 2 1
CO4 3 1 1 2 3 3 3 1 1 0 2 0 2 3
CO5 2 3 3 2 3 1 0 2 3 3 3 2 1 2

Theory
Unit Main Topics Course outlines Hour(s)
1. Introduction Introduction to Human Resource Management and its 06
definition, functions of Human Resource Management &
its relation to other managerial functions. Nature, Scope
and Importance of Human Resource Management in
Industry, Role & position of Personnel function in the
Unit-1 organization.
2. Procurement and Need for Human Resource Planning; Process of Human 06
Placement Resource Planning; Methods of Recruitment;
Psychological tests and interviewing; Meaning and
Importance of Placement and Induction, Employment
Exchanges (Compulsory Notification of vacancies) Act
1959, The Contract Labour (Regulation & Abolition) Act
1970.
3. Training & Difference between training and Development; Principles 06
Development of Training; Employee Development; Promotion-Merit v/s
seniority Performance Appraisal, Career Development &
Planning.

168
 4. Job analysis & Job Analysis: Job Description & Job Description, Job 06
Design Specification.
5. Job Satisfaction Job satisfaction and its importance; Motivation, Factors 06
affecting motivation, introduction to Motivation Theory;
Workers ' Participation, Quality of work life.
6. The Compensation Basic concepts in wage administration, company’s wage 06
Function policy, Job Evaluation, Issues in wage administration,
Unit-2 Bonus & Incentives, Payment of Wages Act-1936,
Minimum Wages Act-1961
7. Integration Human Relations and Industrial Relations; Difference 06
between Human Relations and Industrial Relations, Factors
required for good Human Relation Policy in Industry;
Employee Employer relationship Causes and Effects of
Industrial disputes; Employees Grievances & their
Redressal.
8. Maintenance Fringe & retirement terminal benefits, administration of 06
welfare amenities, Meaning and Importance of Employee
Safety, Accidents-Causes & their Prevention, Future
challenges for Human Resource Management.
Total=48
Recommended Books:
1. T.N.Chhabra- Human Resource Management (Dhanpat Rai & Co.)
2. Lowin B. Flippo - Principles of personnel Management (McGraw-Hill)

169
 Title of the course : Client Server Architecture
Subject Code : OECS-711C
Weekly load : 3Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand distributed computing and client-server architecture
CO2 Analyze the need of distributed computing and remote-method invocation
CO3 Understand Java IDL technology for distributed objects
CO4 Understand fundamental concepts of Web Services
CO5 Analyze the contents the packet contents of different protocols.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PO PSO1 PSO2
PO1 PO2 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
3
CO1 2 2 2 1 2 2 0 0 0 0 2 2 1 1
CO2 2 2 2 2 2 2 0 0 0 0 2 2 2 2
CO3 2 2 2 2 2 2 0 0 0 2 2 2 2 2
CO4 2 2 2 2 2 2 0 0 0 2 2 2 2 2
CO5 2 1 2 0 2 2 0 0 0 2 2 0 3 2

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Fundamental Client/Server technology an introduction, Classification – 06
of Distributed Mainframe, File sharing, Client/Server,
Systems: Distributed/Collaborative architecture, Distributed
Computing Environment–DCE architecture, Type of
Client/Server Architecture – Two- tier architecture, Three-
tier architecture, Distributed/Collaborative enterprise
architecture.
2. Technologies Complementary Technologies to 3-tier – Object – oriented 06
Design, Database Two Phase Commit Processing, Remote
Procedure Call, Message Oriented Middleware.
3. Distributed Structure – Client/Server Model, Defining distributed 08
Computing Environment, Motivation for Distributed Computing,
Environment: Developing the Distributed Computing Architecture
Remote Framework, Fundamental Technologies & Design
Method Mechanism.
Invocation:
4. Remote Distributed Object Model, RMI System Overview, Client 06
Method interfaces, Registry interfaces, Remote object interface, Stub
Invocation interface, Exception in RMI.

170
Unit-2 5. Distributed The DCOM Architecture, Component & Reuse, Location 06
Component Independence, Language Neutrality, Connection
Object Model Management, Scalability, Performance, Bandwidth &
Latency, Security, Local Balancing, Fault Tolerance, Ease of
Deployment, Protocol Neutrality, Platform Neutrality,
6. Integration Seamless Integration with other Internet Protocols. 04
7. The Common Overview of CORBA, The object request Broker, OMG 08
Object Interface Definition Language, Language Mapping, Interface
Request Repository, Stubs & Skeletons, Dynamic Invocation &
Broker Dispatch, Object Adapters
8. Case study Java IDL (Interface Definition Language). 04
Total=48

Recommended Books:
1. P.M. Heinchieus, Object-oriented Design Architecture and Implementation, Addison
Wesley .

171
Title of the course : Multimedia and Animation
Subject Code : OECS-711D
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand all the basic in the multimedia technologies.
CO2 with all phases like digital images, digital audio & video, compression & standards etc.
CO3 Understand the fundamental principles of animation in addition to an invaluable
appreciation for observational techniques & the art of planning.
CO4 To learn and understand technical aspect of Multimedia Systems.
CO5 To develop multimedia application and analyze the performance of the same

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)

Cos PO PO PO1 PO1 PO1 PSO PSO
PO1 PO2 PO5 PO6 PO7 PO8 PO9
3 4 0 1 2 1 2
CO1 2 0 2 0 2 0 0 0 0 0 0 2 3 2
CO2 2 0 2 2 1 0 0 0 0 0 0 2 3 2
CO3 2 3 2 2 2 0 0 0 2 0 2 2 3 3
CO4 2 3 2 2 2 0 0 0 2 0 2 2 3 2
CO5 2 3 2 2 2 0 0 0 2 0 2 2 3 2

Theory

Unit Main Topics Course outlines Lectures

Unit-1 1. Introduction Introduction to Multimedia, Design Processes, Hypertext, 06
Links, Frames, Files, HTML, HGML, Morphing, and Media
Control interfaces. Multimedia Tools, Elements of
Multimedia, Sound Input, Video Input, Data Automation,
General Devices.
2. Text and Types of text, Font, insertion, compression, File formats. 06
Image Types of images, color models, Basic steps for image
processing, principle and working of scanner and digital
camera, Gamma and gamma correction.
3. Audio and Fundamental characteristics of sound, sensors for TV 06
Video cameras, color fundamentals, additive and subtractive color
technology mixing, Liquid crystal display (LCD), Plasma Display

172
 Panel (PDP), file formats , Video for Window, QuickTime
4. Image Image fundamentals and representations 10 Hrs. Colour 06
fundamenta Science , Colour, Colour Models, Colour palettes,
ls and Dithering, 2D Graphics, Image Compression and File
representati Formats :GIF, JPEG, JPEG 2000, PNG, TIFF, EXIF, PS,
ons PDF, Basic Image Processing, Use of image editing
software, White balance correction, Dynamic range
correction, Gamma correction, Photo Retouching.
Unit- 5. Multimedia Overview, multimedia authoring metaphor, multimedia 06
2 presentation production, presentation and automatic authoring, Design
and authoring paradigms and user interface, overview of tools like adobe
premiere, director, flash and Dreamweaver.
6. Animation Introduction and examples of Animation. Types of 06
Animation Cel Animation, Stop Motion Animation,
Computer Animation, 2-D Animation, 3-D Animation.
7. Basic Illusion of Life, straight action and pose to pose Timing, 06
Principles of Exaggeration, Drama and Psychological Effect, Fade in and
Animation Fade out, Squash and Stretch, Anticipation, staging, follow
through and overlapping action, Arcs, Solid Drawing
,Appeal, slow in and slow out, Secondary Action.
8. Various Animation Drawings/Cels, Rough Drawings , Clean ups, 06
Terms Color reference drawings, Layout, Model Sheet, Key
Drawings and in Betweens, Master Background, Concept
Piece, Character drawing , Story Board.
Total=48
Recommended Books:
1.Principles of Multimedia by Ranjan Parekh. Tata McGraw-Hill
2.Multimedia technologies by Ashok banerji
3.Prabhat K. Andleigh and Kiran Thakrar, “Multimedia Systems Design”, PHI publication
4.John F. Koegal Buford, “Multimedia systems”, Pearson Education.

173
 Title of the course : Data Mining
Subject Code : OECS-711E
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: On successful completion of this course, students will be able to:
CO1 Design a data mart for any organization
CO2 Develop skills to write queries using DMQL
CO3 Extract knowledge using data mining techniques
CO4 Adapt to new data mining tools
CO5 Explore recent trends in data mining such as web mining, spatial-temporal mining

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 1 2 1 1 2 0 0 2 0 0 2 3 2
CO2 2 3 3 2 2 2 0 0 2 2 2 2 2 3
CO3 2 3 3 3 2 3 0 0 3 2 2 2 3 3
CO4 2 3 3 3 2 3 0 0 2 2 2 2 2 3
CO5 2 2 2 2 2 2 0 0 2 0 2 2 3 3

Theory

Unit Main Topics Course outlines Lecture(s)

Unit-1 1. Introduction Data Mining Concepts, Input, Instances, Attributes and 06
Output, Knowledge Representation & Review of Graph
Theory, Lattices, Probability & Statistics

2. Machine Supervised Learning Framework, concepts & hypothesis, 06

learning Training & Learning, Boolean functions and formulae,
concepts and Monomials, Disjunctive Normal Form & Conjunctive
approaches Normal Form, A learning algorithm for monomials
3. Data Data Cleaning, Data Integration & Transformation, Data 05
Preparation Reduction
4. Mining Associations, Maximal Frequent & Closed Frequent item 07
Association sets, Covering Algorithms & Association Rules, Linear
Rules Models & Instance-Based Learning, Mining Association
Rules from Transactional databases, Mining Association
Rules from Relational databases & Warehouses, Correlation
analysis & Constraint-based Association Mining.
Unit-2 5. Classification Issues regarding Classification & Prediction, Classification by 06
and Prediction Decision Tree induction, Bayesian classification, Classification

174
 by Back Propagation, k-Nearest Neighbor Classifiers, Genetic
algorithms, Rough Set & Fuzzy Set approaches
6. Cluster Types of data in Clustering Analysis, Categorization of Major 06
Analysis Clustering methods, Hierarchical methods, Density-based
methods, Grid-based methods, Model-based Clustering
methods
7. Mining Multidimensional analysis & Descriptive mining of Complex 06
Complex data objects, Mining Spatial Databases, Mining Multimedia
Types of Data Databases, Mining Time-series & Sequence data, Mining Text
databases, Mining World -Wide Web
8. Data Mining Massive Datasets/Text mining, Agent-Based Mining 06
Applications
and Trends in
Data Mining
Total=48

Recommended Books:
1. Jiawei Han and Micheline Kamber, “Data Mining: Concepts and Techniques”, Morgan
Kaufmann Publishers, 2000 (ISBN: 1-55860-489-8).
2. Ian H. Witten and Eibe Frank, “Data Mining: Practical Machine Learning Tools and
Techniques with Java implementations”, Morgan Kaufmann Publishers, San Fransisco, CA
(2000).
3. Dorian Pyle, “Data Preparation for Data Mining”, Morgan Kaufmann, (1999)
4. Korth, Silbertz, Sudarshan, “Database Concepts”, McGraw Hill
5. Elmasri, Navathe, “Fundamentals Of Database Systems”, Addision Wesley

175
 Title of the course : Project Stage I and Seminar
Subject code : PRCS-711
Weekly load : 4 Hrs LTP 0-0-4
Credits :2
Course Outcomes: At the end of the course, the student will be able to:
CO1 Evaluate social impact of technology.
CO2 Evaluate environmental impact of technology.
CO3 design system for real-life applications.
CO4 To understand need of project management.
CO5 To understand project scheduling concept and risk.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 3 2 2 2 2 0 0 2 2 2 2 2 2
CO2 3 3 2 2 2 2 0 0 2 2 2 2 2 2
CO3 3 2 2 2 2 2 0 0 1 2 2 3 2 2
CO4 2 2 3 2 2 0 0 0 2 2 3 2 3 2
CO5 3 2 2 3 2 0 0 0 2 0 2 2 3 3

Project Stage I and Seminar Evaluation: In this, the student must select an area from emerging
technologies and specify the objectives to be achieved. Evaluation criteria will be based on
objective stated and achieved.

Month July Aug - Oct Nov

Seminar/Project Submit area and Weekly report to Final report submission

Stage I objectives to be faculty Incharge.
achieved

176
 Title of the course : Soft Computing
Subject code : MDCS-711
Weekly load : 4 Hrs LTP 3-1-0
Credits :4

Course Outcomes: At the end of the course, the student will be able to understand:
CO1 Understand fuzzy logic and its applications.
CO2 Acquire knowledge of artificial neural networks and their applications.
CO3 Solve single-objective optimization problems using genetic algorithms.
CO4 Apply soft computing to solve problems in varieties of application domains.
CO5 Introduce students to artificial neural networks and fuzzy theory from an engineering
perspective.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 2 2 2 0 0 2 2 2 3 2 2
CO2 3 3 3 3 3 2 0 0 3 2 2 3 2 3
CO3 3 3 3 2 2 2 0 0 3 3 3 3 3 2
CO4 3 3 3 2 2 3 0 0 3 3 3 3 3 3
CO5 2 3 2 2 2 3 0 0 3 3 3 2 3 3

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Introduction Concept of computing systems; “Soft” computing versus 02
to Soft “Hard” computing; Characteristics of soft computing; Some
Computing applications of soft computing techniques
2. Fuzzy Logic Introduction to fuzzy logic; Fuzzy sets and membership 10
functions; Operations on fuzzy sets; Fuzzy relations, rules,
propositions, implications and inferences; Defuzzification
techniques; Fuzzy logic controller design; Some applications
of fuzzy logic
3. Genetic Concept of “Genetics” and “Evolution” and its application to 12
Algorithms probabilistic search techniques; Basic GA framework and
(GAs) different GA architectures; GA operators: encoding,
crossover, selection, mutation, etc.; Solving single-objective
optimization problems using GAs
4. Artificial Biological neurons and their working; Simulation of 12
Unit- biological neurons to problem solving; Different ANN
Neural
II architectures; Training techniques for ANNs; Applications of
Networks
ANNs to solve some real-life problems

177
 5. Unsupervised Competitive learning networks; Kohonen self-organising 12
Learning networks; Hebbian learning; The Hopfield network
Total=48

Recommended Books:
1. F. Martin McNeill, and Ellen Thro, Fuzzy Logic: A Practical Approach, Morgan
Kaufmann Pub.
2. Timothy J. Ross, Fuzzy Logic with Engineering Applications, Wiley.
3. Nikola K. Kasabov, Foundations of Neural Networks, Fuzzy Systems, and Knowledge
Engineering, MIT Press.
4. Melanie Mitchell, An Introduction to Genetic Algorithms, MIT Press.
5. David E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning,
Pearson Education.
6. S. Rajasekaran, and G. A. Vijayalakshmi Pai, Neural Networks, Fuzzy Logic and Genetic
Algorithms: Synthesis, and Applications, Prentice Hall of India.
7. D. K. Pratihar, Soft Computing, Narosa, 2008.

178
 Title of the course : Cryptography and Network Security
Subject Code : HDCS-711
Weekly load : 4 Hrs LTP 3-1-0
Credit :4

Course Outcomes: At the end of the course, the student will be able to:
CO1 Know about information security, which includes an overview of public and secret key
Cryptosystems
CO2 Comprehend and apply authentication services and mechanisms
CO3 Identify system vulnerabilities of communication protocols
CO4 Apply the knowledge and skills obtained to study further concepts in information security
CO5 To learn about how to maintain the Confidentiality, Integrity and Availability of a data.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 1 3 2 0 0 0 0 2 0 1 2 2 2
CO2 2 2 2 2 1 2 0 0 2 2 2 2 2 3
CO3 2 2 2 2 1 2 0 0 2 2 2 2 2 3
CO4 2 2 2 2 2 2 0 0 1 2 2 2 3 2
CO5 2 3 2 2 1 0 0 0 1 2 2 2 3 3

Theory
Unit Main Topics Course outlines Lecture(s)
Unit1 1. Introduction Terminology: Security, Security Attacks, Security Services, 06
Security Mechanisms, OSI Security Architecture, A Model
for Internetwork Security, Internet Standards.
2. Symmetric Symmetric Cipher model, substitution techniques, 06
Ciphers Transposition techniques, Rotor machines, Steganography,
Block Cipher principles,
3. Data Data Encryption standard, Strength of DES, Differential and 05
Encryption Linear Cryptoanalysis, Block Cipher Design principles
4. Advanced Evaluation Criteria for AES, The AES Cipher, Multiple 05
Encryption Encryption, Triple DES, Block Cipher modes of Operation.
Standard
Unit2 5. Key Public Key Cryptography Principles, PublicKey 12
Encryption Cryptography Algorithms, Key Management, DiffieHellman
and Hash Key exchange, Digital Signatures, Digital signature standard,
functions: Authentication protocols, Cryptography and Message
Authentication, Approaches to Message Authentication,
6. Hash Secure Hash Functions and HMAC. 04
Functions

179
 7. Network Authentication Applications, Kerberos, X.509 Directory 08
Security Authentication Service, Public Key Infrastructure, Kerberos
Applications Encryption Techniques Electronic Mail Security, Pretty Good
Privacy (PGP), S/MIME, Introduction to Firewalls.
8. Firewalls Introduction to Firewalls, Various types of Firewall 02
Total=48

Recommended Books:
1. William Stallings, Cryptography and Network Security, Principles and practices, PHI.
2. William Stallings, Network Security Essentials ,PHI

180
SEMESTER-VIII

181
 Title of the course : Digital Signal Processing
Subject Code : PECS-721A
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:

CO1 To understand the basics of discrete time signals, systems and their classifications.
CO2 To analyze the discrete time signals in both time and frequency domain.
CO3 To design lowpass digital IIR filters according to predefined specifications based on
analog filter theory and analog-to-digital filter transformation.
CO4 To design Linear phase digital FIR filters using fourier method, window technique
CO5 To Understanding of spectral analysis of the signals
CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):
Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COS
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 3 1 1 0 0 0 0 0 0 0 2 2 3
CO2 3 3 3 2 2 0 0 0 0 0 0 3 2 1
CO3 3 3 3 3 2 0 0 0 1 0 0 3 1 1
CO4 3 3 3 3 3 1 1 0 1 0 0 3 1 1
CO5 2 1 3 2 0 0 1 2 0 0 1 2 1 2

Unit Main Topics Course outlines Lecture(s)

Unit- 1. Introduction to Overview: Signals, systems and signal processing, classification 06
1 DSP of signals, elements of digital signal processing system, concept
of frequency in continuous and discrete time signals, Periodic
Sampling, Frequency domain representation of sampling,
Reconstructions of band limited signals from its samples
2. Discrete-Time Z-transform & Inverse z-transform, Linear convolution and its 06
Signals and properties, Linear Constant Coefficient Difference equations,
Systems Frequency domain representation of Discrete-Time Signals &
(Frequency Systems, Representation of sequences by discrete time Fourier
Domain Transform, (DTFT), Properties of discrete time Fourier
analysis) Transform, and correlation of signals, Fourier Transform
Theorems.
3. Analysis of Analysis of LTI systems in time domain and stability 06
Linear Time considerations. 8 15 Frequency response of LTI system, System
Invariant functions for systems with linear constant-coefficient Difference
System equations, Freq. response of rational system functions relationship
between magnitude & phase, All pass systems, inverse systems,
Minimum/Maximum phase systems, systems with linear phase.
4. Structures for Block Diagram and signal flow diagram representations of Linear 06
Discrete Time Constant-Coefficient Difference equations, Basic Structures of
Systems: IIR Systems, lattice and lattice-ladder structures, Transposed
forms, Direct and cascade form Structures for FIR Systems,
182
 Linear Phase FIR structure, Effects of Co-efficient quantization.

Unit 5. Filter Design Design of Discrete-Time IIR filters from Continuous-Time filters 06
-2 Techniques Approximation by derivatives, Impulse invariance and Bilinear
Transformation methods; Design of FIR filters by windowing
techniques.
6. Finite Impulse Linear Phase FIR filter–Phase delay–Group delay–Realization of 06
Response FIR filter–Design of Causal and Non-causal FIR filters (LPF,
Filters HPF, BPF and BRF) using Window method (Rectangular,
Hamming window, Hanning window) –Frequency Sampling
Technique.
7. Applications Multirate Signal Processing: Decimation, Interpolation, Spectrum 06
Of DSP of the sampled signal –Processing of Audio and Radar signal.
8. Architecture of Hardwired architecture, pipelining, Multiplier-accumulator 06
DSP (MAC) hardware, architectures of fixed and floating point
Processors & (TMSC6000) DSP processors. Applications
applications

Total=48
Recommended Books:

1. “Digital Signal Processing: Principles, Algorithm & Application”, 4th edition, Proakis,
Manolakis, Pearson
2. “Discrete Time Signal Processing”:Oppeheim, Schafer, Buck Pearson education publication,
2nd Edition, 2003.
3. Digital Signal Processing fundamentals and Applications,Li Tan , Jean Jiang, Academic
Press,2nd edition,2013
4. Digital Signal Processing – A computer based Approach, S.K.Mitra, Tata McGraw Hill,3rd
edition,2006 5. Fundamentals of digital Signal Processing –Lonnie c.Ludeman, Wiley

183
 Title of the course : Neural Networks and Deep Learning
Subject code : PECS-721 B
Weekly load : 3 Hrs LTP 3-0-0
Credits :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Identify the deep learning algorithms which are more appropriate for various types of
learning tasks in various domains.
CO2 Implement deep learning algorithms and solve real-world problems.
CO3 Implement, train and evaluate neural network using existing software libraries.
CO4 Explain different network architecture and how these are used in current applications.
CO5 Present and critically assess current research on neural network and their applications.

CO/PO Mapping: (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 0 0 0 0 0 2 0 3 3 3 3

CO2 3 3 3 2 2 0 0 0 0 0 2 2 3 3
CO3 3 3 3 0 0 0 0 0 2 0 3 3 2 1
CO4 3 3 3 2 2 0 0 0 0 0 2 2 3 2
CO5 3 1 2 0 0 0 1 2 3 0 2 2 1 1

Theory

Unit Main Topics Course outlines Lecture(s)

Unit-1 1. Introduction Various paradigms of earning problems, Perspectives and 4
Issues in deep learning framework, review of fundamental
learning techniques.
2. Feedforward Artificial Neural Network, activation function, multilayer 6
neural Perceptron, Gradient descent, Backpropagation, empirical risk
network minimization, regularization, autoencoders.
3. Training Risk minimization, loss function, backpropagation, 6
Neural regularization, model selection, and optimization. Greedy
Network layerwise training.
4. Conditional Linear chain, partition function, Markov network, Belief 8
RandomFields propagation, Training CRFs, Hidden Markov Model, Entropy.

184
 5. Deep Deep Feed Forward network, regularizations, training deep 8
Learning models, dropouts, Convolutional Neural Network, Recurrent
Neural Network, Deep Belief Network.
6. Probabilistic Hopfield Net, Boltzman machine, RBMs, Sigmoid net,
Neural Autoencoders 6
Network
7. Deep Object recognition, sparse coding, computer vision, natural 6
Learning language processing
research
8. Deep Caffe, Theano, Torch 4
Learning
Tools

Total=48

Recommended Books:
1. Yegnananrayana, B., Artificial Neural Networks PHI Learning Pvt. Ltd, 2009.
2. Golub, G.,H., and Van Loan, C.,F., Matrix Computations, JHU Press, 2013.
3. Satish Kumar, Neural Networks: A Classroom Approach, Tata McGraw-Hill Education, 2004.

185
 Title of the course : Client Server Architecture
Subject Code : PECS-721C
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:

CO1 Understand distributed computing and client-server architecture

CO2 Understand fundamental concepts of Web Services
CO3 Analyze the need of distributed computing and remote-method invocation
CO4 Understand Java IDL technology for distributed objects
CO5 should be able to gain solid knowledge on distributed systems concepts and be able to apply them to
simple real world projects.

CO/PO Mapping : (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation):

Programme Outcomes (POs)
Cos PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
0 0 0 0 0
CO1 1 2 0 0 0 0 2 3 3
0 0 0 0 1
CO2 1 2 1 0 1 1 2 2 1
0 0 0 0 2
CO3 2 2 1 0 2 2 2 3 3
2 2 2 1 1
CO4 2 0 1 3 3 0 2 1 2
3 1 3 2 0
CO5 0 1 2 0 1 0 1 2 1

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Fundamental Client/Server technology an introduction, Classification – 06
of Distributed Mainframe, File sharing, Client/Server,
Systems: Distributed/Collaborative architecture, Distributed
Computing Environment–DCE architecture, Type of
Client/Server Architecture – Two- tier architecture, Three-
tier architecture, Distributed/Collaborative enterprise
architecture.
2. Technologies Complementary Technologies to 3-tier – Object – oriented 06
Design, Database Two Phase Commit Processing, Remote
Procedure Call, Message Oriented Middleware.

186
 3. Distributed Structure – Client/Server Model, Defining distributed 08
Computing Environment, Motivation for Distributed Computing,
Environment: Developing the Distributed Computing Architecture
Remote Framework, Fundamental Technologies & Design
Method Mechanism.
Invocation:
4. Remote Distributed Object Model, RMI System Overview, Client 06
Method interfaces, Registry interfaces, Remote object interface, Stub
Invocation interface, Exception in RMI.
Unit-2 5. Distributed The DCOM Architecture, Component & Reuse, Location 06
Component Independence, Language Neutrality, Connection
Object ModelManagement, Scalability, Performance, Bandwidth &
Latency, Security, Local Balancing, Fault Tolerance, Ease of
Deployment, Protocol Neutrality, Platform Neutrality,
6. Integration Seamless Integration with other Internet Protocols. 04
7. The Common Overview of CORBA, The object request Broker, OMG 08
Object Interface Definition Language, Language Mapping, Interface
Request Repository, Stubs & Skeletons, Dynamic Invocation &
Broker Dispatch, Object Adapters
8. Case study Java IDL (Interface Definition Language). 04
Total=48

Recommended Books:
1. P.M. Heinchieus, Object-oriented Design Architecture and Implementation, Addison
Wesley.
2. Alex Berson, Client/Server Architecture, McGraw-Hill Computer Communications
Series
3. Patrick Smith, Steve Guengerich, Client/Server Computing, PHI

187
 Title of the course : Software Reliability & Testing
Subject Code : PECS-721D
Weekly load : 3 Hrs LTP 3-0-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand the concept of reliability and access the difference between H/W & S/W
reliability and evaluate different S/W engineering technologies
CO2 Understand and anticipate the possible causes of failure and knowledge of how to prevent
them and know about various parameter determination methods
CO3 Analyze and test a S/W system, when it is evolved to accommodate a set of change
requirements such as adding new functionalities, bug fixing etc
CO4 Understand different time dependent and time independent software reliability models.
CO5 Design reliability models for software systems.

CO/PO Mapping: (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 3 0 0 0 0 3 2 0 3 3 3 3
CO2 3 3 3 2 2 1 0 0 0 1 2 2 2 2
CO3 3 0 3 1 1 0 2 0 0 0 1 2 3 3
CO4 1 2 3 0 0 1 1 2 2 0 2 2 1 2
CO5 1 1 2 2 0 0 3 2 1 3 0 1 2 3

Theory

Unit Main Topics Course outlines Lecture(s)

Unit-1 1. Introduction Software Reliability & Hardware Reliability, Basic 08
Concepts, Availability, Modeling.
2. Selected Execution Time Component, Calendar Time Component, 08
Models Model Choice.

3. Applications: System Engineering, Project Management, Management of 08

Operational Phase, Evaluation of S/W Engineering
Technologies.
Unit-2 4. System Failure definition, System Configuration, Text Run 08
Definition Selection.

5. Parameter Execution Time Component, Calendar Time Component. 08

Determination

188
 6. Project Unobserved Failures, Failure Time Measurement, Evolving 08
Specific Programs, Changes in Environment, Other Consideration.
Techniques
Total=48

Recommended Books:
1. Pressman, Software Engineering concepts, TMH.

189
 Title of the course : Business Management System
Subject Code : PECS-721E
Weekly load : 3Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand the concepts related to Business.
CO2 Recognize the various roles of managers and types of business management
CO3 Understand methods to plan, incorporate innovation and build strategies for global management
CO4 Identify the fundamentals of managing and organizing environments
CO5 Understand the complexities associated with management of human resources in the
organizations and integrate the learning in handling these complexities.
CO/PO Mapping : (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation):
Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COS PS01 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 3 3 0 3 0 0 2 0 3 3 2 1 2
CO2 2 3 3 0 3 1 1 2 3 3 3 2 1 3
CO3 2 3 3 2 3 1 0 2 3 3 3 2 1 2
CO4 1 1 2 2 0 0 1 2 1 2 2 0 2 3
CO5 2 1 3 2 1 1 0 0 1 2 1 2 3 1

Theory
Unit Main Topics Course outlines Hour(s)
1. Introduction to Introduction, Management roles, Management functions, 06
Business Managerial levels, Managerial types, Managerial
management knowledge, Managerial abilities and skills
system
2. The Planning Value of planning cycle, Mission and Vision Statements, 06
Unit-1 Function Assessing the environment, Operational and Short term
plans, SWOT Analysis, Determining organization goals
3. The Organizing Job design, Departmentalization, Managerial concerns, 06
Function completing the organization structure, structural
configuration, Organization goals in structure design
4. The Staffing Nature of Staffing, Legal aspects of staffing, Strategic 06
Function human resource management, Job design and human
resource planning, Employee placement, Employee
development and Employee environment
5. The Leading Leading vs Managing, Leadership theories, Leadership and 06
Function Power, Leadership and Motivation, Process theories of
Motivation, Content theories of Motivation

190
 6. Group, Teams and Types of Groups and Teams, Stages of team development, 06
Communication Leading and Effective Teamwork, Leading and individual
Unit-2 communication, Overcoming interpersonal communication
barriers
7. The controlling Constant controls, Periodic controls, Functional area 06
Function controls, Accounting and Financial controls, Ratio
Analysis, Ratio Budgeting Process
8. Case studies and Future Directions in business management system and 06
Future trends
related Case Studies
Total=48
Recommended Books:
1. Donald Baack,The five function of Effective Management, 2th Edition, Bridgepoint
Education.
2. R.C. Bhatia, Business Organization and Management, Atlantic Publishers.

191
 Title of the course : Cloud Computing
Subject Code : PECS-721F
Weekly load :3 LTP 300
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 To create a brief understanding of cloud computing and other related technologies
(Grid/cluster etc.).
CO2 To understand cloud service models, deployment models and service inception through
virtualization in cloud.
CO3 To understand various security issues in cloud as well as an overview of the basic
architectures of cloud computing.
CO4 To understand the basic architecture of cloud computing
CO5 To understand the advanced cloud architecture

CO/PO Mapping: (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation)

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PSO1 PSO2
CO1 1 2 2 3 3 2 2 0 2 0 1 3 3
CO2 2 2 3 2 3 0 2 0 0 1 0 2 3

CO3 3 2 2 1 3 0 0 0 0 3 0 2 3

CO4 3 2 2 3 3 1 2 0 3 0 0 3 3

CO5 3 3 3 3 3 2 1 1 2 2 0 2 1

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Understanding Background of cloud computing, enabling technologies and 08
Cloud technology innovations, introduction to cloud computing
Computing including benefits, challengers and risks. Reference
Architecture: cloud consumer, cloud service provider, cloud
broker, cloud Auditor, cloud carrier. Boundaries of cloud
computing.
2. Service Cloud Characteristics, Cloud service model, cloud 08
deployment deployment models. Virtualization concepts: types of
Models and virtualization, benefits of virtualization, introduction to
various virtualization operating systems.
Virtualization
3. Cloud Security Security concepts: Confidentiality, privacy, integrity, 08
authenticity, availability, access control, non-repudiation,

192
 Threat, Vulnerability, Risk, Security Controls, Virtualization
Attack: Guest hopping, attacks on the VM, VM migration
attack. Legal and compliance issues: responsibility,
ownership of data, right to penetration test, compliance for
cloud provider vs. compliance for the customer.
Unit-2 4. Cloud Fundamental Cloud Architectures: Architecture of 08
Computing Workload Distribution, Resource Pooling, Dynamic
Architecture Scalability, Capacity, Service Load Balancing.
5. Advance cloud Hypervisor Clustering, Load Balanced Virtual Server 08
computing Instances, Zero Downtime, Cloud Balancing, Resource
architecture Reservation, Dynamic Failure Detection and Recovery,
Storage Workload Management
6. Case study Public cloud environment: Understanding and exploring 08
Amazon web services, managing and creating EC2
instances.
Total=48

Recommended Books:

1. Thomas Erl, Zaigham Mahmood, Ricardo Puttini, “Cloud Computing: Concepts,

Technology and Architecture”, Prentice Hall.
2. John W. Rittinghouse, James F. Ransome, “Cloud Computing Implementation,
Management and Security”, CRC Press.
3. Alfredo Mendoza, “Utility Computing Technologies, Standards, and Strategies”,
Artech House INC.
4. Bunker, Darren Thomson, “Delivering Utility Computing”,John Wiley and Sons Ltd.
5. George Reese, “Cloud Application Architectures”, O’reilly Publications.
6. Ronald L. Krutz, Russell Dean Vines, “cloud Security: A Comprehensive Guide to
Secure Cloud Computing” Wiley

193
 Title of the course : Python Programming
Subject Code : PECS-722A
Weekly load : 3 Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand why Python is a useful scripting language for developers.
CO2 Learn how to design and program Python applications.
CO3 Learn how to use lists, tuples, and dictionaries in Python programs.
CO4 Learn how to design object‐oriented programs with Python classes.
CO5 Learn how to use exception handling in Python applications for error handling.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 2 3 3 3 1 0 0 1 0 2 3 1 3
CO2 1 2 3 3 3 1 0 0 1 0 3 3 2 2
CO3 0 1 3 2 3 0 0 0 0 0 0 2 3 2
CO4 0 1 3 3 3 0 0 0 0 0 0 2 3 2
CO5 0 1 3 2 3 0 0 0 0 0 0 2 3 2

Theory
Unit Main Topics Course outlines Lecture(s)
Unit 1. Fundamental Concept of an algorithm, program, programming languages, need 09
-1 concepts of of programming, scenario, development of code from an algorithm,
the concept, need and use of pseudo code, variables, datatypes,
programming operators, implicit/explicit type conversion, functions in programs.
2. Control Selection and iteration control statements: if, else, nested if else, for 09
statements while and nested loops; break, continue, pass
3. Testing and Unit testing (path coverage and boundary value analysis), 05
debugging introduction of debugging, introduction of Eclipse: basic, tip to
handle infinite loop
Unit 4. Collections Introduction to collections, list, array, tuple, string, set, dictionary, 09
-2 basic operations and built-in method/function of: list, array, tuple,
string, set, dictionary
5. Function Definition of function, arguments, argument behavior, types of 09
argument, variables and its scope, function calling, types of
function, recursive function, revisiting function
6. Exception Introduction and need of Exception handling in code 02
handling
7. Modules and Introduction to modules, package, libraries, introduction to math, 05
libraries random, combination, itertools, Numpy library
Total=48

194
Recommended Books:
1. Mark Lutz, Learning Python, O’Reilly.
2. David Beazley and Brian K. Jones, Python Cookbook, O’Reilly.
3. David Beazley, Python Essential Reference, Developer’s Library.
4. John V. Guttag, Introduction to Computation and Programming Using Python, The MIT
Press.

195
 Title of the course : Computer Vision
Subject code : PECS-722 B
Weekly load : 3 Hrs LTP 3-0-0
Credits :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Identify basic concepts, terminology, theories, models and methods in the field of computer
vision,
CO2 Describe known principles of human visual system
CO3 Understand and implement Image representation and modeling
CO4 Describe basic methods of computer vision related to multi-scale representation, edge detection
and detection of other primitives, stereo, motion and object recognition,
CO5 Design of face detection and recognition algorithms

CO/PO Mapping: (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos PSO1 PSO2
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 2 2 3 3 2 2 0 3 3 1 3 3 2

CO2 3 2 3 1 2 0 0 0 3 3 0 3 2 2

CO3 2 2 2 0 1 2 2 3 1 2 1 2 1 3

CO4 1 2 2 2 0 1 3 0 0 1 2 3 2 1

CO5 2 1 2 3 0 2 3 1 2 0 0 2 1 1

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Digital Image Overview and State-of-the-art, Fundamentals of Image 6
Formation and Formation, Transformation: Orthogonal, Euclidean, Affine,
low level Projective, etc; Fourier Transform, Convolution and Filtering,
processing Image Enhancement, Restoration Histogram Processing

2. Depth Perspective, Binocular Stereopsis: Camera and Epipolar 6

Estimation Geometry; Homography, Rectification, DLT, RANSAC, 3-D
and Multi reconstruction framework; Auto-calibration. apparel
Camera
Views
3. Feature Edges-Canny, LOG, DOG; Line Detectors (Hough 8
Extraction Transform), Corners-Harris and Hessian Affine, Orientation
Histogram, SIFT, SURF, HOG, GLOH, Scale-space Analysis-
image Pyramids and Gaussian Derivative filters, Gabor Filters
and DWT.

196
 4. Image Region Growing, Edge Based approaches to segmentation, 6
Segmentation Graph-Cut, Mean-Shift, MRFs, Texture Segmentation; Object
detection.
5. Pattern Clustering: K-Means, K-Medoids, Mixture of Gaussians, 8
Analysis Classification: Discriminant Function, Supervised, Un-
supervised, Semi-supervised; Classifiers: Bayes, KNN, ANN
models; Dimensionality Reduction: PCA, LDA, ICA; Non-
parametric methods
6. Motion Background Subtraction and Modeling, Optical Flow, KLT,
Analysis Spatio-Temporal Analysis, Dynamic Stereo; Motion 8
parameter estimation.
7. Shape from X Light at Surfaces; Phong Model; Reflectance Map; Albedo 6
estimation; Photometric Stereo; Use of Surface Smoothness
Constraint; Shape from Texture, color, motion and edges
Total=48

Recommended Books:

1. D. A. Forsyth, J. Ponce, Computer Vision: A Modern Approach, PHI Learning 2009.

2. Milan Soanka, Vaclav Hlavac and Roger Boyle, Digital Image Processing and Computer
Vision, Cengage Learning.
3. R.C. Gonzalez and R.E. Woods, Digital Image Processing, Pearson Education.
4. Computer Vision: A Modern Approach, D. A. Forsyth, J. Ponce, Pearson Education,
2003

197
 Title of the course : High Speed Communication Network
Subject Code : PECS-722C
Weekly load : 3 Hrs LTP 3-0-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Understand the latest high speed communication technologies.
CO2 Analyse the need of Fibre, ISDN and B-ISDN.
CO3 Analyse and Set up protocol designing issues for Communication networks.
CO4 Apply various network layer techniques for designing subnets and supernets and analyse packet
CO5 flow on basistheofrouting
Understand routingalgorithm
protocols.for high speed networks.

CO/PO Mapping : (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PS02
CO1 1 2 0 1 3 2 1 2 0 0 1 2 2 3
CO2 1 2 1 0 1 0 0 0 0 0 1 2 1 3
CO3 2 1 0 0 1 2 1 3 2 3 2 1 1 2
CO4 2 1 0 3 2 1 0 1 2 3 1 2 3 2
CO5 2 2 1 0 2 0 0 0 0 0 2 2 2 2

Theory

Unit Main Topics Course outlines Lecture(s)

Unit-1 1. Gigabit High Speed LAN 08
Ethernet Overview of fast Ethernet, Gigabit Ethernet – overview,
specifications, layered protocol architecture, network design
using Gigabit Ethernet, applications, 10GB Ethernet –
overview, layered protocol architecture, applications.

2. Wireless Existing and emerging standards, Wireless LAN(802.11), 08

Networks Broadband Wireless(802.16), Bluetooth(802.15) their
layered protocol architecture and security. Mobile Networks
– GSM, CDMA and GPRS

3. Fibre Channel Fibre channel physical characteristics – topologies & ports, 06

layered protocol architecture, class of service, technology
comparison, SAN overview and architecture.

198
 4. Frame Relay High Speed WAN 06
Protocol architecture, frame format, routing, congestion
control.

Unit-2 5. ISDN & B- Channels, interfaces, addressing, protocol architecture, 08

ISDN services and B-ISDN

6. ATM Virtual circuits, cell switching, reference model, traffic 06

management.

7. Routing OSPF, BGP, internet multicasting, mobile IP, Introduction to 06

Protocols
Total=48
Recommended Books:
1. William stalling, “High Speed Networks and Internets”, Pearson Education.
2. Tere Parnell, “Building high speed Networks”, TMH.

199
 Title of the course : Software Quality Assurance
Subject Code : PECS 722D
Weekly load : 3 Hrs LTP 300
Credit :3
Course Outcomes: At the end of the course, the student will be able to:

CO1 Comprehend software engineering knowledge and principles.

CO2 propose and defend innovative solutions to software quality assurance and measurement
problems in the context of various software development environments;
CO3 evaluate leading edge approaches in software development and attendant quality assurance
methodologies, presenting the research using Harvard referencing
CO4 Comprehend requirement analysis and specifications for quality control
CO5 Design framework for software engineering projects with good quality constraints

CO/PO Mapping: (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 0 0 0 1 2 2 0 3 3 1 2

CO2 3 3 3 2 2 0 2 1 0 0 2 2 1 2

CO3 2 1 0 1 2 3 2 1 0 2 3 1 2 1

CO4 1 0 3 1 1 0 0 0 0 0 1 2 1 1

CO5 2 0 1 0 0 0 0 0 0 0 3 1 2 3

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Introduction Introduction of Software Engineering - Evolution of 12
to software Software Engineering, Goals of software engineering,
engineering & Software Development vs. Software Engineering. Software
principles Process - Software Process, Models Waterfall, Spiral,
Prototyping, Software Requirements Analysis - Analysis
Principles, SRS, Components of SRS.

2. Introduction Introduction of Software Design - Design Objectives, 12

to software Principles & Concepts, Design Process, Design Strategies
design & and Methods, Architectural Design-Architectural Styles,
concepts Modular Design, Object oriented design, User-interface
design, Principles of structured Analysis and Design Tools
i.e. DFD, Decision Tables and Decision Trees etc for

200
 quality of Project Management, Software Project Planning
and its characteristics, Types of metrics, Effort Estimation-
FP, LOC, FP vs. LOC, Schedule & Cost Estimation
ModelsActivity Networks- PERT/CPM, COCOMO-I,
COCOMO-II Model.

Unit-2 3. Quality Software Metrics- Scope of software metrics, classifying 12

Assurance- software measures, Measurement basics – representational
Quality theory, scales, meaningfulness, What to measure – GOM
concepts technique, Control flow structure, product quality metrics –
MTTF, customer problems, customer satisfaction, function
point. Quality Assurance- Quality concepts – quality, quality
control, quality assurance, cost of quality Software quality
assurance – SQA activities, software reviews, inspections,
audits, Software reviews, inspections, audits,

4. Software Quality Assurance - Overview of Software Quality, Software 12

Quality Quality Attributes, Factors Affecting Software Quality,
Assurance & Building, Software Quality Assurance Plan, Quality
Reliability management Principles, Capability Maturity Model, Risk
Assessment. Software reliability Quality Attributes:
correctness, reliability, usability, integrity, portability,
maintainability, interoperability, Quality Standards- Basic
concept of – ISO 9000 & 9001 and case study.

Total=48
Recommended Books:

1. Kshirasagar Naik and PriyadarshiTripathy, ‘Software Testing and Quality Assurance: Theory
and Practice’, 1st Edn., Wiley, 2008.

2. Jeff Tian, ‘Software Quality Engineering: Testing, Quality Assurance, and Quantifiable,
Improvement’, 1st Edn., Wiley, 2005.

3. Roger S. Pressman,
SoftwareEngineering, A Practitioner’sApproach, McGrawHill International Edition.

4. Ian Sommerville, Software Engineering, Addison-Wesley Publishing Company

201
 Title of the course : Human Resource Management
Subject Code : PECS-722E
Weekly load : 3Hrs LTP 3-0-0
Credit :3
Course Outcomes: At the end of the course, the student will be able to:
CO1 Identify scope and importance of human resource management in industry.
CO2 Facilitate and support effective employee and labour relations in both non-union and union environments.
CO3 Define strategic HR planning and the HRM process to the organization’s strategic management and
decision-making process
CO4 Research and support the development and communication of the organization's total compensation plan.
CO5 List training and development processes as well as future trends for HRM globalization

CO/PO Mapping : (Strong(S)/Medium(M)/Weak(W) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
COS
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 3 3 0 3 0 0 2 3 3 3 2 1 2
CO2 2 3 3 0 3 1 1 2 1 2 3 2 3 2
CO3 3 0 0 2 3 3 0 2 2 1 2 1 2 1
CO4 3 1 1 2 3 3 3 1 1 0 2 0 2 3
CO5 2 3 3 2 3 1 0 2 3 3 3 2 1 2

Theory
Unit Main Topics Course outlines Hour(s)
1. Introduction Introduction to Human Resource Management and its 06
definition, functions of Human Resource Management &
its relation to other managerial functions. Nature, Scope
and Importance of Human Resource Management in
Industry, Role & position of Personnel function in the
Unit-1 organization.
2. Procurement and Need for Human Resource Planning; Process of Human 06
Placement Resource Planning; Methods of Recruitment;
Psychological tests and interviewing; Meaning and
Importance of Placement and Induction, Employment
Exchanges (Compulsory Notification of vacancies) Act
1959, The Contract Labour (Regulation & Abolition) Act
1970.
3. Training & Difference between training and Development; Principles 06
Development of Training; Employee Development; Promotion-Merit v/s
seniority Performance Appraisal, Career Development &
Planning.
4. Job analysis & Job Analysis: Job Description & Job Description, Job 06
Design Specification.

202
 5. Job Satisfaction Job satisfaction and its importance; Motivation, Factors 06
affecting motivation, introduction to Motivation Theory;
Workers ' Participation, Quality of work life.
6. The Compensation Basic concepts in wage administration, company’s wage 06
Function policy, Job Evaluation, Issues in wage administration,
Unit-2 Bonus & Incentives, Payment of Wages Act-1936,
Minimum Wages Act-1961
7. Integration Human Relations and Industrial Relations; Difference 06
between Human Relations and Industrial Relations, Factors
required for good Human Relation Policy in Industry;
Employee Employer relationship Causes and Effects of
Industrial disputes; Employees Grievances & their
Redressal.
8. Maintenance Fringe & retirement terminal benefits, administration of 06
welfare amenities, Meaning and Importance of Employee
Safety, Accidents-Causes & their Prevention, Future
challenges for Human Resource Management.
Total=48
Recommended Books:
1. T.N.Chhabra- Human Resource Management (Dhanpat Rai & Co.)
2. Lowin B. Flippo - Principles of personnel Management (McGraw-Hill)

203
 Title of the course : Embedded Systems
Subject Code : PECS-722F
Weekly load : 3 Hrs LTP 3-0-0
Credit :3

Course Outcomes: At the end of the course, the student will be able to:
CO1 Identify embedded hardware
CO2 Describe the differences between the general computing system and the embedded system,
also recognize the classification of embedded systems..
CO3 Understand microprocessor architecture, interrupts and interface
CO4 Understand software development and tools for embedded systems
CO5 Understand use of RTOS in designing of embedded systems

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 1 0 0 0 0 2 0 0 0 0 0 2 1 2
CO2 3 2 2 2 0 2 0 0 2 2 2 2 2 3
CO3 2 2 2 2 2 2 0 0 1 0 0 2 2 3
CO4 2 2 3 2 3 2 0 0 2 2 2 2 2 2
CO5 2 2 3 2 3 2 0 0 2 2 2 2 2 2

Theory
Unit Main Topics Course outlines Lecture(s)
Unit-1 1. Introduction Terminology, Gates, Timing Diagram, Memory, 06
Review of Microprocessor Buses, Direct Memory Access, Interrupts,
Embedded Built instructions on the Microprocessor.
Hardware
2. Interrupts Conventions used on Schematic, Interrupts, Microprocessor 05
Architecture, Interrupt Basic, Shared Data Problem, Interrupt
Latency.
3. PIC Micro Introduction, CPU Architecture, Registers, Instruction Sets, 08
controller Addressing Modes, Programs, Interfacing Methods, Parallel
I/O Interface, Parallel Port Interface,
4. Interfacing Memory Interfacing, High Speed I/O Interfacing, Interrupts – 08
Interrupt Service Routine – features of Interrupts – Interrupt
vector & Priority, Timing Generation & Measurements, Input
Capture, Output Compare, Frequency Measurement, Serial
I/O Device RS232, RS845, Analog Interfacing, Applications.
Unit-2 5. Software Embedded System Evolution Trends, Round – Robin, Robin 08
Development with Interrupts, Function Scheduling architecture, Algorithms,
& Tools Introduction to assembler, Compiler and Cross compilers and

204
 Integrated Development Environment IDE,
6. Concepts of Object Oriented Interfacing, Recursion, Debugging Strategies, 05
OOI and and Simulators.
Simulator
7. Real Time Task And Task States, Tasks and Data, Semaphores and 08
Operating shared data, operating system services, Message queues,
Systems Timer Function, Events, Memory Management, Interrupt
Routines in an RTOS Environment, Basic Design Using
RTOS.
Total=48

Recommended Books:
1. D.D. Gajski, F. Vahid, J. Gong, S. Narayan, Specification and Design of embedded
Systems, Prentice Hall.
2. Steve Heath, Newnes, Embedded Systems Design.

205
 Title of the course : Project Stage II
Subject code : PRCS-721
Weekly load : 12 Hrs LTP 0-0-12
Credits :6
Course Outcomes: At the end of the course, the student will be able to:
CO1 Demonstrate a sound technical knowledge of their selected project topic.
CO2 Undertake problem identification, formulation and solution.
CO3 Design engineering solutions to complex problems utilizing a system approach.
CO4 Communicate with engineers and the community at large in written and oral forms.
CO5 Demonstrate the knowledge, skills and attitudes of a professional engineer.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 2 2 2 2 0 0 2 2 2 2 2 2
CO2 3 3 2 2 2 2 0 0 2 2 2 2 2 2
CO3 3 2 2 2 2 2 0 0 1 2 2 3 2 2
CO4 2 2 3 2 2 0 0 0 2 2 3 2 3 2
CO5 3 2 2 3 2 0 0 0 2 0 2 2 3 3

Project stage II Evaluation: In this, the student must select an area from emerging technologies
and specify the objectives to be achieved. Evaluation criteria will be based on objectives stated
and achieved.

206
 Title of the course : Project Hon’s
Subject code : PHCS-721
Weekly load : 8 Hrs LTP 0-0-8
Credits :4
Course Outcomes: At the end of the course, the student will be able to:
CO1 Demonstrate a sound technical knowledge of their selected project topic.
CO2 Undertake problem identification, formulation and solution.
CO3 Design engineering solutions to complex problems utilizing a system approach.
CO4 Communicate with engineers and the community at large in written and oral forms.
CO5 Demonstrate the knowledge, skills and attitudes of a professional engineer.

CO/PO Mapping : (Strong(3)/Medium(2)/Weak(1) indicates strength of correlation):

Program Outcomes (PO's)/ Program Specific Outcomes (PSO's)
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 2 2 2 2 0 0 2 2 2 2 2 2
CO2 3 3 2 2 2 2 0 0 2 2 2 2 2 2
CO3 3 2 2 2 2 2 0 0 1 2 2 3 2 2
CO4 2 2 3 2 2 0 0 0 2 2 3 2 3 2
CO5 3 2 2 3 2 0 0 0 2 0 2 2 3 3

ProjectHon’s Evaluation: In this, the student must select an area from emerging technologies and
specify the objectives to be achieved. Evaluation criteria will be based on objectives stated and
achieved.

207