Introduction to Data Structures and Algorithms

Inbunden, Engelska, 2001

Av J.A. Storer, J. a. Storer, J a Storer

689 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Häftad

689 kr

Skickas inom 10-15 vardagar

Data structures and algorithms are presented at the college level in a way that is unique in content and presentation from current available texts. A highly a highly accessible format presents algorithms with one page displays that will appeal to both students and teachers of computer science. The thirteen chapters systematically and comprehensively cover Models of Computation, Lists, Induction and Recursion, Trees, Algorithms Design, Hashing, Heaps, Balanced Trees, Sets Over a Small Universe, Discrete Fourier Transform, Strings, Graphs, Parallel Models of Computation.

Produktinformation

Utgivningsdatum2001-11-09
Mått178 x 254 x 34 mm
Vikt1 286 g
FormatInbunden
SpråkEngelska
Antal sidor599
Upplaga2002
FörlagBirkhauser Boston Inc
ISBN9780817642532

Tillhör följande kategorier

Tillämpad matematik inom Naturvetenskap och teknik
Programmeringsböcker inom Data och it
Teknik: allmänt inom Naturvetenskap och teknik
Referensverk och tvärvetenskap inom Samhalle och politik
Databaser inom Data och it
IT-säkerhet inom Data och it

"Intended as a teaching aid for college and graduate-level courses on data structures, the material in this book has been aligned to support the lecture style. All the algorithms in the book are provided in pseudocode, so that students can implement the algorithms in a programming language of their choice. The book addresses basic as well as advanced algorithms in data structures, with introductory but adequate material about parallel computing models also provided... At the end of each chapter, there are sample exercises with solutions that help students to test their understanding of the book. There are also unsolved exercises that can be of use to instructors for course assignments... Each chapter also includes notes at the end, providing a good summary of the topics covered, which is very useful for students taking the course. The author has done a commendable job in outlining various algorithms for a problem, and also in comparing their merits... [The] approach of the book is easy to understand for students with a strong mathematical background." -ACM Computing Reviews