Torrent Downloads » Other » [FreeCoursesOnline Me] Coursera - Data Structures and Algorithms Specialization
Other
[FreeCoursesOnline Me] Coursera - Data Structures and Algorithms Specialization
Torrent info
Torrent Files List
0. Websites you may like (Size: 6.50 GB) (Files: 1481)
0. Websites you may like
1. Free Premium Accounts at OfficialMrB.com.txt
2. OneHack.us Premium Cracked Accounts-Tutorials-Guides-Articles Community Based Forum.url
3. FTUApps.com Download Cracked Developers Applications For Free.url
1. Algorithmic Toolbox
- PleaseRead -.pdf
Week 1
1. Welcome!.mp4
1. Welcome!.srt
2. Solving the Sum of Two Digits Programming Challenge (screencast).mp4
2. Solving the Sum of Two Digits Programming Challenge (screencast).srt
3. Solving the Maximum Pairwise Product Programming Challenge Improving the Naive Solution, Testing, Debugging.mp4
3. Solving the Maximum Pairwise Product Programming Challenge Improving the Naive Solution, Testing, Debugging.srt
4. Stress Test - Implementation.mp4
4. Stress Test - Implementation.srt
5. Stress Test - Find the Test and Debug.mp4
5. Stress Test - Find the Test and Debug.srt
6. Stress Test - More Testing, Submit and Pass!.mp4
6. Stress Test - More Testing, Submit and Pass!.srt
Week 2
1. Why Study Algorithms.mp4
1. Why Study Algorithms.pdf
1. Why Study Algorithms.srt
10. Big-O Notation.mp4
10. Big-O Notation.pdf
10. Big-O Notation.srt
11. Using Big-O.mp4
11. Using Big-O.pdf
11. Using Big-O.srt
12. Course Overview.mp4
12. Course Overview.pdf
12. Course Overview.srt
2. Coming Up.mp4
2. Coming Up.pdf
2. Coming Up.srt
3. Problem Overview.mp4
3. Problem Overview.pdf
3. Problem Overview.srt
4. Naive Algorithm.mp4
4. Naive Algorithm.pdf
4. Naive Algorithm.srt
5. Efficient Algorithm.mp4
5. Efficient Algorithm.pdf
5. Efficient Algorithm.srt
6. Problem Overview and Naive Algorithm.mp4
6. Problem Overview and Naive Algorithm.pdf
6. Problem Overview and Naive Algorithm.srt
7. Efficient Algorithm.mp4
7. Efficient Algorithm.pdf
7. Efficient Algorithm.srt
8. Computing Runtimes.mp4
8. Computing Runtimes.pdf
8. Computing Runtimes.srt
9. Asymptotic Notation.mp4
9. Asymptotic Notation.pdf
9. Asymptotic Notation.srt
Week 4
1. Intro.mp4
1. Intro.pdf
1. Intro.srt
10. Problem Overview.mp4
10. Problem Overview.pdf
10. Problem Overview.srt
11. Selection Sort.mp4
11. Selection Sort.srt
12. Merge Sort.mp4
12. Merge Sort.srt
13. Lower Bound for Comparison Based Sorting.mp4
13. Lower Bound for Comparison Based Sorting.srt
14. Non-Comparison Based Sorting Algorithms.mp4
14. Non-Comparison Based Sorting Algorithms.srt
15. Overview.mp4
15. Overview.pdf
15. Overview.srt
16. Algorithm.mp4
16. Algorithm.srt
17. Random Pivot.mp4
17. Random Pivot.srt
18. Running Time Analysis (optional).mp4
18. Running Time Analysis (optional).srt
19. Equal Elements.mp4
19. Equal Elements.srt
2. Linear Search.mp4
2. Linear Search.srt
20. Final Remarks.mp4
20. Final Remarks.srt
3. Linear Search.mp4
3. Linear Search.srt
4. Binary Search Runtime.mp4
4. Binary Search Runtime.srt
5. Problem Overview and Naïve Solution.mp4
5. Problem Overview and Naïve Solution.pdf
5. Problem Overview and Naïve Solution.srt
6. Naïve Divide and Conquer Algorithm.mp4
6. Naïve Divide and Conquer Algorithm.srt
7. Faster Divide and Conquer Algorithm.mp4
7. Faster Divide and Conquer Algorithm.srt
8. What is the Master Theorem.mp4
8. What is the Master Theorem.pdf
8. What is the Master Theorem.srt
9. Proof of the Master Theorem.mp4
9. Proof of the Master Theorem.srt
Week 5
1. Change Problem.mp4
1. Change Problem.pdf
1. Change Problem.srt
2. The Alignment Game.mp4
2. The Alignment Game.pdf
2. The Alignment Game.srt
3. Computing Edit Distance.mp4
3. Computing Edit Distance.srt
4. Reconstructing an Optimal Alignment.mp4
4. Reconstructing an Optimal Alignment.srt
Week 6
1. Problem Overview.mp4
1. Problem Overview.pdf
1. Problem Overview.srt
2. Knapsack with Repetitions.mp4
2. Knapsack with Repetitions.srt
3. Knapsack without Repetitions.mp4
3. Knapsack without Repetitions.srt
4. Final Remarks.mp4
4. Final Remarks.srt
5. Problem Overview.mp4
5. Problem Overview.pdf
5. Problem Overview.srt
6. Subproblems.mp4
6. Subproblems.srt
7. Algorithm.mp4
7. Algorithm.srt
8. Reconstructing a Solution.mp4
8. Reconstructing a Solution.srt
toolbox_slides
01_intro_1_1_whystudyalgorithms.pdf
01_intro_1_2_comingup.pdf
01_intro_2_fibonaccinumbers.pdf
01_intro_2_fibonaccinumbers1.pdf
01_intro_2_fibonaccinumbers2.pdf
01_intro_2_fibonaccinumbers3.pdf
01_intro_3_GCD1.pdf
01_intro_3_GCD2.pdf
01_intro_4_1_runtimes.pdf
01_intro_4_2_asymptoticnotation1.pdf
01_intro_4_2_asymptoticnotation2.pdf
01_intro_4_2_asymptoticnotation3.pdf
01_intro_5_courseoverview.pdf
02_greedy_1_intro.pdf
02_greedy_2_groupingchildren.pdf
02_greedy_3_fractionalknapsack.pdf
02_greedy_4_review.pdf
03_divide_and_conquer_1_search_array.pdf
03_divide_and_conquer_2_polynomial_mult.pdf
03_divide_and_conquer_3_master_theorem.pdf
03_divide_and_conquer_4_sorting.pdf
03_divide_and_conquer_5_quicksort.pdf
04_dynamic_programming_1_changeproblem.pdf
04_dynamic_programming_2_editdistance.pdf
04_dynamic_programming_3_knapsack.pdf
04_dynamic_programming_4_maxarith.pdf
week1_programming_challenges
1_sum_of_two_digits
APlusB.cpp
APlusB.cs
APlusB.hs
APlusB.java
APlusB.js
APlusB.kt
APlusB.py
APlusB.rb
APlusB.rs
APlusB.scala
2_maximum_pairwise_product
MaxPairwiseProduct.java
MaxPairwiseProduct.kt
max_pairwise_product.cpp
max_pairwise_product.js
max_pairwise_product.py
max_pairwise_product.rb
week1_programming_challenges.pdf
week2_algorithmic_warmup
1_fibonacci_number
Fibonacci.java
Fibonacci.kt
fibonacci.cpp
fibonacci.hs
fibonacci.js
fibonacci.py
fibonacci.rb
2_last_digit_of_fibonacci_number
FibonacciLastDigit.java
FibonacciLastDigit.kt
fibonacci_last_digit.cpp
fibonacci_last_digit.hs
fibonacci_last_digit.js
fibonacci_last_digit.py
fibonacci_last_digit.rb
3_greatest_common_divisor
GCD.java
GCD.kt
gcd.cpp
gcd.hs
gcd.js
gcd.py
gcd.rb
4_least_common_multiple
LCM.java
LCM.kt
by_learners
lcm.rb
lcm.cpp
lcm.hs
lcm.py
5_fibonacci_number_again
FibonacciHuge.java
FibonacciHuge.kt
fibonacci_huge.cpp
fibonacci_huge.hs
fibonacci_huge.js
fibonacci_huge.py
fibonacci_huge.rb
6_last_digit_of_the_sum_of_fibonacci_numbers
FibonacciSumLastDigit.java
FibonacciSumLastDigit.kt
by_learners
fibonacci_sum_last_digit.rb
fibonacci_sum_last_digit.cpp
fibonacci_sum_last_digit.hs
fibonacci_sum_last_digit.py
7_last_digit_of_the_sum_of_fibonacci_numbers_again
FibonacciPartialSum.java
FibonacciPartialSum.kt
by_learners
fib_partial_sum.rb
fibonacci_partial_sum.cpp
fibonacci_partial_sum.hs
fibonacci_partial_sum.py
8_last_digit_of_the_sum_of_squares_of_fibonacci_numbers
FibonacciSumSquares.java
fibonacci_sum_squares.cpp
fibonacci_sum_squares.py
week2_algorithmic_warmup.pdf
week3_greedy_algorithms
1_money_change
Change.java
Change.kt
by_learners
change.rb
change.cpp
change.hs
change.py
2_maximum_value_of_the_loot
FractionalKnapsack.java
FractionalKnapsack.kt
fractional_knapsack.cpp
fractional_knapsack.hs
fractional_knapsack.js
fractional_knapsack.py
fractional_knapsack.rb
3_car_fueling
CarFueling.java
car_fueling.cpp
car_fueling.py
4_maximum_advertisement_revenue
DotProduct.java
DotProduct.kt
by_learners
dot_rpoduct.rb
dot_product.cpp
dot_product.hs
dot_product.py
5_collecting_signatures
CoveringSegments.java
CoveringSegments.kt
by_learners
covering_segments.rb
covering_segments.cpp
covering_segments.hs
covering_segments.py
6_maximum_number_of_prizes
DifferentSummands.java
DifferentSummands.kt
by_learners
different_summands.rb
different_summands.cpp
different_summands.hs
different_summands.py
7_maximum_salary
LargestNumber.java
LargestNumber.kt
by_learners
largest_number.rb
largest_number.cpp
largest_number.hs
largest_number.py
week3_greedy_algorithms.pdf
week4_divide_and_conquer
1_binary_search
BinarySearch.java
BinarySearch.kt
binary_search.cpp
binary_search.js
binary_search.py
binary_search.rb
2_binary_search_with_duplicates
BinarySearch.java
BinarySearch.kt
binary_search.cpp
binary_search.js
binary_search.py
binary_search.rb
3_majority_element
MajorityElement.java
MajorityElement.kt
by_learners
majority_element.rb
majority_element.cpp
majority_element.py
4_improving_quicksort
Sorting.java
Sorting.kt
by_learners
sorting.rb
sorting.cpp
sorting.py
5_number_of_inversions
Inversions.java
Inversions.kt
by_learners
inversions.rb
inversions.cpp
inversions.py
6_organizing_a_lottery
PointsAndSegments.java
PointsAndSegments.kt
by_learners
points_and_segments.rb
points_and_segments.cpp
points_and_segments.py
7_closest_points
Closest.java
Closest.kt
by_learners
closest.rb
closest.cpp
closest.py
week4_divide_and_conquer.pdf
week5_dynamic_programming1
1_money_change_again
ChangeDP.java
ChangeDP.kt
change_dp.cpp
change_dp.py
2_primitive_calculator
PrimitiveCalculator.java
PrimitiveCalculator.kt
by_learners
primitive_calculator.rb
primitive_calculator.cpp
primitive_calculator.py
3_edit_distance
EditDistance.java
EditDistance.kt
by_learners
edit_distance.rb
edit_distance.cpp
edit_distance.py
4_longest_common_subsequence_of_two_sequences
LCS2.java
LCS2.kt
lcs2.cpp
lcs2.py
5_longest_common_subsequence_of_three_sequences
LCS3.java
LCS3.kt
by_learners
lcs3.rb
lcs3.cpp
lcs3.py
week5_dynamic_programming1.pdf
week6_dynamic_programming2
1_maximum_amount_of_gold
Knapsack.java
Knapsack.kt
by_learners
knapsack.rb
knapsack.cpp
knapsack.py
2_partitioning_souvenirs
Partition3.java
Partition3.kt
partition3.cpp
partition3.py
3_maximum_value_of_an_arithmetic_expression
PlacingParentheses.java
PlacingParentheses.kt
by_learners
placing_parentheses.rb
placing_parentheses.cpp
placing_parentheses.py
week6_dynamic_programming2.pdf
2. Data Structures
Week 1
1. Arrays.mp4
1. Arrays.pdf
1. Arrays.srt
2. Singly-Linked Lists.mp4
2. Singly-Linked Lists.srt
3. Doubly-Linked Lists.mp4
3. Doubly-Linked Lists.srt
4. Stacks.mp4
4. Stacks.pdf
4. Stacks.srt
5. Queues.mp4
5. Queues.srt
6. Trees.mp4
6. Trees.pdf
6. Trees.srt
7. Tree Traversal.mp4
7. Tree Traversal.srt
Week 2
1. Dynamic Arrays.mp4
1. Dynamic Arrays.pdf
1. Dynamic Arrays.srt
2. Amortized Analysis Aggregate Method.mp4
2. Amortized Analysis Aggregate Method.srt
3. Amortized Analysis Banker's Method.mp4
3. Amortized Analysis Banker's Method.srt
4. Amortized Analysis Physicist's Method.mp4
4. Amortized Analysis Physicist's Method.srt
_72d29db2f2280185e66f0a77ada6d61f_05_4_dynamic_arrays_and_amortized_analysis.pdf
Week 3
1. Introduction.mp4
1. Introduction.pdf
1. Introduction.srt
10. Naive Implementations.mp4
10. Naive Implementations.srt
11. Trees for Disjoint Sets.mp4
11. Trees for Disjoint Sets.pdf
11. Trees for Disjoint Sets.srt
12. Union by Rank.mp4
12. Union by Rank.srt
13. Path Compression.mp4
13. Path Compression.srt
14. Analysis (Optional).mp4
14. Analysis (Optional).srt
2. Binary Trees.mp4
2. Binary Trees.pdf
2. Binary Trees.srt
3. Basic Operations.mp4
3. Basic Operations.srt
4. Complete Binary Trees.mp4
4. Complete Binary Trees.srt
5. Pseudocode.mp4
5. Pseudocode.srt
6. Heap Sort.mp4
6. Heap Sort.srt
7. Building a Heap.mp4
7. Building a Heap.srt
8. Final Remarks.mp4
8. Final Remarks.srt
9. Overview.mp4
9. Overview.pdf
9. Overview.srt
Week 4
1. Applications of Hashing.mp4
1. Applications of Hashing.pdf
1. Applications of Hashing.srt
10. Hashing Phone Numbers.mp4
10. Hashing Phone Numbers.srt
11. Hashing Names.mp4
11. Hashing Names.srt
12. Analysis of Polynomial Hashing.mp4
12. Analysis of Polynomial Hashing.srt
13. Find Substring in Text.mp4
13. Find Substring in Text.srt
14. Rabin-Karp's Algorithm.mp4
14. Rabin-Karp's Algorithm.srt
15. Recurrence for Substring Hashes.mp4
15. Recurrence for Substring Hashes.srt
16. Improving Running Time.mp4
16. Improving Running Time.srt
17. Julia's Diary.mp4
17. Julia's Diary.pdf
17. Julia's Diary.srt
18. Julia's Bank.mp4
18. Julia's Bank.srt
19. Blockchain.mp4
19. Blockchain.srt
2. Analysing Service Access Logs.mp4
2. Analysing Service Access Logs.srt
20. Merkle Tree.mp4
20. Merkle Tree.srt
3. Direct Addressing.mp4
3. Direct Addressing.srt
4. Hash Functions.mp4
4. Hash Functions.srt
5. Chaining.mp4
5. Chaining.srt
6. Chaining Implementation and Analysis.mp4
6. Chaining Implementation and Analysis.srt
7. Hash Tables.mp4
7. Hash Tables.srt
8. Phone Book Data Structure.mp4
8. Phone Book Data Structure.pdf
8. Phone Book Data Structure.srt
9. Universal Family.mp4
9. Universal Family.srt
Week 5
1. Introduction.mp4
1. Introduction.pdf
1. Introduction.srt
2. Search Trees.mp4
2. Search Trees.pdf
2. Search Trees.srt
3. Basic Operations.mp4
3. Basic Operations.pdf
3. Basic Operations.srt
4. Balance.mp4
4. Balance.pdf
4. Balance.srt
5. AVL Trees.mp4
5. AVL Trees.pdf
5. AVL Trees.srt
6. AVL Tree Implementation.mp4
6. AVL Tree Implementation.pdf
6. AVL Tree Implementation.srt
7. Split and Merge.mp4
7. Split and Merge.pdf
7. Split and Merge.srt
Week 6
1. Applications.mp4
1. Applications.srt
2. Splay Trees Introduction.mp4
2. Splay Trees Introduction.srt
3. Splay Trees Implementation.mp4
3. Splay Trees Implementation.srt
4. (Optional) Splay Trees Analysis.mp4
4. (Optional) Splay Trees Analysis.srt
week1_basic_data_structures
1_brackets_in_code
check_brackets.cpp
check_brackets.java
check_brackets.py
tests
01
01.a
02
02.a
03
03.a
04
04.a
05
05.a
06
06.a
07
07.a
08
08.a
09
09.a
10
10.a
11
11.a
12
12.a
13
13.a
14
14.a
15
15.a
16
16.a
17
17.a
18
18.a
19
19.a
20
20.a
21
21.a
22
22.a
23
23.a
24
24.a
25
25.a
26
26.a
27
27.a
28
28.a
29
29.a
30
30.a
31
31.a
32
32.a
33
33.a
34
34.a
35
35.a
36
36.a
37
37.a
38
38.a
39
39.a
40
40.a
41
41.a
42
42.a
43
43.a
44
44.a
45
45.a
46
46.a
47
47.a
48
48.a
49
49.a
50
50.a
51
51.a
52
52.a
53
53.a
54
54.a
2_tree_height
tests
01
01.a
02
02.a
03
03.a
04
04.a
05
05.a
06
06.a
07
07.a
08
08.a
09
09.a
10
10.a
11
11.a
12
12.a
13
13.a
14
14.a
15
15.a
16
16.a
17
17.a
18
18.a
19
19.a
20
20.a
21
21.a
22
22.a
23
23.a
24
24.a
tree-height.cpp
tree-height.py
tree_height.java
tree_height.py
3_network_simulation
process_packages.cpp
process_packages.java
process_packages.py
tests
01
01.a
02
02.a
03
03.a
04
04.a
05
05.a
06
06.a
07
07.a
08
08.a
09
09.a
10
10.a
11
11.a
12
12.a
13
13.a
14
14.a
15
15.a
16
16.a
17
17.a
18
18.a
19
19.a
20
20.a
21
21.a
22
22.a
4_stack_with_max
StackWithMax.java
stack_with_max_naive.cpp
stack_with_max_naive.py
5_max_sliding_window
max_sliding_window.cpp
max_sliding_window.py
week1_basic_data_structures.pdf
week2_priority_queues_and_disjoint_sets
1_make_heap
BuildHeap.java
build_heap.cpp
build_heap.py
tests
04
04.a
2_job_queue
JobQueue.java
job_queue.cpp
job_queue.py
tests
02
02.a
08
08.a
3_merging_tables
MergingTables.java
merging_tables.cpp
merging_tables.py
tests
116
116.a
week2_priority_queues_and_disjoint_sets.pdf
week3_hash_tables
1_phone_book
PhoneBook.java
phone_book.cpp
phone_book.py
2_hash_chains
HashChains.java
hash_chains.cpp
hash_chains.py
tests
06
06.a
3_hash_substring
HashSubstring.java
hash_substring.cpp
hash_substring.py
tests
06
06.a
4_substring_equality
substring_equality.cpp
substring_equality.java
substring_equality.kt
substring_equality.py
5_longest_common_substring
common_substring.cpp
common_substring.java
common_substring.kt
common_substring.py
6_matching_with_mismatches
matching_with_mismatches.cpp
matching_with_mismatches.java
matching_with_mismatches.kt
matching_with_mismatches.py
week3_hash_tables.pdf
week4_binary_search_trees
1_tree_traversals
tests
21
21.a
tree-orders.cpp
tree-orders.py
tree_orders.java
2_is_bst
is_bst.cpp
is_bst.java
is_bst.py
3_is_bst_advanced
is_bst_hard.cpp
is_bst_hard.java
is_bst_hard.py
4_set_range_sum
SetRangeSum.java
set_range_sum.cpp
set_range_sum.py
tests
01
01.a
04
04.a
05
05.a
20
20.a
36
36.a
83
83.a
5_rope
RopeProblem.java
rope.cpp
rope.py
week4_binary_search_trees.pdf
3. Algorithms on Graphs
Week 1
1. Graph Basics.mp4
1. Graph Basics.srt
2. Representing Graphs.mp4
2. Representing Graphs.srt
3. Exploring Graphs.mp4
3. Exploring Graphs.srt
4. Connectivity.mp4
4. Connectivity.srt
5. Previsit and Postvisit Orderings.mp4
5. Previsit and Postvisit Orderings.srt
Week 2
1. Directed Acyclic Graphs.mp4
1. Directed Acyclic Graphs.srt
2. Topological Sort.mp4
2. Topological Sort.srt
3. Strongly Connected Components.mp4
3. Strongly Connected Components.srt
4. Computing Strongly Connected Components.mp4
4. Computing Strongly Connected Components.srt
Week 3
1. Applications.mp4
1. Applications.srt
2. Paths and Distances.mp4
2. Paths and Distances.srt
3. Breadth-First Search.mp4
3. Breadth-First Search.srt
4. Breadth-First Search (continued).mp4
4. Breadth-First Search (continued).srt
5. Implementation and Analysis.mp4
5. Implementation and Analysis.srt
6. BFS Properties.mp4
6. BFS Properties.srt
7. Correct Distances.mp4
7. Correct Distances.srt
8. Shortest Path Tree.mp4
8. Shortest Path Tree.srt
Week 4
1. Fastest Route.mp4
1. Fastest Route.srt
10. Bellman-Ford Algorithm.mp4
10. Bellman-Ford Algorithm.srt
11. Proof of Correctness.mp4
11. Proof of Correctness.srt
12. Negative Cycles.mp4
12. Negative Cycles.srt
13. Infinite Arbitrage.mp4
13. Infinite Arbitrage.srt
2. Naive Algorithm.mp4
2. Naive Algorithm.srt
3. Dijkstra's Algorithm.mp4
3. Dijkstra's Algorithm.srt
4. Dijkstra Example.mp4
4. Dijkstra Example.srt
5. Implementation.mp4
5. Implementation.srt
6. Proof of Correctness.mp4
6. Proof of Correctness.srt
7. Analysis.mp4
7. Analysis.srt
8. Currency Exchange.mp4
8. Currency Exchange.srt
9. Reduction to Shortest Paths.mp4
9. Reduction to Shortest Paths.srt
Week 5
1. Building a Network.mp4
1. Building a Network.srt
2. Greedy Algorithms.mp4
2. Greedy Algorithms.srt
3. Cut Property.mp4
3. Cut Property.srt
4. Kruskal's Algorithm.mp4
4. Kruskal's Algorithm.srt
5. Prim's Algorithm.mp4
5. Prim's Algorithm.srt
Week 6
1. Programming Project Introduction.mp4
1. Programming Project Introduction.srt
10. Potential Functions and Lower Bounds.mp4
10. Potential Functions and Lower Bounds.srt
11. Landmarks (Optional).mp4
11. Landmarks (Optional).srt
12. Highway Hierarchies and Node Importance.mp4
12. Highway Hierarchies and Node Importance.srt
13. Preprocessing.mp4
13. Preprocessing.srt
14. Witness Search.mp4
14. Witness Search.srt
15. Query.mp4
15. Query.srt
16. Proof of Correctness.mp4
16. Proof of Correctness.srt
17. Node Ordering.mp4
17. Node Ordering.srt
2. Bidirectional Search.mp4
2. Bidirectional Search.srt
3. Six Handshakes.mp4
3. Six Handshakes.srt
4. Bidirectional Dijkstra.mp4
4. Bidirectional Dijkstra.srt
5. Finding Shortest Path after Meeting in the Middle.mp4
5. Finding Shortest Path after Meeting in the Middle.srt
6. Computing the Distance.mp4
6. Computing the Distance.srt
7. A Algorithm.mp4
7. A Algorithm.srt
8. Performance of A.mp4
8. Performance of A.srt
9. Bidirectional A.mp4
9. Bidirectional A.srt
4. Algorithms on Strings
Week 1
1. Welcome.mp4
1. Welcome.srt
2. From Genome Sequencing to Pattern Matching.mp4
2. From Genome Sequencing to Pattern Matching.srt
3. Brute Force Approach to Pattern Matching.mp4
3. Brute Force Approach to Pattern Matching.srt
4. Herding Patterns into Trie.mp4
4. Herding Patterns into Trie.srt
5. Herding Text into Suffix Trie.mp4
5. Herding Text into Suffix Trie.srt
6. Suffix Trees.mp4
6. Suffix Trees.srt
_232418a57c83ad19339c24a22a56b9b1_Programming-Assignment-1.pdf
non_shared_substring
NonSharedSubstring.java
non_shared_substring.cpp
non_shared_substring.py
sample_tests
sample1
sample1.a
sample2
sample2.a
sample3
sample3.a
sample4
sample4.a
suffix_tree
SuffixTree.java
sample_tests
sample1
sample1.a
sample2
sample2.a
sample3
sample3.a
suffix_tree.cpp
suffix_tree.py
trie
Trie.java
sample_tests
sample1
sample1.a
sample2
sample2.a
sample3
sample3.a
starters_by_learners
trie.cs
trie.cpp
trie.py
trie_matching
TrieMatching.java
sample_tests
sample1
sample1.a
sample2
sample2.a
sample3
sample3.a
starters_by_learners
trie_matching.cs
trie_matching.cpp
trie_matching.py
trie_matching_extended
TrieMatchingExtended.java
sample_tests
sample1
sample1.a
sample2
sample2.a
trie_matching_extended.cpp
trie_matching_extended.py
Week 2
1. Burrows-Wheeler Transform.mp4
1. Burrows-Wheeler Transform.srt
2. Inverting Burrows-Wheeler Transform.mp4
2. Inverting Burrows-Wheeler Transform.srt
3. Using BWT for Pattern Matching.mp4
3. Using BWT for Pattern Matching.srt
4. Suffix Arrays.mp4
4. Suffix Arrays.srt
5. Approximate Pattern Matching.mp4
5. Approximate Pattern Matching.srt
_332adc34d317de0b0cc790581a52df01_Programming-Assignment-2.pdf
bwmatching
BWMatching.java
bwmatching.cpp
bwmatching.py
sample_tests
sample1
sample1.a
sample2
sample2.a
sample3
sample3.a
bwt
BurrowsWheelerTransform.java
bwt.cpp
bwt.py
sample_tests
sample1
sample1.a
sample2
sample2.a
sample3
sample3.a
bwtinverse
InverseBWT.java
bwtinverse.cpp
bwtinverse.py
sample_tests
sample1
sample1.a
sample2
sample2.a
suffix_array
SuffixArray.java
sample_tests
sample1
sample1.a
sample2
sample2.a
sample3
sample3.a
suffix_array.cpp
suffix_array.py
Week 3
1. Exact Pattern Matching.mp4
1. Exact Pattern Matching.srt
2. Safe Shift.mp4
2. Safe Shift.srt
3. Prefix Function.mp4
3. Prefix Function.srt
4. Computing Prefix Function.mp4
4. Computing Prefix Function.srt
5. Knuth-Morris-Pratt Algorithm.mp4
5. Knuth-Morris-Pratt Algorithm.srt
_b57e7abe8a58b4b8732d6965d865ce70_14_algorithmic_challenges_1_knuth_morris_pratt.pdf
Week 4
1. Suffix Array.mp4
1. Suffix Array.srt
10. Computing the LCP Array.mp4
10. Computing the LCP Array.srt
11. Construct Suffix Tree from Suffix Array and LCP Array.mp4
11. Construct Suffix Tree from Suffix Array and LCP Array.srt
2. General Strategy.mp4
2. General Strategy.srt
3. Initialization.mp4
3. Initialization.srt
4. Sort Doubled Cyclic Shifts.mp4
4. Sort Doubled Cyclic Shifts.srt
5. SortDouble Implementation.mp4
5. SortDouble Implementation.srt
6. Updating Classes.mp4
6. Updating Classes.srt
7. Full Algorithm.mp4
7. Full Algorithm.srt
8. Suffix Array and Suffix Tree.mp4
8. Suffix Array and Suffix Tree.srt
9. LCP Array.mp4
9. LCP Array.srt
YY4a1RUGEeiphxJNEByLzA_6207de30150611e89226412850c98e76_14_algorithmic_challenges_3_from_suffix_array_to_suffix_tree.pdf
_120e875d62d8c0bc18a11e21fd818465_Programming-Assignment-3.pdf
kmp
KnuthMorrisPratt.java
kmp.cpp
kmp.py
sample_tests
sample1
sample1.a
sample2
sample2.a
sample3
sample3.a
suffix_array_long
SuffixArrayLong.java
sample_tests
sample1
sample1.a
sample2
sample2.a
sample3
sample3.a
sample4
sample4.a
suffix_array_long.cpp
suffix_array_long.py
suffix_array_matching
SuffixArrayMatching.java
sample_tests
sample1
sample1.a
sample2
sample2.a
sample3
sample3.a
suffix_array_matching.cpp
suffix_array_matching.py
suffix_tree_from_array
SuffixTreeFromArray.java
sample_tests
sample1
sample1.a
sample2
sample2.a
sample3
sample3.a
suffix_tree_from_array.cpp
suffix_tree_from_array.py
5. Advanced Algorithms and Complexity
Week 1
1. Introduction.mp4
1. Introduction.srt
2. Network Flows.mp4
2. Network Flows.srt
3. Residual Networks.mp4
3. Residual Networks.srt
4. Maxflow-Mincut.mp4
4. Maxflow-Mincut.srt
5. The Ford–Fulkerson Algorithm.mp4
5. The Ford–Fulkerson Algorithm.srt
6. Slow Example.mp4
6. Slow Example.srt
7. The Edmonds–Karp Algorithm.mp4
7. The Edmonds–Karp Algorithm.srt
8. Bipartite Matching.mp4
8. Bipartite Matching.srt
9. Image Segmentation.mp4
9. Image Segmentation.srt
_7e0f33e77d6b81677a7d725ed0ae9911_15_flows_1_transporting_goods.pdf
_7e0f33e77d6b81677a7d725ed0ae9911_15_flows_2_network_flows.pdf
_7e0f33e77d6b81677a7d725ed0ae9911_15_flows_3_residual_networks.pdf
_7e0f33e77d6b81677a7d725ed0ae9911_15_flows_4_maxflow_mincut.pdf
_7e0f33e77d6b81677a7d725ed0ae9911_15_flows_5_ford_fulkerson.pdf
_7e0f33e77d6b81677a7d725ed0ae9911_15_flows_6_example.pdf
_7e0f33e77d6b81677a7d725ed0ae9911_15_flows_7_edmonds_karp.pdf
_7e0f33e77d6b81677a7d725ed0ae9911_15_flows_8_bipartite_matching.pdf
_7e0f33e77d6b81677a7d725ed0ae9911_15_flows_9_image_segmentation.pdf
_b421923226f8319c58d2f9d039973d64_Programming-Assignment-1.pdf
airline_crews
AirlineCrews.java
airline_crews.cpp
airline_crews.py
tests
01
01.a
02
02.a
03
03.a
04
04.a
05
05.a
06
06.a
07
07.a
08
08.a
09
09.a
10
10.a
11
11.a
12
12.a
13
13.a
14
14.a
15
15.a
16
16.a
17
17.a
18
18.a
19
19.a
20
20.a
21
21.a
22
22.a
23
23.a
24
24.a
25
25.a
26
26.a
27
27.a
28
28.a
29
29.a
30
30.a
31
31.a
evacuation
Evacuation.java
evacuation.cpp
evacuation.py
tests
01
01.a
02
02.a
03
03.a
04
04.a
05
05.a
06
06.a
07
07.a
08
08.a
09
09.a
10
10.a
11
11.a
12
12.a
13
13.a
14
14.a
15
15.a
16
16.a
17
17.a
18
18.a
19
19.a
20
20.a
21
21.a
22
22.a
23
23.a
24
24.a
25
25.a
26
26.a
27
27.a
28
28.a
29
29.a
30
30.a
31
31.a
32
32.a
33
33.a
34
34.a
35
35.a
36
36.a
stock_charts
StockCharts.java
stock_charts.cpp
stock_charts.py
tests
01
01.a
02
02.a
03
03.a
04
04.a
05
05.a
06
06.a
07
07.a
08
08.a
09
09.a
10
10.a
11
11.a
12
12.a
13
13.a
14
14.a
15
15.a
16
16.a
17
17.a
18
18.a
19
19.a
20
20.a
21
21.a
22
22.a
23
23.a
24
24.a
25
25.a
26
26.a
27
27.a
28
28.a
29
29.a
30
30.a
31
31.a
32
32.a
33
33.a
34
34.a
35
35.a
36
36.a
Week 2
1. Introduction.mp4
1. Introduction.srt
10. (Optional) The Ellipsoid Algorithm.mp4
10. (Optional) The Ellipsoid Algorithm.srt
2. Linear Programming.mp4
2. Linear Programming.srt
3. Linear Algebra Method of Substitution.mp4
3. Linear Algebra Method of Substitution.srt
4. Linear Algebra Gaussian Elimination.mp4
4. Linear Algebra Gaussian Elimination.srt
5. Convexity.mp4
5. Convexity.srt
6. Duality.mp4
6. Duality.srt
7. (Optional) Duality Proofs.mp4
7. (Optional) Duality Proofs.srt
8. Linear Programming Formulations.mp4
8. Linear Programming Formulations.srt
9. The Simplex Algorithm.mp4
9. The Simplex Algorithm.srt
YDVyejmMEei2YRIlkZUGUg_60f31c30398c11e89865dd18147b3b43_Programming-Assignment-2.pdf
_340bad8411ad88ec6ef85b199d4a12ae_16_LP_1_1_introduction.pdf
_340bad8411ad88ec6ef85b199d4a12ae_16_LP_1_2_LP.pdf
_340bad8411ad88ec6ef85b199d4a12ae_16_LP_2_1_Substitution.pdf
_340bad8411ad88ec6ef85b199d4a12ae_16_LP_2_2_GaussianElimination.pdf
_340bad8411ad88ec6ef85b199d4a12ae_16_LP_2_GaussianElimination.pdf
_340bad8411ad88ec6ef85b199d4a12ae_16_LP_3_Convexity.pdf
_340bad8411ad88ec6ef85b199d4a12ae_16_LP_4_1_Duality.pdf
_340bad8411ad88ec6ef85b199d4a12ae_16_LP_4_2_DualityProofs.pdf
_340bad8411ad88ec6ef85b199d4a12ae_16_LP_5_Formulations.pdf
_340bad8411ad88ec6ef85b199d4a12ae_16_LP_6_simplex.pdf
_340bad8411ad88ec6ef85b199d4a12ae_16_LP_7_ellipsoid.pdf
ad_allocation
AdAllocation.java
ad_allocation.cpp
ad_allocation.py
tests
11
11.a
12
12.a
52
52.a
55
55.a
65
65.a
diet
Diet.java
diet.cpp
diet.py
tests
01
01.a
02
02.a
03
03.a
04
04.a
05
05.a
06
06.a
36
36.a
43
43.a
energy_values
EnergyValues.java
energy_values.cpp
energy_values.py
Week 3
1. Brute Force Search.mp4
1. Brute Force Search.srt
10. Showing NP-completeness.mp4
10. Showing NP-completeness.srt
11. Independent Set to Vertex Cover.mp4
11. Independent Set to Vertex Cover.srt
12. 3-SAT to Independent Set.mp4
12. 3-SAT to Independent Set.srt
13. SAT to 3-SAT.mp4
13. SAT to 3-SAT.srt
14. Circuit SAT to SAT.mp4
14. Circuit SAT to SAT.srt
15. All of NP to Circuit SAT.mp4
15. All of NP to Circuit SAT.srt
16. Using SAT-solvers.mp4
16. Using SAT-solvers.srt
2. Search Problems.mp4
2. Search Problems.srt
3. Traveling Salesman Problem.mp4
3. Traveling Salesman Problem.srt
4. Hamiltonian Cycle Problem.mp4
4. Hamiltonian Cycle Problem.srt
5. Longest Path Problem.mp4
5. Longest Path Problem.srt
6. Integer Linear Programming Problem.mp4
6. Integer Linear Programming Problem.srt
7. Independent Set Problem.mp4
7. Independent Set Problem.srt
8. P and NP.mp4
8. P and NP.srt
9. Reductions.mp4
9. Reductions.srt
budget_allocation
BudgetAllocation.java
budget_allocation.cpp
budget_allocation.py
cGbCsxWPEemU7w7-EFnPcg_70c8df70158f11e98c9e2961410808ba_Programming-Assignment-3.pdf
cleaning_apartment
CleaningApartment.java
cleaning_apartment.cpp
cleaning_apartment.py
gsm_network
GSMNetwork.java
gsm_network.cpp
gsm_network.py
Week 4
1. Introduction.mp4
1. Introduction.srt
10. Metric TSP.mp4
10. Metric TSP.srt
11. TSP Local Search.mp4
11. TSP Local Search.srt
2. 2-SAT.mp4
2. 2-SAT.srt
3. 2-SAT Algorithm.mp4
3. 2-SAT Algorithm.srt
4. Independent Sets in Trees.mp4
4. Independent Sets in Trees.srt
5. 3-SAT Backtracking.mp4
5. 3-SAT Backtracking.srt
6. 3-SAT Local Search.mp4
6. 3-SAT Local Search.srt
7. TSP Dynamic Programming.mp4
7. TSP Dynamic Programming.srt
8. TSP Branch and Bound.mp4
8. TSP Branch and Bound.srt
9. Vertex Cover.mp4
9. Vertex Cover.srt
_6b7344c41a872c3c77cebba06f3ebb51_18_coping_with_np_completeness_2_special_cases.pdf
_c2cbb71f70dc4e1ac82e98896eedda88_18_coping_with_np_completeness_1_introduction.pdf
_c2cbb71f70dc4e1ac82e98896eedda88_18_coping_with_np_completeness_3_exact_algorithms.pdf
_c2cbb71f70dc4e1ac82e98896eedda88_18_coping_with_np_completeness_4_approximation_algorithms.pdf
circuit_design
CircuitDesign.java
circuit_design.cpp
circuit_design.py
pajHD6EJEemRkw79YeZlmg_fdce28b486dd4126b96241b2c0a7655b_Programming-Assignment-4.pdf
plan_party
PlanParty.java
plan_party.cpp
plan_party.py
reschedule_exams
RescheduleExams.java
reschedule_exams.cpp
reschedule_exams.py
school_bus
SchoolBus.java
school_bus.cpp
school_bus.py
Week 5
1. Introduction.mp4
1. Introduction.srt
10. Proofs 2.mp4
10. Proofs 2.srt
2. Heavy Hitters Problem.mp4
2. Heavy Hitters Problem.srt
3. Reduction 1.mp4
3. Reduction 1.srt
4. Reduction 2.mp4
4. Reduction 2.srt
5. Basic Estimate 1.mp4
5. Basic Estimate 1.srt
6. Basic Estimate 2.mp4
6. Basic Estimate 2.srt
7. Final Algorithm 1.mp4
7. Final Algorithm 1.srt
8. Final Algorithm 2.mp4
8. Final Algorithm 2.srt
9. Proofs 1.mp4
9. Proofs 1.srt
_62be31e124aadfcfb9d5a53a3d6fd27a_ProgrammingAssignment5.pdf
cpp_naive.cpp
java_naive.java
py_naive.py
6. Genome Assembly Programming Challenge
Week 1
1. 2011 European E. coli outbreak.mp4
1. 2011 European E. coli outbreak.srt
2. Assembling phage genome.mp4
2. Assembling phage genome.srt
_286667e9d63065155e489921cf80602d_ProgrammingAssignment1.pdf
Week 2
1. DNA arrays.mp4
1. DNA arrays.srt
2. Assembling genomes from k-mers.mp4
2. Assembling genomes from k-mers.srt
3. De Bruijn graphs.mp4
3. De Bruijn graphs.srt
4. Bridges of Königsberg and universal strings.mp4
4. Bridges of Königsberg and universal strings.srt
5. Euler theorem.mp4
5. Euler theorem.srt
_eef54e2a950f8a5fecba5bf23e656dbf_ProgrammingAssignment2.pdf
Week 3
1. Splitting the genome into contigs.mp4
1. Splitting the genome into contigs.srt
2. From reads to read-pairs.mp4
2. From reads to read-pairs.srt
3. Genome assembly faces real sequencing data.mp4
3. Genome assembly faces real sequencing data.srt
KD7TTY_2R1e-002P9rdXqw_d2a08ff5428f4043b63ab0f12b48ae81_ProgrammingAssignment3.pdf
_c1223813227b2ecec3e60224e6f070e4_dataset1.txt
_c1223813227b2ecec3e60224e6f070e4_genome1.txt
_8601ac9c05f6275f91bf168291ec49bc_AssemblerChallengeDec10Release.pdf
FreeCoursesOnline.me Download Udacity, Masterclass, Lynda, PHLearn, etc Free.url
Torrent description
Feel free to post any comments about this torrent, including links to Subtitle, samples, screenshots, or any other relevant information, Watch [FreeCoursesOnline Me] Coursera - Data Structures and Algorithms Specialization Online Free Full Movies Like 123Movies, Putlockers, Fmovies, Netflix or Download Direct via Magnet Link in Torrent Details.
