Data Structures with Java

International Edition

William H. Ford, William R. Topp (Autoren)

Buch | Softcover

1024 Seiten

2005
Pearson (Verlag)
978-0-13-129337-3 (ISBN)

Titel ist leider vergriffen;
keine Neuauflage

Artikel merken

For freshman-, sophomore-, or junior-level courses in Computer Science, Data Structures, and Algorithms in the departments of Computer Science, Computer Engineering, Computer Information Systems, and Business Information Systems.

This modern object-oriented approach to data structures helps students make the transition from a first course in programming to an integrated understanding of data structures and their applications. Carefully developing topics with sufficient detail, this text enables students to learn about concepts on their own, offering instructors flexibility and allowing them to use the text as lecture reinforcement. It includes a solid introduction to algorithms, an integral part of understanding data structures, and uses Java syntax and structure in the design of data structures. Its breadth of coverage insures that core topics such as linked lists, sets, maps, and iterators are carefully and comprehensively discussed.

Professor William Ford and Professor William Topp are faculty members with the Computer Science Department, University of the Pacific, Stockton, California. They have also written Introduction to Computing with C++ and Object Technology (Prentice Hall, 1999) and Assembly Language and Systems Programming for the M68000 Family (Jones and Bartlett, 1992).

1.    Classes and Objects

2.    Class Relationships

3.    Designing Classes

4.    Introduction to Algorithms

5.    Generic Classes and Methods

6.    Recursion

7.    Sorting Algorithms

8.    Collections and Lists

9.    The Array-Based List Collection

10.   Linked Lists

11.   Implementing the LinkedList Class

12.   Iterators

13.   Implementing Iterators

14.   Stacks

15.   Queues and Priority Queues

16.   Binary Trees

17.   Binary Tree Applications

18.   Binary Search Trees

19.   Sets and Maps

20.   Ordered Set and Map Implementation

21.   Hashing as a Map Implementation

22.   Heaps

23.   Bit Arrays and File Compression

24.   Graphs and Paths

25.   Graph Algorithms

26.   Graph Implementation

27.   Balanced Search Trees

28.   Number Theory and Cryptography

29.   Assorted Algorithms

Appendix A: Java Keywords.

Appendix B: ASCII and Unicode Character Sets.

Appendix C: Java Operator Summary.

Appendix D: EZJava Tutorial.

Erscheint lt. Verlag	27.1.2005
Sprache	englisch
Maße	188 x 230 mm
Gewicht	1500 g
Themenwelt	Informatik ► Programmiersprachen / -werkzeuge ► Java
	Informatik ► Theorie / Studium ► Algorithmen
	Mathematik / Informatik ► Informatik ► Web / Internet
ISBN-10	0-13-129337-0 / 0131293370
ISBN-13	978-0-13-129337-3 / 9780131293373
Zustand	Neuware