Data Structures for Engineers and Scientists Using Python

The text covers the fundamentals of Python programming and the implementation of data structures using Python programming with the help of worked-out examples. It provides a learning tool for engineers as well as for researchers and scientists of advanced levels. The text further discusses important concepts such as polynomial manipulation, sparse matrices, implementation of stack using the queue model and topological sorting. 1 Introduction to Python 1.1 Variables, identifiers and keywords 1.2 Input and output 1.3 Indentation 1.4 Comment statement 1.5 Standard data types 1.6 Operators 1.7 Flow control statements 1.8 Functions 1.9 Classes and objects 1.10 Variables and methods 1.11 Public, private and protected variables 1.12 Methods 1.13 Class inside a class (inner class) True–false questions Fill-in-the-blank questions Multiple-choice questions Descriptive questions Answers to true–false questions Answers to fill-in-the-blank questions Answers to multiple-choice questions 2 Fundamentals of data structures 2.1 Introduction 2.2 Classification of data structures 2.3 Descriptions of various data structures 2.4 Abstract data types (ADTs) 2.5 Algorithms True–false questions Fill-in-the-blank questions Multiple-choice questions Descriptive questions Answers to true–false questions Answers to fill-in-the-blank questions Answers to multiple-choice questions 3 Arrays 3.1 Introduction 3.2 Multidimensional arrays 3.3 Applications True–false questions Fill-in-the-blank questions Multiple-choice questions Descriptive questions Answers to true–false questions Answers to fill-in-the-blank questions Answers to multiple-choice questions 4 Linked list 4.1 Singly linked lists 4.2 Doubly linked lists 4.3 Circular linked lists True–false questions Fill-in-the-blank questions Multiple-choice questions Descriptive questions Answers to true–false questions Answers to fill-in-the-blank questions Answers to multiple-choice questions 5 Stacks 5.1 Stacks 5.2 Stack operations 5.3 Stack (ADT) 5.4 Implementation 5.5 Applications of stack True–false questions Fill-in-the-blank questions Multiple-choice questions Descriptive questions Answers to true–false questions Answers to fill-in-the-blank questions Answers to multiple-choice questions 6 Queues 6.1 Queue 6.2 Queue operations 6.3 Queue (ADT) 6.4 Implementation 6.5 Circular queue 6.6 Double-ended queue 6.7 Priority queue True–false questions Fill-in-the-blank questions Multiple-choice questions Descriptive questions Answers to true–false questions Answers to fill-in-the-blank questions Answers to multiple-choice questions 7 Trees 7.1 Trees 7.2 Binary trees 7.3 Types of binary trees 7.4 Representation 7.5 Operations in a binary tree 7.6 Binary search trees 7.7 AVL trees (height-balanced trees) 7.8 Splay trees True–false questions Fill-in-the-blank questions Multiple-choice questions Descriptive questions Answers to true–false questions Answers to fill-in-the-blank questions Answers to multiple-choice questions 8 Graphs 8.1 Introduction 8.2 Graph representation 8.3 Traversals 8.4 AND/OR graphs 8.5 Bi-connected components 8.6 Shortest-path problem 8.7 Topological sorting True–false questions Fill-in-the-blank questions Multiple-choice questions Descriptive questions Answers to true–false questions Answers to fill-in-the-blank questions Answers to multiple-choice questions 9 Sorting and searching 9.1 Introduction to sorting 9.2 Introduction to searching True–false questions Fill-in-the-blank questions Multiple-choice questions Descriptive questions Answers to true–false questions Answers to fill-in-the-blank questions Answers to multiple-choice questions Index The text covers the fundamentals of Python programming and the implementation of data structures using Python programming with the help of worked-out examples. It provides a learning tool for engineers as well as for researchers and scientists of advanced level. The text further discusses important concepts such as polynomial manipulation, sparse matrices, implementation of stack using the queue model and topological sorting.This book: Discusses the implementation of various data structures such as an array, stack, queue, tree and graph along with sorting and searching algorithms. Includes programming tips to highlight important concepts and help readers avoid common programming errors. Presents each concept of data structure with a different approach and implements the same using Python programming. Offers rich chapter-end pedagogy including objective-type questions (with answers), review questions and programming exercises to facilitate review. Covers fundamentals of Python up to object-oriented concepts including regular expression. It is primarily written for senior undergraduate, graduate students and academic researchers in the fields of electrical engineering, electronics and communication engineering, computer engineering and information technology.