B. P.

Poddar Institute of Management & Technology

Department of Information Technology
Course Syllabus : Data Structure & Algorithm
Academic Year:.18-19....... Semester: ......3rd......

Module -I. [8L]

Linear Data Structure Introduction (2L).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.Algorithm efficiency and analysis, time
and space analysis of algorithms – order notations.

Array (2L):

Different representations – row major, column major. Sparse matrix - its implementation and
usage. Array representation of polynomials. Linked List (4L)

Singly linked list, circular linked list, doubly linked list, linked list representation of
polynomial and applications.

Module -II: [7L] Linear Data Structure

[Stack and Queue (5L)

Stack and its implementations (using array, using linked list), applications.Queue, circular
queue, dequeue. Implementation of queue- both linear and circular (using array, using

linked list),applications.

Recursion (2L)

Principles of recursion – use of stack, differences between recursion and iteration, tail
recursion.Applications - The Tower of Hanoi, Eight Queens Puzzle.

Module -III. [15L] Nonlinear Data structures

Trees (9L):

Basic terminologies, forest, tree representation (using array, using linked list).Binary trees -
binary tree traversal (pre-, in-, post- order), threaded binary tree (left, right, full) non-
recursive 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).

 B. P. Poddar Institute of Management & Technology
Department of Information Technology
Course Syllabus : Data Structure & Algorithm
Academic Year:.18-19....... Semester: ......3rd......
Graphs (6L)

Graph definitions and concepts (directed/undirected graph, weighted/un-weighted edges, sub-

graph, degree, cut-vertex/articulation point, pendant node, clique, complete graph, connected
components – strongly connected component,weakly connected component, path, shortest
path, isomorphism). Graph representations/storage implementations – adj

acency matrix, adjacency list, adjacency multi-list. Graph traversal and connectivity – Depth-
first search (DFS), Breadth-first search (BFS) – concepts of edges used in DFS and

BFS (tree-edge, back-edge, cross-edge, forward-edge), applications.

Minimal spanning tree – Prim’s algorithm (basic idea of greedy methods).

Module - IV. Searching, Sorting (10L):

Sorting Algorithms (5L):

Bubble sort and its optimizations, insertion sort, shell sort, selection sort, merge sort, quick
sort,heap sort (concept of max heap, application – priority queue), radix sort.

Searching (2L):

Sequential search, binary search, interpolation search.

Hashing (3L):

Hashing functions, collision resolution techniques

.
 B. P. Poddar Institute of Management & Technology
Department of Information Technology
Course outcomes(COs) & CO-PO-PSO mapping
Academic Year:.18-19....... Semester: ......3rd......

Course Name: Data structure and Algorithm

Course Code: CS-302

Course outcomes

Course Outcome Statement

CO
CS302.1 Explain fundamentals of data structure .

CS302.2 Develop algorithm for linear data Structure like stack ,queue, linked list.

CS302.3 Develop algorithm for non-linear data structure like trees and graphs.

CS302.4 Develop sorting algorithms.

CS302.5 Develop searching and hashing algorithms.

CS302.6 Identify suitable data structure ,sorting and searching algorithms to solve a particular
problem.

CO-PO

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CS302.1 3 2 2 2 1
CS302.2 3 2 2 2 2 2
CS302.3 3 2 2 2 2 2
CS302.4 3 2 2 2 2 2
CS302.5 3 2 2 2 2 2
CS302.6 3 2 2 2 2 2
Course 3 2 2 2 2 1.8
 B.P.Poddar Institute of Management & Technology
Department Of Information Technology
Subject: Lesson Plan Academic Year: 18-19 Sem: ODD

Stream : Information Technology

Subject : Data structure and algorithm
Subject Code: CS-302
Lecture Topic Reference Teaching Teaching Aids
No. s Methods
Data Structures : Introduction & overview of Syllabus ,Definition, Types- T1 Chapter Chalk & Whiteboard
L1
Linear; Non-Linear data structure.Introduction of Algorithm.Basic operations 5 5.1-5.2 Talk
of Data Structures: Insertion, Deletion, Traversing, Searching, Sorting.
Array:Array Representation: Single; Multidimensional array. Array: Operations T1 Chapter Chalk & Whiteboard
L2 on Arrays: Insertion, Deletion Searching , Traversing .Operations on 2-D 5.3-5 Talk
Array(Matrices): Addition;Subtraction,Multiplication; Transpose of matrix
L3 Sparse Matrices: Types of Sparse Array: Lower Triangular; Upper Triangular; T1 Chapter Chalk & Whiteboard
Tri-diagonal, 3 column representation of sparse matrix. 5,8.3 Talk
TI Revision of array, sparse matrix Chalk & Whiteboard
Talk
L4 Stack :Introduction of stack, Implementation of primitive operations on stack T1 Chapter Chalk & Whiteboard
5, 4.2 Talk
with algorithms : Push; Pop, Application of stack
L5 Infix, Postfix, Prefix Expressions, Conversion of infix to postfix expressions. T1 chapter Chalk & Whiteboard
8.5 Talk
L6 Evaluation of Postfix Expression with algorithm. T1 chapter Chalk & Whiteboard
8.4 Talk
T2 Problem solving on stack, infix to postfix conversion. Chalk & Whiteboard
Talk
L7 Queue : Introduction of Queue, Implementation of primitive operations on Queue T1 chapter Chalk & Whiteboard
with algorithms : Insertion; Deletion, Application of Queue. 5 Talk
L8 Introduction of Dequeue: Input Restricted;Output Restricted, Introduction of T1 chapter Chalk & Whiteboard
Priority Queue, circular Queue 5, 4.2 Talk
Linked List: Introduction of Linked list,Difference between Array and Linked T1 chapter Chalk & Whiteboard
L9
List,Representation of linked list in memory, Applications, Dynamic Memory 10.6 Talk
Allocation memory.
T3 Q&A on Queue , dequeue. Chalk & Whiteboard
Talk
L10 Implementation of Single linked list with Algorithms : Insertion, Traversal. T1 chapter Chalk & Whiteboard
10.6 Talk
L11 Implementation of Single linked list with Algorithms : Deletion. T1 chapter Chalk & Whiteboard
10.6 Talk
L12 Implementation of dynamic stack and queue with algorithm. T1 chapter Chalk & Whiteboard
10 Talk
T4 Doubt clarification on linked list Chalk & Whiteboard
Talk
L13 Implementation of polynomial addition with algorithm. T1 chapter Chalk & Whiteboard
10.3 Talk
L14 Implementation of double linked list with algorithms : Insertion, Deletion, T1 chapter Chalk & Whiteboard
Traversal 10.4 Talk
L15 Algorithm for searching an element in linked list, Algorithm to count no of nodes T1 chapter Chalk & Whiteboard
in a linked list. 10.5 Talk
T5 Doubt clarification on double linked list Chalk & Whiteboard
Talk
L16 Trees : Overview of Trees, Terminology, Definitions: Binary tree, Complete tree, T1 chapter Chalk & Whiteboard
Full Binary tree, Strictly Binary tree 10.5 Talk
L17 Tree Traversals: Preorder, Postorder, Inorder T1 Chalk & Whiteboard
chapter12, Talk
L18 Recursive algorithms for Tree Traversals :Preorder, Inorder, Postorder T2 chapter Chalk & Whiteboard
T2
9 chapter Talk
T6 Problem solving & doubt clarification on tree traversal. 9 Chalk & Whiteboard
Talk
L19 Algorithm for creation of Binary tree,insertion, deletion in Binary tree. T1 chapter Chalk & Whiteboard
12 Talk
L20 Binary Search Tree: Build, Search an element, Insertion (Algorithms) T1 chapter Chalk & Whiteboard
12 Talk
 B.P.Poddar Institute of Management & Technology
Department Of Information Technology
Subject: Lesson Plan Academic Year: 18-19 Sem: ODD

L21 Binary Search Tree: Deletion of a node in a BST having no child, one child and T1 chapter Chalk & Whiteboard
two children 12 Talk
T7 Problem solving on Binary search tree. Chalk & Whiteboard
Talk
L22 Balanced Trees-AVL trees: Build an AVL tree,Insertion(Re- T1 chapter Chalk & Whiteboard
balancing)(Elementary treatment to be given)(LL and RR rotation) 12.4 Talk
L23 Balanced Trees-AVL trees: Build an AVL tree,Insertion(Re- T1 chapter Chalk & Whiteboard
balancing)(Elementary treatment to be given)(LR and RL rotation) 12.5 Talk
L24 Balanced Trees-AVL trees: Build an AVL tree,deletion(Re- T1 Chalk & Whiteboard
balancing)(Elementary treatment to be given) chapter12. Talk
T8 Problem solving on AVL tree. 6 Chalk & Whiteboard
Talk
L25 Sorting : Introduction of Sorting, bubble sort ,Insertion sort T1 chapter Chalk & Whiteboard
12 Talk
L26 Selection sort, Merge sort T2 chapter Chalk & Whiteboard
9.5 Talk
L27 Quick sort , radix sort T1 chapter Chalk & Whiteboard
12.5 Talk
T9 Quiz on sorting Chalk & Whiteboard
Talk
L28 Searching : Introduction of Searching, Linear Search. T1 chapter Chalk & Whiteboard
11.2 Talk
L29 Binary Search,Interpolation search T1 chapter Chalk & Whiteboard
11.2 Talk
L30 Hashing : Three Techniques of Hashing :Division, mid square, folding T1 chapter Chalk & Whiteboard
11.2 Talk
T10 Hashing revision Chalk & Whiteboard
Talk
L31 Hashing:Collision Resolution Techniques:Linear probing, quadratic probing, T3 chapter Chalk & Whiteboard
double hashing 6 Talk
L32 B tree and B+ tree T1 chapter Chalk & Whiteboard
8 Talk
L33 B tree and B+ tree T1 chapter Chalk & Whiteboard
8 Talk
T11 Problems on B tree and B+ tree Chalk & Whiteboard
Talk
L34 Introduction to graph . Different graph terminology. T1 chapter Chalk & Whiteboard
11.4 Talk
L35 Breath first search traversal T1 chapter Chalk & Whiteboard
11.3 Talk
L36 Depth first search traversal T1 chapter Chalk & Whiteboard
11.4 Talk
T12 Problem solving on graph Chalk & Whiteboard
Talk
L37 Spanning tree, minimum spanning tree. T1 chapter Chalk & Whiteboard
11.6 Talk
L38 Kruskal algorithm Chalk & Whiteboard
Talk
L39 Prim’s algorithm Chalk & Whiteboard
Talk
T13 Problem solving on minimum spanning tree and Prim’s & Kruskal’s algorithm. Chalk & Whiteboard
Talk
1)“Data Structures Using C” by Reema Thareja
T2) “Data Structures” by S. Lipschutz.
T3).Data Structures in C” by Aaron M. Tenenbaum.
T4) “Data Structure Using C”, 2/e by A.K. Rath, A. K. Jagadev.
T5) “Introduction to Algorithms” by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest,
Clifford Stein.
B.P.Poddar Institute of Management & Technology
Department Of Information Technology
Subject: Lesson Plan Academic Year: 18-19 Sem: ODD