DEPARTMENT OF COMPUTER SCIENCE

CHOICE BASED CREDIT SYSTEM &

OUTCOME BASED EDUCATION SYLLABUS

BACHELOR OF COMPUTER SCIENCE (B. Sc Computer Science)

2019-2022

1
PROGRAMME OUTCOMES

After completion of the programme, the student will be able to

PO1: Provides a solid foundation in the discipline of Computer Science and enable
students to formulate computational solutions to real life problems.
PO2: To possess knowledge to identify, analyze, design for an optimized solution using
appropriate algorithms of varying complexity using cutting edge technologies.
PO3: To develop skills in software and hardware maintenance so as to enable the students
to establish a productive career in industry, research and academia.
PO4: Equip the students to meet the industrial needs by utilizing tools and technologies
with the skills to communicate effectively among peers.
PO5: Foundation graduate programme which induces continuous improvement of
knowledge and act as a platform for higher studies and engage in research.

PROGRAMME SPECIFIC OUTCOMES

The students at the time of graduation will

PO1: Graduates will apply domain knowledge and problem solving skills to solve real time
problems
PO2: Empowers graduates with good employability skills and ensures exceptional career
opportunities in IT / ITeS / ITis companies

2
 DEPARTMENT OF COMPUTER SCIENCE

CHOICE BASED CREDIT SYSTEM & OUTCOME BASE EDUCATION

SYLLABUS & SCHEME OF EXAMINATION
2019-2022
Examination
Subject Code

hours / week

examination
Duration of
Instruction
Semester

Marks

Tutorial
Contact

Credits
Hours

Hours
Part

Total
ESE
CA
Title of paper
TAM1901/
I I HIN1901 / Language I 6 86 4 3 40 60 100 3
FRE1901
ENG1701/ English Paper I/ Functional
I II
ENG17F1 English Paper I
6 86 4 3 40 60 100 3
I III PP18C01 Core 1 : Programming in C 6 86 4 3 40 60 100 4
Programming Lab 1
I III CS18CP1
C Programming Lab
4 60 - 3 40 60 50* 3
Allied A1
Paper I : Mathematics and
TH17A03/
I III
TH17A03A
Statistics-Level I 6 86 4 3 40 60 100 5
Paper II: Mathematics and
Statistics-Level II
NME18ES/ Introduction to
I IV NME19A1/ Entrepreneurship/ Advance 2 28 2 2 50 50 100
NME19B1 Tamil / Basic Tamil 2
TAM1902/
II I HIN1902 / Language II 6 86 4 3 40 60 100 3
FRE1902
ENG1702/ English Paper II/
II II
ENG17F2 Functional English Paper II
6 86 4 3 40 60 100 3
Core 2: Computer Organization
II III CS18C02
and Architecture
3 41 4 3 40 60 100 4
Core 3: Object Oriented
II Programming with C++
4 56 4 3 40 60 100 4
III PO18C03
Programming Lab 2
II III C ++ Programming and Bio 3 45 - 3 40 60 50* 2
CS19CP2
Informatics Lab.
Allied A2
Paper I : Discrete
II III TH17A06B/ Mathematics-Level I 6 86 4 3 40 60 100 5
TH17A06A Paper II: Discrete
Mathematics -Level II

3
 Open Course
II IV
(self-Study –Online )
- - - - - - - Grade
NME19A2/ ** Advanced Tamil /
NME19B2 Basic Tamil
- - - - - - - Grade

Effective English
II VI REG16EE 2 - - 2 50 50 100 2
Communication
Self-
II VI NM12GAW General Awareness Study - - Online Test 100 - - Grade
III III CS19C04 Core 4: Operating System 5 71 4 3 40 60 100 4
III III CS19C05 Core 5: Data Structures 5 71 4 3 40 60 100 4
Core 6:Relational Database
III III PRD1903 5 71 4 3 40 60 100 4
Management System
Programming Lab 3
III III CS16CP3 4 60 - 3 40 60 50* 2
RDBMS Lab

Allied A3 Paper I:
TH16A13B
Optimization Techniques-I
III III 6 86 4 3 40 60 100 5
Paper II:
TH16A13A
Optimization Techniques-II

Skill Based Subject Data

III PR19SB01 Analytics - Level I:
&
III R- Programming- 3 43 2 2 25 75 100 4
IV PD19SB01 OOSE-Level I:
Software Design Tools
Foundation Course
III IV NM14VHR Value Education and Human 2 26 4 - 100 - 100 2
Rights
III
& Job Oriented Course
IV JOB1826 - - - 3 - - - Grade
Amazon Web Services
IV
IV III CS19C07 Core 7:Data Mining 5 71 4 3 40 60 100 4
IV III CS19C08 Core 8: Computer Networks 5 71 4 3 40 60 100 4
IV III CS19C09 Core 9: Python Programming 5 71 4 3 40 60 100 4
Programming Lab 4
IV Python Programming and
III CS18CP4 4 60 - 3 40 60 50* 3
Bioinformatics Lab
Allied A4
BP19A05 Paper I: Business Accounts
BP19A06 Paper II : Principles of
6 86 4 3 40 60 100 5
Marketing
IV III PM19A01 Paper III: Management
Information Systems
Skill Based Subject
III Data Analytics: Practical I:
& PR19SBP1
R-Programming 3 45 - 2 40 60 100 2
III
IV OOSE: Practical I :
PD19SBP1 Software Design Tools
Foundation Course
2 26 4 - 100 - 100
2
IV IV NM10EVS Environmental Studies
NSS/NCC/YRC/Sports&
IV V
Games - - - - - - 100 1
IV COM15SER Community Oriented Service - Grade

4
 V III PJA1810 Core 10 : Java Programming 5 71 4 3 40 60 100 4
V III PCG1811 Core 11 : Computer Graphics 5 71 4 3 40 60 100 4
Core 12 : Software
V III CS18C12 5 71 4 3 40 60 100
Engineering 4
Elective 1:Parallel Computing
CS18E01
Elective 2 :Big Data Analytics
CS18E02 5
Elective 3:Artificial
V III CS18E03 71 4 3 40 60 100 5
Intelligence
Programming Lab 5 :
CS17CP5 Java Programming and 5
V III 75 - 3 40 60 50* 3
Bioinformatics Lab
V III NM13IS2 Information Security-Level II 2 26 4 - 100 - - Grade
Skill Based Subject
PV19SB02 Data Analytics-Level II :
Data Visualization tools 3
V III OOSE-Level II: 43 2 2 25 75 100 4
PT19SB02
Software Testing Tools
Advanced Level Course1
CS14AC1 Paper 1:
Wireless Communications - - - 3 25 75 100* 5*
V III Paper 2:
CS16AC2 Cloud Computing
V III Comprehensive Exam - - - 1 - - Grade
V III INST1 Internship Training - - - - - 100 2
V Personality Development - - - - - - Grade
VI III CS18C13 Core 13:.Net Programming 5 71 4 3 40 60 100 4

VI III Core 14 : Software Testing 5 71 4 3 40 60 100 4

CS18C14
VI III PWT1815 Core 15 : Web Technology 5 71 4 3 40 60 100 4
Programming Lab 6:
VI III CS17CP6 Web Technology and 5 75 - 3 40 60 50*
2
Bioinformatics Lab
VI III PROJ Project Viva – Voce 7 - - 3 20 80 100 5
Advanced Level Course 2
CS14AC3
VI III Paper 1: Image Processing - - - 3 25 75 100* 5*
CS11AC4
Paper 2: Mobile Computing
Skill Based Subject
V PV19SBP2 Data Analytics: Practical II:
& III Data Visualization Tools 3 45 - 2 40 60 100 2
VI OOSE: Practical II:
PT19SBP2 Software Testing Tools
TOTAL 3800 140

* 100 Marks Converted into 50 Marks

** Outside Regular Class Hours.
*The credits are applicable to candidates who take up the advanced level course exam.

5
QUESTION PAPER PATTERN CORE & ALLIED PAPERS

Continuous Internal Assessment: 50 Marks

Section Marks Total

A 5 X 2 Marks 10
B 4 X 5 Marks 20 50
C 2/3 X 10 Marks 20

End Semester Examination: 100 Marks

Section Word Limit Marks Total

A-11/13 X 2 Marks
One or two sentences 22
(Open Choice)
B – 5/7 X 6Marks 100
(Open Choice) 300 words 30
C – 4/6 X 12Marks
(Open Choice) 600 - 800 words 48

SKILL BASED SUBJECT

Continuous Internal Assessment: 25 Marks

Section Marks Total
A 4 / 6 X 4 Marks 16
B 1 / 2 X 9 Marks 9 25

End Semester Examination: 50 Marks

Section Marks Total

A 4 / 6 X 5 Marks 20
B 2 / 3 X 15 Marks 30 50

ADVANCED LEARNERS COURSE (ALC)

Continuous Internal Assessment: 25 Marks

Section Marks Total
A 4 / 6 X 4 Marks 16
25
B 1 / 2 X 9 Marks 9

End Semester Examination: 75 Marks

Section Marks Total

A 5 / 8 X 5 Marks 25 75
B 5/8 X 10 Marks 50

6
VALUE EDUCATION AND HUMAN RIGHTS / WOMEN STUDIES / AMBEDKAR
STUDIES / GANDHIAN STUDIES / ENTREPRENEURSHIP / ENVIRONMENTAL
STUDIES

Continuous Internal Assessment: 50 Marks

Section Marks Total

A 4 / 6 X 5 Marks 20
2 /3 X 15 Marks 50
B 30

Value Education and Human Rights & Environmental Studies two internal tests will
be conducted for 50 marks each and the total marks secured will be equated to a maximum of
75 marks and 25 marks is allotted for project / group discussion / presentation of a report.

INFORMATION SECURITY
Continuous Internal Assessment: 40 Marks

Section Marks Total

A 5 / 8 X 2 Marks 10 40
B 6 / 8 X 5 Marks 30

FIELD TRAINING
The students have the option to carry out their field training work at any organizations
such as Government / private organizations of different domains (Manufacturing, Textiles,
Retails, Insurance & Banking, etc.,) and R&D institutes. Students will start the training work
after getting approval from the respective faculty guide and HoD. The students will undergo
training for a period of two weeks (15days) at the end of semester IV during vacation. The
students must maintain a work diary and prepare report of the training undergone and submit
the report. The field training will be assessed based on the components attendance, work
diary, report and viva-voce with internal examiners at the beginning of the semester V.

Mode of Evaluation Marks Total

Attendance 10
Work Diary 15
100
Report 50
Viva-voce 25

7
PROJECT

Individual Project and Viva Voce

Each student will be allotted with a faculty for project guidance. The topic/area of the
project work and the organization will be finalized at the end of V semester and approved by
the respective guide and HoD. The work will be carried out in the computer science lab as
well as in the organization. Internal review will be conducted periodically to assess the
progress of the project work. After completion of the work, a detailed project report will be
prepared and submitted at the end of the semester VI. External examiner appointed by the
Controller of Examination) will conduct the viva voce examination along with respective
guide.

Area of Work

Mobile app development, website development, IoT, Dataset preparation, Biological

sequence analysis etc.,

Methodology

 Each project should contain the following details

 Brief introduction on the topic

 System Analysis

 System Design

 Testing and Implementation

 Conclusion

 Scope for Future Enhancement

 Bibliography

8
 The above contents should not exceed 50 pages
Internal Assessment: 20Marks

Review Mode of Evaluation Marks Total

Synopsis, Organization profile, System
I Specification, Existing system, Proposed 5
system
20
II DFD,ERD, Table Design 10
Input forms, Output forms and
III 5
Preparation of rough draft

External Assessment: 80Marks

Mode of Evaluation Marks Total
Project Report
Relevance of the topic 10 60
Technology 10
Designing and development 20
Report 20
Viva Voce
Presentation 10 20
Performance 10

WEIGHTAGE ASSIGNED TO VARIOUS COMPONENTS OFCONTINUOUS

INTERNAL ASSESSMENT

Theory

CIA CIA Model Assignment/ Seminar Quiz Class Library Max.

Attendance Marks
I II Exam Class Notes Participation Usage
Core /
5 5 6 4 5 4 5 3 3 40
Allied

SBS 5 5 15 - - - - - - 25

ALC 10 15 - - - - - - 25

Information
40 40 10 10 100
Security

9
 Practical

Regularity in
Model Lab
Record Attendance Maximum Marks
Exam Performance
Submission
Core / Allied /
SBS 12 20 5 3 40

RUBRICS

ASSIGNMENT/ SEMINAR

Maximum - 20 Marks (Converted to 4 marks)

Criteria 4 Marks 3 Marks 2 Marks 1 Mark

Focus Shows little
Purpose Clear Shows awareness awareness No awareness
Main idea
Clearly presents a supported
Main idea Vague sense No main idea
main idea. throughout
Organization: Good overall There is a sense of No sense of
Overall Well planned organization organization organization

Exceptionally well
Content Well presented Content is sound Not good
presented

Large amounts of Some use of

Little use of
Style: Details and specific examples examples and
and detailed specific examples
Examples detailed No use of examples
description and details
descriptions

CLASS PARTICIPATION

Maximum - 20 Marks (Converted to 5 marks)

Criteria 5 Marks 4 Marks 3 Marks 2 Marks 1 Mark

Student
Student
proactively
proactively
contributes to Student Student rarely
contributes to
class by contributes to contributes to Student never
class by
Level of offering ideas class and class by contributes to
offering ideas
Engagement and asks asks offering ideas class by
and asks
in Class questions questions and asking no offering ideas
questions
more than occasionally questions
once per
once per
class
class.

10
 Student Student does
listens when not listen
others talk, Student Student Student does when others
both in groups listens when listens when not listen talk, both in
Listening and in class. others talk, others talk in when others groups and in
Skills Student both in groups and in talk, both in class.
incorporates groups and in class groups and in Student often
or builds off class. occasionally class. interrupts
of the ideas of when others
others. speak.

Student
Student Student Student
Student often almost
almost never rarely occasionally
displays always
displays displays displays
Behavior disruptive displays
disruptive disruptive disruptive
behavior disruptive
behavior behavior behavior
during class behavior
during class during class during class
during class
Student is Student is
Student is Student is
almost always occasionally
usually rarely Student is
prepared for prepared for
prepared for prepared for almost never
Preparation class with class with
class with class with prepared for
required required
required class required class class.
class class
materials materials
materials materials

11
 MAPPING OF POs WITH COs

COURSE PROGRAMME OUTCOMES

PO1 PO2 PO3 PO4 PO5

COURSE 1 - PP18C01

CO1 S S M M S

CO2 S S M M M

CO3 S S M M M

CO4 S S M S S

CO5 S S M S M

COURSE2- CS18CP1

CO1 S M S M M

CO2 S S M M S

CO3 S M M S S

CO4 S S M M M

CO5 S S S M S

COURSE 3 - CS18C02

CO1 S S M S S

CO2 S S S S M

CO3 S M S S S

CO4 S M S S S

CO5 S S S S S

12
 COURSE 4 - PO18C03

CO1 S S M S S

CO2 M S S M S

CO3 S M S M S

CO4 S S M S S

CO5 M S S M M

COURSE 5 - CS19CP2

CO1 S S M M M

CO2 S M S M M

CO3 S M M S S

CO4 M S M S S

CO5 S S S S S

COURSE 6 - CS19C04

CO1 S M M M S

CO2 S S M M S

CO3 S S S S M

CO4 S S S S M

CO5 S S M S M

COURSE 7 - CS19C05

CO1 M S S S S

CO2 S S S M S

CO3 M S S M S

CO4 S M S M M

13
CO5 M M S S S

COURSE 8 - PRD1903

CO1 M S M S M

CO2 S M S S M

CO3 M S S M S

CO4 S M M S M

CO5 M S S M S

COURSE 9- CS16CP3

CO1 M M S S S

CO2 S M S M S

CO3 S M M S S

CO4 M M S S M

CO5 S M S S S

COURSE 10- PR19SB01

CO1 S M S M S

CO2 S S S M M

CO3 S S M S M

CO4 S S M S S

CO5 S S M S M

COURSE 11- PD19SB01

CO1 S M S M S

CO2 M S S S M

CO3 S M M S S

14
CO4 S S M M S

CO5 S S s S M

COURSE 12- CS19C07

CO1 S M S S M

CO2 S M S S M

CO3 M M S M M

CO4 S S M S S

CO5 S S S S S

COURSE 13- CS19C08

CO1 S M M M M

CO2 S S M M S

CO3 S S M M S

CO4 S S M M S

CO5 S S S S S

COURSE 14- CS19C09

CO1 S M M S S

CO2 S S S S M

CO3 S S S S S

CO4 S S S S S

CO5 S S S S S

COURSE 15- CS18CP4

CO1 S S S S S

CO2 S S S S M

15
CO3 S S M S S

CO4 S S M S S

CO5 S M S S S

COURSE 16 - PM19A01

CO1 M S S S M

CO2 M S S S S

CO3 S S S M S

CO4 M S M S S

CO5 S M S S S

COURSE 17- PR19SBP1

CO1 S M S M S

CO2 S S S M M

CO3 S S S S M

CO4 M S M S S

CO5 S S M S M

COURSE 18- PD19SBP1

CO1 S M S M S

CO2 M S S S M

CO3 S M M S S

CO4 S S M M S

CO5 S S S S M

COURSE19 - PJA1810

CO1 S M S S S

16
CO2 S S S M S

CO3 M M S M S

CO4 S S S M S

CO5 S S S S M

COURSE 20 - PCG1811

CO1 S S M S S

CO2 S S S S M

CO3 S M S S S

CO4 S M S S S

CO5 S S S S S

COURSE 21- CS18C12

CO1 S S S S S

CO2 S S M S S

CO3 S S S S S

CO4 S M S S S

CO5 S S S S S

COURSE 22- CS18E01

CO1 S M S S M

CO2 S M S S M

CO3 M M S M M

CO4 S S M S S

CO5 S S S S S

COURSE 23- CS18E02

CO1 S M S S S

17
CO2 S S S M S

CO3 M M S M M

CO4 S S S M M

CO5 S S S M M

COURSE 24- CS18E03

CO1 S S M S S

CO2 S S S S M

CO3 S M S S S

CO4 S M S S S

CO5 S S S S M

COURSE 25- CS17CP5

CO1 S M S S S

CO2 S S S M S

CO3 M M S M S

CO4 S S S M S

CO5 S S S S M

COURSE 26- PV19SB02

CO1 S M S M S

CO2 S S M S M

CO3 S S S S M

CO4 S M S S M

CO5 S M S M S

COURSE 27- PT19SB02

18
CO1 S M S M S

CO2 M S S S M

CO3 S M M S S

CO4 S S M M S

CO5 S S s S M

COURSE 28- CS18C13

CO1 M S M M M

CO2 S M S S S

CO3 S S S S M

CO4 S M S M S

CO5 M M M S S

COURSE 29 - CS18C14

CO1 S S S S S

CO2 M S S S S

CO3 S S S S S

CO4 S S M S S

CO5 M S S S S

COURSE 30- PWT1815

CO1 S S S M S

CO2 S S M S M

CO3 M S M M S

19
 CO4 S M S M S

CO5 M M S S M

COURSE 31- CS17CP6

CO1 M M S M M

CO2 M S M S S

CO3 S M S M S

CO4 S M S M M

CO5 S M M S S

COURSE 32- PV19SBP2

CO1 S M S M S

CO2 S S M S M

CO3 S S S S M

CO4 S M S S M

CO5 S M S M S

COURSE 33- PT19SBP2

CO1 S S S M S

CO2 M S S S M

CO3 S S M S S

CO4 S M S M S

CO5 S S M S M

H- High; M-Medium; L-Low

20
COURSE
COURSE NAME CATEGORY L T P CREDIT
NUMBER

PP18C01 PROGRAMMING IN C III 86 4 - 4

Preamble
This course introduces fundamental concepts such as arrays, structures. It covers
concepts such as arrays, pointers and file handling methods. It provides technical skills to
design and develop various applications.
Course Outcomes
On the successful completion of the course, students will be able to

CO CO Statement Knowledge
Number Level
Identify the logic behind the execution of various K1
CO1
applications
CO2 K2
Understand the concepts of C programming

CO3 K3
Analyze and discover bugs in the program
Develop an application using memory management
K3
CO4 functions.
CO5 K3
Apply the concepts to solve a real-time problem

Mapping with Programme outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S S M M S

CO2 S S M M M

CO3 S S M M M

CO4 S S M S S

CO5 S S M S M

S- Strong; M-Medium; L-Low

21
Programming in C - PP18C01 (86 Hrs)

Syllabus
Unit I 17 Hrs
Overview of C:– Introduction - character set - C tokens - keyword & identifiers –
constants – variables - data types – Declarations of variables – Arithmetic, Relational,
Logical, Assignment, conditional, Bit wise, special, increment and decrement operators -
Arithmetic expressions - Evaluation of expression - Operator precedence & associativity -
Mathematical functions - Reading & writing a character - Formatted input and output
Unit II 17 Hrs
Decision Statements: If, if else, switch, break, continue - the? Operator - The GOTO
statement. – Loop Control Statements: Introduction – for, nested for loops – while, do-while
statements – Arrays: One-dimensional - Two dimensional - Multidimensional arrays
Unit III 17 Hrs
Character string handling - Declaring and initializing string variables - Reading
strings from terminal - Writing strings to screen - String handling functions - User-defined
functions: Need for user defined functions – Types of functions - calling a function category
of functions - no arguments and no return values – Arguments but no return values-
Arguments with return values– Recursion - functions with arrays - functions with arrays -
The scope and lifetime of variables in functions
Unit IV 17 Hrs
Structure: Definition- Structure initialization - Comparison of structure variables -
Arrays of structures - Arrays within structures - Structures within structures – unions.
Pointers: understanding pointers - accessing the address of a variable - declaring and
initializing pointers - accessing a variable through its pointers - pointer expressions - pointers
and arrays - pointers and character strings - pointers and functions - pointers and structures
Unit V 18 Hrs
File Management in C: defining and opening a file - closing file - I/O operations on
files - error handling during I/O operations - Random access to files - command line
arguments. Dynamic memory allocation: Introduction- dynamic memory allocation –
MALLOC – CALLOC – REALLOC - The pre-processor

22
 Text Book

Year of
S. No Author Title of the Book Publisher
Publication
1 E. Balagurusamy Programming In ANSI C Tata McGraw Hill 7th Edition,2017

Reference Books
Year of
S. No Author Title of the Book Publisher
Publication

1 Byron Gottfried Programming with C Tata McGraw Hill, 3rd Edition, 2013

Computer Programming Prentice Hall of India st

2 V. Rajaraman 1 Edition,2004
in C Pvt Ltd,
Prentice Hall of India
3 Smarajit Ghosh Programming in C 1st Edition, 2004
Pvt Ltd,

4 Yashwvant Kanetkar Let us C BPB Publications 13th Edition, 2014

Create Space
An Easy Guide to
5 Martin J. Gentile Independent 2nd Edition, 2012
Programming in C
Publishing Platform,

Pedagogy
 Lectures, Group discussions, Demonstrations, Case studies

Course Designer
 Mrs. N. Deepa

23
 COURSE
COURSE NAME CATEGORY L T P CREDIT
NUMBER

CS18CP1 C PROGRAMMING LAB III - - 60 3

Preamble

This course introduces the concepts of C programming. It provides technical skill, basic
concepts like control statements, pointers, structures and file handling techniques.

Course Outcomes

On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level

CO1 Recall the mathematical functions while creating a program K1

CO2 Understand the fundamental programming concepts K2

Illustrate the programming technique to analyze software

CO3 K2
problems

CO4 Apply the concepts to find solution for the problems K3

CO5 Design and develop the simple application. K3

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S M S M M

CO2 S S M M S

CO3 S M M S S

CO4 S S M M M

CO5 S S S M S

S- Strong; M-Medium; L-Low

24
C Programming Lab – CS18CP1 (60 Hrs)

Syllabus

 Exercise using different data types.

 Exercise using different operators.

 Exercise to implement control structures.

 Exercise using arrays.

 Exercise to implement functions.

 Exercise to create user defined function.

 Exercise using pointers.

 Exercise to work with files.

Pedagogy

 Demonstration, Lecture

Course Designer
 Mrs. N. Deepa

25
COURSE
COURSE NAME CATEGORY L T P CREDIT
NUMBER
COMPUTER ORGANIZATION
CS18C02 III 41 4 - 4
AND ARCHITECTURE

Preamble

This course provides the principles and practices of digital electronics and computer
system and also covers the concepts of computer Arithmetic operations, cache mapping
techniques and I/O organization. It also provides the various data transfer techniques in digital
computer.

Course Outcomes

On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level
Define the functions to simplify the Boolean
CO1 K1
equations using logic gates.
Discuss the system architecture based on
CO2 K2
microprocessor.
Understand the functions of the registers and
CO3 K3
different types of micro operations.
Illustrate the classification of pipelining and vector
CO4 K3
processing.
Show the operation of ALU along with the algorithm
CO5 and implementation of integer and floating point
K3
arithmetic operators.

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S S M S S
CO2 S S S S M
CO3 S M S S S
CO4 S M S S S
CO5 S S S S S
S-Strong; M-Medium; L-Low

26
Computer Organization and Architecture - CS18C02 (41Hrs)
Syllabus
Unit I 9 Hrs
Data Representation: Data types-Number systems: Octal & Hexadecimal numbers,
Decimal Representation, Alphanumeric representation. Logic Circuits: Gates-AND,OR,
NOT, NAND, NOR Gates & Truth tables-Boolean Algebra
Unit II 8 Hrs
Flip flops: SR, JK, D, T. Karnaugh maps- Product of Sums method- Sum of product
method,- Don’t Care condition -Decoders. Multiplexer-DE multiplexer
Unit III 8 Hrs
Register Transfer and Micro Operations: Register transfer language - Register
Transfer-Bus and memory transfers - Arithmetic Micro operations-Logic micro operations -
Shift micro operations-Arithmetic logic shift unit-Instruction format: Three address
instruction-Two address instruction-One address instruction-Zero address instruction
Unit IV 8 Hrs
Instruction Format-Addressing modes-Computer Arithmetic: Addition and Subtraction –
Multiplication algorithm -Division algorithm - Floating point arithmetic operations
Unit V 8Hrs
Input /output organization: Input output interface- Asynchronous data transfer- DMA.
Memory organization: Cache memory-Virtual memory
Text Book

Year of
S. No Author Title of the Book Publisher
Publication

Computer System
1 M Morris Mano Pearson Education 3rd Edition 2007
Architecture

27
 Reference Books

Year of
S. No Author Title of the Book Publisher
Publication
Donald P. Leach,
Digital Principles and Tata McGraw-
Albert Paul 5thEdition2003
1 Applications Hill
Malvino
Computer Architecture-A 2nd Edition,
2 John .L. Hennessy Elsevier
Quantitive approach 2011

Computer Organization and

Technical
3 William Stallings Architecture: Designing for 2010.
Publications
Performance

Pedagogy
 Lectures, Group discussions, Demonstrations, Case studies

Course Designer
 Mrs. N. Deepa

28
 Course
Course Name Category L T P Credit
Number
OBJECT ORIENTED
PO18C03 III 56 4 - 4
PROGRAMMING WITH C++

Preamble
The course provides an introduction to object-oriented programming using C++
language. It provides the concepts such as data abstractions, classes, inheritance, method
overloading and overriding, generic programming and standard template library. It enables
the students to apply these features in program design and implementation.
Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level
Define structure and object oriented problem solving
CO1 K1
approaches
CO2 Infer classes and objects for a given problem K2
Describe the constructors, destructors and type conversions
CO3 K2
for the problems
Illustrate the code reusability and extensibility by means of
CO4 K3
Inheritance and Polymorphism
CO5 Apply the concepts in file operations K3

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S S M S S

CO2 M S S M S

CO3 S M S M S

CO4 S S M S S

CO5 M S S M M

S- Strong; M-Medium; L-Low

29
Object Oriented Programming with C++ - PO18C03 (56 Hrs)
Syllabus
Unit I 11 Hrs

Principles of Object Oriented Programming: Basic concepts of object oriented

programming – Benefits of OOPs – Applications of OOPs – Beginning with C++: What is
C++ – Applications of C++ – C++ statements – Structure of C++ program. Tokens,
Expressions and Control structures: Tokens – Keywords – Identifiers – Constants –
Expressions and their types – Basic and user defined data types – operators in C++ –
Operator overloading – Operator precedence – Control structures

Unit II 12 Hrs

Functions in C++: The Main Functions – Function Prototyping – Call By Reference –

Return By Reference – Inline Functions– Function Overloading – Friend & Virtual
Functions. Classes and Objects: Specifying A Class– Defining Member Function– Nesting of
Member Functions– Private Member Functions– Arrays Within A Class – Static data
members – Static member functions – Array of objects – Objects as function arguments –
Friendly functions – Pointers to members

Unit III 11 Hrs

Constructors and Destructors: Constructors – Parameterized constructors – Multiple

constructors in a class – Constructors with default arguments – Copy constructors – Dynamic
constructors – Destructors– Operator overloading– type conversions

Unit IV 11 Hrs

Inheritance: Defining derived classes – Single Inheritance – Multilevel Inheritance –

Multiple Inheritance – Hierarchical Inheritance – Hybrid Inheritance – Virtual Base Classes –
Abstract classes – Constructors in Derived Classes. Pointers, Virtual functions and
Polymorphism: Pointers – Pointers to Objects, this Pointer, Pointers to Derived classes

Unit V 11 Hrs

Managing Console I/O Operations: C++ streams – C++ stream classes – Unformatted
I/O operations – Formatted console I/O operations – Managing output with manipulators.
Working with files: classes for file stream operations – opening and closing a file – Detecting
End – of - File – sequential I/O operations – Error handling during file operations
organization: Cache memory-Virtual memory

30
Text Book

Year of
S. No Author Title of the Book Publisher
Publication
Object Oriented Tata McGraw Hill 6th Edition,
1 E. Balagurusamy
Programming with C++ Publications. 2013

Reference Books

Year of
S. No Author Title of the Book Publisher
Publication
The C++ Programming 4th Edition,
1 Bjarne Stroustrup Pearson Education.
Language 2014
Object Oriented 1st,Edition,
2 Rajesh K. Shukla Wilsey India Pvt.Ltd.,
Programming in C++ 2008
Object Oriented Galgotia Publications, 4th Edition,
3 Robert Lafore
Programming in C++ Pvt Ltd., 2001
Tony Gaddis, Starting Out with C++: Addison-Wesley 8th Edition,
4 Judy Walfers,
Early Objects Publication. 2013
Godfery Muganda

Pedagogy
 Lectures, Group Discussion, Demonstrations

Course Designer

 Dr. J. Viji Gripsy

31
 Course
Course Name Category L T P Credit
Number
C ++ PROGRAMMING AND
CS19CP2 BIO INFORMATICS LAB III - - 45 2

Preamble
This course focuses on object oriented concepts and to develop an application. It
implements the concepts such as inheritance, polymorphism, dynamic binding and generic
structures to build reusable code. It enables the students to write programs using C++ features
such as composition of objects, operator overloads, dynamic memory allocation, file I/O and
exception handling. In addition, it also covers the methods to process the biological database.
Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level
Define the object oriented concepts for building object based
CO1 K1
applications
Illustrate the different logic with suitable validation using
CO2 K2
control structures, classes and objects

CO3 Demonstrate the Constructor, Destructor and Inheritance K3

Implement method overloading and method overriding for

CO4 K3
different user specification

CO5 Apply programming skills to experiment Protein sequence K3

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S S M M M

CO2 S M S M M

CO3 S M M S S

CO4 M S M S S

CO5 S S S S S
S- Strong; M-Medium; L-Low

32
C ++ Programming and Bio Informatics Lab-CS19CP2 (45 Hrs)
Syllabus
 Exercises to implement various control structures.
 Exercises using Class and objects.
 Exercises using Constructors &Destructors.

 Exercises to implement Inheritance.

 Exercises using Operator Overloading. Exercises using Files.

 Explore the sitemap of NCBI and PUBMED and find the official gene symbol, alias
name, chromosome number and ID for a particular sequence.
 Retrieve the Genbank entry with an accession number AF375082 and save the
sequence in FASTA format.
 Retrieve Protein sequences from Protein Data Bank (PDB)and analyze the primary,
secondary and tertiary protein structure using tools
 Retrieve nucleotide sequences and perform local alignment and global alignment
using EMBOSS
Pedagogy
 Demonstrations, Lectures

Course Designer

 Dr. J. Viji Gripsy

33
Course
Number Course Name Category L T P Credit

CS19C04 OPERATING SYSTEM III 71 4 - 4

Preamble
This course provides the basic operating system structure, process management,
synchronization and CPU scheduling. The course is designed to cover deadlock, storage
management file system, interface, I/O systems, virtual machines and distributed systems.
Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level

CO1 Recognize the basic concepts of operating system K1

CO2 Understand the process and thread concepts K2
Distinguish the concepts of deadlocks and storage management
K3
CO3 in operating system concepts
Apply various file system implementation and optimization
CO4 K3
techniques using files
Illustrate the virtual machine and distributed system in various
CO5 K3
fields.

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S M M M S

CO2 S S M M S

CO3 S S S S M

CO4 S S S S M

CO5 S S M S M

S- Strong; M-Medium; L-Low.

34
Operating System -CS19C04 (71 Hrs)
Syllabus
Unit I 14 Hrs
Introduction: What Operating Systems Do - Operating-System Structure - Operating
System operations. Operating System Structures: Operating System Services - User and
Operating System Interface - System Calls - System Programs - Operating System Design
and Implementation - Operating System Debugging - Operating System Generation - Types
of System Calls.
Unit II 15 Hrs
Process Management: Process Concept - Process Scheduling - Operations on
Processes. Threads: Overview - Multicore Programming - Multithreading Models. Process
Synchronization: Synchronization Hardware - Mutex Locks - Semaphores. CPU Scheduling:
Basic Concepts - Scheduling Criteria - Scheduling Algorithms - Thread Scheduling.
Unit III 14 Hrs
Deadlock: System Model - Deadlock Characterization - Methods for Handling
Deadlocks - Deadlock Prevention- Deadlock Avoidance- Deadlock Detection- Recovery from
Deadlock. Storage Management: Overview of Mass Storage Structure – Disk Structure - Disk
Attachment - Disk Scheduling - Disk Management- Swap Space Management -RAID
Structure.
Unit IV 14 Hrs
File System Interface: File Concept- Access Methods -Directory and Disk Structure-
File- System Mounting - File Sharing – Protection. I/O Systems: Overview- I/O Hardware -
Application I/O Interface - Kernel I/O Subsystem.
Unit V 14 Hrs
Virtual Machines: Overview - Benefits and Features- Building Blocks -Types of
Virtual Machines and their implementations - Virtualization and Operating System
Components - Examples Distributed Systems: Advantages of Distributed Systems - Types of
Network based OperatingSystems.CaseStudies:XDS-940896-THE897-RC4000897-
CTSS898-MULTICS899IBMOS/360-TOPS-20-CP/M and MS/DOS901 Macintosh
Operating System and Windows Mach.

35
 Text Book

Year of
S. No Author Title of the Book Publisher
Publication
Abraham G
1 Operating System Wiley Publisher 10thEdition, 2017
Silberschatz

Reference Books

Year of
S. No Author Title of the Book Publisher
Publication

Andrew.S.
1 Modern operating System Pearson Education 2014
Tannenbaum
Abraham
Silberschatz, Peter Operating System Wiley Global
9th Edition, 2012
2 B.Galvin, Concepts Education
GregGane

Pedagogy
 Lectures, Demonstration, Case studies.

Course Designer
 Mrs. N. Deepa

36
Course
Course Name Category L T P Credit
Number
CS19C05 DATA STRUCTURES III 71 4 - 4

Preamble
This course covers the basic concepts, terminologies in data structure. It provides the
data representation, storage and retrieval also gives the sorting and searching techniques and
implementation of the algorithm.
Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level
Recognize the problems where stacks, queues and dequeue are used
CO1 K1
in data structures.
Explain and implement Insertion Sort, Selection sort, Radix sort,
CO2 K2
Merge sort, Quick sort, Binary Search and Linear Search.
Describe the abstract data type list as a linked list using node and
CO3 K2
reference pattern
CO4 Illustrate the performance of basic linear data structures. K3
CO5 Interpret the concept of files, queries and sequential organization. K3

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 M S S S S

CO2 S S S M S

CO3 M S S M S

CO4 S M S M M

CO5 M M S S S

S- Strong; M-Medium; L-Low.

37
Data Structures – CS19C05 (71 Hrs)
Syllabus
Unit I 14 Hrs
Introduction and Overview: Introduction - Basic Terminology; Elementary Data
Organization - Data structures - Data structure operations - Algorithms: Complexity, Time-
Space Trade-off. Preliminaries: Algorithmic Notation - Control Structures- Variables, Data
Types. Arrays, Records and Pointers: Introduction - Linear Arrays - Representation of Linear
Arrays in Memory - Traversing Linear array - Inserting and Deleting - Multidimensional
Array
Unit II 14 Hrs
Stack, Queues, Recursion: Introduction – Stacks - Array Representation of Stacks -
Linked Representation of Stacks - Arithmetic Expressions - Polish Notation - Recursion-
Towers of Hanoi - Implementation of Recursive Procedures by Stacks – Queues - Linked
Representation of Queues – Dequeue – Priority Queues
Unit III 15 Hrs
Linked Lists: Introduction - Linked Lists - Representation of Linked Lists in Memory-
Traversing a Linked List - Memory Allocation-Garbage Collection - Deletion from a Linked
List - Header Linked Lists
Unit IV 14 Hrs
Trees: Introduction - Binary Trees - Representing Binary Trees in Memory-traversing
binary trees-Graphs: Terminology and Representations –Sequential Representation of
Graphs- Adjacency Matrix, Path Matrix
Unit V 14 Hrs
Sorting and Searching: Introduction – Sorting - Insertion Sort - Selection Sort -
Merging - Merge Sort - Radix Sort -Bubble Sort-Quick Sort. Searching and Data
Modification – Hashing- Linear Search – Binary Search
Text Book

Year of
S. No Author Title of the Book Publisher
Publication
Tata Mc-Graw 5th Edition 2009,
1 Seymour Lipschutz Data Structures
Hill Company Reprinted2014

38
Reference Books

Year of
S. No Author Title of the Book Publisher
Publication
Ellis Horowitz Fundamentals of Galgotia Book 2003,
1
SartajSahni Data Structures Source Reprinted2014
Create Space
Harry Hariom Independent
2 Data Structures 2014
Choudhary Publishing
Platform
Data Structures
3 A. K.Sharma Pearson Education 2014
using C
Design and
Rajdew Tiwari and
4 Analysis of Pearson Education 2014
Nagesh Sharma
Algorithms

Pedagogy
 Lectures, Demonstration, Case studies
Course Designer
 Dr. R. Kavitha

39
Course
Course Name Category L T P Credit
Number
RELATIONAL DATABASE
PRD1903 III 71 4 - 4
MANAGEMENT SYSTEM
Preamble
This course covers the basic concepts of database systems, relational database,
queries, object modeling and database design. The course is designed to provide solutions
related to the strategies for storing objects, transaction management, and security.
Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level
Define the fundamental elements of database management
CO1 K1
system.
Understanding of normalization theory and extends such
CO2 K2
knowledge to the normalization of a database.
Explain the basic concepts of relational data model, ERD,
relational database design, and algebra and query a database K2
CO3
using SQL,DML / DDL commands.
Declare and enforce integrity constraints on a database using a
CO4 K3
state-of- the-art RDBMS.
Demonstrate programming PL/SQL including procedures,
CO5 K3
stored functions, cursors, packages.

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 M S M S M
CO2 S M S S M
CO3 M S S M S
CO4 S M M S M
CO5 M S S M S

S- Strong; M-Medium; L-Low

40
Relational Database Management System-PRD1903 (71Hrs)
Syllabus
Unit I 14 Hrs
Database Concepts-A Relational approach: Database -Relationships - DBMS -Relational data
model - Integrity rules - Theoretical relational languages. Database Design: Data modeling -
Dependency -Database design - Normal forms - Dependency diagrams - Denormalization
Unit II 14 Hrs
Structured Query Language (SQL): Introduction – DDL - Naming rules and conventions- D a
t a types-Constraints-Creating a table- Displaying t able information - Altering an existing
table – Dropping, renaming, and truncating table - Table types
Unit III 15 Hrs
Working with tables: DML - Adding a new Row/Record - Customized prompts - Updating
and deleting an existing rows/records - Retrieving data from table - Arithmetic operations -
Restricting data with WHERE clause -Sorting -Substitution variables - DEFINE command –
CASE Structure, .Functions and Grouping: Built-in functions - Grouping data. Joins and
Views: Join -join types-Views: Views - Creating a view - Removing a view - Altering a view
Unit IV 14 Hrs
PL/SQL: Fundamentals - Block structure - comments - Data types – Other data types -
Variable declaration - Assignment operation - Bind variables - Substitution variables -
Printing. Control Structures and Embedded SQL: Control structures - Nested blocks - SQL in
PL/SQL - Data manipulation - Transaction control statements
Unit V 14 Hrs
PL/SQL Cursors and Exceptions: Cursors - Implicit & explicit cursors and attributes - cursor
FOR loops - SELECT…FOR UPDATE - WHERE CURRENT OF Clause - cursor with
parameters - Cursor variables - Exceptions - Types of exceptions - Records - Tables -
Procedures - Functions-Triggers

Text Book

Year of
S. No Author Title of the Book Publisher
Publication
Database Systems Using
1 Nilesh Shah PHI 2nd Edition, 2012
Oracle

41
Reference Books

Year of
S. No Author Title of the Book Publisher
Publication
Database Management Prentice Hall of 2nd Edition,
1 Rajesh Narang
Systems India 2011
RakeshSaini,
M.M.S.Rauthan, Database Management Vayu Education
2 2010
Abhay Saxena, System of India
Bindu Sharma
3 SatishAsnani Oracle Database 11g PHI 2010

Note: Flipped mode learning topics are highlighted.

Course activity

Unit Topic Activity Web Resources

Group
Unit I Denormalization
Discussion
Dropping, renaming, and  https://www.w3schools.com/sql
Unit II Case Study  https://www.tutorialspoint.com/s
truncating table
Unit III Built-in functions Quiz ql
Data types – Other data  https://livesql.oracle.com
Unit IV
types - Variable
Seminar  https://www.w3schools.com/sql/
declaration trysql.asp? Filename=trysql_asc
- Assignment operation
Unit V Functions Case Study

Pedagogy
 Lectures, Demonstration, Case studies

Course Designer
 Dr. R. Kavitha

42
 Course
Number Course Name Category L T P Credit

CS16CP3 RDBMS LAB III - - 60 2

Preamble

The course objective of this lab is to provide a strong foundation in database concepts,
technology and practice SQL queries for application development.

Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
Number CO Statement Level

CO1 Describe the concepts of database technologies

K1
Discuss PL/SQL including stored procedures, stored
CO2 functions, cursors, packages K2

CO3 Apply constraints on a database using RDBMS

K2
Illustrate the need, role, importance and uses of databases in
CO4 K3
applications development

Demonstrate theconceptof Triggers and Subroutines K3

CO5

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 M M S S S

CO2 S M S M S

CO3 S M M S S

CO4 M M S S M

CO5 S M S S S

S- Strong; M-Medium; L-Low.

43
RDBMS LAB - CS16CP3 (60 Hrs)

Syllabus
 Exercise using Different operators.
 Exercise using Control Structures.
 Exercise to implement Built-in functions.
 Exercise to implement update and Alter table
 Exercise to implementing PL/SQL Block
 Exercise to implement splitting the table
 Exercise to implement joining the table
 Exercise using Functions
 Exercise using PL/SQL Cursors
 Exercise using Triggers
 Exercise using Packages.

Pedagogy
 Lecture, Demonstration

Course Designer
 Mrs. A.S. Kavitha

44
 JOB ORIENTED COURSE
Title : Amazon Web Services
Subject Code : JOB1826

Objective
This course focuses on basic concepts, key technologies, and strengths of Amazon
web services.

Unit I 12 Hrs
Amazon Web Services Overview-History and Evolution of AWS-Overview of AWS
products

Unit II 12 Hrs
Identity and access management-Overview-Policies-Users groups and roles-Best
Practices- Amazon Virtual Private Cloud-subnets-Networking-Security groups-Best practices

Unit III 12 Hrs

Elastic compute cloud-Overview-Machine Images-Launch and connect to an instance-
Create an AMI demo-EC2 instance-EBS-EC2 Pricing-Load balancing-Auto scaling-AWS
services- EC2 best practices.

Unit IV 12 Hrs
Amazon Simple Storage Server (S3)-Overview-Buckets-Version control and life
cycle.

Unit V 12 Hrs
Amazon Relational Databases - AMI databases - Amazon Dynamo DB - Amazon red
shift - Amazon elastic cache.

Text Book: Course materials will be provided

45
 Course
Course Name Category L T P Credit
Number
Skill Based Subject
PR19SB01 III 43 2 - 4
Data Analytics-Level I: R Programming

Preamble
This course covers the basics of R programming working environment. It also
includes concepts involved in importing data, manipulating data for specific needs, running
summary statistics and data visualizations through graphs, charts and plots.

Course Outcomes

On the successful completion of the course, students will be able to

CO
CO Statement Knowledge Level
Number
Knowledge on R-Programming environment and
CO1 K1
libraries
Understand the basics in R programming in terms of
CO2 K2
constructs, control statements and built-in functions
Learn to apply R programming for matrix and vector
CO3 K2
processing

CO4 Reading data from files and analyzing data using R K3

CO5 Enables to visualize data using graphs and chart K3

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S M S M S

CO2 S S S M M

CO3 S S M S M

CO4 S S M S S

CO5 S S M S M
S- Strong; M-Medium; L-Low.

46
Data Analytics-Level I: R Programming – PR19SB01 (43 Hrs)
Syllabus
Unit I 9 Hrs
Overview of the R Language: Defining the R project, Obtaining R, Generating R
codes, Scripts, Comments, Text editors for R, Graphical User Interfaces (GUIs) for R,
Packages.
Unit II 9 Hrs
R Objects And Data Structures: Variable classes, Vectors and matrices, Data frames
and lists, Array and Factors.
Unit III 9 Hrs
Manipulating Objects in R: Mathematical operations, Decision making, loops,
functions and Strings.
Unit IV 8 Hrs
Exploratory Data Analysis: Reading, creating and storing R -CSV file, Excel file,
Binary file, XML File -R - Mean, Median, Mode- Regression.
Unit V 8Hrs
Graphical Representation: R-PIE chart – Bar chart – Box plots-Histograms – line
graphs - Scatter plots.

Text Book: Course materials will be provided

Reference Books
Year of
S. No Author Title of the Book Publisher
Publication
1 Jared Lander R for everyone Pearson Education 2015
The Art of R
2 Norman Matl off No Starch Press 2011
Programming

Note
*During Semester III, Unit - I and Unit - II till Vectors and Matrices.
**During Semester IV in Unit – II from Data Frames, Unit - III, IV and V.

Pedagogy
 Lecture, Demonstration

Course Designer
 Mrs. N. Deepa

47
Course
Course Name Category L T P Credit
Number
Skill Based Subject
PD19SB01 III 43 2 - 4
OOSE-Level I: Software Design Tools

Preamble
This course facilitates to learn various concepts, tools and techniques that are used to
design and implement software systems. This course gives a detailed description for
developing software by identifying and implementing a set of objects and their interactions to
meet the desired objectives.
Course Outcomes

On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level
Knowledge on basic Software engineering methods practices
CO1 KI
and principles
Familiar with main components of different diagrams, and the
CO2 K1
purpose of different modeling diagrams
Understand the basic concepts of software development life
CO3 K2
cycle and modeling techniques
Demonstrate data models, object models, context models and
CO4 K3
architectural models

CO5 Distinguish between component and deployment diagrams K2

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S M S M S

CO2 M S S S M

CO3 S M M S S

CO4 S S M M S

CO5 S S s S M
S- Strong; M-Medium; L-Low.

48
OOSE-Level I: Software Design Tools- PD19SB01 (43 Hrs)
Syllabus
Unit I 9 Hrs
Introduction to UML: Overview of the UML- Importance of Modeling- Principles of
Modeling- Object Oriented Modeling- Conceptual Model of the UML- Architecture-
Software Development Life Cycle.
Unit II 9 Hrs
Structural Modeling Basic Structural Modeling: Classes- Relationships- Common
Mechanisms- and diagrams. Advanced Structural Modeling: Advanced classes- Advanced
relationships- Interfaces- Types and Roles- Packages.
Unit III 9 Hrs
Class & Object Diagrams: Terms and Concepts- Construction of a Class diagram-
Common Modeling Techniques for Class & Object Diagrams-Interactions- Interaction
diagrams.
Unit IV 8 Hrs
Behavioral Modeling: Use cases- Use case Diagrams- Activity Diagrams. Advanced
Behavioral Modeling- State Machines- Processes and Threads- Time and Space- State Chart
Diagrams.
Unit V 8 Hrs
Architectural Modeling: Components- Modeling Techniques – Modeling a Physical
Database- Model an Adaptable System- Deployment - Component diagrams and Deployment
diagrams.

Text Book: Course materials will be provided

Reference Books

Year of
S. No Author Title of the Book Publisher
Publication
Martina Seidl, Marion UML @ Classroom: An
1 Scholz, Christian Introduction to Object- Springer 2015
Huemer, GertiKappel Oriented Modeling
Martina Seidl, Marion
An Introduction to Object-
2 Scholz, Christian Easy Reader 2011
Oriented Modeling
Huemer, GertiKappel

49
 Object-Oriented Analysis and
Laxmi
3 Gandharba Swain Design through Unified 2010
Publications
Modeling Language

Note
*During Semester III, Unit I, Unit II, till Advanced Classes
** During Semester IV from Advanced Relationships in Unit II, Unit III, Unit IV &
Unit V

Pedagogy
 Lecture, Demonstration

Course Designer
 Dr. S. Karpagavalli

50
 Course
Course Name Category L T P Credit
Number
CS19C07 DATA MINING III 71 4 - 4
Preamble
This course covers the basic concepts of data mining principles and methods. It
provides insight on classification, and clustering techniques and focuses on applications like
web mining, text mining and biological data mining.
Course Outcomes
On the successful completion of the course, students will be able to
CO Knowledge
CO Statement
Number Level
CO1 Recognize the basic concepts of data mining K1
Understand the techniques of data classification using various
CO2 K2
algorithms
Describe the concepts of classifier and prediction for simple data
CO3 K2
classification task and mining strategies in web
CO4 Apply various clustering methods for analysis K3

CO5 Illustrate the role of data mining techniques in various fields K3

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S M S S M
CO2 S M S S M
CO3 M M S M M
CO4 S S M S S
CO5 S S S S S

S- Strong; M-Medium; L-Low

DataMining–CS19C07 (71 Hrs)

Syllabus
Unit I 14 Hrs
Introduction: Data Mining – KDD vs Data mining-DBMS vs Data mining-Other
areas-Data mining techniques-Issues and challenges-Application areas.

51
 Unit II 15 Hrs
Association Rule: Introduction-Methods in association rule-Apriori algorithm.
Clustering: Introduction- Clustering paradigms-Partition algorithm-K-medoid algorithms-
CLARA- CLARANS - Hierarchical clustering-DBSCAN-BRICH-CURE.
Unit III 14 Hrs
Decision Tree: Introduction-Tree construction principles-Best split-splitting indices-
splitting criteria- Tree construction algorithms: CART-ID3-C4.5-CHAID.
Unit IV 14 Hrs
Other Techniques: Introduction-Neural Networks-Learning in NN-Unsupervised
Learning-Genetic algorithm-Support Vector Machine
Unit V 14 Hrs
Data Mining for Bioinformatics: Introduction-Bio medical data analysis-DNA data
analysis- Protein data analysis. Web Mining: Introduction-Web mining-content mining-
structure mining-usage mining-Text mining- unstructured text-Episode rule discovery for
texts- hierarchy of categories-Text clustering.
Text Book
Year of
S. No Author Title of the Book Publisher
Publication
University
1 Arun K Pujari Data Mining Techniques 3rd Edition 2013
Press

Reference Books
Year of
S. No Author Title of the Book Publisher
Publication

Bio Informatics
1 Yi Ping Phoebe Chen. Springer 2ndreprint, 2014
Technologies
Pang-NingTan, Michael
Introduction to Data Pearson
2 Steinbach and 2016
Mining Education
VipinKumar.
Principles of Data
3 Max Barmer. Mining Springer 3rdEdition,2016

Pedagogy
 Lectures, Demonstration, Case studies
Course Designer

 Mrs. A.S. Kavitha

52
 Course
Course Name Category L T P Credit
Number
CS19C08 COMPUTER NETWORKS III 71 4 - 4

Preamble
The course is designed to provide in depth knowledge of the various network layers,
network security and client server computing.

Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level
Provide an overview of the concepts and fundamentals of
CO1 K1
data communication and computer networks
Understand the terminology and concepts of the OSI
CO2 K2
reference model and the TCP‐IP reference model
Describe the significance of protocols used in data
CO3 K3
communications and networking
Illustrate the importance of network security and application
CO4 K3
of cryptographic methods in establishing security
Interpret the data flow in each layer and services of each
CO5 K3
layer

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S M M M M

CO2 S S M M S

CO3 S S M M S

CO4 S S M M S

CO5 S S S S S
S- Strong; M-Medium; L-Low

53
Computer Networks–CS19C08 (71 Hrs)
Syllabus
Unit I 14 Hrs
Data Communications: Components- data representation- Dataflow Networks:
Distributed processing-network criteria -physical structures -network models-categories of
networks- Interconnection of Networks: Internetwork- Protocols and Standards: protocols-
standards- standards organizations-internet standards the OSI model- layers in the OSI
model-TCP/IP protocol suite.
Unit II 14 Hrs
Guided Media: Twisted-pair cable-coaxial cable-fiber-optic cable- unguided media: -
wireless: radio waves-microwaves-infrared. Telephone Network: Major components - Latas –
signaling services provided by telephone networks dial-up modems: Modem standards digital
subscriber line- cable TV networks. Wireless LANS: Bluetooth- connecting devices.
Unit III 15 Hrs
Data Link Layer: Introduction- block coding-framing- flow and error control-
protocols- noiseless channels- noisy channels. Network Layer: IPV4 addresses- IPV6
addresses- delivery- forwarding- unicast routing protocols- multicast routing protocols.
Unit IV 14 Hrs
Transport layer: Process-to-Process delivery- user datagram protocol- TCP-
congestion control and quality a TCP connection- congestion control- two examples- quality
of service
Unit V 14 Hrs
Application Layer: Name space- domain name space- distribution of name space-
DNS in the internet- resolution- remote logging- telnet- electronic mail- file transfer-
cryptography: Introduction- symmetric-key cryptography- asymmetric-key cryptography.

Text Book

Year of
S. No Author Title of the Book Publisher
Publication
Behrouz A Data communications and 5th Edition,
1 Tata McGraw Hill
Forouzan networking 2012

54
Reference Books

Year of
S. No Author Title of the Book Publisher
Publication
Robert Orfali, Dan Client/Server Survival
1 John Wiley & sons 3rdEdition, 2008
Harkey, Jerry Edwards Guide
Larry L Peterson, Bruce Computer Networks - 5th Edition,
2 Elsevier Press
S Davie A systems approach 2012
5th Edition,
3 Andrew S Tanenbaum Computer Networks Pearson education
2011
Prentice Hall of
Data and Computer 8th Edition,
William Stallings India Private
4 Communications 2011
Limited, New Delhi

Pedagogy
 Lecture, Demonstration, Case Study

Course Designer
Dr. S. Karpagavalli

55
 Course
Course Name Category L T P Credit
Number

CS19C09 PYTHON PROGRAMMING III 71 4 - 4

Preamble
This course provides basic idea on functions and concepts of Python programming.
This course enables the students to understand the Python programming techniques.

Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level

Describe the basic built-in functions and syntax of K1

CO1 Python programming.
CO2 Explain the mapping and file concept. K2

CO3 Explain the object oriented programming concept. K2

Illustrate the concepts of decision making and construct K3
CO4
statements.
CO5 Illustrate the usage of database and regular expression K3

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S M M S S

CO2 S S S S M

CO3 S S S S S

CO4 S S S S S

CO5 S S S S S

S- Strong; M-Medium; L-Low

56
Python Programming - CS19C09 (71Hrs)
Syllabus
Unit I 15 Hrs
Python – origins – features – variable and assignment - Python basics – statement
and syntax Identifiers – Basic style guidelines – Python objects – Standard types and other
built-in types Internal types – Standard type operators – Standard type built-in functions.
Unit II 14 Hrs
Numbers – Introduction to Numbers – Integers – Double precision floating point
numbers Complex numbers – Operators – Numeric type functions – Sequences: Strings, Lists
and Tuples – Sequences – Strings and strings operators – String built-in methods – Lists–List
type Built in Methods – Tuples.
Unit III 14 Hrs
Mapping type: Dictionaries – Mapping type operators – Mapping type Built-in and
Factory Functions - Mapping type built in methods – Conditionals and loops – if statement –
else Statement – else-if statement – conditional expression – while statement – for statement
– break statement – continue statement – pass statement – Iterators and the iter( ) function -
Files and Input/ Output – File objects – File built-in functions – File built-in methods – File
built-in attributes – Standard files – command line arguments.
Unit IV 14 Hrs
Functions and Functional Programming – Functions – calling functions – creating
functions passing functions – Built-in Functions: apply( ), filter( ), map( ) and reduce( ) -
Modules – Modules and Files – Modules built-in functions - classes – class attributes –
Instances. Database Programming – Introduction - Basic Database Operations and SQL -
Example of using Database Adapters, MySQL.
Unit V 14 Hrs
Bioinformatics Programming - Pattern Matching: fundamental syntax – fixed length
matching – variable length matching – the action of the re modules – functions – flags –
methods – match object fields – match object methods - Extracting Descriptions from
Sequence Files - Extracting Entries From Sequence Files

57
Text Books

Year of
S. No Author Title of Book Publisher
Publication
Core Python Pearson Education
1 Wesley J. Chun 2012
Programming Publication
Bioinformatics
2 Mitchell L Model Programming O ‘ Reilly Media 2009
using Python

Reference Books

Year of
S. No Author Title of the Book Publisher
Publication
Core Python Application Pearson Education
1 Wesley J. Chun 2015
Programming Publication
2 Eric Matthes Python crash course William Pollock 2016
3 Zed Shaw Learn Python the Hard Way Addition Wesley 2017
4 Mark Lutz Python Pocket Reference O’Reilly Media 2014

Pedagogy
 Lectures, Group Discussions, Demonstrations, Case studies

Course Designers
 Dr. R. Vishnupriya

58
 Course
Course Name Category L T P Credit
Number
PYTHON PROGRAMMING
CS18CP4 III - - 60 3
AND BIO INFORMATICS LAB

Preamble

This course includes a practice in the use of basic techniques of Python programming
and to implement in real time environment. It enriches the knowledge in programming
techniques using pattern matching concepts. It enables to understand object oriented
programming concepts.

Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level
Define the basic syntax and statements of Python
CO1 K1
programming.
Discuss the various decision making and construct
CO2 K2
statement of Python programming.

Apply object oriented programming concept in real

CO3 K3
time problems.

Illustrate pattern matching and extra action using

CO4 K3
regular expression.

CO5 Demonstrate mapping using file concept. K3

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S S S S S

CO2 S S S S M

CO3 S S M S S

CO4 S S M S S

CO5 S M S S S
S- Strong; M-Medium; L-Low

59
Python Programming and Bio Informatics Lab–CS18CP4 (60 Hrs)

Syllabus
 Exercises using conditionals and loops.
 Exercises for implementing functions.
 Exercises using list and their built-in functions.
 Exercises by implementing tuples.
 Exercises using apply ( ), filter ( ), map ( ) and reduce ( ) functions.

 Exercises by implementing Modules

 Exercises by implementing classes and instances
 Exercises by illustrating regular expression
 Exercises for implementing files concept.
 Exercises using strings and their built-in functions.
 Retrieve Protein sequences from Protein Data Bank (PDB)and analyze the primary,
secondary and tertiary protein structure using tools
 Retrieve nucleotide sequences and perform local alignment and global alignment using
EMBOSS
 Retrieve nucleotide sequences and perform pair wise and multiple sequence alignment
using BLAST tool and analyze the output.
 Retrieve nucleotide sequences and perform multiple sequence alignment using
CLUSTALW tool and generate phylogenetic tree.
Pedagogy

 System, White board, Demonstration through PPT

Course Designers
 Dr. R. Vishnupriya

60
 Course
Number Course Name Category L T P Credit

PM19A01 MANAGEMENT INFORMATION SYSTEMS III 86 4 - 5

Preamble

This course covers impacts and uses of information systems and business tools for
web enabled environment. It also covers the decision making concept, enterprise
management system for data processing.

Course outcomes

On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level

Tell about the basic concepts and Roles of Management

CO1 K1
Information system.

Describe the development of Business strategies, E-

CO2 K2
Business Models

Discussing the decision making concepts and knowledge

CO3 K2
management in MIS.

Examine the applications in Manufacturing Sector and

CO4 K3
Service sector in Industry
Illustrate the Enterprise Management System and
CO5 K3
Information Systems processing.

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 M S S S M
CO2 M S S S S
CO3 S S S M S
CO4 M S M S S
CO5 S M S S S
S- Strong; M-Medium; L-Low

61
Management Information Systems -PM19A01 (86 Hrs)
Syllabus
Unit I 18 Hrs
Introduction To MIS: MIS concept – Definition – Role of MIS – Impact of MIS –
MIS and the User – Management as a Control system – MIS: a support to Management –
Management Effectiveness and MIS – Organization as a system – Organizational Behaviours.
Process Management: Planning – Organizing – Staffing – Coordinating – Directing and –
Controlling.
Unit II 17 Hrs
Strategic Management Of Business Performance: Essentiality of Strategic Planning
Tools of Planning – Strategic Management of Business Performance – What is Strategy? –
Class and Types of Strategies. Electronic Business Technology: Introduction to E- Business –
Models of E-Business-Electronic Payment System Security in E-Business– MIS and E-
Business. A tool for business management: Internet and Web Process Management –
strategic Management under Web – Web Enabled Business Management - Application
system Architecture in Web – MIS in Web Environment.
Unit III 17 Hrs
Decision Making: Decision-making concepts - Decision-making Process–
Behavioural Concepts in Decision-making – Organizational Decision-making – MIS and
Decision- making – Decision Methods Tools and Procedures. Information and Knowledge:
Information Concepts – Information: a quality product – Classification of Information –
Methods of data and Information Collection – Value of Information – General Model of a
Human as an Information Processor. Choice of Information Technology: Nature of IT
decision – Strategic Decision – Configuration Design –Evaluation.
Unit IV 17Hrs
Applications in Manufacturing Sector: Personnel, financial, production, raw material
and Marketing Managements. Applications in Service Sector: Introduction to Service Sector
– Creating a Distinctive services MIS application in service industry– MIS: Service Industry.
Unit V 17Hrs
Management of Global Enterprise: Enterprise Management Systems – ERP system –
ERP Model and Modules – Benefits of ERP – ERP Product Evolution - ERP Implementation
– EMS and MIS. Technology of Information Systems: Introduction – Data Processing –
Transaction Processing – Application Processing – Information System processing – Human
Factors and User Interface - Real Time Systems and Good Design.

62
Text Book

Year of
S. No Author Title of the Book Publisher
Publication
Waman S Management Information Tata McGraw Hill th
1 5 Edition,2013
Jawadekar Systems Text and cases Publications

Reference Books

Year of
S. No Author Title of the Book Publisher
Publication
Management
James A O’Brien Tata McGraw
1 Information
&George M. Marakas Hill Publications 7thEdition, 2007
Systems
Management
2
Kenneth C Laudon& Information PHI 10th
Jane P Laudon Systems managing Publications Edition,2011
the digital firm
Management
Mahadeo Jaiswal & Oxford
3 Information 2004
Monika Mital Publications
Systems

Pedagogy
 Lecture, Case study
Course Designer
 Dr. C. Arunpriya

63
 Course
Course Name Category L T P Credit
Number
Skill Based Subject
PR19SBP1 III - - 45 2
Data Analytics - Practical I: R-Programming

Preamble
This course is used to understand the concepts used to perform vector operations and
matrix operations. It familiarizes the students with various statistics operations mean, median
etc., are performed. It enables the student to explore data from a variety of sources by
building regression model and to generate charts, graphs, and other data representations.

Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level
Understand the fundamental syntax of R through demonstrations,
CO1 K2
and writing R code
Apply concepts such as data types, iteration, control structures,
CO2 K2
functions, and Boolean operators using R
CO3 Able to import a variety of data formats into R using R Studio K3

CO4 Explore data-sets to perform appropriate statistical tests using R K3

CO5 Acquire skills to generate charts and graphs visualization using R K3

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S M S M S

CO2 S S S M M

CO3 S S S S M

CO4 M S M S S

CO5 S S M S M

S- Strong; M-Medium; L-Low.

64
Data Analytics - Practical I: R Programming – PR19SBP1 (45 Hrs)

List of Programs

 R Program for Vector operations

 Create a R-list
 Implement matrices addition, subtraction and Multiplication
 Create a Data frame
 Create a factor object

 Import data, copy data from CSV file to R

 Create a R program for Mean median and mode
 Draw Bar charts and Pie charts in R
 Make visual representations of data for plotting functions in R
 Create a R program for Regression Model

Note
*During Semester III - Exercise 1 to Exercise 6
**During Semester IV- Exercise 7 to Exercise 10

Pedagogy
 Demonstration, System

Course Designer
 Mrs. V. Deepa

65
 Course
Number Course Name Category L T P Credit
Skill Based Subject
PD19SBP1 OOSE - Practical I: Software Design Tools III - - 45 2

Preamble

The objective of this course is to enable the student to practice the object-oriented
analysis and design through UML diagrams for real time software applications
Course Outcome

On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level

CO1 Design ERD and DFD for real time problem K2

CO2 Draw use-case and activity diagram for the given application K2

CO3 Construct state chart and sequence diagram for use-cases K3

CO4 Build collaboration and class diagram for modules K3

Gain knowledge to build UML diagrams for real world
CO5 problems K3

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S M S M S

CO2 M S S S M

CO3 S M M S S

CO4 S S M M S

CO5 S S S S M

S- Strong; M-Medium; L-Low.

66
OOSE - Practical I: Software Design Tools - PD19SBP1 (45 Hrs)

List of Programs

To apply and develop the UML diagrams for applications.

Choose any one of the projects given below and do the exercises program for the project.
[Student Marks Management System, Library Management System, Employee Management
System, Hostel Management System].

 Write the complete problem statement

 Write the software requirement specification document

 Draw the entity relationship diagram

 Draw the data flow diagrams at level 0 andlevel1

 Draw use case diagram

 Draw activity diagram of all use cases

 Draw state chart diagram of all use cases

 Draw sequence diagram of all use cases

 Draw collaboration diagram of all use cases

 Assign objects in sequence diagram to classes and make class diagram

Note
* During Semester III -Exercise 1 to Exercise 6
** During Semester IV - Exercise 7 to Exercise 10

Pedagogy
 Demonstration, System

Course Designer
 Dr. S. Karpagavalli

67
 Course
Number Course Name Category L T P Credit

PJA1810 Java Programming III 71 4 - 4

Preamble
The course is an expository of the object-oriented programming methodology with
emphasis on software design and code reuse as its core objectives. Language elements
include loops, arrays, input/output structures, events, exceptions, and threads. It aims to
develop the student’s logical, critical thinking and problem solving skills on programming
basics
Course Outcomes
On the successful completion of the course, students will be able to

CO Knowled
CO Statement
Number ge Level
Define the basic Java language syntax and semantics to write
CO1 Java programs and use concepts such as variables, conditional K1
and iterative execution methods
Describe the fundamentals of object-oriented programming
K2
CO2 including defining classes, objects, invoking methods
CO3 Apply the principles of inheritance, packages and interfaces K3
Use exceptions, applets, graphics programming for real world
K3
CO4 problems
CO5 Demonstrate the working features of files K3

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S M S S S

CO2 S S S M S

CO3 M M S M S

CO4 S S S M S

CO5 S S S S M

S- Strong; M-Medium; L-Low

68
JavaProgramming-PJA1810 (71Hrs)
Syllabus
Unit I 14Hrs
JAVA Evolution: History - Features - Java differs from C and C++ -Java and Internet
- Java and WWW - Web Browsers. Overview of Java Language: Introduction - Simple Java
program - Structure - Java tokens- Statements - Java virtual Machine
Unit II 15Hrs
Constants -Variables- Data types - Operators and expressions -Decision making and
Branching: Simple If Statement, the IF…Else statement, The Else... If ladder, The
Switch Statement, The? : Operator, Decision making and looping: The While statement, the
do Statement - The for Statement - Jumps in loops - labeled loops - Classes, Objects and
Methods
Unit III 14Hrs
Arrays, Strings and Vectors – Interfaces- Multiple Inheritance – Packages: Putting
classes together - Multi Threaded Programming
Unit IV 14Hrs
Managing Errors and Exceptions – Applet Programming – Graphics programming:
The Graphics class-Lines and rectangles-Circles and ellipses-Drawing arcs-Drawing
polygons-Line graphs-Using Control loops in applets-Drawing Bar charts
Unit V 14Hrs
Files: Introduction – concept of streams – Stream classes – Using stream – I/O classes
– File class – I/O Exceptions – creation of files – Reading / Writing characters/ Bytes –
Handling primitive data types – Random Access Files
Text Book

Year of
S. No Author Title of the Book Publisher
Publication
Programming with JAVA – Mc-Graw Hill
1 E. Balaguruswamy 2015
A Primer Professional

69
Reference Books

Year of
S. No Author Title of the Book Publisher
Publication
Java: The Complete Mc-Graw Hill
1 Herbert Schildt 2017
Reference Professional
Robert Sedgewick Introduction to
Addison Wesley
2 & Kevin Wayne Programming in Java 2017
Introduction to Java
3 Y. Daniel Liang Programming, Brief Pearson Education 2017
Version

Pedagogy
 Lectures, Group discussions, Demonstrations
Note: Flipped mode learning topics are highlighted.

Course activity

Unit Topic Activity Web Resources

Unit I Java tokens Assignment

Variables- Decision making and

Branching: Simple If
Unit II Debugging  www.javapoint.com
Statement, the IF…Else
statement, The Else... If ladder,  www.tutorialspoint.com
 www.tutorialdost.com
Unit III Arrays Seminar
Unit IV Drawing Bar charts Demonstration
Reading / Writing characters/
Unit V Debugging
Bytes

Course Designer
 Dr. J. Viji Gripsy

70
 Course
Course Name Category L T P Credit
Number

PCG1811 COMPUTER GRAPHICS III 71 4 - 4

Preamble

This course covers the computer graphics display devices. It covers the drawing,
clipping algorithms, 2D and 3D transformations. It focuses on interactive input methods and
functions in computer graphics.

Course Outcomes

On the successful completion of the course, students will be able to

CO
CO Statement Knowledge Level
Number
Describe the graphics techniques used in various applications
CO1 K1
and display devices.
Differentiate the concept of drawing algorithms, rotation and
CO2 K2
transformation.
Demonstrate the concepts of various clippings and
CO3 K3
transformations.
CO4 Illustrate the various input devices used in graphics. K3
Apply the three dimensional concepts using algorithm and
CO5 K3
display methods.

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S S M S S

CO2 S S S S M

CO3 S M S S S

CO4 S M S S S

CO5 S S S S S

S- Strong; M-Medium; L-Low

71
Computer Graphics -PCG1811 (71Hrs)
Syllabus
Unit I 14 Hrs
Basic Concepts: Uses of computer graphics – Display devices - Color CRT monitors
– Direct view storage tube – Flat panel displays – Raster scan systems - Random scan system,
Input and Hard copy device.
Unit II 14 Hrs
Line drawing algorithms: DDA algorithm, Bresenham’s line drawing algorithm,
Parallel line algorithms – Circle generating algorithms: Properties of circles, Midpoint circle
algorithm.
Unit III 14 Hrs
Two dimensional transformations: Basic transformations - Composite transformation
of translation, Rotation, Scaling – General Pivot point rotation – General fixed point scaling -
Other transformations: Reflection, Shear. Two dimensional viewing: Clipping Operations –
Point clipping – Line clipping : Cohen Sutherland line clipping – Curve clipping–Text
clipping – Exterior clipping.
Unit IV 14 Hrs
Graphical User Interface and Interactive Input methods: Input of graphical Data:
Logical input devices, locator devices, stroke devices, string devices, valuator devices, choice
devices, pick devices – Input Functions: Input modes, request modes, locator and stroke input
request modes, string modes, valuator modes, choice modes, pick modes, sample modes,
event modes.
Unit V 15 Hrs
Three dimensional concepts: Three dimensional display methods – Three dimensional
geometric and modeling transformations: Translation, Rotation and Scaling – Three
dimensional viewing: Viewing pipeline – Viewing coordinates – Projections. Visible Surface
Detection Methods: Back face detection method, Depth Buffer method, Octree method.
Surface Rendering Methods: Polygon rendering methods.

Text Book

Year of
S. No Author Title of the Book Publisher
Publication
Donald Hearn M. Computer Graphics Pearson Education nd
1 Pauline & Baker 2 Edition, 2008
– C Version Publication

72
Reference Books

Year of
S. No Author Title of the Book Publisher
Publication
1 Udit Agarwal Computer Graphics S K Kataria & Sons 2013
IK International
2 Pradeep K. Bhatia Computer Graphics 3rd Edition, 2013
Publishing House
Computer Graphics:
3 John F Hugheset.al., Addison Wesley 3rd Edition, 2013
Principles and Practice

Pedagogy
 Lectures, Group Discussions

Course Designer
 Dr. R. Kavitha

73
Course
Course Name Category L T P Credit
Number
CS18C12 SOFTWARE ENGINEERING III 71 4 - 4

Preamble
This course provides the basic concepts of software engineering to design a new
software project and develops skills to construct software of high quality. This Course also
covers the fundamental techniques for modeling software requirements, analysis and design.

Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement Level
Number
Recognize, define, and make correct use of generally accepted
CO1 K1
software engineering techniques and terminology
Understand common lifecycle processes to plan and deliver an
CO2 K2
effective Software engineering Process
Describe broad range of concepts from software engineering,
CO3
spanning all aspects of activities in software engineering process K2
Apply written, graphical communication in both technical and an
CO4 ability to identify and use appropriate Software techniques to
K3
develop software system.
Apply a systematic, disciplined, cost-effective development,
CO5 operation and maintenance of software systems to the satisfaction of
K3
their beneficiaries.

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S S S S S
CO2 S S M S S
CO3 S S S S S
CO4 S M S S S
CO5 S S S S S

S- Strong; M-Medium; L-Low

74
Software Engineering- CS18C12 (71 Hrs)
Syllabus
Unit I 14 Hrs
Software and Software Engineering: The Nature of Software – The Unique Nature of
Web Apps- Software Engineering-The Software Process- Software Engineering Practice-
Software Myths- How it All Starts. Process Models: A Generic Process Model-Process
Assessment and Improvement-Prescriptive Process Models.
Unit II 15 Hrs
Understanding Requirements: Requirements Engineering - Establishing the
Groundwork-Eliciting Requirements-Developing Use Cases-Building the Requirements
Model-Negotiating - Requirements-Validating Requirements. Requirements Modeling:
Scenarios, Information and Analysis Classes: Data Modeling Concepts-Class-Based
Modeling.
Unit III 14 Hrs
Design Concepts: The Design Process – Design Concepts - The Design Model.
Architectural Design: Software Architecture-What is Architecture? - Why is Architecture
Important? - Architectural Descriptions-Architectural Decisions Component-Level Design:
What Is a Component?-Designing Class Based Components- Designing Traditional
Components.
Unit IV 14 Hrs
Quality Concepts: What is Quality? - The Software Quality Dilemma-Achieving
Software Quality. Software Quality Assurance: Elements of Software Quality Assurance-SQA
Tasks, Goals and Metrics-Formal Approaches to SQA-Statistical Software Quality Assurance-
Software Reliability. Software Testing Strategies: A Strategic Approach to Software Testing-
Strategic Issues. Product Metrics: A Framework for Product Metrics - Metrics for the
Requirements Model- Metrics for Source Code-Metrics for Testing-Metrics for Maintenance.
Unit V 14 Hrs
Risk Management: Reactive versus Proactive Risk Strategies - Software Risks- Risk
Identification- Risk Projection- Risk Refinement-Risk Mitigation, Monitoring and
Management- The RMMM Plan Maintenance and Reengineering: Software Maintenance –
Software Supportability-Reengineering-Business Process Reengineering-Software
Reengineering- Reverse Engineering-Restructuring-Forward Engineering-The Economics of
Reengineering. Software Process Improvement: What is SPI? - The SPI Process -SPI Trends.

75
 Text Book

Year of
S. No Author Title of the Book Publisher
Publication

Software Engineering – A MC – Graw Hill

1 Roger S. Pressman 7th Edition, 2017
Practitioners Approach Higher Education

Reference Books

Year of
S. No Author Title of the Book Publisher
Publication

10 th Edition,
1 Ian Sommerville Software Engineering Pearson Education
2017

Software Engineering McGraw Hill

Richard Fairley 2017
2 Concepts Education

Prentice Hall India

Fundamentals of
3 Rajib Mall Learning Private 4th Edition, 2014
Software Engineering
Limited

Pedagogy
 Lecture, Group Discussion, Demonstration, Case Study

Course Designer
 Dr. C. Arunpriya

76
 Course
Course Name Category L T P Credit
Number
CS18E01 Parallel Computing Elective 71 4 - 5

Preamble
To develop structural intuition of how the hardware and the software work, starting
from simple systems to complex shared resource architectures and shared memory
programming paradigm. This development is accompanied by progress in the design, analysis
and application aspects of parallel algorithms and awareness of the parallel computing
technologies using multi core system.

Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level
To gain the knowledge about basic models of parallel
CO1 K1
machines and tools to program them.
To recognize how to use parallel computing and enable to
CO2 K2
write parallel code for high performance computing.

Demonstrate the architecture of future multi- and many-core

CO3 K3
processor systems.

Apply knowledge for a good understanding of optimizing

CO4 K3
serial programs and algorithms within computational science.
Illustrate the pragmatic approach to parallel programming of
CO5 K3
Message-passing algorithms through C language.

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S M S S M

CO2 S M S S M

CO3 M M S M M

CO4 S S M S S

CO5 S S S S S
S- Strong; M-Medium; L-Low.

77
Parallel Computing–CS18E01 (71 Hrs)
Syllabus
Unit I 15 Hrs
Introduction: Why do we need High speed computing? – How do we increase the
speed of computers? – History of parallel computers – Some interesting features of parallel
computers. Instruction Level parallel processing: some example commercial processors –
multithreaded processors – Proposed future processor architectures
Unit II 14 Hrs
Structure of parallel computers: A generalized structure of a parallel computer –
Shared memory parallel computers – interconnection networks – Distributed shared memory
parallel computers
Unit III 14 Hrs
Introduction: Computational demands of modern science – Advent of practical
parallel processing – Parallel processing terminology – The sieve of Eratosthenes. PRAM
Algorithms: A model of serial computation – The PRAM model of parallel computation.
PRAM algorithms: Parallel reduction – merging two sorted lists
Unit IV 14 Hrs
Processor Arrays, Multiprocessors and Multicomputer: Processor organizations –
Processor arrays – Multiprocessors – multicomputer – Flynn’s taxonomy-speedup, scaled
speedup and parallelizability
Unit V 14 Hrs
Parallel programming languages & algorithms: Parallel language & algorithm design
for the array processor – other von Neumann-type languages – C, C++ & parallel C++ - Non-
von Neumann- type languages
Text Books
Year of
S. No Author Title of the Book Publisher
Publication
2nd Edition
1 Michael J Quinn Parallel Computing Tata Mc-Graw Hill
2008
Parallel Computers
V. Rajaraman, Prentice Hall of India
Architecture and 2008
2 C. Siva Ram Murthy Pvt. Ltd
Programming

78
 Reference Books
Year of
S. No Author Title of the Book Publisher
Publication
MichealMcCool,
Structured Parallel Morgan Kaufmann
1 ArchD.Robinson, 2012
Programming Publishers
JamesReindres
Wilkinson Barry, Parallel and Concurrent
2 Pearson Education
Michael Allen Programming 2012
Introduction to Parallel Morgan Kaufmann
3 Peter Pacheco
Programming Publishers 2011

Pedagogy
 Lecture, Group Discussion, Case Studies

Course Designer
 Dr. C. Arunpriya

79
 Course
Course Name Category L T P Credit
Number
CS18E02 Big Data Analytics Elective 71 4 - 5

Preamble
The course provides an introduction to big data analytics and Hadoop architecture. It
introduces the Map Reduce programming model. It provides insight on No SQL databases
and querying model used in Big Data.

Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level

Define the big data, types of data and understand the need of
CO1 K1
big data analytics

CO2 Describe the Hadoop architecture and File system K2

Apply the MapReduce Programming model for real-world

CO3 K3
problems

CO4 Distinguish NoSQL databases from RDBMS K3

Demonstrate the working of row and column oriented data
CO5 K3
stores

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S M S S S

CO2 S S S M S

CO3 M M S M M

CO4 S S S M M

CO5 S S S M M

S- Strong; M-Medium; L-Low

80
Big Data Analytics–CS18E02 (71Hrs)
Syllabus
Unit I 14 Hrs
Overview of Big Data: Defining Big Data - Big Data Types – Big Data Analytics –
Industry Examples of Big Data - Big Data and Data Risk – Big Data Technologies – Benefits
of Big Data
Unit II 15 Hrs
Basics of Hadoop: BigData and Hadoop – Hadoop Architecture – Main Components
of Hadoop Framework – AnalysingBig Data with Hadoop – Benefits of Distributed
Applications – Hadoop
Distributed File System – Advantages of Hadoop – Ten Big Hadoop Platforms
Unit III 14 Hrs
Map Reduce: Introduction to Map Reduce –Working of Map Reduce – Map
operations – Map Reduce User Interfaces
Unit IV 14 Hrs
NoSQL Databases: NoSQL Data Management – Types of NoSQL Databases – Query
Model for Big Data – Benefits of NoSQL – MongoDB – Advantages of MongoDB over
RDBMS – Replication in MongoDB.
Unit V 14 Hrs
HBase, CASSANDRA and JAQL: Introduction to HBase – Row-oriented and
Column-oriented Data Stores – HDFS VsHBase – Hbase Architecture – HBase Data Model –
Introduction to Cassandra – Features of Cassandra . Introduction to JAQL – JSON –
Components of JAQL.

Text Book

Year of
S. No Author Title of the Book Publisher
Publication
1 V.K. Jain Big Data and Hadoop Khanna Book Publishing 2017

81
Reference Books
Year of
S. No Author Title of the Book Publisher
Publication
Big Data Analytics: Turning Wiley and SAS
1 Frank J Ohlhorst 2012
Big Data into Big Money Business Series
Anand Rajaraman, Cambridge
Mining of Massive Datasets 2012
2 Jeffrey David Ullman University Press
Paul Zikopoulos, Understanding Big Data:
Chris Eaton, Analytics for Enterprise Class Tata McGraw Hill
3 2011
Paul Zikopoulos Hadoop and Streaming Data

Pedagogy
 Lecture, Demonstration, Group Discussion

Course Designer
 Dr. S. Karpagavalli

82
 Course
Course Name Category L T P Credit
Number
CS18E03 Artificial Intelligence Elective 71 4 - 5

Preamble
This course introduces the basic principle concepts in artificial intelligence like
simple representation schemes, problem solving paradigms, constraint propagation, and
search strategies. It also covers the areas of application such as knowledge representation,
natural language processing and expert systems.

Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level
Learn about the artificial intelligence problem and the
CO1 K1
characteristics of the problem space.

Demonstrate the fundamentals of heuristic search techniques

CO2 K2
and reasoning for problem solving.
CO3 Understand the problem solving using predicates. K2
Describe the concepts of expert systems with case studies for
CO4 K2
various applications
CO5 Apply the concepts of game playing techniques. K3

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S S M S S

CO2 S S S S M

CO3 S M S S S

CO4 S M S S S

CO5 S S S S M
S- Strong; M-Medium; L-Low

83
Artificial Intelligence– CS18E03 (71 Hrs)
Syllabus
Unit I 15 Hrs
Artificial intelligence meaning- The AI problems – The underlying assumption –
What is an AI Techniques? – The level of the model. Problems, problem spaces, and search:
Defining the system – problem characteristics – production system characteristics.
Unit II 14 Hrs
Heuristic search techniques: Generate and Test – Hill climbing – Best –first search –
Problem reduction – Constraint satisfaction – Means –ends analysis. Knowledge
representation issues: Representations and mappings – Approaches to knowledge
representation.
Unit III 14 Hrs
Using predicate logic: Representing simple facts in logic – Representing instance and
ISA relationships – computable functions and predicates resolution – natural deduction.
Representing Knowledge using rules: Procedural versus declarative knowledge – Logic
programming – Forward versus Backward reasoning – Matching – Control Knowledge.
Unit IV 14 Hrs
Game playing: Overview – The minimax search procedure – Adding alpha – beta cut-
offs – Additional refinements – Iterative Deepening – References on specific games.
Understanding: What understands? What makes understanding hard? Planning- The blocks
world- components of a planning system –Good stack planning-Coral Stack planning-Non
linear planning using constraint posting.
Unit V 14 Hrs
Expert systems: Representing & using domain knowledge – Expert system shells –
Knowledge acquisition. Perception and Action: Real-time search – perception- Action –
Robot Architectures. Prolog- the Natural languages of Artificial intelligence- introduction-
converting English to prolog facts and rules-Goals-prolog terminology-Variables-Control
structure-Arithmetic Operators-Matching inprolog-Backtracking
Text Books
Year of
S. No Author Title of the Book Publisher
Publication
Elaine rich,
1 Kevin Knight, Artificial Intelligence Tata McGraw Hill 3rd Edition, 2011
Shivashankar B Nair

84
Reference Books
Year of
S. No Author Title of the Book Publisher
Publication
Artifical Intelligence: A
1 Stuart Russell Pearson 3rd Edition, 2013
Modern Approach
A First Course in Artificial McGraw
2 Deepak Khemani 2013
Intelligence Hill
Prentice Hall
3 Mishra R. B. Artificial Intelligence
of India 2010

Pedagogy
 Lectures, Group discussions, Demonstrations, Case studies

Course Designer

 Mrs. N. Deepa

85
 Course
Course Name Category L T P Credit
Number
JAVA PROGRAMMING AND
CS17CP5 III - - 75 3
BIO INFORMATICSLAB

Preamble
This course focuses to equip students with adequate high-level object-oriented
programming techniques required for successful design, development, and deployment of
today’s complex software systems. Implement object oriented programming concepts. Create
package and interfaces in a Java program. Use graphical user interface in Java programs and
create applets. To align the sequence data using various tools in Bioinformatics
Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level
Understand the enabling technologies for building internet
CO1 K1
applications
Illustrate the object-oriented technique to analyze software
CO2 K2
problems

CO3 Apply the principles of inheritance, packages and interfaces K3

CO4 Implement the multithreading, exception handling concepts K3

CO5 Apply programming skills to experiment protein sequence K3

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S M S S S

CO2 S S S M S

CO3 M M S M S

CO4 S S S M S

CO5 S S S S M
S- Strong; M-Medium; L-Low

86
Java Programming and Bio Informatics lab- CS17CP5 (75 Hrs)

Syllabus
 Exercises using classes and objects
 Exercises using Control Statements
 Exercises using different Inheritance
 Exercises using Mouse Events
 Exercises for implementing the font class method
 Exercises to implement Exception Handling
 Exercises using Interfaces
 Exercises to illustrate the Thread Priority
 Retrieve nucleotide sequences and perform pair wise and multiple sequence alignment
using BLAST tool and analyze the output.
 Retrieve nucleotide sequences and perform multiple sequence alignment using
CLUSTALW tool and generate phylogenetic tree.
 Retrieve two nucleotide sequences to align and generate PAM & BLOSUM scoring
matrix.
 Convert gene sequence into its corresponding amino acid sequence using Translate
Tool
 Convert RNA gene sequence into its corresponding amino acid sequence using RNA
prediction Tool
Pedagogy
 Lectures, Demonstrations
Course Designer
 Dr. J.V iji Gripsy

87
Semester : V
Title : Information Security – Level II
Subject code : NM13IS2
Credits : Grade
Lecture Hours : 26

Objective
This course aims on introducing the theory and practice of designing and building
secure computer systems that protect information and resist attacks. It covers all aspects of
cyber security including network security, computer security and information security.
Unit I 5 Hrs
Information security: History of IS-What is security?-characteristic of IS-components
of system–security system life cycle model.
Unit II 6 Hrs
Cryptography: Concepts and techniques- plain text and cipher text- Encryption
principles- Cryptanalysis-cryptograph algorithm- Cryptograph tools. Authentication methods-
passwords- keys versus passwords-Attacking Systems via passwords-Password verification
Unit III 5 Hrs
Fire walls: Viruses and worms- Digital rights management- What is firewalls- Types
of Fire wall- Design Principles of Firewall
Unit IV 5 Hrs
Hacking: Hacker hierarchy-password cracking-Phishing- Network Hacking- Wireless
hacking.- Windows hacking- Web hacking- Ethical hacking
Unit V 5 Hrs
Case studies: DNS, IP SEC- Social media
Reference Books
Year of
S. No Author Title of the Book Publisher
Publication
Dr. Michael E. Principles and
Course Technology 4th Edition,
1 Whitman, Practices of
Cengage Learning 2012
Herbert J. Mattord Information Security
Crptography and McGraw Hill 3rd Edition,
2 Atul Kahato
Network Security Education 2012
Network Security
2nd Edition,
3 William Stallings Essential Applications Prentice Hall
2009
and standard

88
 Course
Course Name Category L T P Credit
Number
Skill Based Subject Data Analytics –
PV19SB02 III 43 2 - 4
Level II :Data Visualization Tools

Preamble
This course is designed to provide students with the foundations for understanding
and extending the current state of the art in data visualization. It will also provide skills to
students to present data effectively through chart, map and dashboard.
Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level
CO1 Design bar chart and pie chart for real time data K2
CO2 Choose the right visualization tool for different data source K2
CO3 Develop geo map and symbol map for geospatial data K3
CO4 Construct dashboard for business data presentation K3
CO5 Gain knowledge to build charts and dashboard for decision making K3

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S M S M S

CO2 S S M S M

CO3 S S S S M

CO4 S M S S M

CO5 S M S M S

S- Strong; M-Medium; L-Low.

89
Data Analytics – Level II: Data Visualization Tools–PV19SB02 (43 Hrs)
Syllabus
Unit I 9 Hrs
Data Visualization: Introduction – Benefits of Data Visualization - Data Visualization
Tools – Features – Data access from data sources.

Unit II 9 Hrs
Data Transformation - Bar Chart - Pie Chart – Data Tables - Scatter Chart

Unit III 9 Hrs

Time series Chart – Scorecard-Scatter Chart-Bullet Chart - Area Chart

Unit IV 8 Hrs
Heat Map - Geo Map - Symbol Map - Filled Map - Editing Location in Map

Unit V 8 Hrs
Reports

Text Book: Course material will be provided

Reference Books

Year of
S. No Author Title of the Book Publisher
Publication
Visualize This: The Flowing
1st Edition,
1 Nathan Yau Data Guide to Design, Wiley
2011
Visualization, and Statistics
Storytelling with Data: A Data
Cole Nussbaumer John Wiley
2 Visualization Guide for 2015
Kna flic & Sons
Business Professionals

Note
* During Semester V - Unit I, Unit II till Data Tables
** During Semester VI from Scatter Chart in Unit II, Unit III, Unit IV and Unit V
Pedagogy

 Lecture, Demonstration

Course Designers
 Dr. S. Karpagavalli

90
 Course
Course Name Category L T P Credit
Number
Skill Based Subject
PT19SB02 OOSE Level II : Software Testing III 43 2 - 4
Tools
Preamble
The main objective of this course is to expose students to automation testing approach
and it also facilitates the students to understand the testing process, planning strategies to test
the script and report the result using existing testing tools.

Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level
Familiarize the principles in software testing, implement and
CO1 manage various test processes in a project K1

CO2 Understand the importance of performance testing K1

Understand the needs of software test automation and purpose of
CO3 existing tools K2
Describe the structure of test plan, test case design and to generate
CO4 a testing report K2
CO5 Testing applications using different automated testing tools K3

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S M S M S
CO2 M S S S M
CO3 S M M S S
CO4 S S M M S
CO5 S S s S M

S- Strong; M-Medium; L-Low.

OOSE – Level II: Software Testing Tools–PT19SB02 (43 Hrs)

Syllabus
Unit I 9 Hrs
System Testing Process: Generic challenges in software development-Identify the
process elements- Test strategy, Master test plan, Preparing detailed test plan, Develop and

91
review test cases, Identify test execution cycles. System Test Commencement- Components
in test strategy
Unit II 9 Hrs
System Test Planning and Design: Objective- Test plan Development Process- Test
Design- Test Case definition- Necessity of test case documentation- Rules to be followed-
Test Case Design methods- Functional Specification based Test Case design- Functional
Specification
Unit III 9 Hrs
System Test Execution- Level of test execution, text reporting and defect tracking-
Defect report format- Defect submission- Life cycle- Types of defects- Defect tracking
system
Unit IV 8 Hrs
Performance Testing: Introduction to Performance Testing- Need of Performance
Testing- Methods for Load Testing- Performance Test approach. Vuser Script creation–
Components – Virtual User Generator- Action Files – Output Window – Transactions
Unit V 8 Hrs
Software Testing Tools: Need for tools – Classification of Tools – Benefits of Tools –
Risk associated with the tools – Selecting tools – Introducing the tools in the testing process -
Testing an application using any software testing tools
Text Book
Year of
S. No Author Title of the Book Publisher
Publication
Nageswara Rao Software Testing
1 Dream Tech Press 2012
Pusuluri Concepts and Tools
Reference Book
Year of
S. No Author Title of the Book Publisher
Publication
Software Testing Dreamtech press,
1 Dr. K.V.K.K. Prasad 2012
Tools Reprint ISBN

Note
*During Semester V - Unit I, Unit II till Test design
** During Semester VI - from test case in Unit II, Unit III, Unit IV & Unit V
Pedagogy
 Lecture, Demonstration

Course Designers
 Mrs. S. Ponmalar

92
Semester : V
Advance Level Course : 1
Paper : 1
Title : Wireless Communications
Subject code : CS14AC1
Credits : 5*
Objective
This subject aims in providing a strong foundation in Technology and Architecture,
Design approaches, Applications.
Unit I
Introduction: Wireless comes of age, The cellular Revolution, The global cellular
Network, Broad band, Future trends, The trouble with wireless. Transmission Fundamentals:
signals for conveying Information, Analog and Digital Data Transmission, Channel Capacity,
Transmission Media, Multiplexing.
Unit II
Antennas and propagation: Antennas, propagation modes, Line-of-sight Transmission,
Fading in the Mobile Environment. Signal Encoding Technique: Criteria, Digital data, Analog
signals, Analog data, Analog signals, Analog data, and digital signals.
Unit III
Spread Spectrum: The concept of spread spectrum, frequency hopping spread
spectrum, direct sequence spread spectrum, code division multiple access, generation of
spreading sequences. Coding and Error control: Error Detection, Block Error correction
codes, Convolutional codes, convolution codes, automatic repeat request.
Unit IV
Cellular Wireless Network: Principles, First generation analog, Second generation
TDMA. Cordless systems and wireless local loop: cordless systems, wireless local loop.
Mobile IP and wireless Access protocol: Mobile IP, Wireless Application Protocol.
Unit V
Bluetooth and IEEE 802.15: Overview, Radio specification, Baseband specification,
Link Manager Protocol, Logical link control and adaptation protocol.
Text Book
Year of
S. No Author Title of the Book Publisher
Publication
Wireless Communication Pearson
1 William Stallings 2nd Edition, 2012
and networks Education

93
Reference Books

Year of
S. No Author Title of the Book Publisher
Publication
Andreas Wiley India 2nd Edition,
1 Wireless Communication
F.Molisch Edition 2012
Wireless Communication
2 Ali Eksim Intech Publishing 2012
networks
Ke-Lin Du, Wireless Communication Cambridge
3 2011
M.N.S Swamy system University Press

94
 Semester : V
Advance Level Course : 1
Paper : 2
Title : Cloud Computing
Subject code : CS16AC2
Credits : 5*

Objective
The main purpose of this subject is to provide the basic framework for estimating
value and to determine benefits from cloud computing as an alternative to conventional IT
infrastructure.
Unit I
Introduction cloud computing: grasping the fundamentals-discovering the value of the
cloud for business getting inside the cloud-developing your cloud strategy.
Unit II
Understanding the nature of the cloud-seeing the advantages of highly scaled data
center- Exploring the technical foundation for scaling computer systems-checking the cloud
workload strategy – managing data
Unit III
Examining the cloud elements: Seeing infrastructure as a service-Exploring platform
as service.
Unit IV
Managing the cloud: Managing and securing cloud service – Governing the cloud -
Virtualization and the cloud.
Unit V
Managing the cloud: Managing desktops and devices in the cloud- Service-oriented
architecture and the cloud – Managing the cloud environment.

Text Book
Year of
S. No Author Title of the Book Publisher
Publication
Judith Hurwitz, Robin
Cloud Computing Willey India
1 Bloor,Marcia Kaufman 2012
For Dummies Publication
and Dr. Fernhalper

95
Reference Books

Year of
S. No Author Title of the Book Publisher
Publication
Prasant Kumar Fundamentals of Cloud Vikas Publishing
1
Pattnaik Computing House 2014
Cloud Computing:
2 RajkimarBuyya.,et.al Wiley publications
Principles and Paradigms 2013
John Wiley and
3 Barrie Sosinsky Cloud Computing Bible
Sons 2011

96
 Course
Course Name Category L T P Credit
Number
CS18C13 .NET PROGRAMMING III 71 4 - 4

Preamble
This course provides the students with an overview of .NET framework,
Programming structure of C# in developing applications. This course covers the technologies
like Common Language Runtime, C# and ADO.NET data access.
Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level
CO1 Define the basic concepts of .NET framework. K1

Understand the general programming structure of C# in

CO2 K2
developing software solutions based on user requirements.
CO3 Apply console based applications using C#. K3

Examine the background process with the help of windows

CO4 K3
application.
CO5 Illustrate the concepts of database access. K3

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 M S M M M

CO2 S M S S S

CO3 S S S S M

CO4 S M S M S

CO5 M M M S S

S- Strong; M-Medium; L-Low

97
.NET PROGRAMMING-CS18C13 (71Hrs)
Syllabus
Unit I 14 Hrs
Understanding .NET: The C# Environment: -.Net Strategy- Origins of .Net
technology- .NET frame work- common language runtime- framework base classes- user and
program interfaces- visual studio .NET- .NET languages- benefits of .NET Approach - C#
and .NET. - First C# program - Data types and Expressions
Unit II 14 Hrs
Methods and behaviours- Making Decisions - Repeating Instructions - Arrays and
Collections: array basics-array declaration- array class- string class
Unit III 14 Hrs
Advanced Object Oriented Programming: Object Oriented Language features -
Component based Development,- Inheritance- abstract classes- partial classes- interfaces-
polymorphism. Debugging and Handling Exceptions: Errors-Exceptions- Exception handling
Techniques- Exception Classes
Unit IV 15 Hrs
Introduction to Windows Programming: Constrating windows and console
applications- Graphical User Interface- Elements of good design - Using C# and visual studio
to create windows based applications- windows forms - controls. Programming based on
Events: Event handling in C# -List box control objects- Combo box control objects- Menu
strip control objects- checkbox and Radio button objects
Unit V 14 Hrs
Database Access Using ADO.NET: Database Access - ADO.Net - Data source
configuration Tools
Text Books

Year of
S. No Author Title of the Book Publisher
Publication
Cengage Learning India 5th Edition,
1 Barbara Doyle Programming in C#
private Limited 2015

98
Reference Books
Year of
S. No Author Title of the Book Publisher
Publication
C# and the .Net 2nd Edition,
1 Andrew Troelsen The authors press
platform 2010
2 Mark J. Price C#7 and .NET core Packt Publisher 2nd Edition, 2017

3 E. Balagurusamy Programming in C# Tata McGraw Hill 3rd Edition, 2010

Pedagogy

 Lecture, Demonstration

Course Designer
 Mrs. A.S. Kavitha

99
 Course
Course Name Category L T P Credit
Number
CS18C14 SOFTWARE TESTING III 71 4 - 4

Preamble
This course provides the foundation techniques, and tools in the area of software
testing. This course also includes various methodologies of different software testing
techniques and their challenges for a real time project.
Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level

Define the characteristics of testing and software development

CO1 K1
life cycle models

Recognize the facts of software development models to adopt

CO2 K1
with product characteristics
Understand different types of testing, their objectives and
CO3 K2
challenges
CO4 Interpret the software products to execute and report test cases K3

Apply software testing methods and to perform various types of

K3
CO5 testing in a software project

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S S S S S

CO2 M S S S S

CO3 S S S S S

CO4 S S M S S

CO5 M S S S S

S- Strong; M-Medium; L-Low

100
Software Testing-CS18C14 (71Hrs)
Syllabus
Unit I 15 Hrs
Software Development Life Cycle Models: Phases of Software project –Quality,
Quality Assurance, Quality control – Testing, Verification and Validation – Process Model to
represent Different Phases - Life Cycle models. White-Box Testing: Static Testing –
Structural Testing – Challenges in White-Box Testing
Unit II 14 Hrs
Black-Box Testing: What is Black-Box Testing? - Why Black-Box Testing? – When to
do Black- Box Testing? – How to do Black-Box Testing? Integration Testing: Integration
Testing as Type of Testing – Integration Testing as a Phase of Testing – Scenario Testing –
Defect Bash
Unit III 14 Hrs
System and Acceptance Testing: System Testing Overview – Why is System testing
done? – Functional versus Non-functional Testing - Functional System Testing - Non-
Functional Testing- Acceptance Testing - Summary of Testing Phases
Unit IV 14 Hrs
Performance Testing: Factors Governing Performance Testing – Methodology for
Performance Testing - Tools for Performance Testing - Process for Performance Testing -
Challenges. Regression Testing: What is Regression Testing? – Types of Regression Testing
– When to do Regression Testing? – How to do Regression Testing? – Best Practices in
Regression Testing
Unit V 14 Hrs
Test Planning, Management, Execution and Reporting: Test Planning – Test
Management - Test Process – Test Reporting. Quick Test Professional (QTP): Overview of
QTP – Testing an Application using QTP – Creating Check Points – Testing Database
Application – Testing a Web Application

Text Book

Year of
S. No Author Title of the Book Publisher
Publication
Software Testing
Srinivasan Desikan, Pearson
1 Principles and 2012
Gopalaswamy Ramesh Education
Practices

101
Reference Books
Year of
S. No Author Title of the Book Publisher
Publication
1 Dr.K.V.K.K.Prasad Software Testing Tools Dreamtech Press 2012
Testing Packt Publishing
2 Renu Rajani 2017
Practitioner Handbook Limited
nd
Oxford University 2 edition,
3 Naresh Chauhan Software Testing
Press 2016

Pedagogy
 Lectures, Group Discussion, Demonstration, Case Study

Course Designer
 Dr. C. Arunpriya

102
 Course
Course Name Category L T P Credit
Number
PWT1815 WEB TECHNOLOGY III 71 4 - 4

Preamble
This course gives the basic principle, strategies and methodologies of web application
development. The Course is designed to develop dynamic web page using scripting
languages and various styles with CSS andHTML5.
Course Outcomes
On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level

Define the knowledge about HTML document with element types,

CO1 K1
hyperlinks, images, list, tables and forms

Understand the concept of CSS for dynamic presentation effect in

CO2 K2
HTML and XML documents.

Describe the mark-up languages for processing, identifying and

CO3 K2
presenting information in web pages.

Apply scripting languages in HTML document to add interactive

CO4 K3
components to web pages.

Illustrate the web technology concept to create schemas and

CO5 K3
dynamic web pages.

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S S S M S
CO2 S S M S M
CO3 M S M M S
CO4 S M S M S
CO5 M M S S M

S- Strong; M-Medium; L-Low

103
Web Technology -PWT1815 ` (71Hrs)
Syllabus
Unit I 14 Hrs
Fundamentals of HTML: Understanding Elements: Root Elements-Metadata
Elements-Section Elements-Heading Elements-Describing data types.
Unit II 15 Hrs
HTML 5: HTML5 and its essentials-Exploring New Features of HTML5-Next
Generation of Web Development-Structuring an HTML Document-Exploring Editors and
Browsers Supported by HTML5-Creating and Saving an HTML Document-Validating an
HTML Document-Viewing an HTML Document-Hosting WebPages.
Unit III 14 Hrs
DHTML: Introduction - Cascading Style sheets - DHTML Document Object Model
and collections – Event Handling - Filters and Transitions - Data Binding.
Unit IV 14 Hrs
Scripting Languages: JavaScript: Introduction- Language Elements - Objects of
JavaScript- Other Objects. VB Script: Introduction- Embedding VBScript Code in an HTML
Document- Comments-Variables- Operators-Procedures- Conditional Statements- Looping
Constructs - Objects and VBScript - Cookies.
Unit V 14 Hrs
Extensible Mark-Up Language (XML): Introduction- HTML vs. XML- Syntax of the
XML Document- XML Attributes- XML Validation- XML DTD- The Building Blocks of
XML Documents-DTD Elements - DTD Attributes- DTD Entities- DTD Validation –XSL -
XSL Transformation- XML Namespaces- XML Schema.
Text Book

Year of
S. No Author Title of the Book Publisher
Publication
N.P.Gopalan, Web Technology 4th Edition,
1 PHI Learning Pvt. Ltd
J.Akilandeswari A Developer’s Perspective 2011

104
Reference Books

Year of
S. No Author Title of the Book Publisher
Publication
Kogent Learning
1 HTML5 Black Book Dream Tech Press 2011
Solutions Inc
K. Nath & Co 1st Edition
2 Akanksha Rastogi Web Technology
Educational Publishers 2012
Anuranjan Misra, Introduction to Web
3 Laxmi Publication 2011
Arjun Kumar Singh Technology
World Wide Web
4 C. Xavier TMH Publishers
Design with HTML 2008

Pedagogy
 Lectures, Group Discussions

Course Designer
 Dr. R. Kavitha.

105
Course
Number Course Name Category L T P Credit

WEB TECHNOLOGY AND

CS17CP6 III - - 75 2
BIO INFORMATICS LAB

Preamble
This course covers the basic structure of an HTML element for creating dynamic web
pages. To impart practical knowledge in web design and database connectivity to create more
sophisticated HTML documents with scripting languages. To align the sequence data using
various tools in Bioinformatics
Course Outcomes
On the successful completion of the course, students will be able to
CO Knowledge
CO Statement
Number Level
CO1 Identify the basic tags used in HTML document K1

CO2 Understand the implementation of various style tags. K2

Use database connectivity for practical experience in developing
CO3 K3
solutions
Demonstrate the use of various controls and connectivity in
CO4 K3
windows application.

Apply programming skills to experiment Various tools in

CO5 K3
bioinformatics.

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 M M S M M

CO2 M S M S S

CO3 S M S M S

CO4 S M S M M

CO5 S M M S S

S-Strong; M-Medium; L-Low

106
Web Technology and Bio Informatics Lab- CS17CP6 (75Hrs)

Syllabus
 Exercises using Formatting Tags.
 Exercises to implement Table Tags.
 Exercises using List Tags.
 Exercises to implement Frames and Framesets
 Exercises using Cascading Style Sheets.
 Exercises to implement image, background color and text.
 Exercises using Radio buttons, Check boxes and List boxes
 Exercises to implement ADD, DELETE and UPDATE records in the table using
ADO.NET.
 Retrieve the structures of the compounds from PubChem: Xylitol, Saccharine,
Aspartame
 Perform the PHI-BLAST and PSI-BLAST for the protein sequence Q1A232. Write
the top 4 E scores values and the Sequence ID until conver gene.
 Perform Pair wise alignments for the proteins Insulin from the organism’s
homosapiens and Musmusculus. Calculate the Percent Similarity and Identity using
BLOSUM 62 and PAM 250 Compare the results.
 Perform the protein –ligand docking using ARGUSLAB for the given receptor and
ligand (select the compounds from the databases) and compare the dock score.
 Find the super secondary structure for any protein database.
Pedagogy

 System, Demonstration.

Course Designer
 Dr. R. Kavitha

107
 Semester : VI
Advance Level Course : 2
Paper : 1
Title : Image Processing
Subject code : CS14AC3
Credits : 5*

Objective

Presents the basic concepts and methodologies in a student-friendly manner. Provides

learning principles and how they are applied in real applications.
Unit I

Introduction to Image Processing System: Introduction-Image sampling-Quantization-

Resolution- Human Visual system- Classification of digital images. Elements of image
processing system.

Unit II

Image Transforms: Introduction- Need for transform- Image transforms. Image

Enhancement: Introduction – spatial domain methods- frequency domain methods – point
operations – Histogram modeling.
Unit III

Image restoration and Denoising: Introduction – Image degradation- Types of image

blur- classification of image restoration techniques- image restoration model. Image
segmentation: Introduction – Classification – Region approach to image segmentation –
clustering techniques - Edge based segmentation – classification of edges- Edge detection.

Unit IV

Object recognition: Introduction – Need for object recognition system – Patterns and
pattern classes – Selection of measurement parameters- Relationship between image
processing and object recognition Image compression: Introduction – Need for image
compression – Redundancy in images – Image compression scheme –Classification.

Unit V

Binary image processing – Introduction – Binarisation – Mathematical morphology-

logical operations- Structure elements – Morphological image processing – Standard binary
morphological – operations-dilation and erosion based operations properties of
morphological based operations.

108
Text Books
Year of
S. No Author Title of the Book Publisher
Publication
S.Jayaraman,
S.Esakkirajan , Tata McGraw Hill
1 Digital Image Processing 2009
Publication,
T.Veerakumar

Digital Image Processing – 4th Edition,

2 MadhuriA.Joshi An algorithmic approach PHI Learning Pvt. Ltd 2009

Reference Books

Year of
S. No Author Title of the Book Publisher
Publication
Image Processing:
IRMA
1 Concepts, Methodologies, Idea Group,U.S 2013
International
Tools, and Applications
Mahajan Publishing
2 Sachin Sharma Fundamentals of Image 2013
House
Dr.D.J.Shah Processing
Pearson Education ,
Rafael C.
Inc. and Dorling
Gonzalez, Richard Digital Image Processing
3 Kindersley 2011
E.Woods, Steven using MATLAB
Publication, Fifth
L. Eddins
Impression

109
Semester : VI
Advance Level Course : 2
Paper : 2
Title : Mobile Computing
Subject code : CS11AC4
Credits : 5*

Objective
Learn the basics of networking theory- networking concepts relevant to modern
wireless systems- emerging mobile computing ideas and best practices- get hands on
knowledge practice with mobile computing and cloud services.
Unit I
Wireless Communication – Introduction – History – Types of wireless networks –
Application of wireless technology.
Unit II
Telecommunication Systems: Introduction to GSM –Technical details – Mobile
services – System architecture – Radio channel structure in GSM – Protocols.
Unit III
GPRS: Introduction – GPRS system architecture – Services – Technology – GPRS
physical and logical channels – Bluetooth: Working principle – Modes of operation –
Applications- Bluetooth vsWi-Fi in networking.
Unit IV
Satellite Communications: Introduction – Satellite Basics – Satellite parameters and
configuration – IEEE 802.11 architecture – Services.
Unit V
Wireless LAN: Overview – History – Benefits – Disadvantage – Design Goals –
Architecture – Types of wireless LANs – Transmission Technologies used for WLANs –
Mode of operation – Competing wireless technologies.
Text Book

Year of
S. No Author Title of the Book Publisher
Publication
SundaraRajan,
1 Mobile Computing Sams Publishers 2008
Ramesh, Raja Sekaran

110
Reference Books
Year of
S. No Author Title of the Book Publisher
Publication
Pearson Education and
Martin S. Nicklous, Mobile Computing:
1 Dorling Kindersley 2012
Thomas Stober Theory and Practice
Publication

Pattnaik Prasant Fundamentals of Mobile Prentice Hall of

2 Kumar and Rajib Mall Computing 2012
India
Oxford University 2nd Edition,
3 Raj Kamal Mobile Computing
Press 2011

111
 Course
Number Course Name Category L T P Credit

Skill Based Subject : Data Analytics Practical II

PV19SBP2 III - - 45 2
Data Visualization Tools

Preamble
This course is aimed for providing graphical representation for real time data using
visualization tools. It facilitates the students to gain skills on geo spatial data visualization
and to create dashboard.
Course Outcomes

On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level

CO1 Design bar chart and pie chart for real time data K2

Choose the right visualization tool for different data

CO2 K2
source
CO3 Develop geo map and symbol map for geospatial data K3

CO4 Construct dashboard for business data presentation K3

Gain knowledge to build charts and dashboard for

CO5 K3
decision making

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S M S M S

CO2 S S M S M

CO3 S S S S M

CO4 S M S S M

CO5 S M S M S

S- Strong; M-Medium; L-Low

112
Data Analytics – Practical II: Data Visualization Tools- PV19SBP2 (45 Hrs)

List of Programs

 Create a bar chart for the given data

 Create a pie chart for the given data

 Create a scatter chart for the given data

 Create a time series chart for the given data

 Create a bullet chart for the given data

 Create an area chart for the given data

 Create a heat map for the given data

 Create a geo map for the given data

 Create a filled map for the given data

 Create a dashboard and format it

Note

* During Semester V - Exercise 1 to Exercise 6

** During Semester VI - Exercise 7 to Exercise 10

Pedagogy
 Demonstration, System

Course Designer
 Dr. S. Karpagavalli

113
 Course
Course Name Category L T P Credit
Number
Skill Based Subject: OOSE-Practical II
PT19SBP2 III - - 45 2
Software Testing Tools

Preamble

The objective of this course is to understand the importance of test automation and to
impart the features of selenium web driver tool and to develop automated tests for web
applications
Course Outcomes

On the successful completion of the course, students will be able to

CO Knowledge
CO Statement
Number Level
Creates awareness on foundation of Object-oriented
CO1 K1
programming using Java
Understand the features & components Selenium Web
CO2 K2
Driver Tool
Learn to design and implement test automation
CO3 K2
framework for a software project
Acquire knowledge to adapt and develop automated
CO4 K3
tests for web applications
Able to evaluate the quality of a software product and
CO5 K3
also to improve it by identifying defects

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 PO5

CO1 S S S M S
CO2 M S S S M
CO3 S S M S S
CO4 S M S M S
CO5 S S M S M
S- Strong; M-Medium; L-Low.

114
OOSE-Practical II: Software Testing Tools - PT19SBP2 (45 Hrs)
List of Programs
 Write a test case based on controls
 Test data in a flat file
 Manual test case to verify student grade
 Write and test a program to select the number of students who have scored more
than 60in any one subject (or all Subjects)
 Write and test a program to login a specific web page.
 Write and test a program to get the number of list items in a list / combo box.
 Test a HTML file
 Test a program in MS Excel for Data Driven Wizard
 Test the addition of two values in C++Program
 Write a test suite containing minimum 4 test cases

Note

* During Semester V - Exercise 1 to Exercise 6

** During Semester VI - Exercise 7 to Exercise 10

Pedagogy

 Demonstration, System
Course Designer

 Dr. S. Karpagavalli

115