Terug Terug

Algorithms Unlocked

Name: Algorithms Unlocked
Author: Thomas H. Cormen

Auteur: Thomas H. Cormen

Taal: Engels

Afbeeldingen

Artikel vergelijken

Vergelijk met andere artikelen

Bekijk nu

Auteur: Thomas H. Cormen

Engels
Paperback
9780262518802
01 maart 2013
222 pagina's

Alle productspecificaties

Thomas H. Cormen

"Thomas H. Cormen is the co-author of Introduction to Algorithms, along with Charles Leiserson, Ron Rivest, and Cliff Stein. In 2013, he published a new book titled Algorithms Unlocked. He is a professor of computer science at Dartmouth College and former Chair of the Dartmouth College Department of Computer Science. Between 2004 and 2008 he directed the Dartmouth College Writing Program. His research interests are algorithm engineering, parallel computing, speeding up computations with high latency.

(Bron: Wikipedia. Beschikbaar onder de licentie Creative Commons Naamsvermelding/Gelijk delen.)"

Alles van Thomas H. Cormen

Samenvatting

For anyone who has ever wondered how computers solve problems, an engagingly written guide for nonexperts to the basics of computer algorithms. Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen-coauthor of the leading college textbook on the subject-provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems. Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simple ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order ( sorting ); how to solve basic problems that can be modeled in a computer with a mathematical structure called a graph (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time.

Productspecificaties

Inhoud

Taal: en
Bindwijze: Paperback
Oorspronkelijke releasedatum: 01 maart 2013
Aantal pagina's: 222
Illustraties: Nee

Betrokkenen

Hoofdauteur: Thomas H. Cormen
Hoofduitgeverij: Mit Press

Overige kenmerken

Editie: 1
Extra groot lettertype: Nee
Product breedte: 146 mm
Product hoogte: 19 mm
Product lengte: 235 mm
Studieboek: Ja
Verpakking breedte: 146 mm
Verpakking hoogte: 19 mm
Verpakking lengte: 235 mm
Verpakkingsgewicht: 339 g

EAN

EAN: 9780262518802

Je vindt dit artikel in

Categorieën: Computers & Informatica

Programmeren

Algoritmes & datastructuren

Programmeertalen

Boeken
Taal: Engels
Boek, ebook of luisterboek?: Boek
Beschikbaarheid: Leverbaar
Studieboek of algemeen: Algemene boeken

Reviews

Nog geen reviews

Hoe controleren en plaatsen wij reviews? Hoe controleren en plaatsen wij reviews?

Negatief, positief, neutraal: we zetten een review altijd online. We controleren wel eerst of ’ie voldoet aan onze reviewvoorwaarden en niet nep is. We controleren ook of ’ie is geschreven door iemand die het artikel heeft gekocht via bol.com en zetten dit er dan bij. De controles gebeuren automatisch, al kijken er soms mensen mee. Bol.com betaalt niet voor reviews. Als een reviewer door een andere partij is vergoed, staat dit in de review zelf.