My Account Log in

2 options

Think data structures : algorithms and information retrieval in Java / Allen B. Downey.

O'Reilly Online Learning: Academic/Public Library Edition Available online

View online

Open Textbook Library Available online

View online
Format:
Book
Author/Creator:
Downey, Allen, author.
Language:
English
Subjects (All):
Java (Computer program language).
Data structures (Computer science).
Information retrieval.
Computer algorithms.
Algorithms.
Physical Description:
1 online resource (1 volume) : illustrations
Edition:
First edition.
Place of Publication:
Sebastopol, CA : O'Reilly, [2017]
System Details:
text file
Summary:
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 Other books by Allen Downey include Think Java , Think Python , Think Stats , and Think Bayes .
Contents:
Interfaces
Analysis of algorithms
ArrayList
LinkedList
Doubly linked list
Tree traversal
Getting to philosophy
Indexer
The map interface
Hashing
HashMap
TreeMap
Binary search tree
Persistence
Crawling Wikipedia
Boolean search
Sorting.
Notes:
Includes index.
Description based on print version record.
ISBN:
9781491972311
1491972319
9781491972373
1491972378
9781491972342
1491972343
OCLC:
994223018

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account