Introduction to algorithms
Material type:
TextPublication details: Cambridge, Mass. MIT Press, 2001.Edition: 2nd edDescription: xxi, 1180 pages 24 cmISBN: - 9788120321410
- 9788120321410
- Algorithms
- Computer programming
- Computer algorithms
- Programming
- Algorithms
- Programmation (Informatique)
- computer programming
- algorithms
- 54.10 theoretical informatics
- Computer algorithms
- Computer programming
- Algorithms
- Programming
- COMPUTER PROGRAMMING
- COMPUTER PROGRAMS
- PROGRAMMING LANGUAGES
- ALGORITHMS
- FILE MAINTENANCE (COMPUTERS)
- SOFTWARE TOOLS
- 54.10 theoretical informatics
- computer software
- algoritmen
- algorithms
- probleemanalyse
- problem analysis
- probleemoplossing
- problem solving
- computers
- minicomputers
- microcomputers
- gegevensverwerking
- data processing
- programmeren
- programming
- software engineering
- Software, Application Programs
- 005.1 INT
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
Books
|
Botho University Botswana Open Shelves | Information Technology | 005.1 INT (Browse shelf(Opens below)) | Available | NIIT02072 | ||
|
Books
|
Botho University Botswana Open Shelves | Information Technology | 005.1 INT (Browse shelf(Opens below)) | Available | NIIT02071 | ||
|
Books
|
Botho University Botswana Open Shelves | Information Technology | 005.1 INT (Browse shelf(Opens below)) | Available | NIIT03318 | ||
|
Books
|
Botho University Botswana Open Shelves | Information Technology | 005.1 INT (Browse shelf(Opens below)) | Available | NIIT03319 | ||
|
Books
|
Botho University eSwatini Open Shelves | 005.1 INT (Browse shelf(Opens below)) | Available | NIIT02073 |
Revised edition of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990.
Includes bibliographical references (pages 1127-1130) and index.
The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.
There are no comments on this title.