COURSE CODE L 4 T 0

COURSE TITLE

DATA STRUCTURE & ALGORITHMS WEIGHTAGES CA MTE ETE P 0 Th 50

P 0

CREDITS (or Max. Marks) 4

Attd AT
5 20

P
0

P 0

Th 25

COURSE OBJECTIVES: PRE-REQUISITES: CSE100: Basic programming Skills CSE101: Foundations of Computing CSE151: Computing I CSE202: OOPS CSE251: Computing - II COURSE CONTENTS: S. No. 1 Description Basic concepts and notations, data structures and data structure operations,Complexity Analysis: Mathematical notation and functions, algorithmic complexity and time space trade off, Computational & Asympotic Complexity, Big O Notation, Theta & Omega Notation, The best, average & Worst cases analysis & Running Time calculations of various algorithms to be studied through out the term. Basic data structures such as arrays, stack and queues and their applications, linked and sequential representation,Arrays, Records & Pointers: Linear & Multidimensional Arrays, Representation & traversal. Records, Record Structures, Pointers: Pointer Arrays.Arrays of Pointers and Dynamic Memory Management:, usage of pointers, memory management functions, debugging pointers.Linked list, representation, traversal, searching, Insertion, deletion of linked list, Two way / multi linked structures, Header Lists, Circular Lists Stacks, Queues & Recursion: Representation in memory, traversal & basic operations on stacks & Queues. Applications of Stacks, stacks & queues. Various types of Queues. Recursion: Definition, Function Call & Recursion implementation, Anatomy of Recursive Call, Tail & Non Tail Recursion, Indirect & Nested Recursion, Backtracking. Complexity issues MTE Trees-definitions and basic concepts, representation in memory, Binary trees, binary tree traversal, searching insertion and deletion in binary trees. Binary Search Trees, Search, Insertion, deletion in binary search trees, Heaps & Heap Sort Algorithms, Heaps as priority Queues Self balancing trees, Multiway Trees, Family of B trees & AVL trees. Graphs and their application, representation, terminology Traversing a graph, Algorithm for shortest distance,DFS and BFS, Hashing Searching and sorting use of various data structures for searching and sorting, Various Algorithms for Sorting & Searching & their complexity Linear and Binary search, Insertion sort, Selection sort, Merge sort, Radix sort, Bubble sort, Quick sort, Heap Sort etc.. or or or or

4 5

6 7 8 9 10

TEXT BOOKS: 1. Author: Seymour Lipschutz,Title: Schaum Outline Series,Publishers: Tata McGraw Hill,New Delhi,Year of Publication: 2006 OTHER READINGS:

1. 2. 3. 4.
5.

Mark Allen Weises, Data Structures & Algorithmic Analysis in C, Pearson Education Adam Drozdek, Data Structure & Algorithms in C++. Thomson Kruse, Data Structures & Program design, Prentice Hall of India, New Delhi. Tenenbaum, Augenstein, & Langsam, Data Structures using C and C++, Prentice Hall of India, New Delhi.
Sorenson and Tremblay : An Introduction to Data Structures with Algorithms.