Data Structures, Algorithms and Applications in Java - Sartaj Sahni

Data Structures, Algorithms and Applications in Java

(Autor)

Buch | Softcover
872 Seiten
2000
McGraw-Hill Professional (Verlag)
978-0-07-116900-4 (ISBN)
54,85 inkl. MwSt
  • Titel ist leider vergriffen;
    keine Neuauflage
  • Artikel merken
Provides coverage of the fundamental data structures. This book contains applications from areas such as sorting, compression and coding, and image processing. With intuitive discussion, real-world applications, and almost 1000 examples, this book is a useful choice for a CS2 course.
Sahni's DATA STRUCTURES,ALGORITHMS, and APPLICATIONS in JAVA is designed to be used in a second course in computer science (CS2). Using Java, this book provides comprehensive coverage of the fundamental data structures, making it an excellent choice for a CS2 course. The author has made this book student-friendly through intuitive discussion, real-world, applications and a gentle introduction. Sahni is unique in providing several real-world applications for each data structure presented in the book. These applications come from such areas as Sorting, compression and coding, and image processing. These applications give students a flavor for the sorts of things they will be able to do with the data structures that they are learning. Almost 1,000 exercises in this text serve to reinforce concepts and get students applying what they are learning. Sahni's text is also accompanied by a web site containing all the programs in the book, as well as sample data, generated output, solutions to selected exercises, and enhanced discussion of selected material in the text.

1 Java Review 2 Performance Analysis of Programs 3 Asymptotic Notation 4 Performance Measurement of Programs 5 Linear Lists-Array Representation 6 Linear Lists-Linked Representation 7 Linear Lists-Simulated Pointers 8 Arrays and Matrices 9 Stacks 10 Queues 11 Skip Lists and Hashing 12 Binary and Other Trees 13 Priority Queues 14 Tournament Trees 15 Binary Search Trees 16 Balanced Search Trees 17 Graphs 18 The Greedy Method 19 Divide and Conquer 20 Dynamic Programming 21 Backtracking (ON WEBSITE) 22 Branch and Bound (ON WEBSITE)

Erscheint lt. Verlag 16.3.2000
Zusatzinfo Illustrations
Sprache englisch
Maße 191 x 241 mm
Gewicht 1505 g
Themenwelt Informatik Programmiersprachen / -werkzeuge Java
Informatik Theorie / Studium Algorithmen
Mathematik / Informatik Informatik Web / Internet
ISBN-10 0-07-116900-8 / 0071169008
ISBN-13 978-0-07-116900-4 / 9780071169004
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
mit über 150 Workouts in Java und Python

von Luigi Lo Iacono; Stephan Wiefling; Michael Schneider

Buch (2023)
Carl Hanser (Verlag)
29,99
Einführung, Ausbildung, Praxis

von Christian Ullenboom

Buch | Hardcover (2023)
Rheinwerk (Verlag)
49,90