Essential of algorithms : a practical approach to computer algorithms/ [edited by] Joe Oswald
Series: Textbook seriesNew York, NY: Larsen and Keller, 2019Description: vi, 302 pages : illustrations; 27 cmContent type: text Media type: unmediated Carrier type: volumeISBN: 9781641720328Subject(s): Computer algorithms | AlgorithmsDDC classification: 511.8 Es742 2019 Summary: Description : An algorithm is a specification of instructions for solving a class of problems by performing calculations and performing automated reasoning tasks and data processing. It describes a computation which when executed takes a finite number of successive states to produce an output. It is written in software in computer systems to produce output from a given input. Algorithms can be classified on the basis of implementation, design paradigm, optimization problems, etc. into a number of varied types. Some algorithm types are recursion, deterministic and non-deterministic, logical, randomized algorithms, etc. This book provides comprehensive insights into computer algorithms. It attempts to understand the varied kinds of computer algorithms and their practical applications. For someone with an interest and eye for detail, this textbook covers the most significant topics in this field.Item type | Current location | Home library | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
![]() |
COLLEGE LIBRARY | COLLEGE LIBRARY | 511.8 Es742 2019 (Browse shelf) | Available | CL-49591 |
Browsing COLLEGE LIBRARY Shelves Close shelf browser
![]() |
![]() |
![]() |
![]() |
No cover image available |
![]() |
![]() |
||
511.6 K834 2014 Discrete mathematical structures / | 511.6 P369 2012 Computational discrete mathematics : combinatorics and graph theory with Mathematica / | 511.6 T795 1980 Applied combinatorics / | 511.8 Es742 2019 Essential of algorithms : a practical approach to computer algorithms/ | 511.8 M42 1988 Mathematical modelling in non-distructure testing / | 511.8 M5642 1995 A concrete approach to mathematical modelling / | 511.8 M724 2019 Mathematical modelling : a graduate textbook / |
Includes index.
Description :
An algorithm is a specification of instructions for solving a class of problems by performing calculations and performing automated reasoning tasks and data processing. It describes a computation which when executed takes a finite number of successive states to produce an output. It is written in software in computer systems to produce output from a given input. Algorithms can be classified on the basis of implementation, design paradigm, optimization problems, etc. into a number of varied types. Some algorithm types are recursion, deterministic and non-deterministic, logical, randomized algorithms, etc. This book provides comprehensive insights into computer algorithms. It attempts to understand the varied kinds of computer algorithms and their practical applications. For someone with an interest and eye for detail, this textbook covers the most significant topics in this field.
500-599 511
There are no comments for this item.