Data Structures and Algorithms with JavaScript : Bringing Classic Computing Approaches to the Web by Michael McMillan (2014, Trade Paperback) online kaufen

Über dieses Produkt

Product Identifiers

PublisherO'reilly Media, Incorporated

ISBN-101449364934

ISBN-139781449364939

eBay Product ID (ePID)167791563

Product Key Features

Number of Pages246 Pages

Publication NameData Structures and Algorithms with Javascript : Bringing Classic Computing Approaches to the Web

LanguageEnglish

SubjectProgramming / General, Data Modeling & Design, Programming / Object Oriented, General, Programming Languages / Javascript

Publication Year2014

TypeTextbook

AuthorMichael Mcmillan

Subject AreaComputers

FormatTrade Paperback

Dimensions

Item Height0.5 in

Item Weight15.6 Oz

Item Length9.3 in

Item Width7.8 in

Additional Product Features

Intended AudienceScholarly & Professional

LCCN2015-490800

Dewey Edition23

IllustratedYes

Dewey Decimal005.73

SynopsisIf you're using JavaScript on the server-side, you need to implement classic data structures that conventional object-oriented programs (such as C# and Java) provide. This practical book shows you how to use linked lists, stacks, queues, and graphs, as well as classic algorithms for sorting and searching data in your JavaScript programs., 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 mechanisms--including linked lists, stacks, queues, and graphs--within the constraints of the JavaScript environment. Determine which data structures and algorithms are most appropriate for the problems you're 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 structures Stacks and queues: more complex list-like data structures Linked lists: how they overcome the shortcomings of arrays Dictionaries: storing data as key-value pairs Hashing: good for quick insertion and retrieval Sets: useful for storing unique elements that appear only once Binary Trees: storing data in a hierarchical manner Graphs and graph algorithms: ideal for modeling networks Algorithms: including those that help you sort or search data Advanced algorithms: dynamic programming and greedy algorithms

LC Classification NumberQA76.9.D35