B.Sc Information Technology 2018-2021

PSGRKRISHNAMMALCOLLEGE FOR WOMEN College of Excellence An Autonomous Institution - Affiliated to BharathiarUniversity Reaccredited with ‘A’ Grade by NAAC An ISO 9001:2015 Certified Institution Peelamedu, Coimbatore – 641 004

DEPARTMENT OF INFORMATION TECHNOLOGY

PROGRAMME EDUCATIONAL OBJECTIVES

 Graduates will have successful careers in computer fields or will be able to successfully pursue higher studies.

 Graduates will apply their technical knowledge and skills to develop and implement solutions for the problems that accomplish goals to the industry, academic, government or research area.

 Contribute effectively to the Computing Profession by fostering effective interaction, ethical practices and communication skills, while pursuing education through lifelong learning.

PROGRAMME OBJECTIVE  To provide broad range of information technology skills like technical, logical, analytical thinking and leadership quality  To meet the industry standards and attain the project development capabilities to obtain placements  To promote creativity, capability and competence through IT soft skills  To make them world class professionals in IT and produce women entrepreneurs to increase more employability.

PSGRKRISHNAMMALCOLLEGE FOR WOMEN Programme& Branch: B.Sc Information Technology Scheme of Examination (Applicable to students admitted during the academic year 2018 – 2019 Batch: 2018-2021)

(Semester I - VI)

Examination Marks Credits

l

a Title of paper CA ESE Tot

al

Part

week

Code

hours

hours / hours

Subject Subject

Tutori

Semester

hours

Instruction Instruction

Contact

Duration of Duration Examination I I TAM1701/ HIN1701/ Language I 6 86 4 3 40 60 100 3 FRE1701 I II ENG1701/ English Paper I / 6 86 4 3 40 60 100 3 ENG17F1 Functional English Paper I I III PPC1801 Core-1: Programming in C 6 86 4 3 40 60 100 4 I III IN18CP1 Lab1: C Programming lab 4 60 - 3 40 60 50* 3 I III Allied A1 : TH17A03B Paper I Mathematics and 6 86 4 3 40 60 100 5 - Level I TH17A03A Paper II Mathematics and statistics - Level II I IV NME18ES Introduction to Entrepreneurship NME16A1 / Advance Tamil/ 2 28 2 2 50 50 100 2 B1 Basic Tamil

II I TAM1702/ HIN1702/ Language II 6 86 4 3 40 60 100 3 FRE1702 II II ENG1702 English Paper II/ 6 86 4 3 40 60 100 3 ENG17F2 Functional English Paper II II III PBI1802 Core –2 : Bioinformatics 3 41 4 3 40 60 100 4 II III POP1803 Core – 3: Object Oriented 4 56 4 3 40 60 100 4 Programming with C++ II III IN18CP2 Lab -2: C++ Programming 3 45 - 3 40 60 50* 2 & Bio-Computing Lab II III Allied A2: 6 86 4 3 40 60 100 5 TH17A06B Paper I - I TH17A06A Paper II Discrete Mathematics – II Open Course: ------Grade II IV (Self study- Online Course) NME16A2/ **Advance Tamil/Basic ------Grade B2 Tamil II VI REG16EE Effective English 2 - - 2 50 50 100 2 Communication II VI NM12GAW General Awareness Self - - Onli 100 - - Grade Study ne Test

III III IN17C04 Core – 4: Operating 5 71 4 3 40 60 100 4 System

III III IN17C05 Core - 5: Data Structures 5 71 4 3 40 60 100 4

Core - 6 : Relational 5 71 4 3 40 60 100 4 III III PRD1703 Management System III III IN16CP3 Lab 3 : RDBMS Lab 4 60 - 3 40 60 50* 2 III III Allied A3: 6 86 4 3 40 60 100 5 TH16A13B Paper I: Optimization Techniques-I TH16A13A Paper II: Optimization Techniques- II

III IV NM14VHR Foundation Course: 2 26 4 - 100 - 100 2 Value Education and Human Rights III VI JOB1629 Job Oriented Course – - - - 3 - - - Grade & Mobile Application VI Development III IV Skill Based Subject & SB17DA01 1. Data Analytics - 3 43 2 2 25 75 100 4 IV Level I: R Programming SB17SE01 2.OOSE-Level I : Design Tools IV III IN17C07 Core – 7:Open Source 5 71 4 3 40 60 100 4 Technologies IV III PMP1705 Core – 8: 5 71 4 3 40 60 100 4 Digital Electronics and Microprocessor

IV III IN17C09 Core 9: VB.NET 5 71 4 3 40 60 100 4 Programming

IV III IN16CP4 Lab 4 : VB.Net & Bio-Perl 4 60 - 3 40 60 50* 3 Programming Lab

IV III Allied A4: 6 86 4 3 40 60 100 5 BP17A05 Paper I - Business Accounting

BP17A06 Paper II - Principles of Marketing

Paper III - Management PM17A01 Information Systems

IV IV Skill Based Subject & SB17DAP1 1. Data Analytics - 3 45 - 2 40 60 100 2 III Practical I : R Programming SB17SEP1 2.OOSE- Practical I : Tools

IV IV NM10EVS Foundation Course: 2 26 4 - 100 - 100 2 Environmental Studies IV COM15SER Community Oriented ------Grade Service IV V NSS/NCC/YRC/Sports & ------100 1 Games V III PJA1710 Core 10: Java 5 71 4 3 40 60 100 4 Programming V III PCG1711 Core 11: Computer 5 71 4 3 40 60 100 4 Graphics V III IN17C12 Core 12: Software 5 71 4 3 40 60 100 4 Engineering and Testing V III IN17E01 Elective 1: Cloud 5 71 4 3 40 60 100 5 Computing

IN17E02 Elective 2: Wireless Sensor Networks

IN17E03 Elective 3: Python Programming

V III IN16CP5 Lab – 5: Java 5 75 - 3 40 60 50* 3 Programming & Bio-Python Lab Skill Based Subject 3 43 2 2 25 75 100 4 V III & SB17DA02 1. Data Analytics -Level VI II : Data Tools SB17SE02 2.OOSE -Level II : Tools V NM13IS2 – 2 26 4 - 100 - - Grade Level II V III Advanced Level Course - - - 3 25 75 100* 5* 1* IN16AC1 Paper 1:

Paper 2: Information IN16AC2 Retrieval

V III Comprehensive - - - 1 - - - Grade V III INST1 Internship Training ------100 2

V III Personality ------Grade Development

VI III IN17C13 Core 13: 5 71 4 3 40 60 100 4 Principles of Data Communications and Networks VI III IN17C14 Core-14 : Internet of 5 71 4 3 40 60 100 4 Things VI III PWT1715 Core-15: Web 5 71 4 3 40 60 100 4 Technology

VI III IN16CP6 Lab – 6: Network & R 5 75 - 3 40 60 50* 2 Tool Lab

VI III PROJ Project Viva-Voce 7 - - 3 20 80 100 5

VI III Advanced Level Course - - - 3 25 75 100* 5* 2* PA16AC3 Paper 1: Artificial Intelligence

IN18AC4 Paper 2: Big Data Analytics

VI III Skill Based subject 3 45 - 2 40 60 100 2 & SB17DAP2 1. Data Analytics - V Practical II : Data Visualization Tools SB17SEP2 2. OOSE –Practical II : Software Testing Tools

Total 3800 140 *100 Marks converted into 50 ** Outside regular class hours.

*The credit is applicable to candidates who take up the advanced level course exam

Category L T P Credit PPC1801 PROGRAMMING IN C III 86 4 - 4

Preamble The course is designed to articulate the learning of C Language for beginners with all major features of C. This course will also create foundation to learn other complex programming languages like C++, Java, etc.,

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

CO CO Statement Knowledge Number Level CO1. Acquire programming logic, use of program instructions, syntax, K1 program structure. CO2. Understand the concept of arrays and functions. K2 CO3. Solve real world problems by using structure and union concepts. K3 Illustrate the Arrays, pointers and file concepts by developing CO4. K3 programs. Examine the complexity of problems, Modularize the problems into CO5. K3 small modules and then convert them into programs

Mapping with Programme Outcomes COs PO1 PO2 PO3 PO4 CO1. S M S M CO2. S S S S CO3. M M S M CO4. S S S S CO5. S S S S

S- Strong; M-Medium; L-Low

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 initialising 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 initialisation - 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 initialising 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.

Text Book

TITLE OF THE PUBLISHERS YEAR OF S.NO AUTHOR BOOK \ EDITION PUBLICATION

Tata Mc Graw Programming In 1 E. Balagurusamy Hill, 7th 2017 ANSI C Edition.

Reference Books

TITLE OF THE PUBLISHERS \ YEAR OF S.NO AUTHOR BOOK EDITION PUBLICATION

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

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

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

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

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

Pedagogy

 Chalk and talk, PPT, Discussion, Assignment, Demo, Quiz, Seminar.

Course Designer Mrs.K.Sathiyakumari

Category L T P Credit IN18CP1 C PROGRAMMING LAB III - - 60 3

Preamble The course gives hands-on experience on C Programming and improves the practical skill set. The learner will be able to develop the logic for the given problem, recognize and understand the syntax and construction of C code. The course involved in compiling, linking and C code and developing some complex programs.

Course Outcomes On the successful completion of the course, students will be able to CO Knowledge CO Statement Number Level CO1 Identify the basic terminology used in K1 CO2 Discuss programs involving decision structures, loops and functions K2 CO3 Use C to demonstrate practical experience in developing solutions K3 CO4 Apply, compile and debug programs in C language K3 Mapping with Programme Outcomes Cos PO1 PO2 PO3 PO4 CO1 S M S M CO2 S M S M CO3 M S S S CO4 M M S M S- Strong; M-Medium; L-Low Syllabus PROGRAMMING IN C:  Using Data types.  Using different operators.  Control Structures.  Using arrays.  String handling functions.  User defined functions.  Structure & Union  Pointers.  Working with files. Pedagogy System, White board Course Designer Mrs. K. Sathiyakumari

PBI1802 BIOINFORMATICS Category L T P Credit III 41 4 - 4

Preamble The course explores the areas of Bioinformatics like Sequencing, DNA, RNA and Protein Structure. The course designed to acquire knowledge in Biological .

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

CO CO Statement Knowledge Number Level CO1 Identify the basic concepts of Bioinformatics and its applications. K1 CO2 Illustrate on various Biological Databases. K2 CO3 Discuss the working nature of sequence alignment. K2 CO4 Experiment the structure of Protein, RNA. K3 CO5 Develop the features of DNA Sequence. K3

Mapping with Programme Outcome

Cos PO1 PO2 PO3 PO4 CO1 M S S M CO2 M S M M CO3 M M M M CO4 S S M M CO5 S S M M

S – Strong; M – Medium; L – Low

Syllabus

UNIT I (8 hrs) Bioinformatics: What is Bioinformatics? – Goal – Scope – Applications – Limitations – What is Database? – Types of Database – Biological Database – Pitfalls of Biological Database – from Biological databases

UNIT II (8 hrs) Biological Databases: Requirements of database searching – Heuristic database searching – Basic local alignment search tool (BLAST) – FASTA – Comparison of FASTA & BLAST – Database searching with smith – waterman method.

UNIT III (8 hrs) Pairwise Sequence Alignment:Evolutionary basis – Sequence Homology versus Sequence Similarity- Sequence Similarity versus Sequence Identity – Methods.

UNIT IV (9 hrs) Protein Structure: Protein Structure Visualisation – Protein Structure Classification – RNA Structure Prediction – Types of RNA structures – RNA Secondary Structure Prediction Methods.

UNIT V (8 hrs) DNA Sequence Analysis: Why analyse DNA? – Gene Structure & DNA Sequence – Features of DNA Sequence Analysis – Two approaches to gene hunting

Text Books

S.no Author Title of book Publisher Year of publication 1 Cambridge Jin Xiong Essential Bioinformatics 2016 University Press 2 T K Attwood & D Introduction to Pearson Education 2007 J Parry Smith Bioinformatics

Reference Books

S.no Author Title of book Publisher Year of publication 1 Jean-Michel Claverie , Bioinformatics – A Wiley Computer Cedric Notredame 2009 Beginner’s Guide Publishing 2 Shuba Gopal, Rhys Bioinformatics with Tata McGraw Hill Price Jones,Paul fundamentalsof Tymann,Anne Haake 2010 Genomics and Proteomics” Pedagogy

 Chalk and talk, Lecture, Discussion, Quiz, Demonstrate, PPT.

Course Designer

Mrs.A.Sindhu.

OBJECT ORIENTED PROGRAMMING Category L T P Credit POP1803 WITH C++ III 56 4 - 4

Preamble This subject is designed to provide the graduates with why and how of Object-oriented programming in C++. It also presents the concept of OO programming with a brief discussion on the important elements of OO analysis and design of systems. With its OO capabilities, C++ offers significant benefits over C.

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

CO CO Statement Knowledge Number Level Tell about the basic concepts of object oriented and control CO1 K1 structure. CO2 Outline the function, classes and objects. K2 Discuss about constructors and destructors, operator CO3 K2 overloading CO4 Classify about inheritance, polymorphism and pointers K3 CO5 Illustrate console I/O operation and file stream operations. K3

Mapping with Programme Outcomes COs PO1 PO2 PO3 PO4 CO1 S S M M CO2 M M S S CO3 M S S S CO4 S S S M CO5 M S S M

S- Strong; M-Medium; L-Low

Syllabus

UNIT I (11Hrs) 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 (12Hrs) 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 (11Hrs) 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. UNITV (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.

Text Book

Publishers \ Year of S.No Author Title of The Book Edition Publication

Tata Mc Graw Object Oriented 1 E.Balagurusamy Hill Publications, 2013 Programming with C++ 6th Edition.

Reference Books Year of S.No Author Title of the book Publishers \ Edition Publication The C++ Programming Pearson Education, 4th 1 BjarneStroustrup 2014 Language Edition. Object Oriented Wilsey India 2 Rajesh K.Shukla 2008 Programming in C++ Pvt.Ltd,1st,Edition. Object Oriented Galgotia Publications, 3 Robert Lafore 2001 Programming in C++ Pvt Ltd,4th Edition. Tony Gaddis, Starting Out with C++: Addison-Wesley 4 Judy Walfers, Early Objects publication, 8th 2013 GodferyMuganda Edition. Pedagogy  Chalk and talk, PPT, Discussion, Assignment, Demo, Quiz Course Designer S.Kalaipriya

IN18CP2 C++ PROGRAMMING & BIO- Category L T P Credit COMPUTING LAB III - - 45 2

Preamble

The course is designed to develop application using Object Oriented Principles. It helps to apply the concepts of C++ in different applications. The course also covers basic concepts of Bioinformatics.

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

CO CO Statement Knowledge Number Level CO1 Tell about the object oriented concepts K1 CO2 Discuss the execution of the C++ program using control structures, K2 classes and objects CO3 Recognize and fix common errors in C++ programs K2 CO4 Demonstrate constructor, Inheritance and File operations K3 CO5 Apply programming skills to experiment DNA sequence K3

Syllabus

List of programs 1. Control structures 2. Class and objects concept 3. Friend function & Constructors 4. Function Overloading & Operator Overloading 5. Inheritance 6. Virtual Functions 7. Files 8. DNA sequence - length, base composition and GC content 9. Split a DNA sequence into codons 10. Start and stop codons in a DNA sequence

Pedagogy

 System ,White Board

Course Designer Mrs. J. Maria Shyla Thomas

Category L T P Credit IN17C04 III 71 4 - 4

Preamble

To provide a discussion of the fundamentals of operating system design and to relate these to contemporary design issues and to current directions in the development of operating systems.

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

CO CO Statement Knowledge Number Level CO1. Recall about the past OS and process concepts. K1 CO2. Discussion on various storage management approaches. K2 Solve job and processor allocation problems by using scheduling CO3. K3 concepts. CO4. Illustrate the Device and information management concepts. K3 Examine the case studies in MS-Disk operating system and UNIX CO5. K3 Systems.

Mapping with Programme Outcomes Cos PO1 PO2 P03 P04 CO1. S M S M CO2. S S S M CO3. S S M S CO4. S S M M CO5. S M S M

S- Strong M-Medium L-Low

Syllabus

UNIT I (14 hrs) Introduction and process concepts: Definition of OS-Early History - History of DOS and Unix Operating System - definition of process - Process States - Process State Transition - Interrupt Processing - Interrupt classes - Context switching - Semaphores - Deadlock and Indefinite postponement.

UNIT II (14 hrs) Storage management: Real storage: Real storage management strategies - Contiguous Vs non- contiguous storage allocation - Single user contiguous storage allocation - Fixed partition multiprogramming - Variable partition multiprogramming - Multiprogramming with storage swapping Virtual storage: Virtual storage management strategies: Page replacement strategies - working sets - Demand paging - Page size.

UNIT III (15 hrs) Processor management: Job and processor scheduling: Preemptive Vs Non-preemptive scheduling – priorities - Deadline scheduling - FIFO-RR-Quantum size - SJF-SRT-HRN - – Pipelining – Vector processing - Array processors - Dataflow computers – - Fault Tolerance.

UNIT IV (14 hrs) Device and information management: Disk performance optimization: Operation of moving head disk storage - Need for disk scheduling - Seek optimization – FCFS - SSTF – SCAN - RAM Disks - Optical Disks - file and database systems: File system – functions – Organization - Allocating and freeing space - file descriptor -Access control by user Classes-Backup and Recovery.

UNIT V (14 hrs) Case Studies UNIX Systems: Kernel-Shell-File system-Process Management-Memory Management- Distributed UNIX Systems-UNIX Systems Standardization and open systems. MS-DOS: MS DOS various Versions-The user’s view of MS-DOS-the system’s view of MS- DOS.

Text Book

Year of S.No. Authors Title Publishers Publication

Addison Wesley Publishing An Introduction to 1. Deitel H.M Company, Second edition 2005 Operating System

Reference Books Year of S.No. Authors Title Publishers Publication Andrew Pearson Education, S.Tanenbaum, Operating Systems- Design 1. 3rd Edition 2011 Albert and Implementation

S.Woodhull, Abraham Silberschatz, John Wiley & 2. Peter Baer Operating System Concepts 2010 Sons,8th edition Galvin, Greg Gagne Tata McGraw Hill, 3. Archer J Harries Operating Systems 2008 First Edition

Pedagogy

 Chalk and talk PPT, Discussion, Assignment, Demo, Quiz, Case study.

Course Designer

Mrs.T.Hashni

Category L T P Credit IN17C05 DATA STRUCTURES III 71 4 - 4

Preamble

To provide an overview of data structures and design methods for programming and problem solving process.

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

CO CO Statement Knowledge Number Level CO1. Tell about the concepts of data structure, data type and array data K1 structure Classify and operations of stack, queue& simulating CO2. K2 recursion CO3. Show the implementation of linked list data structures to develop an K2 application programs Apply various data structure such as stacks, queues, trees and graphs CO4. K3 to solve various computing problems CO5. Identify standard algorithms for searching and sorting. K3

Mapping with Programme Outcomes

COs PO1 PO2 P03 P04 CO1. S M M S

CO2. S M S M

CO3. M M S M CO4. S S S M

CO5. S M S M

S- Strong M-Medium L-Low

Syllabus

UNIT I (14Hrs) Introduction to Data Structures: Theory of data structures- Data Representation - Abstract Data Type- primitive data types-data types and data structure. Stacks: Introduction-representation of stack through array and linked list -application of stack.

UNIT II (14Hrs) Recursive definitions and processes - recursive function in C - simulating recursion. Queues - definition and examples - representation of queues using arrays - queue operations - priority queues.

UNIT III (15Hrs) Linked Lists: definition and concepts - linked stacks and queues - linked list as a data structure. Implementation of lists - arrays, pointer implementation comparison - examples. Other lists - circular lists - doubly linked lists.

UNIT IV (14 Hrs) Trees: binary trees - definition and concept - tree terminologies - construction and traversal of binary trees - representation and application of binary trees. Graphs: graph terminologies - graph representation - graph traversal - breadth first search - depth first search- spanning trees.

UNIT V (14 Hrs) Searching: sequential searching - tree searching - balanced search trees - multiway search trees. Sorting: Introduction - bubble sort - insertion sort - selection sort - quick sort - heap sort - merge sort - shell sort.

Text Books

Year of S.No. Authors Title Publishers Publication Tata Mc Graw-Hill Publishing 2012 1. ISRD Group Data Structures using C Company

Limited,2nd Edition

Oxford University 2. Reema Thareja Data Structures using C Press 2011

Reference Books

Year of S.No. Authors Title Publishers Publication M. Radhakrishnan 1. Data Structures using C BPB Publication 2008 and V. Srinivasan Tata McGraw Hill An Introduction to Data Tremblay, J.P. pub. Company Ltd., 2. Structures with 2002 and Sorenson, P.G New Delhi 2nd Applications Edition Yedidyah PHI Learning, 2nd Langsam, Moshe Data Structures using C & 3. Edition 2009 J.Augentein, aron C++

M.Tenenbaum

Pedagogy

 Chalk & talk, PPT, Discussion, Assignment, Demo, Quiz

Course Designer

Mrs.R.Jayasree

Category L T P Credit PRD1703 RELATIONAL DATABASE MANAGEMENT SYSTEM III 71 4 - 4

Preamble

To study the basic concepts of database systems, relational database and queries, object modeling and database design. To understand the main solutions related to the strategies for storing objects, transaction management, and security. To inculcate knowledge on RDBMS concepts.

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

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

Mapping with Programme Outcomes CO PO1 PO2 PO3 PO4 Number CO1. S M M S CO2. M S S S CO3. M S S S CO4. M S S M CO5. S S S S

S- Strong M-Medium L-Low

Syllabus

UNIT I (14 Hrs) Database Concepts: A Relational approach: Database – Relationships – DBMS – Relational Data Model – Integrity Rules – Theoretical Relational Languages. Database Design: and Normalization: Data Modeling – Dependency – Database Design – Normal forms – Dependency Diagrams - Denormalization.

UNIT II (15 Hrs) Oracle9i: Overview: Personal Databases – Client/Server Databases – Oracle9i an introduction– SQL *Plus Environment – SQL – Logging into SQL *Plus - SQL *Plus Commands – Errors & Help –Alternate Text Editors - SQL *Plus Worksheet - iSQL *Plus. Oracle Tables: DDL: Naming Rules and conventions – Data Types – Constraints – Creating Oracle Table – Displaying Table Information –Altering an Existing Table – Dropping, Renaming, Truncating Table – Table Types – Spooling – Error codes.

UNIT III (14 Hrs) Working with Table: Data Management and Retrieval: 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 – Revisiting Substitution Variables – DEFINE command – CASE structure. Functions and Grouping: Built-in functions –Grouping Data. Multiple Tables: Joins and Set operations: Join – Set operations.

UNIT IV (14 Hrs) PL/SQL: A : History – Fundamentals – Block Structure – Comments – Data Types – Other Data Types – Declaration – Assignment operation – Bind variables – Substitution Variables – Printing – Arithmetic Operators. Control Structures and Embedded SQL: Control Structures – Nested Blocks – SQ L in PL/SQL – Data Manipulation – Transaction Control statements.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.

UNIT V (14 Hrs) PL/SQL Composite Data Types: Records – Tables – Varrays. Named Blocks: Procedures – Functions – Packages –Triggers – Data Dictionary Views.

Text Book

Year of S.No. Authors Title Publishers Publication 1. Nilesh Shah Database Systems Using 2nd edition, PHI 2012 Oracle

Reference Books

S.NO AUTHOR TITLE OF THE PUBLISHERS \ YEAR OF BOOK EDITION PUBLICATION Database Prentice Hall of 1 Rajesh Narang Management India, 2nd Edition 2011 Systems 2 Rakesh Saini, Database Vayu Edducation M.M.S.Rauthan, Abhay Management of India, 1st 2010 Saxena, Bindu Sharma System Edition 3 Oracle Database Satish Asnani PHI 2010 11g

Pedagogy  Chalk and talk, PPT, Discussion, Interactive Teaching, Group discussion, Quiz.

Course Designer Mrs.K.Sathiyakumari

Category L T P Credit IN16CP3 RDBMS LAB III - - 60 2

Preamble

Experience to the learners in SQL, PL/SQL programming based on concept learned with program course. Implementation of RDBMS commands such as DDL, DML, and DCL. Implementation of PL/SQL programming such as procedure, trigger and cursor.

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

CO CO Statement Knowledge Number Level CO1 Understand and explain the underlying concepts of database K1 technologies CO2 Design and implement a database schema for a given problem-domain K1 and Normalize a database CO3 Populate and query a database using SQL DML/DDL commands. K2 CO4 Use and enforce integrity constraints on a database using a state-of-the- K3 art RDBMS CO5 Programming PL/SQL including stored procedures, stored functions, K3 cursors, packages.

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 CO1 S M M M CO2 M S S S CO3 M M S S CO4 M S S S CO5 S S S S

S- Strong M-Medium L-Low

Syllabus

LIST OF PROGRAMS:

 Create, insert, update , delete and alter table  Implementing different operators.  Implementing column format.  Implementing built-in functions.  Implementing PL/SQL Block.  PL/SQL block to find the E-Bill.  Splitting the table.  Joining the tables.  Implementing Recursive functions  Database triggers and cursors.  Trigger for Master detailed Relationship. Pedagogy

 System, White board. Course Designer

Mrs. K. Sathiyakumari

JOB ORIENTED COURSE

Title : Mobile Application Development

Subject Code : JOB1629

OBJECTIVE: Students can find jobs as mobile computing professionals and application developer.

UNIT I Overview - Environment Setup - Architecture - Applications Component - Developer Tools - SDK Manager – Emulator- Hello World Example

UNIT II Activities - Services - Broadcast Receivers - Content Providers - Fragments - Intents & Filters - UI Layouts -UI Design - UI Controls - Event Handling - Styles & Themes – Notifications - Push Notification

UNIT III Location-Based Services - Sending Email - Sending SMS – Web View - Phone Calls - Publishing Android Application - Alert Dialog Tutorial - Animations - Audio Capture - Auto complete

UNIT IV Best Practices - Bluetooth - Camera - Custom Fonts - Gestures Image Effects - Image Switcher - Media Player – Multi touch - Navigation - Progress Circle - Progress Bar Using Progress Dialog

UNIT V SQLite Database - Login Screen - Internal Storage - JSON Parser - Loading Spinner - Localization - Network Connection - NFC Guide - PHP/MySQL - Sensors - Session Management - Sip Protocol -Support – Wi-Fi - Widgets - Xml Parser

TEXT BOOKS: 1) Android studio application development by belen cruz zapata 2) Beginning android programming with android studio by Jerome F. Dimarizio

REFERENCES: 1) http://www.tutorialspoint.com/android/android_tutorial.pdf 2) http://www.e-reading.club/bookreader.php/142063/Android_-_a_programmers_guide.pdf

List of Programs

1. Create a hello world android application 2. Create an android application layout with a. registration and login fragments b. UI controls for submitting details 3. Create an android application to find location using location based services 4. Create an android application to send email through native API 5. Create an android application a. send and receive SMS b. make phone calls 6. Create an android application to connect to a website using web view 7. Create an android application to access camera 8. Create an android application to capture gesture inputs 9. Create an android application to implement image switcher 10. Create an android application with progress circle 11. Create a android application of a. Registration with SQLite database b. Login with SQLite database 12. Create an android application to connect with MySQL through PHP 13. Create an android application to parse data using JSON 14. Create an android application to implement localization 15. Create an android application with session management

SEMESTER : III & IV TITLE : DATA ANALYTICS – LEVEL I: R PROGRAMMING SUBJECT CODE : SB17DA01 CREDITS : 4 Lecture Hours: 43 OBJECTIVE:  To provide a conceptual understanding of the basics of R programming and depth of exploratory data analysis.

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 III (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 (8 Hrs) Graphical Representation: R-PIE chart – Bar chart – Box plots-Histograms – line graphs - Scatter plots. TEXT BOOK: Course materials will be provided.

REFERENCE BOOKS

Publishers \ Year of S.No Author Title of The Book Edition Publication Pearson 1 Jared P. Lander R for everyone Education, 2nd 2015 Edition The Art of R 2 Norman Matloff 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

Semester : III & IV Title : OOSE- Level I: Software Design Tools Sub code : SB17SE01 Credits : 4 Lecture Hours : 43

Objective : To explore the basic building blocks of UML and to design various modelling diagrams using UML.

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- Life Cycle. UNIT II (9 Hrs) Structural ModelingBasic 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) BehavioralModelling : Use cases- Diagrams- Activity Diagrams. Advanced BehavioralModeling- 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 Book Publisher Publication 1 Martina Seidl, Marion UML @ Classroom: An Springer 2015 Scholz, Christian Introduction to Object-Oriented Huemer, GertiKappel Modeling 2 Martina Seidl, Marion An Introduction to Object- Easy 2011 Scholz, Christian Oriented Modeling Reader Huemer, GertiKappel 3 Gandharba Swain Object-Oriented Analysis and Laxmi 2010 Design through Unified Publications

Note

* During Semester III, UNIT I, UNIT II till Advanced classes ** During Semester IV, in UNIT II from Advanced Relationships, UNIT III, UNIT IV and UNIT V

Category L T P Credit IN17C07 OPEN SOURCE TECHNOLOGIES III 71 4 - 4

Preamble

To provide the concepts of open source software and enable the students to learn Linux environment and implement the basics of MYSQL database.

Course Outcomes

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

CO CO Statement Knowledge Number Level Define the development model of OSS, and tell about the open-source CO1. K1 licensing. Demonstrate the installation of Linux by hard disk partioning and CO2. K2 process of working with files. Apply Networking Commands and set up Networking and cryptographic CO3. K3 services. Analyze shell programming by working with variables, control CO4. K3 structures and scripting. Develop Open Source Database by configuring MYSQL Server and CO5. K3 connecting to MYSQL with PHP.

Mapping with Programme Outcomes

COs PO1 PO2 P03 P04

CO1 M S S M

CO2 S S M M

CO3 S S M S

CO4 M M S S

CO5 S S S S

S- Strong M-Medium L-Low

Syllabus

UNIT I (14 Hrs) Open-Source Software Overview: Introduction – Need and Advantage of Open-Source Software – Foss- Free Software Movement –Open Source Movement- Open Source Licensing- Certification-OSS Development Model-Run a Free Software Project-Comparing OSS with other Software-OSS Licenses

UNIT II (15 Hrs) Open Source Operating System (LINUX): Installation of Linux (Red hat-CentOS): Hardisk Partitioning, Swap space, LVM, and Boot loader. Command Line: Basic File System Management Task, working with files, Piping and Redirection, working with VI editor, use of sed and understanding FHS of Linux.System Administration:Job management, Process Management, Mounting Devices and file system,Backup, Handling User Accounts, Groups and permission, Managing Software. Understanding Boot process and related files, Common kernel management Task

UNIT III (14 Hrs) Open Source (NETWORK AND SECURITY ADMINISTRATION): Networking Commands, Configuration of Apache Web Servers, DNS servers, DHCP servers, mail servers, NFS, FTP Servers.Securing servers with IPtables. Setting upNetwork and cryptographic services: SSL, Managing Certificatewith OpenSSL, working with the GNU Privacy guard.

UNIT IV (14 Hrs) Open Source Operating System (SHELL PROGRAMMING): Bash Shell Scripting, Executing Script, Working withVariables and Input, Using Control Structures, Handling signals, creating functions, working sed and gawk, working with web using shell script: Downloadingweb page,Converting Web page content to a text file, parsing data, working cURL.

UNIT V (14 Hrs) Open Source Database And Application: MySQL: Configuring MySQL Server, working with MySQL Databases, MySQL Tables, SQL Commands – INSERT, SELECT, UPDATE, REPLACE, DELETE. Date and Time functions in MySQL. PHP – MySQL Application Development: Connecting to MySQL with PHP, Inserting data with PHP, Retrieving data with PHP.

TEXT BOOKS

S.no Author Title of book Publisher Yearof publication 1 Prof.DayanandAmbawade, Linux Labs And Dream Tech Press 2014 Deven Shah Open Source Technologies 2 Julie C Meloni PHP, MySQLand Pearson Education 2009 Apache

REFERENCE BOOKS

S.no Author Title of book Publisher Year of publication 1 Peterson The Complete Tata McGraw HILL 2010 Reference Linux 2 Steve Suehring, PHP6 and MySQL Wiley-India, New 2009 Tim Converse Bible Delhi and Joyce Park

Pedagogy  Chalk and talk, PPT, Discussion, Assignment, Demo, Quiz, Case Study.

Course Designer Mrs. A. Sindhu.

PMP1705 DIGITAL ELECTRONICS AND Category L T P Credit MICROPROCESSOR III 71 4 - 4

Preamble

To provide introduction to the principles and practices of digital electronics and computer system, programming aspects of microprocessor covering both hardware and software based on the 8085 microprocessor family.

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

CO CO Statement Knowledge Number Level Understand the basic principles of digital electronics and CO1 K1 microprocessors. CO2 Discussion on the design of Multiplexers and Flip-Flops K2

CO3 Outline the Microprocessor instruction set and Architecture K2

CO4 Identify and explain the need for advance micro processors K3 Develop to take up the challenges in building useful microprocessor CO5 K3 based applications.

Mapping with Programme Outcomes COs PO1 PO2 PO3 PO4 CO1 S S M M

CO2 M S S M

CO3 S M S M

CO4 S S M S

CO5 M S S M

S- Strong; M-Medium; L-Low

Syllabus

UNIT I (15 hrs) Logic Circuits: Gates –AND ,OR,NOT,NAND ,NOR Gates & Truth tables-Boolean Algebra- Karnaugh maps, Product of Sums method, Sum of product method, Don’t Care condition – Multiplexers, Demultiplexers-Flip flops: RS ,JK ,D,T-Decoders.

UNTI II (14 hrs) Shift Register, Half adder, Full adder, BCD Adder, Semiconductor memories: ROM, RAM, Digital Recording Techniques. UNIT III (14 hrs) Microprocessor: Microprocessor Instruction set and Computer languages –from large computer to single-chip micro controllers-micro processor architecture & its operations –memory-Input output (I/O) devices. UNIT IV (14 hrs) The 8085 Programming model: Instruction classification-instruction format-how to write, assemble and execute a simple program-overview of the 8085 instruction set-programming techniques: Looping, counting and indexing-additional data transfer and 16 bit arithmetic instructions UNIT V (14 hrs) The 8259A programmable interrupt controller – Direct memory Access (DMA) and the 8237 DMA controller. Microprocessor Applications - Designing scanned displays - Memory Design.

Text Books

Year of S.No. Authors Title Publishers Publication Digital Logic & Computer Prentice Hall 1. Morris Mano Design 2008 India,1st Edition (UNIT I &II) Microprocessor Penram Architecture Programming International 2 Ramesh Gaonkar and Applications with the Publishing , 5th 2011 8085 Edition (UNIT III,IV,V)

Reference Books Year of S.No. Authors Title Publishers Publication Microprocessor & Ubs Publishers Mohamed 1. Microcomputer-Based Distributers Pvt 2003 Rafiquzzaman System Design Ltd, 1st Edition Vikash Publishing S.Salivahanan, 2 Digital Circuits & Design house Pvt Ltd, 3rd 2009 S.Arivazhigan Edition

Pedagogy

Chalk and Talk, PPT, Demo, Discussion, Quiz, and Assignment.

Course Designer

S. Kiruthika Devi

VB.Net Programming Category L T P Credit IN17C09 III 71 4 - 4

Preamble

To understand .Net frame work and enhancing in depth knowledge in VB.net and to enable them to developing simple projects.

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

CO CO Statement Knowledge Number Level Tell about the .Net frame work features and to develop VB.Net using CO1. K1 IDE. CO2. Usage of various Elements of VB.Net to develop programs using them K2 CO3. Solve the real world problems using looping , branching and arrays K3 Illustrate Menus and Toolbar, Dialog Boxes, Procedures by developing CO4. K3 programs. Examine the complexity of problems, Modularize the problems into CO5. K3 small modules and then convert them into programs

Mapping with Programme Outcomes COs PO1 PO2 P03 P04 CO1. S M S M CO2. S S S M CO3. M M S S CO4. S S S S CO5. S S S S

S- Strong M-Medium L-Low

Syllabus UNIT 1: Visual Basic .NET and the .NET Framework. (14 Hrs)

Introduction to .net framework- Components of .NET- Framework Class Library(FCL), Common Language Runtime (CLR) –Garbage collection-Assemblies – IDE components –toolbox, Solution explorer window, properties window, Server Explorer window, Adding controls the windows forms applications and Adding source code to the control, Application, Executing The . Variables, operators and constants

UNIT II: Common Controls (14 Hrs)

Introduction- Textbox, label , Link label, List Box Control, Checked Listbox Control, Picture box control, Pickers, Tree View Control, ListView controls, Rich TextBox, Button, Check Box Control, ComboBox Control, Masked TextBox Control, Notify Icon control, Progress bar control, tooltip control, control.

UNIT III: Programming in Visual basic .net (14 Hrs)

Conditional Logic : The If-then-Else statement, The Select-case statement, Do-Loop Statement, While-EndWhile Statement, For..Next Statement, For-Each Next Statement, A Complete Example. Arrays- Introducing Arrays, Multidimensional Arrays, The Array Class Members- An Example- Array of Arrays.

UNIT IV: Menus and Toolbar, Dialog Boxes, Procedures (14Hrs)

Menus and toolbars- Context Menu Strip, Status Strip, Tool strip, Tool Strip Container, Working with MDI, In-built Dialogs- PageSetupDialog, PrintDialog,Print Document, PrintPreviewControl, PrintPreviewDialog, ColorDialog, FolderBrowser Dialog, FontDialog, OpenFileDialog, SaveFileDialog, Procedures-Overview, Types of Procedures, Built-in functions.

UNIT V: Advanced Concepts in VB.Net (15 Hrs)

Concepts of Object Oriented Programming- Introduction, Classes , Constructors, Destructors, Inheritance, Overriding, Overloading, Polymorphism, Working with Database : Introduction, Databases, Server Explorer, Basic SQL Commands, Relational Database, Data Binding, Data Binding with Controls ADO.Net – Accessing ADO.NET Features and Namespaces- Using ADO.NET – Understanding Data Providers, Datasets.

Text Books

S.No Author Title Publishers Year of publication 1 Sham Tickoo, Learning Visual CADCIM 2009 Meenu Bhat Basic 2008 with Technologies, .NET Framework Pearson Education 3.5 2 Bill Evjen, Jason Visual Basic .NET Wiley 2014 Beres, et.al Programming Bible

Reference Books

S.No Author Title Publisher Year of publication 1 David Chappell Understanding .NET Pearson education 2006

2 Jeffery R. The Complete Reference Tata McGraw 2002 Shapiro Visual Basic .NET Hills

3 Julia Case Programming in VB.Net Tata McGraw 2007 Bradley, Anita Hills C.Millspaugh

Pedagogy

 Chalk and talk , PPT, Discussion , Assignment, Demo, Quiz, Case study

Course Designer

Mrs.R.Amsaveni

IN16CP4 Category L T P Credit VB.Net & Bio-Perl Programming Lab

III - - 60 3

Preamble

To develop applications using VB.Net programming. To implement programs to experiment DNA sequence.

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

CO CO Statement Knowledge Number Level CO1. Tell about the conditional statements , Array & Exceptions handling K1 and object oriented concepts CO2. Discuss the execution of the VB.Net program using Toolbars, Message K2 box and Input box functions. CO3. Illustrate the Dialog Controls , Mouse events & Menu Creation using K2 VB.Net CO4. Demonstrate Data Grid & Crystal Report and ADO Connectivity using K3 Programs Apply programming skills to experiment with GENBANK data, CO5. K3 sequences, DNA Fragments Transcription.

Mapping with Programme Outcomes COs PO1 PO2 PO3 PO4 CO1. S S M M CO2. S M S M CO3. S M M S CO4. M S M S CO5. S S S S

S- Strong M-Medium L-Low

Syllabus

1. Conditional statements. 2. Array & Exceptions handling. 3. OOP concepts. 4. Tool bars, Message box & Input Box functions. 5. Dialog Controls. 6. Mouse events & Menu Creation. 7. Data Grid & Crystal Report. 8. ADO Connectivity. 9. Write a script to Import data from Genbank using Bioperl 10. Write a script to extract all the features from a GenBank file using Bio::Seq in Bioperl 11. Concatenating DNA Fragments Transcription: DNA to RNA using Bioperl 12. Write a script to use sequence features to compare sequences and find Mutation using Bioperl

Pedagogy

 System, White Board, Demonstration through PPT

Course Designer

Mrs.R.Amsaveni.

MANAGEMENT INFORMATION Category L T P Credit PM17A01 SYSTEM III 86 4 - 5

Preamble To inculcate knowledge to students why information systems are so important today for business and as well as educate the role of the major types of information systems in a business environment.

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

CO CO Statement Knowledge Number Level Tell about the basic concepts and Roles of Management Information CO1 K1 Systems CO2 Describe the development of Business strategies, E-Business Models. K2 Discuss about the Decision Making concepts and Knowledge CO3 K2 Management in MIS Examine the applications in Manufacturing Sector and Service sector CO4 K3 in Industry. Illustrate the Enterprise Management System and Information Systems CO5 K3 processing.

Mapping with Programme Outcomes

COs PO1 PO2 P03 P04

CO1 S M S M CO2 S S S M CO3 M M S S

CO4 S S S S

CO5 S S S S

S- Strong M-Medium L-Low

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 – Organisational Behaviour. Process Management: Planning – Organising – Staffing – Coordinating – Directing and – Controlling.

UNIT II (17Hrs) 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 (17 Hrs) Applications in Manufacturing Sector: Personnel, Financial, Production, Raw Material and Marketing Managements. Applications in Service Sector: Introduction to Service Sector – Creating a Distinctive Service 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.

Text Book

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

Reference Books

Year of S.No Authors Title Publishers Publication 1 James A O’Brien Management Information Tata McGraw Hill, 2014 & George M Systems 10th Edition Marakas 2. Kenneth C Management Information PHI 12th Edition, 2011 Laudon& Jane Systems managing the ISBN-13: 978- p.Laudon digital firm 0132142854.

3 MahadeoJaiswal& Management Information Oxford 2004 Monika Mital Systems University Press 4th Edition

Pedagogy

 Chalk and talk, PPT, Group Discussion, Assignment

Course Designer

Ms. S. Kalaipriya

SEMESTER : III & IV TITLE : DATA ANALYTICS – PRACTICLA I: R – PROGRAMMING SUBJECT CODE : SB17DAP1 CREDITS : 2 Practical Hours: 45 Objective To perform statistical operations and generate R data analysis reports.

1. R Program for Vector operations. 2. Create a R- list. 3. Implement matrices addition, subtraction and Multiplication. 4. Create a Data frame. 5. Create a factor object. 6. Import data, copy data from CSV file to R. 7. Create a R program for Mean median and mode. 8. Draw Bar charts and Pie charts in R. 9. Make visual representations of data for plotting functions in R. 10. Create a R program for Regression Model.

Note

*During Semester III Program 1 to program 6 **During Semester IV Program 7 to program 10

 Semester : III & IV Title : OOSE –Practical I : Software Design Tools Sub.Code : SB17SEP1 Credits : 2 Practical Hours : 45

Objective: To apply and develop the UML diagrams for application

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] 1. Write the complete problem statement 2. Write the software requirement specification document 3. Draw the entity relationship diagram 4. Draw the data flow diagrams at level 0 and level 1 5. Draw use case diagram 6. Draw activity diagram of all use cases 7. Draw state chart diagram of all use cases 8. Draw sequence diagram of all use cases 9. Draw collaboration diagram of all use cases 10. Assign objects in sequence diagram to classes and make class diagram

Note:

* During Semester III, Program 1 to 6 ** During Semester IV, Program 7 to 10

Category L T P Credit PJA1710 JAVA PROGRAMMING III 71 4 - 4

Preamble This course gives in-depth knowledge of JAVA language for creating safe robust object- oriented multithreaded interactive programs. It also sheds light around wide spread applications of the internet

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

CO CO Statement Knowledge Number Level Acquire knowledge of the structure and model of the Java programming CO1. K1 language CO2. Create Java programs that solve simple business problems. K2 Explore various programming paradigms as well as principles of CO3. K3 building object-oriented software CO4. Develop Java applications with (GUI). K3 CO5. Implement the Concept of streams and file handling K3

Mapping with Programme Outcomes COs PO1 PO2 P03 P04 CO1. S M M M CO2. S S S M CO3. S S M M CO4. S S S S CO5. S S S S

S- Strong; M-Medium; L-Low

Syllabus UNIT – I (14 Hrs) JAVA Evolution: History – Features – How 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 (15 Hrs) 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 (14 Hrs) Arrays, Strings and Vectors – Interfaces- Multiple Inheritance – Packages: Putting classes together – Multi Threaded Programming.

UNIT-IV (14 Hrs) Managing Errors and Exceptions – Applet Programming – Graphics programming: The Graphics class – Lines & Rectangles – Circles & Ellipses – Drawing Arcs – Drawing Polygons – Line Graphs – Using Control Loops in Applets – Drawing Bar Charts.

UNIT- V (14 Hrs) 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. Authors Title Publishers Publication Tata Mc Graw Programming with Java – A 2015 1 E. Balagurusamy Hill,5th Edition, primer

Reference Books

S.No Author Title of book Publisher Year of publication Herbert Schildt Java: The Complete McGraw Hill 9th Edition, 1 Reference Education 2014

John Dean & Introduction to McGraw-Hill 2nd Edition, 2 Raymond Dean Programming with Higher Education 2013 Java: A Problem Solving Approach Poornachandra Java programming by TataMcGraw Hill 3 Sarang by oracle press guide 2012 Professional

Pedagogy

 Chalk and talk , PPT, Discussion , Assignment, Demo, Quiz, Case study

Course Designer Mrs. J. Maria Shyla Thomas

Category L T P Credit PCG1711 III 71 4 - 4

Preamble The course gives knowledge of computer graphics and articulates the essential components of 2D and 3D transformation. And also understand the various algorithms and techniques used for detection and rendering methods. Course Outcomes On the successful completion of the course, student will be able to

CO CO Statement Knowledge Number Level CO1 Understand the basic concept of graphics devices and its uses. K1 CO2 Discuss about the methods and able to use the underlying algorithms K2 for geometrical drawing methods. CO3 Outline the Basic transformation and viewing of 2D transformation. K3 CO4 Classifying the graphical input and request modes K3 CO5 Learning the basic 3D transformation and examine the algorithms K3 handled.

Mapping with Programme Outcome

COs PO1 PO2 PO3 PO4 CO1 M M M S CO2 S M S M CO3 M M S M CO4 S S M S CO5 S M S S S – Strong M – Medium L – Low

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

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

Reference Books

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

Pedagogy

 Lecture, Discussion, Quiz, Assignment, Demo, PPT

Course Designer Ms. B.Sivaranjani

SOFTWARE ENGINEERING AND Category L T P Credit IN17C12 TESTING III 71 4 - 4

Preamble

The course is designed to impact the knowledge on building reliable software products. It also emphasize various testing’s undergone to enhance the quality of the software.  Course Outcomes On the successful completion of the course, students will be able to

CO CO Statement Knowledge Number Level CO1. Recall about the software evolution and software engineering practice. K1 CO2. Illustrate on various Phases of software Project and its life cycle models. K2 CO3. Classify the various building models in software development. K2 CO4. Apply the various software testing tactics and its Methodologies. K3 Identify the System, Acceptance and Performance Testing’s criteria and CO5. K3 its best practice.

Mapping with Programme Outcomes Cos PO1 PO2 P03 P04 CO1. S S M S CO2. S S S M CO3. S S S S CO4. S S M S CO5. S S M S

S- Strong M-Medium L-Low

Syllabus UNIT I (14 hrs) Introduction to Software Engineering: The Evolving role of Software - Software - Changing nature of Software - Legacy Software - Software myths. Software Engineering Practice: Software engineering practice - Communication practices - Planning practices - Modeling practices - Construction practice- Deployment.

UNIT II (14 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. System Engineering: Computer based systems – The system Engineering Hierarchy.

UNIT III (15 hrs) Building the Analysis Model: Requirement Analysis - Analysis Modeling Approaches – Data Modeling concepts - Object Oriented Analysis -Flow Oriented Modeling-Design Engineering - Design concepts - The design model-Modeling component-Level Design: Designing class Based components.

UNIT IV (14 hrs) Testing Tactics: Software Testing Fundamentals -Types of Testing: White Box Testing - Static Testing-Structural Testing-Black Box Testing- Challenges in White Box and Black Box Testing. : Integration Testing- Integration Testing as Type of Testing.

UNIT V (14 hrs) System and : Overview- versus Non- functional Testing-Functional testing - Non-functional Testing – Acceptance Testing and its criteria –Performance Testing: Factors governing Performance testing-What is - Best Practices in Regression Testing. Text Books

Year of S.No Authors Title Publishers Publication 1. Software Engineering: A McGraw-Hill Roger S. Pressman 2010 Practitioner's Education Approach 2. Srinivasan Desikan Software Testing Pearson Education , Gopalaswamy Principles and 2012 Ramesh Practices

Reference Books

Year of S.No Authors Title Publishers Publication Fundamentals of Prentice Hall of 1. 1 Rajib Mall Software India Pvt Ltd, 2010 . rd Engineering 3 Edition Sandeep Software Testing: A PHI Learning Pvt. 2. 2 Desai, Abhishek 2012 Practical Approach Ltd Srivastava Selenium 2 Testing Tata MCGraw 2012 3. 3 David Burns Tools: Beginner's Hill Edition

Guide

Pedagogy

 Chalk and Talk , PPT , Discussion, Assignment, Demo, Quiz, Case study.

Course Designer Mrs. T. Hashni

CLOUD COMPUTING Category L T P Credit IN17E01 III 71 4 - 5

Preamble Articulate the main concepts, key technologies, strengths, and limitations of cloud computing and the possible applications for state-of-the-art cloud computing. Course Outcomes On the successful completion of the course, students will be able to

CO CO Statement Knowledge Number Level CO1. Tell about the fundamentals of cloud computing. K1 Describe the scaling techniques in computer system and managing the CO2. K2 cloud data. CO3. Discuss about tracing and exploring cloud services. K2 CO4. Examine about cloud managing and security. K3 CO5. Illustrate about managing desktops and devices in the cloud. K3

Mapping with Programme Outcomes

COs PO1 PO2 P03 P04 CO1. S M S M

CO2. S S S M CO3. M S S S

CO4. S S M S

CO5. S S S S

S- Strong M-Medium L-Low

Syllabus UNIT I (14 hrs) Introduction cloud computing: Grasping the fundamentals- Discovering the value of the cloud for business getting inside the cloud-developing your cloud strategy.

UNIT II (15 hrs) Understanding the nature of the cloud-seeing the advantages of highly scaled data centre- Exploring the technical foundation for scaling computer systems-checking the cloud workload strategy – managing data

UNIT III (14 hrs) Examining the cloud elements: Seeing infrastructure as a service-Exploring platform as service.

UNIT IV (14 hrs) Managing the cloud: Managing and securing cloud service – Governing the cloud - Virtualization and the cloud.

UNIT V (14 hrs) 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. Authors Title Publishers Publication Judith Hurwitz,Robin Cloud Computing For Willey India 1. Bloor Marcia 2010 Dummies Publication Edition Kaufman and Dr. Fernhalper Reference Books

S.No Author Title of book Publisher Year of Publication 1 Prasant Kumar Fundamentals of Cloud Vikas Publishing 2014 Pattnaik Computing House

2 RajkimarBuyya.,et.al Cloud Computing: Wiley 2013 Principles and publications Paradigms

Pedagogy

 Chalk and talk, PPT, Group Discussion, Assignment

Course Designer  S.Kalaipriya

WIRELESS SENSOR NETWORKS Category L T P Credit IN17E02 III 71 4 - 5

Preamble The course is designed to understand the role of sensors and networking applications. Examine the essential sensor nodes, routing issues and energy constraints. Learn the networking and sensor platform tools.

Course Outcomes On the successful completion of the course, student will be able to CO CO Statement Knowledge Number Level CO1 Acquire knowledge in unique constraints & Challenges and define K1 the sensor networking CO2 Discuss about sensor networking architecture K2 CO3 Outline the general issues in routing K3 CO4 Classifying the topology and task control activity K3 CO5 Analyze Sensor Network platforms and tools K3

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 CO1 S M M S CO2 M S S M CO3 M S S S CO4 M S S M CO5 S M M S S – Strong M – Medium L – Low

Syllabus

UNIT I OVERVIEW OF WIRELESS SENSOR NETWORK (14 hrs) Introduction: Unique Constraints and Challenges-Advantages of Sensor Networks-Sensor Network Applications- Collaborative Processing- Key Definitions of Sensor Networks.

UNIT II ARCHITECTURES (15 hrs) Single-Node Architecture - Hardware Components, Energy Consumption of Sensor Nodes, Operating Systems and Execution Environments, - Sensor Network Scenarios, Optimization Goals and Figures of Merit, Gateway Concepts.

UNIT III NETWORKING SENSORS (14 hrs) Key Assumptions- Medium Access Control – General Issues- Geographic, Energy-Aware Routing-Attribute-Based Routing.

UNIT IV INFRASTRUCTURE ESTABLISHMENT (14 hrs) Topology Control –Clustering- Time Synchronization- Localization and Services- Sensor Tasking and Control.

UNIT V SENSOR NETWORK PLATFORMS AND TOOLS (14 hrs) Sensor Node Hardware – Berkeley Motes, Programming Challenges, Node-level software platforms, Node-level Simulators, State-centric programming.

Text Books

S.No Author Title of Book Publisher Year of Publication 1 Fengzhao and Wireless Network- An Elesiver 2007 Leonidas J. Information processing publication Guidas Approach 2 Protocol and Architecture for John wiley and 2007 Holger Karls Wireless Sensor Network sons ltd Andreas Willing

Reference Books S.No Author Title of Book Publisher Year of Publication 1 Fengzhao and Wireless Sensor Network John willey 2003 Leonidas J. Design Guidas 2 Kazemsohraby Wireless sensor network- John willey 2007 Daniel minoli and Technology Protocol and Taiedznati Design

Pedagogy

 Chalk and talk, PPT, Group Discussion, Assignment

Course Designer Ms. B.Sivaranjani

Category L T P Credit IN17E03 PYTHON PROGRAMMING III 71 4 - 5

Preamble

The course covers basic knowledge of Python Programming. It defines the Conditional Statements & Loops, Functions, Python data structures and Exception & its tools.

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

CO CO Statement Knowledge Number Level CO1. Tell about the uses of Python and Python runs and K1 CO2. Classify the Types and Operations of Python K2 CO3. Relate the Statements & Syntax and its Function basics K2 CO4. Apply various Class Coding Basics and OOP K3 CO5. Identify the Exception Basics, coding, and designing K3

Mapping with Programme Outcomes

COs PO1 PO2 P03 P04

CO1. M S M M

CO2. S M M S CO3. S M S M

CO4. M S S M

CO5. S M S M

S- Strong; M-Medium; L-Low

Syllabus

UNIT I (14 Hrs) Introduction: Why do people use python?- Python a scripting language- Users of Python- Need of Python- Python’s Technical Strengths. How Python runs programs: Introducing the Python Interpreter- Program Execution-Execution Model Variation: Python Implementation Alternatives.

UNIT II (14 Hrs) Types & Operations: Numbers Types: Numeric type basics, Numbers in action, Other numeric types- Strings Fundamentals: String Basics, String Literals, Strings in action, String Methods – Lists and Dictionaries-Tuples- Files.

UNIT III (15 Hrs) : Statements& Syntax: Assignment- Expressions & Print- if tests-While & for loops. Functions: Function Basics: Why use functions- Coding Functions- Definition & Calls. Scopes: Python basics- Global Statement-Scopes & Nested functions.-Arguments: Arguments passing Basics- Special Arguments Matching Modes.

UNIT IV (14 Hrs) Classes & OOP: OOP: Introduction-Class Coding Basics- Class Coding details: Class statement- Methods- Inheritance. Designing with classes: Python and OOP-OOP Inheritance, Composition, Delegation-Methods and Classes act as Objects-Multiple Inheritance.

UNIT V (14 Hrs) Exception &Tools: Exception Basics-Exception Coding Details- Exception Objects- Designing with Exceptions.

Text Book

Year of S.No. Authors Title Publishers Publication Mark Lutz ISRD O’Reilly Publication 2013 1. Learning python Group 5th edition Reference Books

Year of S.No. Authors Title Publishers Publication Mark 1. Programming in python 3 Pearson Education 2009 Summerfield

2. Mark Pilgrim Dive into python 3 Apress publication 2011

Southern Adventist Richard L. Fundamentals of Python 3. University 2017 Halterman Programming

Pedagogy

 Chalk & talk, PPT, Discussion, Assignment, Demo, Quiz

Course Designer

Mrs.R.Jayasree

JAVA PROGRAMMING & Category L T P Credit IN16CP5 BIO-PYTHON LAB III - - 75 3

Preamble The course is designed to build software development skills using java programming for real world applications. The emphasis will be on programming techniques and help to develop Internet programming. The goal of Bio-python is to make it as easy as possible to use Python for bioinformatics by creating high-quality, reusable modules and classes.

Course Outcomes

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

CO CO Statement Knowledge Number Level CO1. Understand fundamentals of object-oriented programming in Java K1 CO2. Develop Applet programming to solve the problems K2 CO3. Implement to create, debug and run web based application K3 Understand how to retrieve & split sequences from FASTA and CO4. K1 GenBank Demonstrate conversion of sequence file formats and manipulations in CO5. K2 sequence files

Mapping with Programme Outcomes

COs PO1 PO2 P03 P04 CO1. M M S M CO2. S S S S CO3. S S S S CO4. M M M M M CO5. S S S

S- Strong M-Medium L-Low

Syllabus

 Using Control Structures  Constructor concept  Applet Programming  Frame Concept & Usage of Various Controls  Events & Interface   Multi threading &Thread Priority  Program to retrieve sequences from FASTA and Genbank files using BioPython  Write a program to split a sequence file into a set of smaller files, each containing a subset of original file's sequences using BioPython  Write a program to convert between sequence file formats using BioPython  Write a program to do manipulations in sequence files such as reading sequence files, Iterating records over another, listing the records and extracting data using BioPython

Pedagogy

 System, White Board

Course Designer Mrs. J. Maria Shyla Thomas

Semester : V& VI Title : Data Analytics - Level II : Data Visualization Tools Sub code : SB17DA02 Credits : 4 Lecture Hours : 43

Objective:

The course is aimed at providing exposure on data visualization tools. It will provide skills to present data effectively through chart, map and dashboard.

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)

Dashboards: Creating Dashboard - Formatting a Dashboard - Actions in Dashboard - Sharing reports.

Text book : Course material will be provided

Reference Books Year of S.No Author Title of Book Publisher Publication Visualize This: The FlowingData st

1 Nathan Yau Guide to Design, Visualization, and Wiley, 1 Edition 2011 Statistics Storytelling with Data: A Data Cole 2 Visualization Guide for Business John Wiley & Sons 2015 NussbaumerKnaflic Professionals

Note * During Semester V - UNIT I, UNIT II till Data Tables

** During Semester VI - Scatter Chart in UNIT II, UNIT III, UNIT IV and UNIT V

Semester : V & VI Title : OOSE- Level II: Software Testing Tools Sub code : SB17SE02 Credits : 4 Lecture Hours: 43

Objective: The course covers the testing process, planning strategies to test the script using testing tools.

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 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- definition- Necessity of test case documentation- Rules to be followed- Test Case Design methods- 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 - Performance Test approach. VuserScript 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 Books: S.No Author Title of book Publisher Year of publication 1. Nageswara Rao Pusuluri Software Testing Dream Tech Press 2012 Concepts and Tools 2. Dr. K.V.K.K Prasad Software Testing Dream Tech Press 2007 Certification study guide

Reference Books: S.No Author Title of book Publisher Year of publication 1. Dr. K.V.K.K.Prasad Software Testing Dreamtech press, 2012 Tools Reprint ISBN Note: * During V semester, UNIT I & UNIT II till Test Design ** During VI Semester, UNIT II from Test Case Definition, UNIT III to V

Semester : V Title : Information Security - Level II Sub Code : NM13IS2 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 , and information security.

UNIT I (5 Hrs) Information security: History of IS-What is security?-characteristic of IS-components of I system –security system life cycle model.

UNIT II (6 Hrs) : 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

TEXT BOOKS

S.no Author Title of book Publisher Year of publication 1 Dr.Michael E. Principles and Course 4th edition, 2012 Whitman, Herbert Practices of Technology J. Mattord Information Security Cengage Learning 2 Atul Kahato Cryptography and McGraw Hill 3rd Edition 2012 Network Security Education 3 William Stallings Network Security Prentice Hall 2nd Edition 2009 Essential Applications and standard 4 Devan N. Shah Information Security Wiley India 2009 Principles and Practice

Semester : V Advance Level Course : 1 Paper : 1 Title : Data Mining Sub code : IN16AC1 Credits : 5*

COURSE OBJECTIVE:

This paper helps the students to gain knowledge about various techniques used in variety of industries. Data mining has become an essential practice for maintaining a competitive edge in every phase of the customer life cycle. To understand various tools of Data Mining and their techniques to solve the real time problems

UNIT-I Introduction -What is Data mining , Data mining -important Data mining -various kind of data Data mining Functionalities –Various kinds of Patterns Pattern Interesting Classification of Data mining Systems Data mining Task Primitives Integration of Data Mining System Major issues in Data Mining

UNIT-II Data Processing -Process the Data Descriptive Data Summarization –Measuring Central Tendency Dispersion of Data Graphic Displays of –Basic Descriptive Data Summaries Data Cleaning. Data Integration and Transformation- data Reduction-Data Discrimination -Concept Hierarchy Generation.

UNIT-III Data Warehouse OLAP Technology An overview -Data Warehouse Multidimensional Data Model, Data Warehouse Architecture- Data Warehouse Implementation From Data Warehouse to Data Mining

UNIT-IV Mining –Frequent Patterns Associations Correlations -Basic Concepts Road Map Efficient Scalable Frequent Item set Mining methods Mining –Various Kinds of Association rules Analysis -Association mining to Correlation Constrain Based Association mining

UNIT-V Applications Trends -Data mining Applications Data mining –System Products Research Prototype Additional Themes on Data Mining Social impact of Data mining Trends in Data mining

Text Books

S.No Author Title ofBook Publisher Year of Publication 1 Karguta, Joshi, Data Mining PHI 2007 Sivakumar 2. Ian H. Witten Data Mining Morgan Kaufmann 2009 &Eibe Frank Publishers

Reference Books

S.No Author Title of Book Publisher Year of Publication 1 Jiawei Han and Data Mining Morgan Kaufmann An imprint of MichelineKamber Concepts and Publishers Elsevier Techniques 2. N.P.Gopalan,B.Sivaselvan Data Mining PHI 2009 Techniques and Trends

Semester : V Advance Level Course : 1 Paper : 2 Title : Information Retrieval Sub code : IN16AC2 Credits : 5*

Course Objective

Understand the concepts of document representation, document indexing, digital information storage, retrieval, and distribution. Summarize the advantages and disadvantages of different information-retrieval design models. Translate vague information needs into specific queries that a given IR system can parse and execute correctly.

UNIT I Boolean retrieval: Information retrieval problem - Processing Boolean queries - Boolean model versus ranked retrieval. The term vocabulary and postings lists: Document delineation and character sequence decoding - Determining the vocabulary of terms - Faster postings list intersection via skip pointers

UNIT II Dictionaries and tolerant retrieval: Search structures for dictionaries - Wildcard queries - Spelling correction - Phonetic correction. Index construction: Hardware basics - Blocked sort- based indexing - Single-pass in-memory indexing - Distributed indexing - Dynamic indexing .

UNIT III Scoring, term weighting and the vector space model: Parametric and zone indexes - Term frequency and weighting - The vector space model for scoring. Evaluation in information retrieval: Information retrieval system evaluation - Standard test collections - Evaluation of unranked retrieval sets - Evaluation of ranked retrieval results

UNIT IV XML retrieval: Basic XML concepts - Challenges in XML retrieval - A vector space model for XML retrieval - Evaluation of XML retrieval - Text-centric vs. data-centric XML retrieval.

UNIT V Text classification and Naive Bayes: The text classification problem - Naive Bayes text classification - Properties of Naive Bayes - Feature selection - Evaluation of text classification.

Text Book

Year of S.No. Authors Title Publishers Publication Christopher D. Cambridge University Manning, Prabhakar Introduction to 1 Press, New York, 2008 Raghavan, Henrich Information Retrieval 1st Edition Schutze

Reference Books

S.No Author Title of book Publisher Year of Publication 1 Stefan Information Retrieval - MIT Press 2012 Buttcher et.al Implementing and Evaluating 2 Dr Ricardo Modern Information Addison Wesley 2011 Baeza-Yates et.al Retrieval: The Concepts and Technology 3 DavidA. Grossman Information Retrieval Universities Press, 2010 and Ophir Frieder 2nd Edition,

PRINCIPLES OF DATA Category L T P Credit IN17C13 COMMUNICATIONS AND NETWORKS III 71 4 - 4

Preamble

The subject is intended to provide the student with the in-depth knowledge of Networks. It also sheds light around wide spread applications of the Internet. Course Outcomes On the successful completion of the course, students will be able to

CO CO Statement Knowledge Number Level Tell about the Fundamental concepts of Data communication and CO1. K1 Networking. Illustrate on Transmission media, Network Topologies, Switching and CO2. K2 Routing algorithms. CO3. Classify the various types of networking concepts and OSI Model. K2 Examine the Internetworking, Internet basics and its Communication CO4. K3 Protocol. CO5. Identify about features and Reliable of Network Protocol Suits. K3

Mapping with Programme Outcomes COs PO1 PO2 P03 P04 CO1. S S M S CO2. S S S M CO3. S S M M CO4. S M S S CO5. S S S M S- Strong; M-Medium; L-Low

Syllabus UNIT I (14 Hrs) Introduction to Data Communications and Networking: Fundamental concepts ,Data communication- Protocols, Standard and its Organization-Analog and digital signals- Modes of Data Transmission: Parallel and serial Communication-Asynchronous , Synchronous , Isynchronous Communication-Simple, Half duplex, Full duplex communication– Transmission Errors: Detection and Correction:Error classification-Types of Errors-Error Detection.

UNIT II (15 Hrs) Transmission Media: Guided Media, Unguided Media – Network Topologies: Mesh, Star, Tree, Ring, Bus – Switching: Circuit switching; Message switching, Packet switching – Routing Algorithms: Routers and Routing –Routing Algorithms.

UNIT III (14 Hrs) Local Area Networks (LAN) , Metropolitan Area Networks (MAN) and Wide Area Networks (WAN): LAN - Ethernet-Token Ring-FDDI-MAN - WAN Architecture-Transmission Mechanism-Addressing – Network Protocols and OSI Model: Protocols in computer communication-OSI Model-OSI Layer Function. UNIT IV (14 Hrs) Internetworking Concepts, Devices, Internet Basics, History and Architecture: Internetworking-and its Problem – Internetworking Devices-Repeater-Bridges-Routers-Gateways- Internet Topology-TCP/IP Basics- IP Addresses-Internet Control Message Protocol (ICMP). UNIT V (14 Hrs) TCP/IP: Features of TCP, Relationship between TCP and IP, Ports and Sockets, TCP connections, what makes TCP Reliable, TCP Packet Format – User Datagram Protocol (UDP)- UDP Packet, Difference between UDP and TCP – Domain Name System (DNS)–File Transfer Protocol (FTP). Text Book

Year of S.No Authors Title Publishers Publication Achyut S.Godbole, Data Communications Tata McGraw-Hill 1. 2011 Atul Kahate and Networks Education, 2nd Edition Reference Books

Year of S.No Authors Title Publishers Publication Andrew S. Prentice Hall of India, 2012 1. Computer Networks Tanenbaum 4th Edition Tata McGraw-Hill Pub Behrouz A. Data Communications Company Ltd, 4nd 2012 2 Forouzan and Networking Edition,

PHI Learning Pvt Ltd Data Communication & 2014 3 Prakash C.Gupta 2nd Edition Computer Networks

Pedagogy  Chalk and Talk, PPT, Discussion, Assignment, Demo, Quiz, Case study.

Course Designer Mrs. T. Hashni

Category L T P Credit IN17C14 INTERNET OF THINGS III 71 4 - 4

Preamble

The course covers the fundamentals of IoT, Understand IoT Market perspective, IoT Architecture and Data and Knowledge Management and use of Devices in IoT Technology. To build a small low cost using Arduino / Raspberry Pi or equivalent boards. Apply the concept of Internet of Things in the real world scenario.

Course Outcomes

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

CO CO Statement Knowledge Number Level CO1. Understand the vision of IoT from a global context. K1 CO2. Design a portable IoT using Arduino/ equivalent boards and relevant K2 protocols. CO3. Develop web services to access/control IoT devices. K3 CO4. Deploy an IoT application and connect to the cloud K3 CO5. Analyze applications of IoT in real time scenario K3

Mapping with Programme Outcomes Cos PO1 PO2 P03 P04 CO1. S M S M CO2. S S S M CO3. S S M S CO4. S S M M CO5. S M S M S- Strong M-Medium L-Low

Syllabus

UNIT I (14 Hrs) Fundamentals of IOT: Introduction-Characteristics-Physical design - Protocols – Logical design – Enabling technologies – IoT Levels – Domain Specific IoTs – IoT vs M2M.

UNIT II (14 Hrs) IOT design methodology: IoT systems management – IoT Design Methodology – Specifications Integration and Application Development.

UNIT III (14 Hrs) Building IOT with RASPBERRY PI : Physical device – Raspberry Pi Interfaces – Programming – / Packages – Web services.

UNIT IV (14 Hrs) Building IOT with GALILEO/ARDUINO : Intel Galileo Gen2 with Arduino- Interfaces - Arduino IDE – Programming - APIs and Hacks.

UNIT V (15 Hrs) Case studies and advanced topics: Various Real time applications of IoT- Connecting IoT to cloud – Cloud Storage for IoT – Data Analytics for IoT – Software & Management Tools for IoT.

Text Book

Authors Year of S.No. Title Publishers Publication 1. Arshdeep Bahga, Internet of Things – A hands- Hyderabad : 2015 Vijay Madisetti on approach Universities Press 2. Manoel Carlos Intel® Galileo and Intel® Apress 2014 Ramon, Galileo Gen 2: API Features and Arduino Projects for Linux Programmers

Reference Books

S.No Author Title of the Book Publishers \ Year of Edition Publication David Easley Networks, Crowds, and Cambridge 2010 1 and Jon Markets: Reasoning About a University Kleinberg Highly Connected World; Press. United Kingdom:

2 Honbo Zhou The Internet of Things in the CRC Press. 2012 Cloud : A New york Perspective; 2 Francis Rethinking the Internet of 1st Edition, 2013 daCosta, Things: A Scalable Approach Apress to Connecting Everything Publications

Pedagogy

 Chalk and talk PPT, Discussion, Assignment, Demo, Quiz, Case study.

Course Designer K.Sathiyakumari

Category L T P Credit PWT1715 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 and HTML5 where scripting codes are embedded into HTML document for interactive presentation effect.

Course Outcomes

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

CO CO Statement Knowledge Number Level CO1. Define the knowledge about HTML document with element types, K1 hyperlinks, images, list, tables and forms CO2. Understand the concept of CSS for dynamic presentation effect in K2 HTML and XML documents. CO3. Describe the mark-up languages for processing, identifying and 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 CO1. S M S M CO2. S S S M CO3. M S M M CO4. M S S S CO5. M S S S

S- Strong M-Medium L-Low

Syllabus

UNIT I: (14 Hrs) Fundamentals of HTML: Understanding Elements: Root Elements-Metadata Elements-Section Elements-Heading Elements-Describing data types.

UNIT II (15Hrs) 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 Web Pages.

UNIT III: (14Hrs) DHTML: Introduction - Cascading Style sheets - DHTML Document and collections – Event Handling - Filters and Transitions - Data Binding.

UNIT IV: (14Hrs) 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 book Publisher publication PHI Learning N.P.Gopalan, Web Technology A Developer’s- 1 Pvt.,Ltd 4th Edition 2011 J.Akilandeswari Perspective

Reference Books

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

Pedagogy  Lecture, Group Discussion, PPT

Course Designer Mrs. A. Sindhu

Category L T P Credit IN16CP6 NETWORK & R TOOL LAB III - - 75 2

Preamble The course covers the basic concepts of network programming. It covers the use of client/server architecture in application development and experience on various networking protocol. It gives knowledge to install and configure R tool for an analytics programming environment and gain basic analytic skills via this high-level analytical language.

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

CO CO Statement Knowledge Number Level CO1 Understand and explain the underlying basic of concepts of network K1 CO2 Design and implement a networking concepts for a given problem- K1 domain CO3 Solve Asynchronous & Synchronous Communication, CRC and LRC K2 using Java networking commands. CO4 Use and enforce bioinformatics packages and use bioinformatics K3 online databases CO5 Programming R including list, data frame matrix and use different K3 packages.

Mapping with Programme Outcomes

COs PO1 PO2 PO3 PO4 CO1 S M M M CO2 M S S S CO3 M M S S CO4 M S S S CO5 S S S S S- Strong M-Medium L-Low

Syllabus

1. Vertical Redundancy Check & Longitudinal Redundancy Check (LRC). 2. Cyclic Redundancy Check (CRC). 3. Asynchronous Communication. & Synchronous Communication. 4. Stop & Wait Protocol. 5. Sliding Window Protocol.

6. Socket Program 7. Shortest Path Routing 8. Remote Procedure call under Client / Server Environment 9. Write a program to retrieve genome sequence data via the NCBI website using seqinr package and write it as a FASTA file. 10. Write a program to calculating the statistical significance of a pairwise global alignment and Viewing a long pairwise alignment. 11. Write a program to retrieving a UniProt protein sequence using SeqinR and Comparing 12. two sequences using a dotplot 13. Write a program to analyse and visualize graph for protein interaction data. Pedagogy

 System, White board.

Course Designers

Mrs. K. Sathiyakumari

Semester : VI Advanced level course : 2 Paper : 1 Title : Artificial Intelligence Subject code : PA16AC3 Credits : 5*

Objective: This subject deals with intelligent behavior, learning, and adaptation in machines, intended to assess the applicability, basic knowledge representation, problem solving and learning methods.

UNIT I: 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: 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: 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: Game playing: Overview – The minimax search procedure – Adding alpha – beta cutoffs – Additional refinements – Iterative Deepening – References on specific games. Understanding: What is understanding? What makes understanding hard? Planning- The blocks world- components of a planning system –Good stack planning-Coral Stack planning-Nom linear planning using constraint posting.

UNIT V: Expert systems: Representing & using domain knowledge – Expert system shells – Knowledge acquisition. Perception and Action: Real-time search – perception- Action – Robot Architectures. Prolog- the National languages of Artificial intelligence- introduction- converting English to prolog facts and rules-Goals-prolog terminology-Variables-Control structure-Arithmetic Operators-Matching in prolog-Backtracking.

TEXT BOOK:

TITLE OF PUBLISHERS \ YEAR OF S.NO AUTHOR THE BOOK EDITION PUBLICATION Elaine rich, Tata McGraw Artificial 1 Kevin Knight, Hill publication 2011 Intelligence Shivashankar B Nair 3rd Edition

REFERENCES BOOKS: TITLE OF THE PUBLISHERS \ YEAR OF S.NO AUTHOR BOOK EDITION PUBLICATION Artificial Prentice Hall of 1 Mishra R.B 2010 Intelligence India A Frist Course in Mc-Graw Hill 2 Deepak Khemani Artificial Educaion Pvt. 2013 Intelligence Ltd. Artificial Pearson, 3rd 3 Stuart Russell Intelligence: A 2013 Edition Modern Approach

Semester : VI Advanced Level Course : 2 Paper : 2 Title : Big Data Analytics Sub code : IN18AC4 Credits : 5*

Objective This Course deals with the Basics of Big Data and Hadoop architecture. It deals with working of MapReduce and Query Model of NoSQL Databases. It also includes the Advantages of MongoDB.

UNIT – I 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 Basics of Hadoop: Big Data and Hadoop – Hadoop Architecture – Main Components of Hadoop Framework – Analysing Big Data with Hadoop – Benefits of Distributed Applications – Hadoop Distributed File System – Advantages of Hadoop – Ten Big Hadoop Platforms.

UNIT-III MapReduce: Introduction to MapReduce –Working of MapReduce – Map operations – MapReduce User Interfaces.

UNIT-IV 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 HBase, CASSANDRA and JAQL: Introduction to HBase – Row-oriented and Column-oriented Data Stores – HDFS Vs HBase – Hbase Architecture – HBase Data Model – Introduction to Cassandra –Features of Cassandra . Introduction to JAQL – JSON – Components of JAQL. .

Text Book

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

Reference Books

S.No Author Title of Book Publisher Year of Publication 1 Frank J Ohlhorst Big Data Analytics: Turning Wiley and SAS 2012 Big Data into Big Money Business Series

2 Anand Rajaraman, Mining of Massive Datasets Cambridge 2012 Jeffrey David University Press Ullman 3 Paul Zikopoulos, Understanding Big Data: Tata McGraw Hill 2011 Chris Eaton, Paul Analytics for Zikopoulos Enterprise Class Hadoop and Streaming Data

Semester : V& VI Title : Data Analytics- Practical II : Data Visualization Tools Sub code : SB17DAP2 Credits : 2 Practical Hours : 45

Exercises to be performed using data visualization tool.

1. Create a bar chart for the given data 2. Create a pie chart for the given data 3. Create a scatter chart for the given data 4. Create a time series chart for the given data 5. Create a bullet chart for the given data 6. Create area chart for the given data 7. Create a heat map for the given data 8. Create a geo map for the given data 9. Create a filled map for the given data 10. Create a dashboard and format it

Note * During Semester V – Exercises 1 to 6

** During Semester VI - Exercises 7 to 10

Semester : V & VI Title : OOSE –Practical II: Software Testing Tools Sub code : SB17SEP2 Credits : 2 Practical Hours: 45

1. Write a test case based on controls.

2. Test data in a flat file.

3. Manual test case to verify student grade

4. Write and test a program to select the number of students who have scored more than

60 in any one subject(or all Subjects)

5. Write and test a program to login a specific web page.

6. Write and test a program to get the number of list items in a list / combo box.

7. Test a HTML file.

8. Test a program in MS Excel for Data Driven Wizard.

9. Test the addition of two values in C++ Program.

10. Write a test suite containing minimum 4 test cases.

Note:

*During V Semester, Program 1 to 6 **During VI Semester, Program 7 to 10