Algorithms and programs, basic idea of pseudo-code.algorithm efficiency and analysis, time and space analysis of algorithms order notations.

Transcription

1 B. P. Poddar Institute of Management & Technology Department of Information Technology Course Syllabus : Data Structure & Algorithm Academic Year: 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) 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).

2 B. P. Poddar Institute of Management & Technology Graphs (6L) Department of Information Technology Course Syllabus : Data Structure & Algorithm Academic Year: Semester:...3rd... Graph definitions and concepts (directed/undirected graph, weighted/un-weighted edges, subgraph, 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 Depthfirst 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.

3 B. P. Poddar Institute of Management & Technology Department of Information Technology Course outcomes(cos) & CO-PO-PSO mapping Academic Year: 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 CS302.3 CS302.4 CS302.5 CS302.6 Develop algorithm for linear data Structure like stack,queue, linked list. Develop algorithm for non-linear data structure like trees and graphs. Develop sorting algorithms. Develop searching and hashing algorithms. 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 PO PSO1 PSO2 CS CS CS CS CS CS Course

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

5 B.P.Poddar Institute of Management & Technology Department Of Information Technology Subject: Lesson Plan Academic Year: Sem: ODD L21 Binary Search Tree: Deletion of a node in a BST having no child, one child and two children T1 chapter T7 Problem solving on Binary search tree. L22 Balanced Trees-AVL trees: Build an AVL tree,insertion(rebalancing)(elementary T1 chapter treatment to be given)(ll and RR rotation).4 L23 Balanced Trees-AVL trees: Build an AVL tree,insertion(rebalancing)(elementary T1 chapter treatment to be given)(lr and RL rotation).5 L24 Balanced Trees-AVL trees: Build an AVL tree,deletion(rebalancing)(elementary T1 treatment to be given) chapter. T8 Problem solving on AVL tree. L25 Sorting : Introduction of Sorting, bubble sort,insertion sort T1 chapter L26 Selection sort, Merge sort T2 chapter 9.5 L27 Quick sort, radix sort T1 chapter.5 T9 Quiz on sorting L28 Searching : Introduction of Searching, Linear Search. T1 chapter 11.2 L29 Binary Search,Interpolation search T1 chapter 11.2 L30 Hashing : Three Techniques of Hashing :Division, mid square, folding T1 chapter 11.2 T10 Hashing revision L31 Hashing:Collision Resolution Techniques:Linear probing, quadratic probing, T3 chapter double hashing 6 L32 B tree and B+ tree T1 chapter 8 L33 B tree and B+ tree T1 chapter 8 T11 Problems on B tree and B+ tree L34 Introduction to graph. Different graph terminology. T1 chapter 11.4 L35 Breath first search traversal T1 chapter 11.3 L36 Depth first search traversal T1 chapter 11.4 T Problem solving on graph L37 Spanning tree, minimum spanning tree. T1 chapter 11.6 L38 Kruskal algorithm L39 Prim s algorithm T13 Problem solving on minimum spanning tree and Prim s & Kruskal s algorithm. 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.

6 B.P.Poddar Institute of Management & Technology Department Of Information Technology Subject: Lesson Plan Academic Year: Sem: ODD