扫一扫下载手机客户端
扫描我，关注团购信息，享更多优惠
||网络安全
| | | | | | | | | | | | | | | |
||电子电工
汽车交通| | | | | | | | | |
||投资理财
| | | | | | | | | | | | | | | | |
| | | | | | |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | |
||外语考试
| | | | | | | | |
| 视频教程|
数据结构：Java语言描述（英文影印版?第3版）
定价：￥79.00
校园优惠价：￥55.30 (70折)
促销活动：
商品已成功飞到您的手机啦！快登录手机站看看吧！
下载客户端
> 微信关注“互动出版网”，便捷查询订单，更多惊喜天天有
原书名：Data Structures and Other Objects Using Java (3rd Edition)
原出版社：
ISBN：上架时间：出版日期：2006 年8月开本：16开页码：806版次：3-1
所属分类：
本书系统地讲述了各种常用的数据结构，对基本概念、基本原理和基本方法进行了深入浅出的介绍，同时对相关的算法设计也进行了详细的讲解。本书的一大特点就是采用非常流行的面向对象程序设计语言Java作为算法描述语言，将传统的数据结构与面向对象技术完美结合，更加自然贴切，易于理解。 .
本书第3版结合Java 5.0进行了改进，增加了一些新内容，包括：泛型和枚举数据类型，数组、集合以及枚举类型中使用的for循环的新形式，用于原始值与封装器之间转换的autoboxing和unboxing，带有可变参数的方法，输入/输出特性，Java子类型和协变返回值。 ...
Michael Main
于华盛顿州立大学获得博士学位，目前为科罗拦多大学计算机科学系副教授。...
CHAPTER 1 The Phases of Software Development
1.1 Specification, Design, Implementation
1.2 Running Time Analysis.
1.3 Testing and Debugging
Chapter Summary and Solutions
CHAPTER 2 Java Classes and Information Hiding
2.1 Classes and Their Members
2.2 Using a Class
2.3 Packages
2.4 Parameters, Equals Methods, and Clones
Chapter Summary, Solutions and Projects
CHAPTER 3 Collection Classes
3.1 A Review of Java Arrays
3.2 An ADT for a Bag of Integers
3.3 Programming Project: The Sequence ADT
3.4 Programming Project: The Polynomial
Chapter Summary, Solutions and Projects
CHAPTER 4 Linked Lists
4.1 Fundamentals of Linked Lists
4.2 Methods for Manipulating Nodes
　　Java provides programmers with an immediately attractive forum. With Java and the World Wide Web, a programmer's work can have quick global distribution with appealing graphics and a marvelous capability for feedback, modification, software reuse, and growth. Certainly, Java's other qualities have also contributed to its rapid adoption: the capability to implement clean, object- the familiarity of Java's
the good collection of ready-to-use features in the Java Class Libraries. But it's the winsome ways of the World Wide Web that have pulled Java to the front for both experienced programmers and the newcomer entering a first-year computer science course. .
　　With that said, it's satisfying to see that the core of the first-year courses remain solid even as courses start using Java. The proven methods of representing and using data structures remain vital to beginning programmers in a data structures course, even as the curriculum is shifting to accommodate an object-oriented approach.
　　This book is written for just such an evolving data structures course, with the students' programming carried out in Java. The text's emphasis is on the specification, design, implementation, and use of the basic data types that are normally covered in a second-semester, object-oriented course. Ihere is wide coverage of important programming techniques in recursion, searching techniques, and sorting. Ihe text also provides coverage of big-O time analysis of algorithms, an optional appendix on writing an interactive applet to test an implementation of a data structure, and using Javadoc to specify precondition-postcondition contracts.
　　The text assumes that the student has already had an introductory computer science and programming class, but we do include coverage of those topics (such as the Java Obi eot type and a precise description of parameter passing) that are not always covered completely in a first course. The rest of this preface discusses ways that this material can be covered, starting with new material for this third edition.
　　Third Edition: J2SE 5.0
　　The new material in this edition is primarily from Sun Microsystems latest release of the Java 2 Standard Edition 5.0 (J2SE 5.0). Many of the features in this release provide support for data structures concepts that were previously dealt with in an ad hoc manner. In particular, this edition of the book incorporates the following features at points where their motivation is natural:
　　True Generics (introduced in Chapter 5). The largest change in J2SE 5.0 is the support for generic methods and generic classes that depend on an unspecified underlying data type. We use generics, for example, in building a class for a collection of E objects, where the type E is left unspecified. Generics are introduced in Chapter 5, which is the location where we previously implemented a simple form of generics that used Java's Obi ect class as the type of the elements. This occurs after the students have already seen two fundamental collection implementations that use an array or linked list of a specific type of element. By first showing these fundamental implementations without generics, the students learn important concepts such as building clones and manipulating linked lists without the distraction of secondary issues. After Chapter 5, generic classes are incorporated into the material in a straightforward manner.
　　It's interesting to note that the runtime implementation of generics in J2SE 5.0 uses the Java Object type for elements in the same way as the generic classes that programmers built before J2SE 5.0. The difference is that the extra syntax of Java generics allows new compile-time type checks to prevent the unintended mixing of types (such as inserting a string into a collection of integers).
　　Input/Output (introduced in Chapter 1 and Appendix B). Formatted output (with the System. out. pti ntf method) and the input of primitive values (with the java. util. Scanner class) has been incorporated throughout the text. Our earlier input and output classes (EasyReader and FormatWriter) are still available online at www. cs. col orado, edu/～mai n/edu/col o rado/i o.
　　Variable Arity Methods (introduced on page 112 in Chapter 3). In J2SE 5.0, a method may have a variable number of arguments. The idea is shown in Chapter 3, though it doesn't play a large role in data structures.
　　Enhanced For-Loops (introduced on page 108 in Chapter 3 and page 286 in Chapter 5). J2SE 5.0 introduced a new form of the for-loop that allows the easy iteration through the elements of an array, a collection of elements that has implemented the Iterable interface, or the elements of an enum type. We use the new form throughout the text whenever it is appropriate.
　　Antoboxing and Auto-Unboxing of Primitve Values (introduced on page 247 of Chapter 5). Autoboxing allows the automatic conversion of a primitive value (such as an J nt) to a Java object (such as the Integer class). Auto-unboxing converts from the object back to the primitive value in most situations. At run time, the typecasts still occur, though the syntax of the program is cleaner.
　　Covariant Return Types (covered on page 656 in Chapter 13). J2SE 5.0 allows covariant return types, which means that the return type of an overridden inherited method may now be any descendant class of the original return type. We use this idea for clone methods throughout the text, thereby avoiding a typecast with each use of a clone method and increasing type security. The larger use of the technique is postponed until the chapter on Inheritance.
　　Enum Types (covered on page 687 in Chapter 13). Enum types provide a convenient way to define a new data type whose objects may take on a small set of discrete values.
　　Outside of these new language features, the third edition of this text presents the same foundational data structures material as the earlier editions. In particular, the data structures curriculum emphasizes the ability to specify, design, and analyze data structures independently of any particular language, as well as the ability to implement new data structures and use existing data structures in any modem language. You'll see this approach in the first four chapters as students review Java and then go on to study and implement the most fundamental data structures (bags and sequence classes) using both arrays and linked-list techniques that are easily applied to any high-level language.
　　Chapter 5 is a bit of a departure, bringing forward several Java-specific techniques that are particularly relevant to data structures: how to build generic collection classes based on Java's new generic types, using Java interfaces and the API classes, and building and using Java iterators. Although much of the subsequent material can be taught without these Java features, this is a natural time for students to learn them.
　　Later chapters focus on particular data structures (stacks, queues, trees, hash tables, graphs) or programming techniques (recursion, sorting techniques, inheritance). The introduction of recursion is delayed until just before the study of trees. This allows us to introduce recursion with some simple but meaningful examples that do more than just tail recursion. This avoids the mistaken first view that some students get that recursion is some kind of magic loop. After the first simple examples (including one new example for this edition), students see significant examples involving two recursive calls involving common situations with binary trees.
　　Trees are particularly emphasized in this text, with Chapter 10 taking the students through two meaningful examples of data structures that use balanced trees (the heap project and the B-tree project). Additional projects for trees and other areas have also been added online at http://www. aw. com/cssupport.
　　Other new Java features have been carried over from the second edition of the text as needed: the use of assertions to check preconditions, a more complete coverage of inheritance, a new example of an abstract class to build classes that play two-play strategy games such as Othello or Connect Four, an introduction to new classes of the Java APl (now in the generic form of ArrayLi st, Vector, HashMap and Hashlable), and new features of Javadoc.
　　All these new bells and whistles of Java are convenient, and students need to be up-to-date--but it's the approaches to designing, specifying, documenting, implementing, using, and analyzing the data structures that will have the most enduring effect on your students.
系列图书推荐 ￥99.00￥69.30
同类热销商品￥108.00￥86.40
订单处理配送
北京奥维博世图书发行有限公司 china-pub,All Rights Reserved新东方新概念英语网络课程
大学英语教材听力
可可背单词
可可英语官方微信(微信号:ikekenet)
每天向大家推送短小精悍的英语学习资料.
添加方式1.扫描上方可可官方微信二维码。
添加方式2.搜索微信号ikekenet添加即可。Subscribe to The Stream
Get updates with all the important daily news delivered to your e-mail inbox.
Bob Hartman
Bob Hartman, who has pastored churches in Pittsburgh and in England, is now a full-time writer and Bible story teller. An internationally-known story-teller and speaker, he has lead programs at Spring Harvest Christian festival in England and the Edinburgh International Book Festival, as well as taught Bible storytelling throughout Europe, the Middle East and Asia. He is is the author of many books, including The Lion Storyteller Bible and The Wolf Who Cried Boy.
More by Bob Hartman
Several weeks ago, a Facebook friend posted a comment about the use of the word “libtard.” She rightly said we shouldn’t call names, even in a passionate political debate — particularly names that denigrate certain groups. She went on to…
Connect with Us