SEMESTER - II

SEMESTER –II

Study Components Ins.

S.No. Part Hrs Credit Title of the Paper Maximum Marks
Course Title /wee
k
Uni.
SEMESTER II CIA Exam Total
1. I Language Paper-2 6 3 Tamil/Other Languages 25 75 100
English
2. II English Paper-2 4 3 25 75 100
Overview of English
3. II NMSDC: Paper-1 2 2 25 75 100
Communication
Language
Proficiency for
Employability
Core Course –CC Data Structure and
4. III III Paper-2 5 5 25 75 100
Algorithm
5. III Core Course –CC Practical-2 5 5 Practical II – Data 25 75 100
IV Structure and Algorithm
using C++ Lab
(Choose one from the
6. III Elective II Elective II 6 3 25 75 100
following list)
Generic/ i) Numerical
Discipline Methods-II
Specific ii) Discrete
Mathematics-II
7. IV Skill Enhancement Paper2 2 2 Understanding Internet 25 75 100
Course
SEC-2
8. IV Skill Enhancement Paper 1 2 2 Software Project 25 75 100
Course Management
SEC-3 (Discipline
Specific)

Sem. Total 32 25 200 600 800

 SEMESTER – II

Marks

Inst. Hours
Credits
Title of the

External

Total
CIA
Course/ Subject Name Category L T P S
Paper

Data Structure and

Algorithms Core
5 - - - 5 5 25 75 100

Learning Objectives
LO1 To understand the concepts of ADTs
LO2 To learn linear data structures-lists, stacks, queues
LO3 To learn Tree structures and application of trees
LO4 To learn graph structures and application of graphs
LO5 To understand various sorting and searching
UNIT Contents No. of
Hours
Abstract Data Types (ADTs)- List ADT-array-based implementation-
linked list implementation: singly linked lists-circular linked lists-
I 15
doubly-linked lists - operations- Insertion-Deletion -Applications of
lists-Polynomial Addition
Stack ADT-Operations- Applications- Evaluating arithmetic expressions
II – Conversion of infix to postfix expression-Queue ADT-Operations- 15
Circular Queue- applications of queues.
Tree ADT-Binary Tree ADT-expression trees-applications of trees-
III binary search tree ADT- insertion and deletion operations binary-tree 15
traversals
Graph- Definition- Representation of Graph-Types of Graph-
IV Breadth first traversal – Depth first traversal 15
Searching-Linear search-Binary search-Sorting-Bubble sort-Selection
V sort-Insertion sort-Hashing-Hash functions-Separate chaining-Open 15
Addressing-Rehashing Extendible Hashing
Total 75

Course Outcomes Programme Outcome

CO On completion of this course, students will
CO1 Understand the concept of Dynamic memory
management, data types, algorithms, Big O notation
PO1, PO6
CO2 Understand basic data structures such as arrays, linked
lists, stacks and queues
PO2
CO3 Describe the hash function and concepts of collision and
its resolution methods
PO2, PO4
CO4 Solve problem involving graphs, trees and heaps PO4, PO6
CO5 Apply Algorithm for solving problems like sorting,
searching, insertion and deletion of data
PO5, PO6
Text Book
 1 1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Pearson
Education 2014, 4th Edition.
2 ReemaThareja, “Data Structures Using C”, Oxford Universities Press 2014, 2nd
Edition
Reference Books
1. Thomas H.Cormen,ChalesE.Leiserson,RonaldL.Rivest, Clifford Stein, “Introduction to
Algorithms”, McGraw Hill 2009, 3rd Edition.
2. Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson Education 2003
3. P.Rizwan Ahmed, C++ and Data Structure, Margham Publications, 2014
Web Resources
1. https://www.programiz.com/dsa

2. https://www.geeksforgeeks.org/learn-data-structures-and-algorithms-dsa-tutorial/
Mapping with Programme Outcomes:
CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5 PSO 6
CO 1 3 3 3 3 3 3
CO 2 3 3 1 3 3 3
CO 3 3 3 3 2 3 2
CO 4 3 2 3 2 3 3
CO 5 3 3 3 3 3 3
Weightage of course 15 14 13 13 15 14
contributed to each
PSO
Title of the Subject Name Category L T P S

k
a
r

s
Inst. Hours
Course/

Credits
Paper

External

Total
CIA
Data Structure and
Algorithm using Core - - 4 - 5 5 25 75 100
C++ Lab
Learning Objectives
LO1 To understand the concepts of ADTs
LO2 To learn linear data structures-lists, stacks, queues
LO3 To learn Tree structures and application of trees
LO4 To learn graph structures and application of graphs
LO5 To understand various sorting and searching
Sl. No Contents No. of
Hours
Write a program to implement the List ADT using arrays and linked
1. lists.

Write a programs to implement the following using a singly linked list. 60

• Stack ADT
2. • Queue ADT
Write a program that reads an infix expression, converts the expression
3. to postfix form and then evaluates the postfix expression (use stack
ADT).

4. Write a program to implement priority queue ADT.

Write a program to perform the following operations:
• Insert an element into a binary search tree.
5. • Delete an element from a binary search tree.
• Search for a key element in a binary search tree.

Write a program to perform the following operations

6. • Insertion into an AVL-tree
• Deletion from an AVL-tree

Write a programs for the implementation of BFS and DFS for a given
7. graph.

Write a programs for implementing the following searching methods:

• Linear search
8 • Binary search.
 Write a programs for implementing the following sorting methods:
• Bubble sort
9. • Selection sort
• Insertion sort
• Radix sort.

Total 60

Course Outcomes Programme Outcome

CO On completion of this course, students will
1 Understand the concept of Dynamic memory management,
PO1,PO4,PO5
data types, algorithms, Big O notation
2 Understand basic data structures such as arrays, linked lists,
PO1, PO4,PO6
stacks and queues
3 Describe the hash function and concepts of collision and its
PO1,PO3,PO6
resolution methods
4 Solve problem involving graphs, trees and heaps PO3,PO4
5 Apply Algorithm for solving problems like sorting, searching,
PO1,PO5,PO6
insertion and deletion of data
Text Book
1 Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Pearson
Education 2014, 4th Edition.
2 ReemaThareja, “Data Structures Using C”, Oxford Universities Press 2014, 2nd
Edition
Reference Books
1 Thomas H.Cormen,Chales E.Leiserson,RonaldL.Rivest, Clifford Stein, “Introduction
to Algorithms”, McGraw Hill 2009, 3rd Edition
2. Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson Education 2003
Web Resources
1. https://www.programiz.com/dsa
2. https://www.geeksforgeeks.org/learn-data-structures-and-algorithms-dsa-tutorial/
Mapping with Programme Outcomes:

CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5 PSO 6

CO 1 3 3 3 3 3 3
CO 2 3 3 1 3 2 3
CO 3 3 3 3 3 2 3
CO 4 3 3 3 3 2 3
CO 5 3 2 3 3 3 3
Weightage of course 15 15 13 15 13 15
contributed to each
PSO
S-Strong-3 M-Medium-2 L-Low-1
Subject Subject Name L T P S Marks

Categor

Credits
Code

Tota
y

Exte
CIA

rnal

l
Understanding Internet Skill 2 - - 2 25 75 100
Enha.
Course
(SEC)
Learning Objectives
LO1 Knowledge of Internet
LO2 Learning TCP/IP – Internet Technologies and Protocol

LO3 Learning Internet connectivity.

LO4 Learning internet networks
LO5 Learning Electronic Mail
UNIT Contents No. Of.
Hours
I Internet, Growth of Internet, Owners of the Internet, Anatomy of Internet,
ARPANET and Internet history of the World Wide Web, basic Internet
Terminology, Net etiquette. Internet Applications – Commerce on the Internet, 6
Governance on the Internet, Impact of Internet on Society – Crime on/through
the Internet.
II Packet switching technology, Internet Protocols: TCP/IP, Router, Internet
Addressing Scheme: Machine Addressing (IP address), E-mail Addresses, 6
Resources Addresses
III Internet accounts by ISP: Telephone line options, Protocol options, Service
options, Telephone line options – Dialup connections through the telephone
6
system, dedicated connections through the telephone system, ISDN, Protocol
options – Shell, SLIP, PPP, Service options – E-mail, WWW, News Firewall
IV Network definition, Common terminologies: LAN, WAN, Node, Host,
Workstation ,bandwidth, Interoperability, Network administrator, network
security, Network Components: Severs, Clients, Communication Media, Types 6
of network: Peer to Peer, Clients Server, Addressing in Internet: DNS, Domain
Name and their organization
V Email Networks and Servers, Email protocols –SMTP, POP3, IMAp4, MIME6,
Structure of an Email – Email Address, Email Header, Body and Attachments 6

TOTAL HOURS 30
Course Outcomes Programme
Outcomes
CO On completion of this course, students will
PO1, PO2, PO3,
On completion of this course, students will
CO1 PO4, PO5, PO6
PO1, PO2, PO3,
Knows the basic concept in internet
CO2 PO4, PO5, PO6
Know the concept of TCP/IP – Internet Technologies and Protocol PO1, PO2, PO3,
CO3
PO4, PO5, PO6
PO1, PO2, PO3,
Understand the concept of Internet connectivity.
CO4 PO4, PO5, PO6
 PO1, PO2, PO3,
Can be able to know about internet networks
CO5 PO4, PO5, PO6

Textbooks
1 Greenlaw R and Hepp E “Fundamentals of Internet and www” 2nd EL, Tata
McGrawHill,2007.

2 D. Comer, “The Internet Book”, Pearson Education, 2009

Référence Book
1 M. L. Young,”The Complete reference to Internet”, Tata McGraw Hill, 2007.
2
B. Patel & Lal B. Barik, ” Internet & Web Technology “, Acme Learning Publishers.
3
Leon and Leon, “Internet for Everyone”, Vikas Publishing House.

Web Resources
1. https://www.teachucomp.com/samples/html/5/manuals/Mastering-HTML5-CSS3.pdf
2. https://www.w3schools.com/html/default.asp

Mapping with Programme Outcomes:

CO/PSO PSO 1 PSO 2 PSO 3 PSO 4 PSO 5 PSO 6

CO 1 3 3 3 3 3 3
CO 2 3 3 2 3 3 3
CO 3 2 3 3 3 3 3
CO 4 3 3 3 3 3 3
CO 5 3 3 3 2 3 3

Weightage of course 14 15 14 14 15 15
contributed to each
PSO
S-Strong-3 M-Medium-2 L-Low-1
 Subject Name Catego
Marks
Subject ry Inst.
L T P S Credits
Code Hours CI Tota
External
A l
Software Project SEC
Management 4 - - - 2 2 25 75 100

Learning Objectives

LO1 To define and highlight importance of software project management.

LO2 To formulate and define the software management metrics & strategy in managing projects
LO3 To famialarize in Software Project planning
LO4 Understand to apply software testing techniques in commercial environment
Unit Contents No. of
Hours
Introduction to Competencies - Product Development Techniques - 12
Management Skills - Product Development Life Cycle - Software
I
Development Process and models - The SEI CMM - International
Organization for Standardization.
Managing Domain Processes - Project Selection Models - Project Portfolio 12
Management - Financial Processes - Selecting a Project Team - Goal and
II Scope of the Software Project -Project Planning - Creating the Work
Breakdown Structure - Approaches to Building a WBS - Project Milestones -
Work Packages - Building a WBS for Software.
Tasks and Activities - Software Size and Reuse Estimating - The SEI CMM 12
- Problems and Risks - Cost Estimation - Effort Measures - COCOMO: A
III
Regression Model - COCOMO II - SLIM: A Mathematical Model -
Organizational Planning - Project Roles and Skills Needed.
Project Management Resource Activities - Organizational Form and Structure 12
- Software Development Dependencies - Brainstorming - Scheduling
IV
Fundamentals - PERT and CPM - Leveling Resource Assignments - Map the
Schedule to a Real Calendar - Critical Chain Scheduling.
Quality: Requirements – The SEI CMM - Guidelines - Challenges - Quality
Function Deployment - Building the Software Quality Assurance - Plan -
V 12
Software Configuration Management: Principles - Requirements - Planning
and Organizing - Tools - Benefits - Legal Issues in Software - Case Study
TOTAL 60
CO Course Outcomes
CO1 Understand the principles and concepts of project management
CO2 Knowledge gained to train software project managers

CO3 Apply software project management methodologies.

CO4 Able to create comprehensive project plans

CO5 Evaluate and mitigate risks associated with software development process
Textbooks
Robert T. Futrell, Donald F. Shafer, Linda I. Safer, “Quality Software Project
1
Management”, Pearson Education Asia 2002.
 Reference Books

1. PankajJalote, “Software Project Management in Practice”, Addison Wesley 2002.

2. Hughes, “Software Project Management”, Tata McGraw Hill 2004, 3rd Edition.

3. P.Rizwan Ahmed, Software Project Management, Margham Publications, 2017

NOTE: Latest Edition of Textbooks May be Used
Web Resources
Software Project Management e-resources from Digital libraries
1.

2. www.smartworld.com/notes/software-project-management

Mapping with Programme Outcomes:

MAPPING TABLE

PSO1 PSO 2 PSO 3 PSO 4 PSO 5 PSO 6

CO/PSO
CO1 3 2 1 2 2 2
CO2 3 1 3 2 2 2
CO3 2 3 2 3 3 3
CO4 3 3 2 3 3 2
CO5 2 2 2 3 3 3
Weightage of course
contributed To each
PSO
13 11 10 13 13 12

S-Strong-3 M-Medium-2 L-Low-1