2022

M.Sc INFORMATION TECHNOLOGY

Course Structure and Syllabus
(For the candidates admitted from the academic year 2022–2023
onwards)

CHOICE BASED CREDIT SYSTEM

(CBCS)

THANTHAI HANS ROEVER COLLEGE (AUTONOMOUS)

(Approved by NAAC, Affiliated to Bharathidasan University)
ELAMBALUR, PERAMBALUR – 621 220
VISION:
 To be a Centre of excellence in education and research in the frontier areas of

Computer ScienceMISSION:
 To facilitate quality transformative education in Computer Science
 To promote quality research and innovation in technology for meeting global challenges
 To transform students to competent professionals to cater to the needs of the society.

Programme Outcomes (POs):

Postgraduate Programmes
Upon completion of the programme, the postgraduate will be able to
 Gain advanced knowledge resulting in entrepreneurship; innovation and
newer opportunities forbeing employable in public and private sectors,
research and development organizations.
 Apply enhanced new techniques and adopt new technologies needed in the respective
disciplines.
 Appreciate the diversity of the behavior in professional practice and act in
accordance with thecore values of chosen profession.
 Demonstrate the knowledge, values and skills to be critical consumer of
research practice andpossess investigative skills to evaluate the practice.
 Engage in lifelong learning process, have the ability to communicate the
findings of language /Commerce / Management Studies / Social Work /
Computer Sciences / Physical Sciences / Biological Sciences / Life Sciences
with the current knowledge.

Program Specific Outcomes (PSOs):

 At the end of the programme, the student should be able to
understand the concepts andapplications in the field of Information
Technology.

 Apply the learning from the courses and develop applications for real world problems.

 Understand the technological developments in the usage of modern design and

development toolsto analyze and design for a variety of applications.

 Competent and complete software professional to meet the requirement of

corporate world and Industry standard to provide solutions to industry, society
and business.

 A thorough and practical expert in the use of state of the art techniques for
developing Softwarebased systems.
 Thanthai Hans Roever College (Autonomous),Elambalur, Perambalur – 621 220
M.Sc., INFORMATION TECHNOLOGY – Course Structure
Under CBCS (For the candidates admitted from the academic year 2022–2023 onwards)

(Max)

(Max)
Credits
Weeks
Hours/
Name of the Course

Hours
Exam

Total
(Max)
ESE
CIA
Title of the Course

Ins.
Sem.

Course Code

Core Course–I 22PIT1CC1 OOAD and UML 6 5 3 25 75 100

Core Course–II 22PIT1CC2 Database Management Systems 6 5 3 25 75 100
Core Choice 22PIT1CCC1:1 Web Programming 6 4 3 25 75 100
Course–I (Any One 22PIT1CCC1:2 Advanced Data Structures
Choice)
I Core Practical–I 22PIT1CP1 RDMBS Practical 3 2 3 40 60 100
Core Choice Course 22PIT1CCCP1:1 Web Programming Practical 3 2 3 40 60 100
Practical–I 22PIT1CCCP1:2 Advanced Data Structures
(Any One Choice) Practical
Core Elective–I 22PIT1CE1:1 E–Commerce 6 4 3 25 75 100
(Any One Choice) 22PIT1CE1:2 Mobile Computing
22PIT1CE1:3 Wireless Network
VAC–I* (Any One 22PVAIT1:1 Manet Applications – 2* 3 – – 100
Choice) 22PVAIT1:2 Angular JS *
Total 30 22 – – – 600
Core Course–III 22PIT2CC3 Design and Analysis of 6 5 3 25 75 100
Algorithms
Core Course–IV 22PIT2CC4 Java Programming 5 5 3 25 75 100
Core Choice 22PIT2CCC2:1 Distributed Technologies
Course–II (Any One 22PIT2CCC2:2 Data Mining and Tools 5 4 3 25 75 100
Choice)
Core Practical–II 22PIT2CP2 Java Programming Practical 3 2 3 40 60 100
II Core Choice Course 22PIT2CCCP2:1 Distributed Technologies 3 2 3 40 60 100
Practical–II Practical
(Any One Choice) 22PIT2CCCP2:2 Data Mining and Tools
Practical
Core Elective–II 22PIT2CE2:1 Big Data Analytics 5 4 3 25 75 100
(Any One Choice) 22PIT2CE2:2 Management Information
Systems
22PIT2CE2:3 Embedded System
Non–Major Elective– 22PIT2NME1:1 Fundamentals of Information 3 2 3 25 75 100
I Technology
(Any One Choice) Business Analytics
22PIT2NME1:2
Extra Credit 22PIT2IP INTERNSHIP** – – – – –
**
Course ** 2
Total 30 24 – – – 700
Core Course–V 22PIT3CC5 Enterprise Resource Planning 6 5 3 25 75 100
Core Course–VI 22PIT3CC6 Machine Learning 6 5 3 25 75 100

1
 Core Choice 22PIT3CCC3:1 Open Source Technologies 6 4 3 25 75 100
Course–III (Any 22PIT3CCC3:2 J2EE Technologies
One Choice)
Core Practical–III 22PIT3CP3 Machine Learning practical 3 2 3 40 60 100
III
Core Choice Course 22PIT3CCCP3:1 Open Source Technologies 3 2 3 40 60 100
Practical–III 22PIT3CCCP3:2 practical
(Any One Choice) J2EE Technologies practical
Core Elective–III 22PIT3CE3:1 Software Engineering 6 4 3 25 75 100
(Any One Choice) 22PIT3CE3:2 Human Computer Interaction
22PIT3CE3:3 Software Project Management
VAC–II *(Any One 22PVAIT2:1 Academic research and report – 2* - - - 100
Choice) writing *
22PVAIT2:2
Content Management Tools

Extra Credit 22PIT3OC SWAYAM / NPTL Online - 2*** - - - -

Course *** Course***
Total 30 22 – – – 600
Core Course–VII 22PIT4CC7 Internet of Things 6 5 3 25 75 100
Core Course–VIII 22PIT4CC8 Cloud Computing 6 5 3 25 75 100
Core / Industrial 22PIT2IBC Digital Marketing 6 5 3 25 75 100
Based Core
Non–Major Elective– 22PIT4NME2:1 Security in Computing 3 2 3 25 75 100
II (Any One Choice) 22PIT4NME2:1 Social Media Analytics
IV Project 22PIT4PW Dissertation=100 Marks 9 5 3 80 20 100
[2 reviews –20+20=40 marks
Report Valuation = 40 marks]
Viva = 20 Marks
Total 30 22 – – – 500
Grand Total 120 90 – – – 240
0

*The VALUEADDEDCOURSES and Extracredit courses will not be included in

the total CGPA.
**The INTERNSHIP Course is extra-credit course in e nd of the Se c ond
Se me s te r .
***The Online SWAYAM/NTPEL Course are extra-credit course in end of Third Semester
PROGRAM SPECIFIC OUTCOMES:
After the successful completion of M.Sc. (Information Technology) programme, the
Graduates will be able to :
 Understand how technical developments can be achieved.
 Enhance the development of critical thinking, code writing skills and configuring the
technical tools.
 Prepares students for a wide variety of careers in IT related all industries with
research bent of mind.
 Able to develop strong analytical skills, critical thinking and experimental skills.
 Understand how technological advances impact society and the social, legal,
ethical and cultural ramifications of computer technology and their usage.
2
 LIST OF CORE CHOICE COURSES
Core Choice Course I Core Choice Course I Practical
1. Web Programming 1. Web Programming Lab
2. Advanced Data Structures 2. Advanced Data Structures Lab
Core Choice Course II Core Choice Course II Practical
1. Distributed Technologies 1. Distributed Technologies Lab
2. Data Mining and Tools 2. Data Mining and Tools Lab
Core Choice Course III Core Choice Course III Practical
1. Open Source Technologies 1. Open Source Technologies Lab
2. J2EE Technologies 2. J2EE Technologies Lab

LIST OF ELECTIVE COURSES

Core Elective I
1. E– Commerce
2. Mobile Computing
3. Wireless Network
Core Elective II
1. Big Data Analytics
2. Management Information System
3. Embedded System
Core Elective III
1. Software Engineering
2. Human Computer Interaction
3. Software Project Management

NON MAJOR ELECTIVE COURSES

Non Major Elective I

1. Fundamentals of Information
Technology
2 Business Analytics
Non Major Elective II
1 Security in Computing
2 Social Media Analytics

3
 VALUE ADDED COURSES

Value Added Course I

1. Manet Applications
2. Angular JS
Value Added Course II
1. Academic research and report writing

2. Content Management Tools

SUMMARY OF CURRICULUM STRUCTURE OF PG

PROGRAMMES
Sl. No. of No. of
Types of the Course Marks
No. Courses Credits
1. Core Course 8 40 800
2. Core Choice Courses 3 12 300
3. Core Practical 6 12 600
4. Elective Courses 3 12 300
5. Entrepreneurship / Industry Based Course 1 5 100
6. Project 1 5 100
7. Non–Major Elective Courses 2 4 200
8. Value Added Courses * 2* 4* 200*
9. Internship** 1** 2** -
10 SWAYAM / NPTEL Online Course 1*** 2*** –
Total 24 90 2400

1. Theory Internal: 25 marks, External: 75 marks

2. Practical Internal: 40 marks, External: 60 marks
3. Separate passing minimum is prescribed for Internal and External
a) The passing minimum for CIA shall be 40% out of 25 marks (i.e. 10 marks)

Project:100 Marks

Dissertation: 80Marks

Vivo Voce : 20 Marks

b) The passing minimum for University Examinations shall be 40% out of

75 marks(i.e. 30 marks)
c) The passing minimum not less than 50% in the aggregate.

4
 SEMESTER – I
Course Code: 22PIT1CC1 Exam Hours: 3
Instruction Hours: 6 Internal Marks: 25
Credits: 5 External Marks: 75

CORE COURSE I – OOAD AND UML

Course Objective:
 To give a detailed knowledge on Structured approach to system construction,
Various object oriented methodologies, Object oriented analysis, Object oriented
design and UML examples.
Course Outcomes:
CO1: Ability to analyze and model software specifications.
CO2: Ability to abstract object–based views for generic software
systems.CO3: Explain OOAD concepts and various UML
diagrams
CO4: Select an appropriate design pattern
CO5: Illustrate about domain models and conceptual classes

Unit I
Structured approach to system construction: SSADM/SADT – An overview of object oriented
systems development & Life cycle–Software– Development Process – Building High Quality
Software –Dynamic binding – OOSD life cycle – Process Analysis – Design – prototyping –
Implementation –Importance of modeling –Testing.

Unit II
Various object oriented methodologies – Introduction to UML – UML Diagram – Class diagram –
Dynamic modeling – Analysis and design –Conceptual model of UML–Architecture– principles of
modeling.

Unit III
Object oriented analysis – Use cases– Object classification –relationships– attributes –methods

Unit IV
Object oriented design – Design axioms – Designing classes – Layering the software design: –data access
layer ,User interface layer,Control layer – business logic layer.

Unit V
UML Examples on: Behavioural models –UML Features –Structural models – Architectural
models from realworld problems– UML and programming.

Text Books:
1. Bahrami Ali, Object oriented systems development, Irwin McGrawHill, 2005 (First 4 units
covered here).
2. Booch Grady, Rumbaugh James, Jacobson Ivar, The Unified modeling language – User
Guide, Pearson education, 2006 (ISBN 81–7758–372–7) IT –5 covered here).

Reference Books:
1. Grady Booch, ―Object – Oriented Analysis5and Design with Applications―, PearsonEducation,
9th Indian Reprint, 2002.
 2. Tom Pender, ―UML 2 Bible―, Wiley Publishing Inc., USA.
3. Hans–Erik Erikkson and Magnus Penker, ―UML Toolkit―, Wiley Computer Publishing, New
York.

Web Reference:
https://www.smartzworld.com/notes/object–oriented–analysis–design–notes–pdf–ooad–notes–
pdf/

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme

SpecificOutcomes:
Semester Code Title of the Course Hours Credits
I 22PIT1CC1 OOAD and UML 6 5
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

6
 SEMESTER – I
Course Code: 22PIT1CC2 Exam Hours: 3
Instruction Hours: 6 Internal Marks: 25
Credits: 5 External Marks: 75

CORE COURSE II – DATABASE MANAGEMENT SYSTEMS

Course Objective:

 The objective of the course is to present an introduction to database management

systems, with an emphasis on how to organize, maintain and retrieve – efficiently,
and effectively – information from a DBMS.

Course Outcomes:

CO1: Demonstrate an understanding of the elementary & advanced features of DBMS &
RDBMS
CO2: Attain a good practical understanding of the SQL
CO3: Develop clear concepts about Relational Model.
CO4: Examine techniques pertaining to Database design practices
CO5: Execute various advance SQL queries related to Transaction Processing & Locking
using concept of Concurrency control.

UnitI
Introduction: Database System Applications – Purpose of Database Systems – Views of Data –
Database Languages –Data Storage and Querying – Database Users and Administrator – Structure
of Relational Database – Keys – # Schema Diagrams # – Formal Relational Query Languages –
Relational Algebra – The Tuple Relational Calculus – The Domain Relational Calculus.

Unit II
Introduction to SQL: Overview of SQL – SQL Definition – Basic Structure of SQL Queries –
Additional Basic Operations – Set Operations – # Null Values – Aggregate Functions # – Nested
Sub–queries – Modification of the database –Intermediate SQL: Join Expression – Views
Database Design: Entity–Relationship Model – Constraints – Entity Relationship Diagram.

Unit III
Normalization: Purpose of Normalization – How Normalization Support Database Design – Data
Redundancy and Update Anomalies – Functional Dependencies – First Normal Form – Second
Normal Form – Third Normal Form. Advanced Normalization: More on Functional Dependencies
– BCNF – 4NF – 5NF.

Unit IV
Transaction: Transaction Concept – A simple Transaction Model – Storage Structure –
Transaction Atomicity and Durability – Transaction
7 Isolation – Serializability – Concurrency
Control: Lock–Based Protocol – Timestamp–Based Protocol – Validation–Based Protocol #–
Recovery Systems: Failure Classification – Recovery and Atomicity.

8
 Unit V
Database–System Architectures: Centralized and Client–Server Architectures –
Server System Architecture. Distributed Databases: Homogeneous and
Heterogeneous Databases – Distributed Data Storage – Distributed Transactions –
Commit Protocols – Concurrency Control in Distributed Database– Data
Warehousing and Mining: Decision Support Systems – Data Warehousing – Data
Mining – Classification .

Text Books:

1. Abraham Silberschatz, Hendry F. Korth and S. Sudarshan, Database

System Concepts, 6th Edition, Mcgraw– Hill International Edition

2. Database Systems A Practical Approach to Design, Implementation,

and Management, 4th Edition by Thomas M.Connolly, Carolyn E.Begg,
Pearson Education, FifthImpression, 2012.

Reference Books:
1 .C.J. Date, A. Kannan and S.Swaminathan, An Introduction to Database Systems,
8thEdition, PearsonEducation Asia.
2. Fundamentals of Database Systems, 5th Edition by Ramez Elmasri,
Shamkant B.Navathe, Pearson Education Ltd.

Web Reference:
https://www.db–book.com/db6/slide–dir/

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:

Semester Code Title of the Course Hours Credits

I 22PIT1CC2 DATABASE MANAGEMENT 6 5
SYSTEMS
Course Programme Outcomes (Pos) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1        
CO2       
CO3       
CO4         
CO5         
Number of matches () = 40, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor 9 Moderate High Very High
 SEMESTER – I
Course Code: 22PIT1CCC1:1 Exam Hours: 3
Instruction Hours: 6 Internal Marks: 25
Credits: 4 External Marks: 75

CORE CHOICE COURSE I –WEB PROGRAMMING

COURSE OBJECTIVES:

To introduces the concepts of PHP, MySQL, HTML 5, CSS,

 To introduces the concepts JavaScript, jQuery and Angular.
 It provides concepts of creating dynamic web application using client and
 Server–side scripting languages

Course Outcomes:
CO1:Understand the concepts of dynamic web design
CO2:Apply the concepts of data driven web design using PHP with MySQL
CO3:Analyze the usage of SQL language, JavaScript, jQuery, PHP and CSS
for real time applications
CO4:Design dynamic web application using server and client side
CO5:Create Web application using Angular framework

UNIT I
INTRODUCTION TO CSS: Importing style sheet– CSS Rules – Style Types – CSS Selectors –Fonts
and Typography – Managing Text styles – color– positioning elements – Box model and Layout –
Advanced CSS and CSS3: Attribute Selectors – Box –sizing Property – CSS3 Backgrounds –
Borders– Multicolumn Layout – Text effects

UNIT II
ACCESSING CSS FROM JAVASCRIPT: Revisiting the getElement By Id function – Accessing
CSS properties from JavaScript – Inline Javascript – Adding NEW elements – Using Interrupts –
Introduction to jQuery: selectors– Handling events – Event functions and Properties –Special effects
– Manipulating the DOM – Dynamically Applying classes – Modifying Dimensions – DOM
Traversal – Using jQuery without selectors.

UNIT III
INTRODUCTION TO DYNAMIC WEB CONTENT: HTTP and HTML– The Request /Response
Procedure – Benefits of PHP. My SQL, Javascript, CSS and HTML5– Introduction to PHP–
Expressions and Control Flow in PHP – PHP Functions and Objects– Arrays – File Handling

UNIT IV
ACCESSING MYSQL USING PHP: Form handling – Cookies, Sessions, and Authentication –
Exploring JavaScript – Functions – Objects – Arrays–JavaScript and PHP validation and Error
Handling: Validating User Input with JavaScript–Using Ajax

UNIT V
LEARNING ANGULAR: Jumping into typescript – Angular components – Expressions – Data
binding – Advanced Angular: Events and Change detection – Implementing Angular services in Web
applications. 10
REFERENCES:
1. Robin Nixon (2017).Learning PHP, MySQL& JavaScript with jQuery, CSS &HTML5, (4/e) with
jQuery, Thomson Press (India) Ltd., Delhi.
2. Brad Dayley, Brendan Dayley ,Caleb Dayley (2018), Node.js, MongoDB and Angular Web
Development: The definitive guide to using the MEAN stack to build web applications (Developer's
Library),(2/e), Pearson education
3. Ralph Moseley,M.T.Savaliya, (2013). Developing Web Applications,(2/e),Wiley India Pvt. Ltd.,
NewDelhi.
4. Nicholas C.Zakas(2012).Professional JavaScript for Web Developers(3/e),Wiley IndiaPvt. Ltd.,
New Delhi

5. https://www.tutorialspoint.com/php/php_and_mysql.htm
6. https://www.w3schools.com/angular/default.asp
7. https://angular.io/start
8. https://www.greengeeks.in/tutorials/make–dynamic–website/

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme

SpecificOutcomes:
Semester Code Title of the Course Hours Credits
I 22PIT1CCC1:1 Web Programming 6 4
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

11
 SEMESTER – I
Course Code: 22PIT1CCC1:2 Exam Hours: 3
Instruction Hours: 6 Internal Marks: 25
Credits: 4 External Marks: 75

CORE CHOICE COURSE I –ADVANCED DATA STRUCTURES

COURSE OBJECTIVE:

 To provide the knowledge of advanced data structures and their

implementations.
 To understand importance of data structures in context of writing efficient programs.
 To develop skills to apply appropriate data structures in problem solving.

Course Outcomes:
CO1:Understand the implementation of symbol table using hashing techniques
CO2:Develop and 10nalyse algorithms for red–black trees, B–trees and Splay trees
CO3:Develop algorithms for text processing applications
CO4: Students would be able to work on disjoint sets of data structures.
CO5:Identify suitable data structures and develop algorithms for computational
problems

UNIT I INTRODUCTION:
Arrays – Singly Linked List – Circularly Linked List – Stack – Queues – List
Abstract Data Type (ADT) – Iterators – Graphs and Sorting 1– Graphs: Graph ADT
– Data Structures for Graphs – Graph Traversals – Directed Acyclic Graphs – Shortest
Paths – Minimum Spanning Tree – Sorting: Merge Sort – Quick Sort – Selection Sort.

UNIT II HASHING:
General Idea, Hash Function, Separate Chaining, Hash Tables without linked lists:
Linear Probing, Quadratic Probing, Double Hashing, Rehashing, Hash Tables in the
Standard Library, Universal Hashing, Extendible Hashing.

UNIT III PRIORITY QUEUES (HEAPS):

Model, Simple implementations, Binary Heap: Structure Property, Heap Order
Property, Basic Heap Operations: insert, delete, Percolate down, Other Heap
Operations.

UNIT IV TREES:
AVL: Single Rotation, Double Rotation, B–Trees. Multi–way Search Trees– Trees:
Searching for an Element in a Tree, Inserting a New Element in a Tree, Deleting an
Element from a Tree. Red–Black Trees – Properties of red–black trees, Rotations,
Insertion, Deletion.

UNIT V GRAPHS ALGORITHMS:

12
Elementary Graph Algorithms: Topological sort, Single Source Shortest Path
Algorithms: Dijkstra’s, Bellman–Ford, All–Pairs Shortest Paths: Floyd–Warshall’s
Algorithm.

13
REFERENCESS:

1. Mark Allen Weis, Data Structures and Algorithm Analysis in C++, Mark Allen
Weiss, 4th Edition, 2014, Pearson.
2. Thomas H Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford
Stein,Introduction to Algorithms, 3rd Edition, 2009, The MIT Press.
3. Ellis Horowitz, SatrajSahani and Rajasekharam, Fundamentals of Computer
Algorithms, 2nd Edition, 2009, University Press Pvt. Ltd.
4. ReemaThareja, S. Rama Sree,Advanced Data Structures, Oxford University Press,
2018.
5. http://www.coursera.org/learn/advanced–data–structures
6. http://ocw.mit.edu/6–851S12 (MITOPENCOURSEWARE, Massachusetts
Institute of Technology)
7. https://nptel.ac.in/courses/106/106/106106133/
8. https://www.mooc–list.com/search/node?keys=Advanced+Data+Structures
9. http://freevideolectures.com/Course/2279/Data–Structures–And– Algorithms

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
I 22PIT1CCC1:2 Advanced Data Structures 6 4
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

14
 SEMESTER – I

Course Code: 22PIT1CP1 Exam Hours: 3

Instruction Hours: 3 Internal Marks: 40
Credits: 2 External Marks: 60

CORE PRACTICAL I – RDBMS PRACTICAL

Course Objectives:
 To provide practical knowledge on designing and creating relational
database systems.

Course Outcomes:
CO 1: Infer database language commands to create simple database
CO 2: Analyze the database using queries to retrieve records
CO 3: Applying PL/SQL for processing database
CO 4: Analyze front end tools to design forms, reports and menus
CO 5: Develop solutions using database concepts for real time requirements.

I. Data Definition Languages

1. Create the relations to perform the query operation.
2. Alter with three options
Add – add columns in the existing table
Modify – modify the data type and size in the existing table
Drop – delete column from existing table
II. Data Manipulation Languages
1. Insert Operation
2. Rename Operation
3. String Operations
4. Set Operation – (union, Intersect, minus)
5. Aggregate functions – (average, minimum, maximum, total, and count)
III. PL/SQL Procedure
1. Student Mark Sheet Preparation
2. Pay Roll preparation
3. Find factorial number using recursive function.
4. Find Fibonacci series using recursive function.
IV. SQL FORMS
1. Student Mark System
2. Pay Roll Preparation
3. Income Tax Calculation

15
Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
I 22PIT1CP1 RDBMS Practical 3 2
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

16
 SEMESTER – I
Course Code: 22PIT1CCCP1:1 Exam Hours:3
Instruction Hours: 3 Internal Marks: 40
Credits: 2 External Marks: 60

CORE CHOICE COURSE PRACTICAL I – WEB PROGRAMMING

PRACTICAL

Course Objectives:
 To provide practical knowledge on Web Programming concepts.

Course Outcomes:
CO 1: Describe the architecture of client‐side and server‐side web
applications
CO 2: Evaluate and validate web applications for conformance to
the latest W3C markup standards.
CO 3: Identify the tools needed to create dynamic client‐side and
server‐side web applications.
CO 4: Analyze and evaluate web applications for conformance to section 508 and W3C accessibility
standards
CO 5: Develop solutions using database concepts for real time requirements.

1. Develop a Program to pass information between web pages using GET and POST
methods.
2. Develop a Program string functions to manipulate strings.
3. Develop a Program to implement file operations.
4. Develop a Program to create menus, styles, Animation using CSS.
5. Develop a Program to validate the HTML form fields using Javascript.
6. Develop a Program to using jQuery and CSS.
7. Develop a Program to handle events and special effects using jQuery
8. Develop a Program to implement explode and implode functions
9. Develop a Program to create data base connectivity using PHP and MySQL
10. Using PHP, Create Admin Login ,Logout form using session variables.

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
I 22PIT1CCCP1:1 Web Programming 3 2
Practical
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
17
Outcomes PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
(Cos)
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

18
 SEMESTER – I
Course Code: 22PIT1CCCP1:2 Exam Hours:3
Instruction Hours: 3 Internal Marks: 40
Credits: 2 External Marks: 60
CORE CHOICE COURSE PRACTICAL I –
ADVANCED DATA STRUCTURES PRACTICAL
Course Objectives:
 To provide practical knowledge on Data Structure concepts.

Course Outcomes:
CO 1: Implement different sorting and searching algorithms
CO 2: Implement the stack, Queue and their
CO 3: Implement various types of linked lists and their applications.
CO 4: Perform basic operations on trees and graphs and determine minimum spanning tree.
CO 5: Develop solutions using Kruskals algorithm using a disjoint set data structure

1. Develop a program to perform the following operations on doubly linked list.

i) Creation ii) Insertion iii) Deletion iv) Traversal in both ways
2. Develop a program that implements stack and its operations using i) Arrays ii) linked list.
3. Develop a programs that implements Queue and its operations using i) Arrays ii)
linked list.
4. Develop a program that implements the Quick sort method to sort a given list of
integers in ascending order.
5. Develop a program that implement the Merge sort method to sort a given list of
integers in ascending order.
6. Develop a program to perform the following: i) Creating a Binary Tree of integers ii)
Traversing the above binary tree in preorder, inorder and postorder.
7. Develop a program to perform the following: i) Creating a AVL Tree of integers ii)
Traversing the above binary tree in preorder, inorder and postorder.
8. Develop a program that uses functions to perform the following: i) Creating a SplayTree
of integers ii) Traversing the above binary tree in preorder, inorder and postorder.
9. Develop program to perform the following: i) Creating a B–Tree of integers ii) Traversing
the above binary tree in preorder, inorder and postorder.
10. Develop a program that implements Kruskals algorithm using a disjoint set data
structure. The program takes as input a file (data.txt), in which each line either
represents a vertex or an edge. For the edge lines, the first integer on that line
representing the starting vertex, the second the ending vertex, and the third the weigh
of the edge. Use this file to construct, line by line, the graph upon which Kruskal’s
algorithm will be run (do NOT hardcode this graph!).

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme SpecificOutcomes:
Semester Code Title of the Course Hours Credits
I 22PIT1CCCP1:2 Advanced Data Structures Practical 3 2
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2   19   
 CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

20
 SEMESTER – I
Course Code: 22PIT1CE1:1 Exam Hours: 3
Instruction Hours: 6 Internal Marks: 25
Credits: 4 External Marks: 75

CORE ELECTIVE 1 (1) – E–COMMERCE

Course Objective:
 This course provides an introduction to information systems for business and
management.
Course Outcomes:
CO1: Analyze the impact of E–commerce on business models and strategy.
CO2: Describe the major types of E–commerce.
CO3: Explain the process that should be followed in building an E–commerce presence.
CO4: Identify the key security threats in the E–commerce environment.
CO5: Describe how procurement and supply chains relate to B2B E–commerce.

Unit I
Electronic Commerce Framework – Traditional commerce Vs. E–Commerce– Electronic Commerce and Media
Convergence – The Anatomy of E–Commerce Applications – Electronic Commerce Consumer Applications –
Electronic Commerce Organization Applications. The Network Infrastructure for Electronic Commerce:
Components of the High way – Network Access Equipment – Global information Distribution Networks –
Produce a generic framework for E Commerce– Architectural framework of Electronic Commerce– Web based
E Commerce Architecture– Business Models for E–commerce– Scope of E–commerce.

Unit II
The Internet as a Network Infrastructure: The Internet Terminology – NSFNET Architecture and
components – National Research and Education Network – Internet Governance – An overview
of Internet Applications–The Business of Internet Commercialization: Telco/Cable/On–Line
Companies – National Independent ISPs – Regional Level ISPs – Local level ISPs – Internet
Connectivity options.

Unit III
Electronic Commerce and the World Wide Web: Architectural Framework for Electronic Commerce
– World Wide Web as the Architecture – Technology behind the Web – Security and the Web,
Consumer Oriented Electronic Commerce: Consumer Oriented Applications – mercantile process
model – mercantile models from the consumer’s perspective– Analyzes a business and designs –
ECommerce plan to achieve targets.

Unit IV
Electronic Payment Systems: Types of Electronic Payment Systems – Dimensions of Electronic Payment
System – Traditional Payment Systems vs Electronic Payment Systems – Electronic Payments and Protocols –
21
Digital Token based Electronic Payment Systems – Credit Card – Based Electronic Payment Systems – Risk
and Electronic Payment Systems – Designing Electronic Payment Systems. Inter Organizational Commerce
and EDI: Electronic Data Interchange – EDI Applications in Business – EDI: Legal, Security and Privacy
issues – Managerial Issues in Electronic Payment Systems – Electronic Payment Systems in India –Future of
Electronic Payment Systems.

Unit V
Advertising and the Marketing on the Internet: The New Age of Information Search and Retrieval – Electronic
Commerce Catalogs – Information filtering – Consumer – Data Interface – Emerging Tools. On Demand
Education and Digital Copyrights: Computer– based Education and Training – Technological Components of
Education on demand. Software Agents: Characteristics and Properties of Agents – The Technology behind
Software Agents – Applets, Browsers and Software Agents.

Text Book:
1. ―Frontiers of Electronic Commerce‖, Ravikalakota & Andrew Whinston, AdisonWesley,
2000.

Reference Books:
1. ―Electronic Commerce‖, Pete Loshin & Paul A.Murphy, Second edition, JaicoPublishing
House, 2000.
2. David Whiteley, "E–Commerce Strategy, Technologies and Applications", 1stEdition,
Tata Mc–Graw–Hill, 2001.
Web Reference:
https://forms.iimk.ac.in/libportal/ebook/EB8.pdf

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
I 22PIT1CE1:1 E–Commerce 6 4
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

22
 SEMESTER – I
Course Code: 22PIT1CE1:2 Exam Hours: 3
Instruction Hours: 6 Internal Marks: 25
Credits: 4 External Marks: 75

CORE ELECTIVE 1 (2) – MOBILE COMPUTING

Course Objective:
 To make the student understand the concept of mobile computing paradigm, its novel
applications and limitations

Course Outcomes:
CO1: Ability to explain the principles and theories of mobile computing technologies.
CO2: Describe infrastructures and technologies of mobile computing technologies
CO3: Impact he knowledge to develop applications in different domains that mobile
computing offers to the public, employees, and businesses
CO4: Understand the Mobile Ad hoc networks and its routing
CO5: Describe the possible future of mobile computing technologies, securities and
applications.

Unit I
Basics of mobile – Mobile device profiles – Middleware and gateways – Wireless Internet
– Smart clients – Three–tier Architecture– Design considerations for mobile
computing–– Mobility and Location based services.

Unit II
Mobile computing through Internet – Mobile–enabled Applications – Developing Mobile
GUIs – VUIs and Mobile Applications – Characteristics and benefits –Multichannel and
Multi modal user interfaces – Synchronization and replication of Mobile Data – SMS
architecture – GPRS – Mobile Computing through Telephony.

Unit III
Mobile Application Development – Android– wi–fi –GPS – Camera – Movement –
orientation – event based programming – iOS/ windows CE – Blackberry – windows
phone – M–Commerce– structure – pros & cons – Mobile payment system – J2ME

Unit IV
ADHOC Wireless Network – Ad Hoc Wireless Network –MAC protocol–Routing protocols
–Transport Layer Protocol – QoS – Energy Management – application design – work flow
–composing applications – Dynamic linking – Intents and Services – Communication
viathe web.
23
Unit V
Security and Hacking – Password security – Network security – web security – Database
security – Wireless Sensor Network – Architecture and Design – Medium Access Control –
Routing – Transport Layer – Energy model

Text Books:
1. Jochen Schiller, Mobile Communications, Second Edition,2012.
2. William Stallings,‖Wireless Communications & Networks‖, Pearson
Education, 2009.

Reference Books:

1. C.Siva Ram Murthy, B.S. Manoj, ‖Ad Hoc Wireless Networks –

Architectures and Protocols‖, 2nd Edition, Pearson Education. 2004
2. Ashok K Talukder, Roopa R Yavagal, ―Mobile Computing‖, Tata
McGraw Hill, 2005.
Web Reference:https://www.researchgate.net/publication/350108815_Mobile_Computing_Full_Bo ok

https://www.worldcat Relationship Matrix for Course Outcomes, Programme Outcomes and

Programme SpecificOutcomes:
Semester Code Title of the Course Hours Credits
I 22PIT1CE1:2 Mobile Computing 6 4
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

24
 SEMESTER – I
Course Code: 22PIT1CE1:3 Exam Hours: 3
Instruction Hours: 6 Internal Marks: 25
Credits: 4 External Marks: 75

CORE ELECTIVE 1 (3) – WIRELESS NETWORKS

Course Objective:
 Understand the fundamentals of wireless communications systems, the wireless network
architectures, protocols, and applications.

Course Outcomes:
CO1: To Conversant with the latest 3G/4G and WiMAX networks and its
architecture.
CO2: Analyze security, energy efficiency, mobility, scalability, and their unique
characteristics in wireless networks
CO3: Understand the transmission of voice and data through various networks.
CO4: To design and implement wireless network environment for any
Application
using latest wireless protocols and standards
CO5: To implement different type of applications for smart phones and mobile
devices with latest network strategies

Unit I
WIRELESS LAN – Introduction–WLAN Technologies: Infrared, UHF Narrowband Spread
Spectrum –IEEE802.11: System Architecture, Protocol Architecture Physical Layer– MAC
Layer, 802.11b, 802.11a – Hiper LAN: WATM, BRAN, HiperLAN2 – Bluetooth:
Architecture Radio Layer Baseband Layer Link Manager Protocol Security – IEEE802.16–
WIMAX: Physical Layer MAC Spectrum Allocation For WIMAX

Unit II
MOBILE NETWORK LAYER – Introduction – Mobile IP: IP Packet Delivery, Agent
Discovery, Tunneling and Encapsulation, IPV6– Network Layer In The Internet– Mobile IP
Session Initiation Protocol – Mobile Ad–Hoc Network: Routing, Destination Sequence
Distance Vector, Dynamic Source Routing.

Unit III
MOBILE TRANSPORT LAYER – TCP Enhancements For Wireless Protocols –
Traditional TCP: Congestion Control, Fast Retransmit/Fast Recovery Implications Of
Mobility – Classical TCP Improvements: Indirect TCP Snooping TCP– Mobile TCP– Time
Out Freezing– Selective Retransmission– Transaction Oriented TCP – TCP Over 3G
Wireless Networks.

25
Unit IV
WIRELESS WIDE AREA NETWORK – Overview Of UTMS Terrestrial Radio Access
Network–UMTS Core Network Architecture: 3G–MSC, 3G–SGSN, 3G–GGSN, SMS–
GMSC/SMS–IWMSC, Firewall, DNS/DHCP–High Speed Downlink Packet Access
(HSDPA)– LTE Network Architecture And Protocol.

Unit V
4G NETWORKS – Introduction – 4G Vision – 4G Features And Challenges – Applications
Of 4G – 4G Technologies: Multicarrier Modulation, Smart Antenna Techniques, OFDM–
MIMO Systems– Adaptive Modulation And Coding With Time Slot Scheduler– Cognitive
Radio.

Text Books:
1. Jochen Schiller,‖Mobile Communications‖, Second Edition, Pearson Education
2012 (Unit I, II, III)
2. Vijay Garg, ―Wireless Communications And Networking‖, First Edition,
Elsevier 2014 (Unit IV, V)

Reference Books:

1. Erik Dahlman, Stefan Parkvall, Johan Skold and Per Beming, ―3G Evolution
HSPA and LTE For Mobile Broadband‖, Second Edition, Academic Press, 2008.
2. Anurag Kumar, D.Manjunath, Joy Kuri, ―Wireless Networking‖, First Edition,
Elsevier 2011.
3. Simon Haykin, Michael Moher, David Koilpillai, Modern Wireless
Communications‖, First Edition, Pearson Education 2013.
4. David G. Messerschmitt, ―Understanding Networked Applications‖, Elsevier,
2010.

Web Reference:
.org/title/encyclopedia–of–wireless networks/oclc/1156331432

26
Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
I 22PIT1CE1:3 Wireless Network 6 4

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)

Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

27
 SEMESTER – II
Course Code: 22PIT2CC3 Exam Hours: 3
Instruction Hours: 6 Internal Marks: 25
Credits: 5 External Marks: 75

CORE COURSE VI – DESIGN AND ANALYSIS OF ALGORITHMS

Course Objective:
 To provide students with solid foundations to deal with a wide variety of
computational problems and to provide a thorough knowledge of the most
common algorithms and data structures.

Course Outcomes:
CO1: To apply knowledge of computing and mathematics to algorithm
design.
CO2: To analyze a problem and identify the computing requirements appropriate for its
solution.
CO3: To design, implement, and evaluate an algorithm to meet desired needs.
CO4: To apply mathematical foundations, algorithmic principles, and computer science
theory to the modeling and design of computer–based systems.
CO5: An ability to use current techniques, skills, and tools necessary for computing
practice.

Unit I
Introduction: Algorithm Definition – Algorithm Specification – Performance Analysis–
Asymptotic Notations. Elementary Data Structures: Stacks and Queues –Trees –
Dictionaries – Priority Queues – Sets and Disjoint Set Union – Graphs

Unit II
Divide and Conquer: The General Method – Defective Chessboard – Binary Search –
Finding the Maximum and Minimum – Merge Sort – Quick Sort – A Worst Case Optimal
Algorithm – Implementation of Selection– Heap Sort – Multiplication of Large Integers –
Closest–Pair and Convex –Hull Problems – Travelling salesman problem – Selection – Strassen’s
Matrix Multiplication.

Unit III
The Greedy Method: General Method – Container Loading – Knapsack Problem – Tree
Vertex Splitting – Job Sequencing With Deadlines – Minimum Cost Spanning Trees –
Optimal Storage On Tapes – Optimal Merge Patterns – Single Source Shortest Paths.

Unit IV
Dynamic Programming: The General Method – Multistage Graphs – All–Pairs Shortest
Paths – Single–Source Shortest Paths – Optimal Binary Search Trees –String Editing – 0/1
Knapsack – Reliability Design – The 28 Traveling Salesperson Problem – Flow Shop
Scheduling Basic Traversal and Search Techniques: Techniques for Binary Trees –
 Techniques for Graphs – Connected Components and Spanning Trees– Disconnected
Components and DFS.

Unit V
Backtracking: The General Method – The 8–Queens Problem – Sum of Subsets – Graph
Coloring – Hamiltonian Cycles – Knapsack Problem Branch and Bound: Least Cost
searched – 0/1 Knapsack Problem.

Text Books:
1. Ellis Horowitz, Satraj Sahni and Sanguthevar Rajasekaran, Fundamentals of
Computer Algorithms, Universities Press, Second Edition, Reprint 2009.

Reference Books:
1. ―Data Structures Using C‖, Langsam, Augenstien, Tenenbaum, PHI.
2. ―Introduction to design and Analysis of Algorithms‖, S.E.Goodman, ST.Hedetniem,
TMH.

Web Reference:
https://mrcet.com/downloads/digital_notes/IT/Design%20and%20Analysis%20Algorithms.pdf

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
II 22PIT2CC3 Design and Analysis of Algorithms 6 5
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

29
 SEMESTER – II

Course Code: 22PIT2CC4 Exam Hours: 3

Instruction Hours: 5 Internal Marks: 25
Credits: 5 External Marks: 75

CORE COURSE V – JAVA PROGRAMMING

Course Objective:
 This course develops programming ability of students to create dynamic web applications
using server side technology with Java Database Connectivity.

Course Outcomes:

CO1: Knowledge of the structure and model of the Java programming language, (knowledge)
CO2: Use the Java programming language for various programming technologies (understanding)
CO3: Develop software in the Java programming language, (application)
CO4: Evaluate user requirements for software functionality required to decide whether the Java
CO5: programming language can meet user requirements (analysis)

Unit – I
Introducing Classes: Class Fundamentals – Declaring Objects – Introducing Methods –
Constructors – The this keyword – Garbage Collection – Overloading Methods – Call by value,
Call by reference – Recursion – Understanding static – final. Inheritance: Inheritance Basics –
Using super – Method overriding –#Dynamic Method Dispatch #– Using Abstract Classes.

Unit – II
Packages and Interfaces: Declaring Packages – Access Protection – Importing Packages –
Defining, Implementing, Applying Interfaces – Exception Handling: Exception Types – try
catch – throw – throws – finally – Creating User defined Exceptions. Multithreaded
Programming: The Java Thread Model – Creating a Thread – Thread Priorities –String Handling.

Unit – III
The Collection Interfaces and Utility Classes: ArrayList LinkedList Vector Stack
StringTokenizer and Date classes Files and IO Streams: File – The Byte Streams:
DataInputStream – DataOutputStream – FileInputStream – FileOutputStream–
SequenceInputStream – PrintStream. #The Character Streams: FileReader – FileWriter #–
Serialization.

Unit – IV
Networking: Introduction–Networks Domain Names and Protocols – Ports–Transmission
Control Protocol–UDP Approach. Java Database Connectivity: Establishing a connection – #
Creation of data tables – Entering data into table– Table Updating # – Use of PreparedStatement
– Obtainingmetadata.

Unit – V
Event Handling: Event Model – Event Classes – Event Listeners and Interfaces. Swing
Component classes: Icons and JLabels – JText Fields – JButtons –JCheckBoxes –
JRadioButtons
– JComboBoxes. 30
Text Books:
1. Herbert Schildt, The Complete Reference Java 2, Fifth Edition, TMH
Education Pvt. Ltd.
2. C. Muthu, Programming with Java, Vijay Nicole imprints private Limited,
2004.
Reference Book:
1. Herbert Schildt with Joe O’ Neil, Java –Programmer’s Reference, TMH.
Web Reference:
https://www.programiz.com/java–programming

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
II 22PIT2CC4 Java Programming 5 5
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

31
 SEMESTER – II
Course Code: 22PIT2CCC2:1 Exam Hours: 3
Instruction Hours: 5 Internal Marks: 25
Credits: 4 External Marks: 75

CORE COURSE–I – DISTRIBUTED TECHNOLOGIES

Course Objective:
 To introduce the technologies behind the distributed computing environment and to
provide the programming expertise to develop applications for distributed environment.

Course Outcomes:
CO1: Recognize the architecture of various distributed technologies
CO2: Understand the software components of distributed programming
CO3: Understand the ASP .NET environment and how to develop small programs
CO4: Understand ADO .NET and develop database applications
CO5: Performing Database operations for Windows Form and web applications.

Unit I
Introduction to distributed Computing – Challenges involved in establishing remote connection
– Strategies involved in remote computation – Current Distributed computing practices through
Dot Net and Java technologies– Distributed Vs Parallel technology.

Unit II
Advanced ADO.NET – Disconnected Data Access – Gridview Details View Form View controls – Crystal Reports
– Role of ADO.NET in Distributed Applications– ADO . NET provider for SQL server.

Unit III
ASP.NET :Introduction – architecture – ASP.NET Runtime – Advanced ASP.NET –
AdRotator,Multiview,Wizard and Image Map Controls– Using Validation Controls – Rich
Controls –Master Pages –Site Navigation – Web Parts – Uses of these controls and features in
Website development–. Calendar controls – ASP.NET Parser

Unit IV
Advanced features of ASP.NET – Security in ASP.NET – State Management in ASP.NET –
Mobile Application development in ASP.NET – Validation Controls – Security Management –
Critical usage of these features in Website development

Unit V
Web services – Role of Web services in Distributed Computing – WSDL UDDI SOAP concepts involved in Web
Services – Connected a Web Service to a Data Base – Accessing a Web Service through n ASP.NET application–
SQL Connection Management.

Text Book:
1.Walther, ―ASP.NET 3.5‖, SAMS Publication, 2005.
32
 Reference Books:
1. ―ASP. NET Black Book‖, Dream Tech.
2. Dave Mercer, ―ASP.NET: A Beginner’s Guide‖, Tata Mcgraw Hill Publishing Company
Limited, New Delhi.
3. Dino Esposito, ―Introducing Microsoft ASP.NET 2.0‖, Prentice Hall of India Private
Limited.
4. Rebecca M. Riorden, ―Microsoft ADO.NET Step by Step‖, Prentice Hall of India Private
Limited.

Web Reference:
https://www.sigc.edu/sigc/qb–18/cs/I%20M.Sc%20CS–%20Distributed%20Technologies.pdf

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
II 22PIT2CCC2:1 Distributed Technologies 5 4
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

33
 SEMESTER – II
Course Code: 22PIT2CCC2:2 Exam Hours: 3
Instruction Hours: 5 Internal Marks: 25
Credits: 4 External Marks: 75

CORE COURSE–I – DATA MINING AND TOOLS

COURSE OBJECTIVES:

 Introduce the basic concepts of data mining and various data mining techniques
like classification, clustering, and association rule mining.
 Acquire the knowledge about various applications of data mining such as Text
mining, Web mining, Multimedia mining, Image mining, Spatial mining
 To gain the concept of data visualization

Course Outcomes:

CO1: Understand basic concepts of data mining like classifications, clustering,

association rule mining, prediction and related algorithms
CO2:Apply data mining techniques to carry out simple data mining tasks
CO3:Analyze data using data visualization with Tableau
CO4:Design different data mining models for real world problems
CO5:Develop predictive models using advanced Data Mining Techniques

UNIT I INTRODUCTION TO DATA MINING:
Mining from database – Data mining functionalities – Mining patterns –
Classification of data mining systems – Major issues in Data mining.

UNIT II DATA PREPROCESSING:

Need for preprocessing – Data summarization – Data cleaning – Data integration – Data
transformation – Data reduction – Data discretization. Association Rule Mining: Apriori
algorithm.

UNIT III CLASSIFICATION:

Decision trees – Naïve Bayes – K Nearest Neighbour – Support Vector Machine – Neural
Networks– Deep Neural Networks– Evaluation of classification algorithms. Prediction –
Regression, Evaluation of Prediction methods.

UNIT IV CLUSTERING:
Cluster Analysis – Partitioning Methods: K–Means, K–Medoids – Hierarchical Methods –
BIRCH, ROCK – Density based methods: DBSCAN, OPTICS – Evaluation of
clustering algorithms. Data Visualization: Foundations for building visualizations –
Visualizing data –Working with Data in Tableau – Moving from Foundational to Advanced
Visualizations.

UNIT V ADVANCED DATA MINING TECHNIQUES:

Mining Data Streams – Mining Time Series Data – Mining Sequence Patterns in Biological
Data – Graph Mining – Social Network Analysis – Spatial Data Mining – Multimedia Data
Mining – Text Mining – Mining the World Wide Web – Data Mining Applications and
Tools.
34
REFERENCES:
1. Jaiwei Han, Micheline Kamber (2006). Data Mining–concepts and techniques, 2/e,
Morgan Kaufmann Publishers, San Francisco.
2. Joshua N.Milligan (2015). Learning Tableau, PACKT publishing
3. Mark A. Hall, Ian H. Witten, Eibe Frank (2011),Data Mining: Practical Machine
Learning Tools and Techniques, 4/e, Morgan Kaufmann Publishers, San Francisco .
4. David Hand, HeikkiMannila and Padhraic Smyth (2001). Principles of Data Mining,
Prentice Hall of India, New Delhi
5. Arun K. Pujari (2001). Data Mining Techniques; Universities Press, Hyderabad
6. Soman KP (2005). Data mining from theory to practice, 2/e, PHI Learning Pvt.
Ltd., New Delhi
7. https://www.javatpoint.com/data–mining–techniques
8. https://www.tutorialride.com/data–mining/data–mining–tutorial.htm
9. https://www.javatpoint.com/classification–algorithm–in–machine–learning
10. https://developers.google.com/machine–learning/clustering

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
I Data Mining and Tools 5 4
22PIT2CCC2:2
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

35
 SEMESTER – II

Course Code: 22PIT2CP2 Exam Hours: 3

Instruction Hours: 3 Internal Marks: 40
Credits: 2 External Marks: 60

CORE PRACTICAL II – JAVA PROGRAMMING PRACTICAL

Course Objective:
 Develop error–free, well–documented Java programs; develop and test
Javanetwork, search engine, and web framework programs.

Course Outcomes:
CO1:Provides knowledge of Internet Programming, using Java Applets
CO2:Ability to use a full set of GUI widgets and other components, including windows, menus,
buttons, checkboxes, text fields, scrollbars and scrolling lists, using AWT and Swings
CO3:Develop the applications using Java Data Base Connectivity (JDBC)
CO4:Impact the knowledge for creation of dynamic web pages, using Servlets and JSP.
CO5:Understand the frameworks; this gives the opportunity to reuse the codes for quick
development

1. To create class and object to prepare student report.

2. To implement inheritance to find area & perimeter of a rectangle.
3. To create abstract class Department with abstract method calcBonus(double salary) and
normal method dispTotSalary(string dept). Define classes Accounts and Sales which extends
Department and contains calcBonus() with its own implementation.
4. To implement multilevel inheritance by applying various access controls to its data members
and methods.
5. To create two threads. First thread displays a message for every one second, the second thread
displays a message for every two seconds.
6. To create thread using Runnable interface to compute and display factorials of first five
natural numbers.
7. To arrange the given names in alphabetical order and to display the all the names in reverse
order.
8. To demonstrate various Vector operations.
9. To print the contents of ArrayList in reverse order.
10. To display the file properties of a given file or directory.

36
11. To merge the two files using SequenceInputStream.
12. To find the local machine and Host IP address.
13. To send a text from one system to another using TCP/IP Sockets.
14. To prepare invoice using swing controls and to store the details in database using JDBC.
15. Program using Swing controls to create three buttons Red, Green and Blue. Using Action
Event class set background by applying color on button click.

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:

Semester Code Title of the Course Hours Credits

II 22PIT2CP2 JAVA PROGRAMMING Practical 3 2
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1         
CO2        
CO3       
CO4        
CO5        
Number of matches () = 40, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

37
 SEMESTER – II

Course Code: 22PIT2CCCP2:1 Exam Hours: 3

Instruction Hours: 3 Internal Marks: 40
Credits: 2 External Marks: 60

CORE CHOICE COURSE PRACTICALS II(1) – DISTRIBUTED TECHNOLOGIES PRACTICAL

Course Objective:
 To learn the practical knowledge of using distributed application development packages.

Course Outcomes:
CO1: Understand the ASP .NET environment and how to develop small programs
CO2: Develop menu based program for text manipulation
CO3: Understand ADO .NET and develop database applications
CO4: Develop the applications using Data Grid for displaying records

CO5: Develop applications for distributed environments.

1) Create a table and insert a few records using Disconnected Access.

2) Develop a project to update and delete few records using Disconnected Access.
3) Develop a project to view the records using GridView, DetailsView, FormView Controls.
4) Develop a project to generate a crystal report from an existing database.
5) Design a web page that makes uses of Ad Rotator Control.
6) Design a web page involving Multi View or Wizard Control.
7) Make use of Image Control involving two hot spots in a web page.
8) Design a simple web site that makes use of Master Pages.
9) Establish the security features in a simple web site with five pages that contain
• Login page
• Validation Checking
10) Use state management concepts in a mobile web application.

11) Develop a web service that has an ASP.NET client.

12) Develop a web service to fetch a data from a table and send it across to the client.

38
 Semester Code Title of the Course Hours Credits
II 22PIT2CCCP2:1 Distributed Technologies Practical 3 2
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1         
CO2        
CO3       
CO4        
CO5        
Number of matches () = 40, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

39
 SEMESTER – II

Course Code: 22PIT2CCCP2:2 Exam Hours: 3

Instruction Hours: 3 Internal Marks: 40
Credits: 2 External Marks: 60
CORE CHOICE COURSE PRACTICALS II (2)– DATA MINING AND TOOLS PRACTICAL

Course Objective:
 Implement the following Data mining techniques in C/C++.
Course Outcomes:
CO1: Understand what Is Data Mining, what kinds of data can be mined, what kinds of patterns can be
mined, and what kinds of applications are targeted.
CO2: Apply machine learning, pattern recognition, statistics, visualization, algorithm, database
technology and high-performance computing in data mining applications.
CO3: Identify what kinds of technologies are used for different application.
CO4: Manipulate data preprocessing, data Warehouse and OLAP technology, data cube technology;
mining frequent patterns and association, classification, clustering, and outlier detection.

CO5: Develop tools for Data Mining.

1. Preprocessing Activities

2. Exercise on Filters

3. Feature Selection

4. Apriori algorithm

5. Bayes classification.

6. Nearest Neighbor classification

7. k–means clustering technique.

8. Exercise on Association Rule Mining

9. Exercise on Knowledge Flow

10. Exercise on Text Mining

Semester Code Title of the Course Hours Credits

II 22PIT2CCCP2:2 DATA MINING AND TOOLS 3 2
PRACTICAL
40
 Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1         
CO2        
CO3       
CO4        
CO5        
Number of matches () = 40, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

SEMESTER – II
Course Code: 22PIT2CE2:1 Exam Hours: 3
Instruction Hours: 5 Internal Marks: 25
Credits:4 External Marks: 75

ELECTIVE COURSE 3 (1) – BIG DATA ANALYTICS

Course objective:
 To study the basic technologies that forms the foundations of Big Data.

Course Outcomes:
CO1: Identify big data and its business implications.
CO2: List the components of hadoop and hadoop eco–system.
CO3: Access and process data on distributed file system.
CO4: Manage job execution in hadoop environment.
CO5: Develop big data solutions using hadoop eco system.
Unit I
Introduction to big data: Data– Characteristics of data – Types of digital data: Unstructured–
Semi–structured and Structured– Sources of data –Working with unstructured data– Evolution
and Definition of big data –Characteristics and Need of big data– Challenges of big data Data
environment versus big data environment

Unit II
Big data analytics– Overview of business intelligence– Data science – Analytics– Meaning –Characteristics
of big data analytics–Need of big data analytics Classification of analytics– Challenges to big data
analytics– Importance of big data analytics– Basic terminologies in big data environment– Data Analytics
Life Cycle.

41
Unit III
Big data technologies and Databases: Introduction to NoSQL, Uses– Features – Types –Need
Advantages –Disadvantages and Application of NoSQL– Overview of NewSQL– Comparing
SQL NoSQL and NewSQL– Introduction to MongoDB and its needs– Characteristics of
MongoDB– Introduction of apache –cassandra and its needs–Characteristics of Cassandra

Unit IV
Hadoop foundation for analytics– History Needs–Features Key –advantage and Versions of Hadoop–
Essential of Hadoop– ecosystems RDBMS versus Hadoop –Key aspects and Components of Hadoop –
Hadoop architectures – Working with Distributed Computation–Advanced Concepts of Programming

Unit V
HadoopMapReduce and YARN framework: Introduction to MapReduce, Processing data with Hadoop
using MapReduce– Introduction to YARN–Components– Need and Challenges of YARN– Dissecting
YARN– MapReduce application– Data serialization and Working with common serialization formats– Big
data serialization formats–Testing and Version Control

42
Text Book:
1. Seema Acharya and Subhashini Chellappan, ―Big Data and Analytics‖, Wiley India Pvt.
Ltd., 2016

Reference Books:
1. ―Big Data‖ by Judith Hurwitz, Alan Nugent, Dr. Fern Halper and Marcia Kaufman,
Wiley Publications, 2014.
2. ―Big Data Imperatives : Enterprise Big Data Warehouse, BI Implementations and
Analytics‖ by Soumendra Mohanty, Madhu Jagadeesh and Harsha Srivatsa, Apress
Media, Springer Science + Business Media New York, 2013
3. ―Mining of Massive Datasets‖, Anand Rajaraman, Jure Leskovec, Jeffery D. Ullman,
Springer, July 2013.
4. ―Hadoop: The definitive Guide‖, Tom White, O'Reilly Media, 2010.

Web reference:

https://www.pdfdrive.com/big–data–books.html

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
I 22PIT2CE2:1 Big Data Analytics 5 4
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

43
 SEMESTER – II

Course Code: 22PIT2CE2:2 Exam Hours: 3

Instruction Hours: 5 Internal Marks: 25
Credits: 4 External Marks: 75

ELECTIVE COURSE 2 (2) – MANAGEMENT INFORMATION SYSTEMS

Course Objective:
 To describe the role of information technology and decision support systems in
business and record the current issues with those of the firm to solve business
problems.

Course Outcomes:
CO1: Evaluate the role of information systems in today's competitive business
environment.
CO2: Define an information system from both a technical and business perspective
and distinguish between computer literacy and information systems literacy.
CO3: Assess the relationship between the digital firm, electronic commerce,
electronic business and internet technology.
CO4: Identify the major management challenges to building and using information
systems in organizations and identify managerial risks related to information
system organization processing and utilizing.
CO5: To inculcate the principles and use of computer based information systems
for Management of Businesses and Organizations.

Unit I
Introduction to Information Systems: Why study Information System? – Why Business need
Information Technology? – Fundamentals of Information Systems – Overview of Information
Systems–Business Applications Programming

Unit II
Solving Business Problems with Information Systems: System Approach to Problem Solving –
Developing Information System Solution– Database Management: ,Managing Data Resources –
Technical Foundation of Database Management– Information Systems Design

Unit III
Information Systems for Strategic Advantage: Fundamentals – Strategic Advantage – Strategic
Applications and Issues in IT – Managing: Enterprise and Global Management.

Unit IV
Business Applications of Information Technology: The Internet Electronic Commerce – Fundamentals of Electronic
Commerce – Information System for Business Operations – Business Information System – Transaction Processing
Systems– Sales and Marketing Systems, Manufacturing and Production Systems – Finance and Accounting
Systems –Human Resources Systems.

Unit V
Information Systems for Managerial Decision Support: Executive Support System – Decision Support Systems –
Artificial Intelligence Technology in Business – Management IT – Planning for Business Change with IT–
44
Implementing Business Changes with IT – Security and Control Issues in I/S – Ethical and Societal
Challenge of Information Technology.

45
– Implementing Business Changes with IT – Security and Control Issues in I/S – Ethical and
Societal Challenge of Information Technology.

Text Book:
1. James A. O’Brien, ―Management Information Systems‖, Galgotia Publications, Fourth
Edition, 1999.

Reference Books:
1. Gordon B. Davis, Margrethe H. Olson, ―Management Information Systems‖,
McGraw Hill, 2000.
2. Ravi Kalakota and Marcia Robinson, ―E–Business Roadmap for Success‖,
Addison–Wesley, New Delhi, 2000.
3. W.S. Jaswadekar, ―Management Information Systems‖, Tata McGraw Hill, New
Delhi, 1998.

Web Reference:
https://www.phindia.com/Books/ShoweBooks/ODE/Management–Information–
Systems

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
II 22PIT2CE2:2 Management Information Systems 5 4
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

46
 SEMESTER – II
Course Code: 22PIT2CE2:3 Exam Hours: 3
Instruction Hours: 5 Internal Marks: 25
Credits: 4 External Marks: 75
ELECTIVE COURSE 3 (3) – EMBEDDED SYSTEMS
Course Objective:
 This course emphasizes on comprehensive treatment of embedded
hardware and real time operating systems along with case studies, in
tune with the requirements of Industry.

Course Outcomes:
CO1: Describe the differences between the general computing system and the
embedded system, also recognize the classification of embedded systems.
CO2: Be familiar with working on a team to create and apply embedded systems,
CO3: Become aware of interrupts, hyper threading and software optimization.
CO4: Design real time embedded systems using the concepts of RTOS.
CO5: interpret application specifications and make practical recommendations on
resource selection for embedded systems

Unit I
Introduction to Embedded system – Embedded system vs General computing systems –
History – Classification – Major Application Areas – Purpose of Embedded systems –
Smart running shoes: The innovative bonding of lifestyle with embedded technology.
Characteristics and Quality Attributes of Embedded systems

Unit II
Elements of an Embedded system – core of the embedded system: General purpose and
domain specific processors, ASICs, PLDs, COTS – Memory – Sensors and Actuators –
Communication Interface: Onboard and External Communication Interfaces –
Embedded Firmware – Reset circuit, Brown–out protection circuit, Oscillator unit,
Real– time clock, and Watchdog timer – PCB and Passive Components

Unit III
Embedded Systems – Washing machine: Application–specific – Automotive: Domain
specific. Hardware Software Co–Design – Computational Models – Embedded
Firmware Design Approaches – Embedded Firmware Development Languages –
Integration and testing of Embedded Hardware and firmware

Unit IV
RTOS based Embedded System Design: Operating System Basics – Types of operating
Systems – Tasks, process and Threads – Multiprocessing and Multitasking – Task
Scheduling– Task Communication – Task Synchronisation – Device Drivers – choosing
an RTOS.

47
Unit V
Components in embedded system development environment– Files generated during
compilation, simulators– emulators and debugging – Objectives of Embedded product
Development Life Cycle – Different
Phases of EDLC – EDLC Approaches – Trends in Embedded Industry – Case Study:
Digital Clock.

Text Book:
1. K. V. Shibu, "Introduction to embedded systems", TMH education Pvt. Ltd. 2009.
Reference Books:
1. Raj Kamal, ―Embedded Systems: Architecture, Programming and Design‖,
TMH. Second Edition 2009
2. Frank Vahid, Tony Givargis, ―Embedded System Design‖, John Wiley. Third
Edition 2006
3. Cliff Young, Faraboschi Paolo, and Joseph A. Fisher, "Embedded Computing: A
VLIW Approach to Architecture, Compilers and Tools", Morgan Kaufmann
Publishers, An imprint of Elsevier, 2005.
4. David E. Simon, ―An Embedded Software Primer‖ Pearson Education, 1999
Web Reference:
https://drive.google.com/file/d/1wrcikHVJSg_9jraHqhlEKiqWw_z1eCYw/view

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
I 22PIT2CE2:3 Embedded System 5 4
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

48
 SEMESTER – II
Course Code: 22PIT2NME1:1 Exam Hours: 3
Instruction Hours: 3 Internal Marks: 25
Credits: 2 External Marks: 75

NON–MAJOR ELECTIVE–I (1) –FUNDAMENTALS OF INFORMATION

TECHNOLOGY

COURSE OBJECTIVES:

 To understand the revolution in computers and communications

 To know about various application software
 To understand the information systems and software development

Course Outcomes:

CO1:To know the latest trends in information technology

CO2:To understand the fundamentals of computers
CO3:To gain knowledge about networks
CO4:To acquire knowledge about different software
CO5:To understand Internet basics

UNIT – I INFORMATION TECHNOLOGY:

Introduction – Information systems – Definition of computer and system – Software and Data – IT
in business and Industry – IT in the Home and at Play – It in Education and Training – IT in
Entertainment and the Arts – IT in Science, Engineering, and Mathematics – Global Positioning
System.

UNIT – II INTRODUCTION TO COMPUTERS:

History of computers, Types of computers, Characteristics of computers, Basic Anatomy of a
computer, Applications of computer – Memory – Memory types.

UNIT – III SOFTWARE:

Kinds of Software – The five types of Applications software – Word processing – Spreadsheets –
Database software, Presentation graphics software – Communications software System Software –
Operating system – functions

UNIT – IV COMPUTER NETWORKS:

Introduction – Definition Computer Networks – Types of Networks – Local Area Network –
Metropolitan Area Network – Wide Area Network – Personal Area Network – internet – Intranet –
firewalls – Network Topology – Bus – Ring – Hybrid – Star

UNIT – V BASIC INTERNET CONCEPTS:

Analog and Digital Signals – modems and communication Software, ISDN lines, and Cable
Modems – Definition of Internet – The World Wide Web – Connecting to the Internet
– Browsing the web – Web browser – Uniform Resource Locator (URL) – E–mail communication.

UNIT – VI CURRENT CONTOURS (For continuous internal assessment only): Contemporary

49
Developments Related to the Course during the Semester Concerned.
REFERENCES:

1. Dennis P.Curtin, Kim dolwy, KunL AWN, Xrhleen morin, Information

Technology, the breaking wave, TMH 2000.
2. Stacey C Sawyer, Brain K Williams, Sarah E Hutchinson Using Information
Technology –Brief Version
3. A Practical Introduction to Computer and Communications Third Edition,
McGraw Hill Companies 2011
4. James O’Brien – Introduction to Information systems. 16th edition, 2005.
5. The Internet Book: Everything You Need to Know About Computer
Networking and How the Internet Works, Douglas E. Comer, Pearson, 2000
6. https://www.javatpoint.com/internet
7. http://www.steves–internet–guide.com/networking/

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
II 22PIT2NME1:1 Fundamentals of Information 3 2
Technology

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)

Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

50
 SEMESTER – II
Course Code: 22PIT2NME1:2 Exam Hours: 3
Instruction Hours: 3 Internal Marks: 25
Credits: 2 External Marks: 75

NON–MAJOR ELECTIVE-I (2) –BUSINESS ANALYTICS

COURSE OBJECTIVES:

 To understand the revolution in business communications

 To know about various business information.

Course Outcomes:

CO1: Understand various domain areas and their challenges

CO2: Understand data analytics in various domain areas
CO3: Apply the concepts of analytics to make better decisions
CO4: Analyse the challenging areas in all domains
CO5: Assess the data analytics technique suitable for use cases in variousfunctional areas

UNIT – I INFORMATION TECHNOLOGY:

Introduction – Information systems – Definition of computer and system – Software and Data – IT
in business and Industry – IT in the Home and at Play – It in Education and Training – IT in
Entertainment and the Arts – IT in Science, Engineering, and Mathematics – Global Positioning
System.

UNIT – II INTRODUCTION TO COMPUTERS:

History of computers, Types of computers, Characteristics of computers, Basic Anatomy of a
computer, Applications of computer – Memory – Memory types.

UNIT – III SOFTWARE:

Kinds of Software – The five types of Applications software – Word processing – Spreadsheets –
Database software, Presentation graphics software – Communications software System Software –
Operating system – functions

UNIT – IV COMPUTER NETWORKS:

Introduction – Definition Computer Networks – Types of Networks – Local Area Network –
Metropolitan Area Network – Wide Area Network – Personal Area Network – internet – Intranet –
firewalls – Network Topology – Bus – Ring – Hybrid – Star

UNIT – V BASIC INTERNET CONCEPTS:

Analog and Digital Signals – modems and communication Software, ISDN lines, and Cable
Modems – Definition of Internet – The World Wide Web – Connecting to the Internet
– Browsing the web – Web browser – Uniform Resource Locator (URL) – E–mail communication.

UNIT – VI CURRENT CONTOURS (For continuous internal assessment only): Contemporary

Developments Related to the Course during the Semester Concerned.

51
REFERENCES:

8. Dennis P.Curtin, Kim dolwy, KunL AWN, Xrhleen morin, Information

Technology, the breaking wave, TMH 2000.
9. Stacey C Sawyer, Brain K Williams, Sarah E Hutchinson Using Information
Technology –Brief Version
10. A Practical Introduction to Computer and Communications Third Edition,
McGraw Hill Companies 2011
11. James O’Brien – Introduction to Information systems. 16th edition, 2005.
12. The Internet Book: Everything You Need to Know About Computer
Networking and How the Internet Works, Douglas E. Comer, Pearson, 2000
13. https://www.javatpoint.com/internet
14. http://www.steves–internet–guide.com/networking/

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
II 22PIT2NME1:2 Business Analytics 3 2

Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)

Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

52
 SEMESTER – III

Course Code: 22PIT3CC5 Exam Hours: 3

Instruction Hours: 6 Internal Marks: 25
Credits: 5 External Marks: 75

CORE COURSE V – ENTERPRISE RESOURCE PLANNING

Course Objective:
 In this course students shall learn various components of an application software
that help computerize functioning of an enterprise such as sales, materials,
production, financial , customer relationship AND supply chain modules.

Course Outcomes:
CO1: Identify the important business functions provided by typical business software
such as enterprise resource planning and customer relationship management .
CO2: . Describe basic concepts of ERP systems for manufacturing or service companies.
CO3: Analyze the technical aspect of telecommunication systems, internet and their
roles in business environment.
CO4: Develop skills necessary for building and managing relationships with customers,
and stakeholders.
CO5: Students will also able to develop and design the modules used in ERP systems.

Unit I
A Foundation for Understanding Enterprise Resource Planning systems – Reengineering and
Enterprise Resource Planning Systems – Planning ,Design and Implementation of Enterprise
Resource Planning Systems – ERP Systems: Sales and Marketing – ERP Systems: Accounting
and finance ERP Systems :Production and Materials Management ERP Systems: Human
Resources.
Unit II
Managing an ERP Project – Supply chain Management and the marketplace – Rules of the game
– Winning as a team.

Unit III
Solutions Supply chains as Systems – Modeling the Supply Chain – Supply Chain Software –
Operations – Meeting Demand – Maintaining Supply – Measuring Performance.

Unit IV
Planning Forecasting Demand – Scheduling Supply – Improving performance – Mastering
Demand – Designing the Chain – Maximizing Performance.

Unit V
Essentials of Customer relationship management – Designing CRM application – Various
modules of CRM application – Advantages of CRM.

53
Text books:
1. Sumner Mary, Enterprise Resource Planning, First edition, Pearson education, 2006 (ISBN
81–317–0240–5) (Unit 1: Chapters 1 to 7; Unit 2: Chapters 8, 9 (continued on text book number
TWO)
2. Taylor David A., Supply Chains (A managers guide), Pearson education, 2004 (ISBN 81–
297– 0334–3) (Unit 2: Chapters 1, 2, 3; Unit 3: Chapters 4, 5, 6, 7, 8, 9; Unit 4: Chapters 10, 11,
12, 13)
3. Tiwana, Essential guide to knowledge management : The e–business and CRM applications,
Pearson education (ISBN 81–780–8326–4) (Unit 5).

Reference book:
1. Leon, ENTERPRISE RESOURCE PLANNING, Tata Mc Graw Hill, 2013
2. ALTEKAR Rahul V., Enterprise wide resource planning (Theory and practice), Prentice Hall
of India, 2005 (ISBN 81–203–2633–4)

Web Reference:
https://mrcet.com/downloads/digital_notes/CSE/III%20Year/ERP%20Digital%20notes.pdf

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
III 22PIT3CC5 Enterprise Resource 6 5
Planning
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

54
 SEMESTER – III

Course Code: 22PIT3CC6 Exam Hours: 3

Instruction Hours: 6 Internal Marks: 25
Credits: 5 External Marks: 75

CORE COURSE VI – MACHINE LEARNING

Course Objective:

 To be able to formulate machine learning problems corresponding to different

applications.
Course Outcomes:
CO1: To Learn about Machine Intelligence and Machine Learning applications
CO2: Have a good understanding of the fundamental issues and challenges of
machine learning: data, model selection, model complexity, etc.
CO3: Have an understanding of the strengths and weaknesses of many popular
machine learning approaches.
CO4: Appreciate the underlying mathematical relationships within and across
Machine Learning algorithms and the paradigms of supervised and un–
supervised learning.
CO5: Be able to design and implement various machine learning algorithms in a
range of real–world applications

Unit I
Introduction: Machine learning process – intelligent machines– well posed machine learning
problems – examples of applications in diverse fields – data representation – domain knowledge
for productive use of machine learning – diversity of data – structured / unstructured data –
forms of learning – direct learning – undirected learning – reinforcement learning.

Unit II
Rationale and basics: Learning from observations – Computational learning theory – Heuristic
search in Inductive Learning – Search through Hypothesis Space – Ensemble Learning –
Evaluation of a Learning System – Estimating Generalization Errors – Holdout Method and
Random Subsampling – Cross–validation – Bootstrapping – Misclassification Error – Confusion
Matrix.

Unit III
Statistical Learning: Machine learning and Inferential Statistical Analysis – Descriptive Statistics
in Learning Techniques – Probability Distributions – Descriptive Measures of Probability
Distributions – Descriptive Measures from Data Sample – Normal Distributions – Data
Similarity – Bayesian Reasoning – Bayes Theorem – Naïve Bayes Classifier – Bayesian Belief
Networks –KNN Classifier– Learning with Support Vector Machines: Linear Discriminant
Functions for Binary Classification– Variants of Basic SVM Techniques.
55
Unit IV
Learning with Neural Networks: Cognitive Machine – From Perceptions to deep Networks –
Neuron Models – Biological Neuron – Artificial Neuron – Mathematical Model – Network
Architectures – Feed forward Networks – Recurrent Networks– Decision tree and Classification.

Unit V
An Introduction to Analytics – Machine Learning, Data Mining– and Predictive Analytics –
Basic Analytics Techniques – The CRISP–DM Model – Data Warehousing and Outline
Analytical Processing – Mining Frequent Patterns and Association Rules – Intelligent
Information Retrieval Systems.

Text Book:
1. Gopal, M., ―Applied Machine Learning‖, First Edition, Tata McGraw Hill Publications,
Chennai, 2018 .

Reference Book(s):
1. Ethem Alpaydin, ―Introduction to Machine Learning (Adaptive Computation
and Machine Learning), The MIT Press 2004.
2. Stephen Marsland, ―Machine Learning: An Algorithmic Perspective, CRC
Press, 2009.
3. Michael Affenzeller, Stephan Winkler, Stefan Wagner, Andreas Beham,
―Genetic Algorithms and Genetic Programming‖, CRC Press Taylor and Francis
Group.

Web Reference:http://www.cs.cmu.edu/~tom/mlbook–chapter–slides.html

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
III 22PIT3CC6 Machine Learning 6 5
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor 56Moderate High Very High
 SEMESTER – III

Course Code: 22PIT3CC6 Exam Hours: 3

Instruction Hours: 6 Internal Marks: 25
Credits: 5 External Marks: 75

CORE CHOICE COURSE III(1) – OPEN SOURCE TECHNOLOGIES

COURSE OBJECTIVES:

 Understand the difference between open–source software and commercial software.

 Understand the policies, licensing procedures and ethics of FOSS.

COURSE OUTCOMES:

CO1:Can identify the licensing of open source systems and make decisions
on their use, based on an understanding of the legal, economical and technical
issues.
CO2:Can find open source projects related to a given development problem
CO3:Differentiate between Open Source and Proprietary software and Licensing.
CO4:Recognize the applications, benefits and features of Open–Source
Technologies
CO5:Gain knowledge to start, manage open–source projects.


Unit I INTRODUCTION:

Introduction to Open–Source: Open Source, Need and Principles of OSS, Open–

Source Standards, Requirements for Software, OSS success, Free Software, Examples,
Licensing, Free Vs. Proprietary Software, Free Software Vs. Open– Source Software,
Public Domain. History of free software, Proprietary Vs Open– Source Licensing
Model, use of Open– Source Software, FOSS does not mean no cost. History: BSD,
The Free Software Foundation and the GNU Project.

UNIT II OPEN–SOURCE PRINCIPLES AND METHODOLOGY:

Open–Source History, Open Source Initiatives, Open Standards Principles,

Methodologies, Philosophy, Software freedom, Open–Source Software Development,
Licenses, Copyright vs. Copy left, Patents, Zero marginal cost, Income–generation
Opportunities, Internationalization. Licensing: What Is A License, How to create
your own Licenses, Important FOSS Licenses (Apache, BSD, PL, LGPL),
copyrights and copy lefts, Patent.

UNIT III OPEN–SOURCE PROJECTS:

Starting and maintaining own Open–Source Project, Open–Source Hardware, Open–

Source Design, Open–source Teaching, Opensource media. Collaboration: Community
and Communication, Contributing to OpenSource Projects Introduction to GitHub,
interacting with the community on GitHub, Communication and etiquette, testing
57
open–source code, reporting issues, contributing code. Introduction to Wikipedia,
contributing to Wikipedia or contributing to any prominent open–source project of
student’s choice

UNIT IV OPEN–SOURCE ETHICS AND SOCIAL IMPACT:

Open source vs. closed source, Open–source Government, Ethics of Open–source,

Social and Financial impacts of open–source technology, Shared software, Shared
source, Open Source as a Business Strategy

UNIT V UNDERSTANDING OPEN–SOURCE ECOSYSTEM:

Open–Source Operating Systems: GNU/Linux, Android, Free BSD, Open Solaris.

Open–Source Hardware, Virtualization Technologies, Containerization
Technologies: Docker, Development tools, IDEs, Debuggers, Programming
languages, LAMP, Open–Source Database technologies

58
 REFERENCES:

1. ―Open–Source Technology‖, Kailash Vadera&Bhavyesh Gandhi, University Science

Press, Laxmi Publications, 2009
2. ―Open–Source Technology and Policy‖, Fadi P. Deek and James A. M. McHugh,
Cambridge University Press, 2008.
―Perspectives on Free and Open–Source Software‖, Clay Shirky and Michael
Cusumano, MIT press.
3. ―Understanding Open Source and Free Software Licensing‖, Andrew M. St.
Laurent, O’Reilly Media.
4. ―Open Source for the Enterprise‖, Dan Woods, GautamGuliani, O’Reilly Media
5. https://www.tutorialspoint.com/basics_of_computers/basics_of_computers_
open_source_software.htm
6. Linux kernel Home: http://kernel.org
7. Open–Source Initiative: https://opensource.org/
8. The Linux Foundation: http://www.linuxfoundation.org/
9. The Linux Documentation Project: http://www.tldp.org/
10. Docker Project Home: http://www.docker.com3.
11. Linux Documentation Project: http://www.tldp.org/
12. Wikipedia:https://en.wikipedia.org/7.https://en.wikipedia.org/wiki/Wikipe
dia:Contributing_to_Wikipedia
13. GitHub: https://help.github.com/
14. The Linux Foundation: http://www.linuxfoundation.org/

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
III 22PIT3CCC3:1 Open Source Technologies 6 4
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High
59
 SEMESTER – III

Course Code: 20PIT3CCC3:2 Exam Hours: 3

Instruction Hours: 6 Internal Marks: 25
Credits: 4 External Marks: 75
CORE CHOICE COURSE III(2) – J2EE TECHNOLOGIES

Course Objectives:
 To design and develop web based and enterprise applications using J2EE.
 Understand the concepts such as JDBC, JSP
 To develop a concept of JNDI and Struts framework.
Course Outcomes:
CO1: Understand the architecture of client/server systems and able to develop applications using
client/server communication.
CO2: you will learn the basics and history of XML,CORBA,RMI,JMS and how to write your own
XML documents.
CO3: Develop JSP applications using JSP Tags, JSP Scriptlets and JavaBeans
CO4: Understand the role of EJB in the broader Java EE platform.
CO5: To learn basics of programming with a modern programming language, Java.

UNIT I
Client – Server Architecture: Two Tier Model – 3 Tier Model – n Tier Model – J2EE Architecture –.net
Architecture – MPC Architecture.

UNIT II
Interaction Services: RMI – CORBA – XML– Generating an XML Documents – Parsing XML – JMS:
Fundamentals of JMS – Components of JMS Program.

UNIT III
Presentation Services: JSP – Javamail – Servlet.

UNIT IV
Component Model: EJB: Session beans: Stateless and Statefull – Entity beans – CMP and BMP – Message
Driven Beans–Redirection and forwarding Handling Errors and Exceptions in Servlets.

UNIT V
Struts Framework: Introduction – Building a simple struts – Model layers –View layer – controller layer –
Validator – Tiles –Declarative Exception– Handling –Struts Modules–Working with Servlet Threads and
Filters.

Text Books:
1. Jim Keogh ―The Complete Reference J2EE ―Tata McGraw – Hill Edition 2002.
2. James Holmes ―The Complete References Struts Second Edition ―Tata McGraw Hill
Edition–2007.
Reference Books: 60
1. Jusin Couch, Daniel H. Steinberg, ―J2EE Bible‖ Wily India (P) Ltd, New Delhi 2002.
2. Paul Tremblett, ―Instant Enterprise Java Y–Beans‖, Tata McGraw Hill Publishing Company, New
Delhi, 2001.

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
III 22PIT3CCC3:2 J2EE Technologies 5 4
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

61
 SEMESTER – III

Course Code: 22PIT3CP3 Exam Hours: 3

Instruction Hours: 3 Internal Marks: 40
Credits: 2 External Marks: 60

CORE PRACTICAL III – MACHINE LEARNING LAB

Course Objective:
 To introduce students to the basic concepts and techniques of Machine Learning.

Course Outcomes:
CO1: Gain knowledge about basic concepts of Machine Learning
CO2: Identify machine learning techniques suitable for a given problem
CO3: Solve the problems using various machine learning techniques
CO4: Apply Dimensionality reduction techniques.
CO5: Design application using machine learning techniques.

1. Write a Program to Flatten a Matrix.

2. Write a program to count the frequency of unique values in NumPy array.
3. Write a program to calculate the Average, varience and standard deviation.
4. Write a program to convert a numpy array into CSV file.
5. Write a program to Plot a line graph from numpy array.
6. Write a Program to perform Naïve Bayes algorithm for a given dataset.
7. Write a program to perform Decision Tree algorithm for a given dataset.
8. Write a program to perform K–Nearest Neighbour algorithm for a given dataset.
9. Write a program to perform Support Vector Machine algorithm for a given dataset.
10. Write a program to perform Logistic Regression algorithm for a given dataset.
11. Write a program to perform Linear Regression algorithm for a given dataset.
12 Write a program to perform K–Means Clustering algorithm for a given
dataset.

62
Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
III 22PIT3CP3 Machine Learning 3 2
Practical
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

63
 SEMESTER – III
Course Code: 20PIT3CCCP3:1 Exam Hours: 3
Instruction Hours: 3 Internal Marks: 40
Credits: 2 External Marks: 60

CORE CHOICS COURSE PRACTICAL III (1) – OPEN SOURCE TECHNOLOGY

PRACTICAL

Course Objective:
 It will develop skill to make a significant contribution to open source
community..

Course Outcomes:
CO1: Understand the installation of various packages in open source operating systems
CO2: Create simple GUI applications using PHP function to develop program.
CO3: Understand various versions of control system
CO4: Understand the kernel configuration and virtual environment
CO5: Implement various applications using build systems

1. Write a server side PHP program that displays marks, total, grade of a student in tabular format by
accepting user inputs for name, number and marks from a HTML form.
2. PHP Functions: array, string date–time and calendar.
3. Write a PHP program that adds products that are selected from a web page to a shopping cart.
4. Write a PHP program to access the data stored in a mysql table.
5. Write a PHP program interface to create a database and to insert a table into it.
i). Write a PHP program using classes to create a table.
ii). Write a PHP program to upload a file to the server.
6. Write a PHP program to create a directory, and to read contents from the directory.
7. PHP script for–Session Management (login form).
8. Write a shell program to find the details of an user session.
9. Write a shell program to change the extension of a given file.
10. Create a mysql table and execute queries to read, add, remove and modify a record
from that table.

64
Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
III 22PIT3CCCP3:1 Open Source Technologies Practical 3 2
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

65
 SEMESTER – III

Course Code: 20PIT3CCC3:2 Exam Hours: 3

Instruction Hours: 3 Internal Marks: 40
Credits: 2 External Marks: 60

CORE CHOICE COURSE RACTICAL III(2) – J2EE TECHNOLOGIES PRACTICAL

Course Objective:
 The objective of this course is to provide the necessary knowledge to design and develop dynamic, database-
driven application using J2EE.

Course Outcomes:
CO1: Understand the students how to create dynamic web pages, using Servlets and JSP.
CO2: understand the multi–tier architecture of web–based enterprise applications using Enterprise
JavaBeans (EJB).
CO3: invoke the remote methods in an application using Remote Method Invocation (RMI)
CO4: learn to access database through Java programs, using Java Data Base Connectivity (JDBC)
CO5: make a reusable software component, using Java Bean.

1. To find the marks of the students using Remote Method Invocations.

2. To write a Servlet program to calculate the bonus of an employee

3. To write a Servlet program to implement Session Tracking.

4. To write a Servlet program to check authentication for user using Cookies.

5. To write a Servlet program and use JDBC in it.

6. To write a simple program for JSP.

7. To write a JSP program that works with JDBC.

8. To write a JSP Program with Bean Class.

9. To write a EJB Stateless Program to create bonus of an employee.

10. Implement a JAVA Servlet Program to implement sessions using HTTP Session Interface.

66
Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
III 22PIT3CCCP3:2 J2EE Technologies Practical 3 2
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

67
 SEMESTER – III

Course Code: 22PIT3CE3:1 Exam Hours: 3

Instruction Hours: 6 Internal Marks: 25
Credits: 4 External Marks: 75

CORE ELECTIVE III (1)– SOFTWARE ENGINEERING

Course Objective:
 To provide a professionally guided education in software engineering that
prepares graduates to transition into a broad range of career options: industry,
government, computing graduate program, and professional education.T
Course Outcomes:
CO1: Understanding Basic knowledge of the analysis and design of complex systems.
CO2: Ability to apply software engineering principles and techniques.
CO3: Ability to develop, maintain and evaluate large–scale software systems.
CO4: To produce efficient, reliable, robust and cost–effective software solutions.
CO5: Ability to perform independent research and analysis.

Unit I
Need for S/w Engineering: Need for S/w engineering – About software and S/w engineering – A systems
approach– Engineering approach – Members of the development team – Change in S/w engineering. –
Modeling the process and Life cycle: The meaning of process – S/w process models – Tools and techniques
for processional modeling – Practical process modeling.
Unit II
Planning and Managing the project: Tracking progress – Project personnel – Effort estimation – Risk
management – The project plan – Process models and project management.

Unit III
Capturing the requirements : The requirement process – Types of Requirements – Characteristics of
requirements – Expressing requirements – Additional requirements notations – Prototyping requirements –
Requirements Documentation – Participants in the requirements process – Requirements validation –
Measuring requirements – Choosing a requirements specification Techniques.

Unit IV
Designing the system : Design Introduction – Decomposition and Modularity – Architectural styles and
strategies–Architectural Design Decisions – Architectural Views – Architectural Patterns –Application
Architectures – Characteristics of Good Design – Techniques for Improving Design – Design evaluation
and validation – Documenting the design – Programming standards and procedures – Programming
guidelines – Documentation.

Unit V
Testing Strategies : Testing strategic issues – Test strategies for conventional S/w – Test strategies for
object oriented S/w – Validation testing – system testing – S/w testing. Fundamentals – Black–box and
White–box testing – White box testing – Black box testing – Mccall’s Quality factors – ISO 9126 – QF –
S/w Engineering – S/w Maintenance – A S/w engineering process model.

68
Text Books:
1. Shari Lawrence P. Fleeger, “Software Engineering Theory and Practice”, 2nd Edition,
Pearson Education, Delhi, 2001. [(for Units 1–4) Chapters 1, 2, 3, 4, 5, 7]
2. Roger S. Pressman, “Software Engineering A Practitioner’s Approach”, 6th Edition, Tata
McGraw Hill Publication, [(for Unit 5) Chapters : 13, 14, 15, 31]

Reference Books:
1. Ian Sommerville, “Software Engineering”, 6th Edition, Pearson Education, Delhi, 2005.
2.Douglas Bell, “Software Engineering for Students–A Programming Approach”, 4th
Edition,Pearson Education, Delhi 2007.

Web Reference:
https://ug.its.edu.in/sites/default/files/SOFTWARE%20ENGINEERING.pdf

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
III 22PIT3CE3:1 Software Engineering 6 4
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

69
 SEMESTER – III
Course Code: 22PIT3CE3:2 Exam Hours: 3
Instruction Hours: 6 Internal Marks: 25
Credits: 4 External Marks: 75

CORE ELECTIVE III (2) – HUMAN COMPUTER INTERACTION

Course Objective:
 Provide an overview of the concepts relating to the design of human–
computerinterfaces in ways making computer–based systems comprehensive,
friendly and usable.

Course Outcomes:
CO1:Identify the basic concepts of HCI and evolution of HCI
CO2:Discuss the design issues and interaction design processes
CO3:Use different models of interaction design principles /rules
CO4:To understand the concepts and techniques for effective interaction between Human
and Computers
CO5:Ability to develop HCI technique based applications.

Unit I
Cognitive Psychology and Computer Science –Capabilities of Human–Computer Interaction–Goals of
Human–Computer Interaction–Roles of Human –Computer and Interaction in HCI–Basic User Interfaces –
Advanced User Interfaces – Justification of Interdisciplinary Nature– Standard Framework of HCI–HCI
Design Principles–Interface Levels in HCI–Steps in Designing HCI Applications–Graphical User Interface
Design –Popular HCI Tools – Architecture of HCI Systems–Advances in HCI–Overview –HCI Sample
Exercises – HCI –Usability Engineering–Usability Engineering Attributes – Process of Usability–Need for
Prototyping.

Unit II
Understanding Process Modelling:Goals– Operators– Methods –Selection Rules–Cognitive Complexity
Theory– Adaptive Control of Thought–Rational–State– Operator– and Result–Belief–Desire–Intention–
ICARUS–Connectionist Learning with– Adaptive Rule Induction Online (CLARION) –Subsumption
Architecture–Spoken Dialogue System– Factors Defining Dialogue System–General Architecture of Spoken
Dialogue System–Dialogue Management Strategies–Computational Models for Dialogue Management–
Statistical Approaches to Dialogue Management–Learning Automata as Reinforcement Learners.

Unit III
Recommender Systems: HCI Study Based on Personalisation – Personalisation in Recommender Systems –
Application Areas of Recommender Systems–Recommender System Field as an Interdisciplinary Area of
Research – Phases of Recommender Systems –User Profiling Approaches–Classification of
Recommendation –Techniques –Advantages and Disadvantages of Recommender System Approaches –
Need of Software Agent–based Approach in Recommender Systems –Evaluating Recommender Systems–
Integrated Framework for Recommender Systems –Case Study.
.

70
Unit IV
Advanced Visualisation Methods: Ontology Definition: Need of Ontology Analysis – Types of
Ontology – Components of Ontology – Ontology Life Cycle – Ontology Development Process – Multiple
Inheritance Ontology –Ontology Visualisation Method –Space Dimensions of Ontology Visualisation –
Ontology Languages– Microformats – RDFA– RDF – RDF Schema– OIL –Ontology Visualisation Tools –
Ontology Reasoning –Reasoner.
Unit V
Ambient Intelligence: The New Dimension of Human–Computer Interaction – Ambient
Intelligence Definition–Context aware Systems and Human–Computer Interaction –Middleware –
Modelling Data for AmI Environment –Development of Context –awareness Feature in Smart Class
Room— A Case Study –Context– aware Agents for Developing AmI Applications–A Case Study.

Text Book:
1. K. Meena, R. Sivakumar, “Human–Computer Interaction”, PHP Learning Private limited
Delhi–110092, 2015.

Reference Books:
1. JohnM. Carroll,―HumanComputerInteraction–intheNew Millennium”, Pearson
Education, 2007.
2. Lan Dix, Janet Finlay, Gregory D. Abowd, Russell Beale, “Human–Computer
Interaction”,Pearson Education, 2009.
Web Reference:
https://engineering.futureuniversity.com/BOOKS%20FOR%20IT/Dix_HumanComputerInteracti
on.pdf

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
III 22PIT3CE3:2 Human Computer 6 4
Interaction
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

71
 SEMESTER – III
Course Code: 22PIT3CE3:3 Exam Hours: 3
Instruction Hours: 6 Internal Marks: 25
Credits: 4 External Marks: 75

CORE ELECTIVE III (3) – SOFTWARE PROJECT MANAGEMENT

Course Objective:
 This course is aimed at introducing the primary important concepts of project
management related to managing software development projects.

Course Outcomes:
CO1: Analyze the scope, cost, timing, and quality of the project, at all times
focused on project success as defined by project stakeholders.
CO2: Align the project to the organization’s strategic plans and business
justification throughout its lifecycle.
CO3: Identify project goals, constraints, deliverables, performance criteria,
control needs, and resource requirements in consultation with stakeholders.
CO4: Implement project management knowledge, processes, lifecycle and the
embodied concepts, tools and techniques in order to achieve project
success.
CO5: Apply project management concepts through working in a group as team
leader or active team member on an IT project.

Unit I
Project Management Framework: Introduction: Project – Project management –
Relationship among Project, Program and Portfolio management – Project and
operations management– Role of project manager – Project management body of
knowledge – Enterprise Environmental factors. Project life cycle and Organization:
Overview of project life cycle – Projects vs Operational Work – Stakeholders –
Organizational influences on project management. The Standard for Project
Management of a Project: Project management processes for a project: Common project
management process interactions – Projects management process groups – Initiating
process group – planning process group – Executing process group – Monitoring and
controlling process group – Closing process group.

Unit II
Choosing Methodologies and Technologies – Software Processes and Process Models –
Choice of Process Models – The Waterfall Model– Prototyping – other ways of categorizing
prototype – Agile Methods – Extreme Programming Selecting the Most Appropriate Process
Model– Need of Agile – Iterative vs Incremental–Agile Manifesto and Mindset – Lean,
Scrum and Kanban methods–uncertainty, Risk, and lifecycle selection–Scrum Elements
overview–5 levels of planning–Scrum Process overview–Agile Team–roles and
responsibilities– Epic–feature– User Stories–PBI–The Sprint.

72
Unit III
The Project Management Knowledge Areas: Project integration management: Develop
project charter – Develop project management plan – Direct and manage project
execution – Monitor and control project work – Perform integrated change control –
Close project or phase. Project scope management: Collect requirements – Define
Scope – Create WBS – Verify Scope – Control Scope. Project team management:
Define activities – Sequence activities – Estimate activity resources – Estimate Activity
Durations – Develop Schedule – Control Schedule.

Unit IV
Project cost management: Estimate costs – Determine budget – Control costs. Project
Quality Management: Plan quality – perform quality assurance – Perform quality
control. Project Human Resource Management: Develop human resource plan –
Acquire project team – Develop project team – Manage project team. Project
Communications Management: Identify stakeholders – Plan communications –
Distribute information – Manage stakeholder expectations – report performance.

Unit V
Project Risk Management: Plan risk management – Identify risks – Perform qualitative
risk analysis – Perform quantitative risk analysis – plan risk responses – Monitor and
control risks. Project Procurement Management: Plan – Conduct – Administer – Close
procurements.

Text Book(s):
1. ―A guide to the Project management Body of Knowledge (PMBOK Guide)‖
Fourth Edition, Project Management Institute, Pennsylvania, 2008
2. BOB Huges, Mike Cotterell, Rajib Mall ―Software Project Management‖,
McGraw Hill, Fifth Edition,2011.
3. Emerson, ―Agile Handbook,‖ Philosophy

Reference Book(s):

1. Futrell, ―Quality Software Project Management‖, Pearson Education India.

2. Royce, ―Software Project Management‖, Pearson Education India.
3. C.Ravindranath Pandian, ―Applied Software Risk Management–A Guide for
Software Project Managers‖, Auerbach Publications, 2015.
4. Benjamin A. Lieberman, ―The Art of Software Modeling‖, Auerbach
Publications, 2010.
5. Adapt projects in response to issues that arise internally and externally.

Web Reference:
https://www.kopykitab.com/Software–Project–Management–eBook–By–isbn–9789382122005

73
Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
III 22PIT3CE3:3 Software Project Management 6 4
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

74
 SEMESTER – IV
Course Code: 22PIT4CC7 Exam Hours: 3
Instruction Hours: 6 Internal Marks: 25
Credits: 5 External Marks: 75

CORE COURSE VII – INTERNET OF THINGS

Course Objective:
 Students will be explored to the interconnection and integration of the
physical world and the cyber space. They are also able to design &
develop IOT Devices.

Course Outcomes:
CO1: Gain the basic knowledge about IoT
CO2: Able to use IoT related products in real life
CO3: It helps to rely less on physical resources
CO4: To start their work smarter
CO5: Able to understand building blocks of Internet of Things

Unit I
Requirements of IoT: The definition of the Internet of Things main assumptions and perspectives–
Functional Requirements – Platform for IoT devices –Functional Requirements – Economics and
Technology of the IoT –Issues in IoT and solutions–Architecture of IoT. –Anatomy of IoT: Traditional
Internet Protocol Vs Chirps –Applying network intelligence at propagator nodes– Transport and functional
architectures–Features of IOT.

Unit II
IoT Devices–Temporary and Ad–hoc devices–Addressing issues–End devices in dedicated networks–
Converting states to chirps–RFID integration in the IoT– End devices with higher demands– Small data–
Building a web of things,Autonomy and coordination–Structuring a tree–Housekeeping message–Role of
integrator function– Degrees of functionality–Aggregating end points–Packaging options – IoT
Development Boards: Arduino IDE and Board Types, RaspberriPi Development Kit, RFID Principles and
components – Interfacing of Actuators with Arduino –Analog and Digital Sensors.

Unit III
Data and Human Interaction: Functions of IoT–Analysis and control–Neighborhood and affinities– Public
private and other kinds of data– Publishing agent– Searching for and managing agents– High – low level
loops,Human interface and control points– Collaborative scheduling tools–Packaging and provisioning,
Distributed integrator functions, Filtering the streams–IP Alternative–Protocol based on category
classification–Skeletal architecture of chirp packets– Pattern driven–Propagator node networks and
operation–Power of local agents and integrator functions–High level interchange.

Unit IV
IoT APPLICATIONS: Moore’s Law –Intelligence near the edge– Incorporating legacy
devices– Staying in the loop –Social machines,Applications of IoT–Agriculture– Home healthcare–
Efficient process control–Factory application– Home automation, Natural sciences– Living applications–
Origin of IoT– Open source networking solutions– Shared software and business process vocabularies.

75
 Unit V
Creating the IoT projects: Examples and working principles of sensors and actuators– Sensor project–Actuator
project – Controller Camera. Using an IoT service platform,Selecting an IoT. Platform– The
claysterplatform,Interfacing ourdevices using XMPP –Creating control application–Setup the IDE– Writing Arduino
Software– Arduino device in IoT–Federating for Global Scalability – Providing a Global Identity – Authorizing
Communication –Sensing Online Presence – Creating control application.

Text Books:
1.―Rethinking the Internet of Things–A scalable approach to connecting everything‖, by Francis
DaCosta,Apress open publication,2013.

Reference Books:

1. ―Learning Internet of Things‖ by Peter Waher,PACKT Publishing–Birmingham–mumbai–

2015.

Web Reference:(http://www.internet–of–things–book.com/).

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
IV 22PIT4CC7 Internet of Things 6 5
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

76
 SEMESTER – IV

Course Code: 22PIT4CC8 Exam Hours: 3

Instruction Hours: 6 Internal Marks: 25
Credits: 5 External Marks: 75

CORE COURSE VIII – CLOUD COMPUTING

Course Objectives:
 To understand the concept of various cloud services and Deployments

Course Outcomes:

CO1: Articulate the main concepts, key technologies, strengths, and

limitations of cloud computing and the possible applications for
state–of–the–art cloud computing
CO2: Ability to explain the core issues of cloud computing such as security,
privacy and interoperability
CO3: Choose the appropriate technologies, algorithms, and approaches for the related
issues and identify problems, and explain, analyze, and evaluate various cloud
computing solutions
CO4: Provide the appropriate cloud computing solutions and recommendations according
to the applications used
CO5: Attempt to generate new ideas and innovations in cloud computing and
collaboratively research and write a research paper, and present the research
online.

UnitI
Cloud computing definition– Characteristics– Benefit–Challenges– Distributed
Systems– Virtualization–Service–oriented computing– Utility–oriented computing–
Building Cloud Computing environments– computing platforms & technologies –
Cloud Models – Cloud Service Examples – Cloud Based Services & Applications –
Cloud concepts and Technologies.

Unit II
Virtualization: Virtualization– Characteristics– taxonomy–types– Pros and Cons–
Examples Architecture: Reference model– types of clouds– Compute Service – Storage
Services –Cloud Database Services – Application Services – Content Delivery Services
–Analytics Services –Deployment And Management Service – Identity And Access
Management Services – Open Source Private Cloud Software.

77
Unit III
Design consideration– Reference Architecture for Cloud Application – Cloud
Application Design Methodologies – Data Storage Approaches– Development in
Python: Design Approaches – Application: Image Processing – Document Storage –
Map Reduce – Social Media Analytics.

Unit IV
Introduction– Installing Python– Data types & Data Structures– Control Flow–
Functions– Modules– Packages– File Handling– Date/Time Operations – Classes– Python
for Cloud: Amazon Web Services –Google Cloud Platform – Windows Azure –Map
Reduced – Packages of Interest – Designing a RESTful Web API.

Unit V
Big Data Analytics: Clustering Big data – Classification of Big Data – Recommendation
systems. Multimedia Cloud: Case Study: Live Video Stream App – Streaming Protocols –
Case Study: Video Trans coding App–Cloud Security: CSA Cloud Security Architecture –
Authentication– Authorization – Identity and Access management – Data Security – Key
Management–Auditing– Cloud for Industry, Healthcare & Education.

Text Books:
1. Buyya, Vecciola and Selvi, Mastering Cloud Computing:
Foundations and Applications Programming, Tata McGraw Hill,
2013.
2. ArshdeepBahga, Vijay Madisetti, ―Cloud Computing: A Hands – On
Approach‖ Universities press (India) Pvt. limited 2016.

Reference Books:
1. Rittinghouse and Ransome, Cloud Computing: Implementation,
Management, and Security, CRC Press, 2016.
2. Michael Miller ―Cloud Computing Web based application that
change the way you work and collaborate online‖. Pearson edition,
2008.

78
Web References:https://mu.ac.in/wp–content/uploads/2021/01/Cloud–Computing.pdf
Relationship Matrix for Course Outcomes, Programme Outcomes and Programme Specific
Outcomes:
Semester Code Title of the Course Hours Credits
IV 22PIT4CC8 Cloud Computing 6 5
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

79
 SEMESTER – IV

Course Code: 22PIT21BC Exam Hours: 3

Instruction Hours: 6 Internal Marks: 25
Credits: 5 External Marks: 75

CORE /INDUSTRIAL BASED CORE – DIGITAL MARKETING

Course Objectives:
 To understand the concept of various Marketing Fields.

Course Outcomes:

CO1: Understand the role of digital marketing in marketing strategy

CO2: Identify the key elements of a digital marketing strategy

CO3: Analyze the role that social marketing plays in the digital marketing

CO4: Demonstrate common digital marketing tools such as SEO and Social media

CO5: Apply conceptual frame works of digital marketing

Unit – I
Introduction to Digital Marketing: Introduction – Original and Development of Digital Marketing – Internet Users:
Penetration and Kind of Internet Use –Digital Marketing strategy – Digital Advertising Marketing Plan – Ethical and
legal of framework of Digital Marketing – Skills Required in Digital Marketing.
Unit – II
Digital Advertising: Introduction – Concept of display advertising – Digital Metrics – Types of Digital Ad – Targeting
in digital marketing – Challenges faced by display marketing.
Unit – III
Search Engine Advertising: Introduction – Why pay for search advertising? – Understanding Ad Placement –
Understanding Ad Ranks – Why is the Ad rank important? – Create your first Ad Campaign – Google Ads Account –
Best practices for creating effective Ads –Enhance your Ad Campaign – Performance Reports.

Unit – IV
Face book Marketing : Introduction – Organic Marketing – Paid Marketing – Facebook Insights LinkedIn: Introduction
– LinkedIn Strategy – Content Strategy – LinkedIn Native Videos – LinkedIn Analytics – Asset Copying – LinkedIn
Sales Navigator – Adcampaign –Emerging Platforms: Instagram – Pinterest.
Unit – V
Search Engine Optimization: Introduction – Search Engine – The Concept of SEO – SEO Phases – Website Audit –
Content – On–Page Optimization – Off–Page Optimization – Social Media Reach – Website Navigation – Social
Media Icons – External Links – Pop–ups – Advanced Website Features.

80
Text Books:
1. Seema Gupta , Digital Marketing– McGraw Hill
Education 2nd Edition, 2018.

Reference Books:
1. Simon Kingsnorth, Digital Marketing Strategy: An
Integrated Approach to Online Marketing 2nd Edition–
Kogan Page, 2nd Edition, 2019
2. Dave Chaffey , Digital Marketing– Pearson 7th Edition,
2019.
3. Stephanie Diamond, Digital Marketing All–in–One For
Dummies For Dummies 1st Edition, 2019. 4. Kevin
Hartman, Digital Marketing Analytics: In Theory And In
Practice– Ostmen Bennett Bridge Publishing , Services
2nd Edition, 2020.

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme

SpecificOutcomes:
Semester Code Title of the Course Hours Credits
IV 22PIT21BC Digital Marketing 6 5
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

81
 SEMESTER – IV
Course Code: 22PIT4NME2:1 Exam Hours: 3
Instruction Hours: 3 Internal Marks: 25
Credits: 2 External Marks: 75

NON–MAJOR ELECTIVE-I (2) –SECURITY IN COMPUTING

COURSE OBJECTIVES:

 This course provides a broad introduction to a variety of topics in applied computer,

network, andsystem security.


Course Outcomes:

CO1: Formulate information security governance, and related legal and regulatory issues..
CO2: Devices how threats to an organization are discovered, analyzed, and dealt with.
CO3: Evaluate network security threats and countermeasures.
CO4: Construct network security designs using available secure solutions
CO5: Acquire the knowledge of advanced security issues and technologies

1. Introduction to computer security

o Overview of Computer Security Concepts and Foundations–
o Threats– Attacks– and Assets
2. Computer Security Technology and Principles
o User Identification and Authentication–
o Access Control–
o Database and Cloud Security–
o Malicious Software–
o Denial-of-Service Attacks–
o Intrusion Detection–
o Firewalls and Intrusion Prevention Systems–
3. Software Security and Trusted Systems
o Buffer Overflow–
o Software Security–
o Operating System Security–
o Database Security–
o Trusted Computing and Multilevel Security–
4. Management Issues
o Security Management and Risk Assessment–
o Human Resources Security–

82
 o Legal and Ethical Aspects–
5. Cryptographic Algorithms
o Symmetric Encryption and Message Confidentiality–
o Public-Key Cryptography and Message Authentication

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme

SpecificOutcomes:
Semester Code Title of the Course Hours Credits
IV 22PIT4NME2:1 Security in Computing 3 2
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

83
 SEMESTER – IV
Course Code: 22PIT4NME2:2 Exam Hours: 3
Instruction Hours: 3 Internal Marks: 25
Credits: 2 External Marks: 75

NON–MAJOR ELECTIVE-I (2) –SOCIAL MEDIA ANALYTICS

COURSE OBJECTIVES:

 To understand the revolution in Social media concepts.


Course Outcomes:

CO1: Understand sources and limitations of web-based data

CO2: Understand the different social media platforms and their associated metrics
CO3: Implement social network analysis to identify important social actors
CO4: Apply appropriate information visualization technique to gain insights intolarge
datasets
CO5: Formulate effective actions based on the analytics

UNIT I
The Conundrum of social media – Targeting your customers

UNIT II
Tracking international – Online social intelligence

UNIT III
Friends, fans, followers – Influence

UNIT IV
Score carding – Advanced social analytics

UNIT V
Use Cases: Movie Review– Election Result Analysis– Community analysis in social
media

Text Book:
1. Marshall Sponder (2012). Social Media Analytics: Effective Tools for
Building, Interpreting, and Using Metrics (Marketing/Sales/Advertising &
Promotion), Mcgraw hill
Reference Book:
1. Ganis, Kohirkar (2016). Social media Analytics, IBM Press PTG, 1st Edition

84
 2. Nancy Flynn (2012). The Social Media Hand book Policies, and Best Practices, Wiley

Relationship Matrix for Course Outcomes, Programme Outcomes and Programme

SpecificOutcomes:
Semester Code Title of the Course Hours Credits
IV 22PIT4NME4:2 Social Media Analytics 3 2
Course Programme Outcomes (POs) Programme Specific Outcomes (PSOs)
Outcomes
(Cos) PO1 PO2 PO3 PO4 PO5 PSO1 PSO2 PSO3 PSO4 PSO5
CO1      
CO2     
CO3       
CO4         
CO5          
Number of matches () = 37, Relationship: High

Mapping 1–29% 30–59% 60–69% 70–89% 90–100%

Matches 1–14 15–29 30–34 35–44 45–50
Relationship Very Poor Poor Moderate High Very High

85
 MANET APPLICATIONS
Course Code: 22PVAIT1:1 Exam Hours: 2
Instruction Hours: 30 Internal Marks: 50
External Marks: 50

UNIT - 1
INTRODUCTION: Introduction to ad-hoc networks – definition, characteristics features,
applications. Characteristics of wireless channel, ad-hoc mobility models: indoor and outdoor
models.
UNIT - 2
MEDIUM ACCESS PROTOCOLS:
MAC Protocols: Design issues, goals and classification. Contention based protocols – with
reservation, scheduling algorithms, protocols using directional antennas. IEEE standards:
802.11a, 802.11b, 802.11g, 802.15. HIPERLAN.
UNIT - 3
NETWORK PROTOCOLS:
Routing Protocols: Design issues, goals and classification. Proactive Vs reactive routing,
unicast routing algorithms, Multicast routing algorithms, hybrid routing algorithm, energy
aware routing algorithm, hierarchical routing, QoS aware routing.
UNIT - 4
END – END DELIVERY AND SECURITY:
Transport Layer: Issues in designing – Transport layer classification, adhoc transport protocols.
Security issues in adhoc networks: issues and challenges, network security attacks, secure
routing protocols.
UNIT – 5
CROSS LAYER DESIGN:
Cross layer Design: Need for cross layer design, cross layer optimization, parameter
optimization techniques, cross layer cautionary perspective. Integration of adhoc with Mobile
IP networks.

86
TEXT BOOKS:
1. C. Siva Ram Murthy and B. S. Manoj, Ad hoc Wireless Networks
Architecture andProtocols, 2nd edition, Pearson Edition, 2007.
Charles E. Perkins, Ad hoc Networking, Addison – Wesley, 2000

87
 ANGULAR JS
Course Code: 22PVAIT1:2 Exam Hours: 2
Instruction Hours: 30 Internal Marks: 50
External Marks: 50

Course Outcomes
After completing the course, the students are
able to
CO1: Understand the concept of Angular JS
CO2: Understand expressions and Directives of
Angular JS
CO3: Impart the knowledge on Controllers and
Modules
CO4: Learn the concept of scopes in Angular JS
CO5: Understand the concept of Forms in Angular JS

UNIT – I:
Introduction to Angular JS – Need for Angular JS – Angular JS MVC – Angular JSFirst
app – Angular JS Data Binding

UNIT – II:
Expressions – Numbers, Strings, Objects, Arrays – Examples – Directives – ng-app,ng-
init, ng-model, ng-repeat – Examples

UNIT – III:
Controllers – Examples – Modules –Module Creation – Adding controller to a module
– Adding directive to a module – Examples

UNIT – IV:
Scopes – Examples – Filters – Adding filters to expressions – Adding filters to
directives – Examples

UNIT – V:
Forms – Check Box – Radio Buttons – Select Box – Examples – Animations –
Examples

Text Book
1. ValeriKarpov, Diego Netto, ―Professional AngularJS‖, Wrox Publication,
FirstEdition, 2015

88
 ACADEMIC RESEARCH & REPORT WRITING

Course Code: 22PVAIT2:1 Exam Hours: 2

Instruction Hours: 30 Internal Marks: 50
External Marks: 50

Course objectives:
After completion of the course students will be able: -
 To become knowledgeable
 To explore and achieve academic and research goals

UNIT I:
Research Paper Writing: Types of Research Papers - Structure of Research Papers - Research
Paper Formats - Abstract Writing – Methodology .

UNIT II:
Results and Discussions - Different Formats for Referencing - Ways of Communicating a
Research Paper.

UNIT III:
Thesis Writing: Structure of a Thesis - Scope of the Work - Literature Review - Experimental /
Computational Details - Preliminary Studies - Results and Discussions.

UNIT IV:
Figures and Tables Preparation - Conclusions and Future Works – Bibliography - Appendices.

UNIT III:
Tools and Techniques: Various Word Processors - MS Word, Libra-Office, Latex - Making
Effective Presentations Using Power Point and Beamer - Uses of Plagiarism Detection Tools.

REFERENCE BOOKS:
1. A Step-by-Step Guide to Writing Academic Papers, by Anne Whitaker September 2009
2. On Writing a Thesis by C P Ravikumar,IETE Journal of Education, 2000

89
 CONTENT MANAGEMENT TOOLS

Course Code: 22PVAIT2:2 Exam Hours: 2

Instruction Hours: 30 Internal Marks: 50
External Marks: 50

COURSE OBJECTIVES
 To create and publish content using word press
 To understand the basics of Content management
 To design a website using Word press
 To develop and publish simple content using Word Press

UNIT I:
Introduction to Content management System: What is Content Management System (CMS) -
Features- Advantages – Disadvantages.

UNIT II:
Word Press Basics: Overview - Installation-Dashboard - Create a Permanent link for user
website and make it as public site - Set your website title and tagline.

UNIT III:
Designing a Website: Pick a theme and design a website - Create categories for website post -
Write a blog and post - Customize word press theme

UNIT IV:
Creatin Links and Comments: Create and Manage links in word press pages - Add and mange
comments in blog posts - WordPress Tags - Links-Add plugins to websites abilities

UNIT V:
Word Press Add-Ons: Access word press media libraries - Create and publish pages in website -
Adjust site navigation using menus and widgets

REFERENCE BOOKS:
1. Stephen Burge, ―WordPress Explained: Your Step-by-Step Guide to WordPress: 3‖, Prentice
Hall, 2020.
2. Martin Fowler, ―Teach Yourself VISUALLY WordPress‖, John Wiley & Sons, 2015.
3. Kevin Wilson, ―Using PowerPoint 2019: The Step-by-step Guide to Using Microsoft
PowerPoint 2019 (Using Microsoft Office Book 3)‖, Elluminet Press, 2020.

WEB REFERENCES :
1. https://www.tutorialspoint.com/wordpress/index.htm

90