Foundations of Data Structures and Algorithms Specialization

About Course

Foundations of Data Structures and Algorithms Specialization, Building fast and highly performant data science applications requires an intimate knowledge of how data can be organized in a computer and how to efficiently perform operations such as sorting, searching, and indexing. This course will teach the fundamentals of data structures and algorithms with a focus on data science applications. This specialization is targeted towards learners who are broadly interested in programming applications that process large amounts of data (expertise in data science is not required), and are familiar with the basics of programming in python. We will learn about various data structures including arrays, hash-tables, heaps, trees and graphs along with algorithms including sorting, searching, traversal and shortest path algorithms. This specialization can be taken for academic credit as part of CU Boulder’s MS in Data Science or MS in Computer Science degrees offered on the Coursera platform. These fully accredited graduate degrees offer targeted courses, short 8-week sessions, and pay-as-you-go tuition. Admission is based on performance in three preliminary courses, not academic history. CU degrees on Coursera are ideal for recent graduates or working professionals. Learners will solve data-structure problems by analyzing and designing algorithms for searching, sorting, and indexing; creating trees and graphs; and addressing intractability. Courses also include conceptual algorithm design problems as well as opportunities to program data structures/algorithms in the python programming language.

Course Content

01. Algorithms for Searching, Sorting, and Indexing

001 01_earn-academic-credit-for-your-work_instructions.html

00:00
002 02_course-support_instructions.html

00:00
003 03_important-prerequisites_instructions.html

00:00
004 04_logistics-textbook-and-readings_instructions.html

00:00
007 05_what-is-an-algorithm.mp4

00:00
008 06_clrs-chapter-1_instructions.html

00:00
009 07_important-specialization-information_instructions.html

00:00
013 01_an-introduction-through-the-insertion-sort-algorithm.mp4

00:00
014 02_clrs-chapter-2_instructions.html

00:00
015 03_insertion-sort-and-running-times_exam.html

00:00
018 01_time-and-space-complexity.mp4

00:00
021 02_asymptotic-notation.mp4

00:00
022 03_clrs-chapter-3_instructions.html

00:00
023 04_asymptotic-notation-and-complexity_exam.html

00:00
026 01_binary-search.mp4

00:00
028 02_binary-search-lecture-slides_instructions.html

00:00
030 03_jupyter-notebook-on-binary-search_instructions.html

00:00
031 04_binary-search_exam.html

00:00
034 01_merge-sort-algorithm-analysis-and-proof-of-correctness.mp4

00:00
035 02_notes-on-mergesort_instructions.html

00:00
038 03_mergesort-algorithm_exam.html

00:00
041 01_pitfalls-and-logarithms.mp4

00:00
047 02_clrs-chapter-10-10-1-jupyter-notebook_instructions.html

00:00
048 03_basics-of-data-structures_exam.html

00:00
051 01_heap-min-max-heaps-and-properties-of-heaps.mp4

00:00
052 02_clrs-chapter-6-1-and-6-2_instructions.html

00:00
053 03_basics-of-heap-data-structures_exam.html

00:00
056 01_heap-primitives-bubble-up-bubble-down.mp4

00:00
057 02_clrs-chapter-6-3_instructions.html

00:00
060 03_priority-queues-heapify-and-heapsort.mp4

00:00
061 04_clrs-chapter-6-4-and-6-5_instructions.html

00:00
062 05_bubble-up-bubble-down-insertion-and-deletion-operations_exam.html

00:00
066 01_hashtables-introduction.mp4

00:00
067 02_clrs-chapter-11-1-and-11-2_instructions.html

00:00
068 03_hashtables_exam.html

00:00
072 01_introduction-to-randomization-average-case-analysis-recurrences.mp4

00:00
076 02_clrs-chapter-7-1_instructions.html

00:00
077 03_quicksort-and-partition_exam.html

00:00
080 01_detailed-design-of-partitioning-schemes.mp4

00:00
081 02_clrs-chapter-7-1_instructions.html

00:00
082 03_partition-schemes_exam.html

00:00
085 01_analysis-of-quicksort-algorithm.mp4

00:00
086 02_clrs-chapter-7-2-7-4_instructions.html

00:00
087 03_analysis-of-quicksort_exam.html

00:00
090 01_quickselect-algorithm-and-its-applications.mp4

00:00
091 02_clrs-chapter-9-1-9-2_instructions.html

00:00
092 03_quickselect-algorithm_exam.html

00:00
095 01_selecting-hash-functions.mp4

00:00
098 02_universal-hash-functions-and-analysis.mp4

00:00
099 03_clrs-chapter-11-3_instructions.html

00:00
100 04_universal-hash-functions_exam.html

00:00
104 01_open-address-hashing.mp4

00:00
105 02_clrs-11-4_instructions.html

00:00
106 03_open-address-hashing_exam.html

00:00
109 01_perfect-hashing-and-cuckoo-hashing.mp4

00:00
110 02_clrs-chapter-11-5-perfect-hashing-and-slides-with-scribbles_instructions.html

00:00
114 01_bloom-filters-and-analysis.mp4

00:00
117 02_bloom-filter-slides_instructions.html

00:00
120 01_count-min-sketching-using-hashing.mp4

00:00
122 02_count-min-sketches-slides_instructions.html

00:00
125 01_string-matching-using-hashing.mp4

00:00
126 02_slides-with-scribbles_instructions.html

00:00
links.txt

00:00

02. Trees and Graphs Basics

001 01_earn-academic-credit-for-your-work_instructions.html

00:00
002 02_course-support_instructions.html

00:00
003 03_important-prerequisites_instructions.html

00:00
004 04_logistics-textbook-and-readings_instructions.html

00:00
005 05_important-specialization-information_instructions.html

00:00
009 01_binary-search-trees-introduction-and-properties.mp4

00:00
010 02_reading-clrs-chapter-12_instructions.html

00:00
011 03_basics-of-binary-search-trees_exam.html

00:00
014 01_binary-search-trees-insertion-and-deletion.mp4

00:00
015 02_clrs-chapter-12-1-12-3_instructions.html

00:00
016 03_binary-search-tree-insert-and-delete_exam.html

00:00
019 01_red-black-trees-basics.mp4

00:00
020 02_clrs-chapter-13-13-1_instructions.html

00:00
021 03_red-black-tree-basics_exam.html

00:00
024 01_red-black-trees-rotations-algorithms-for-insertion-and-deletion.mp4

00:00
025 02_clrs-chapter-13-2-13-3_instructions.html

00:00
026 03_tree-rotations_exam.html

00:00
029 01_skip-lists.mp4

00:00
031 02_skip_instructions.html

00:00
032 03_skip-lists_exam.html

00:00
036 01_graphs-and-their-representations.mp4

00:00
037 02_clrs-chapter-22-section-22-1_instructions.html

00:00
038 03_graph-representations_exam.html

00:00
041 01_graph-traversals-and-breadth-first-traversal.mp4

00:00
042 02_clrs-chapter-22-section-22-2_instructions.html

00:00
045 01_depth-first-search.mp4

00:00
046 02_clrs-chapter-22-section-22-3_instructions.html

00:00
047 03_combined-quiz-on-graph-traversals_exam.html

00:00
050 01_topological-sorting-and-applications.mp4

00:00
051 02_clrs-chapter-22-section-22-4_instructions.html

00:00
052 03_topological-sort-graphs_exam.html

00:00
055 01_strongly-connected-components-definitions.mp4

00:00
058 02_strongly-connected-components-properties.mp4

00:00
061 03_strongly-connected-components-algorithm.mp4

00:00
062 04_clrs-chapter-22-section-22-5_instructions.html

00:00
063 05_strongly-connected-components_exam.html

00:00
067 01_amortized-analysis-of-data-structures.mp4

00:00
070 02_amortized-analysis-potential-functions.mp4

00:00
071 03_clrs-chapter-17_instructions.html

00:00
072 04_amortized-analysis_exam.html

00:00
075 01_spanning-trees-and-minimal-spanning-trees-with-applications.mp4

00:00
076 02_clrs-chapter-23-section-23-1_instructions.html

00:00
077 03_minimum-spanning-tree_exam.html

00:00
080 01_kruskals-algorithm-for-finding-minimal-spanning-trees.mp4

00:00
081 02_clrs-chapter-23-section-23-2_instructions.html

00:00
082 03_kruskals-algorithm_exam.html

00:00
085 01_union-find-data-structures-and-rank-compression.mp4

00:00
086 02_clrs-chapter-21_instructions.html

00:00
087 03_disjoint-set-forest_exam.html

00:00
091 01_shortest-path-problems-and-their-properties.mp4

00:00
092 02_clrs-chapter-24-up-to-section-24-1_instructions.html

00:00
093 03_shortest-path-problems-properties_exam.html

00:00
096 01_bellman-ford-algorithm-for-single-source-shortest-paths.mp4

00:00
097 02_clrs-chapter-24-section-24-1_instructions.html

00:00
098 03_shortest-path-bellman-ford-algorithm_exam.html

00:00
101 01_dijkstras-algorithm-for-single-source-shortest-paths-with-nonnegative-edge.mp4

00:00
104 02_proof-of-dijkstras-algorithm.mp4

00:00
105 03_clrs-chapter-24-section-24-3-and-24-5_instructions.html

00:00
106 04_dijkstras-algorithm_exam.html

00:00
109 01_shortest-path-on-dags.mp4

00:00
110 02_clrs-chapter-24-section-24-2_instructions.html

00:00
113 01_all-pairs-shortest-path-problems-and-floyd-warshalls-algorithm.mp4

00:00
114 02_clrs-chapter-25-sections-25-1-and-25-2_instructions.html

00:00
links.txt

00:00

03. Dynamic Programming, Greedy Algorithms

001 01_earn-academic-credit-for-your-work_instructions.html

00:00
002 02_course-support_instructions.html

00:00
003 03_reading-important-prerequisites_instructions.html

00:00
004 04_logistics-textbook-and-readings_instructions.html

00:00
005 05_important-specialization-information_instructions.html

00:00
009 01_what-are-divide-and-conquer-algorithms.mp4

00:00
010 02_clrs-chapter-4_instructions.html

00:00
013 01_max-subarray-problem-using-divide-and-conquer.mp4

00:00
014 02_clrs-chapter-4-1_instructions.html

00:00
015 03_max-subarray-problem_exam.html

00:00
018 01_karatsubas-multiplication-algorithm.mp4

00:00
019 02_jupyter-notebook-on-karatsubas-algorithm_instructions.html

00:00
020 03_karatsubas-multiplication-algorithm_exam.html

00:00
023 01_master-method-revisited.mp4

00:00
024 02_clrs-chapters-4-3-4-5_instructions.html

00:00
025 03_master-method_exam.html

00:00
028 01_fft-part-1-introduction-and-complex-numbers.mp4

00:00
029 02_basics-of-complex-numbers_instructions.html

00:00
032 03_fft-part-2-definition-and-interpretation-of-discrete-fourier-transforms.mp4

00:00
033 04_fourier-transforms_instructions.html

00:00
036 05_fft-part-3-divide-and-conquer-algorithm-for-fft.mp4

00:00
039 06_application-1-fast-polynomial-multiplication-using-fft.mp4

00:00
042 07_application-2-data-analysis-using-fft.mp4

00:00
043 08_fast-fourier-transform_instructions.html

00:00
044 09_complex-numbers-and-roots-of-unity_exam.html

00:00
045 10_fft-algorithm-and-applications_exam.html

00:00
049 01_introduction-to-dynamic-programming-rod-cutting-problem.mp4

00:00
050 02_rod-cutting-problem_instructions.html

00:00
051 03_rod-cutting-problem-and-recurrence_quiz.html

00:00
054 01_rod-cutting-problem-memoization.mp4

00:00
055 02_memoization_instructions.html

00:00
056 03_memoization_exam.html

00:00
059 01_coin-changing-problem.mp4

00:00
060 02_coin-changing-problem_instructions.html

00:00
061 03_coinchanging-problem_exam.html

00:00
064 01_knapsack-problem.mp4

00:00
065 02_jupyter-notebook_instructions.html

00:00
066 03_knapsack-problem_exam.html

00:00
069 01_when-optimal-substructure-fails.mp4

00:00
073 02_clrs-chapter-15-4_instructions.html

00:00
074 03_longest-common-subsequence_exam.html

00:00
078 01_introduction-to-greedy-algorithms.mp4

00:00
079 02_clrs-chapter-16_instructions.html

00:00
080 03_greedy-algorithms_quiz.html

00:00
083 01_greedy-interval-scheduling.mp4

00:00
084 02_clrs-chapters-16-1-and-16-2_instructions.html

00:00
085 03_greedy-interval-scheduling_quiz.html

00:00
088 01_prefix-codes.mp4

00:00
091 02_huffman-codes.mp4

00:00
094 03_huffman-codes-proof-of-optimality.mp4

00:00
095 04_clrs-chapter-16-3_instructions.html

00:00
096 05_huffman-codes_exam.html

00:00
100 01_decision-problems-and-languages.mp4

00:00
101 02_clrs-chapter-34_instructions.html

00:00
102 03_decision-problems-and-languages_exam.html

00:00
105 01_polynomial-time-problems.mp4

00:00
106 02_clrs-chapter-34-1_instructions.html

00:00
107 03_polynomial-time-and-certificates_exam.html

00:00
110 01_np-definition.mp4

00:00
113 02_np-completeness-and-reductions.mp4

00:00
114 03_clrs-chapter-34-2-and-34-3_instructions.html

00:00
115 04_np-completeness-reductions_quiz.html

00:00
118 01_np-complete-problems-examples.mp4

00:00
119 02_clrs-chapter-34-5_instructions.html

00:00
120 03_np-completeness-problems_exam.html

00:00
123 01_computation-and-physics.mp4

00:00
126 02_qubits-and-operations.mp4

00:00
129 03_bells-inequality.mp4

00:00
132 04_grovers-search-algorithm.mp4

00:00
links.txt

00:00

04. Approximation Algorithms and Linear Programming

001 01_earn-academic-credit-for-your-work_instructions.html

00:00
002 02_course-support_instructions.html

00:00
005 01_introduction-to-linear-programming.mp4

00:00
008 02_what-is-a-linear-program.mp4

00:00
011 03_example-cake-sharing-problem.mp4

00:00
014 04_solving-linear-programs.mp4

00:00
015 05_basics-of-linear-programs_exam.html

00:00
019 01_network-flow-problems-and-linear-programs.mp4

00:00
020 02_network-flow-problems-as-lps_exam.html

00:00
023 01_geometry-of-linear-programs.mp4

00:00
024 02_geometry-of-linear-programs_exam.html

00:00
027 01_algorithms-for-solving-linear-programs.mp4

00:00
028 02_lp-algorithms_exam.html

00:00
031 01_what-is-an-integer-linear-program.mp4

00:00
034 02_formal-introduction-to-integer-linear-programs.mp4

00:00
037 01_np-hardness-of-integer-linear-programming.mp4

00:00
038 02_integer-linear-programming_exam.html

00:00
042 01_vertex-cover-as-an-integer-linear-program.mp4

00:00
046 02_vertex-cover-ilp-lp-relaxation-and-integrality-gap_exam.html

00:00
049 01_branch-and-bound-algorithm-for-solving-integer-linear-programs.mp4

00:00
050 02_branch-and-bound-solvers_exam.html

00:00
053 01_introduction-to-approximation-algorithms.mp4

00:00
054 02_approximation-algorithm-basics_exam.html

00:00
057 01_introduction-to-jobshop-scheduling-and-algorithm-design.mp4

00:00
060 02_analysis-of-jobshop-scheduling.mp4

00:00
061 03_job-shop-scheduling-questions_exam.html

00:00
064 01_approximation-algorithms-for-vertex-cover-and-their-analysis.mp4

00:00
065 02_vertex-cover_exam.html

00:00
068 01_approximation-algorithms-for-the-maximum-satisfiability-problem.mp4

00:00
069 02_max-sat-approximation_exam.html

00:00
072 01_introduction-to-tsp-and-its-applications.mp4

00:00
075 02_np-hardness-of-tsps.mp4

00:00
078 03_hardness-of-approximating-general-tsps.mp4

00:00
079 04_tsp-basics_exam.html

00:00
082 01_held-and-karps-dynamic-programming-algorithm.mp4

00:00
085 02_integer-linear-programming-formulation.mp4

00:00
088 03_subtours-and-subtour-elimination-formulation.mp4

00:00
089 04_held-karp-algorithm_exam.html

00:00
090 05_tsp-integer-programming_exam.html

00:00
093 01_metric-tsp-and-shortcutting.mp4

00:00
096 02_eulerian-walks-for-approximating-tsps.mp4

00:00
099 03_christofides-algorithm-and-its-analysis.mp4

00:00
100 04_approximations-for-metric-tsps_exam.html

00:00
103 01_heuristics-for-tsps.mp4

00:00
107 02_fully-polynomial-time-approximation-scheme_exam.html

00:00

05. Advanced Data Structures, RSA and Quantum Algorithms

001 01_earn-academic-credit-for-your-work_instructions.html

00:00
002 02_course-support_instructions.html

00:00
003 03_assessment-expectations_instructions.html

00:00
006 01_introduction-to-public-key-cryptography.mp4

00:00
012 02_extended-euclid-bezout-coefficients.mp4

00:00
015 01_rsa-cryptography.mp4

00:00
024 02_unitary-operators-and-reversible-computation.mp4

00:00
027 01_multi-qubit-quantum-states.mp4

00:00
030 02_multi-qubit-quantum-gates.mp4

00:00
033 03_quantum-parallelism.mp4

00:00
036 04_no-cloning-theorem.mp4

00:00
039 01_bells-inequality-power-of-entangled-states.mp4

00:00
052 02_recap-fft-basics-of-complex-numbers-and-roots-of-unity.mp4

00:00
055 03_recap-discrete-time-fourier-transforms.mp4

00:00
058 04_recap-fft-divide-and-conquer-algorithm.mp4

00:00
061 01_quantum-fourier-transform-part-1.mp4

00:00
064 02_quantum-fourier-transform-part-2.mp4

00:00
067 01_introduction-to-b-trees.mp4

00:00
070 02_structure-and-properties-of-b-trees.mp4

00:00
073 03_simple-example.mp4

00:00
076 04_searching-for-a-key-in-a-b-tree.mp4

00:00
079 01_b-tree-key-insertion-algorithm.mp4

00:00
082 02_b-tree-key-deletion-algorithm.mp4

00:00
085 01_tries-basics.mp4

00:00
088 02_suffix-tries.mp4

00:00
091 03_generalized-suffix-tries.mp4

00:00
094 01_ukkonens-algorithm-part-1.mp4

00:00
097 02_ukkonens-algorithm-part-2.mp4

00:00
100 01_concluding-remarks.mp4

00:00

Add this certificate to your resume to demonstrate your skills & increase your chances of getting noticed.

Student Ratings & Reviews

No Review Yet

About Course

What Will You Learn?

Course Content

01. Algorithms for Searching, Sorting, and Indexing

001 01_earn-academic-credit-for-your-work_instructions.html

002 02_course-support_instructions.html

003 03_important-prerequisites_instructions.html

004 04_logistics-textbook-and-readings_instructions.html

007 05_what-is-an-algorithm.mp4

008 06_clrs-chapter-1_instructions.html

009 07_important-specialization-information_instructions.html

013 01_an-introduction-through-the-insertion-sort-algorithm.mp4

014 02_clrs-chapter-2_instructions.html

015 03_insertion-sort-and-running-times_exam.html

018 01_time-and-space-complexity.mp4

021 02_asymptotic-notation.mp4

022 03_clrs-chapter-3_instructions.html

023 04_asymptotic-notation-and-complexity_exam.html

026 01_binary-search.mp4

028 02_binary-search-lecture-slides_instructions.html

030 03_jupyter-notebook-on-binary-search_instructions.html

031 04_binary-search_exam.html

034 01_merge-sort-algorithm-analysis-and-proof-of-correctness.mp4

035 02_notes-on-mergesort_instructions.html

038 03_mergesort-algorithm_exam.html

041 01_pitfalls-and-logarithms.mp4

047 02_clrs-chapter-10-10-1-jupyter-notebook_instructions.html

048 03_basics-of-data-structures_exam.html

051 01_heap-min-max-heaps-and-properties-of-heaps.mp4

052 02_clrs-chapter-6-1-and-6-2_instructions.html

053 03_basics-of-heap-data-structures_exam.html

056 01_heap-primitives-bubble-up-bubble-down.mp4

057 02_clrs-chapter-6-3_instructions.html

060 03_priority-queues-heapify-and-heapsort.mp4

061 04_clrs-chapter-6-4-and-6-5_instructions.html

062 05_bubble-up-bubble-down-insertion-and-deletion-operations_exam.html

066 01_hashtables-introduction.mp4

067 02_clrs-chapter-11-1-and-11-2_instructions.html

068 03_hashtables_exam.html

072 01_introduction-to-randomization-average-case-analysis-recurrences.mp4

076 02_clrs-chapter-7-1_instructions.html

077 03_quicksort-and-partition_exam.html

080 01_detailed-design-of-partitioning-schemes.mp4

081 02_clrs-chapter-7-1_instructions.html

082 03_partition-schemes_exam.html

085 01_analysis-of-quicksort-algorithm.mp4

086 02_clrs-chapter-7-2-7-4_instructions.html

087 03_analysis-of-quicksort_exam.html

090 01_quickselect-algorithm-and-its-applications.mp4

091 02_clrs-chapter-9-1-9-2_instructions.html

092 03_quickselect-algorithm_exam.html

095 01_selecting-hash-functions.mp4

098 02_universal-hash-functions-and-analysis.mp4

099 03_clrs-chapter-11-3_instructions.html

100 04_universal-hash-functions_exam.html

104 01_open-address-hashing.mp4

105 02_clrs-11-4_instructions.html

106 03_open-address-hashing_exam.html

109 01_perfect-hashing-and-cuckoo-hashing.mp4

110 02_clrs-chapter-11-5-perfect-hashing-and-slides-with-scribbles_instructions.html

114 01_bloom-filters-and-analysis.mp4

117 02_bloom-filter-slides_instructions.html

120 01_count-min-sketching-using-hashing.mp4

122 02_count-min-sketches-slides_instructions.html

125 01_string-matching-using-hashing.mp4

126 02_slides-with-scribbles_instructions.html

links.txt

02. Trees and Graphs Basics

001 01_earn-academic-credit-for-your-work_instructions.html

002 02_course-support_instructions.html

003 03_important-prerequisites_instructions.html

004 04_logistics-textbook-and-readings_instructions.html

005 05_important-specialization-information_instructions.html

009 01_binary-search-trees-introduction-and-properties.mp4

010 02_reading-clrs-chapter-12_instructions.html

011 03_basics-of-binary-search-trees_exam.html

014 01_binary-search-trees-insertion-and-deletion.mp4

015 02_clrs-chapter-12-1-12-3_instructions.html

016 03_binary-search-tree-insert-and-delete_exam.html

019 01_red-black-trees-basics.mp4