410 pages · 2024
Data Structures for Engineers and Scientists Using Python
By Rakesh Nayak · Nishu Gupta
- Published
- September 18, 2024
- Imprint
- CRC Press
- Edition
- 1st Edition
- ISBN
- 9781003510758
Overview
About this book
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.
Subjects
Computer Science, Engineering & Technology
Inside the book
Table of contents
Select a chapter to read its abstract.
Chapter Chapter 1Introduction to Python
Pages: 62
After studying this chapter, the reader will be able to: Identify variables and keywords Read from the keyboard and display on the screen Understand different data types and their usage Understand different types of operators, their usage and precedence Understand different flow control statements and their usage Understand functions, their types and application Apply all the above concepts to write programs
Chapter Chapter 2Fundamentals of data structures
Pages: 24
After studying this chapter, learners will be able to: Know what data structures are Know the basic operations performed in a data type Know the difference between primitive and non-primitive data structures Know some well-known data structures Understand abstract data types
Chapter Chapter 3Arrays
Pages: 44
After studying this chapter, readers will be able to: Know about arrays Use array as an abstract data type Implement array using list Implement array using dictionary Implement array using class Define and use multidimensional arrays Apply array to manipulate polynomials Apply array to manipulate sparse matrices
Chapter Chapter 4Linked list
Pages: 52
After studying this chapter, readers will be able to: Know about linked list Implement singly linked list, doubly linked list and circular linked list Know different applications of linked list
Chapter Chapter 5Stacks
Pages: 44
After studying this chapter, readers will be able to: Understand stack and its operations Implement stack using list Implement stack using queue module Implement stack using dictionary Implement stack using class Implement stack using queue module Apply stack to match delimiter Apply stack for infix–postfix conversion Apply stack for evaluation of the postfix expression Apply stack for recursion
Chapter Chapter 6Queues
Pages: 51
After studying this chapter, readers will be able to: Understand queue and its operations Implementation of queue using list Implementation of queue using dictionary Implementation of queue using class Implementation of queue using queue module Understand circular queue Implementation of circular queue using class Understand double-ended queue Implementation of double-ended queue Understand a priority queue Implementation of priority queue using class Implementation of priority queue by importing PriorityQueue package of queue module Implementation of priority queue using heapq module
Chapter Chapter 7Trees
Pages: 63
After studying this chapter, the readers will be able to: Understand and implement a tree Perform different operations in a tree Understand binary search trees Know applications of binary search trees Understand and implement AVL trees Perform different operations on AVL trees Understand and implement splay trees Perform different operations on splay trees
Chapter Chapter 8Graphs
Pages: 34
After studying this chapter, readers will be able to: Know about graphs and the types Represent a graph Perform graph traversal Know the AND/OR graph Know the bi-connected component Understand topological sorting
Chapter Chapter 9Sorting and searching
Pages: 22
After studying this chapter, the readers will be able to: Understand different sorting algorithms Implement different sorting algorithms Understand different searching algorithms Implement different searching algorithms