Think Data Structures: Algorithms and Information Retrieval in Java
| Author | : | |
| Rating | : | 4.16 (858 Votes) |
| Asin | : | 1491972394 |
| Format Type | : | paperback |
| Number of Pages | : | 158 Pages |
| Publish Date | : | 2016-12-03 |
| Language | : | English |
DESCRIPTION:
Berkeley and Master’s and Bachelor’s degrees from MIT.. in Computer Science from U.C. Downey is a Professor of Computer Science at Olin College of Engineering. About the AuthorAllen B. He has a Ph.D. He has taught at Wellesley College, Colby College, and U.C. Berkeley
Downey is a Professor of Computer Science at Olin College of Engineering. He has a Ph.D. He has taught at Wellesley College, Colby College, and U.C. in Computer Science from U.C. Berkeley. Allen B. Berkeley and Master’s and Bachelor’s degrees from MIT.
Each chapter presents hands-on exercises supported by test code online.Use data structures such as lists and maps, and understand how they workBuild an application that reads Wikipedia pages, parses the contents, and navigates the resulting data treeAnalyze code to predict how fast it will run and how much memory it will requireWrite classes that implement the Map interface, using a hash table and binary search treeBuild a simple web search engine with a crawler, an indexer that stores web page contents, and a retriever that returns user query resultsOther books by Allen Downey include Think Java, Think Python, Think Stats, and Think Bayes.. You’ll explore the important classes in the Java collections framework (JCF), how they’re implemented, and how they’re expected to perform. If you’re a student studying computer science or a software developer preparing for technical interviews, this practical book will help you learn and review some of the most important ideas in software engineering—data structures and algorithms—in a way that’s clearer, more concise, and more engaging than other materials.By emphasizing practical knowledge and skills over theory, author Allen Downey shows you how to use data structures to implement efficient algorithms, and then analyze and measure their performance