Unit 1

Introduction: Overview of Data Structures – A Philosophy of Data Structures – The Need for Data Structures – Cost and Benefits – Abstract Data Types and Data Structures – Principles, and Patterns. Basic complexity analysis – Best, Worst, and Average Cases – Asymptotic Analysis -Analyzing Programs – Space Bounds, Arrays, Linked Lists and Recursion: Using Arrays – Lists – Array based List Implementation – Linked Lists – LL ADT – Singly Linked List – Doubly Linked List – Circular Linked List – recursion- linear, binary, and multiple recursions.

Stacks and Queues: Stack ADT – Array based Stacks, Linked Stacks – Implementing Recursion using Stacks, Queues – ADT, Array based Queue, Linked Queue, Doubleended queue, Circular queue.

Unit 2

Trees: Tree Definition and Properties – Tree ADT – Basic tree traversals – Binary tree – Data structure for representing trees – Linked Structure for Binary Tree – Array based implementation. Priority queues: ADT – Implementing Priority Queue using List – Heaps. Maps and Dictionaries: Map ADT – List based Implementation – Hash Tables – Dictionary ADT – Skip List – Complexity.

Unit 3

1. Goodrich M. T. and Tamassia R., “Data Structures and Algorithms in Java”, Fifth edition, Wiley publication, 2010.
2. Clifford A. Shaffer, “Data Structures and Algorithm Analysis”, Third Edition, Dover Publications, 2012.

• Goodrich M. T., Tamassia R. and Michael H. Goldwasser, “Data Structures and Algorithms in Python++”, Wiley publication, 2013
• Tremblay J. P. and Sorenson P. G., “An Introduction to Data Structures with Applications”, Second Edition, Tata McGraw-Hill, 2002.