Mohlo by sa vám tiež páčiť

Viac informácií o knihe Introduction To The Analysis Of Algorithms, An

• Parametre knihy
• Anotácia kniha
• Obľúbené z iného súdka

Nákupom získate 110 bodov

Anotácia knihy

This textbook covers the mathematical foundations of the analysis of algorithms. The gist of the book is how to argue, without the burden of excessive formalism, that a given algorithm does what it is supposed to do. The two key ideas of the proof of correctness, induction and invariance, are employed in the framework of pre/post-conditions and loop invariants. The algorithms considered are the basic and traditional algorithms of computer science, such as Greedy, Dynamic and Divide & Conquer. In addition, two classes of algorithms that rarely make it into introductory textbooks are discussed. Randomized algorithms, which are now ubiquitous because of their applications to cryptography; and Online algorithms, which are essential in fields as diverse as operating systems (caching, in particular) and stock-market predictions. This self-contained book is intended for undergraduate students in computer science and mathematics.

Parametre knihy

Zaradenie knihy Knihy po anglicky Computing & information technology Computer science Mathematical theory of computation

• Celý názov: Introduction To The Analysis Of Algorithms, An
• Autor: Michael Soltys
• Jazyk: Angličtina
• Väzba: Pevná
• Počet strán: 152
• EAN: 9789814271400
• ISBN: 9814271403
• ID: 05069673
• Nakladateľ: World Scientific Publishing Co Pte Ltd
• Hmotnosť: 404 g
• Rozmery: 232 × 158 × 16 mm
• Dátum vydania: 19. October 2009

Obľúbené z iného súdka

---

---

---