Scribd
Upload
543 views3 pages

Lesson Plan - Data Structure

The document outlines a lesson plan for a course on Data Structure & C that is divided into 3 chapters over 4 months. Chapter 1 covers linear data structures like stacks, queues, and recursion with lectures in July. Chapter 2 focuses on non-linear data structures like trees, binary trees, and binary search trees from August to October. Chapter 3 discusses searching, sorting, and hashing with lectures in November. There will be formative tests after each chapter and an internal examination at the end consisting of objective, short answer, and subjective questions.

Uploaded by

barnaliguptabanik
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
Download as doc, pdf, or txt
543 views3 pages

Lesson Plan - Data Structure

The document outlines a lesson plan for a course on Data Structure & C that is divided into 3 chapters over 4 months. Chapter 1 covers linear data structures like stacks, queues, and recursion with lectures in July. Chapter 2 focuses on non-linear data structures like trees, binary trees, and binary search trees from August to October. Chapter 3 discusses searching, sorting, and hashing with lectures in November. There will be formative tests after each chapter and an internal examination at the end consisting of objective, short answer, and subjective questions.

Uploaded by

barnaliguptabanik
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
Download as doc, pdf, or txt
Download as doc, pdf, or txt
You are on page 1/ 3

Lesson Plan Subject: Data Structure & C (Partly) Code: EC504B Credits: 4 Total Number of Lectures: 20

Barnali Gupta Banik

Chapter

Sub Topics

No. of Lectu re
1

Books

Month of Teachi ng

Formative Test

Linear Data Structure

Introduction : Why we need data structure? Concepts of data structures: a) Data and data structure b) Abstract Data Type and Data Type. Algorithms and programs, basic idea of pseudo-code. Stack: Stack and its implementations (using array, using linked list), applications. Queue: Queue, circular queue, dequeue. Implementation of queue- both linear and circular (using array, using linked list), applications. Recursion: Principles of recursion use of stack, differences between recursion and iteration, tail recursion. Applications - The

July

1. Data Structures by S. Lipschutz. 2. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. 3. Fundamentals of Data Structures of C by Ellis Horowitz, Sartaj Sahni, Susan Anderson-freed.

Class test of 20 marks will be taken coving each chapter mentioned here.

Linear Data Structure

August

Lesson Plan Tower of Hanoi, Eight Queens Puzzle. Nonlinear Data structures Trees : Basic terminologies, forest, tree representation (using array, using linked list). Binary trees: binary tree traversal (pre-, in-, postorder), threaded binary tree (left, right, full) - nonrecursive traversal algorithms using threaded binary tree, expression tree. Binary search tree: operations (creation, insertion, deletion, searching). Height balanced binary tree : AVL tree (insertion, deletion with examples only). B- Trees: operations (insertion, deletion with examples only). Searching, Sorting Hashing: Hashing functions, collision resolution techniques.
2

Barnali Gupta Banik

Septemb er -October

Novemb er

Internal Examination Summary:


Objective: 5 marks Short Answer Type: 10 Marks

Lesson Plan
Subjective Type: 15marks

Barnali Gupta Banik

Signature: Date:

You might also like