Vi bøger
Levering: 1 - 2 hverdage
Forlænget returret til d. 31. januar 2025

Algorithms Illuminated (Part 3) - Tim Roughgarden - Bog

- Greedy Algorithms and Dynamic Programming

Bag om Algorithms Illuminated (Part 3)

Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject for anyone with at least a little programming experience. The exposition emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details---like a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, optimal search trees).

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9780999282946
  • Indbinding:
  • Paperback
  • Sideantal:
  • 230
  • Udgivet:
  • 9. maj 2019
  • Størrelse:
  • 229x153x11 mm.
  • Vægt:
  • 338 g.
  • 8-11 hverdage.
  • 15. januar 2025
På lager
Forlænget returret til d. 31. januar 2025
  •  

    Kan ikke leveres inden jul.
    Køb nu og print et gavebevis

Normalpris

Medlemspris

Prøv i 30 dage for 45 kr.
Herefter fra 79 kr./md. Ingen binding.

Beskrivelse af Algorithms Illuminated (Part 3)

Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject for anyone with at least a little programming experience. The exposition emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details---like a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, optimal search trees).

Brugerbedømmelser af Algorithms Illuminated (Part 3)



Find lignende bøger
Bogen Algorithms Illuminated (Part 3) findes i følgende kategorier:

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.