Data Structures and Algorithms Using Python

by Subrata Saha

Overview

Efficiently using data structures to collect, organise and retrieve information is one of the core abilities modern computer engineers are expected to have. This student-friendly textbook provides a complete view of data structures and algorithms using the Python programming language, striking a balance between theory and practical application. All major algorithms have been discussed and analysed in detail, and the corresponding codes in Python have been provided. Diagrams and examples have been extensively used for better understanding. Running time complexities are also discussed for each algorithm, allowing the student to better understand how to select the appropriate one. Written with both undergraduate and graduate students in mind, the book will also be helpful with competitive examinations for engineering in India such as GATE and NET. As such, it will be a vital resource for students as well as professionals who are looking for a handbook on data structures in Python.

Product Details

ISBN-13:	9781009276979
Publisher:	Cambridge University Press
Publication date:	06/15/2023
Pages:	600
Product dimensions:	7.28(w) x 9.49(h) x 1.06(d)

About the Author

Subrata Saha is Head of the Department of Computer Applications at Techno India Hooghly, West Bengal. He has more than 20 years of teaching experience in various subjects in computer science and engineering, including data structures and algorithms, programming in C, C++ and Java, basic computation, operating systems etc. He is also the head examiner for these subjects at the Maulana Abul Kalam Azad University, West Bengal, India. Saha has been previously published by the Press in 2017 with Basic Computations and Programming with C. His areas of interest include object oriented languages, image processing and cryptography.

Table of Contents

Chapter 1. Data Structure Preliminaries; Chapter 2. Introduction to Algorithm; Chapter 3. Array; Chapter 4. Python Data Structures; Chapter 5. Strings; Chapter 6. Recursion; Chapter 7. Linked List; Chapter 8. Stack; Chapter 9. Queue; Chapter 10. Trees; Chapter 11. Heap; Chapter 12. Graph; Chapter 13. Searching and Sorting; Chapter 14. Hashing.