Course
Data Structures and Algorithms in Javascript
30 hours 40 minutes
Credits: Optional Learning
Description
This course teaches learners how to implement and apply fundamental data structures and algorithms using JavaScript. Starting with core data structures including linked lists, queues, stacks, hash maps, trees, heaps, and graphs, learners then progress to algorithm design and analysis covering recursion, sorting algorithms, binary search, graph traversal, and pathfinding techniques.
What Students Will Learn
Chapter 1: JavaScript Data Structures
- Nodes Data Structure
- JavaScript Nodes
- Linked List Data Structure
- JavaScript Linked Lists
- JavaScript Swapping Elements in a Linked List
- JavaScript Two-Pointer Linked Lists Techniques
- Doubly Linked Lists Data Structure
- JavaScript Doubly Linked Lists
- Queues Data Structure
- JavaScript Queues
- Stacks Data Structure
- JavaScript Stacks
- JavaScript Stacks Lab: Web Navigator
- Hash Maps Data Structure
- JavaScript Hash Maps
- Trees Data Structure
- JavaScript Trees
- Heaps Data Structure
- JavaScript Heaps
- Graphs Data Structure
- JavaScript Graphs
Chapter 2: JavaScript Algorithms
- Recursion
- JavaScript Recursions
- JavaScript Recursive Traversal
- Asymptotic Notation
- JavaScript Asymptotic Notations
- Bubble Sort
- JavaScript Bubble Sort
- Merge Sort
- JavaScript Merge Sort
- Quicksort
- JavaScript Quicksort
- Binary Search in JavaScript
- JavaScript Binary Trees
- Graph Search
- JavaScript Graph Traversal
- Dijkstra's Algorithm
Optional
- Recursion Cheatsheet
- Asymptotic Notation Cheatsheet
- JavaScript Asymptotic Notations Cheatsheet
- Bubble Sort Cheatsheet
- JavaScript Bubble Sort Cheatsheet
- Merge Sort Cheatsheet
- Quicksort Cheatsheet
- JavaScript Quicksort Cheatsheet
- Binary Search in JavaScript Cheatsheet
- JavaScript Binary Trees Cheatsheet
- JavaScript Trees Cheatsheet
- JavaScript Heaps Cheatsheet
Overall Learning Outcomes
- Implement and work with node-based data structures including singly and doubly linked lists using JavaScript
- Apply two-pointer techniques and element swapping within linked list structures
- Build and use queues, stacks, and hash maps to solve practical programming problems
- Implement tree, heap, and graph data structures in JavaScript
- Apply recursive thinking and implement recursive traversal algorithms
- Analyze algorithm efficiency using asymptotic notation and Big O concepts
- Implement and compare sorting algorithms including bubble sort, merge sort, and quicksort in JavaScript
- Apply binary search and binary tree traversal techniques
- Implement graph search and traversal algorithms including Dijkstra’s algorithm for pathfinding