Lesson Plan

Subject: Data Structures using C Department: ISE

Semester: 3rd ‘A’ SECTION
22IS34

UNIT 1: Textbooks:
1. Data Structure using C, Aaron M. Tanenbaum, YedidyahLangsam& Moshe J. Augenstein, Pearson
Target Lecture Education/PHI, 2006
Hours: 8
Reference Books
Target Tutorial i. The C Programming Language, Brian W Kernighan and Dennis M Ritchie, Prentice Hall Software Series, 2 nd
Hours: 8 Edition
ii. Data structures and algorithms analysis in C, Allen Weiss, Second Edition, Pearson IN
iii. Data Structures a Pseudocode approach with C,RichardF.GilbergandBehrouzA.Forouzan, Thomson, 2005.
iv. Data Structures & Program Design in C, Robert Kruse&BruceLeung, Pearson.

Foundations of Data Structures, IIT Bombay, https://www.edx.org/course/foundations-of-data-structures

Sl. Date Topics to be covered No. of COs Blooms Actual date Mode of Remarks
No. hours level of teaching
22IS34
require Completion
(board/
d (CO number)
presentation,
etc.)

1 27/10/2 Stacks in C – Implementing 1 1 2 27/10/2023 board/

023 the POP operation,
presentation

2 30/10/2 Stacks in C – Implementing 1 1 2 30/10/2023 board/

023 the POP operation (Cont..)
presentation

3 31/10/2 testing for exceptional 1 1 2 31/10/2023 board/

023 conditions
presentation

4 3/11/20 implementing the PUSH 1 1 2 3/11/2023 board/

23 operation
presentation

5 6/11/20 Infix, Postfix and Prefix– 1 1 2 6/11/2023 board/

23 Basic Definitions
presentation

6 7/11/20 valuating a postfix expression, 1 1 2 7/11/2023 board/

23 converting an expression from
 Department of ISE, NMIT
Supriya

infix to postfix. presentation

7 10/11/2 Recursion: Factorial, binary 1 1 2 10/11/2023 board/

023 search
presentation

8 17/11/2 recursive chains, Towers of 1 1 2 17/11/2023 board/

023 Hanoi
presentation

Planned Module 1 assessment date: 18-11-23

Type of assessment: Test, quiz, seminar, project, case study, assignment, etc. with COs covered and
Bloom’s level.
Actual Date of completion: 17-11-23
Total Strength of the class: 67
Number of students attaining above 60% of the assessment marks:

UNIT 2: Textbooks:
1. Data Structure using C, Aaron M. Tanenbaum, YedidyahLangsam& Moshe J. Augenstein, Pearson
Target Lecture Education/PHI, 2006
Hours:8
Reference Books
Target Tutorial i. The C Programming Language, Brian W Kernighan and Dennis M Ritchie, Prentice Hall Software
Hours: 8 Series, 2nd Edition
ii. Data structures and algorithms analysis in C, Allen Weiss, Second Edition, Pearson IN
iii. Data Structures a Pseudocode approach with C,RichardF.GilbergandBehrouzA.Forouzan,
Thomson, 2005.
iv. Data Structures & Program Design in C, Robert Kruse&BruceLeung, Pearson.

Foundations of Data Structures, IIT Bombay, https://www.edx.org/course/foundations-of-data-

structures

Sl. Date Topics to be No. of COs Blooms Actual date Mode of Remarks
No. covered hours level of teaching
22IS34.1
require Completion
(board/
d (CO number)
presentation,
etc.)

1 20/11/2 Queues: 1 2 3 20/11/2023 board/

023 Introduction
presentation

2 21/11/2 Queue 1 2 3 21/11/2023 board/

023 operations
 Department of ISE, NMIT
Supriya

presentation

3 24/11/2 Sequential 1 2 3 24/11/2023 board/

023 Representation
presentation

4 27/11/2 C Implementation 1 2 3 27/11/2023 board/

023 of Queues
presentation

5 1/12/20 C Implementation 1 2 3 1/12/2023 board/

23 of Queues
(Cont..) presentation

6 4/12/20 Circular 1 2 3 4/12/2023 board/

23 Queue
presentation

7 5/12/20 Priority Queue. 1 2 3 5/12/2023 board/

23
presentation

Planned Module 2 assessment date:7-12-23

Type of assessment: Test, quiz, seminar, project, case study, assignment, etc. with COs covered and
Bloom’s level.
Actual Date of completion: 5-12-23

Total Strength of the class: 67

Number of students attaining above 60% of the assessment marks:

UNIT 3: Textbooks:
1. Data Structure using C, Aaron M. Tanenbaum, YedidyahLangsam& Moshe J. Augenstein, Pearson
Target Lecture Education/PHI, 2006
Hours: 8
Reference Books
Target Tutorial i. The C Programming Language, Brian W Kernighan and Dennis M Ritchie, Prentice Hall Software
Hours: 0 Series, 2nd Edition
ii. Data structures and algorithms analysis in C, Allen Weiss, Second Edition, Pearson IN
iii. Data Structures a Pseudocode approach with C,RichardF.GilbergandBehrouzA.Forouzan,
Thomson, 2005.
 Department of ISE, NMIT
Supriya

iv. Data Structures & Program Design in C, Robert Kruse&BruceLeung, Pearson.

Foundations of Data Structures, IIT Bombay, https://www.edx.org/course/foundations-of-data-

structures

Sl. Date Topics to be No. of COs Bloom Actual date Mode of Remarks
No. covered hours s level of teaching
22IS34.1
require Completion
(board/
d (CO number)
presentation,
etc.)

1 11/12/2 Linked Lists - 1 3 3 11/12/2023 board/

023 Allocating and
Freeing of Dynamic presentation
variables

2 12/12/2 Linked Lists using 1 3 3 12/12/2023 board/

023 Dynamic Variables
presentation

3 15/12/2 Stacks and Queues 1 3 3 15/12/2023 board/

023 as List in C
presentation

4 18/12/2 List Operations in C, 1 3 3 18/12/2023 board/

023
presentation

5 19/12/2 Non integer and 1 3 3 19/12/2023 board/

023 Non homogeneous
Lists, presentation

6 22/12/2 Comparing the 1 3 3 22/12/2023 board/

023 Dynamic and Array
Implementations of presentation
Lists

7 26/12/2 Comparing the 1 3 3 26/12/2023 board/

023 Dynamic and Array
Implementations of presentation
Lists (Cont..)
8 01/01/2 Implementing 1 3 3 01/01/2023 board/
024 Header Nodes in
linked list. presentation

Planned Module 3 assessment date:26-12-23

 Department of ISE, NMIT
Supriya

Type of assessment: Test, quiz, seminar, project, case study, assignment, etc. with COs covered and
Bloom’s level.
Actual Date of completion:
Total Strength of the class:67
Number of students attaining above 60% of the assessment marks:

UNIT 4: Textbooks:
1. Data Structure using C, Aaron M. Tanenbaum, YedidyahLangsam& Moshe J. Augenstein,
Target Lecture Pearson Education/PHI, 2006
Hours: 8
Reference Books
Target Tutorial i. The C Programming Language, Brian W Kernighan and Dennis M Ritchie, Prentice Hall
Hours: 8 Software Series, 2nd Edition
ii. Data structures and algorithms analysis in C, Allen Weiss, Second Edition, Pearson IN
iii. Data Structures a Pseudocode approach with C,RichardF.GilbergandBehrouzA.Forouzan,
Thomson, 2005.
iv. Data Structures & Program Design in C, Robert Kruse&BruceLeung, Pearson.

Foundations of Data Structures, IIT Bombay, https://www.edx.org/course/foundations-of-data-

structures

Sl. Date Topics to be No. of COs Blooms Actual date Mode of Remarks
No. covered hours level of teaching
22IS34.1
require Completio
 Department of ISE, NMIT
Supriya

d (CO number) n (board/

presentation,
etc.)

1 2/1/202 Other List 2 4 2 2/1/2024 board/

4 Structures—
Primitive presentation
Operations on
Circular Lists

2 05/01/2 Other List 1 4 2 05/01/2024 board/

024 Structures—
Primitive presentation
Operations on
Circular Lists
(Cont..)

3 12/01/2 Stack and 2 4 2 12/01/2024 board/

024 Queue as a
presentation
Circular List

4 15/01/2 Doubly 1 4 2 15/01/2024 board/

024 Linked Lists
presentation

5 16/01/2 Binary Trees 1 4 2 16/01/2024 board/

024 — Operations
on Binary Trees presentation

6 19/01/2 Applications of 1 4 2 19/01/2024 board/

024 Binary Trees
presentation

7 19/01/2 Binary Tree 4 2 19/01/2023 board/

023 Representation
s–Node presentation
Representation
of Binary Trees

8 19/01/2 Internal and 4 2 19/01/2024

024 External Nodes.

Planned Module 4 assessment date:

Type of assessment: Test, quiz, seminar, project, case study, assignment, etc. with COs covered and
Bloom’s level.
 Department of ISE, NMIT
Supriya

Actual Date of completion:

Total Strength of the class:67
Number of students attaining above 60% of the assessment marks:

UNIT 5: Textbooks:
1. Data Structure using C, Aaron M. Tanenbaum, YedidyahLangsam& Moshe J. Augenstein,
Target Lecture Pearson Education/PHI, 2006
Hours: 8
Reference Books
Target Tutorial i. The C Programming Language, Brian W Kernighan and Dennis M Ritchie, Prentice Hall
Hours: 0 Software Series, 2nd Edition
ii. Data structures and algorithms analysis in C, Allen Weiss, Second Edition, Pearson IN
iii. Data Structures a Pseudocode approach with C,RichardF.GilbergandBehrouzA.Forouzan,
Thomson, 2005.
iv. Data Structures & Program Design in C, Robert Kruse&BruceLeung, Pearson.

Foundations of Data Structures, IIT Bombay, https://www.edx.org/course/foundations-of-data-

structures

Sl. Date Topics to be No. of COs Blooms Actual date Mode of Remarks
No. covered hours level of teaching
22IS34.1
required Completio
(board/
(CO number) n
presentation,
etc.)

1 22/01/2 Binary Trees: 1 5 3 22/01/2024 board/

024 Implicit Array
Representation presentation
of Binary Trees,

2 23/01/2 Binary Tree 1 5 3 23/01/2023 board/

023 Traversal in C
presentation

3 02/02/2 Threaded 1 5 3 02/02/2023 board/

023 Binary Trees,
presentation

4 05/02/2 Heterogeneo 1 5 3 05/02/2024 board/

024 us Binary
presentation
Trees
5 06/02/2 Representing 1 5 3 06/02/2024 board/
024 Lists as Binary
Trees presentation

6 9/02/20 Trees and Their 1 5 3 9/02/2024 board/

 Department of ISE, NMIT
Supriya

24 Applications presentation

7 9/02/20 C 1 5 3 9/02/2024 board/

24 Representations
of Trees, presentation

8 9/02/20 Tree Traversals. 1 5 3 9/02/2024 board/

24
presentation

Planned Module 5 assessment date:8/02/2024

Type of assessment: Test, quiz, seminar, project, case study, assignment, etc. with COs covered and
Bloom’s level.
Actual Date of completion:

Total Strength of the class: 67

Number of students attaining above 60% of the assessment marks:

Plan of additional activities:

Learning Assessment 1: (Give details on type of assessment and scheme or rubrics of evaluation)

Learning Assessment 2: (Give details on type of assessment and scheme or rubrics of evaluation)