22,95 €
22,95 €
inkl. MwSt.
Sofort per Download lieferbar
22,95 €
22,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
Als Download kaufen
22,95 €
inkl. MwSt.
Sofort per Download lieferbar
Jetzt verschenken
22,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
  • Format: ePub

As an experienced JavaScript developer moving to server-side programming, you need to implement classic data structures and algorithms associated with conventional object-oriented languages like C# and Java. This practical guide shows you how to work hands-on with a variety of storage mechanismsincluding linked lists, stacks, queues, and graphswithin the constraints of the JavaScript environment.Determine which data structures and algorithms are most appropriate for the problems youre trying to solve, and understand the tradeoffs when using them in a JavaScript program. An overview of the…mehr

  • Geräte: eReader
  • mit Kopierschutz
  • eBook Hilfe
  • Größe: 2.93MB
Produktbeschreibung
As an experienced JavaScript developer moving to server-side programming, you need to implement classic data structures and algorithms associated with conventional object-oriented languages like C# and Java. This practical guide shows you how to work hands-on with a variety of storage mechanismsincluding linked lists, stacks, queues, and graphswithin the constraints of the JavaScript environment.Determine which data structures and algorithms are most appropriate for the problems youre trying to solve, and understand the tradeoffs when using them in a JavaScript program. An overview of the JavaScript features used throughout the book is also included.This book covers:Arrays and lists: the most common data structuresStacks and queues: more complex list-like data structuresLinked lists: how they overcome the shortcomings of arraysDictionaries: storing data as key-value pairsHashing: good for quick insertion and retrievalSets: useful for storing unique elements that appear only onceBinary Trees: storing data in a hierarchical mannerGraphs and graph algorithms: ideal for modeling networksAlgorithms: including those that help you sort or search dataAdvanced algorithms: dynamic programming and greedy algorithms

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Autorenporträt
Michael McMillan is an instructor of Computer Information Systems at Pulaski Technical College in North Little Rock, AR. He is also an adjunct instructor of Information Science at the University of Arkansas at Little Rock. Before moving to academia, he was a programmer/analyst for Arkansas Children's Hospital, where he worked in statistical computing and data analysis.