Data Structures and Algorithms with JavaScript

Book Description

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

Table of Contents
Chapter 1. The JavaScript Programming Environment and Model
Chapter 2. Arrays
Chapter 3. Lists
Chapter 4. Stacks
Chapter 5. Queues
Chapter 6. Linked Lists
Chapter 7. Dictionaries
Chapter 8. Hashing
Chapter 9. Sets
Chapter 10. Binary Trees and Binary Search Trees
Chapter 11. Graphs and Graph Algorithms
Chapter 12. Sorting Algorithms
Chapter 13. Searching Algorithms
Chapter 14. Advanced Algorithms

Book Details

    • Paperback: 224 pages
    • Publisher: O’Reilly Media (March 2014)
    • Language: English
    • ISBN-10: 1449364934
    • ISBN-13: 978-1449364939

链接:http://j.gs/926397/data-structures-and-algorithms-with-javascript密码:9lbf

时间: 2024-08-07 08:29:39

Data Structures and Algorithms with JavaScript的相关文章

CN5102 Module title Data Structures and Algorithms

SCHOOL OF ARCHITECTURE, COMPUTING &ENGINEERINGSubmission instructions Cover sheet to be attached to the front of the assignment when submitted Question paper to be attached to assignment when submitted All pages to be numbered sequentially All work h

Data Structures and Algorithms

Lab 7Data Structures and AlgorithmsProblem 1: Heap1. (3 points) Create a new class Heap This class must implement the following two methods:(a) heapify which takes an array of integers as input and converts it into a max heap.(b) heapsort which takes

Lock-Free Data Structures

By Andrei Alexandrescu, October 01, 2004 Post a Comment Lock-free data structures guarantee the progress of at least one thread when executing mutlithreaded procedures, thereby helping you avoid deadlock. Andrei Alexandrescu is a graduate student in

代写二叉查找树程序作业、代写BST 作业、代写Data Structures

代写二叉查找树程序作业.代写BST 作业.代写Data StructuresKIT205 Data Structures and AlgorithmsAssignment 1: Data StructuresDue: 27th April, 11:55pmIntroductionYou work for an education company that develops and runs Massive Open Online Courses(MOOCs). You have been ask

SE2205: Algorithms and Data Structures for Object-Oriented Design

SE2205: Algorithms and Data Structures for Object-Oriented DesignLab Assignment 1Assigned: Jan 16, 2019; Due: Feb 13, 2019 @ 10:00 a.m.If you are working in a group of two, then indicate the associated student IDsand numbers in the Test.java file as

SE2205: Algorithms and Data Structures

SE2205: Algorithms and Data Structures for Object-Oriented DesignLab Assignment 3Assigned: Mar 20, 2019; Due: April 8, 2019 @ 10:00 a.m.If you are working in a group of two, then indicate the associated student IDsand numbers in the Assignment3.java

JavaScript data types and data structures

JavaScript data types and data structures Programming languages all have built-in data structures, but these often differ from one language to another. This article attempts to list the built-in data structures available in JavaScript and what proper

[Javascript] Avoiding Mutations in JavaScript with Immutable Data Structures

To demonstrate the difference between mutability and immutability, imagine taking a drink from a glass of water. If our glass is mutable, when we take a drink, we retain the same glass and change the amount of water in that glass. However, if our gla

Choose Concurrency-Friendly Data Structures

What is a high-performance data structure? To answer that question, we're used to applying normal considerations like Big-Oh complexity, and memory overhead, locality, and traversal order. All of those apply to both sequential and concurrent software