Data structures and algorithm analysis in C / Mark Allen Weiss.
Material type:
TextPublication details: Redwood City, California : The Benjamin/Cummings Publishing Company, Inc., c1993Description: xvii, 455 pages : illustrations ; 21 cmISBN: - 9780201455731
- QA 76.73.C15 .W45 1993
Books
| Item type | Current library | Home library | Collection | Call number | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|---|---|
|
Books
|
National University - Manila | LRC - Main General Circulation | Computer Science | GC QA 76.73.C15 .W45 1993 (Browse shelf(Opens below)) | c.1 | Available | NULIB000002583 |
Browsing LRC - Main shelves, Shelving location: General Circulation, Collection: Computer Science Close shelf browser (Hides shelf browser)
| No cover image available | No cover image available | No cover image available |
|
No cover image available | No cover image available | No cover image available | ||
| GC QA 76.73.C15 .T45 1992 No bugs! : delivering error-free code in C and C++ / | GC QA 76.73.C15 .V36 1990 Data structures and C programs / | GC QA 76.73.C15 .V67 1990 Turbo C++: Disk tutor / | GC QA 76.73.C15 .W45 1993 Data structures and algorithm analysis in C / | GC QA 76.73.C25 .S74 1991 Structured COBOL programming / | GC QA 76.73.C25 .V47 1991 COBOL debugging diagnostic manual / | GC QA 76.73.C153 .H46 1998 Using C++ : an introduction to programming / |
Includes bibliographical references and index.
Introduction -- Algorithm analysis -- Lists, stacks, and queues -- Trees -- Hashing -- Priority queues (heaps) -- Sorting -- The disjoint set ADT -- Graph algorithms -- Algorithm design techniques -- Amortized analysis.
This text takes a modern approach to algorithms and data structures. Emphasizing theory rather than code, it highlights conceptual topics with a focus on ADTs and analysis of algorithms for efficiency. In particular, the concentration is on specific programming problems and how careful implementation will improve program running time. Logically organized, it presents topics in a manageable order. Designed for students and professionals, it is suitable for an advanced data structures course or a first-year graduate course in algorithm analysis.
There are no comments on this title.