- Hem
- Böcker
- Kurslitteratur
- Teknik, Industri & IT
- Basic Concepts In Algorithms (häftad, eng)
Basic Concepts In Algorithms (häftad, eng)
This book is the result of several decades of teaching experience in data structures and algorithms. It is self-contained but does assume so...
809 kr
Bara 3 kvar
Skickas inom 2-3 vardagar
- Fri frakt
Fri frakt över 299:-
Snabb leverans
Alltid låga priser
Produktbeskrivning
This book is the result of several decades of teaching experience in data structures and algorithms. It is self-contained but does assume some prior knowledge of data structures, and a grasp of basic programming and mathematics tools. Basic Concepts in Algorithms focuses on more advanced paradigms and methods combining basic programming constructs as building blocks and their usefulness in the derivation of algorithms.
Its coverage includes the algorithms'' design process and an analysis of their performance. It is primarily intended as a textbook for the teaching of Algorithms for second year undergraduate students in study fields related to computers and programming.Klein reproduces his oral teaching style in writing, with one topic leading to another, related one.
Most of the classical and some more advanced subjects in the theory of algorithms are covered, though not in a comprehensive manner. The topics include Divide and Conquer, Dynamic Programming, Graph algorithms, probabilistic algorithms, data compression, numerical algorithms and intractability.
Each chapter comes with its own set of exercises, and solutions to most of them are appended.Related Link(s)
Its coverage includes the algorithms'' design process and an analysis of their performance. It is primarily intended as a textbook for the teaching of Algorithms for second year undergraduate students in study fields related to computers and programming.Klein reproduces his oral teaching style in writing, with one topic leading to another, related one.
Most of the classical and some more advanced subjects in the theory of algorithms are covered, though not in a comprehensive manner. The topics include Divide and Conquer, Dynamic Programming, Graph algorithms, probabilistic algorithms, data compression, numerical algorithms and intractability.
Each chapter comes with its own set of exercises, and solutions to most of them are appended.Related Link(s)
Format | Häftad |
Omfång | 364 sidor |
Språk | Engelska |
Förlag | World Scientific Publishing Co Pte Ltd |
Utgivningsdatum | 2021-07-27 |
ISBN | 9789811238529 |
Specifikation
Böcker
- Häftad, 364, Engelska, World Scientific Publishing Co Pte Ltd, 2021-07-27, 9789811238529
Leverans
Vi erbjuder flera smidiga leveransalternativ beroende på ditt postnummer, såsom Budbee Box, Early Bird, Instabox och DB Schenker. Vid köp över 299 kr är leveransen kostnadsfri, annars tillkommer en fraktavgift från 29 kr. Välj det alternativ som passar dig bäst för en bekväm leverans.
Betalning
Du kan betala tryggt och enkelt via Avarda med flera alternativ: Swish för snabb betalning, kortbetalning med VISA eller MasterCard, faktura med 30 dagars betalningstid, eller konto för flexibel delbetalning.
Specifikation
Det finns tyvärr inga specifikationer att visa för denna produkt.