scientific article; zbMATH DE number 1052004
This is a second edition of the book. The main changes are the expansion of the early material on lists, stacks and queues, and the replacement of Modula-2 by Eiffel which improved the code readability. The book is suitable for an advanced one-semester undergraduate course on algorithms for computer science and electrical engineering students. It provides an analysis of algorithms and data structures. The book is self-contained in its treatment of data abstraction and correctness, analysis, and design of algorithms. It starts with some chapters devoted to techniques, then it gives applications of lists, stacks, sorting, priority queues, and graph algorithms. The last chapter presents some technique to prove lower bounds on the complexity of problems. There are may examples and execise. Moreover, all the code has been tested and it is available from \texttt{ftp://ftp.cs.usyd.edu.au/jeffkedsal/}.
- A heap-based algorithm for the study of one-dimensional particle systems.
- Data structures and algorithms analysis -- new perspectives. Volume 1: Data structures based on linear relations
- Data and algorithms. An introductory course. With 1 CD-ROM
- Analysis of algorithms. An active learning approach
- scientific article; zbMATH DE number 5866337 (Why is no real title available?)
- scientific article; zbMATH DE number 4033041 (Why is no real title available?)
- scientific article; zbMATH DE number 4047034 (Why is no real title available?)
- scientific article; zbMATH DE number 2031582 (Why is no real title available?)
- scientific article; zbMATH DE number 194822 (Why is no real title available?)
- scientific article; zbMATH DE number 839549 (Why is no real title available?)
- Algorithms and Data Structures
- Algorithmen und Datenstrukturen
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4349923)
