Data Structures and Algorithms with JavaScript Michael McMillan

Data Structures and Algorithms with JavaScript Michael McMillan - okladka książki

Autor:: Michael McMillan
Wydawnictwo:: O'Reilly Media (Z chęcią przeczytam książkę w języku polskim)
Ocena:: Bądź pierwszym, który oceni tę książkę
Stron:: 252
Dostępne formaty:: ePub

Mobi

Ebook 126,65 zł najniższa cena z 30 dni

~~149,00 zł~~ (-15%)
126,65 zł

Dodaj do koszyka lub Kup na prezent Kup 1-kliknięciem

126,65 zł najniższa cena z 30 dni

Poleć tę książkę znajomemu Poleć tę książkę znajomemu!!

Przenieś na półkę

Do przechowalni

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

Wybrane bestsellery

Ebooka "Data Structures and Algorithms with JavaScript" przeczytasz na:

czytnikach Inkbook, Kindle, Pocketbook, Onyx Boox i innych
systemach Windows, MacOS i innych

systemach Windows, Android, iOS, HarmonyOS
na dowolnych urządzeniach i aplikacjach obsługujących formaty: PDF, EPub, Mobi

Masz pytania? Zajrzyj do zakładki Pomoc »

Audiobooka "Data Structures and Algorithms with JavaScript" posłuchasz:

w aplikacji Ebookpoint na Android, iOS, HarmonyOs
na systemach Windows, MacOS i innych

na dowolonych urządzeniach
i aplikacjach obsługujących format MP3
(pliki spakowane w ZIP)

Masz pytania? Zajrzyj do zakładki Pomoc »

Kurs Video "Data Structures and Algorithms with JavaScript" zobaczysz:

Oceny i opinie klientów: Data Structures and Algorithms with JavaScript Michael McMillan (0)

Szczegóły książki

ISBN Ebooka:: 978-14-493-7395-5, 9781449373955
Data wydania ebooka :: 2014-03-10 Data wydania ebooka często jest dniem wprowadzenia tytułu do sprzedaży i może nie być równoznaczna z datą wydania książki papierowej. Dodatkowe informacje możesz znaleźć w darmowym fragmencie. Jeśli masz wątpliwości skontaktuj się z nami sklep@ebookpoint.pl.
Język publikacji:: angielski
Rozmiar pliku ePub:: 2.9MB
Rozmiar pliku Mobi:: 2.9MB

Zgłoś erratę

Kategorie

Kliknij, aby zgłosić błędnie przypisaną kategorię »

Informatyka » Webmasterstwo » JavaScript
Informatyka » Programowanie » Java
Informatyka » Programowanie » Algorytmy

Spis treści książki

Preface
- Why Study Data Structures and Algorithms
- What You Need for This Book
- Organization of the Book
- Conventions Used in This Book
- Using Code Examples
- Safari Books Online
- How to Contact Us
- Content Updates
  - October 20, 2015
- Acknowledgments
1. The JavaScript Programming Environment and Model
- The JavaScript Environment
- JavaScript Programming Practices
  - Declaring and Initializing Variables
  - Arithmetic and Math Library Functions in JavaScript
  - Decision Constructs
  - Repetition Constructs
  - Functions
  - Variable Scope
  - Recursion
- Objects and Object-Oriented Programming
- Summary
2. Arrays
- JavaScript Arrays Defined
- Using Arrays
  - Creating Arrays
  - Accessing and Writing Array Elements
  - Creating Arrays from Strings
  - Aggregate Array Operations
- Accessor Functions
  - Searching for a Value
  - String Representations of Arrays
  - Creating New Arrays from Existing Arrays
- Mutator Functions
  - Adding Elements to an Array
  - Removing Elements from an Array
  - Adding and Removing Elements from the Middle of an Array
  - Putting Array Elements in Order
- Iterator Functions
  - NonArray-Generating Iterator Functions
  - Iterator Functions That Return a New Array
- Two-Dimensional and Multidimensional Arrays
  - Creating Two-Dimensional Arrays
  - Processing Two-Dimensional Array Elements
  - Jagged Arrays
- Arrays of Objects
- Arrays in Objects
- Exercises
3. Lists
- A List ADT
- A List Class Implementation
  - Append: Adding an Element to a List
  - Remove: Removing an Element from a List
  - Find: Finding an Element in a List
  - Length: Determining the Number of Elements in a List
  - toString: Retrieving a Lists Elements
  - Insert: Inserting an Element into a List
  - Clear: Removing All Elements from a List
  - Contains: Determining if a Given Value Is in a List
  - Moving To and Retrieving a List Element
  - Iterating Through a List
- Iterating Through a List
- A List-Based Application
  - Reading Text Files
  - Using Lists to Manage a Kiosk
- Exercises
4. Stacks
- Stack Operations
- A Stack Implementation
- Using the Stack Class
  - Multiple Base Conversions
  - Palindromes
  - Demonstrating Recursion
- Exercises
5. Queues
- Queue Operations
- An Array-Based Queue Class Implementation
- Using the Queue Class: Assigning Partners at a Square Dance
- Sorting Data with Queues
- Priority Queues
- Exercises
6. Linked Lists
- Shortcomings of Arrays
- Linked Lists Defined
- An Object-Based Linked List Design
  - The Node Class
  - The Linked List Class
  - Inserting New Nodes
  - Removing Nodes from a Linked List
- Doubly Linked Lists
- Circularly Linked Lists
- Other Linked List Functions
- Exercises
7. Dictionaries
- The Dictionary Class
- Auxiliary Functions for the Dictionary Class
- Adding Sorting to the Dictionary Class
- Exercises
8. Hashing
- An Overview of Hashing
- A Hash Table Class
  - Choosing a Hash Function
  - A Better Hash Function
  - Hashing Integer Keys
  - Storing and Retrieving Data in a Hash Table
- Handling Collisions
  - Separate Chaining
  - Linear Probing
- Exercises
9. Sets
- Fundamental Set Definitions, Operations, and Properties
  - Set Definitions
  - Set Operations
- The Set Class Implementation
- More Set Operations
- Exercises
10. Binary Trees and Binary Search Trees
- Trees Defined
- Binary Trees and Binary Search Trees
  - Building a Binary Search Tree Implementation
  - Traversing a Binary Search Tree
- BST Searches
  - Searching for the Minimum and Maximum Value
  - Searching for a Specific Value
- Removing Nodes from a BST
- Counting Occurrences
  - Exercises
11. Graphs and Graph Algorithms
- Graph Definitions
- Real-World Systems Modeled by Graphs
- The Graph Class
  - Representing Edges
  - Building a Graph
- Searching a Graph
  - Depth-First Search
  - Breadth-First Search
- Finding the Shortest Path
  - Breadth-First Search Leads to Shortest Paths
  - Determining Paths
- Topological Sorting
  - An Algorithm for Topological Sorting
  - Implementing the Topological Sorting Algorithm
- Exercises
12. Sorting Algorithms
- An Array Test Bed
  - Generating Random Data
- Basic Sorting Algorithms
  - Bubble Sort
  - Selection Sort
  - Insertion Sort
  - Timing Comparisons of the Basic Sorting Algorithms
- Advanced Sorting Algorithms
  - The Shellsort Algorithm
    - Computing a dynamic gap sequence
  - The Mergesort Algorithm
    - Bottom-up Mergesort
    - Top-down Mergesort
  - The Quicksort Algorithm
    - Algorithm and pseudocode for the Quicksort algorithm
- Exercises
13. Searching Algorithms
- Commonly Used Functions in Examples
  - Searching for Minimum and Maximum Values
  - Using Self-Organizing Data
- Binary Search
  - Counting Occurrences
- Searching Textual Data
- Exercises
14. Advanced Algorithms
- Dynamic Programming
  - A Dynamic Programming Example: Computing Fibonacci Numbers
  - Finding the Longest Common Substring
  - The Knapsack Problem: A Recursive Solution
  - The Knapsack Problem: A Dynamic Programming Solution
- Greedy Algorithms
  - A First Greedy Algorithm Example: The Coin-Changing Problem
  - A Greedy Algorithm Solution to the Knapsack Problem
- Exercises
Index