• Title: Think Data Structures: Algorithms and Information Retrieval in Java
• Author(s) Allen B. Downey
• Publisher: O'Reilly Media; 1 edition (July 29, 2017)
• License(s): CC BY-NC 4.0
• Paperback: 158 pages
• eBook: HTML and PDF
• Language: English
• ISBN-10: 1491972394
• ISBN-13: 978-1491972397
• Share This:  

Book Description

Data structures and algorithms are among the most important inventions of the last 50 years, and they are fundamental tools software engineers need to know. But in the author's opinion, most of the books on these topics are too theoretical, too big, and too 'bottom up'.

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. You’ll explore the important classes in the Java collections framework (JCF), how they're implemented, and how they're expected to perform. Each chapter presents hands-on exercises supported by test code online.

• Use data structures such as lists and maps, and understand how they work
• Build an application that reads Wikipedia pages, parses the contents, and navigates the resulting data tree
• Analyze code to predict how fast it will run and how much memory it will require
• Write classes that implement the Map interface, using a hash table and binary search tree
• Build a simple web search engine with a crawler, an indexer that stores web page contents, and a retriever that returns user query results

• Allen B. Downey is an American computer scientist, Professor of Computer Science at the Franklin W. Olin College of Engineering.

• Amazon

• Algorithms and Data Structures
• Information Retrieval (IR) and Search Engines Design/Implementation
• Introduction to Java, Basic and Core Java
• Books by Allen B. Downey
• Books by O'Reilly®

• Think Data Structures: Algorithms and Information Retrieval in Java (Allen B. Downey)
• The Mirror Site (1) - HTML and PDF

• Data Structures and Algorithm Analysis in Java, 3rd Edition

  A comprehensive treatment focusing on the creation of efficient data structures and algorithms, using Java. This text explains how to select or design the data structure best suited to specific problems.

• Open Data Structures: An Introduction (Pat Morin)

  This book is an introduction to the field of data structures and algorithms, it covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs.

• Data Structures and Algorithms with OPP Design Patterns in Java

  It promotes object-oriented design using Java and illustrates the use of the latest object-oriented design patterns. Virtually all the data structures are discussed in the context of a single class hierarchy.

• Java Structures: Data Structures in Java for the Programmers

  This book attempts to provide a fresh and focused approach to the design and implementation of classic structures in a manner that meshes well with existing Java packages.

• Think Java, 2nd Edition (Allen B. Downey, et al)

  This book is a hands-on introduction to computer science and programming used by many universities and high schools around the world. Its conciseness, emphasis on vocabulary, and informal tone make it particularly appealing for readers with little or no experience.

• Data Structures and Algorithms: Reference with Examples

  A key factor of this book and its associated implementations is that all algorithms were designed by authors, using the theory of the algorithm in question as a guideline. It covers the key ideas involved in designing algorithms.

• Algorithms and Data Structures: The Basic Toolbox (Kurt Mehlhorn)

  This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. The algorithms are presented in a modern way, with explicitly formulated invariants, and comment on recent trends.

• Purely Functional Data Structures (Chris Okasaki)

  This book describes data structures from the point of view of functional languages, with examples, and presents design techniques that allow programmers to develop their own functional data structures. All source code is given in Standard ML and Haskell.