Table of Contents
Algorithms and Data Structures—The Science of Computing
Preface
Part I - The Science of Computing's Three Methods of Inquiry
Chapter 1 - What is the Science of Computing?
Chapter 2 - Abstraction: An Introduction to Design
Chapter 3 - Proof: An Introduction to Theory
Chapter 4 - Experimentation: An Introduction to the Scientific Method
Part II - Program Design
Chapter 5 - Conditionals
Chapter 6 - Designing with Recursion
Chapter 7 - Analysis of Recursion
Chapter 8 - Creating Correct Iterative Algorithms
Chapter 9 - Iteration and Efficiency
Chapter 10 - A Case Study in Design and Analysis: Efficient Sorting
Part III - Introduction to Data Structures
Chapter 11 - Lists
Chapter 12 - Queues and Stacks
Chapter 13 - Binary Trees
Chapter 14 - Case Studies in Design: Abstracting Indirection
Part IV - The Limits of Computer Science
Chapter 15 - Exponential Growth
Chapter 16 - Limits to Performance
Chapter 17 - The Halting Problem
Appendix A - Object-oriented Programming in Java
Appendix B - About the Web Site
Index
List of Figures
List of Tables
List of Listings, Theorems and Lemmas
List of Sidebars
具体描述
读后感
评分
评分
评分
评分
用户评价
相关图书
本站所有内容均为互联网搜索引擎提供的公开搜索信息，本站不存储任何数据与内容，任何内容与数据均与本站无关，如有需要请联系相关搜索引擎包括但不限于百度，google,bing,sogou 等
© 2025 book.quotespace.org All Rights Reserved. 小美书屋 版权所有