Skip to main content
Log inApply now

Computing & engineering · Individual course

Data Structures and Algorithms(CS 201)

Page describes a course providing a rigorous mathematical and practical foundation in computational problem-solving.

$30 one-time268 lessonsRuntime 28:23:22Self-pacedCertificate of completion
Enrol on aclas.collegeFull catalog

Outline

36 sections

  1. 01Course Intro & Syllabus
  2. 02Section 1 - Foundations of Algorithmic Power and Efficiency
  3. 03Section 2 - Foundations of Sorting and Algorithmic Analysis
  4. 04Section 3: Growth of Functions
  5. 05Section 4: Divide-and-Conquer I
  6. 06Section 5: Divide-and-Conquer II
  7. 07Section 6: Probabilistic Analysis and Randomized Algorithms
  8. 08Section 7: Heapsort
  9. 09Section 8: Quicksort
  10. 10Section 9: Sorting in Linear Time
  11. 11Section 10: Medians and Order Statistics
  12. 12Section 11: Elementary Data Structures
  13. 13Section 12: Hash Tables
  14. 14Section 13: Binary Search Trees
  15. 15Section 14: Red-Black Trees
  16. 16Section 15: Augmenting Data Structures
  17. 17Midterm Exam
  18. 18Section 16: Dynamic Programming I
  19. 19Section 17: Dynamic Programming II
  20. 20Section 18: Greedy Algorithms
  21. 21Section 19: Amortized Analysis
  22. 22Section 20: B-Trees
  23. 23Section 21: Fibonacci Heaps
  24. 24Section 22: van Emde Boas Trees
  25. 25Section 23: Data Structures for Disjoint Sets
  26. 26Section 24: Elementary Graph Algorithms
  27. 27Section 25: Minimum Spanning Trees
  28. 28Section 26: Single-Source Shortest Paths
  29. 29Section 27: All-Pairs Shortest Paths
  30. 30Section 28: Maximum Flow
  31. 31Section 29: Multithreaded Algorithms
  32. 32Section 30: Matrix Operations and Linear Programming
  33. 33Section 31: Polynomials, FFT & Number-Theoretic Algorithms
  34. 34Section 32: String Matching & Computational Geometry
  35. 35Section 33: NP-Completeness and Approximation Algorithms
  36. 36Final Exam

Course facts

At a glance

Course
Data Structures and Algorithms(CS 201)
Course code
CS 201
Track
Computing & engineering
Price
$30 $64.99
Lessons
268
Total runtime
28:23:22
Delivery
100% online, self-paced
Language
English
On completion
Certificate of completion — a non-degree credential
Course page on aclas.college

How it fits

Take it alone, or build a credential

A single course earns a certificate of completion. Four related courses earn a named certificate. A structured set of seven to fourteen earns a degree.

On its own

Certificate of completion

Finish this course and receive a certificate of completion naming the course. No further commitment.

In a certificate

A named credential

23 named programmes bundle four related courses from this catalog, completed within twelve months.

Browse certificates

Inside a degree

Academic credit

Many of these courses are also taught inside the five ACLAS degrees, where they carry academic credit.

Compare degrees

Course catalogAll 66 individual courses by trackCertificate programmes23 named credentials from $39Degree programsFive degrees carrying academic creditAdmissions and tuitionPayments, instalments and optional document fees

Enrol on Data Structures and Algorithms(CS 201)

USD 30 one-time. Self-paced, online, with a certificate of completion at the end.

Apply nowSee the catalog

Or email info@aclas.college