Fundamentals of Algorithmics by Gilles Brassard and Paul Bratley
Material type:
- 9788120311312
- 511.8 BRA-F
Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|
![]() |
RGU Central Library General Stacks | 511.8 BRA-F (Browse shelf(Opens below)) | Available | 66853 | |||
![]() |
RGU Central Library General Stacks | 511.8 BRA-F (Browse shelf(Opens below)) | Available | 66854 | |||
![]() |
RGU Central Library General Stacks | 511.8 BRA-F (Browse shelf(Opens below)) | Available | 66855 | |||
![]() |
RGU Central Library General Stacks | 511.8 BRA-F (Browse shelf(Opens below)) | Available | 66856 | |||
![]() |
RGU Central Library General Stacks | 511.8 BRA-F (Browse shelf(Opens below)) | Available | 66857 | |||
![]() |
RGU Central Library | 511.8 BRA-F (Browse shelf(Opens below)) | Available | 58961 | |||
![]() |
RGU Central Library | 511.8 BRA-F (Browse shelf(Opens below)) | Available | 58962 | |||
![]() |
RGU Central Library | 511.8 BRA-F (Browse shelf(Opens below)) | Available | 58963 | |||
![]() |
RGU Central Library | 511.8 BRA-F (Browse shelf(Opens below)) | Available | 58964 | |||
![]() |
RGU Central Library | 511.8 BRA-F (Browse shelf(Opens below)) | Available | 58965 | |||
![]() |
RGU Central Library | 511.8 BRA-F (Browse shelf(Opens below)) | Available | 58966 | |||
![]() |
RGU Central Library | 511.8 BRA-F (Browse shelf(Opens below)) | Available | 58967 | |||
![]() |
RGU Central Library | 511.8 BRA-F (Browse shelf(Opens below)) | Available | 58968 |
Browsing RGU Central Library shelves, Shelving location: General Stacks Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
511.5 WES-I Introduction to graph theory | 511.8 BRA-F Fundamentals of Algorithmics | 511.8 BRA-F Fundamentals of Algorithmics | 511.8 BRA-F Fundamentals of Algorithmics | 511.8 BRA-F Fundamentals of Algorithmics | 511.8 BRA-F Fundamentals of Algorithmics | 512 FAL-C Core concepts in mathematics : |
Description:
Writen by two eminent academics and culled from years of rich experience this book provides a systematic study and design of algorithms suitable for introductory level courses. Giving numerous worked out examples and detailed proofs, the text presents algorithms by types rather than applications.
Contents:
Preface. Preliminaries. Elementary Algorithmics. Asymptotic Notation. Analysis of Algorithms. Some Data Structures. Greedy Algorithms. Divide-and-Conquer. Dynamic Programming. Exploring Graphs. Probabilistic Algorithms. Parallel Algorithms. Computational Complexity. Heuristic and Approximate Algorithms. References. Index.
There are no comments on this title.