Wednesday, October 2, 2019

Data Structures & Problem Solving Using Java (4th Edition)

File Size: 5.83 Mb

This book is designed for a two-semester sequence in computer science, beginning with what is typically known as Data Structures and continuing with advanced data structures and algorithm analysis. It is appropriate for the courses from both the two-course and three-course sequences in “B.1 Introductory Tracks,” as outlined in the final report of the Computing Curricula 2001 project (CC2001)—a joint undertaking of the ACM and the IEEE.

The content of the Data Structures course has been evolving for some time. Although there is some general consensus concerning topic coverage, considerable disagreement still exists over the details. One uniformly accepted topic is principles of software development, most notably the concepts of encapsulation and information hiding. Algorithmically, all Data Structures courses tend to include an introduction to running-time analysis, recursion, basic sorting algorithms, and elementary data structures. Many universities offer an advanced course that covers topics in data structures, algorithms, and running-time analysis at a higher level. The material in this text has been designed for use in both levels of courses, thus eliminating the need to purchase a second textbook.

part one: Tour of Java
Chapter 1: primitive java
Chapter 2: reference types
Chapter 3: objects and classes
Chapter 4: inheritance
Part two: Algorithms and Building Blocks
Chapter 5: algorithm analysis
Chapter 6: the collections api
Chapter 7: recursion
Chapter 8: sorting algorithms
Chapter 9: randomization
Part three: Applications
Chapter 10: fun and games
Chapter 11: stacks and compilers
Chapter 12: utilities
Chapter 13: simulation
Chapter 14: graphs and paths
Part four: Implementations
Chapter 15: inner classes and implementation of ArrayList
Chapter 16: stacks and queues
Chapter 17: linked lists
Chapter 18: trees
Chapter 19: binary search trees
Chapter 20: hash tables
Chapter 21: a priority queue: the binary heap
Part five: Advanced Data Structures
Chapter 22: splay trees
Chapter 23: merging priority queues
Chapter 24: the disjoint set class
Appendix A. operators
Appendix B. graphical user interfaces
Appendix C. bitwise operators

Author Details
"mark allen weiss"
florida international university

Download Drive-1

You May Also Like These E-Books:-

No comments:

Post a Comment