Think Data Structures: Algorithms and Information Retrieval in Java (Paperback)

Allen B. Downey

Think Data Structures: Algorithms and Information Retrieval in Java (Paperback)

買這商品的人也買了...

相關主題

商品描述

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.

商品描述(中文翻譯)

如果你是一位學習計算機科學或準備技術面試的軟體開發者，這本實用的書籍將幫助你學習和複習軟體工程中最重要的概念之一——資料結構和演算法。相較於其他資料，這本書以更清晰、更簡潔和更引人入勝的方式強調實用知識和技能。

作者 Allen Downey 著重於實用知識和技能，向你展示如何使用資料結構來實現高效的演算法，並分析和測量其性能。你將探索 Java 集合框架 (JCF) 中的重要類別，了解它們的實現方式以及預期的性能。每個章節都提供了在線支援的實作練習和測試代碼。

本書的內容包括：
- 使用列表和映射等資料結構，並了解它們的工作原理
- 構建一個讀取維基百科頁面、解析內容並導航結果數據樹的應用程式
- 分析代碼以預測其運行速度和所需的記憶體
- 編寫實現 Map 接口的類別，使用哈希表和二叉搜索樹
- 構建一個簡單的網頁搜索引擎，包括爬蟲、存儲網頁內容的索引器和返回用戶查詢結果的檢索器

Allen Downey 的其他著作包括《Think Java》、《Think Python》、《Think Stats》和《Think Bayes》。

類似商品