Prepared By: Hemant Kumar

Asst Prof (I.T.)

Lesson Plan for (Data structures Using C)

Date of commencement of classes: 23rd

July’ 2007

Lecture

No

Details of the Topics/Sub-topics to be covered Methodo

logy

Ref/Text

Book

Date of

Delivery

L1

UNIT-I

Data Structures : Introduction & overview of

Syllabus ,Definition, Types- Linear; Non-Linear,

Basic operations of Data Structures: Insertion,

Deletion, Traversing, Searching, Sorting

L T2,R1

L2 Array: Array Representation: Single;

Multidimensional array. Introduction of

Algorithm

L T2,R1

L3 Array: Operations on Arrays: Insertion, Deletion

Searching , Traversing

L T2,R1

L4 Operations on 2-D Array(Matrices): Addition;

Subtraction

L,T T2

L5 Operations on 2-D Array(Matrices) :

Multiplication; Transpose of matrix

L T2

L6 Sparse Arrays: Types of Sparse Array: Lower

Triangular; Upper Triangular; Tri-diagonal

L T2,R1

L7 Operations on Sparse Array: Creation, Addition,

Transpose, Multiplication.

L T2,R1

L8 Stack :Introduction of stack, Implementation of

primitive operations on stack with algorithms :

Push; Pop, Application of stack

L T2,R1

L9 Infix, Postfix, Prefix Expressions, Conversion of

infix to postfix expressions.

L,T T2,R1

L10 Implementation of infix to postfix expressions

algorithm.

Assignment 1: Implementation of infix to prefix

expression algorithm.

L,T T2,R1

L11 Evaluation of Postfix Expression with algorithm. L,T T2,R1

L12 Queue : Introduction of Queue, Implementation

of primitive operations on Queue with algorithms

: Insertion; Deletion, Application of Queue

L T2,R1

L13 Introduction of Dequeue: Input Restricted;

Output Restricted, Introduction of Priority

Queue, circular Queue

L T2,R1

L14 Revision of Queue, Stack T

L15 Tutorial-I (10 Marks) T

Programme: BCA Semester: II Paper Code: 108 Academic Year: 2012-2015

Prepared By: Hemant Kumar

Asst Prof (I.T.)

L16 UNIT-II

Linked List: Introduction of Linked list,

Difference between Array and Linked List,

Representation of linked list in memory,

Applications, Dynamic Memory Allocation.

L T2,R1,R2

L17,18 Implementation of Single linked list with

Algorithms : Insertion, Deletion, Traversal

L T2,R1,R2

L19,20 Implementation of Two way linked list with

Algorithms : Insertion, Deletion , Traversal

L T2,R1,R2

L21,22 Implementation of dynamic stack and queue with

algorithm.

L,T T2,R1,R2

L23 Implementation of polynomial addition with

algorithm.

L,T

T2,R1,R2

L24 Implementation of Header linked list with

algorithms : Insertion, Deletion, Traversal

L T2,R1,R2

L25 Algorithm for searching an element in linked list,

Algorithm to count no of nodes in a linked list.

L T2,R1,R2

L26 Trees : Overview of Trees, Terminology,

Definitions: Binary tree, Complete tree, Full

Binary tree, Strictly Binary tree

L,T T1,R1,R2

L27 Tree Traversals: Preorder, Postorder, Inorder

Assignment 2: Tree traversals

L,T T1,R1,R2

L28,29 Representation of Arithmetic expression as a

binary tree, Formation of Binary tree from given

Inorder and preorder/ postorder traversals.

Assignment 3: Formation of binary tree

L,T T1,R1,R2

L30,31 Recursive algorithms for Tree Traversals :

Preorder, Inorder, Postorder

L T1,R1,R2

L32,33 Algorithm for creation of Binary tree, Algorithm

for deletion of node from Binary tree

L T1,R1,R2

L34 Revision of Linked list, header Linked list ,

tree traversals

T

L35 UNIT – III

Trees Multiway Search trees(B-Tree): Build,

Insertion (splitting), Deletion (concatenation)

Assignment 4: Build, insertion, deletion in m-

way tree(Elementary treatment to be given)

L T1,R1

L36 Binary Search Tree: Build, Search an element

, Insertion (Algorithms)

L,T T1,R1

L37 Binary Search Tree: Deletion of a node in a BST

having no child, one child and two children

L,T T1,R1

L38 Balanced Trees-AVL trees: Build an AVL tree,

Insertion (Rebalancing)(Elementary treatment to

be given)

L,T T1,R1

L39 Revision of M- way and AVL Trees L T1,R1

L40 Tutorial –II (10 Marks) T

Prepared By: Hemant Kumar

Asst Prof (I.T.)

L41 UNIT-IV

Sorting : Introduction of Sorting, Difference

between Internal and External Sorting, Insertion

sort

T

L42 Selection sort, Merge sort L R1

L43 Searching : Introduction of Searching, Linear

Search, Binary Search

L,T R1

L44 Hashing : Three Techniques of Hashing :

Division, midsquare, folding

L,T R1

L45 Hashing: Collision Resolution Techniques:

Linear probing, quadratic probing, double

hashing

L R1

L46 Revision of Insertion sort, Selection sort,

Merge sort

T R1

L47- 50 Discussion of previous year question papers

L –Lecture T-Tutorial A-Assignment

ASSIGNMENTS

Assignment 1: Implementation of infix to prefix expression algorithm.

Assignment 2: Tree traversals

Assignment 3: Formation of binary tree

Assignment 4: Build, insertion, deletion in m-way tree(Elementary treatment to be given)

BOOKS

T1.Ashok N. Kamthane, “Introduction to Data Structures in C”, Pearson Edu.

T2. R. S. Salaria, “Data Structure & Algorithms”, Khanna Book Publishing Co. (P) Ltd., 2002

R1. Schaum’s outline series, “Data Structure”, TMH, 2002

R2.Yashwant Kanetkar, “Data Structures Through C”, BPB Pulications, 2008.

Academic Coordinator Programme Director(s) Director