If you’re a student studying computer science or a software developer preparing for technical interviews, this practical book helps you learn and review 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. You’ll explore the important classes in the Java collections framework (JCF), how they’re are implemented, and how they are expected to perform.
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.
- Learn good software engineering practices and modern data structures
- Get an engaging case study—the design and implementation of a simple web search engine
- Practice software engineering skills by working on a series of engaging exercises in each chapter
Table of Contents
Chapter 1. Interfaces Chapter 2. Analysis of Algorithms Chapter 3. ArrayList Chapter 4. LinkedList Chapter 5. Doubly-linked list Chapter 6. Tree traversal Chapter 7. Getting to Philosophy Chapter 8. Indexer Chapter 9. The Map interface Chapter 10. Hashing Chapter 11. HashMap Chapter 12. TreeMap Chapter 13. Binary search tree Chapter 14. Persistence Chapter 15. Crawling Wikipedia Chapter 16. Boolean search Chapter 17. Sorting
Title: Think Data Structures: Algorithms and Information Retrieval in Java Author: Allen B. Downey Length: 155 pages Edition: 1 Language: English Publisher: O'Reilly Media Publication Date: 2017-08-04 ISBN-10: 1491972394 ISBN-13: 9781491972397
Book Download How to Download?
|Free Download Link||Format||Size (MB)|
|Click to download||PDF (Early Release)||2|