MSC CS Syllabus 2019-2020

SYLLABUS
Under
CHOICE BASED CREDIT SYSTEM
(CBCS)
[With effect from the year 2019-2020]
D.K.M. COLLEGE FOR WOMEN (AUTONOMOUS), VELLORE-1
DEPARTMENT OF COMPUTER SCIENCE
M.Sc., COMPUTER SCIENCE
PROGRAMME EDUCATIONAL OBJECTIVES
PEO1: Graduates will be able to perform in technical/managerial roles ranging from design,
development, problem solving to production support in software industries and Research and
development sectors.
PEO2: Graduates will have successful teaching/research careers in industry or academia and able to
establish companies or lead teams/organizations to solve society relevant problems.
PROGRAMME OUTCOME
PO1: Ability to discriminate, evaluate, analyze and synthesize existing and new knowledge, and
integration of the same for enhancement of knowledge in Computer Science and Applications.
PO2:Ability to apply usage of tools from optimization, probability, statistics, simulation, and
economic analysis, including fundamental applications of those tools in IT industry.
PO3: Ability to review and consolidate learning, to evaluate performance, to plan future learning
based on past learning experience and self-learning.
PO4: Ability to develop diverse technical knowledge and skills to formulate problems and projects
and to plan a process for solution including economic analysis for project which involving uncertainty
and scarce or expensive resources.
PO5: Demonstrate knowledge and understanding of the computing and management principles and
apply these to one’s own work, as a member and leader in a team, to manage projects and in
multidisciplinary environments.
PO6: Ability to possess knowledge and understanding of group dynamics, recognize opportunities
and demonstrate a capacity for self-management and teamwork, decision making based on open-
mindedness, objectivity and rational analysis in order to achieve common goals
2
D.K.M COLLEGE FOR WOMEN (AUTONOMOUS),
VELLORE-632001
DEPARTMENT OF COMPUTER SCIENCE
M.Sc., COMPUTER SCIENCE
With effect from 2019-2020

CBCS PATTERN
The course of study and scheme of Examination
SN PA COURSE Ins Cr Title of the paper MAXIMUM MARKS
RT TITLE
O /H edi
rs t
SEMESTER-I CIA UNI. TOTAL
EXAM
1 III Core(T) Paper-1 6 4 Enterprise Java 25 75 100
Programming
2 III Core(T) Paper-2 6 4 Linux Shell 25 75 100
Programming
3 III Core(T) Paper-3 6 4 Formal Languages 25 75 100
and Automata
theory
4 III Elective-I Paper-1 6 5 1. Big Data 25 75 100
2. Distributed
Computing
3.Computer
Architecture and
Parallel Processing.
5 III Core Practical-1 3 3 Enterprise Java 40 60 100
practical programming
6 III Core Practical-2 3 3 Linux Shell 40 60 100
practical Programming
3
TOTAL 30 23 180 420 600
Self Study Paper: R Programming during 1st Semester with extra Credit = 2
4
SEMESTER II CIA UNI.E TOTA
XAM L
7 III Core(T) Paper-4 6 4 JSP and Servlet 25 75 100
Programming
8 III Core(T) Paper-5 6 4 Advanced Database 25 75 100
Management
System
9 III Core(T) Paper-6 5 4 Principles of 25 75 100
Compiler Design
10 III Core Practical-3 3 3 JSP and Servlet 40 60 100
practical` Programming
11 III Core Practical-4 3 3 Advanced Database 40 60 100
practical Management
System
12 III Compulsor Paper 2 2 Human Rights 25 75 100
y paper
13 III Elective Paper-2 5 5 1.Computer 25 75 100
Networks
2.Object Oriented
Analysis & Design
3.Multimedia
TOTAL 30 25 205 495 700

Online Course during 2nd Semester extra credit = 2
Internship Training and Project during summer vocation with an extra credit = 3
5
SEMESTER III CIA UNI.E TO
XAM TAL
14 III Core(T) Paper-7 5 4 Enterprise 25 75 100
Application using C#
15 III Core(T) Paper-8 5 4 Mobile Computing 25 75 100
16 III Core(T) Paper-9 5 4 Machine Learning 25 75 100
and Python
Programmimg
17 III Core(P) Practical 5 3 3 Enterprise 40 60 100
Application using C#
18 III Core(P) Practical 6 3 3 Mobile Computing 40 60 100
and Python
19 III Elective Paper-3 5 5 1. Internet of Things 25 75 100
2. Software Testing
3.Embedded System
20 III Core Mini 4 4 Mini Project 40 60 100
Project
TOTAL 30 27 220 480 700
Self Study Paper: Robotics during 3rd semester with an extra credit = 2
SEMESTER-IV
21 III Elective Paper-4 5 5 Cryptography and 25 75 100
Network Security
22 III Core Major 25 10 Project with VivaVoce 50 150 200

Project
TOTAL - 15 75 225 300
6
TOTAL CREDITS
M.Sc (COMPUTER SCIENCE)
TOTAL TOTAL
SUBJECT PAPERS CREDIT CREDITS MARKS MARKS
MAIN (CORE) 9 4 36 100 900
ELECTIVE 4 5 20 100 400
MAIN
PRACTICAL 6 3 18 100 600
HUMAN RIGHTS 1 2 2 100 100
MINI PROJECT 1 4 4 100 100
MAJOR PROJECT 1 10 10 200 200
TOTAL 22 - 90 - 2300
7
ENTERPRISE JAVA PROGRAMMING
Semester Subject Category Lecture Hrs Theory Hrs Practical Credits
Code
Per Per Per Per Per Per
week Sem week Sem week Sem
I CORE 6 90 6 90 0 0 4
PAPER -1
COURSE OBJECTIVE
 This paper help us to understand the advanced level of enterprise java programming concept.
COURSE OUTCOME
successful completion of the course, students will be able to
CO Number CO Statement Knowledge Level
(K1-K4)
CO1 Understand the J2EE concepts K2
CO2 Deals with JSP Components K2
CO3 To learn Enterprise beans and web client usage K3
CO4 To apply Struts flow concept in real time application. K3
CO5 To analyze Hibernate in detail K4
Knowledge Level – K1-Remember, K2- Understand, K3-Apply, K4-Analyze
MAPPING WITH PROGRAMME OUTCOME

S- COS PO1 PO2 PO3 PO4 PO5 PO6
CO1 S S S S M S
CO2 S S M S S M
CO3 S S S M M S
CO4 S S S M S M
CO5 S M S S M M
Strong , M-Medium and L-Low
8
SYLLABUS
UNIT-I INTRODUCTION 18 Hrs
Introduction -Enterprise Architecture Styles - J2EE Architecture - Containers - J2EE Technologies - Developing
J2EE Applications - Naming and directory services - Using JNDI - Implementing the J2EE Specifications - J2EE
packaging and Deployment - J2EE packaging overview - Configuring J2EE packages
UNIT-II CONCEPT OF JSP 19 Hrs

JSP Benefits - Framework roles - Simple JSF application - User Interface Component Model - Navigational Model -
Life Cycle of JSF page - Using JSF in JSP Pages – Setting up a page, using core tags - using HTML tags - using
localized messages - Using converters.
UNIT-III INTRODUCTION TO ENTERPRISE BEANS 18 Hrs

Introduction to Enterprise Beans - Session Bean - Entity Bean - Message driven Bean - defining clients access with
interfaces - contents of an enterprise Bean - life cycle of enterprise Bean - creation of Enterprise Bean - application
client - web client - other Enterprise Bean features handling exceptions.
UNIT–IV STRUTS 17 Hrs

Struts Architecture - Struts classes - Action Forward, Action Form, Action Servlet, Action classes - Understanding
struts - Understanding Action Mappings, Struts flow with an example application.
UNIT-V HIBERNATE 18 Hrs

Hibernate - Architecture of Hibernate - Life cycle of Hibernate Entities- Exploring HQL - Understanding Hibernate
O/R Mapping - Collection Mapping - Association Mapping - Relationships in Java and Databases.
Distribution of Marks: Theory 80% and Applications: 20%
TEXT BOOKS
S.NO AUTHORS TITLE PUBLISHERS YEAR OF
PUBLICATION
1 Marty Hall, Larry Core Servlets and Java Server 2nd Edition, Pearson 2004
Brown Pages Education
2 Stephanie Bodoffetl The J2EE TM Tutorial Pearson Education, 2005
9
Second Edition
3 Minter Dave Linwood Jeff, “Beginning Apress, Second Edition 2006
Hibernate, From Novice to
Professional
REFERENCE BOOKS
PUBLICATION
1 Patrick Naughton& Herbert The Complete Tata McGraw Hill 1999
Schildt Reference: Java 2
2 Bruce W.Perry Java Servlet and JSP O'Reilly 2004.
Cook Book
WEB RESOURCES
1. http://www.tutorialspoint.com/hibernate/
2. https://javaee.github.io/tutorial/overview001.html
TEACHING METHODOLOGY
o Class room teaching & Group discussions
o Seminars & Smart Class room
o Chart/Assignment & Simulation Model
SYLLABUS DESIGNER
1.Ms. A.SIVASANKARI, HOD, Dept of Computer Science
2.Mrs. P.MOHANA LAKSHMI, Assistant Prof, Dept of Computer Science
3. Mrs. B.ARULMOZHI, HOD, Dept of Computer Applications
10
ENTERPRISE JAVA PROGRAMMING
Code
I CORE 3 4 0 0 3 45 3
(PRACT) - 1
COURSE OBJECTIVE
 This practical helps us to develop the projects using enterprise java programming concept.
SYLLABUS
1. Simple JSF application using JSP in JSF
2. HTML render kit in JSF
3. Core render kit in JSF
4. Creating Enterprise Bean
5. Creating Web Client
6. Using Session Bean
7. Struts Action
8. Struts Forward Action
9. Object Relational Mapping
10. Collection Mapping
Distribution of Marks: Program Output with Viva voce: 85% and Record:15%
SYLLABUS DESIGNER
1. Ms. A.SIVASANKARI, HOD, Dept of Computer Science
2. Mrs. P.SIVAGAMI, Assistant Prof, Dept of Computer Science
11
LINUX SHELL PROGRAMMING
Code
Per Per Per Per Sem Per Per
week Sem week week Sem
I CORE PAPER - 6 90 6 90 0 0 4
2
COURSE OBJECTIVE
 This paper help us to understand and make effective use of Linux utilities and Shell scripting language (bash)
to solve real time applications.
COURSE OUTCOME
CO CO Statement Knowledge Level
Number (K1-K4)
CO1 Understand about Linux history, Linux architecture, GNU, Free software K2
foundation.
CO2 Writing simple Shell scripts, Work with files using shell K3
Understand/Apply scripts.
CO3 Design and develop shell programming, communication, System calls and K2
terminology.
CO4 Understand about processes, process structure using shell K3
Understand/Apply Scripts
CO5 Understand sockets and Create network based Understand/Apply applications K4
using TCP and UDP sockets.
COS PO1 PO2 PO3 PO4 PO5 PO6
CO1 S S S M S M
CO2 S M S M M M
CO3 S M S S S S
CO4 S S M M S S
CO5 S S M S S S
S-Strong , M-Medium L-Low
12
SYLLABUS
UNIT I – BASICS OF LINUX OPERATING SYSTEM 19Hrs
Introduction to Linux System - History of Emergency – Features of Linux System – Hardware
Requirements for the Different Version of Linux - Architecture of Linux – Features of Kernal and Kernal
Shell Relationship – Linux File System – Features of Linux File System – File Types and Permissions –
Getting Started – Logging In/Out with the Concept of Home Directory – File Operation and Links –
Commonly Used Commands like grep, find, who, ls, pwd, mv, cd, df, cat, head, tail, sort, grip, chmode
and date.
UNIT II – LINUX COMMANDS 18 Hrs

Text Processing – Vi Editor – Vi Features – Vi Commands – Yanking, Running Shell Commands
from within Vi – Set Show Mode - Set Auto Indent – Set Number – Emacs Editor – Emacs Features –
Emacs Commands Using Cut, Paste And Copy In Emacs – Saving Buffer In Emacs.
UNIT III – SHELL PROGRAMMING 18 Hrs
Shell Programming – Features of Shell – Different Types of Shell – Shell Treatment to the
Command Line – The Environment – Set Setenv, Path, Home, Ifs, Mail, Ps1, Ps2, Term, Log Name,
Profile File, Login And Logout File – Setting Environment – Simple Shell Programs for, do, do while,
case, construct.
UNIT IV – WINDOWS OPERATING SYSTEM 17 Hrs

X-Windows – Microsoft Windows Versus X-Windows, Windows Manager – FVWM and FVWM
95 – Twn, The Client Server Model Of X-Windows – Starting and Stopping X-Windows Sessions.
UNIT V – GNOME AND KDE 18 Hrs

Gnome And KDE Desktop Environment – Starting the Gnome Desktop Environment – Gnome
Panel Using the Main System Menu – File Manager – Getting Help In Gnome Using the Gnome Control
– History of KDE Project – Starting the KDE Desktop Environment – Exploring the KDE Desktop –
KDE Main System Menu Using File Manager Window – Setting Wallpaper, Screensaver in KDE –
System Administration Of Linux – Red Hat Linux Installation.
13
TEXT BOOKS
PUBLICATION
1 Wale Soyinka. Linux Administration A Beginners Tata McGraw- 2009
Guide HilL
2 N.Matthew, Beginning Linux Programming Willey India 2009
R.Stones, Wrox,
Willey India
Edition.
3 Richard Petersen The Complete MC Graw Hill 2008

Reference
REFERENCE BOOK
PUBLICATION
1 Mark G. Sobell Practical Guide to Fedora Prentice Hall 2011
and Red
HatEnterpriseLinux
WEB RESOURCES
1.www.linuxhomenetworking.com
2. www.linux.com
SYLLABUS DESIGNERS
2. Ms. G.ARUNKUMARI, Assistant Prof, Dept of Computer Science
14
LINUX SHELL PROGRAMMING

Code
I CORE PRACT 3 45 0 0 3 45 3
-2
COURSE OBJECTIVE
 This practical helps us to develop the project related to linux operating system concept.
SYLLABUS
1.Prime Test.
2. Palindrome Test.
3. Fibonacci Series generation.
4. Armstrong No Test.
5. Solving Quadratic Equation.
6. Menu Driven Shell Script - Sort with various options.
7. User friendly change of modes (chmod).
8. Usage of case structures.
9. Process Scheduling.
a) FCFS
b) SJF
c) Priority
d) Round Robin
10. Inter process communications using message Queues & Pipes.
11. Using Pipes to calculate NCR.
12. Applications for functions, Procedures & Macros.
SYLLABUS DESIGNERS
2. Ms. G.ARUNKUMARI, Assistant Prof, Dept of Computer Science
15
FORMAL LANGUAGES AND AUTOMATA THEORY

Code
I CORE PAPER- 6 90 6 90 0 0 4
3
COURSE OBJECTIVE
 This course present the theory of finite automata, as the first step towards learning advanced topics, such as compiler design
Apply the concepts learned in fundamental courses such as Discrete Mathematics, in a theoretical setting; in particular, the
application of proof techniques.
COURSE OUTCOME
Successful completion of the course, students will be able to
(K1-K4)
CO1 The ability to prove results using proof by induction, proof by contradiction, K2
proof by construction.
CO2 Ability to describe various automata theoretic models for recognizing formal K2
languages and transform regular expressions and grammars.
CO3 Distinguish different computing languages and classify their respective K3
types.
CO4 Able to construct pushdown automata and the equivalent context free K4
grammars and prove the equivalence of the languages described by
pushdown automata and context free grammars.
CO5 Able to design Turing Machine and prove the equivalence of the languages K4
described by Turing machines.
CO1 S S S S S S
CO2 S M S S S M
CO3 S S S M S S
CO4 S S S S S S
CO5 S M S M S M
S-Strong , M-Medium and L-Low
16
FORMAL LANGUAGES AND AUTOMATA THEORY
SYLLABUS
UNIT-I FUNDAMENTALS 18 Hrs
Fundamentals - String, Alphabets, Operations, Finite State Machine – Definitions, Divisibility by Three Tester -
Set Theory – Relations – Functions - Counting Techniques –Logic - Methods of Proof.
UNIT–II FINITE AUTOMATA 18 Hrs

Finite Automata –Deterministic and Nondeterministic Finite Automata – Equivalence of NFA and DFA – Finite
Automata with Outputs – Finite Automata with Null Moves – Finite Automata and Sequential Circuits
UNIT - III CLASSIFICATION OF GRAMMERS 19 Hrs

Chomsky classification of grammars -Regular Expression – Relation between Regular languages and Finite
Automata- Closure Properties – Automata for Union, Intersection and Difference of Languages – Context free
grammars – Normal forms for Context Free Grammar – Parse Trees – Ambiguity Grammars – Removing
Ambiguity from Grammars
UNIT-IV BASIC STRUCTURE OF PDA 17 Hrs

Basic Structure – Types of Acceptance by PDA – Correspondence between PDA and CFL – Parsing and PDA -
Languages of PDA – Equivalence of PDA and CFG – Deterministic PDA
UNIT-V BASIC STRUCTURE OF TM 18 Hrs

Basic structure of TM – Instantaneous Description of Turing Machine – Language of TM – Turing Machine as
Computer for Positive Integer- Universal Turing Machine – Turing Machine for 1’s Complement, 2’s
Complement- TM for Well Formed Parenthesis – TM for Unary addition and Multiplication – TM for Palindrome
Recognition – TM for GCD – TM for 0n1n.
Distribution of Marks: Theory 70% and Problem 30%
17
TEXT BOOKS
S. NO AUTHORS TITLE PUBLISHERS YEAR OF
PUBLICATION
1 C.K. Nagpal Formal Languages and Automata Oxford University 2013
Theory Press
2 Hopcroft and Introduction to Automata Theory, Narosa Publishing 2002
Languages and
Ullman House, Delhi.
Computation
3 E.V. Theory of East West Press Pvt. 1985
Computer Science
Krishnamurthy Ltd.
REFERENCE BOOKS
S. NO AUTHORS TITLE PUBLISHERS YEAR OF
PUBLICATION
1. Juruj Hromkovic Theoretical computer Science Springer Indian Reprint 2010
2. John E.Hocroft Introduction to Automata Theory, Paperback 2008
Languages and Computation
3. K.V.N. Sunitha Formal Languages and Automata Paperback 2015
Theory
4 A.A Puntambekar Formal Languages and Automata Paperback 2015
Theory for JNTU
WEB RESOURCES
1. www.nptel.ac.in
2. https://www.geeksforgeeks.org/theory-of-computation-automata-tutorials/
SYLLABUS DESIGNERS
2. Mrs. G.SANGEETHA LAKSHMI Assistant Prof, Dept of Computer Applications
18
BIG DATA
Code
I ELECTIVE - 1 5 75 5 75 0 0 5
COURSE OBJECTIVE
This course aims at facilitating the student to explore and understand the Big data platform, its architecture and its
technology foundations. Work on hadoop platform. Perform mining and analysis on massive data using certain
techniques. Also perform analysis through mining techniques.
COURSE OUTCOME

Number (K1-K4)
CO1 Understanding the Needs of big data K2
CO2 Developing map reduce concepts. K3
CO3 Analyzing the mining of data stream concept. K3
CO4 Evaluate the relationships or connections between network nodes. K4
CO5 The Concept of Big Data as Presented Through Social Media. K4

CO1 S S S M M M
CO2 S S S S S M
CO3 S M S M S S
19
CO4 S S M S M S
CO5 S S M M S S
S-Strong, M-Medium and L-Low
SYLLABUS
UNIT I: INTRODUCTION TO BIG DATA 15 Hrs

Introduction to Big Data- Big Data Characteristics- Types of Big Data- Traditional Versus Big Data Approach -
Technologies Available for Big Data – Hadoop – Introduction - What is Hadoop? - Core Hadoop Components -
Hadoop Ecosystem - Physical Architecture - Hadoop Limitations
Unit II: HADOOP AND MAPREDUCE 12 Hrs
MapReduce - MapReduce and The New Software Stack- MapReduce- Algorithms Using MapReduce -
Finding Similar Items – Introduction - Nearest Neighbor Search - Applications of Nearest Neighbor
Search- Similarity of Documents - Collaborative Filtering as a Similar-Sets Problem - Recommendation
Based on User Ratings- Distance Measures.
UNIT III: MINING DATA STREAMS 16 Hrs

Mining Data Streams – Introduction- Data Stream Management Systems- Data Stream Mining -
Examples of Data Stream Applications - Stream Queries- Issues in Data Stream Query Processing -
Sampling in Data Streams - Filtering Streams - Counting Distinct Elements in a Stream- Querying on
Windows − Counting Ones in a Window -Decaying Windows.
UNIT IV: LINK ANALYSIS 18 Hrs

Link Analysis - Introduction- History of Search Engines and Spam –PageRank - Efficient Computation
of PageRank - Topic-Sensitive PageRank- Link Spam- Hubs and Authorities Recommendation Systems
- Introduction - A Model for Recommendation Systems - Collaborative-Filtering System - Content-
Based Recommendations - Mining Social Network Graphs .
UNIT V: APPLICATIONS OF SOCIAL NETWORK MINING 14 Hrs
20
Introduction - Applications of Social Network Mining - Social Networks as a Graph - Types of Social
Networks - Clustering of Social Graphs - Direct Discovery of Communities in a Social Graph - Sim
Rank-Counting Triangles in a Social Graph
Distribution of Marks: Theory 70% and Applications 30%
TEXT BOOKS
S. AUTHORS TITLE PUBLISHERS YEAR OF
NO PUBLICATION
1 Radha Shankarmani, Big Data Analytics Wiley Publications, first 2016
M Vijayalakshmi Edition,
REFERENCE BOOKS
NO PUBLICATION
1 Seema Acharya, Big Data and Analytics Wiley Publication first Reprint in 2016
Subhashini edition
Chellappan
2 Hive, Yarn, Black Book- Big DT Editorial Services 2016
PIG, Data(Covers Dream techPress edition
Hadoop,MapReduce,
R, Data visualization)
WEB RESOURCES
1. https://www.sas.com/en_us/insights/big-data/what-is-big-data.html
2. https://www.tutorialspoint.com/big_data_tutorials.htm
SYLLABUS DESIGNERS
21
2. Mrs. M.MALATHI Assistant Prof, Dept of Computer Applications
DISTRIBUTED COMPUTING
Code
I ELECTIVE - 1 5 75 5 75 0 0 5
COURSE OBJECTIVE
 To Know about the network Concept and Gain the knowledge in developing the System using Distributed Concept .
COURSE OUTCOME
(K1-K4)
CO1 To learn the characteristics, examples and design issues, trends related to K2
distributed systems
CO2 Develop Inter Process Communication K3
CO3 To learn about synchronization and deadlock concept with real time K3
example.
CO4 To apply process allocations using thread based techniques. K4
CO5 Implement a distributed file system for a given Operating System. K4

CO1 S M M M S S
22
CO2 S S M S S M
CO3 S S S M M S
CO4 S S S M S M
CO5 S S S M S S
SYLLABUS
UNIT – I INTRODUCTION TO DISTRIBUTED COMPUTING 15 HRS
Introduction – Goals - Hardware Concepts – Software Concepts – Design Issues: Transparency –
Flexibility – Reliability – Performance – Scalability.
UNIT – II COMMUNICATION IN DISTRIBUTED SYSTEM 16 HRS

Communication in Distributed Systems – The Client – Server Model – Addressing – Types of
Primitives – Implementation – Group Communication – Introduction – Design Issues – Group
Communication in ISIS.
UNIT – III SYNCHRONIZATION 14 HRS

Synchronization in Distributed Systems – Clock Synchronization – Mutual Exclusion – Election
Algorithms – Deadlocks.
UNIT – IV PROCESS IN DISTRIBUTED SYSTEM 15 HRS

Process and Processors in Distributed Systems – Threads – Processor Allocation – Scheduling –
Fault Tolerance.
UNIT – V DISTRIBUTED FILE SYSTEM 15 HRS

Distributed File System – Design – Implementation – Trends in Distributed File Systems.
TEXT BOOKS
NO PUBLICATION
1 Andrew S Tanebaum Distributed Operating PHI/Pearson Education Pte. 2006
23
Systems Ltd., New Delhi
REFERENCE BOOKS
NO PUBLICATION
1 George Coulouris, “Distributed Systems Concepts Fifth edition 2011
Jean Dollimore, Tim and Design”
Kindberg
2 Liu M.L., “Distributed Computing, Pearson Education 2007
Principles and Applications
WEB RESOURCES
1. https://whatis.techtarget.com/definition/distributed-computing
2. https://computing.llnl.gov/tutorials/parallel_comp/
 Class room teaching & Group discussions
 Seminars & Smart Class room
 Chart/Assignment & Simulation Model
SYLLABUS DESIGNERS
2. Mrs. V.LAKSHMI PRATHA Assistant Prof, Dept of Computer Science
24
COMPUTER ARCHITECTURE AND PARALLEL PROCESSING
Code
I ELECTIVE - 1 5 75 5 75 0 0 5
COURSE OBJECTIVE
 This paper helps us to understand the advanced level of Computer Architecture and Parallel Processing.
COURSE OUTCOME
(K1-K4)
CO1 To learn about computer architecture and different types of processing. K2
CO2 To understand the principles of pipeline processors and vectors K3
processing.
CO3 Implementation of SIMD and associative array processing. K2
CO4 To learn about the multiprocessor architecture and programming. K3
CO5 Understanding and Analyzing Multi-process Scheduling Algorithms K4

CO1 S M S S M M
25
CO2 S S S M S M
CO3 S S M S M M
CO4 S S S M S S
CO5 S M S M S M
SYLLABUS
UNIT I – COMPUTER ARCHITECTURE INTRODUCTION 16 Hrs
Introduction - Evolution of Computer systems - Trends of Parallel Processing - Parallelism in
Uniprocessor Systems - Architecture, Mechanisms, Multiprogramming and Timesharing - Parallel
Computer Structures - Pipeline, Array, Multiprocessor, Performance of Parallel computer, Data Flow -
Architectural Classification - Applications.
UNIT II – PARALLEL PROCESSING 16 Hrs

An Overlapped Parallelism - Instruction and Arithmetic Pipelines - Principles of Designing Pipeline
Processors - Instructions Prefetch and Branch Handling, Data Buffering and Busing Structures – Job Sequencing and
Collision Prevention - Vector Processing Requirements - Characteristics of Vector Processing, Pipelined Vector
Processing Methods.
UNIT III – PROCESSORS 14 Hrs

SIMD Array Processors - SIMD Interconnection Networks - Associative Array Processing.
UNIT IV – MULTIPROCESSOR ARCHITECTURES 14 Hrs

Multiprocessor Architecture and Programming: Functional Structures- Interconnection Networks- Parallel
Memory Organization.
UNIT V - MULTIPROCESSOR OPERATING SYSTEMS 15 Hrs

Multiprocessor Operating Systems- Interprocessor Communication Mechanisms-Multiprocessor Scheduling
Strategies-Parallel Algorithms for Multiprocessors.
26
TEXT BOOKS
NO PUBLICATION
1 Kai Hwang, Faye A. Computer Architecture and McGraw Hill book 1985
Briggs Parallel Processing company
2 John P. Hayes Computer Architecture and MCH 1988
Organization
REFERENCE BOOKS
NO PUBLICATION
1 V. Rajaraman, C. Parallel Computers Architectures PHI 2003
Sivaram Murthy and Programming
2 Michael J. Quinn Parallel computing theory and Tata McGraw Hill 2002
practice
3 Wilkinson, Michael Parallel programming: techniques Prentice hall 1999
Allen and Applications
WEB RESOURCES
1. https://www.class-central.com/course/nptel-computer-organization-and-architecture-a-pedagogical-aspect-9824
3. https://www.mooc-list.com/tags/parallel-programming
a. Class room teaching & Group discussions
b. Seminars & Smart Class room
c. Chart/Assignment & Simulation Model
SYLLABUS DESIGNERS
2. Mrs. S.SHANTHI Assistant Prof, Dept of Computer Science
27
R PROGRAMMING
Code
I SELF STUDY 0 0 0 0 0 0 2
PAPER
COURSE OBJECTIVE
 This paper helps us to develop the skill in R programming.
COURSE OUTCOME
(K1-K4)
CO1 Learning about history of R programming language K1
CO2 Remembering Data types and various operations in R. K2

CO3 Understand Control structures and functions in R K3
CO4 Apply the R tools Concept in Real life. K3
CO5 Implement R concept in various application program. K4
28
CO1 S M M M M M
CO2 S S S M S M
CO3 S S S M S S
CO4 S S S S S S
CO5 S M S M S S
SYLLABUS
UNIT -1 HISTORY OF R
Introduction: Overview and History of R, Getting Help
UNIT – 2 DATA TYPES AND OPERATIONS

Data Types, Subsetting, Vectorized Operations, Reading and Writing Data
UNIT – 3 CONTROL STRUCTURES AND FUNCIONS

Control Structures, Functions, la pply, tapply, split, mapply, apply, Coding Standards.
UNIT-4 TOOLS IN R
Scoping Rules, Debugging Tools, Simulation, R Profiler
UNIT-5 PROGRAMS
1.Write a program that prints ‘Hello World’ to the screen.
2. Write a program that asks the user for a number n and prints the sum of the numbers 1 to n
3. Write a program that prints a multiplication table for numbers up to 12.
4. Write a function that returns the largest element in a list.
5. Write a function that computes the running total of a list.
6. Write a function that tests whether a string is a palindrome
29
TEXT BOOKS
NO PUBLICATION
1 W. N. Venables, D. M. An Introduction to R R-core team 2015
Smith
WEB RESOURCES
https://www.guru99.com/r-tutorial.html
TEACHING METHODOLOGY – SELF STUDY
SYLLABUS DESIGNERS
JSP AND SERVLET PROGRAMMING

Code
II CORE PAPER - 4 6 90 6 90 0 0 4
COURSE OBJECTIVE
 This paper helps us to develop the projects in Web Application using JSP and Servlets.
COURSE OUTCOME
(K1-K4)
CO1 Basic details of Java Script, Functions and Objects. K2
CO2 Develop JDBC Connections and RMI Architecture. K3
CO3 Design and implement JSP Programs. K3
CO4 Implement Servlet programs and attributes in web applications. K3
CO5 Identify Web application framework using Structs. K4
30
CO1 S M M M M M
CO2 S S S M S M
CO3 S S S M S S
CO4 S S S S S S
CO5 S M S M S S
SYLLABUS
UNIT-I JAVA SCRIPT 17 Hrs
Introduction to JavaScript - Operator - Conditional Structure & Looping – Structure - Dialog Boxes – Arrays- User
Define Function - Built-in Functions: String Functions, Math Functions, Date Functions – Array: Join, reverse, pop, push,
shift, sort- User Define Object, Document Object, History Object, Navigator Object, Form Object & Elements- Events.
UNIT-II DATA BASE PROGRAMMING WITH JDBC 18 Hrs
Introduction and Need for JDBC - Database Drivers -JDBC APIs for database Connectivity (Java. sql Package)
Connection - Statement -Prepared statement - Callable statement - Result set -Other JDBC APIs -Database Meta Data -
Result Set Meta Data-Distributed Computing Using RMI: Introduction to RMI - RMI Architecture - Stubs and Skeleton.
UNIT-III JSP PROGRAMMING 19 Hrs
JSP development, Basic JSP Lifecycle, JSP Elements, Directive Elements, Page Directive, Include directive, Scripting
elements, Declaration, Scriptlets, Expressions, Action elements, Standard action, <jsp : param> ,<jsp : include> ,<jsp :
forward> ,<jsp : plugin> ,Comments and template data ,Scope of JSP variables, Page, Request, Session, Application
Using implicit ,objects ,The request object ,The response object ,The out object ,The session object ,The config
object ,The exception object ,The application object ,Handling Errors and Exception -Dealing with exception in the page
& directive, Dealing with exception in the Deployment Descriptor ,Adding exception handling in JSP, pages, Including
and forwarding from -JSP ,pages ,Include Action ,Forward Action.
UNIT–IV SERVLET PROGRAMMING 19 Hrs
Introduction to Servlets, Servlets Implementation, The servlet interface, The Generic Servlet class, The single thread
Model interface, The Http Servlet class, Service(), doGet(), doPost(), doDelete ) ,doOption(), doPut(), doTrace(), Servlet
Exceptions, The Servlet Exception class- The unavailable Exception class ,Servlet Lifecycle ,Servlet Request and
Response ,The Http Servlet Request interface, GetAttribute(), setAttribute(), getAttributeNames(), getparameters(),
getParameternames(), getParameterValues(), getRemoteHost(), getRemoteAddr(), getCookies(), getHeaders(),
getQueryString(), getSession(), The Http servlet Response Interface, getWriter(), getcontentType() ,addCookie(),
encodeURL(), sendRedirect(), setHeader( ), setStatus(), Session Tracking Approaches, URL Rewriting, Hidden Form
Fields Cookies, Session API, Session Tracking with Servlet API, The Http Session interface, GetAttribute(),
GetAttributeNAmes() ,GetCreationTime(), GetId(), GetlastAccessedTime(), IsNew(), RemoveAttribute(),
SetAttribute() ,SetMaxInactiveinterval(), Invalidate(), Servlet Collabration, Request Dispatching with Request,
31
Dispatcher interface Forward(), Include(), Servlet Context, The servlet Context interface, getContext(),
getRequestDispatcher(), getServerInfo(), getInitParameter(), getInitParameterNames(), getAttribute(),
removeAttribute( ) .
UNIT-V INTRODUCTION TO STRUCTS 16 Hrs

A Web Application Framework - struts-config.xml; Understanding MVC architecture; ActionServlet, ActionForm,
ActionMapping, Actionclasses.
JSP Expression Language: EL Introduction, EL Implicit Objects, EL Operators, EL Functions. JSP Standard Tag
Library:JSTL Introduction, core tags, xml tags, sql tags, fmt tags, Core tags, <c : out>, <c : set> ,<c : if>, SQL tags, <sql :
query>, <sql : update>, Fmt tags, <fmt : formatNumber>, <fmt : formatDate>.
Practical For Classes :
1.Individual project development was done.
TEXT BOOKS
NO PUBLICATION
1 Horstman and Cornell Core Java Volume-I Pearson Education 2010
2 Horstman and Cornell Core Java Volume-II Pearson Education 2013
3 Pekowsky Java Server Pages Pearson Education 2013
REFERENCE BOOKS
NO PUBLICATION
1 Dustin R.Callway Inside Servlets Pearson Education 2011
2 James Goodwill Developing Java Servlets Techmedia Education 2014
3 Sebesta Programming world wide Pearson Education 2015
web.
4 Murach Java JDK5 Murach Education 2011
WEB RESOURCES
3. https://www.mooc-list.com/tags/parallel-programming
a. Class room teaching & Group discussions
b. Seminars & Smart Class room
c. Chart/Assignment & Simulation Model
32
SYLLABUS DESIGNERS

2. Mrs. R.LAKSHMI Assistant Prof, Dept of Computer Science
JSP AND SERVLET PROGRAMMING

Code
II CORE PRACT-3 3 45 3 45 0 0 3
COURSE OBJECTIVE
 This practical helps us to develop the projects in Web Application using JSP and Servlets.
SYLLABUS
1. Create a web page with all types of Cascading style sheets.
2. Client Side Scripts for Validating Web Form Controls using DHTML
3. Write programs in Java to create applets incorporating the following Features:
i) Create a color palette with matrix of buttons
ii) Set background and foreground of the control text area by
Selecting a color from color palette.
iii) In order to select Foreground or background use check box
Control as radio buttons and to set background images.
4. Write programs in Java using Servlets:
33
i) To invoke servlets from HTML forms ii) To invoke servlets from Applets
5. Write programs in Java to create three-tier applications using JSP and Databases
i) For conducting on-line examination. ii) For displaying student mark list.
Assume that student information is available in database, it has been stored in database server.
6.Programs using AJAX.
7.Consider a case where we have two web Services- an airline service and a travel agent and the travel agent is
searching for an airline. Implement this scenario using Web Services and data base
SYLLABUS DESIGNERS
2. Mrs. R.SHOBANA Assistant Prof, Dept of Computer Applications
ADVANCED DATABASE MANAGEMENT SYSTEM

Code
II CORE PAPER - 5 6 90 6 90 0 0 4
COURSE OBJECTIVE
 This paper help us to gain the knowledge for creating the large Data Base and plays a major role for maintaining the Data
Base.
COURSE OUTCOME
Number (K1-K4)
CO1 To learn the fundamentals of data models and to represent a database K3
system using ER diagrams.
CO2 To study SQL and relational database design. K2
34
CO3 To understand the internal storage structures using different file and K3
indexing techniques which will help in physical DB design
CO4 To understand the fundamental concepts of transaction processing K4
concurrency control techniques and recovery procedures.
CO5 To have an introductory knowledge about the Data warehouse storage. K4
CO1 S M S M S S
CO2 M S S S S M
CO3 S S S M S S
CO4 S M S M S M
CO5 S M S M S M
SYLLABUS
UNIT I – INTRODUCTION TO DBMS 17 Hrs
Advantages and components of a database management systems - Feasibility Study - Class Diagrams - Data
Types - Events - Normal Forms - Integrity - Converting Class Diagrams to Normalized tables - Data Dictionary.
UNIT II – BASICS OF SQL QUERIES 19 Hrs
Query Basics - Computation using queries - Subtotals and GROUP BY commands - Queries with Multiple
tables - Sub queries - Joins - DDL & DML - Testing Queries.
UNIT III – FORMS AND REPORTS 18 Hrs
Effective Design of forms and reports - Form Layout - Creating Forms - Graphical Objects - Reports
- Procedural Languages - Data on Forms - Programs to Retrieve and save Data - Error handling.
UNIT IV – APPLICATION AND ITS OPERATIONS 17 Hrs

Power of application structure - User Interface Features - Transactions - Forms Events - Custom reports -
Distributing Applications - Table Operations - Data Storage methods - Storing Data Columns - Data Clustering and
partitioning.
UNIT V – DATABASE ADMINISTRATION 19 Hrs
Database Administration - Development Stages - Application types - backup and recovery - Security and
Privacy - Distributed databases - Client/Server Databases - Web as a Client/Server System - Object Oriented
35
Databases - Integrated Applications.
Practical For Classes :
1.Individual project development was done.
TEXT BOOKS

NO PUBLICATION
1 Gerald V. Post Database management Systems-- Mc Graw hill 1999
Designing and building Business International Edition
Applications
REFERENCE BOOKS
NO PUBLICATION
1 Abraham Silberschatz Database System McGraw-Hill 2006.
Henry F. Korth and S. Concepts
Sudarshan
2 Raghu Ramakrishnan Database WCB / Mc Graw Hill 1998
management Systems
WEB RESOURCES
1. https://www.tutorialspoint.com/dbms/
2. https://www.w3schools.in/dbms/
SYLLABUS DESIGNERS
2. Mrs. S.ANGEL RABECCA Assistant Prof, Dept of Computer Science
36
ADVANCED DATABASE MANAGEMENT SYSTEM

Code
II CORE PRACT-4 3 45 3 45 0 0 3
COURSE OBJECTIVE
 This practical helps us to develop the real time projects in VB with oracle.
SYLLABUS
Students are advised to use the concepts like Data Normalization, Link between table by means of Foreign
keys and other relevant database concepts for developing databases for following problems. The implementation of
each problem should have necessary input screen Menu-driven query processing and pleasing reports. The choice or
RDBMS is left to the students. Necessary validations must be done after developing database.
1. Library Information Processing
2. Telephone Directory maintenance
3. Gas Booking and delivering system
4. Electricity Bill Processing
5. Pay roll Processing
6. Personal Information System
37
7. Question Database and Conducting quiz
SYLLABUS DESIGNERS:
2. Ms.P.SIVAGAMI Asst. Prof, Dept of Computer Science
3. Mrs. B. ARULMOZHI, HOD, Dept of Computer Applications
PRINCIPLES OF COMPILER DESIGN

Code
II CORE PAPER - 6 5 75 5 75 0 0 4
COURSE OBJECTIVE
 This paper helps the students to know about how to compile and parsing the software programs.
COURSE OUTCOME
(K1-K4)
CO1 Understand the phases and tools available in compiler K2
CO2 Design and implement a lexical analyzer K3

CO3 Compare and analyze different types of compilers K4
CO4 Specify appropriate translations to generate Intermediate code for the K3

given Programming language Construct
CO5 Identify sources for Code Optimization K4
38
CO1 S M M S S M
CO2 S S S M M S
CO3 S S S S S M
CO4 S S S S M M
CO5 S S S M S S
SYLLABUS
UNIT I – INTRODUCTION TO COMPILERS 14 Hrs Introduction to
compiling - Compilers - Analysis of the source program - Phases of a compiler. Grouping of Phases - Compiler
construction tools.
UNIT II – LEXICAL ANALYSIS 15 Hrs
Lexical Analysis - Role of the lexical Analyzer - specification and Recognition of tokens - Language for
specifying lexical Analyzer - Finite Automata -regular expression to NFA - Design of lexical Analyzer
generator - Optimization of DFA - based pattern matchers.
UNIT III – SYNTAX ANALYSIS 15 Hrs

Syntax Analysis - Role of parser - context free grammars - Top down parsing - Bottom up parsing - Operator
precedence parsing - LR Parsers.
UNIT IV – SYNTAX DIRECTED TRANSLATION 15 Hrs

Syntax Directed Translation: Syntax directed Definitions - construction of syntax trees - Bottom up evaluation of
attributed definition - Bottom up evaluation of inherited attributes - Recursive evaluators.
UNIT V -INTERMEDIATE CODE GENERATION AND OPTIMIZATION 16 Hrs
Intermediate Code generation: Intermediate languages - Declaration - Assignment statements. Procedure calls -
Runtime storage management. Code generation and optimization: Basic blocks and Flow graphs - DAG
representation.
TEXT BOOKS
39
NO PUBLICATION
1 Alfred Aho Ravi Sethi Compilers- Pearson 1986
Jeffy D.Ullman Principles,Techniqu
es and Tools
2 Dick Grune, Bal, Modern Compiler Wiley 2012

Langendoen,Jacobs Design
3 K.Muneeswaran Compiler Design Oxford University Press 2013
REFERENCE BOOKS
NO PUBLICATION
1 David Galles Modern Compiler design Pearson education Asia 2001
2 Steven S. Muchnick Advanced Compiler Design Morgan Kaufmann 2000
and implementation Publishers
3 C.N.Fisher R.J.Le Crafting a compiler with c Pearson Education 2000
Blanc
WEB RESOURCES
1.https://www.geeksforgeeks.org/compiler-lexical-analysis
2.
1. https://ieeexplore.ieee.org/document/7779385/
3.https://www.tutorialspoint.com/compiler_design/compiler_design_tutorial.pdf TEACHING METHODOLOGY
SYSTEM DESIGNER
40
1. Ms.A.SIVASANKARI, HOD, Dept of Computer Science
2. Mrs. K.AYESHA Asst Prof, Dept of Computer Applications
3. Mrs. B.ARULMZOHI, HOD, Dept of Computer Applications
COMPUTER NETWORKS
Semester Subject Category Lecture Hrs Theory Hrs Practical Credit
Code s
II ELECTIVE -II 5 75 5 75 0 0 4
COURSE OBJECTIVE
 The course provides the overviews learning about computer network organization and implementation,
obtaining a theoretical understanding of data communication.
COURSE OUTCOME
Number (K1-K4)
CO1 Learning the fundamental concepts of computer K2
41
networking.
CO2 To familiarize the student with the basic taxonomy and terminology K3
of the transmission medium.
CO3 Analyse the technique of error detection and correction K2
CO4 Understanding the importance of routing algorithms K3
CO5 To learn about networking and internetworking devices K4
CO1 S M S M S S
CO2 S S M M S M
CO3 S M S M S S
CO4 S S M S M S
CO5 S S S M M S
SYLLABUS
UNIT I - BASICS OF COMPUTER NETWORKS 14 Hrs
Introduction to computer networks - Uses of network-Network structure - The OS1 reference model
concepts-Layers of the OSI model.
UNIT II – TRANSMISSION MEDIUM 16 Hrs
The Physical layer-Different types of transmission medium-CODEC-Switching techniques-Channel

allocation methods-ALOHA protocol-LAN protocol (any one protocol)-IEEE standards 802.3,802.4 and
802.5.
UNIT III – DATA LINK LAYER 15 Hrs
The data link layer - design issues-Concept of framing - Different methods - Error detection and
correction: Single error correction and cyclic redundancy check.
42
UNIT IV – NETWORK LAYER 14 Hrs
The network layer-design issues-Internal organization of network layer - Congestion control

algorithm, Leaky bucket algorithm and token bucket algorithm - Dijikstra routing algorithm.
UNIT V – OSI LAYERS 16 Hrs
Repeaters, Bridges, Routers and Gateways-Brief introduction to the transport layer, session layer,
presentation layer and application layer-Basic concepts of Internet WWW.
TEXT BOOKS
NO PUBLICATION
1 James F. Kurose and Computer Networking Pearson Education 2006
Keith W. Ross
2 Andrew S. Computer Networks 4th edition, Prentice-Hall 2003
Tanenbaum of India.
3 Charles P.fleeger, Security in Computing Pearson Education, 2013
S.L.Pfleeger Fourth Edition,
REFERENCE BOOKS
NO PUBLICATION
1 Achyut Godbole Data Communication and Tata McGraw Hill 2007
Networks Publicatons
2 Uyless Black Computer Networks PHI, 2010.
Protocols, Standards, and Second Edition
Interfaces
3 Sarma.C.R Computer Networks Jaico Publishing Home, 2005.
Pragmatic Approach
WEB RESOURCES
1.
https://www.studytonight.com/computer-networks/
2.https://www.tutorialspoint.com/data_communication_computer_network/
43
SYSTEM DESIGNER
2. Ms.P.RAMYA Asst Prof, Dept of Computer Science
OBJECT ORIENTED ANALYSIS AND DESIGN

Code
II ELECTIVE -II 5 75 5 75 0 0 4
COURSE OBJECTIVE
 The course provides Understand the importance and basic concepts of object oriented modelling, Specify,
analyze and design the use case driven requirements for a particular system.
COURSE OUTCOME
44
(K1-K4)
CO1 Analyse, design, document the requirements through use case K2
driven approach.
CO2 Identify, analyse, and model structural and behavioral concepts of K3
the system
CO3 Design the process into various scenarios and applications K3
CO4 Apply the concepts of architectural design for deploying the code for K4
software.
CO5 Continuous testing of process and debugging principles K4
CO1 S S S M S M
CO2 S S M S S M
CO3 S S S M S S
CO4 S S S S M S
CO5 S S S S M S
S- Strong; M- Medium; L- Low
SYLLABUS
UNIT I – OVERVIEW OF OOS DEVELOPMENT 15 Hrs
Object Orientation – System development – Review of objects – inheritance – Object relationship –
Dynamic binding – OOSD life cycle – Process – Analysis – Design – prototyping – Implementation – Testing-
Overview of Methodologies.
UNIT II – OBJECT ORIENTED METHODOLOGIES 14 Hrs

OMT – Booch methodology, Jacobson methodology – Patterns – Unified approach – UML – Class diagram –
Dynamic modeling.
45
UNIT III – USECASE MODELS 15 Hrs
Use case model – Creation of classes – Noun phrase approach – responsibilities – Collaborators – Object
relationships – Super-Sub class – Aggregation.
UNIT IV – OBJECT ORIENTED DESIGN 16 Hrs

Object oriented Design axioms – Class visibility – Refining attributes – Methods –Access layer – Object
oriented DBMS – Table – class mapping view layer
UNIT V – SOFTWARE QUALITY ASSURANCE 15 Hrs

Quality assurance testing – Inheritance and testing – Test plan – Usability testing User satisfaction – Testing.

TEXT BOOKS

NO PUBLICATION
1 Ali Bahrami Object Oriented Systems McGraw Hill International 1999
Development Edition
REFERENCE BOOK
NO PUBLICATION
1 Grady Booch Object Oriented Analysis Person Education-2nd 2011
and Design Edition
2 Carol Britton and Jill Object Oriented System Paperback 2012
Doake Development: A Gentel
Introduction
3 David West and Brett Head First Object Oriented Kindle Edition 2011
McLaughlin Analysis and Design
WEB RESOURCES
1. https://www.tutorialspoint.com/object_oriented_analysis_design/
2. https://www.startertutorials.com/uml/category/ooad
46
SYSTEM DESIGNER
2. Mrs. R.SHOBANA Asst Prof, Dept of Computer Applications
MULTIMEDIA
Code
II ELECTIVE -II 5 75 5 75 0 0 4
COURSE OBJECTIVE
 The course provides to develop the Graphics skill and to develop the Creativity thoughts for doing animation.
COURSE OUTCOME
47
(K1-K4)
CO1 To Develop an Understanding and Awareness of K1
Motion,sound,design and Technology
CO2 To study the Basic tools of Multimedia, Various Software programs K2
used in the creation and implementation of multi media.
CO3 To Study the Text and sound K3
CO4 To understand the Graphics and transformation K3
CO5 To have an introductory knowledge about Planning and costing K4
CO1 S S S M M S
CO2 M S M M S S
CO3 S S M M S S
CO4 S M S S M M
CO5 S M S S M S
SYLLABUS
UNIT I – INTRODUCTION TO MULTIMEDIA 14 Hrs
Definition – Classification – Multimedia application – Multimedia H/W – Multimedia S/W –
CDROM – DVD.
UNIT II - MULTIMEDIA AUDIO 15 Hrs

Digital medium – Digital audio technology – Soundcards – recording – editing – MP3 – MIDI
Fundamentals – Working with MIDI – audio file formats – adding sound to MM Project.
UNIT III - MULTIMEDIA TEXT 16 Hrs

Text in Multimedia – Multimedia graphics: Coloring – digital imaging fundamentals – development
and editing – file formats – Scanning and Digital Photography.
48
UNIT IV - MULTIMEDIA ANIMATION AND VIDEO 16 Hrs
Computer animation fundamentals – Kinematics – Morphing – animation s/w tools and techniques.
How Video works – Board cast video standards – Digital video fundamentals – Digital video Production
and Editing techniques – file formats.
UNIT V - MULTIMEDIA PROJECT 14 Hrs

Stages of Project – Multimedia skills –Design concept – authoring – Planning and Costing –
Multimedia team.
Distribution of Marks: Theory 85% and Application Oriented 15%
TEXT BOOKS
NO PUBLICATION
1 Tay Vaughan Multimedia: Making it work Fourth Edition 1999
2 John F Koegel Multimedia System First Indian Reprint 2000
Buford
REFERENCE BOOKS
NO PUBLICATION
1 Brusilovsky,Peter The Adaptive Web Berlin Springer 2007
2 Christopher Introduction to information Cambridge University 2008
D.Manning Retrievel Press
WEB RESOURCES
1. https://www.enggedu.com
2. https://multimedia.journalism.berkeley.edu/tutorials/
49
SYSTEM DESIGNER
2. Mrs S.ANGEL RABECCA Asst Prof, Dept of Computer Science
ENTERPRISE APPLICATIONS USING C#

Semester Subject Category Lecture Theory Hrs Practical Credits
Code Hrs
week sem week sem week sem
III CorePaper-7 5 75 5 75 0 0 4
COURSE OBJECTIVE
➢ The course provides Understand the importance and basic concepts of enterprise
Applications using C#.
➢ To Specify , analyze and design the requirements for a particular system.
COURSE OUTCOME
50

Number (K1-K4)
CO1 Analyse, design the components in C# K2,K4
CO2 Identify, analyse database components in C# K2,K3 & K4

CO3 Design the process into various scenarios and applications K2 & K3
CO4 Apply the concepts of architectural design for deploying the K3 & K4
code for software.
CO5 To design various tools for deployment K2,K3 & K4

CO1 S S S M S M
CO2 S S M S S M
CO3 S S S M S S
CO4 M S S S M S
CO5 M S S M M S
SYLLABUS
UNIT – I INTRODUCTION 18 Hrs
Introduction – Creating a Simple Component – Properties and State – Database

Components – Consuming the Database Component –Enhancing the Component with
Error Handling – Aggregate Information–Data Objects.
UNIT- II USER CONTROLS 19 Hrs
User Controls–Creating a Simple User Control–Visual Studio .NET Custom Control

Support – Independent User Controls –Integrated User Controls –User Control Events –
Limitations – Deriving Custom Controls.
UNIT - III CACHING 19 Hrs

51
Designing for Scalability–Profiling –Caching-Output Caching–Client Side–Query
Structuring– Events–CustomCachingControl–CachingwithHTTPCachePolicyClass–
Fragment Caching – Data Caching –A Simple Cache Test–Caching to Provide Multiple
Views.
UNIT – IV CONFIG SETTING 18 Hrs
Determining Security Requirements –Restricted File Types – Security Concepts –ASP

.NET Security Model–Security Strategies – Certificates – SSL –Forms Authentication –
Web. Config Settings– Login Page – User Lists – Protecting User Passwords with
Encryption – Custom Roles – Windows Authentication–IIS Settings –Web. Config Setting
–A windows Authentication Test.
UNIT-V DATA ACCESS 18 Hrs
EnterpriseLibrary–DevelopingApplicationswithEnterpriseLibrary–DesignBlocks–
Caching– Cryptography–Data Access – Exception Handling –Logging – Policy Injection –
Security – Unity – Validation – Deployment Tools –Development of Deployment Tools –
Choosing a Deployment Strategy–Click once Update Strategy.
52
Distribution of Marks:Theory 80% and Applications:20%
TEXT BOOKS

NO PUBLICATION
1 Matthew Mac The Complete Tata McGraw 2002

Donald Reference–ASP Hill,
REFERENCE BOOKS

NO PUBLICATIO
N
1 Joseph C#7.0 pocket Oreilly 2017

Albahari,Ben Reference
Albahari
2 Enrico Buonano Functional Manning 2017

programming in C#
3 Jon Skeet C# in depth Manning 2019
4 Joseph C#in a Nutshell Oreilly 2017
Albahari,Ben
Albahari
5 Paul J.Deitel and C# for programmers Deitel and 2016

Harvey Deitel Development series
6 Vystavel C# programming for Apress 2017
absolute beginners
7 Gaurav Arora Learn C#in 7 days pockt 2017
53
WEB RESOURCES
2. https://www.nptel.in
➢ Power point presentation

➢ seminar by students
➢ Assignment to students
➢ Lecture through video
➢ Discussion and interaction in class room
➢ Google Meet
SYLLABUS DESIGNER
1.Mrs. G.SANGEETHA LAKSHMI, Head & Assistant Prof, Dept of Computer Applications.
2.Ms. D.SARANYA, Assistant Prof, Dept of Computer Applications.
3. Mrs.N.AMBIGA, Assistant Prof, Dept of Computer Applications.
54
ENTERPRISE APPLICATIONS USING c#
Semester Subject Category Lecture Hrs Theory Hrs Practical Credit
Code s
III CORE 3 45 0 0 3 45 3
(PRACT)
-5
COURSE OBJECTIVE
➢ This practical helps us to develop the projects in ENTERPRISE Application using c#.
SYLLABUS
1. Creation and consumption of a simple component and database component and
components using aggregate functions.
2.Creation of a Custom control which includes the following operation A textboxes that
parses the separator and identifies the first name and last name.
3.Create a popup calendar control that consists of a textbox and calendar control. The
calendar control pops uponly by clicking the calendar control
4.Cache the output of the page for a specified time using Output Caching
5.Cache the data content of the web page using the Data Caching
6.Cache portion of a web page using Fragment caching.
7. Create a simple profile and provide customized settings for the user.
8.Using the Forms Authentication, authenticate the user and encrypt the password using either
SHA or RSA algorithm.
9. Implementation of deployment tools (XCOPY or Web Setup wizard)
10.Working with enterprise library tool with various features
Distribution of Marks: Program Output with Viva voce:85% and Record:15%
SYLLABUS DESIGNER
1. Mrs. G.SANGEETHA LAKSHMI,Head & Assistant Prof, Dept of Computer Applications.
2. Ms. D.SARANYA, Assistant Prof, Dept of Computer Applications.
3.Mrs.N.AMBIGA, Assistant Prof, Dept of Computer Applications.
55
MOBILE COMPUTING
Code Hrs
III COREPAPER-8 5 75 5 75 0 0 4
COURSE OBJECTIVE
➢ The course provides the overview of mobile development, and tools for the development,
back-end integration, security, and management of cross-platform mobile applications.
➢ To develop system and application level software for small, battery powered terminals
equipped with the wireless network connection.
COURSE OUTCOME
CO CO Statement Knowled
Num ge Level
ber (K1-K4)
CO1 Apply the fundamental design paradigms and technologies to mobile computing
applications. K2
CO2 Develop consumer and enterprise mobile applications using representative mobile K2
devices and platforms using modern development methodologies.
CO3 Evaluate the role of mobile applications in software intensive systems. K3
CO4 Assess and implement security principles in mobile computing. K4
CO5 Synthesize new knowledge in the area of mobile computing by using appropriate
research methodologies and techniques. K4
CO1 S S S M S M
CO2 S S M S S M
CO3 S S S M S S
CO4 M S S S M S
CO5 M S S M M S
56
SYLLABUS
UNIT-I INTRODUCTION 17 Hrs
Introduction- Applications-vehicles- Mobile and Wireless devices- History of wireless

communications- The role of IETF in mobile networking-: Motivation for Specialized MAC -
SDMA - FDMA - TDMA - CDMA - Comparison of Access mechanisms - Multiplexing –
Spread Spectrum and Cellular Systems- Medium Access Control – Comparisons.
UNIT-II WIRELESS NETWORKS 15 Hrs
Wireless LAN: Infrared Vs Radio Transmission - Infrastructure Networks - Ad hoc

Networks - IEEE 802.11- Medium Access Control – motivation for a MAC- MANET Vs
VANET – Security. wireless delivery technology and switching methods- cellular
communication concepts: Wireless transmission – Multiplexing –Modulation – Spread
Spectrum – Cellular system – GSM architecture – protocols.
UNIT-III MOBILE NETWORK LAYER 16 Hrs
Mobile Network Layer: Mobile IP: Goals - Assumptions and Requirement - Entities -
IP packet Delivery- Broad cast Systems – Overview – Cyclic Repetition of data – Digital
Video and Audio Broadcasting-Mobile data internetworking standards- cellular data
communication protocols- mobile computing applications.
UNIT-IV DATA GRAMS AND ROUTE OPTIMIZATIONS 14 Hrs
Tunneling overview and terminology– Encapsulation – Routing failures – Tunnel

management – Decapsulation – Dynamic Host Configuration Protocol – ad hoc networks –
Traditional TCP- Indirect TCP- Snooping TCP.
UNIT-V MOBILE PLATFORMS AND APPLICATIONS 13 Hrs
Mobile Device Operating Systems – Special Constrains & Requirements –

Commercial Mobile Operating Systems – Software Development WAP: Architecture -
Transport Layer Security - Transaction Protocol - Session Protocol.
57
TEXT BOOKS

PUBLICATION
1 JOCHEN Mobile Communication Addison Wesley 2000
SCHILER
2 J. Schiller Mobile Communications,2nd Pearson 2003
edition Education, Delhi.
3 Charles E.Perkins Mobile IP: Design Principles Addison Wesley, 1999
and Practices USA
REFERENCE BOOKS

PUBLICATION
1 Hansmann, Merk, Principles of Mobile 2nd Edition, 2004
Nicklous, Stober Computing Springer
2 Dharma Prakash Introduction to Wireless and Thomson Asia Pvt 2005.
Agarval, Qing and Mobile Ltd,
An Zeng Systems
3 C.K.Toh, AdHoc Mobile Wireless First Edition, 2002.
Networks Pearson Education
4 V.Jayasri Mobile Computing Technical 2004
Arokiomary Publications
5 Sipra Dasbit Mobile Computing PHI Learning Pvt 2009
Ltd
6 Kumkum Garg Mobile Computing Pearson Education 2010
India
7 Yu-Kwong Ricky Wireless in Internet and Wiley 2007
Kwok Mobile Computing
8 Mazlilza O thman Principles of Mobile CRC Press 2007
Computing and
communications
58
WEB RESOURCES
1. http://developer.blackberry.com/
➢ Power point presentation

➢ seminar by students
➢ Assignment to students
➢ Lecture through video.
➢ Discussion and interaction in class room
➢ Google Meet.
SYLLABUS DESIGNER
1.Mrs.G.SANGEETHA LAKSHMI,Head & Assistant Prof, Dept of Computer Applications.
2.Ms.D.SARANYA, Assistant Prof, Dept of Computer Applications.
3.Mrs.N.SAVETHA, Assistant Prof, Dept of Computer Applications.
59
PRACTICAL: MOBILE COMPUTING AND PYTHON LAB
Code Per Per Per Per Per Per
III CORE 3 45 0 0 3 45 3
PRACTI
CLA-6
COURSE OBJECTIVE
 This practical helps us to develop the projects using Wireless Communication, mobile
Computing and Python concept.
LIST OF EXPERIMENTS
1. To set up a satellite communication link and study of change in uplink and

downlink frequency
2. To establish an Audio-Video satellite link between Transmitter and Receiver
3. To Study Frequency Hopping Spread Spectrum (FHSS) Modulation and Demodulation
Technique
4. To study generation(spreading) & demodulation(Despreading) of DSSS modulated signal.
5. To study radiation pattern & calculate beam width for circular & triangular patch. antenna
6. To study GPS data like longitude, latitude using GPS receiver
7. Study of Minimum Shift Keying (MSK) Modulation and Demodulation Process
8. Program to implement functions and Modules in python
9. Program to implement Collections: Sets, Dictionary
10. Program to implement Arrays using Numpy
11.Program to implement file Handling : Data streams, Access modes,
Read/Write/Seek 12.Program to implement Exceptional Handling: hierarchy, raise,
assert
Distribution of Marks: Program Output with Viva voce: 85% and Record: 15%
SYLLABUS DESIGNER
1. Mrs. G.SANGEETHA LAKSHMI, Head & Assistant Prof, Dept of Computer Applications.
60
2. Ms. D.SARANYA, Assistant Prof, Dept of Computer Applications.
3. Mrs.N.SAVETHA, Assistant Prof, Dept of Computer Applications
61
MACHINE LEARNING AND PYTHON PROGRAMMING
Semester Subject Categor Lecture Hrs Theory Hrs Practical Credits

Code y Per Per Per Per Per Per
III CORE 5 75 5 75 0 0 4
PAPER-
9
COURSE OBJECTIVE
 The course provides the understanding of basic neural network architecture.
 Understand data pre and post processing and Learn training, verification and validation
of neural network models.
 This course also helps students to Understand Python programming concept.
 It helps students to implement python concepts in real world applications like Machine
Learning
COURSE OUTCOME
On the successful completion of the course, students will be able to

Number (K1-K4)
CO1 Basic concepts of Machine Learning, learning methods K1,K2
CO2 Understanding basic concepts of supervised learning K3
CO3 Understanding basic concepts of supervised learning K2 &K3
CO4
Understanding Basis of Python Programming. K3
CO5
Read and write data from/to files in Python programs K2&k3
CO1 S S S M S S
CO2 S S S M S M
CO3 S S M M S M
CO4 S S S S S M
CO5 S S S M S M
S-Strong M-Medium L-Low
62
SYLLABUS
UNIT I: I MACHINE LEARNING INTRODUCTION 16 HRS
Machine Learning – Types of machine learning- Machine Learning Applications – Key

elements of machine learning - Perspectives and Issues, Version Spaces, Finite and Infinite
Hypothesis Spaces - PAC Learning - Learning a Class from Examples - Vapnik-Chervonenkis
Dimension - Linear, Non-linear, Multi-class and Multi-label classification- Statistical learning:
Bayesian Method, The Navie Biayes classifier
UNIT II: SUPERVISED LEARNING 16 HRS
Decision Trees: ID3, Classification and Regression Trees, Regression: Linear Regression,
prediction using linear regression, Gradient Descent, Linear Regression with one variable,
Linear Regression with multiple variable. Logistic Regression- classification using logical
regression, logical regression with one variable and with multiple variable, linear vs logistic
regression. Neural Networks: Introduction, Perceptron, Multilayer Perceptron, Support vector
machines: Linear and Non-Linear, Kernel Functions, K-Nearest Neighbours
UNIT III: UNSUPERVISED LEARNING 13 HRS
Unsupervised Learnin: Introduction to clustering, Hierarchical: AGNES, DIANA, Partitional:

K-means clustering, K-Mode Clustering, Expectation Maximization, Gaussian Mixture Models
- Principal components analysis (PCA), Locally Linear Embedding (LLE), Factor Analysis
UNIT IV: PYTHON FUNDAMENTALS 15 HRS
Introduction - Python Character set – Tokens- Input and output functions - Data types-
Variables- Expressions- Statements - Operators- Comments - Control Flow statements -
Functions – Lists – Tuples - Dictionaries
UNIT IV: FILES, MODULES, PACKAGES 15 HRS
Files and exception - Text files - Reading and Writing files - Command line arguments, Errors
and Exceptions, Handling exceptions, Modules, Packages - Data Visualization using python.
Distribution of Marks: Theory 80% and Problems 20%
63
TEXT BOOKS
S.No Authors Title Publishers Year of
publication
1 Ethem Alpaydin, Introduction to Machine MIT Press, Prentice Hall of 2014
Learning India, Third Edition
2 Allen B. Downey Think Python: How to Shroff/O’Reilly Publishers, 2nd 2016
Program edition, Updated for Python 3
REFERENCE BOOKS
S. No Authors Title Publishers Year of
publication
1. Kevin P. Murphy Machine Learning: A The MIT Press, 2012
Probabilistic Perspective
2. Mehryar Mohri, Foundations of Machine MIT Press 2012
Afshin Learning
Rostamizadeh,
Ameet Talwalkar
3. Tom Mitchell Machine Learning McGraw Hill, 3rd Edition 1997
4. Paul Barry Head-First Python O'Reilly Publishers 2016
5. Zed A. Shaw Learn Python3 The Hard Addison-Wesley 2016
way
6. Guidovan An Introduction to Python- Network Theory Ltd 2011
Rossum and Fred Revised and updated for
L. Drake Jr. Python 3.2
7. avid Ascher and Learning Python O’Reilly Media 1999
MARK LUTZ
8. Wes McKinney Python for Data Analysis: O’Reilly Media 2011
Data Wrangling with Pandas,
NumPy, and IPython
WEB SOURCES
1. http://dai.fmph.uniba.sk/courses/ICI/marsland.ml-alg-perspect.09.pdf
2. https://faculty.ucmerced.edu/mcarreira-perpinan/teaching/CSE176/lecturenotes.pdf
3. http://profsite.um.ac.ir/~monsefi/machine-learning/pdf/Machine-Learning-Tom-Mitchell.pdf
4. http://greenteapress.com/wp/think- python/
5. http://www.guru99.com/python-tutorials.html
SYLLABUS DESIGNER
1. Mrs. G.Sangeetha Lakshmi , Assistant Professor and Head, Department of Computer
Application
2. Mrs. R.Bhuvaneswari, Assistant Professor, Department of Computer Application
64
INTERNET OF THINGS
Code
III ELECTIVE 5 75 5 75 0 0 4
COURSE OBJECTIVE
 Students will understand the communication technologies in IOT, know the various
applications of IOT.
 Students will understand the network operator requirements and smart applications.
COURSE OUTCOME
On successful completion of the course, students will be able to
Number (K1-K4)
CO1 Basic technologies and concepts of IoT K2
CO2 Concept of Applications based on IoT K3
CO3 Smart applications of IoT K3
CO4 Health based applications of IoT K4
CO5 To understand about the network operator requirements and K3
connectivity.

CO1 S M M M S S
CO2 M S M S S M
CO3 S S S L M S
CO4 S M S M S L
CO5 S S S S S S
S- Strong; M- Medium; L-
Low
65
66
SYLLABUS
UNIT – I IOT INTRODUCTION 16 Hrs

Introduction to Internet of Things: Definition – Characteristics of IOT – Physical Design of
IOT – Things in IOT – IOT Protocols – Logical Design of IOT – IOT Functional Blocks – IOT
Communication Models – IOT Communication APIs – IOT Enabling Technologies
UNIT-II DOMAIN SPECIFIC IOT I 15Hrs

Domain Specific IOT – I : Smart Lighting – Smart Appliances – Intrusion Detection – Smoke/
Gas Detection – Smart Parking – Smart Roads – Structural Health Monitoring – Surveillance –
Emergency Response – Weather Monitoring
UNIT-III DOMAIN SPECIFIC IOT II 14 Hrs

Domain Specific IOT – II : Air Pollution Monitoring – Noise Pollution Monitoring – Forest
Fire Detection – River Flood Detection – Smart Grids- Smart Vending Machines – Route
Generation & Scheduling – Fleet Tracking – Shipment Monitoring
UNIT–IV DOMAIN SPECIFIC IOT III 16 Hrs

Domain Specific IoT – III: Remote Vehicle Diagnostics – Smart Irrigation - Green House
Control – Machine Diagnosis & Prognosis – Indoor Air Quality Monitoring – Health & Fitness
Monitoring – Wearable Electronics
UNIT-V IOT and M2M 14 Hrs
IOT And M2M: M2M – Difference Between IOT And M2M – SDN And NFV For IOT – IOT
System Management With NETCONF – YANG : Need For IOT Systems Management – SNMP-
Network Operator Requirements.
Distribution of Marks: Theory 80% and Applications:20%
67
TEXTBOOKS

NO PUBLICATION
1 Jean-Philippe Vasseur, Interconnecting Smart MK Publishers 2010

Adam Dunkels, Objects with IP: The Next
Morgan Kuffmann. Internet
REFERENCE BOOKS

NO PUBLICATION
1 P.Rizwan Ahmed Internet of Things Margham Publications 2010
2 Adrian McEwen Designing the Internet of Hakim Cassimally 2013
(Author) Things
3 Cuno Pfister Getting Started with the O'Reilly Publications 2011
Internet of Things
4 Maciej Kranz Building the Internet of Wiley Publications 2016
Things
5 Bruce Sinclair IoT Inc: How Your Mc-Graw Hill 2017
Company Can Use The Professional
Internet of Things to Win
in the Outcome Economy
6 Raj Kamal Internet of Things Mc-Graw Hill 2018

Professional
7 Olivier Internet of Things:Key Wiley Publications 2015
Hersent,David Applications and
Boswarthick Protocols
8 John Rossman The Amazon Way On Brilliance Audio 2016
IoT Publications
68
WEB RESOURCES
1. https://lecturenotes.in/subject/370/internet-of-things-iot
2. https://www.tutorialspoint.com/internet_of_things/internet_of_things_tutorial.pdf
 Power point presentation
 Seminar by students
 Assignment to students
 Lecture through video.
 Discussion and interaction in class room
SYLLABUS DESIGNER
1. Mrs. G.Sangeetha Lakshmi, Head & Assistant Prof, Dept of Computer Applications
2. Mrs. B. Arulmozhi, Head & Assistant Prof, Dept of Computer Science.
3. Mrs. K. Ayesha, Assistant Prof, Dept of Computer Science.
4. Mrs.S.Shanthi, Assistant Prof, Dept of Computer Science.
69
SOFTWARE TESTING
Code Per Per Per Per Per Per
III ELECTIVE 5 75 5 75 0 0 4
COURSE OBJECTIVE
 To learn the criteria for test cases, the design of test cases, test management and test
automation techniques.
 To apply test metrics and measurements.
COURSE OUTCOME
Number (K1-K4)
CO1 Explain the basic concepts and the processes that lead to K2
software quality and testing
CO2 Design test cases from the given requirements using Black K3
box testing techniques
CO3 Identify the test cases from Source code by means of white K3
box testing techniques
CO4 Know about user acceptance testing and generate test cases K4
for it
CO5 Develop test cases and test suite using automated testing tools K3
CO1 S S S M M S
CO2 S S S S L M
CO3 S S S S L S
CO4 S S S M S S
CO5 S S S S S S
70
SYLLABUS
UNIT – I SOFTWARE QUALITY MANAGEMENT 14 Hrs

Basics of Quality – Core Components of Quality – Software Quality Assurance – Software
Quality Control – Total Quality Management – Six Sigma.
UNIT- II FUNDAMENTALS OF SOFTWARE TESTING 14 Hrs

Basics of Software Testing – Test Approaches – Test Planning – Test Strategy – Defects
Management.
UNIT - III REQUIREMENTS BASED TEST CASE DESIGN TECHNIQUES 16 Hrs

Equivalence Portioning – Boundary value analysis – Cause effect graphing – Code Based Test
Case Generation – Cyclomatic Complexity – CFG Generation – Test Paths Generation – Test
case generation from test paths.
UNIT – IV TEST ADEQUACY CRITERIA 16 Hrs

The needs for Levels of testing- Unit test planning- Running the unit tests and recording the
results- Path Coverage – Statement Coverage – Condition Coverage – Decision Coverage.
UNIT-V AUTOMATED SOFTWARE TESTING 15 Hrs

Software test automation- Scope of automation- requirements of a test tool-Test metrics and
measurements- Project, Progress and Productivity metrics.
Distribution of Marks:Theory 80% and Applications:20%
71
TEXT BOOKS

NO PUBLICATION
1 Limaye M.G., “Software Testing TMH Publishers 2010
Principles, Techniques and
Tools”, Second Reprint
REFERENCE BOOKS

NO PUBLICATION
1. Alan Gilies, "Software Quality Cengage Learning 2013
Theory and Publishers,
Management", 2nd
Edition,
2 Aditya P.Mathur, “Foundations of Software Pearson Education, 2013
Testing”, 2nd Edition,
3 Frank Appel Testing with JUnit, 1st Packt Publishing Limited 2015
Edition,
4 Lisa Crispin Agile Testing: A Addison Wesley 2008
Practical Guide for Professional
Testers and Agile Teams
5 Cem Kaner, Hung Q Testing Computer Wiley Publications 1988
Nguyen, Jack Falk Software
6 Glenford J. Myers The Art of Software John Wiley & Sons 1979
Testing Publications
7 Dorothy Graham, Foundations of Software Cengage Learning 2006
Erik P.W.M. Testing Publications
Veenendaal, Rex
Black
8 Paul Jorgensen Software Testing - A CRC Press 2014
Craftman's Approach
72
WEB RESOURCES
1. http://www.tutorialspoint.com/softwaretesting/
SYLLABUS DESIGNER
4. Mrs. V. Lakshmi Pratha , Assistant Prof, Dept of Computer Science.
73
EMBEDDED SYSTEMS
Code Hrs
III ELECTIVE 5 75 5 75 0 0 4
COURSE OBJECTIVE
 To introduce the Building Blocks of Embedded System, Educate in Various Embedded
Development Strategies, Bus Communication in processors, Input/output interfacing,
knowledge in Various processor scheduling algorithms.
COURSE OUTCOME
Number (K1-K4)
CO1 Needs for Embedded system K2
CO2 Develop and evaluate Embedded system K4
CO3 Understand about Memory organization and interfacing K2
CO4 Understand the Concepts of peripherals and interfacing of K2
sensors
CO5 Describe the architecture and programming of processor K1

CO1 S S S M M S
CO2 S S S S L M
CO3 S S S S L S
CO4 S S S M S S
CO5 S S S S S S
74
SYLLABUS
UNIT – I INTRODUCTION TO EMBEDDED SYSTEMS 15 hours

Embedded system model – Embedded standards – Block diagrams – Powering the hardware
Embedded board using von Neuman model – Embedded processors: ISA architecture models –
Application specific ISA models – 8051 Microcontroller –General purpose ISA models –
General architecture – Instruction set and Assembly programs
UNIT- II PROCESSOR HARDWARE 15 hours

Internal Processor Design: ALU – Registers – Control unit – Clock – On Chip Memory –
Processor I/O – Interrupts – Processor buses – Processor performance – Board memory: ROM
– RAM – Cache – Auxiliary memory – Memory management – Memory performance – Board
buses: Arbitration and timing – PCI bus example – Bus performance.
UNIT - III MEMORY AND INTERFACE 12hours

Memory organization and interfacing - I/O devices and interfacing Counters and Timers -
Serial data communication – Interrupts – Interfacing LCD Display – Keypad Interfacing –
Generation of Gate signals for Converters and Inverters – Motor Control .
UNIT – IV SOFTWARE AND ISSUES OF SOFTWARE 16 hours
Middleware and applications: PPP – IP middleware – UDP – Java. Application layer: FTP
client – SMTP – HTTP server and client – Design and development: Architectural patterns and
Reference models – Creating the architectural structures – Documenting the architecture –
Analyzing and evaluating the architecture – Debugging, Testing, and Maintaining.
UNIT-V PROCESSORS AND RTOS 18 hours

Introduction to basic concepts of RTOS – Task, process & threads, interrupt routines in RTOS
– Multiprocessing and Multitasking – Preemptive and non preemptive scheduling–Task
communication shared memory – Message passing – Inter process Communication –
Synchronization between processes – Semaphores.
75
TEXTBOOKS
NO PUBLICATION
1 Jean J. Labrosse Embedded Systems Paul Temme 2011
Building Blocks
REFERENCE BOOKS
NO PUBLICATION
1 Tammy Noergaard Embedded system Elsevier 2006
architecture
2 Muhammad Ali PIC Microcontroller an Pearson Education 2008
Mazidi Embedded Systems using
Assembly and C for
PIC18
2 Muhammad Ali The 8051 Microcontroller Pearson Education 2008
Mazidi and Embedded systems
3 Elecia White Making Embedded O'Reilly Publishers 2011
Systems: Design Patterns
for Great Software
4 Jack Ganssle The Art of Designing Elsevier Publishers 1999
Embedded Systems
5 Michael Barr Programming Embedded O'Reilly Publishers 1999
Systems
6 Phil Koopman Better Embedded System Drumnadrochit 2010
Software Education
7 David E. Simon An Embedded Software Addison-Wesley 1999
Primer
8 Daniele Lacamera Embedded Systems Packt Publishers 2018
Architecture
76
WEB RESOURCES

SYLLABUS DESIGNER
4. Ms. P. Ramya, Assistant Prof, Dept of Computer Science.
77
ROBOTICS
Code
III SELF STUDY 0 0 0 0 0 0 2
PAPER
COURSE OBJECTIVE
 This paper helps us to develop the skill in Robotics .
COURSE OUTCOME
(K1-K4)
CO1 Ability to understand basic concept of robotics. K1
CO2 To analyze Instrumentation systems and their applications K2

CO3 To know about the differential motion add statics in robotics K3
CO4 To know about the various path planning techniques. K3
CO5 To know about the dynamics and control in robotics industries. K4

CO1 S M M M M M
CO2 S S S M S M
CO3 S S S M S S
CO4 S S S S S S
CO5 S M S M S S
78
SYLLABUS
UNIT- I BASIC CONCEPTS
Brief history-Types of Robot–Technology-Robot classifications and specifications-

Design and controlissues- Various manipulators – Sensors - work cell - Programming
languages.
UNIT -II DIRECT AND INVERSE KINEMATICS
Mathematical representation of Robots - Position and orientation – Homogeneous

transformation-Various joints- Representation using the Denavit Hattenberg parameters
-Degrees of freedom-Direct kinematics-Inverse kinematics- SCARA robots- Solvability
– Solution methods-Closed form solution.
UNIT- III MANIPULATOR DIFFERENTIAL MOTION AND STATICS
Linear and angular velocities-Manipulator Jacobian-Prismatic and rotary joints–Inverse

-Wrist and arm singularity - Static analysis - Force and moment Balance.
UNIT- IV PATH PLANNING
Definition-Joint space technique-Use of p-degree polynomial-Cubic polynomial-

Cartesian space technique - Parametric descriptions - Straight line and circular paths -
Position and orientation planning.
UNIT- V DYNAMICS AND CONTROL
Lagrangian mechanics-2DOF Manipulator-Lagrange Euler formulation-Dynamic model

– Manipulator control problem-Linear control schemes-PID control scheme-Force
control of robotic manipulator.
TEXT BOOKS

NO PUBLICATION
1 R.K.Mittal and I.J.Nagrath, Robotics and Control Tata McGraw Hill, New 4th Reprint, 2005
Delhi
2 JohnJ.Craig Introduction to Third edition, Pearson 2009
Robotics Mechanics Education
and Control
79
3 M.P.Groover, M.Weiss, Industrial Robotics McGraw-Hill 1996
R.N. Nageland N. G.Odrej, Singapore
Reference Book

NO PUBLICATION
1 Ashitava Ghoshal Robotics-Fundamental Oxford University Press, 2010
Concepts and Analysis Sixth impression
2 K. K.Appu Kuttan, Robotics I K International 2007
3 Edwin Wise Applied Robotics Cengage Learning 2003
4 R.D.Klafter,T.A.Chimielew Robotic Engineering– Prentice Hall of India, New 1994
ski and M.Negin An Integrated Approach Delhi
5 B.K.Ghosh Control in Robotics and Allied Publishers,Chennai 1998
Automation: Sensor
Based Integration
6 S.Ghoshal Embedded Systems & Cengage Learning 2009
Robotics” – Projects
using the 8051
Microcontroller
WEB RESOURCES
https://analyticsindiamag.com/learn-robotics-from-scratch-5-free-online-resources-
that-will-help-you-start-with-a-bang/
TEACHING METHODOLOGY – SELF STUDY
SYLLABUS DESIGNERS
80
CRYPTOGRAPHY AND NETWORK SECURITY
Code Hrs
Per Per Per Per Per Per sem
week sem week sem week
IV ELECTIVE 5 75 5 75 0 0 4
COURSE OBJECTIVE
 The course provides the overviews learning about computer network organization and
implementation, obtaining a theoretical understanding of data communication.
 Equip the students with authentication algorithms and system security.
COURSE OUTCOME
Number (K1-K4)
CO1 Learning the fundamental concepts of Cryptography and K1
Network security
CO2 To familiarize the student with the concept of confidentiality K2
and Modular Arithmetic
CO3 Analyse the technique of Public key cryptography and K2 & K3
Authentication requirements
CO4 Understanding the importance of integrity checks and K2
Authentication algorithms
CO5 To learn about IP, Web, System Security and Key K4
Management
CO1 M M S M S S
CO2 L S M M S M
CO3 S M S M S S
CO4 S S M S M M
CO5 M S S M M M

81
SYLLABUS
UNIT – I INTRODUCTION TO CRYPTOGRAPHY 18 HRS

Introduction to security attacks - Services and mechanism - Introduction to cryptography -
Conventional encryption model - Classical encryption techniques - Substitution ciphers and
transposition ciphers – Cryptanalysis – Steganography - Stream and blockciphers - Modern
Block Ciphers: Block ciphers principals - Shannon’s theory of confusion and diffusion.
UNIT- II CONFIDENTIALITY 19 HRS
Confidentiality using conventional encryption - Traffic confidentiality - Key distribution -

Random number generation - Prime and relative prime numbers - Modular arithmetic -
Fermat’s and Euler’s theorem - Primality testing - Euclid’s Algorithm - Discrete algorithms.
UNIT - III PUBLIC KEY CRYPTOGRAPHY 19 HRS
Principles of public key crypto systems - RSA algorithm - Security of RSA - Key management
– Diffle-Hellman key exchange algorithm - Introductory idea of Elliptic curve cryptography –
Elgamel encryption - Message Authentication and Hash Function: Authentication requirements
- Authentication functions - Message authentication code.
UNIT – IV AUTHENTICATION ALGORITHMS 18 HRS
MD5 message digest algorithm - Secure hash algorithm (SHA) - Digital Signatures -
Authentication protocols - Digital signature standards (DSS) - Proof of digital signature
algorithm - Authentication Applications: Kerberos and X.509 - Electronic mail security-Pretty

good privacy (PGP).
UNIT-V IP, WEB, SYSTEM SECURITY 18 HRS
IP Security: Architecture - Authentication header - Encapsulating security payloads -

Combining security associations - Key management- Web Security- Secure socket layer and
transport layer security - Secure electronic transaction (SET) - System Security: Intruders -
Viruses and related threads.
82
TEXT BOOKS

NO PUBLICATION
1 William Stallings Cryptography and Network Pearson/PHI 2019
security Principles and
Practices
REFERENCE BOOKS

NO PUBLICATIO
N
1. W. Mao Modern Cryptography – Pearson Education 2013
Theory and Practice
2. Charles P. Pfleeger, Security in computing Prentice Hall of India 2012
Shari Lawrence
Pfleeger
3. Wade Trappe, Introduction to Pearson Education, 2013
Lawrence C Cryptography with coding
Washington theory
4. Forouzan Crypt and Network security Mc Graw Hill India 2015
5. Ajay Raj Parashar, Cryptography and Network Laxmi Publications 2015
Deepti Mittal security
6. Dorling Express Learning Pearson Education 2014

Cryptography and Network
security
7. Bragg Network Security- The Mc Graw Hill India 2017
Complete Reference
83
8. Eric Maiwald Fundamentals of Network Tata Mc Graw Hill 2010
Security Education
WEB RESOURCES
1. http://nptel.ac.in/courses/106105031/lecturebyDr.DebdeepMukhopadhyayIIT
Kharagpur
2. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-033-
computer-system-engineering-spring-2009/video-lectures/ lecture by Prof. Robert
Morris and Prof. Samuel Madden MIT.

SYLLABUS DESIGNER
3. Dr. M.Vasumathy, Assistant Prof, Dept of Computer Science.
4. Dr. R.Hamsaveni Murugan , Assistant Prof, Dept of Computer Science.
84
85

MSC CS Syllabus 2019-2020

Uploaded by

Copyright:

Available Formats

You might also like

MSC CS Syllabus 2019-2020

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

MSC CS Syllabus 2019-2020

Uploaded by

Copyright:

Available Formats

SYLLABUS

PROGRAMME EDUCATIONAL OBJECTIVES

With effect from 2019-2020

TOTAL 30 25 205 495 700

TOTAL 30 27 220 480 700

22 III Core Major 25 10 Project with VivaVoce 50 150 200

MAIN (CORE) 9 4 36 100 900

ELECTIVE 4 5 20 100 400

HUMAN RIGHTS 1 2 2 100 100

MINI PROJECT 1 4 4 100 100

MAJOR PROJECT 1 10 10 200 200

MAPPING WITH PROGRAMME OUTCOME

UNIT-II CONCEPT OF JSP 19 Hrs

UNIT-III INTRODUCTION TO ENTERPRISE BEANS 18 Hrs

UNIT–IV STRUTS 17 Hrs

UNIT-V HIBERNATE 18 Hrs

Distribution of Marks: Theory 80% and Applications: 20%

UNIT II – LINUX COMMANDS 18 Hrs

UNIT IV – WINDOWS OPERATING SYSTEM 17 Hrs

UNIT V – GNOME AND KDE 18 Hrs

3 Richard Petersen The Complete MC Graw Hill 2008

LINUX SHELL PROGRAMMING

FORMAL LANGUAGES AND AUTOMATA THEORY

UNIT–II FINITE AUTOMATA 18 Hrs

UNIT - III CLASSIFICATION OF GRAMMERS 19 Hrs

UNIT-IV BASIC STRUCTURE OF PDA 17 Hrs

UNIT-V BASIC STRUCTURE OF TM 18 Hrs

Distribution of Marks: Theory 70% and Problem 30%

CO CO Statement Knowledge Level

MAPPING WITH PROGRAMME OUTCOME

UNIT I: INTRODUCTION TO BIG DATA 15 Hrs

UNIT III: MINING DATA STREAMS 16 Hrs

UNIT IV: LINK ANALYSIS 18 Hrs

MAPPING WITH PROGRAMME OUTCOME

UNIT – II COMMUNICATION IN DISTRIBUTED SYSTEM 16 HRS

UNIT – III SYNCHRONIZATION 14 HRS

UNIT – IV PROCESS IN DISTRIBUTED SYSTEM 15 HRS

UNIT – V DISTRIBUTED FILE SYSTEM 15 HRS

MAPPING WITH PROGRAMME OUTCOME

UNIT II – PARALLEL PROCESSING 16 Hrs

UNIT III – PROCESSORS 14 Hrs

UNIT IV – MULTIPROCESSOR ARCHITECTURES 14 Hrs

UNIT V - MULTIPROCESSOR OPERATING SYSTEMS 15 Hrs

CO2 Remembering Data types and various operations in R. K2

UNIT – 2 DATA TYPES AND OPERATIONS

UNIT – 3 CONTROL STRUCTURES AND FUNCIONS

Scoping Rules, Debugging Tools, Simulation, R Profiler

JSP AND SERVLET PROGRAMMING

UNIT-V INTRODUCTION TO STRUCTS 16 Hrs

Distribution of Marks: Theory 70% and Problem 30%

1. Ms. A.SIVASANKARI, HOD, Dept of Computer Science

JSP AND SERVLET PROGRAMMING

ADVANCED DATABASE MANAGEMENT SYSTEM

CO2 To study SQL and relational database design. K2

UNIT IV – APPLICATION AND ITS OPERATIONS 17 Hrs

S. AUTHORS TITLE PUBLISHERS YEAR OF

ADVANCED DATABASE MANAGEMENT SYSTEM