You are on page 1of 3

Lesson Plan for (Data structures Using C)

rd Programme: BCA Semester: II Date of commencement of classes: 23 July Paper 2007 Code:

108

Academic Year: 2012-2015

Lecture No L1

Details of the Topics/Sub-topics to be covered UNIT-I Data Structures : Introduction & overview of Syllabus ,Definition, Types- Linear; Non-Linear, Basic operations of Data Structures: Insertion, Deletion, Traversing, Searching, Sorting Array: Array Representation: Single; Multidimensional array. Introduction of Algorithm Array: Operations on Arrays: Insertion, Deletion Searching , Traversing Operations on 2-D Array(Matrices): Addition; Subtraction Operations on 2-D Array(Matrices) : Multiplication; Transpose of matrix Sparse Arrays: Types of Sparse Array: Lower Triangular; Upper Triangular; Tri-diagonal Operations on Sparse Array: Creation, Addition, Transpose, Multiplication. Stack :Introduction of stack, Implementation of primitive operations on stack with algorithms : Push; Pop, Application of stack Infix, Postfix, Prefix Expressions, Conversion of infix to postfix expressions. Implementation of infix to postfix expressions algorithm. Assignment 1: Implementation of infix to prefix expression algorithm. Evaluation of Postfix Expression with algorithm. Queue : Introduction of Queue, Implementation of primitive operations on Queue with algorithms : Insertion; Deletion, Application of Queue Introduction of Dequeue: Input Restricted; Output Restricted, Introduction of Priority Queue, circular Queue Revision of Queue, Stack Tutorial-I (10 Marks)

Methodo logy L

Ref/Text Book T2,R1

Date of Delivery

L2

T2,R1

L3 L4 L5 L6 L7 L8

L L,T L L L L

T2,R1 T2 T2 T2,R1 T2,R1 T2,R1

L9 L10

L,T L,T

T2,R1 T2,R1

L11 L12

L,T L

T2,R1 T2,R1

L13

T2,R1

L14 L15

T T

Prepared By: Hemant Kumar Asst Prof (I.T.)

L16

L17,18 L19,20 L21,22 L23 L24 L25 L26

L27 L28,29

L30,31 L32,33 L34 L35

L36 L37 L38

L39 L40

UNIT-II Linked List: Introduction of Linked list, Difference between Array and Linked List, Representation of linked list in memory, Applications, Dynamic Memory Allocation. Implementation of Single linked list with Algorithms : Insertion, Deletion, Traversal Implementation of Two way linked list with Algorithms : Insertion, Deletion , Traversal Implementation of dynamic stack and queue with algorithm. Implementation of polynomial addition with algorithm. Implementation of Header linked list with algorithms : Insertion, Deletion, Traversal Algorithm for searching an element in linked list, Algorithm to count no of nodes in a linked list. Trees : Overview of Trees, Terminology, Definitions: Binary tree, Complete tree, Full Binary tree, Strictly Binary tree Tree Traversals: Preorder, Postorder, Inorder Assignment 2: Tree traversals 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 Recursive algorithms for Tree Traversals : Preorder, Inorder, Postorder Algorithm for creation of Binary tree, Algorithm for deletion of node from Binary tree Revision of Linked list, header Linked list , tree traversals UNIT III Trees Multiway Search trees(B-Tree): Build, Insertion (splitting), Deletion (concatenation) Assignment 4: Build, insertion, deletion in mway tree(Elementary treatment to be given) Binary Search Tree: Build, Search an element , Insertion (Algorithms) Binary Search Tree: Deletion of a node in a BST having no child, one child and two children Balanced Trees-AVL trees: Build an AVL tree, Insertion (Rebalancing)(Elementary treatment to be given) Revision of M- way and AVL Trees Tutorial II (10 Marks)

T2,R1,R2

L L L,T L,T L L L,T

T2,R1,R2 T2,R1,R2 T2,R1,R2

T2,R1,R2 T2,R1,R2 T2,R1,R2 T1,R1,R2

L,T L,T

T1,R1,R2 T1,R1,R2

L L T L

T1,R1,R2 T1,R1,R2

T1,R1

L,T L,T L,T

T1,R1 T1,R1 T1,R1

L T

T1,R1
Prepared By: Hemant Kumar Asst Prof (I.T.)

L41

L42 L43 L44 L45

L46 L47- 50
L Lecture

UNIT-IV Sorting : Introduction of Sorting, Difference between Internal and External Sorting, Insertion sort Selection sort, Merge sort Searching : Introduction of Searching, Linear Search, Binary Search Hashing : Three Techniques of Hashing : Division, midsquare, folding Hashing: Collision Resolution Techniques: Linear probing, quadratic probing, double hashing Revision of Insertion sort, Selection sort, Merge sort Discussion of previous year question papers
T-Tutorial

L L,T L,T L

R1 R1 R1 R1

R1

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. Schaums outline series, Data Structure, TMH, 2002 R2.Yashwant Kanetkar, Data Structures Through C, BPB Pulications, 2008.

Academic Coordinator

Programme Director(s)

Director
Prepared By: Hemant Kumar Asst Prof (I.T.)