Data Structures and Algorithms (Python)

(CD3291 – Data Structures and Algorithms & CD3281 – Data Structures and Algorithm Laboratory)

B. Tech. – Information Technology

As per the Latest Syllabus of Anna University, Chennai

(Regulation 2021)

Dr. S. Nithyanantham,

Associate Professor
School of Engineering
Department of Computer Science and Engineering
Kalasalingam Academy of Research and Education
Anand Nagar, Krishnankoil.

Ms. N. P. Shangara Narayanee, B.E., M.E.,

Assistant Professor
Department of Artificial Intelligence and Data Science Engineering
Erode Sengunthar Engineering College
Perundurai.

Mr. P. Krishna Sankar, B.E., M.E.,

Freelance Entrepreneur / Consultant

Kavindapadi

A.R.S. Publications
No. 11, Veerabathra Nagar, Part II,
8th Street, Medavakkam,
Chennai – 600 100, Tamil Nadu, India.
Phone: 044 – 48587467, Mobile: 9840025186
eMail: arspublications@gmail.com
web: www.arspublications.com
 PREFACE
This book “Data Structures and Algorithms” is about basic idea towards data representation in
program and its manipulation. It provides a clear view towards Abstract Data Type and Object-
Oriented Programming on Python. It provides a preliminary study on linear data structures, sorting,
searching, hashing, Tree and Graph Structures along with Python implementation.

Unit I Introduction towards Abstract Data Types and Object-Oriented Programming.

Contributes a knowledge on analysis of algorithm, asymptotic notations, divide &

conquer and recursion with example.

Unit II Summary on Linear structures and its working mechanism. Provides an hands on

understanding towards the Array List, Linked List, Stack and Queue. Linked list were

represented with singly, doubly, circularly, stack and queue through Python.

Unit III Brief knowledge over sorting and searching. Bubble, Selection, Insertion, Merge,

Quick sort implemented through Python. It provides detailed understanding and

procedures for linear search, binary search, hash functions and collision handling.

Unit IV Transitory awareness on Tree and its traversal. Provides a procedure in Python to

construct Binary Tree, AVL Tree, Heap, B Tree & B+ Tree and Tree Traversal.

Unit V Provides a study over graph and its traversal mechanisms. Python hands on

experience over estimating shortest path and constructing minimum spanning tree

over a graph. Understanding towards problem complexity and its classes.

Unit VI It provides an implementation idea over recursive algorithm, List, Stack and Queue.

Understanding towards the several sorting and searching algorithm using python.

Detailed implementation to construct tree traversal, minimum spanning tree and

estimate the shortest path on graph through Python.

 ACKNOWLEDGEMENT

Primarily, we would like to thank God. In the process of putting this book together, we realized
how true this gift of writing is for us to share our knowledge. You give us the power to believe in our
passion and pursue our dreams. We could never have done this without the faith we have in you, the
Almighty.

We wholeheartedly thank next God, thy Parents, for showing faith with us and giving
us liberty to choose what we desire. We salute you all for the selfless love, care, pain and sacrifice you
did to shape our life.

We sincerely thank our Colleagues, Friends and Well-wishers for their understanding, patience
in addition, constant encouragement.

Finally, we offer our special thanks to Thiru. A. Ramesh, A. R. S. Publishers and his Colleagues
for their tireless effort in overseeing the production of the book.

The authors would be happy to collect opinion for supplementary improvement of the book.

Dr. S. Nithyanantham

Ms. N. P. Shangara Narayanee

Mr. P. Krishna Sankar

Contents
UNIT I 2

ABSTRACT DATA TYPES 2

1.1 Introduction to Data Structure 2

1.1.1 Primitive Data Structures 2

1.1.2 Non-Primitive Data Structures 2

1.2 Abstract Data Types (ADTs) 4

1.3 ADTs and classes 5

1.4 Introduction to OOP in Python 5

1.4.1 Classes and Object 6

1.4.2 Constructors 7
1.4.3 Inheritance 11

1.4.4 Encapsulation 20
1.4.5 Abstraction 21

1.4.6 Polymorphism 22
1.4.7 Namespaces 23

1.4.8 Shallow and Deep copying 28

1.5 Introduction to analysis of algorithms 30

1.5.1 Notion of an Algorithm 30

1.5.2 Fundamentals of Algorithmic Problem Solving 32

1.5.3 Analysis Framework 38

1.5.4 Asymptotic notations 42

1.6 Divide & conquer 48

1.6.1 Finding maximum and minimum 51

1.7 Recursion 52
1.7.1 Example 1: Factorial function F (n) = n! 53

1.7.2 Example 2: Tower of Hanoi 56

1.7.3 Example 3: Calculate the number of binary digits in n’s binary representation 59

1.7.4 Example 4: Computing the nth Fibonacci Number 61

UNIT II 3
LINEAR STRUCTURES 3

2.1 List ADT 3

2.1.1 Array-based implementations 3

2.1.2 Linked list implementations 6

2.1.3 Difference between Array and Linked list implementation 7

2.2 Singly linked lists 8

2.2.1 Create a Node 12

2.2.2 Display the List 13

2.2.3 Search in List 14

2.2.4 Inserting 15
2.2.5 Deleting 16

2.2.6 Application 17
2.3 Circular linked lists 18

2.3.1 Create a Node 22

2.3.2 Display the List 23

2.3.3 Search in List 25

2.3.4 Inserting 25

2.3.5 Deleting 27

2.3.6 Application 27
2.4 Doubly linked lists 28

2.4.1 Create a Node 33

2.4.2 Display the List 34

2.4.3 Search in List 35

2.4.4 Inserting 36
2.4.5 Deleting 37

2.4.6 Difference between Singly and Doubly Linked List 37

2.4.7 Application 37

2.5 Stack ADT 38

2.5.1 Array based implementation 38
2.5.2 Linked List based implementation 43

2.5.3 Applications of Stack 48

2.5.4 Expressions 49

2.6 Queue ADT 56

2.6.1 Array based implementation 56

2.6.2 Linked List based implementation 64

2.6.3 Applications of Queue 69

2.7 Double ended queues 69

2.7.1 Input restricted Queue 70

2.7.2 Output restricted Queue 70

2.7.3 Operations performed on deque 70

2.7.4 Sample program to implement the Dequeue 73

UNIT III 2
SORTING AND SEARCHING 2

3.1 Sorting 2
3.1.1 Bubble sort 3

3.1.2 Selection sort 8

3.1.3 Insertion sort 15

3.1.4 Merge sort 20

3.1.5 Quick sort 25

3.1.6 Analysis of sorting algorithms 30

3.2 Searching 30
3.2.1 Linear search 31
3.2.2 Binary search 33

3.2.3 Comparison on Linear and Binary Search 36

3.3 Hashing 37

3.3.1 Hash functions 37

3.3.2 Collision handling 42
3.3.3 Load factors 55

3.3.4 Rehashing 56

3.3.5 Efficiency 58

UNIT IV 3

TREE STRUCTURES 3
4.1 Tree ADT 3

4.1.1 Terms 4

4.1.2 Properties 5
4.2 Binary Tree ADT 6

4.2.1 Characteristics 7
4.2.2 Various types of Binary Tree 8

4.2.3 Binary search trees 11

4.2.4 Tree traversals 16

4.2.5 Sample Program to implement Binary Search Tree 26

4.2.6 Algorithm Analysis 32

4.3 AVL trees 33

4.3.1 Balance Factor 33

4.3.2 Rotation 33

4.3.3 Insert 37
4.3.4 Delete 39

4.3.5 Search a Node 42

4.3.6 Tree traversals 42

4.3.7 Sample Program 42

4.3.8 Sample AVL Tree construction 48
4.3.9 Algorithm Analysis 51

4.4 Heaps 51

4.4.1 Heapify 53

4.4.2 Heap Sort 54

4.4.3 Priority Queues 56
4.4.4 Construct a Max Heap - Example 58

4.4.5 Construct a Min Heap - Example 60

4.4.6 Sample Program 62

4.4.7 Algorithm Analysis 68

4.4.8 Applications of Heap 68

4.5 Multiway search trees 69

4.5.1 B-Tree 70

4.5.2 B+ Tree 78
4.5.3 B Tree VS B+ Tree 81

UNIT V 2
GRAPH STRUCTURES 2

5.1 Graph 2
5.1.1 Graph ADT 4

5.1.2 Types of Graphs 5

5.2 Representations of graph 10

5.2.1 Adjacency Matrix 10

5.2.2 Adjacency Lists 13

5.2.3 Incidence Matrix 14

5.3 Graph traversals 15

5.3.1 Depth-First Search 16

5.3.2 Breadth-First Search 18

5.3.3 Applications of graph traversal 22

5.3.4 BFS vs DFS 24

5.4 Theoretical Idea on Graph Evaluation 26
5.4.1 Directed Acyclic Graph (DAG) 26

5.4.2 Topological ordering 26

5.4.3 Greedy algorithms 27

5.4.4 Dynamic programming 27

5.4.5 Shortest paths 29
5.4.6 Spanning trees 29

5.5 Algorithms for Shortest Path and Minimum Spanning Tree 32

5.5.1 Kruskal’s algorithm – MST & Greedy 32

5.5.2 Prim’s algorithm - MST & Greedy 38

5.5.3 Bellman-Ford algorithm – SP & DP 44

5.5.4 Dijkstra’s algorithm - SP & Greedy 49

5.5.5 Floyd warshall algorithm - SP 57

5.6 Introduction to complexity classes and intractability 62

5.6.1 Tractable Vs. Intractable Problems 62

5.6.2 Terminology on Classes 63

5.6.3 Complexity classes 64

UNIT - 6 3
DATA STRUCTURES AND ALGORITHMS LABORATORY 3

6.1 Implement simple ADTs as Python classes 3

6.2 Implement recursive algorithms in Python 3

6.2.1 Factorial of a Number 3

6.2.2 Count number of binary digits to a decimal value 4

6.2.3 Fibonacci of nth element 4

6.3 Implement List ADT using Python arrays 5

6.4 Linked list implementations of List 8

6.5 Implementation of Stack and Queue ADTs 11

6.5.1 Stack – Array 11

6.5.2 Stack – Linked List 13

6.5.3 Queue – Array 16
6.5.4 Queue – Linked List 19

6.6 Applications of List, Stack and Queue ADTs 21

6.6.1 Stack - Evaluate Expression 21

6.6.2 Stack - Reverse String 23

6.6.3 Queue - Tree traversal using BFS 24
6.6.4 Queue - CPU Process Scheduling 25

6.7 Implementation of sorting and searching algorithms 26

6.7.1 Bubble Sort 26

6.7.2 Quick Sort 27

6.7.3 Linear Search 29

6.8 Implementation of Hash tables 30

6.8.1 Linear Probing 30

6.8.2 Quadratic Probing 33

6.9 Tree representation and traversal algorithms 37

6.9.1 Tree traversal using DFS 37

6.9.2 Tree traversal using BFS 38

6.10 Implementation of Binary Search Trees 40

6.11 Implementation of Heaps 46

6.11.1 Max Heap 46

6.11.2 Min Heap 49

6.12 Graph representation and Traversal algorithms 52

6.12.1 Depth-First search from Adjacency List 52

6.12.2 Breadth-First search from Adjacency List 53

6.13 Implementation of single source shortest path algorithm - Dijkstra Algorithm 55

6.14 Implementation of minimum spanning tree algorithms 57

6.14.1 Kruskal's algorithm 57

6.14.2 Prim's algorithm 59
 References
1. Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, “Data Structures &

Algorithms in Python”, An Indian Adaptation, John Wiley & Sons Inc., 2021.

2. Lee, Kent D., Hubbard, Steve, “Data Structures and Algorithms with Python” Springer

Edition 2015.

3. Rance D. Necaise, “Data Structures and Algorithms Using Python”, John Wiley & Sons,

2011.

4. Aho, Hopcroft, and Ullman, “Data Structures and Algorithms”, Pearson Education, 1983.

5. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein,

“Introduction to Algorithms", Second Edition, McGraw Hill, 2002.

6. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Fourth Edition,

Pearson Education, 2014.