Data structures and algorithms with javascript /
By: McMillan, Michael
Material type: BookPublisher: Beijing : O'Reilly, c2014.Description: xiv, 229 p. : ill. ; 24 cm.ISBN: 9781449364939Subject(s): Data structures (Computer science) | Object-oriented programming (Computer science) | JavaScript (Computer program language) | JavaScriptDDC classification: 005.73 MC DA Online resources: Location MapItem type | Home library | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|
REGULAR | University of Wollongong in Dubai Main Collection | 005.73 MC DA (Browse shelf) | Available | T0014166 |
, Shelving location: Main Collection Close shelf browser
005.73 MA DA Data structures & other objects using C++ / | 005.73 MA DA Data structures & other objects using C++ / | 005.73 MA DA Data structures & other objects using C++ / | 005.73 MC DA Data structures and algorithms with javascript / | 005.73 NA CO Compact data structures : | 005.73 RA AL Algorithm and data structures | 005.73 SH PR A practical introduction to data structures and algorithm analysis / |
Includes index.
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.