|
|
|
|
Sams Teach Yourself Data Structures and Algorithms in 24 Hours presents data structures and algorithms in an easy-to-read, easy-to-understand style, allowing you to grasp the concepts quickly and apply the knowledge to your programs. The very popular C++ programming language is used for examples and code samples. |
|
|
|
|
With a dynamic learn-by-doing focus, this laboratory manual encourages students to explore data structures by implementing them, a process through which students discover how data structures work and how they can be applied. Providing a framework that offers feedback and support, this text challenges students to exercise their creativity in both programming and analysis. Each laboratory unit consists of four parts: the Prelab, the Bridge, the In-lab, and the Postlab, which create an excellent ha... |
|
|
|
|
Approximation algorithms are currently a central and fast-developing area of research in theoretical computer science. This monograph covers the basic techniques used in the latest research work, techniques that everyone in the field should know, and shows that they form the beginnings of a promising theory. The author consolidates progress made so far, including some very recent results, and makes a strong effort to convey the beauty and excitement of work in the field. |
|
|
|
|
Packed with detailed explanations and instructive examples, the book begins by offering you some fundamental data structures and then goes on to explain various sorting algorithms. You'll then learn efficient practices for storing and searching by way of hashing, trees, sets, and maps. The authors also share tips on optimization techniques and ways to avoid common performance pitfalls. In the end, you'll be prepared to build the algorithms and data structures most commonly encountered in day-to-... |
|
|
|
|
Algorithms and Networking for Computer Games provides a comprehensive resource that offers deeper algorithmic insight into game programming and explains game-specific network considerations. Read on for…
*Algorithmic solutions in pseudo code format, which not only emphasizes the idea behind the solution, but also can easily be written into the programming language of your choice.
*A section on the Synthetic player, covering decision-making, influence maps, finite-state machines,... |
|
|
|
|
While many computer science textbooks are confined to teaching programming code and languages, Algorithms and Data Structures: The Science of Computing takes a step back to introduce and explore algorithms -- the content of the code. Focusing on three core topics: design (the architecture of algorithms), theory (mathematical modeling and analysis), and the scientific method (experimental confirmation of theoretical results), the book helps students see that computer science is about problem solv... |
|
|
|
|
Fundamentals of OOP and Data Structures in Java presents the fundamentals of Object-Oriented Programming (OOP) and Graphical User Interface (GUI) programming with Java as the example language. Wiener and Pinson introduce each of the major data structures with supporting, GUI-based laboratory programs designed to reinforce the basic concepts and principles. These laboratories allow the reader to explore and experiment with the properties of each data structure. All source code for the laboratorie... |
|
|
|
|
Whether you are an entry-level or seasoned designer or programmer, learn all about data structures in this easy-to-understand, self-teaching guide that can be directly applied to any programming language.
|
|
|
|
|
Algorithms in Java, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1-4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. The... |
|
|
| |
|
| | |
|
|
This edition of Robert Sedgewick's popular work provides current and comprehensive coverage of important algorithms for Java programmers. Michael Schidlowsky and Sedgewick have developed new Java implementations that both express the methods in a concise and direct manner and provide programmers with the practical means to test them on real applications.
Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new te... |
|
|
| | | 1 2 | | |
|
|