.jpg){kind=logo}
NE-ALGO.AE1
Algorithms
Intermediate Self-paced · 1 year access
19 Hands-On LiveLabs
Practice real IT tasks in guided environments.
- Real environments
- Auto-graded
- No installation
01 / Lessons & labs
See exactly what you will learn and practice
Lessons
14 Interactive Lessons · 106 topics01 Algorithm Analysis 5 topics +
- Experimental Studies
- The Seven Functions Used in This Course
- Asymptotic Analysis
- Simple Justification Techniques
- Exercises
02 Recursion 7 topics · 2 LiveLab +
- Illustrative Examples
- Analyzing Recursive Algorithms
- Recursion Run Amok
- Further Examples of Recursion
- Designing Recursive Algorithms
- Eliminating Tail Recursion
- Exercises
2 LiveLab in this lesson — see the labs panel →
03 Array-Based Sequences 7 topics · 6 LiveLab +
- Python's Sequence Types
- Low-Level Arrays
- Dynamic Arrays and Amortization
- Efficiency of Python's Sequence Types
- Using Array-Based Sequences
- Multidimensional Data Sets
- Exercises
6 LiveLab in this lesson — see the labs panel →
04 Stacks, Queues, and Deques 4 topics · 1 LiveLab +
- Stacks
- Queues
- Double-Ended Queues
- Exercises
1 LiveLab in this lesson — see the labs panel →
05 Linked Lists 8 topics · 4 LiveLab +
- Singly Linked Lists
- Circularly Linked Lists
- Doubly Linked Lists
- The Positional List ADT
- Sorting a Positional List
- Case Study: Maintaining Access Frequencies
- Link-Based vs. Array-Based Sequences
- Exercises
4 LiveLab in this lesson — see the labs panel →
06 Trees 6 topics +
- General Trees
- Binary Trees
- Implementing Trees
- Tree Traversal Algorithms
- Case Study: An Expression Tree
- Exercises
07 Priority Queues 6 topics +
- The Priority Queue Abstract Data Type
- Implementing a Priority Queue
- Heaps
- Sorting with a Priority Queue
- Adaptable Priority Queues
- Exercises
08 Maps, Hash Tables, and Skip Lists 6 topics · 2 LiveLab +
- Maps and Dictionaries
- Hash Tables
- Sorted Maps
- Skip Lists
- Sets, Multisets, and Multimaps
- Exercises
2 LiveLab in this lesson — see the labs panel →
09 Search Trees 7 topics +
- Binary Search Trees
- Balanced Search Trees
- AVL Trees
- Splay Trees
- (2,4) Trees
- Red-Black Trees
- Exercises
10 Sorting and Selection 8 topics · 2 LiveLab +
- Why Study Sorting Algorithms?
- Merge-Sort
- Quick-Sort
- Studying Sorting through an Algorithmic Lens
- Comparing Sorting Algorithms
- Python's Built-In Sorting Functions
- Selection
- Exercises
2 LiveLab in this lesson — see the labs panel →
11 Graph Algorithms 8 topics +
- Graphs
- Data Structures for Graphs
- Graph Traversals
- Transitive Closure
- Directed Acyclic Graphs
- Shortest Paths
- Minimum Spanning Trees
- Exercises
12 Basic Network Algorithms 9 topics · 1 LiveLab +
- Network Terminology
- Network Representations
- Traversals
- Strongly Connected Components
- Finding Paths
- Transitivity
- Shortest Path Modifications
- Summary
- Exercises
1 LiveLab in this lesson — see the labs panel →
13 More Network Algorithms 10 topics · 1 LiveLab +
- Topological Sorting
- Cycle Detection
- Map Coloring
- Maximal Flow
- Network Cloning
- Cliques
- Community Detection
- Eulerian Paths and Cycles
- Summary
- Exercises
1 LiveLab in this lesson — see the labs panel →
14 Complexity Theory 15 topics +
- Notation
- Complexity Classes
- Reductions
- 3SAT
- Bipartite Matching
- NP-Hardness
- Detection, Reporting, and Optimization Problems
- Detection ≤p Reporting
- Reporting ≤p Optimization
- Reporting ≤p Detection
- Optimization ≤p Reporting
- Approximate Optimization
- NP-Complete Problems
- Summary
- Exercises
Hands-On Labs Our edge
19 LiveLabs- Calculating the Product of Two Positive Integers
- Finding the Minimum Element
- Using the getsizeof Function
- Implementing a Dynamic Array
- Adding Elements to a List
- Using the extend Method
- Removing Elements from a List
- Constructing the Caesar Cipher Algorithm
- Using Stack Abstract Data Type Method
- Implementing a Stack
- Implementing a Queue
- Implementing a Queue with a Circular Linked List
- Implementing a Deque with a Doubly Linked List
- Adding Elements to a Set
- Performing Set Operations
- Using a Sorting Function
- Using the len() Built-In Function
- Understanding Network Terminology
- Using the Brute Force Approach
Labs run in your browser — nothing to install.
02 / FAQs
Questions before you start
Keep going
You might also like
Prepare for Algorithms
One-time payment. Full access for 1 year. Start with a free trial if you want to look around first.
- 1 year of full access
- 19 LiveLab included
- Certificate of completion
No credit card required