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.

• 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

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.

• 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