Data Structures and Problem Solving Using Java

AvMark Weiss

Häftad, Engelska, 2010

3 533 kr

Beställningsvara. Skickas inom 3-6 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Häftad

1 200 kr

Beskrivning

Data Structures and Problem Solving Using Java takes a practical and unique approach to data structures that separates interface from implementation. It is suitable for the second or third programming course.

This book provides a practical introduction to data structures with an emphasis on abstract thinking and problem solving, as well as the use of Java. It does this through what remains a unique approach that clearly separates each data structure’s interface (how to use a data structure) from its implementation (how to actually program that structure). Parts I (Tour of Java), II (Algorithms and Building Blocks), and III (Applications) lay the groundwork by discussing basic concepts and tools and providing some practical examples, while Part IV (Implementations) focuses on implementation of data structures. This forces the reader to think about the functionality of the data structures before the hash table is implemented.

The Fourth Edition features many new updates as well as new exercises.

Produktinformation

Utgivningsdatum:2010-01-19
Mått:10 x 10 x 10 mm
Vikt:1 480 g
Format:Häftad
Språk:Engelska
Antal sidor:1 032
Upplaga:4
Förlag:Pearson Education
ISBN:9780321541406

Utforska kategorier

Programspråk inom Data och IT

Mer om författaren

Mark Allen Weiss is a Professor in the School of Computing and Information Sciences at Florida International University in Miami Florida. He received his Bachelor's Degree in Electrical Engineering from The Cooper Union in 1983, and his Ph.D. in Computer Science from Princeton University in 1987, working under Bob Sedgewick. He has been at FIU since 1987, and was promoted to Professor in 1996. His interests include data structures, algorithms, and education, and he is most well-known for his highly-acclaimed Data Structures textbooks, which have been used at hundreds of universities worldwide.

Innehållsförteckning

PART ONE: TOUR OF JAVAChapter 1: Primitive JavaChapter 2: Reference TypesChapter 3: Objects and ClassesChapter 4: InheritancePART TWO: ALGORITHMS AND BUILDING BLOCKSChapter 5: Algorithm AnalysisChapter 6: The Collections APIChapter 7: RecursionChapter 8: Sorting AlgorithmsChapter 9: RandomizationPART THREE: APPLICATIONSChapter 10: Fun and GamesChapter 11: Stacks and CompilersChapter 12: UtilitiesChapter 13: SimulationChapter 14: Graphs and PathsPART FOUR: IMPLEMENTATIONSChapter 15: Inner Classes and Implementation of ArrayListChapter 16: Stacks and QueuesChapter 17: Linked ListsChapter 18: TreesChapter 19: Binary Search TreesChapter 20: Hash TablesChapter 21: A Priority Queue: The Binary HeapPART FIVE: ADVANCED DATA STRUCTURESChapter 22: Splay TreesChapter 23: Merging Priority QueuesChapter 24: The Disjoint Set ClassAPPENDIX A: OperatorsAPPENDIX B: Graphical User InterfacesAPPENDIX C: Bitwise Operators