ST.

PETER'S COLLEGE OF ENGINEERING & TECHNOLOGY :: CHENNAI

Affiliated to Anna University, Chennai & Approved by AICTE

LESSON PLAN
Name of the Subject: IT8075 – Software Project Management Total periods:45
Unit – 1

Plann Reason
N Executed C POs/
ed Resour For
o Topic Pedagogy Date/ O
Date/ ce Deviatio PSOs
. Period s
Perio n
d
1 23-8-22/2 Abstract Data Types (ADTs) – ADTs and classes BB T1 23-8-22/2 1 1
2 24-8-22/5 Introduction to OOP – classes in Python BB T1 24-8-22/5 1 1
24-8-22/7 Inheritance ,namespaces 24-8-22/7
3 BB T1 1 1
25-8-22/2 shallow and deep copying 25-8-22/2
4 26-8-22/1 Introduction to analysis of algorithms BB T1 26-8-22/1 1 2
5 30-8-22/2 Asymptotic notations BB T1 30-8-22/2 1 2
1-9-22/1 1-9-22/1
6 Divide & conquer BB T1 1 3
2-9-22/2 2-9-22/2
7 9-9-22/1 Recursion – analyzing recursive algorithms BB T1 9-9-22/1 1 3
8 12-9-22/1 Revision MCQ, Quiz 12-9-22/1
Unit -2

Plann Reason
N Execute C
ed Resourc For POs/
o Topic Pedagogy d O
Date/ e Deviatio
. Date/ s PSOs
Perio n
d Period
16-9-
9 16-9-22/1 List ADT – array-based implementations BB T1 2 3
22/1
1 16-9-
16-9-22/5 BB T1
0 22/5
Linked list implementations – singly linked lists 2 2
1 20-9-
20-9-22/2 PPT T1
1 22/2
20-9-
20-9-22/5
1 22/5
Circularly linked lists PPT T1 2 2
2 21-9-
21-9-22/5
22/5
1 Doubly linked lists 21-9- 2
21-9-22/7 BB T1 2
3 22/7
1 Stack ADT 23-9- 2
23-9-22/1 BB T1 2
4 22/1
1 Queue ADT 27-9- 2
27-9-22/2 BB T1 2
5 22/2
1 Double ended queues – applications 6-10- 2
6-10-22/2 BB T1 2
6 22/2
1 Revision 6-10-
6-10-22/4 MCQ
7 22/4

Unit -3

N Plann Topic Pedagogy Resource Executed Reason C POs/

o ed Date/ For O
. Date/ s PSOs
Period Deviatio
 Perio
n
d
1
7-10-22/3 Bubble sort BB T1 7-10-22/3 3 1
7
8-10-22/5 Selection sort BB T1 8-10-22/5
1
12-10- 3 2
8 12-10-22/2 Insertion sort BB T1
22/2
1 18-10-
18-10-22/2 Merge sort BB T1 3 2
9 22/2
2 19-10-
19-10-22/7 Quick sort BB T1 3 3
0 22/7
2 20-10-
20-10-22/4 Analysis of sorting algorithms BB T1 3 3
1 22/4
21-10-
21-10-22/2 Linear search – binary search
2 22/2
BB T1 3 2
2 26-10-
26-10-22/6 Hashing – hash functions
22/6
2 Collision handling – load factors, rehashing, and 26-10-
26-10-22/7 BB T1 3 3
3 efficiency 22/7
2
1-11-22/1 Revision SlipTest 1-11-22/1
4

Unit -4

Plann Reason
N Executed POs/
ed For C
o Topic Pedagogy Resource Date/
Date/ Deviatio Os PSOs
. Period
Perio n
d
2 Tree ADT
3-11/22/4 BB T1 3 2
5
2 4-11-22/5
Binary Tree ADT BB T1 3 2
6 8-11-22/2
2 9-11-22/5
Tree traversals BB T1 3 2
7 9-11-22/7
2 11-11-22/3 Binary search trees BB T1 3 3
 8
2 AVL trees
15-11-22/2 BB T1 3 3
9
3 16-11-22/5 Heaps 3 3
BB T1
0 16-11-22/7 Multiway search trees 3 3
3 MCQ,QUI
18-11-22/3 Revision
1 Z

Unit -5

PO
Plann Reason
N ed Resourc Executed CO s/
Topic Pedagogy For
o. Date/ e Date/ s
Deviatio PS
Perio Period
d n
Os

32 22-11-22/2 Graph ADT BB T1 3 3

33 23-11-22/5 Representations of graph – graph traversals BB T1 4 3
34 23-11-22/7 DAG – topological ordering PPT T1 4 1
25-11-22/3
35 Greedy algorithms BB T1 4 3
29-11-22/2
36 30-11-22/5 Dynamic programming BB T1 4 3
30-11-22/7
37 Shortest paths – minimum spanning trees BB T1 2 3
2-12-22/3
Introduction to complexity classes and
38 6-12-22/2 PPT T1 4 3
intractability
39 7-12-22/7 Revision Slip Test

Faculty Member HOD Principal

List of Pedagogies: Chalk & Talk/ Quiz/ MCQs/ Flipped Class/ Demonstration/ Site Visit/ Role Play/ Video/ Discussion/ Tutorial/ Any other

Resources:
TEXT BOOK(S):

T1. Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth Edition, Tata McGraw Hill, New Delhi, 2012.

REFERENCES:

R1 Robert K. Wysocki ―Effective Software Project Management – Wiley Publication, 2011.

R2.. Walker Royce: ―Software Project Management- Addison-Wesley, 1998.
R3. Gopalaswamy Ramesh, ―Managing Global Software Projects – McGraw Hill Education (India), Fourteenth Reprint 2013.
 ST. PETER'S COLLEGE OF ENGINEERING & TECHNOLOGY :: CHENNAI
Affiliated to Anna University, Chennai & Approved by AICTE

COURSE OUTCOMES:
At the end of the course, the student should be able to:
CO1: Explain abstract data types
CO2:Design, implement, and analyze linear data structures, such as lists, queues, and stacks, 27 according to the needs of different applications
CO3: Design, implement, and analyze efficient tree structures to meet requirements such as searching, indexing, and sorting
CO4: Model problems as graph problems and implement efficient graph algorithms to solve the problems

Mapping Matrix – COs Vs POs/ PSOs

POs PSOs

COs P P P P P P P P P P P P
PS PS PS
O- O- O- O- O- O- O- O- O- O- O- O-
O-1 O-2 O-3
1 2 3 4 5 6 7 8 9 10 11 12

CO-1 3 2 2 2 3 - 1 3 1 3 3 2 3

CO-2 3 3 3 3 3 2 3 1 3 2 2 2

CO-3 3 3 3 3 3 1 2 1 3 2 2 3

CO-4 3 3 3 3 3 1 1 1 3 2 2 1