Learning JavaScript Data Structures and Algorithms

JavaScript Data Structures and algorithms can help you solve complex development problems – learn how by exploring a huge range of JavaScript data types

Learning JavaScript Data Structures and Algorithms

This ebook is included in a Mapt subscription
Loiane Groner

1 customer reviews
JavaScript Data Structures and algorithms can help you solve complex development problems – learn how by exploring a huge range of JavaScript data types
$0.00
$13.50
$44.99
$29.99p/m after trial
RRP $26.99
RRP $44.99
Subscription
eBook
Print + eBook
Start 30 Day Trial
Subscribe and access every Packt eBook & Video.
 
  • 4,000+ eBooks & Videos
  • 40+ New titles a month
  • 1 Free eBook/Video to keep every month
Start Free Trial
 
Preview in Mapt

Book Details

ISBN 139781783554874
Paperback218 pages

Book Description

A data structure is a particular way of organizing data in a computer to utilize resources efficiently. Data structures and algorithms are the base of every solution to any programming problem.

This book begins by covering the basics of the JavaScript language and then moves on to discuss the most important data structures such as array, queue, stack, and linked list. You will also gain an in-depth knowledge of how hash tables and set data structure function. After this, you will be taught what trees are, and how to use the binary tree and the binary search tree.

In subsequent chapters, you will learn about graphs, DFS, and BFS. Finally, we will round off by learning how to differentiate between various searching and sorting algorithms such as sequential search, binary search, quick sort, bubble sort, and so on, and how to implement them. Towards the end of the book, you will also be introduced to dynamic programming.

Table of Contents

Chapter 1: JavaScript – A Quick Overview
Setting up the environment
JavaScript basics
Control structures
Functions
Object-oriented programming
Debugging and tools
Summary
Chapter 2: Arrays
Why should we use arrays?
Creating and initializing arrays
Adding and removing elements
Two-dimensional and multi-dimensional arrays
References for JavaScript array methods
Summary
Chapter 3: Stacks
Creating a stack
Decimal to binary
Summary
Chapter 4: Queues
Creating a queue
The priority queue
The circular queue – Hot Potato
Summary
Chapter 5: Linked Lists
Creating a linked list
Doubly linked lists
Circular linked lists
Summary
Chapter 6: Sets
Creating a set
Set operations
Summary
Chapter 7: Dictionaries and Hashes
Dictionaries
The hash table
Summary
Chapter 8: Trees
Trees terminology
Binary tree and binary search tree
Tree traversal
Searching for values in a tree
More about binary trees
Summary
Chapter 9: Graphs
Graph terminology
Representing a graph
Creating the Graph class
Graph traversals
Summary
Chapter 10: Sorting and Searching Algorithms
Sorting algorithms
Searching algorithms
Summary

What You Will Learn

  • Declare, initialize, add, and remove items from arrays, stacks, and queues
  • Create and use the most complex data structure, graphs, along with DFS and BFS algorithms
  • Grasp the power of linked lists, doubly linked lists, and circular linked lists
  • Store unique elements with hash tables, dictionaries, and sets
  • Explore the applications of binary trees and binary search trees
  • Sort data structures using bubble sort, selection sort, insertion sort, merge sort, and quick sort
  • Search elements in data structures using sequential sort and binary search
  • Understand the importance of big O notation, dynamic programming, and greedy algorithms

Authors

Table of Contents

Chapter 1: JavaScript – A Quick Overview
Setting up the environment
JavaScript basics
Control structures
Functions
Object-oriented programming
Debugging and tools
Summary
Chapter 2: Arrays
Why should we use arrays?
Creating and initializing arrays
Adding and removing elements
Two-dimensional and multi-dimensional arrays
References for JavaScript array methods
Summary
Chapter 3: Stacks
Creating a stack
Decimal to binary
Summary
Chapter 4: Queues
Creating a queue
The priority queue
The circular queue – Hot Potato
Summary
Chapter 5: Linked Lists
Creating a linked list
Doubly linked lists
Circular linked lists
Summary
Chapter 6: Sets
Creating a set
Set operations
Summary
Chapter 7: Dictionaries and Hashes
Dictionaries
The hash table
Summary
Chapter 8: Trees
Trees terminology
Binary tree and binary search tree
Tree traversal
Searching for values in a tree
More about binary trees
Summary
Chapter 9: Graphs
Graph terminology
Representing a graph
Creating the Graph class
Graph traversals
Summary
Chapter 10: Sorting and Searching Algorithms
Sorting algorithms
Searching algorithms
Summary

Book Details

ISBN 139781783554874
Paperback218 pages
Read More
From 1 reviews

Read More Reviews