(CSE205: DATA STRUCTURES AND ALGORITHMS, Course Outcomes: Through this course students should be able to unit Unie 111 unit 1v unit v Unit vi List of Practical fescribe the process to find efficiency of algorithms using asymptotic notation. : develop skis to compare various data structure algorithms. itustrate the importance of data structures in context of writing efficient programs. 1 Identify appropriate data structures in problem solving. recommend to improve existing code using learned algorithms and data structures. construct new solutions for programming problems. Introduction: asic Data Structures, Basic Concepts and Notations, Complexity analysis: time space ‘and trade off, Omega Notation, Theta Notation, ig O notation ‘Arrays: Linear arrays: memory representation, Traversal, Insertlon, Deletion, Searching, Merging ‘and their complexity analysis. Sorting and Searching: Subble sort, Insertion sort, Selection sort Linked Lists: Introduction, Memory representation, Allocation, Traversal, Insertion, Deletion, Header linked lists: Grounded and Circular, Two-way ists: operations on two way linked ists ‘Stacks: Introduction: List and Array representations, Operations on stack (traversal, push and pop), ‘Asthmatic expressions: polish notation, evaluation and transformation of expressions: ‘Array and lst representation, operations (traversal insertion and deletion), Priority Queues, Recursion: Introduction, Recursive implementation of Towers of Hanoi, Merge sort, Quick sort ‘Trees : Binary trees - introduction (complete and extended binary trees), memory representation (linked, sequential, Pre-order traversal, In-order traversal, Post-order traversal using recursion, Binary Search Tree: searching, insertion, deletion AVL trees and Heaps: AVL troes - introduction, AVL trees Insertion, AVL trees Deletion, Heaps ~ Insertion, Heapify, Deetion, Heap Sort, Huffman algerithm Graphs: warshal's algorithm, Shortest path algorthm Floyd Warshall Algorithm (modified Warshall algorithm), Graph Traversal: BFS, DFS ‘ashing : Hashing Introduction, Hash Functions, Hash Table, Closed hashing (open addressing), LUnear Probing, Quadratic Probing, Double Hashing, Open hashing (separate chaining) ‘Arrays: Program to implement insertion and deletion operations in avrays ‘Searching: Program to implement diferent searching techniques - linear and binary search Sorting: Program to implement diferent sorting techniques ~ bubble, selection and insertion sort, Linked List: Program to implement searchin, Insertion and deletion operations in linked lst ‘Doubly Linked List: Program to implement searching, insertion and deletion operations in doubly linked list ‘Stacks: Program to implament push and pop operations in stacks using beth arrays and linked list (Queues: rogram to implement enqueue and dequeue operations in queues using both arays and inked ist [Recursions: Program to demonstrate concept of recursions with problem of tower of Hanoi [Recursive Sorting: Frogram to implement recursive sorting techniques ~ merge sort, quick sort Session 2020-2024 age: 1/2‘Trees: Program to create and traverse a binary tree recursively Binary Search Tree: Program ta implement insertion and deletion operations in BST Heaps: Program to implement insertion and deletion operations in Heaps and Heap Sort ‘Text Books: 1 DATA STRUCTURES by SEYMOUR LIPSCHUTZ, MCGRAW HILL EDUCATION L.DATA STRUCTURES AND ALGORITHMS by ALFRED V. AHO, JEFFREY D. ULLMAN AND JOHN, E. HOPCROFT, PEARSON