Data Structures and Algorithm Analysis in Java Buch als PDF-Download

Mark Allen Weiss ist ein Distinguished University Professor of Computer Science und Associate Dean for Undergraduate Education am College of Engineering and Computing der Florida International University in Miami, Florida. Er war auch Gründungsdirektor der School of Universal Computing, Construction, and Engineering EDucation (SUCCEED), nachdem er zuvor neun Jahre lang stellvertretender Direktor der School of Computing and Information Sciences war.
Er erhielt 1983 seinen Bachelor-Abschluss in Elektrotechnik von der Cooper Union und seinen Ph.D. in Informatik von der Princeton University im Jahr 1987, wo er bei Bob Sedgewick arbeitete. Er ist seit 1987 an der FIU und wurde 1996 zum Professor befördert. Seine Interessen umfassen Datenstrukturen, Algorithmen und Bildung, und er ist am bekanntesten für seine hochgelobten Lehrbücher zu Datenstrukturen, die er allein verfasst hat in der Informatik am weitesten verbreitet. Von 1997 bis 2004 war er Mitglied des Advanced Placement Computer Science Development Committee und leitete das Komitee von 2000 bis 2004. Dr. Weiss ist IEEE Fellow, AAAS Fellow und ACM Distinguished Educator. Er erhielt 2015 den SIGCSE Award for Outstanding Contribution to Computer Science Education, 2017 den Taylor Booth Education Award der IEEE Computer Society, 2018 den William Sayle Achievement in Education Award der IEEE Education Society und 2021 den ACM Karl V. Karlstrom Outstanding Educator Award .

Data Structures and Algorithm Analysis in Java Buch pdf lesen und herunterladen von Mark Allen Weiss

Data Structures and Algorithm Analysis in Java is an “advanced algorithms” book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math.   As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java.   Weiss clearly explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss’ careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code complement the text’s coverage.