Data Structures and Algorithms with Python
 |
Description
Book Introduction
Learn data structures and algorithms all at once with Python!
Most books on data structures and algorithms are written for majors, so they can be difficult to understand if you're new to coding or unfamiliar with coding terminology.
This book was written by an author who teaches computer engineering and has extensive teaching experience, using illustrations and easy-to-understand explanations so that anyone, including non-majors, can easily understand it.
Not only can you learn various data structures and algorithms, but you can also develop computational thinking skills, that is, problem-solving skills and logical thinking skills.
Most books on data structures and algorithms are written for majors, so they can be difficult to understand if you're new to coding or unfamiliar with coding terminology.
This book was written by an author who teaches computer engineering and has extensive teaching experience, using illustrations and easy-to-understand explanations so that anyone, including non-majors, can easily understand it.
Not only can you learn various data structures and algorithms, but you can also develop computational thinking skills, that is, problem-solving skills and logical thinking skills.
- You can preview some of the book's contents.
Preview
index
preface
Set goals before studying
PART 1 Data Structures
Chapter 01 Stack
01-1 What is a stack?
01-2 Implementing a stack with an array structure
01-3 Stack Application: Parentheses Checking
01-4 Using Stacks in Python
01-5 System Stack and Circular Calls
Practice problems
Chapter 02 Queue
02-1 What is Qran?
02-2 Queue implemented as an array
02-3 What is a deck?
02-4 Implementation of a deck using inheritance
02-5 Using Queues and Decks in Python
Practice problems
Chapter 03 List
03-1 What is a list?
03-2 Structure linked to array structure
03-3 List of Array Structures: Python Lists
03-4 Structure and types of linked lists
03-5 Implementing a list with a simple connection structure
03-6 Implementing a list with a doubly linked structure
Practice problems
Chapter 04 Tree
04-1 What is a tree?
04-2 Binary Tree
04-3 Binary tree operations
04-4 Morse Code Decision Tree
04-5 Formula Tree
Practice problems
PART 2 ALGORITHM
Chapter 05 Algorithm Overview
05-1 What is an algorithm?
05-2 Performance Analysis of the Algorithm
Practice problems
Chapter 06 Sorting
06-1 What is alignment?
06-2 Selection Sort
06-3 Insertion sort
06-4 Quick sort
06-5 Rider Alignment
06-6 Using Python's sorting functions
Practice problems
Chapter 07 Exploration
07-1 What is navigation?
07-2 Sequential Search
07-3 Binary Search
07-4 Binary Search Tree
Practice problems
Chapter 08 Graph
08-1 What is a graph?
08-2 Graph Representation
08-3 Graph Traversal
08-4 Kidney Tree
08-5 Minimum cost spanning tree
Practice problems
PART 3 Algorithm Design Strategies
Chapter 09 Forced Techniques and Greedy Strategies
09-1 Problem Solving Process
09-2 Forced Technique
09-3 Greedy Technique
Practice problems
Chapter 10 Divide and Conquer
What is 10-1 Divide and Conquer?
Finding the power of 10-2
10-3 Selection Problem: Find the kth smallest number
10-4 Merge Sort
10-5 Fibonacci Sequence and Divide and Conquer Precautions
Practice problems
Chapter 11 Dynamic Programming
11-1 What is dynamic programming?
11-2 Longest common subsequence
11-3 Filling the backpack
Practice problems
Chapter 12: Time-Walking and Backtracking in Space
Can you buy time in space 12-1?
12-2 Hashing
12-3 Backtracking
Practice problems
Quiz Answers
Set goals before studying
PART 1 Data Structures
Chapter 01 Stack
01-1 What is a stack?
01-2 Implementing a stack with an array structure
01-3 Stack Application: Parentheses Checking
01-4 Using Stacks in Python
01-5 System Stack and Circular Calls
Practice problems
Chapter 02 Queue
02-1 What is Qran?
02-2 Queue implemented as an array
02-3 What is a deck?
02-4 Implementation of a deck using inheritance
02-5 Using Queues and Decks in Python
Practice problems
Chapter 03 List
03-1 What is a list?
03-2 Structure linked to array structure
03-3 List of Array Structures: Python Lists
03-4 Structure and types of linked lists
03-5 Implementing a list with a simple connection structure
03-6 Implementing a list with a doubly linked structure
Practice problems
Chapter 04 Tree
04-1 What is a tree?
04-2 Binary Tree
04-3 Binary tree operations
04-4 Morse Code Decision Tree
04-5 Formula Tree
Practice problems
PART 2 ALGORITHM
Chapter 05 Algorithm Overview
05-1 What is an algorithm?
05-2 Performance Analysis of the Algorithm
Practice problems
Chapter 06 Sorting
06-1 What is alignment?
06-2 Selection Sort
06-3 Insertion sort
06-4 Quick sort
06-5 Rider Alignment
06-6 Using Python's sorting functions
Practice problems
Chapter 07 Exploration
07-1 What is navigation?
07-2 Sequential Search
07-3 Binary Search
07-4 Binary Search Tree
Practice problems
Chapter 08 Graph
08-1 What is a graph?
08-2 Graph Representation
08-3 Graph Traversal
08-4 Kidney Tree
08-5 Minimum cost spanning tree
Practice problems
PART 3 Algorithm Design Strategies
Chapter 09 Forced Techniques and Greedy Strategies
09-1 Problem Solving Process
09-2 Forced Technique
09-3 Greedy Technique
Practice problems
Chapter 10 Divide and Conquer
What is 10-1 Divide and Conquer?
Finding the power of 10-2
10-3 Selection Problem: Find the kth smallest number
10-4 Merge Sort
10-5 Fibonacci Sequence and Divide and Conquer Precautions
Practice problems
Chapter 11 Dynamic Programming
11-1 What is dynamic programming?
11-2 Longest common subsequence
11-3 Filling the backpack
Practice problems
Chapter 12: Time-Walking and Backtracking in Space
Can you buy time in space 12-1?
12-2 Hashing
12-3 Backtracking
Practice problems
Quiz Answers
Detailed image
.jpg)
Publisher's Review
Knowledge that I thought I knew
If you can't use it, you don't know it!
This book focuses on making studying data structures and algorithms easier and more fun, and applying them to solve a variety of problems.
In addition, it thoroughly introduces the operating principles of data structures through pictures and how to express and process them efficiently through examples.
In addition, difficult content is explained easily through pictures, and detailed code is explained so that you do not have to be afraid of detailed explanations and practical applications, as if you were listening to a lecture on site.
If you can't use it, you don't know it!
This book focuses on making studying data structures and algorithms easier and more fun, and applying them to solve a variety of problems.
In addition, it thoroughly introduces the operating principles of data structures through pictures and how to express and process them efficiently through examples.
In addition, difficult content is explained easily through pictures, and detailed code is explained so that you do not have to be afraid of detailed explanations and practical applications, as if you were listening to a lecture on site.
GOODS SPECIFICS
- Date of issue: November 20, 2023
- Page count, weight, size: 376 pages | 772g | 188*257*17mm
- ISBN13: 9791192932330
- ISBN10: 1192932331
You may also like
카테고리
korean
korean
![GQ KOREA Mark (Monthly): December [2025]](http://librairie.coreenne.fr/cdn/shop/files/8ef265dbbfbf186523ed75ba7319009d.jpg?v=1765340328&width=3840)
