Algorithm Design and Applications
- 15h 59m
- Michael T. Goodrich, Roberto Tamassia
- John Wiley & Sons (US)
- 2015
Introducing a NEW addition to our growing library of computer science titles, Algorithm Design and Applications, by Michael T. Goodrich & Roberto Tamassia! Algorithms is a course required for all computer science majors, with a strong focus on theoretical topics. Students enter the course after gaining hands-on experience with computers, and are expected to learn how algorithms can be applied to a variety of contexts. This new book integrates application with theory.
Goodrich & Tamassia believe that the best way to teach algorithmic topics is to present them in a context that is motivated from applications to uses in society, computer games, computing industry, science, engineering, and the internet. The text teaches students about designing and using algorithms, illustrating connections between topics being taught and their potential applications, increasing engagement.
In this Book
-
Algorithm Analysis
-
Basic Data Structures
-
Binary Search Trees
-
Balanced Binary Search Trees
-
Priority Queues and Heaps
-
Hash Tables
-
Union-Find Structures
-
Merge-Sort and Quick-Sort
-
Fast Sorting and Selection
-
The Greedy Method
-
Divide-and-Conquer
-
Dynamic Programming
-
Graphs and Traversals
-
Shortest Paths
-
Minimum Spanning Trees
-
Network Flow and Matching
-
NP-Completeness
-
Approximation Algorithms
-
Randomized Algorithms
-
B-Trees and External Memory
-
Multidimensional Searching
-
Computational Geometry
-
String Algorithms
-
Cryptography
-
The Fast Fourier Transform
-
Linear Programming
