Algorithms Greedy Syllabus Parsed

[
[
"week-1",
[
[
"xvii-two-motivating-applications-week-1",
[
[
"week-1-overview",
{
"html": [
[
"#inmemory#<meta charset=\"utf-8\"/>\n<co-
content>\n \n WELCOME: Welcome to Part 3 of the Algorithms Specialization:
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming! Like the
previous two parts, the course will have four weeks of lectures and assignments,
followed by a final exam. Here are the highlights of the course's first week.\n
\n \n TWO MOTIVATING APPLICATIONS: We begin with a fairly non-technical
discussion of two motivating applications --- distributed shortest-path routing in
the Internet, and sequence alignment --- to build excitement for the tools that
you'll acquire later in this course (and also in Part 4 of the specialization).\n
\n \n INTRODUCTION TO GREEDY ALGORITHMS: The focus of this week and the
next is the greedy algorithm design paradigm. These two non-technical videos
discuss the pros and cons of this paradigm and describe a cool application to the
optimal management of the contents of a cache.\n \n \n A SCHEDULING
APPLICATION: Scheduling problems come up all the time (e.g., how should a shared
resource be allocated?) and greedy algorithms are often useful for them. We'll
discuss a specific success story --- minimizing the weighted sum of completion
times of a bunch of tasks --- in detail. The correctness proof furnishes a
particularly clean example of an \"exchange argument.\"\n \n \n PRIM'S MST
ALGORITHM: The minimum spanning tree (MST) problem, in addition to enjoying several
applications, is a uniquely great problem for the study of greedy algorithms.
Unusually, several different greedy algorithms always compute an optimal solution.
We begin here with the Dijkstra-esque Prim's algorithm. The correctness proof
requires understanding the subtly beautiful structure of cuts in graphs, while its
blazingly fast implementation relies on a deft application of the heap data
structure.\n \n \n VIDEOS AND SLIDES: A reminder that videos can be
streamed or downloaded and watched offline (recommended for commutes, etc.). We are
also providing PDF lecture slides (typed versions of what's written in the lecture
videos), as well as subtitle files (in English and in some cases other languages as
well). And if you find yourself wishing that I spoke more quickly or more slowly,
note that you can adjust the video speed to accommodate your preferred pace.\n
\n \n HOMEWORK #1: The first problem set consists of 5 problems, about
greedy scheduling algorithms and minimum spanning trees. The first programming
assignment asks you to implement some of the algorithms that we've covered, run
them on large inputs, and enter the answer. For the seasoned programmers out there
looking for an additional challenge, try doing the programming assignments in a
programming language that you don't already know!\n \n \n DISCUSSION
FORUMS: Discussion forums play an absolutely crucial role in massive online
courses. If you have trouble understanding a lecture or completing an assignment,
you should turn to the forums for help. After you've mastered the lectures and
assignments for a given week, I hope you'll contribute to the forums and help out
your fellow learners. While I won't have time to carefully monitor the discussion
forums, I'll check in and answer questions whenever I find the time.\n \n \n
SUGGESTED READINGS FOR WEEK 1: Abbreviations in suggested readings refer to the
following textbooks:\n \n <ul bullettype=\"bullets\">\n <li>\n \n CLRS
- Cormen, Leiserson, Rivest, and Stein,\n \n Introdution to Algorithms
(3rd edition)\n \n \n </li>\n <li>\n \n DPV - Dasgupta,
Papadimitriou, and Vazirani,\n \n Algorithms\n \n \n
</li>\n <li>\n \n KT - Kleinberg and Tardos,\n \n Algorithm
Design\n \n \n </li>\n <li>\n \n SW - Sedgewick and
Wayne,\n \n Algorithms (4th edition)\n \n \n </li>\n
</ul>\n <ul bullettype=\"bullets\">\n <li>\n \n CLRS: Chapter 16 (Sections
1 and 2) and Chapter 23\n \n </li>\n <li>\n \n DPV: Sections 5.1.1,
5.1.2, and 5.1.5\n \n </li>\n <li>\n \n KT: Sections 4.1, 4.2, 4.3,
and 4.5\n \n </li>\n <li>\n \n SW: Section 4.3\n \n </li>\n
</ul>\n</co-content>\n<style>\n body {\n padding: 50px 85px 50px
85px;\n}\n\ntable th, table td {\n border: 1px solid #e0e0e0;\n padding: 5px
20px;\n text-align: left;\n}\ninput {\n margin: 10px;\n}\n}\nth {\n font-
weight: bold;\n}\ntd, th {\n display: table-cell;\n vertical-align:
inherit;\n}\nimg {\n height: auto;\n max-width: 100%;\n}\npre {\n display:
block;\n margin: 20px;\n background: #424242;\n color: #fff;\n font-
size: 13px;\n white-space: pre-wrap;\n padding: 9.5px;\n margin: 0 0
10px;\n border: 1px solid #ccc;\n}\n</style>\n<script async=\"\"
src=\"https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-
MML_HTMLorMML\" type=\"text/javascript\">\n</script>\n<script type=\"text/x-
mathjax-config\">\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [ ['$
$','$$'], ['$','$'] ],\n displayMath: [ [\"\\\\[\",\"\\\\]\"] ],\n
processEscapes: true\n }\n });\n</script>\n",
"instructions"
]
]
}
],
[
"overview-resources-and-policies",
{
"pdf": [
[
"https://www.cs.princeton.edu/courses/archive/fall06/cos341/handouts/mathcs.pdf",
"mathcs"
]
],
"html": [
[
content>\n <h3 level=\"3\">\n Course overview\n </h3>\n \n Algorithms are the
heart of computer science, and the subject has countless practical applications as
well as intellectual depth. This specialization is an introduction to algorithms
for learners with at least a little programming experience. The specialization is
rigorous but emphasizes the big picture and conceptual understanding over low-level
implementation and mathematical details. After completing this specialization, you
will have a greater mastery of algorithms than almost anyone without a graduate
degree in the subject.\n\nSpecific topics in Part 3 of the specialization include:
greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes)
and dynamic programming (knapsack, sequence alignment, optimal search trees).\n
\n <h3 level=\"3\">\n Resources\n </h3>\n <ul bullettype=\"bullets\">\n
<li>\n \n Mathematics for Computer Science (by Eric Lehman and Tom
Leighton):\n <a
href=\"https://www.cs.princeton.edu/courses/archive/fall06/cos341/handouts/mathcs.p
df\">\n
https://www.cs.princeton.edu/courses/archive/fall06/cos341/handouts/mathcs.pdf\n
</a>\n \n </li>\n </ul>\n <h3 level=\"3\">\n Course Policies\n </h3>\n
\n Video Lectures\n \n <ul bullettype=\"bullets\">\n <li>\n \n
Lectures will be made available weekly, for a total of four weeks. In a given week,
there will generally be two hours of required material, plus additional optional
material (some review, some advanced topics).\n \n </li>\n <li>\n \n
Below each lecture video there is a PDF of typed versions of the slides.\n \n
</li>\n <li>\n \n You can download the videos of the lectures for offline
viewing.\n \n </li>\n <li>\n \n The video player supports speeding
up and slowing down the pace.\n \n </li>\n </ul>\n \n Weekly Programming
Assignments and Problem Sets\n \n <ul bullettype=\"bullets\">\n <li>\n \n
Each week there will be a new problem set and a new programming assignment.\n
\n </li>\n <li>\n \n For each problem set you are allowed a maximum
of two attempts in a 12-hour period (we'll use the best score).\n \n </li>\n
<li>\n \n For each programming assignment you're allowed a maximum of 10
attempts in a 12-hour period (we'll use the best score).\n \n </li>\n
<li>\n \n For the final exam, you're allowed one attempt per 24 hours.\n
\n </li>\n </ul>\n \n Grading\n \n <ul bullettype=\"bullets\">\n
<li>\n \n To pass a problem set, you must get at least 4 of the 5 questions
correct (80%).\n \n </li>\n <li>\n \n To pass a programming
assignment, you must get all of the answers correct (100%).\n \n </li>\n
<li>\n \n To pass the final exam, you must get at least 70% of the total
points (14 out of 20).\n \n </li>\n <li>\n \n To pass the course,
you must pass all of the problem sets, all of the programming assignments, and the
final exam.\n \n </li>\n </ul>\n \n Theory Problems\n \n <ul
bullettype=\"bullets\">\n <li>\n \n These are totally optional theory
questions (no deadlines or credit given).\n \n </li>\n <li>\n \n We
encourage you to attempt these questions and discuss them in the forums to develop
a deeper understanding of the design and analysis of algorithms.\n \n
</li>\n </ul>\n</co-content>\n<style>\n body {\n padding: 50px 85px 50px
$','$$'], ['$','$'] ],\n displayMath: [ [\"\\\\[\",\"\\\\]\"] ],\n
"instructions"
]
]
}
],
[
"lecture-slides",
{
"html": [
[
content>\n \n See the zip file below (which includes slides for both Part 3 and
Part 4 of the specialization). Also available from the video lectures on a lecture-
by-lecture basis.\n \n <asset assettype=\"generic\" extension=\"zip\"
id=\"eyAtcfjqEeW7ew7OSDCP6w\" name=\"Algo2Typed\">\n </asset>\n \n \n</co-
content>\n<style>\n body {\n padding: 50px 85px 50px 85px;\n}\n\ntable th, table
td {\n border: 1px solid #e0e0e0;\n padding: 5px 20px;\n text-align:
left;\n}\ninput {\n margin: 10px;\n}\n}\nth {\n font-weight: bold;\n}\ntd, th
{\n display: table-cell;\n vertical-align: inherit;\n}\nimg {\n height:
auto;\n max-width: 100%;\n}\npre {\n display: block;\n margin: 20px;\n
background: #424242;\n color: #fff;\n font-size: 13px;\n white-space: pre-
wrap;\n padding: 9.5px;\n margin: 0 0 10px;\n border: 1px solid
#ccc;\n}\n</style>\n<script async=\"\"
$','$$'], ['$','$'] ],\n displayMath: [ [\"\\\\[\",\"\\\\]\"] ],\n
"instructions"
]
],
"zip": [
[
"https://d3c33hcgiwev3.cloudfront.net/_7519487456e5d7bb3bc12dbcf0317160_Algo2Typed.
zip?Expires=1499817600&Signature=E1i0vl3IOj24q3s-
f74Dd6iPhHKDTLNOLUrOR2WkxDU4CY34JaQgkZK51RcJ64D2~1CnmbXYwQCrGRMXRsqjVpVbrJI5I8eZj8C
F~CW9PO6e8dgekppOGq6SA6xTvhIy0eNHI3-Lo5Y142Xs7T~fhCGmOeYVdAkmGU7pen-p8go_&Key-Pair-
Id=APKAJLTNE6QMUY6HBC5A",
"Algo2Typed"
]
]
}
],
[
"application-internet-routing",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/16bEG34jTxamxBt-Ix8WOw?
expiry=1499817600000&hmac=XcfcEruKk23oVMx9btHKmhBQOjHNESm5uqd06YsqCG8&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/16bEG34jTxamxBt-Ix8WOw?
expiry=1499817600000&hmac=I-
f50W7hI7UZQ0E3yD2Xutju6kmuMjO1FfAbY98NOBg&fileExtension=txt",
""
]
],
"mp4": [
[
"https://d3c33hcgiwev3.cloudfront.net/1%20-
%201%20-%20Application%20Internet%20Routing%20%2811%20min
%29.e25e7c10cd3211e59a7f0323c83d8ef3/full/540p/index.mp4?
Expires=1499817600&Signature=hOT7Zjuny7OhA5A6Nlz2XJ4xZdMc3e53um1eCcE9X~5BvyfYtv8rTU
TskXFmkNcNdAsYtwSiQuUi1AcS-bgh6jr6cSl42uUETxfaj7cfZGImzmfylfFrft4R-
FqRZHnMSK1jCq32jb19J6Ohfmg2OR5urJZGgSi8A7VMJX6RwzY_&Key-Pair-
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_0cf737d67d9900440e5b7e7441ff7e4b_algo2-
intro-routing-typed.pdf?
Expires=1499817600&Signature=kvrG00KEwnlNVNx9p0LSxGQ19~w6~kyD9XU9VO~Go06hUWfLKEZPFq
DK9sR5fgXpl5xGS2KmlKglbj-tSEzYXuFKQezDnvrxUXNO8Ocsb32T3syQcVKeoArMJzw7EqK9r2OlJe-
W40sdhuoYqhAkzx~z45tm9VzUWNJR-I9sEMc_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
"algo2-intro-routing-typed"
]
]
}
],
[
"application-sequence-alignment",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/kTQlcWeBQ_S0JXFngRP0ww?
expiry=1499817600000&hmac=4PdboY6bLaRSlMnJQsEGuKRE7IZfNOgeY-
ksbUg5NSU&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/kTQlcWeBQ_S0JXFngRP0ww?
expiry=1499817600000&hmac=L9iFMKei6yCZFMnunJSeVAHoQOHMELCgUcVDh1Xvgy8&fileExtension
=txt",
""
]
],
"mp4": [
[
%202%20-%20Application%20Sequence%20Alignment%20%289%20min
%29.ce97c560cd3211e590ba93556b0ccbbe/full/540p/index.mp4?
Expires=1499817600&Signature=bwlPMFKAnmP5gcfIzV~lxicsrsFZKmvn9p4AA-K1z~N-
~XE4aH0dK~oRt-DF0NVJEYXVFSBLk6kUl3-lFlbBfUOiXGlj-9GV2Nn~Y4eZ-
UG5C1XeqWynEcVBqHQZXwkSc7xNZVu~RTqp95Mrn9Q306n4KKD9nkacmbVOvlNYo1E_&Key-Pair-
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_0cf737d67d9900440e5b7e7441ff7e4b_algo2-
intro-alignment-typed.pdf?
Expires=1499817600&Signature=a5XuBzLlASD21ruZggI7iaXnk8rs51~WBaIJJtdIu4OfxEIpSHc3wV
BMXZRBawRIO-
SFx6Z~1EWoE46v7g0eYO9beQN6Cdydm8UR3mPlSRJUkH~7ColXJQUrE3FjGd1WGcPssWUtuLT-1q2Jwck-
5nK4VUMBX5pmFbPJQJwE7d8_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
"algo2-intro-alignment-typed"
]
]
}
]
]
],
[
"xviii-introduction-to-greedy-algorithms-week-1",
[
[
"introduction-to-greedy-algorithms",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/Ty0harDOQ66tIWqwzmOuqw?
expiry=1499817600000&hmac=QBFE6mC8dgp723ZQpK5m0Lrm9fcxXTYYiAevvtlcp0M&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/Ty0harDOQ66tIWqwzmOuqw?
expiry=1499817600000&hmac=FwZyHI_91diCnaEm_SMAOAp7MsqC8vuaktp31qkIgxw&fileExtension
=txt",
""
]
],
"mp4": [
[
%201%20-%20Introduction%20to%20Greedy%20Algorithms%20%2813%20min
%29.f0374100cd3211e590a77f5aabd5e0c6/full/540p/index.mp4?
Expires=1499817600&Signature=gQxNI1r6Oqsq329coL3YD3et9kwwGFj6NefgmC2h3Wo4CjO4s-
qSVBavP3sfkhMXmnfv0Ablc~5o5fHVg4yqVQAACKRF4OFzLEXVi6MFguRnCyZzasPkHS0mjKNI8SDB8n-
q9Q851SVS4QL7Wk5KGkSuUz5For18Tf9cwpifM6k_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_9b14b1d4204200aeedc9ee367f7c1efc_algo2-
greedy-intro-typed.pdf?
Expires=1499817600&Signature=R4tv1HTLbK3EQVmnqtxaPtjLEC03XqH1kQUw3bcEj9aWAQqqkBTj9U
mY1sTEb8GbHtaJM-MT-YXdJOk9DChIMmTmef48rb2K-wNHalCBbFcNVVjWcVRPSVBu-
9SeYCYvd2cYrigPnN5N7S-baQ~4x9lOOFllj7Jevo~vsMNsCzw_&Key-Pair-
"algo2-greedy-intro-typed"
]
]
}
],
[
"application-optimal-caching",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/KKf7uCQDT_Sn-7gkA6_0hw?
expiry=1499817600000&hmac=lJ7N88tJUg3OaHR20akPeKMAY5ZP_WYR3bJwE739OTA&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/KKf7uCQDT_Sn-7gkA6_0hw?
expiry=1499817600000&hmac=ciY5TquwM5VXrxXLlWOBIW2rqRBn0djmgcHu-
xf2_DE&fileExtension=txt",
""
]
],
"mp4": [
[
%202%20-%20Application%20Optimal%20Caching%20%2811%20min
%29.dfeb8040cd3211e59f57c57b4fab9f16/full/540p/index.mp4?
Expires=1499817600&Signature=EflkKxwJvOC2N3p3Nd2vtR7SorlktPdc13BWKm-H4Tx3C~rONJUWF-
8hhq2oE51fxDIINzfAMHfiUq0ZfREZ3OQP4ugPmV5NtVP0xJiKqGq42Hm9SEgFhDRJ~rVbiIUt8PsX1GuSt
A86vO5kbg0rWql8eCg-nWiKDYpOEo3Ew68_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_9b14b1d4204200aeedc9ee367f7c1efc_algo2-
greedy-fif-typed.pdf?
Expires=1499817600&Signature=aM5J9etkNOs7QH3QrWsW6gdQOd2DF5KU39Ua7RZ6XHDv-
H2IUI8FQm9xPK~z-
HWdAE~Qa84SqaUXiCMdgHK30SjjXLNaoYlY8MusigH61nMEFevBUQql7J5jHksAQdV7ZQNLm1Gzf3vJifHp
zOXKIJjYOTaorF4hfbgrzeOlLS0_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
"algo2-greedy-fif-typed"
]
]
}
]
]
],
[
"xix-a-scheduling-application-week-1",
[
[
"problem-definition",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/98qwNoUTSFqKsDaFEzhamg?
expiry=1499817600000&hmac=D6fNQKT_ukbI8B-
TZBZxkyUQQEz3NEx4SA_PgdTCK9U&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/98qwNoUTSFqKsDaFEzhamg?
expiry=1499817600000&hmac=YMxcvjSw2t-dynnmcieIM9sZ4wshAbjwvCcN43a-
ryc&fileExtension=txt",
""
]
],
"mp4": [
[
%201%20-%20Problem%20Definition%20%286%20min
%29.cc521b20cd3211e5a86743eb252f59ba/full/540p/index.mp4?
Expires=1499817600&Signature=Prkthb-
sb8uaLSpfYjlS0c3rtetWqcrekTHI2qgf5np5LLFnpZBXFspSwu03Xj1u9lIji4~x18PlBTUJWMM3pcs9cD
BiHEscnQNTQj0QDwdQIfsAUcpl7JxWgzo57oCu28IeoBFQk-
ZMUPJoEymMYKv0iRKFVrKmw9pRz5x8tf4_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_7bff8b9a972498d1c481b943a1d26ca0_algo2-
greedy-sched1-typed.pdf?
Expires=1499817600&Signature=RBghMmMzJPK1xkJtXCrZKn7Ru1Kpa3RuSboxQkws-
tFL~f9DbaVDl0wHaW31HaL5i59XXqqY3wuBba48c50pBFveT4Rp6vAdBMDWdRtue11ep8cF7yBboFA~g8-
TKTuqBe2q8Q4zmSKPGgQLPUhOUoD50Tny1cE6Xv6FU1YX7aM_&Key-Pair-
"algo2-greedy-sched1-typed"
]
]
}
],
[
"a-greedy-algorithm",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/UJrd9imtQX6a3fYprXF-8w?
expiry=1499817600000&hmac=8S3XaPqGkyMZxEgpRHgsPcip12XCICYW9TlsfnSbXIw&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/UJrd9imtQX6a3fYprXF-8w?
expiry=1499817600000&hmac=SEjLchokCpEgEYCrsYm_HVeS95Mm-
6mgkyrbnGvTmgs&fileExtension=txt",
""
]
],
"mp4": [
[
%202%20-%20A%20Greedy%20Algorithm%20%2813%20min
%29.e36f28c0cd3211e58b944901e1f880e1/full/540p/index.mp4?
Expires=1499817600&Signature=jvnNQJDtPDIU6GPFTvntcqN1EGffvY2P9YX8wfXEUoZLUM2b3DxwRO
4UcQ8DEGKnUjTVI65vN1Fhdkufbk4IOjT1tY5eRPI0PDr3q6jeRC~vqcc6VsrmdaT5rsaArShPW8A1xSxBr
9QJ~AdbUz8gztytvOexBl8APop0ri3ZXdg_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
Expires=1499817600&Signature=G4vbbMIOGGiL4jKcR0fymhNWQ84slArXosA-
EQ~CvW79YsymF7LmoW1KUZOx-
cyIDpWQfPWn9lAaiEQU7as0T4g1kOKmU5tgzaXXkp34lqtfbRw3fzq~7KbKrqYoeHgSaMtscjgGrFsdWTm9
mLJs86FfiE7rOK2BZKBJ5GVKQY4_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
],
[
"correctness-proof-part-i",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/eJnc57yhT3OZ3Oe8oQ9z7w?
expiry=1499817600000&hmac=FAWTA00rgMiy4CIXyKfNOyP67wv9mvrYYzjjWIms2C4&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/eJnc57yhT3OZ3Oe8oQ9z7w?
expiry=1499817600000&hmac=ad1_nJ8kDxVS9yTZVukrECrwYeZSKLkYysWMA5sS7kw&fileExtension
=txt",
""
]
],
"mp4": [
[
%203%20-%20Correctness%20Proof%20-%20Part%20I%20%287%20min
%29.d095df50cd3211e593c6d74ed40fa08d/full/540p/index.mp4?
Expires=1499817600&Signature=USw4jzgFgv4OVS7X4HA4w0Ke-
BumV6q40GyMZZq4hiSlRio7ssNYxEeQPLo703BRvfJFzzAOmz56UQJUlH8iyrDFEP0-
o~HU4p0UKEAIRaAZFfsJsXVspY2ErUFYEy~l1g094PQznHaI4XHA9BYJZYhMmBOna7MJcvNILEOHNTA_&Ke
y-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
Expires=1499817600&Signature=JgVMjMdBT4fjr~mQqSB5ou0tkCG1fA2eDyZkebJTAK0kXVwCKEDL9~
fvdYc-gnshTA-09-
4q3IX1tuE01h7Uip9Nl8Tt9a2sCkeiUMmh~osHI6P3FDtqioTv83WEzW51hi82eDjFyxxq3um4~D~lcOOJA
kWYQRBlUnROkf5FhKc_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
],
[
"correctness-proof-part-ii",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/q2ZTgZfvTUamU4GX711Gow?
expiry=1499817600000&hmac=znTkJfz0UOjaEB4d5QVqpmgzmPjNFkMACLLejYqknNQ&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/q2ZTgZfvTUamU4GX711Gow?
expiry=1499817600000&hmac=uHuwoNF2RBkfPiEXcJeRtwOk0DQ56qJxKGbcBsML65Y&fileExtension
=txt",
""
]
],
"mp4": [
[
%204%20-%20Correctness%20Proof%20-%20Part%20II%20%285%20min
%29.ca5316d0cd3211e5ab457fc70f4db0b9/full/540p/index.mp4?
Expires=1499817600&Signature=S3-
dzSpiJy5QzmHycPvyZxobv3PHbNYyfmzQvzYpedxNzwWoIMbpam10dEtXgsjBhOV3jE-
HcArrvorh9VqyanxIjkGD585TCKiFwESxQRFcLYdhwOBYENxirWxpByiPtCizIN-
4BO8~j~T~I44XVLMIYT~XMuKII5nN-Sb6M88_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
greedy-sched4-typed.pdf?Expires=1499817600&Signature=CBabmZMKVqIq-
2O1YcTH4DJoeE3GRReGsPZd3uQK6ihRtvIxgglOQwEQYogPoqYlVi4A77~yaLNamonULmWTh4xqTpCzXl99
Vd~GQswxVmjcx8hWvehvnhj-wZhOJwIdF4M1KA622MQ~FJWk07ruEXLBerGI16pcyIV~NjLKy38_&Key-
Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
],
[
"handling-ties-advanced-optional",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/XCeNfQoNQm-njX0KDeJvEw?
expiry=1499817600000&hmac=8l86gm0z6-N3yF7EGC0XH5XSpY3iWo-
WfxpDHj8TPRo&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/XCeNfQoNQm-njX0KDeJvEw?
expiry=1499817600000&hmac=dBFNQsjOAZjPZsr8B-
0aMM9MgKk3bqGG7zSG6Fwscgk&fileExtension=txt",
""
]
],
"mp4": [
[
%205%20-%20Handling%20Ties%20%287%20min
%29.cf15a7f0cd3211e5a86743eb252f59ba/full/540p/index.mp4?
Expires=1499817600&Signature=UkXQirIrTU63jay2xkGjyeTnal36v9HrJHJBC36lxvH1vOpUIXXc0F
nfaTwob~yc7zIet~oE2P2TrhTlMCJeOqYy1krNUPGHMNZYXvsH-
d9wxPkXtbMXXeSpiglHOKbs2dFdJZIwO8NgPoPgK-U7lCYAvREbm3TWDk3YnjJRBkQ_&Key-Pair-
""
]
],
"pdf": [
[
greedy-sched5-typed.pdf?Expires=1499817600&Signature=Hr6gOCA8WF3tI-
RbVaiciB43I647m~fHGl83hhk0gMZJC9MHdSG7mtQ9NzyXK0A4br7utJ4GVT8cMm~Sx6Qg-
Nrex568~FBK9FmaTjSVqxe06CtQPZb80ntcna0ta9reqPvTzbOHP-
gxHKO4KF1emz5IHL7kOKiHkrfca8R2HP0_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
]
]
],
[
"xx-prim-s-minimum-spanning-tree-algorithm-week-1",
[
[
"mst-problem-definition",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/5KVWRbQlQSGlVkW0JTEhYA?
expiry=1499817600000&hmac=7E0gZokqAOSGk09T_z2hflPqzfFtw1NqyCu3spDZFyY&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/5KVWRbQlQSGlVkW0JTEhYA?
expiry=1499817600000&hmac=WEAvCS1lJ5G9MoVPj9SPlsubXQgqJZB8tCwmcZTOGrY&fileExtension
=txt",
""
]
],
"mp4": [
[
%201%20-%20MST%20Problem%20Definition%20%2811%20min
%29.d9fb6ba0cd3211e59a7f0323c83d8ef3/full/540p/index.mp4?
Expires=1499817600&Signature=SDzZBRC3gIJrqqFrMYNjjz-y6NdJBNW9-lRpTAzI-LzasIcf89bM-
fREVmhhmDsYaC9~J~8n3M3YCqO57ZvoFBEsU6PIZAVe6eIpnyAdee9m6Vyf9CQIFg3Mx4y~tYXGEikXBS4t
S3WrMkzNx7qeFa5Pb-cRnrtOpVnNEfgsQjw_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_7102de014b4f954950f38e65ac1321d0_algo2-
greedy-mst1-typed.pdf?
Expires=1499817600&Signature=TTQNX~dx9btGm6l2fYK6Nk8QKV0pBWgniLw4nQYG1DUtZMUcgDFm-
S2sBPgtvw8eKh3ophvIhjf59kDlyifyg06FLjfefHaUjj8zKkzxvkBQc4RXx78iYWsWxrVGgNQ2mZyxQps5
X0kRCjycnpFwh6AdMpL6XWewVF2ibt~FkmU_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
"algo2-greedy-mst1-typed"
]
]
}
],
[
"prims-mst-algorithm",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/2sOG7379STKDhu9-_YkyHg?
expiry=1499817600000&hmac=CPJlo7xkucYN2vWCWzgmAJnsv6tlERGwQGytt8k0c84&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/2sOG7379STKDhu9-_YkyHg?
expiry=1499817600000&hmac=2i0NE-
MeHOSNsThTXmRik6v71P_QYfYSpNZXbXSqtAs&fileExtension=txt",
""
]
],
"mp4": [
[
%202%20-%20Prim.510e6c10d11b11e5b6809746e56cd4e9/full/540p/index.mp4?
Expires=1499817600&Signature=Zg5E6vp0wjsC2x4PuhddT5RD1mJj~OvFD~xv6kYliv6GOlY21aw3HO
gTjwPz7ydDsA0zFKMzQ92a0Qj21B1QKNLm85GEkZAR6~X4SAsoHomCN~JOmBqM04JYl37kiDR~XQwMZhN8a
A3k6IVBodx3aBXZEdRrmoEdnjmA0TeEsiw_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
Expires=1499817600&Signature=KuL72FIGxMW2pcdcWjAfiy8mcVFE91qPcYg5ZSd4LwGvkldJc9pw4P
dUhW3TZK3njwLWVGM0PN5IGQLShd7YeWlta7UDbx8i34uVmxyN6JDviyqEYh4JmYHcZjUGhbSYxZr4lZlut
3iuRal43SFZaKTCICw-cUgDcdDqqlhxdUk_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
],
[
"correctness-proof-i",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/4c3yVlCsSvWN8lZQrBr1ng?
expiry=1499817600000&hmac=3Maz0IQjIquzlAQRxmnQE8fscLrpjgLBu8W7Cii6YxY&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/4c3yVlCsSvWN8lZQrBr1ng?
expiry=1499817600000&hmac=uNUNXFLMoQGO9Jozntdls5OjE7q4M-
YOdOvy9N8ZFMY&fileExtension=txt",
""
]
],
"mp4": [
[
%203%20-%20Correctness%20Proof%20I%20%2816%20min
%29.cd2e4a50cd3211e5a86743eb252f59ba/full/540p/index.mp4?
Expires=1499817600&Signature=dpycgrti5QclJB36PhUKsEUjV9vj0bfzfzohnqXacyo7y2Kx9yD~oc
LLQP5rZs9bamTDGcto3nxHz4aGyUZmu02NXuQloFIafWNYoxmg3vB5vZfVsEQbrvbv0-M3-
30B9ZBfmkc8Ufpjv2duX~pC7APTlYONva6C-r3DAmqSUvM_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
greedy-mst3-typed.pdf?Expires=1499817600&Signature=J-
BiCjvuTSh80R2GljM8itt9zUJ~KcAHdbaJMIVjKnzkaSeGkwbsl5~NEZDXoxjwI8hh8r2CDYy6Y6SBZ0HY3
LYdqpZfAJHUHC4P6oF9WMdpK1vDm7p6nTDiJ14p4r2kZbiHY0I~1eZrmCIqZJVEgbX87cph~qBRfMqMHyE6
LpA_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
],
[
"correctness-proof-ii",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/IuJJWZL_Ql6iSVmS_4JeJg?
expiry=1499817600000&hmac=7PMsSKEVGHsAfB8eP7uPP-
qijeaXvj79vLkj1yt9k0k&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/IuJJWZL_Ql6iSVmS_4JeJg?
expiry=1499817600000&hmac=qgEki4rrDlNutF7Zjw0L_ZI6_17kjfgIWkum78UHhXA&fileExtension
=txt",
""
]
],
"mp4": [
[
%204%20-%20Correctness%20Proof%20II%20%288%20min
%29.c90ed700cd3211e5ab457fc70f4db0b9/full/540p/index.mp4?
Expires=1499817600&Signature=FSrNhxblZDHWVeEEqIauVT4hQqXlANIeJnMFOJ-
a3eDZdiaphvmHwCj3ZgRiohgZHBWRD46PeSbXpNFuJzqDZDwlLDsjU0wNwI0leDn1Syk-
wXwuDZdwrFCgOs2Na4ADZJ2lWoYA5ZZbGDozQV6JralX~XxgBGmwX0FFLFJLaP0_&Key-Pair-
""
]
],
"pdf": [
[
Expires=1499817600&Signature=Y4VXjZVLStmwq9JpboyZSJZZNSMVWelYxvIWNcct0SABdXGUYb7WB2
gBJO0H6FhgmlbjhfRbDfwJOlHQI4DHY-73PON6u5xmNOsw1D-
4KK~EJraISTbWsmHQRud0HWwmDtE5LwzLs-7~PP0qej2nfCvq5dgmYW2rgEJkueWE-LU_&Key-Pair-
]
]
}
],
[
"proof-of-cut-property-advanced-optional",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/qqi29ruzSbSotva7sxm0EA?
expiry=1499817600000&hmac=52qlDlrAapJwX1hR83MxeYox5tNpfcSPEdwiUxMAoTU&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/qqi29ruzSbSotva7sxm0EA?
expiry=1499817600000&hmac=Njx7o_Fzm4beC9ThHaedhWmPhUOsO44nWW73rNVkGIA&fileExtension
=txt",
""
]
],
"mp4": [
[
%205%20-%20Proof%20of%20Cut%20Property%20%2812%20min
%29.d378b3f0cd3211e58b944901e1f880e1/full/540p/index.mp4?
Expires=1499817600&Signature=aTFN7dy054oD9HKPbxu5gWvZloBids~qc76ue91ux4207zwoK1GjG-
9GqnZpf4BdW7xe9RePN~zkJJUeyp5RlyTPub8f0ChskE6VdmiRLS0~iqpbqMFfVzRmXru6qX28rrNybHcIK
3pROQkkpm5l4u7rSalh93pWncv8scSWt5A_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
Expires=1499817600&Signature=IbpmBbmAtlrsawk0LTFHPMFo2WgBOzrzc-
H3oDOmUY0MR01n1jkf2JU8EeY-S0LSJsZMH3wAZ6TSpN-
omHFhDJtYfyBz1r7anxg9OUHaVQ6OP2ZCL6aqb9wJ7AGqwvlcREWOhHDHqO2W3nvoJDsG6xJjx-WvQ-w-
QA0CCzXf7ow_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
],
[
"fast-implementation-i",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/IVlLD3fISASZSw93yGgELw?
expiry=1499817600000&hmac=_8GzCYDxkEm3RAKPSn4izb4xMNkPHvoyDNStkB8gOe8&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/IVlLD3fISASZSw93yGgELw?
expiry=1499817600000&hmac=EhAxxBe9DK9hX_wddyeli5J41bsi6JJFATgWAWs0YLo&fileExtension
=txt",
""
]
],
"mp4": [
[
%206%20-%20Fast%20Implementation%20I%20%2815%20min
%29.dad529d0cd3211e5ab457fc70f4db0b9/full/540p/index.mp4?
Expires=1499817600&Signature=erLhMaKH8imyi-1MUwsSxM0PE-lI92~y~gePTuls5-
abF5eZ74Arb7CQ77h~3dUawGynYnYX35lhI9gmiQnLY2dmtNwVvMli9sK8-
BzYR9ugjB0vEh1YPjpUuTdrVWZ6zx2Cm5AvI4HgRE935feYSKBbQgKfY3iHwAJv10LlJoo_&Key-Pair-
""
]
],
"pdf": [
[
greedy-mst6-typed.pdf?Expires=1499817600&Signature=jm6XygLxPjN40OzKaJcD~kJU7-
BVDQiDz5Osz8zeLQEC7BC1DcnQ243HApVNJoLLW4QMc6LqpeGi4mPoQtzFdY-uFtudK9d~z6X2p-
QZ~Lwn4drmcyZRp3-phCaBNSVPbmMCee0JN-~21CN3ehaZq38RF8Hu5D75qbA~SDtgRAU_&Key-Pair-
]
]
}
],
[
"fast-implementation-ii",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/nIr4FUprS1OK-BVKaxtTBQ?
expiry=1499817600000&hmac=-Sega8L5IADfWn-
fP_VgLzswtBzcZomnBnTVvj0GxFo&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/nIr4FUprS1OK-BVKaxtTBQ?
expiry=1499817600000&hmac=xbEI0gvOsIldMTztBzDEaAPjxojwFmnYLrN5vw9akOI&fileExtension
=txt",
""
]
],
"mp4": [
[
%207%20-%20Fast%20Implementation%20II%20%2810%20min
%29.d60663b0cd3211e593c6d74ed40fa08d/full/540p/index.mp4?
Expires=1499817600&Signature=k58o7O40A9AoOCbHYTyDbiLsl4Z1Cn7Io1ohqGVHdmzDwtriky40ZH
1NmcpUkT4yQNda5GhfQm5xQUfrOKfuIPefxMxZ3DmAWp04-
rCaIgK9GcY1rbOjfKcC2rmUZC1qIgszj4TqF3ru49T44ZtSu4TW5DBE4WVpj~20Pqe~gtM_&Key-Pair-
""
]
],
"pdf": [
[
greedy-mst6-typed.pdf?Expires=1499817600&Signature=jm6XygLxPjN40OzKaJcD~kJU7-
BVDQiDz5Osz8zeLQEC7BC1DcnQ243HApVNJoLLW4QMc6LqpeGi4mPoQtzFdY-uFtudK9d~z6X2p-
QZ~Lwn4drmcyZRp3-phCaBNSVPbmMCee0JN-~21CN3ehaZq38RF8Hu5D75qbA~SDtgRAU_&Key-Pair-
]
]
}
]
]
],
[
"problem-set-1",
[
[
"optional-theory-problems-week-1",
{
"html": [
[
content>\n \n The following problems are for those of you looking to challenge
yourself beyond the required problem sets and programming questions. They are
completely optional and will not be graded. While they vary in level, many are
pretty challenging, and we strongly encourage you to discuss ideas and approaches
with your fellow students on the \"Theory Problems\" discussion forum.\n \n <ol
bullettype=\"numbers\">\n <li>\n \n Consider a connected
undirected graph $$G$$ with not necessarily distinct edge costs. Consider two
different minimum-cost spanning trees of $$G$$, $$T$$ and $$T'$$. Is there
necessarily a sequence of minimum-cost spanning trees $$T = T_0, T_1, T_2, \\ldots,
T_r = T'$$ with the property that each consecutive pair $$T_i,T_{i+1}$$ of MSTs
differ by only a single edge swap? Prove the statement or exhibit a
counterexample.\n \n </li>\n <li>\n \n Consider the following
algorithm. The input is a connected undirected graph with edge costs (distinct, if
you prefer). The algorithm proceeds in iterations. If the current graph is a
spanning tree, then the algorithm halts. Otherwise, it picks an arbitrary cycle of
the current graph and deletes the most expensive edge on the cycle. Is this
algorithm guaranteed to compute a minimum-cost spanning tree? Prove it or exhibit a
counterexample.\n \n </li>\n <li>\n \n Consider
the following algorithm. The input is a connected undirected graph with edge costs
(distinct, if you prefer). The algorithm proceeds in phases. Each phase adds some
edges to a tree-so-far and reduces the number of vertices in the graph (when there
is only 1 vertex left, the MST is just the empty set). In a phase, we identify the
cheapest edge $$e_v$$ incident on each vertex $$v$$ of the current graph. Let $$F =
\\{ e_v \\}$$ be the collection of all such edges in the current phase. Obtain a
new (smaller) graph by contracting all of the edges in $$F$$ --- so that each
connected component of $$F$$ becomes a single vertex in the new graph ---
discarding any self-loops that result. Let $$T$$ denote the union of all edges
that ever get contracted in a phase of this algorithm. Is $$T$$ guaranteed to be a
minimum-cost spanning tree? Prove it or exhibit a counterexample.\n \n
</li>\n </ol>\n</co-content>\n<style>\n body {\n padding: 50px 85px 50px
$','$$'], ['$','$'] ],\n displayMath: [ [\"\\\\[\",\"\\\\]\"] ],\n
"instructions"
]
]
}
]
]
]
]
],
[
"week-2",
[
[
"xxi-kruskal-s-minimum-spanning-tree-algorithm-week-2",
[
[
"week-2-overview",
{
"html": [
[
content>\n \n KRUSKAL'S MST ALGORITHM: Last week we covered Prim's MST
algorithm and a blazingly fast implementation of it. There are several reasons for
studying a second greedy MST algorithm, due to Kruskal. First, it's a beautiful
algorithm, worthy of a greatest hits compilation. Second, to obtain a super-fast
implementation of it, we'll need to learn about the simple but fundamental \"Union-
Find\" data structure. The third reason is covered in the next section...\n \n
\n CLUSTERING: Clustering is an important form of unsupervised learning (i.e.,
extracting patterns from unlabeled data). These two videos discuss how Kruskal's
MST algorithm suggests flexible and useful greedy approaches to clustering
problems.\n \n \n UNION-FIND LECTURES: This is purely optional material
about advanced implementations and analysis of the union-find data structure. For
those of you looking for some seriously next-level (but beautiful) material, check
it out when you get a chance.\n \n \n HOMEWORK #2: The second problem set
is all about MSTs. The second programming assignment asks you to implement the
greedy clustering algorithm from lecture. For part (a), a straightforward
implementation should suffice. Part (b) involves a graph that is likely too big to
fit in your computer's memory, so answering this part might take some ingenuity.\n
\n \n SUGGESTED READINGS FOR WEEK 2:\n \n <ul bullettype=\"bullets\">\n
<li>\n \n CLRS Chapter 21 and Chapter 23 (Section 2)\n \n </li>\n
<li>\n \n DPV Sections 5.1.3 and 5.1.4\n \n </li>\n <li>\n \n
KT Sections 4.5-4.7\n \n </li>\n <li>\n \n SW Sections 1.5 and
4.3\n \n </li>\n </ul>\n</co-content>\n<style>\n body {\n padding: 50px
85px 50px 85px;\n}\n\ntable th, table td {\n border: 1px solid #e0e0e0;\n
padding: 5px 20px;\n text-align: left;\n}\ninput {\n margin: 10px;\n}\n}\nth
{\n font-weight: bold;\n}\ntd, th {\n display: table-cell;\n vertical-
align: inherit;\n}\nimg {\n height: auto;\n max-width: 100%;\n}\npre {\n
display: block;\n margin: 20px;\n background: #424242;\n color: #fff;\n
font-size: 13px;\n white-space: pre-wrap;\n padding: 9.5px;\n margin: 0 0
$','$$'], ['$','$'] ],\n displayMath: [ [\"\\\\[\",\"\\\\]\"] ],\n
"instructions"
]
]
}
],
[
"kruskals-mst-algorithm",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/5bucvWhbQoC7nL1oW-KAnw?
expiry=1499817600000&hmac=uWASEsfCI3TYWicFmysT3QRZZ6hE-
onm586fNA5Iaq0&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/5bucvWhbQoC7nL1oW-KAnw?
expiry=1499817600000&hmac=vTBtjD4jt7WZvKDXHzdyIL4ZXnt8dEYp1Ku1Qq-
jAqg&fileExtension=txt",
""
]
],
"mp4": [
[
%201%20-%20Kruskal.50e2c830d11b11e5bd749f9d7569c0cb/full/540p/index.mp4?
Expires=1499817600&Signature=DKMWkKK6LyB8cgmkJdRN5XYdzX4udbcAZ-Nx-
wmCWVnmOiy02qgX~WyBa5FcAIOAVwp6FzdiaRnXmTD8U-fyIG3jDORUa1d6dmIzB~V-
JJ830a6r7unNZzpqdrtScczTyfTlP6EU0a6G4xMMHoAjIWm8T7-Q8bkkgMP-KDttiqE_&Key-Pair-
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_35d44b8cf248793cd6e9d663fff9febd_algo2-
greedy-kruskal1-typed.pdf?
Expires=1499817600&Signature=GE96uYAkquZHzfTvL26Jgt0GkX33rZ0uv-7f-Op3jsq9kdb-
7TyxJxLl8MfJPAsNceAq2tO2NT7slsnkeT1yQeNyclp-
aUZkA946AQp3CwdexlFo084pHK05WPFCl1q29hsj5XzmhVSGXwDPO4G-7U~fugytE8X3WmnGaDkS-
7s_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
"algo2-greedy-kruskal1-typed"
]
]
}
],
[
"correctness-of-kruskals-algorithm",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/T4S6o8_FRpeEuqPPxfaX8w?
expiry=1499817600000&hmac=dSG4PlzgBWy48BKkd2RFUkrklx6ZzThE6omMDq7GYCc&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/T4S6o8_FRpeEuqPPxfaX8w?
expiry=1499817600000&hmac=fkjnRfFNDchfnIDJhEap9OZZbKWU3R6zeJ_GHC6OhIU&fileExtension
=txt",
""
]
],
"mp4": [
[
%202-%20Correctness%20of
%20Kruskal.5155d550d11b11e589a62d9b5bec1c5b/full/540p/index.mp4?
Expires=1499817600&Signature=jQ-vlDMcyvXFN9RV5VRxe6thtgrHJFRQRlEFFwmA4a-
jummu8AtwD4gNmnYi581~92dofqKUw~aHb3Fu~lJoBpRfCcl-
YEZFttbfRiVuCloE8ySz9tkobH2UMtkbbrKUAzwO987Dx3xHtrhuCZe5rNWPsFQ0HrW052PNz~j7OK8_&Ke
""
]
],
"pdf": [
[
Expires=1499817600&Signature=Yzl2uvDusSwxPhbj2GXX7AA4ifDOwIT3hYuuWsBahAzju9Im59DxA4
hXAdx2GfYitoEJwDj1WTeEAtuiSSgPltWr98~b4SVYutoi0LX~RYNIINBUCG5VJ4DinsvZVxrNwYh8d0df-
1HigzF9dJ1RzesN~ET443OiEbIFE537A~g_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
],
[
"implementing-kruskals-algorithm-via-union-find-i",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/ITLmNswqRcSy5jbMKqXEWQ?
expiry=1499817600000&hmac=xR52_b0ILOfLDAK0zOxlIPNgX8q6faV2Hz-
R57tmh5A&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/ITLmNswqRcSy5jbMKqXEWQ?
expiry=1499817600000&hmac=Y0TfjJ5znV0KGPB8a-
ivOTKe_DVHDAnRije9pPCPcMs&fileExtension=txt",
""
]
],
"mp4": [
[
%203%20-%20Implementing
%20Kruskal.511e2380d11b11e5929a831c588c8f13/full/540p/index.mp4?
Expires=1499817600&Signature=WHBT55wW68sg-TNkjBkc2Kt~jotw0cpjsM7O3Um6joI-
63MPg8AVNW620igCw~X3oJJ9rcAeH0DvGpfWBLRWwmO92APpNz-t-lSOo2rYiU-
ukZQvs2tLUbPBBZuz66RLfZz1V8A3Aaj2P5GK-nKeUSwY92uMQJkxCsgQIs-S68s_&Key-Pair-
""
]
],
"pdf": [
[
Expires=1499817600&Signature=EVTIXznTWYZshMkMvkCl4AhXVXHlVbPNCbeqI-
mB0G6tCHKhbPX7vXV5lTN35sEkXIpc21fT9GWvlXry6o~XZl-AdGwUtYU3GR-
gZTr9qt2qyaeEewRvhtT3foviafD514CmVEbbCEMM0I5oj8XR2crB6t381Bydq7Hm53i1poI_&Key-Pair-
]
]
}
],
[
"implementing-kruskals-algorithm-via-union-find-ii",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/W-WR1aSlQIelkdWkpWCH3Q?
expiry=1499817600000&hmac=_IkU3BBNPL7RtrtFouJ7ZoShyciuz_hdDIR6ZSpNLbE&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/W-WR1aSlQIelkdWkpWCH3Q?
expiry=1499817600000&hmac=FsJ9J1Uq3FVNsg3ah2thQrhlLr4RG7UKR5naMPsPvTM&fileExtension
=txt",
""
]
],
"mp4": [
[
%204%20-%20Implementing
%20Kruskal.526cc390d11b11e5901ff7d845f00c99/full/540p/index.mp4?
Expires=1499817600&Signature=P0ew6ydDNHMfPkdBCSmN2iVDgsBBy~EGiZ5hpvk2ZtwNIMtP3mDsxB
MDP61twBXJUN7bAh6R9Xl5PoNhx9TwOTIkss0ugK4jxAb0qOI1L4IEco2Jf9ATWA3ydAdTBwpX30PJdmrom
wyhWzaK1C5BA97JRv1DpuqkrQlTKVLsU3s_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
Expires=1499817600&Signature=EVTIXznTWYZshMkMvkCl4AhXVXHlVbPNCbeqI-
mB0G6tCHKhbPX7vXV5lTN35sEkXIpc21fT9GWvlXry6o~XZl-AdGwUtYU3GR-
gZTr9qt2qyaeEewRvhtT3foviafD514CmVEbbCEMM0I5oj8XR2crB6t381Bydq7Hm53i1poI_&Key-Pair-
]
]
}
],
[
"msts-state-of-the-art-and-open-questions-advanced-
optional",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/88fRiLeeQw2H0Yi3nsMNew?
expiry=1499817600000&hmac=SEuKv2TShUc3-
uQX2RXNvi2L4Eo1rKb5GUhcXMv5Zfs&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/88fRiLeeQw2H0Yi3nsMNew?
expiry=1499817600000&hmac=8vA_0lkMVrWHIDaXaqbnYKyucSVCONpinjBuy4i4FZI&fileExtension
=txt",
""
]
],
"mp4": [
[
%205%20-%20MSTs-%20State-of-the-Art%20and%20Open%20Questions%20%289%20min
%29.f32e60f0cd3211e590ba93556b0ccbbe/full/540p/index.mp4?
Expires=1499817600&Signature=aJGhbgJ5evs7P5tUATTUu0l6986SHsJ08EEMKgRQ3dEnpMSHsJvuVx
Y7b-UX-
iqDACfRg5ybbtQInuQ48m0gJKZ88jDtNHAlaKfJiiIElcq4ZuCt6Fu1Dj8CNc2NPn1TNAimkj0ObBZIH5Xu
OaXicrnQUe93bSWrNG2cMl8X0Hc_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
Expires=1499817600&Signature=dTp39hA3XemLDpS3PsXQPmz8NiMsWTbYZMwNcRS5~DwfbPaCAheXks
Kb2FsH6PuRHe88pp4Cw-
haSZSuPoVsq04GCsqwbbxGc0ZmsE8sMWluM9OVS35MJeGvi3~ZgNGReLOe0w4HKfSo3ClZvdNHdro6GQDx~
dMqj5OtJCAdMDo_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
]
]
],
[
"xxii-clustering-week-2",
[
[
"application-to-clustering",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/0fNC6-XbQJWzQuvl21CV_A?
expiry=1499817600000&hmac=Vu88Nr3qb985nMt6csFg4nbd7dORAKJ4ayxdTvNPdiA&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/0fNC6-XbQJWzQuvl21CV_A?
expiry=1499817600000&hmac=dX0jyRAltPIbGE5UctIDF8LIT7nlbgdbozkHr-
B9jCU&fileExtension=txt",
""
]
],
"mp4": [
[
%201%20-%20Application%20to%20Clustering%20%2812%20min
%29.e6f2d140cd3211e5ab457fc70f4db0b9/full/540p/index.mp4?
Expires=1499817600&Signature=TOVJXWFdL537CV65MOBwEkcf1sL~gj5Ee63STYcQkugzcUojXeprmH
MyUJT8b0KnbdwZdwA5h9WpGryAT72NOWSv4DvRKGtNojh7BDvTnl0Y1mYzRuzDDFyPz0VWEpLRrh3Kw9JYv
l3MegO4jmVwEXYFzCB5sHqu4qUxrNie9Eo_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_856db8aacad03b8e92fd7bb8023224d1_algo2-
greedy-kruskal5-typed.pdf?Expires=1499817600&Signature=Y3X2qyUIKaYoUi-
h6oOJUpWAn9S2-Mgj4iPlki7GogauU6jWSCTeyC19ZOAA-
rJNYz3G4vaDJNmEln0HY0bxorZ74~Y~DAbY0fsQ-FbbsCBY6NZde4A6ctYwh-
ws0ng58sALwOGLFJEP7c9pySyB2EdWhW3D2QENwuzhu4dvDcE_&Key-Pair-
]
]
}
],
[
"correctness-of-clustering-algorithm",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/U3kMpTLYTSu5DKUy2M0rZQ?
expiry=1499817600000&hmac=HJwXmcyNEGP1bx5tlsreDv-
m9HAoQTvwHsV00lIzIEE&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/U3kMpTLYTSu5DKUy2M0rZQ?
expiry=1499817600000&hmac=IEUHX_KZdlY43HEkClzfTb6dSYntL82Lg82mTt8onOE&fileExtension
=txt",
""
]
],
"mp4": [
[
%202%20-%20Correctness%20of%20Clustering%20Algorithm%20%2810%20min
%29.cf1580e0cd3211e5a86743eb252f59ba/full/540p/index.mp4?
Expires=1499817600&Signature=CrCs7oijxyc3dWgZOBdRlQN9J5ahryoSqcC~UIu~sEiSB09HLTaKBR
CQyV7-qwV5J-vCIbizGPQY0YcskLEZeRV1FccuTHGQ0jhuDTq6-Y9CSy-
nUaiPRrUV80Cycj1O4vkZYVq4EZfr1FhmX2sKEfhM26g~YV8Ql0py9~ttylI_&Key-Pair-
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_856db8aacad03b8e92fd7bb8023224d1_algo2-
Expires=1499817600&Signature=CfhI4cIUrwFuvmidDKgPZ55Wnp6Q-
4GUpF40mVWas85~uXNc8skfSnf7cNmWsjlWmue7sgVSXxCM-
6WLpZpVPiUaZWXUUl1Di4j36WjAQ5Es7VsfEGl4nAHnhVxEPAk-
dAq~MP3mv~Ctx0195Q0RXTMvqVtG1aSHcAQqMRJWCvA_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
]
]
],
[
"xxiii-advanced-union-find-week-2",
[
[
"lazy-unions-advanced-optional",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/urb1WZV3SXi29VmVdxl48A?
expiry=1499817600000&hmac=uC1pBcHE_p1vuMXuBLhUPn3VR3C0rGlNrGIXfH70D8c&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/urb1WZV3SXi29VmVdxl48A?
expiry=1499817600000&hmac=kr9EuvcBG0SQPENt7oAhTMfaJREyx9lWMRbk-
qw165A&fileExtension=txt",
""
]
],
"mp4": [
[
%201%20-%20Lazy%20Unions%20%2810%20min
%29.cdf013b0cd3211e5ac0d7790239fd55b/full/540p/index.mp4?
Expires=1499817600&Signature=Yi02ZCSJU6Fl-YWDzeualAYERpbcDSGf2UNkkbSwGaYvf-
JsfFs3vW~Sqnltr1AKI25LeqXAh4EYnbe9P48xL3qeGrsq4h7R3D2T5E8aP0xZ~IG22t-
~rgOSgZwLMxNCQ-9kd6ZJjUuKttw7f9lit-uDR1tt8Qw72-qbPkie4Kc_&Key-Pair-
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_c09eca2a5c2b02d21c3bd5181c8bc15b_algo2-
greedy-union-find1-typed.pdf?
Expires=1499817600&Signature=VZsVLxlMhkok6jdO5q5jp7wynwxGHnYLxLCWBtIeh1QWf~VNeszArt
RZK437S3wRYwKW4Wob4On~Q5janUY8K06BVQ7wUtIb07P6NLDc4EUqH~UTh23AwnYx5Xv2e0EGLlfiRUCKv
9VD60oHuv1pQlbJ7ElTgHcWmW9Yzp009x4_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
"algo2-greedy-union-find1-typed"
]
]
}
],
[
"union-by-rank-advanced-optional",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/zbZQfPkDT762UHz5A8--Sg?
expiry=1499817600000&hmac=bZcr-
FGzMNVGE_rQez3yVRAYW5nUCWdbUbrV2pY3a00&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/zbZQfPkDT762UHz5A8--Sg?
expiry=1499817600000&hmac=dG68s55OKlAxlM9xe-
aFtqwaxgffcPxus1JeezdaKtw&fileExtension=txt",
""
]
],
"mp4": [
[
%202%20-%20Union-by-Rank%20%2812%20min
%29.d0c2e2c0cd3211e593c6d74ed40fa08d/full/540p/index.mp4?
Expires=1499817600&Signature=bOCq5M4V3-MsK-kvrruanQ05aE7YSlmA8HN1P7vZHFZA1M-
HwUQJP4Z2z9esGVKoEY43ekbqZlkK1SmfiSuA8aos0AVdIN5cEXHexQCWH3fubjdzCp82HeoUUk1PsHyyUw
zyi~B914cI6xA7vAFlLwBIvUcQSJqNnZ31xMkQzQI_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
Expires=1499817600&Signature=UXvZyJG23HYCaRndV2X7CXzuAGHUWNFWrvRRZl7QctIwyonSqsF6DZ
DKN2AEopt19~lL9QK1nZYzutRK9Q0IsZ4HjXGKCVK~TkgBl76VXqJr5mvyytQbV2xbDZTrNJ7WnCHI0MHrE
0IWDE4mKY9ZtHkguIXRbz8oLZOcmMdBm00_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
],
[
"analysis-of-union-by-rank-advanced-optional",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/mooSNINURPqKEjSDVKT65Q?
expiry=1499817600000&hmac=1f0V-
7KgoccFKhM1IuR_dVcYUv4JvD3hdp0PcXxxx68&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/mooSNINURPqKEjSDVKT65Q?
expiry=1499817600000&hmac=Y0sLMk1IJ4lPImTK9yao7clOrWtMdXHA1ZnYEZV0AGI&fileExtension
=txt",
""
]
],
"mp4": [
[
%203%20-%20Analysis%20of%20Union-by-Rank%20%2815%20min
%29.d02988f0cd3211e59f57c57b4fab9f16/full/540p/index.mp4?
Expires=1499817600&Signature=bygPZJ0o8YrooHztKG0HHWp4l1~HJQ7NZy-RMK2KbpusPhfjOZ1-
Swta-wurAcfqSzPzzuhXjZV4mIDX2OaM-
YEI2dS2Zya2iliMFhg28xm01~dSF3Yon2umZA9S~34uAliTAIfJXTWHpiE0M1qqoEuI1ATbTV17tcLSefNS
6po_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
Expires=1499817600&Signature=Wuqm4oV1DHhntI~XPJpTYQbM9bk1Oec8ADArRgCViUTEGP98djKCi-
k6mHukdlXkUi8F0W0nSFU0q7UsG8nOofVWvMMnPZU2d0vp4AaIqAG2~hmBlzEKURrpIefY3jXTFY36CQW5U
Ul7R3U6Yx9Zs1LKI7XMgcJ4RNsC5aQDOIs_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
],
[
"path-compression-advanced-optional",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/wi0oixBIRTWtKIsQSEU1YQ?
expiry=1499817600000&hmac=7QQwd41L_Ol1_0n6vIAsIN6rfaXJ36tSvoWDdAzAJPk&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/wi0oixBIRTWtKIsQSEU1YQ?
expiry=1499817600000&hmac=K8rgzqJlihMqCPw0TtZj_aqzD5Nu9u9YDHNMMznIS5s&fileExtension
=txt",
""
]
],
"mp4": [
[
%204%20-%20Path%20Compression%20%2815%20min
%29.d0c21f70cd3211e590a77f5aabd5e0c6/full/540p/index.mp4?
Expires=1499817600&Signature=Gc9Ee-
Qe9KPcIzXqU9wGbsBUutk5V6MKTXQmZjOHGD9ABHXhJPygX4uekRHvqaSy5ZfnZu-
kavAqYdmGw0ECSLkB7hz99zZ6-us0OXlPo0jX1lqa2cdJbf0vX73L-
3kmsCUfVhgWno7WnrC6~tjw~GcJLv6UVGa1Lk4xFMt8Hfg_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
Expires=1499817600&Signature=DCjTioM2Mus7N6C~2jKfnOg~7IOi1HZCVYpPYkB5w1SMi1CbpBlioP
4vw13mmdBVrViXQNUUTHWblRpPxaupl4vqjnzYp5RUcqHSCVY1aJFCh6pqKvmojIA1FHa3P-
wX5hbyfn~q475XM5uuQVnmj5E1vuuPSL1Pnfal5TAd6Vg_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
],
[
"path-compression-the-hopcroft-ullman-analysis-i-advanced-
optional",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/tphl1RVeRGWYZdUVXlRlzQ?
expiry=1499817600000&hmac=CweiTMtGxvqKcu7QYkqvziy_qI69Re4ToYqAN_zJfio&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/tphl1RVeRGWYZdUVXlRlzQ?
expiry=1499817600000&hmac=_0fJWO6eHx2p3xi9m5FTklnmLgCmHzTLdzHSz5EcpS4&fileExtension
=txt",
""
]
],
"mp4": [
[
%205%20-%20The%20Hopcroft-Ullman%20Analysis%20I%20%289%20min
%29.c8ede180cd3211e5a131778651259164/full/540p/index.mp4?
Expires=1499817600&Signature=NY7kmuowMV~FSPqXaB69Z7sBXf4m6vVmTNE-
OMTiOOR9zTFor~b8KDg1GToCgw3lqYvqvq5pqhGmlowvvU0uNLYn7MoJN7rAGURmRCJnGEOXRSb4dYE4pn8
IzIhuKqM3fFDrb~PDqLN0GZNZQ1IXC7fcBhXWZMczjEMy92wTACY_&Key-Pair-
""
]
],
"pdf": [
[
greedy-union-find5-typed.pdf?Expires=1499817600&Signature=GSIZ1o4lto-
m6hp8sDcOJHULPJscYV1W0HKtnI12B-XVh0PYWR4bhPr2~FmOlallgIwmVN-K69L4EU6tC9p7TGX-
D1BfHLgNEWugZ44Gwyf-
DAkGl6nbWzBIHl~9smBjHN7FHRkFCG49SLBoqDMR6xQ5P7ponwGfOL6d7lbHF9o_&Key-Pair-
]
]
}
],
[
"path-compression-the-hopcroft-ullman-analysis-ii-advanced-
optional",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/MolOul9kRt-JTrpfZFbfzg?
expiry=1499817600000&hmac=Ikd-
MN0Bh4Fm9bH6es6Wo5u9n3iPf190OPLi9p8ZwBk&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/MolOul9kRt-JTrpfZFbfzg?
expiry=1499817600000&hmac=YclMgrWaLNUO8S3qc9A6n-
eQsNxTx4PlaufMG8K6pC8&fileExtension=txt",
""
]
],
"mp4": [
[
%206%20-%20The%20Hopcroft-Ullman%20Analysis%20II%20%2812%20min
%29.d22ea7c0cd3211e5ad2d35dd481fb635/full/540p/index.mp4?
Expires=1499817600&Signature=e0-
Qg2gUhTP6PyuI2i~RlBo7nZbF0HZT2eaRySYvT5RHcavl7pvAzNsZ3TVAag5awPOxzWr6M64w-
xKlDwKcgnbrR~crg1cqlQGVglbEHUBE6dfOQxIk8P7FabpubUdYggTDCpPhXuwfdt-~fs6U2dYKSG~-
X8i1FvWqCwZ3-F8_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
greedy-union-find5-typed.pdf?Expires=1499817600&Signature=GSIZ1o4lto-
m6hp8sDcOJHULPJscYV1W0HKtnI12B-XVh0PYWR4bhPr2~FmOlallgIwmVN-K69L4EU6tC9p7TGX-
D1BfHLgNEWugZ44Gwyf-
DAkGl6nbWzBIHl~9smBjHN7FHRkFCG49SLBoqDMR6xQ5P7ponwGfOL6d7lbHF9o_&Key-Pair-
]
]
}
],
[
"the-ackermann-function-advanced-optional",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/dvcUwrJ9QBW3FMKyfYAVlw?
expiry=1499817600000&hmac=AKbMEKsP__EjCCRY63LYwEoe4FFft2hIWeGIkzztkIQ&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/dvcUwrJ9QBW3FMKyfYAVlw?
expiry=1499817600000&hmac=5HLRaaV0j5dZxttTSqAEd2bbDlt7E5sxie__hd2cSAQ&fileExtension
=txt",
""
]
],
"mp4": [
[
%207%20-%20The%20Ackermann%20Function%20%2816%20min
%29.d5c4ede0cd3211e58b944901e1f880e1/full/540p/index.mp4?
Expires=1499817600&Signature=QpYE20gIUJKtHTp84eTAx1d5cyaF3D1vjzQCmrkfJu4evLJqUb1pZt
drSkeTLot-wbcJ0buCqFpJDwkWsCCaBzyM7Poksy4LHfaQ5KTZ0-
E49pQwVldfjO2NAmUjdKE4If~KDLjiyt0xyDWNoHedCg~p3Aja2yNgxMokZiPMwmU_&Key-Pair-
""
]
],
"pdf": [
[
Expires=1499817600&Signature=deIGYSlNv4W~xIaWNiHkEaGsyxeHVcnEB4In~4OncT82wrYuvuQMYj
w7drsXyXT~eIvLVoQGJTpnwYhAmazjtyeUcT7iGS06PJuz88Cr-
IE7AbmGCcxBRrD5x7vXgTyKQ~DWomS3FY9cLQbsSrmJVTz9bUv37Q-DPb~rB5nRFwQ_&Key-Pair-
]
]
}
],
[
"path-compression-tarjans-analysis-i-advanced-optional",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/745Fqg8gR06ORaoPIOdOfA?
expiry=1499817600000&hmac=QJiXpT7wDAuBcvJun6H-
bOKB4I5n8hOls3PUqztnBFc&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/745Fqg8gR06ORaoPIOdOfA?
expiry=1499817600000&hmac=qlA0EsVJJVjSigei0tfiBjSX6OUsvIKaf8TZy2IlpT4&fileExtension
=txt",
""
]
],
"mp4": [
[
%208%20-%20Tarjan.510396a0d11b11e5bd839be21ad26129/full/540p/index.mp4?
Expires=1499817600&Signature=dqedbd7hpKnKu1mjmzFjKTsJ0CsIbnYbl1mB~bWpy47pbDbqpI18vL
TOSksPsQ6apxUNiFfJUb7C5KnLaolBEMoz-NSlPNaukGw5Disfv-
VLUuqlmUzdbNWRIyMzm6NmvzI3jsWvdMyRrpCG0DAa-HNGa09xRKEuWlJvSPofNTg_&Key-Pair-
""
]
],
"pdf": [
[
Expires=1499817600&Signature=b3fsnIu8C4SyV3ib5IpPS618YR-
hZJzGMEnrueA6lY9tgUP0Nl4qlH4mUSLk~0d~tebpr~-
h23FMRB7HQvPqsKH1qGBMOaPve3qL1k3FRmLpqi7WEr~XEhWzxkRlZK7t1Ql3fOXKtqSXM7x9av63ycaP94
nIXWv4n62MgyrhPdg_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
],
[
"path-compression-tarjans-analysis-ii-advanced-optional",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/NgNagOYaT9iDWoDmGl_YJA?
expiry=1499817600000&hmac=di6Q9AeWrlI9jj9N1ZRFDDnb1dHeTS9tuZGubsB6vgs&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/NgNagOYaT9iDWoDmGl_YJA?
expiry=1499817600000&hmac=H0Fh2byyxjct6Kl55TsnfKXwic4yH2uHAnqLvttPOCE&fileExtension
=txt",
""
]
],
"mp4": [
[
%209%20-%20Tarjan.51294710d11b11e59d45f7ca5054119b/full/540p/index.mp4?
Expires=1499817600&Signature=HeVBrpgGYirwT78c27pYew697R9wuLPf5xK2VSIwfJP~13B~u-
TfPmtGdPGelNehyHObbPkSyDtoACwWk6cDWyp8ae5XfxQ0hpz3eYWCm1VqlryHLHVxeCabJf5b42NMTNGaS
ZGzYNJL7PmSQTbSVLdpauUxReDkEP68wZoQd4A_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
Expires=1499817600&Signature=b3fsnIu8C4SyV3ib5IpPS618YR-
hZJzGMEnrueA6lY9tgUP0Nl4qlH4mUSLk~0d~tebpr~-
h23FMRB7HQvPqsKH1qGBMOaPve3qL1k3FRmLpqi7WEr~XEhWzxkRlZK7t1Ql3fOXKtqSXM7x9av63ycaP94
nIXWv4n62MgyrhPdg_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
]
]
],
[
"problem-set-2",
[
[
{
"html": [
[
content>\n \n The following problems are for those of you looking to challenge
yourself beyond the required problem sets and programming questions. They are
completely optional and will not be graded. While they vary in level, many are
pretty challenging, and we strongly encourage you to discuss ideas and approaches
with your fellow students on the \"Theory Problems\" discussion forum.\n \n <ol
bullettype=\"numbers\">\n <li>\n \n Consider a connected
undirected graph $$G$$ with edge costs, which need not be distinct. Prove the
following statement or provide a counterexample: for every MST $$T$$ of $$G$$,
there exists a way to sort $$G$$'s edges in nondecreasing order of cost so that
Kruskal's algorithm outputs the tree $$T$$.\n \n </li>\n <li>\n \n Recall the definition of a minimum bottleneck spanning tree
from Problem Set #2. Give a linear-time (i.e., $$O(m)$$) algorithm for computing a
minimum bottleneck spanning tree of a connected undirected graph. [Hint: make use
of a non-trivial linear-time algorithm discussed in Part 1 of the
specialization.]\n \n </li>\n <li>\n \n Consider a
connected undirected graph $$G$$ with distinct edge costs that are positive
integers between 1 and $$n^3$$, where $$n$$ is the number of vertices of $$G$$. How
fast can you compute the MST of $$G$$?\n \n </li>\n <li>\n \n Read
about\n <a href=\"http://en.wikipedia.org/wiki/Matroid\" title=\"Link:
http://en.wikipedia.org/wiki/Matroid\">\n matroids\n </a>\n . Prove that
the\n <a href=\"http://en.wikipedia.org/wiki/Matroid#Greedy_algorithm\">\n
greedy algorithm\n </a>\n correctly computes a maximum-weight basis. For the
matroid of spanning trees of a graph, this algorithm becomes Kruskal's algorithm.
Can you formulate an analog of Prim's MST algorithm for matroids?\n \n
</li>\n <li>\n \n Prove that our analysis of union-find
with lazy unions and union by rank (but without path compression) is asymptotically
optimal (i.e., there are sequences of operations where you do $$\\Theta(\\log n)$$
work on most of the operations).\n \n </li>\n <li>\n \n Prove that in our union-find data structure with lazy
unions, union by rank, and path compression, some operations might require $
$\\Theta(\\log n)$$ time.\n \n </li>\n </ol>\n</co-content>\n<style>\n body
{\n padding: 50px 85px 50px 85px;\n}\n\ntable th, table td {\n border: 1px
solid #e0e0e0;\n padding: 5px 20px;\n text-align: left;\n}\ninput {\n
margin: 10px;\n}\n}\nth {\n font-weight: bold;\n}\ntd, th {\n display: table-
cell;\n vertical-align: inherit;\n}\nimg {\n height: auto;\n max-width:
100%;\n}\npre {\n display: block;\n margin: 20px;\n background: #424242;\n
color: #fff;\n font-size: 13px;\n white-space: pre-wrap;\n padding:
9.5px;\n margin: 0 0 10px;\n border: 1px solid #ccc;\n}\n</style>\n<script
async=\"\" src=\"https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-
$','$$'], ['$','$'] ],\n displayMath: [ [\"\\\\[\",\"\\\\]\"] ],\n
"instructions"
]
]
}
]
]
]
]
],
[
"week-3",
[
[
"xxiv-huffman-codes-week-3",
[
[
"week-3-overview",
{
"html": [
[
content>\n \n HUFFMAN CODES: Everybody loves compression. It means more songs
on your smartphone, faster downloads, and so on. Huffman coding is a fundamental
type of lossless compression, used for example in the MP3 standard. In these videos
we'll learn about the optimality of Huffman codes, and a blazingly fast greedy
algorithm for computing them.\n \n \n DYNAMIC PROGRAMMING: This week also
introduces the dynamic programming design paradigm; next week we'll see a selection
of killer applications. For now, we content ourselves with the development of a
linear-time algorithm for a relatively simple problem, computing a maximum-weight
independent set of a path graph. We conclude the week by zooming out and
identifying the key principles of dynamic programming.\n \n \n HOMEWORK #3:
The third problem set and programming assignment reinforce the concepts and
algorithms studied in the lectures, and the programming assignment asks you to
implement the greedy algorithm for Huffman coding and the dynamic programming
algorithm for finding a maximum-weight independent set of a path.\n \n \n
SUGGESTED READINGS FOR WEEK 3:\n \n <ul bullettype=\"bullets\">\n <li>\n
\n CLRS Chapter 16 (Section 3) and Chapter 15 (Section 3)\n \n </li>\n
<li>\n \n DPV Sections 5.2 and 6.7\n \n </li>\n <li>\n \n
KT Sections 4.8, 6.1, 6.2\n \n </li>\n <li>\n \n SW Section 5.5\n
\n </li>\n </ul>\n</co-content>\n<style>\n body {\n padding: 50px 85px 50px
$','$$'], ['$','$'] ],\n displayMath: [ [\"\\\\[\",\"\\\\]\"] ],\n
"instructions"
]
]
}
],
[
"introduction-and-motivation",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/RVxznfLBRVScc53ywXVUKA?
expiry=1499817600000&hmac=AzGkeH1Jz2xu3E8DkcmT_kVKWAHbnXgtw1b4JGNml9c&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/RVxznfLBRVScc53ywXVUKA?
expiry=1499817600000&hmac=JT-
PpzNUh4J6FoxgqNgC7R1UJRLS1bFcAImt3y_t8Qw&fileExtension=txt",
""
]
],
"mp4": [
[
%201%20-%20Introduction%20and%20Motivation%20%289%20min
%29.c6f40d50cd3211e590a77f5aabd5e0c6/full/540p/index.mp4?
Expires=1499817600&Signature=SwWrhorNtAxs3ZP5cY2m218OxrneSu5ZqCWYsbW3OA~6wXYIreyvT9
9wq~lNZLrcABC6r-
inektaYHGgMt2GAvxWQgbMRwCMChkIojvNN1dYpRpUIqRZrgLqeq4MpVU~1xqlDSEBUY7qihvDpwAgE20Am
5e-yHyw1yIsbSMsox4_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_ab53d5b78cd787cfd8992a4b42220f70_algo2-
greedy-huffman1-typed.pdf?
Expires=1499817600&Signature=PqB0fxOdCc57hET3FQcNUQ3Xjm5AuEe-
DRx1~4lfKhdk63EL9JAkiZg1C-
iJK3TrSOyUcAjonwRYSpzNeqkXc~PGuAfOl~DQ9neMYhO3bnj7gLmcUt~GuKo7Usxttc7NAPUXhy3l9wRL1
uoXAEIR2NZ91SEvVanzMMMysYICyPE_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
"algo2-greedy-huffman1-typed"
]
]
}
],
[
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/oeScrZRZTEqknK2UWSxKOQ?
expiry=1499817600000&hmac=wetoCq5FOtRlDM656XxlhyJKIjnweda71g7Gai-
Ehio&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/oeScrZRZTEqknK2UWSxKOQ?
expiry=1499817600000&hmac=Sc_rZBO-5c4hx7Nei-XbY-WYvO-
Is3qn27uYYTdoFew&fileExtension=txt",
""
]
],
"mp4": [
[
%29.d5823f90cd3211e5a86743eb252f59ba/full/540p/index.mp4?
Expires=1499817600&Signature=GYtPIG-XOK1u8tKUR6A4IINToPokQ-
Kx7EFSaO2Us95JRAQbkmKN9Y4dECLH3M8EAgcz8CVlQe-UKmTwFJewjBZ4vawEE-
PJlBXQv~QM30iUjcObMvWS-bGCE24pCppC3GhB7kyUipbJkuRZ8SSQ6sA9caakw4-n0xDS5tRIiiw_&Key-
""
]
],
"pdf": [
[
greedy-huffman2-typed.pdf?Expires=1499817600&Signature=a-znfLNEVvA0CcWjPTsHPDq-
v1Y6SQmUaCbopdvgCnpSR-u8jbDx4a9MXSmAjTrbx-lLyaQr5MeyN4z9ZYjrd6diLyr-
dfA8O1RsB6wWr4x64Z~lY2Tv3jUrUwQYip303hnEGYxAmFNKYebLp0Idz3KfMCXOFaCETI1WBcjCO8Q_&Ke
]
]
}
],
[
"a-greedy-algorithm",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/D8uKyP3vRdqLisj970XaGw?
expiry=1499817600000&hmac=gcgSX_WGIE08Z3nZJOYn972DfHmfu_gdCKGPBsMQWis&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/D8uKyP3vRdqLisj970XaGw?
expiry=1499817600000&hmac=7ykdjYBxCRB5U0RZrnvS4ZqGc2HJBIBODJ2i1SbVquM&fileExtension
=txt",
""
]
],
"mp4": [
[
%203%20-%20A%20Greedy%20Algorithm%20%2817%20min
%29.d99a11c0cd3211e590ba93556b0ccbbe/full/540p/index.mp4?
Expires=1499817600&Signature=HRMyYOWcGzejCiSspaS-SsYmDR-
Gxke5lDyqQD5B2X~u2jHJx5N51D1NWu17ooCILMYBDAt1rsyZDX25q0sMEU4TwZ4YuiZaOz475wvI2ZEdWv
xY~JsTUFU9wXXvYaMvOwCxzF2u3km6fW2s~dTGXsJ7FBRatqNPDHZBfSTWWqQ_&Key-Pair-
""
]
],
"pdf": [
[
Expires=1499817600&Signature=OXvlcxNehbgf~42fTDMU161RsCBEB9LiIoG3jKgBLBVQAs~cO9qLDV
0b9WTO7auEU-
VOYzyjp7SbvxyiL7KBizzFspX4gUCRiuLiv7wVd0X6aVw~LGxpEWXgNCLj3gruqUf04sC5hyNUHXCtI-
WQB3Pd-3DduLu9D-GbNIc3Dzg_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
],
[
"a-more-complex-example",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/0BFLsE3UTI2RS7BN1FyNrg?
expiry=1499817600000&hmac=OZJmfyLDYa45OV7mc1qMiV02JXIB7sD37LJBHRqx7ko&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/0BFLsE3UTI2RS7BN1FyNrg?
expiry=1499817600000&hmac=_6nNZ0Z3YYdfVTQQAizVAKKOTVDCTzXeN88q-
TJqs3M&fileExtension=txt",
""
]
],
"mp4": [
[
%203.5%20-%20A%20More%20Complex%20Example%20%284%20min
%29.c56ef3f0cd3211e59a7f0323c83d8ef3/full/540p/index.mp4?
Expires=1499817600&Signature=ETcur0UjSGxBgB-
pRoJM6sMHj29L23sYixZyr79PtYXXgkOZETmKtZaz2mirRP4UC-
iyLWjX0MaypRXDmA48P5byy8rQeBfJxD4dO6SWn4kK3GXQeK1DQ0EDD5Em6huP3nJJRdXWjkZJiIzAPz~b8
y6tAjSoJ8~vasQMLd0WFO0_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
Expires=1499817600&Signature=GQL2O3ZQP5Y6HJDUZySANqiKQzgC4rruKru1fzM2ZmSP-
gPnTC8BhNQrEl910eVbUa2nJxxU~6lZfl2W4eY3wyniZflhTs83Nvd-
lEsodaue7d57HOZ04Uw7vlOs1AdQyCrYaKP8i09XQB0ysyFrJ-45xFh3g2MFLCAbJ1qcX8o_&Key-Pair-
]
]
}
],
[
"correctness-proof-i",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/WOl4V133TG-peFdd98xvaA?
expiry=1499817600000&hmac=My5CqII4ALlvC0ZszOczYcHc8DRgjuy5ifa6nHJNdPc&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/WOl4V133TG-peFdd98xvaA?
expiry=1499817600000&hmac=s9_SlA41L8PUZ_gFUkXCfv-M_ZAfWkH-
E9JBseqP0k0&fileExtension=txt",
""
]
],
"mp4": [
[
%204%20-%20Correctness%20Proof%20I%20%2810%20min
%29.de85aeb0cd3211e5ad2d35dd481fb635/full/540p/index.mp4?
Expires=1499817600&Signature=Fl-1O~PDCyfBGAo-SFHfPXnkCtBp-tGKznOQCcrR-
cmXdOdVDJwkGeSaiDnR-L0BDKCXRaVDhjJjy53uQve1wra4dCxF2O3Sl0XQcqJdTyuVduj-whn5O30Fn-
8qFzx2ayCDYEjwG5qbaA4xfNGqGzOVL915~T1Aa8WW9OlL9gQ_&Key-Pair-
""
]
],
"pdf": [
[
Expires=1499817600&Signature=U6qFY026PBbZWbW3QVmoJKEsaL0zHj7BXnHTjq1coWMEk2bx45gzx9
C12ZmIt3kUj2kIyMdHDMqdrVYyIy6ApBQ56XxXpFH1Xddw83DTEDVqQVUvs8HwFeLGKw85MzhHmngkBKgLk
bTo2RltFuD9~FHLehMWkbWLbkNvQpkKkog_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
],
[
"correctness-proof-ii",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/pBmUSIIoSlqZlEiCKKpakg?
expiry=1499817600000&hmac=LJo9QOcrMHMszegeh6cmede6OtIRI1ivHlFjxhyWNBY&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/pBmUSIIoSlqZlEiCKKpakg?
expiry=1499817600000&hmac=wZgCGCvV-
r9qd3k0ZEdbazHVqzwsKQDr77UuX3rNSJw&fileExtension=txt",
""
]
],
"mp4": [
[
%205%20-%20Correctness%20Proof%20II%20%2813%20min
%29.eb3a6600cd3211e58b944901e1f880e1/full/540p/index.mp4?
Expires=1499817600&Signature=fvfchFLTnI59dAPW6fBZFhUE-
kKYICIWVCDzjj7yaSsv2rvELIbHv2Kun1DOvsc3RUIzOzGG36Klp0177SJO5R~8liqMIXGfldvQFvLpjpmP
shlsiTlwrwDBJUju9jNev-pWPvQstuyqCmQvOwwchXJQORWSVM34C4B7Q23Z3Ko_&Key-Pair-
""
]
],
"pdf": [
[
Expires=1499817600&Signature=U6qFY026PBbZWbW3QVmoJKEsaL0zHj7BXnHTjq1coWMEk2bx45gzx9
C12ZmIt3kUj2kIyMdHDMqdrVYyIy6ApBQ56XxXpFH1Xddw83DTEDVqQVUvs8HwFeLGKw85MzhHmngkBKgLk
bTo2RltFuD9~FHLehMWkbWLbkNvQpkKkog_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
]
]
],
[
"xxv-introduction-to-dynamic-programming-week-3",
[
[
"introduction-weighted-independent-sets-in-path-graphs",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/Sss0-6E5TwmLNPuhOa8JMw?
expiry=1499817600000&hmac=jFyCqe5qmUp2ULteUfRIZq7ArBNxdT8iT8cl_ZXGMG4&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/Sss0-6E5TwmLNPuhOa8JMw?
expiry=1499817600000&hmac=SHiXJxkAKV4jA347zIpSymTDjbb6D2vBH4pZSuK_aUM&fileExtension
=txt",
""
]
],
"mp4": [
[
%201%20-%20Introduction%20-%20Weighted%20Independent%20Sets%20in%20Path%20Graphs
%20%288%20min%29.ce9861a0cd3211e5ad2d35dd481fb635/full/540p/index.mp4?
Expires=1499817600&Signature=KKL2hvQIHi11rb4tmMI4yIZ60AVuvKpjdmYkG~1yelhT2Rvh9ARd3V
r~wyksmb-ktv52x8GJJ~uyjF1wJ2RZHXrftAKdPy01RqWZpPE8uY8SC4ZjEknqfDt8QYU2vfg~LO-
Uw0fwji9n~8ZBSWnEqTISgcGALTfPd~ywjPDRwu4_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_0e6c7a84826091e47a25f43880b9e562_algo2-dp-
wis1-typed.pdf?
Expires=1499817600&Signature=FsbyaFfDTe3EgAUw~s7i4hu3FdStz3rSPvCfmg6S3OR0j53QJqUybV
Nam9xMLKV1qR~qxz98vVbhedIu65P-gWPQus-
lpCOojnb~RP06b8UxlCC8ThdO8Z3w2MbhIFZF925~S1v7~fpEYePgQKR9IFAPbltgzjvPkosvUqVKTDo_&K
ey-Pair-Id=APKAJLTNE6QMUY6HBC5A",
"algo2-dp-wis1-typed"
]
]
}
],
[
"wis-in-path-graphs-optimal-substructure",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/orSQEbt5THG0kBG7edxxnA?
expiry=1499817600000&hmac=a33_qDiSc-
F75F0STHR0mQcYOdGRmaiFTSKefcEk_Pc&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/orSQEbt5THG0kBG7edxxnA?
expiry=1499817600000&hmac=tD5dREjz_zmKBKztWhS0GKSrGGIUbw5fZp4dcaXtW6o&fileExtension
=txt",
""
]
],
"mp4": [
[
%202%20-%20WIS%20in%20Path%20Graphs%20-%20Optimal%20Substructure%20%289%20min
%29.c6baadd0cd3211e5ac0d7790239fd55b/full/540p/index.mp4?
Expires=1499817600&Signature=gCuPjpEnhegwRgm9I5hMU8S-
FCjNC2Al2rBOf26z5K7BC7gV5zakLHSC-
aUs57XumVkqXX5cxOTl1CNonXr4GUnk4M4c4pIMZirDkirL66muGcWWlSzLj97DfVm8AxWAt4YR8iVJsP99
YhNe1XDf8w859BProGyelvUKd981W3c_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
wis2-typed.pdf?
Expires=1499817600&Signature=UnATYa3s1bjGPM12c8U~GdIBCwP3GoLpnH4UBR8ukuiy-
rPhMMzpExdg2YT9qXiGIXaAriEU-
aIDK5~u~4QFzoX36IgDfbb0O2SMaIs0~9W6QHTUrHT893H1gK4ymnhkdBNmBHCDznxGrDWZHAObDJdPhhFW
smWTvGEAM-nEa-Y_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
],
[
"wis-in-path-graphs-a-linear-time-algorithm",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/FpLZcGdUQcSS2XBnVDHEsQ?
expiry=1499817600000&hmac=cfjSIXXTu0fplDvm9z9H3W7jl-Ad0yCW1-Zz-
3f7cSI&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/FpLZcGdUQcSS2XBnVDHEsQ?
expiry=1499817600000&hmac=t1IHzXoLPeKps7sfVEbIDIfjXtIWaxnu7k6jJeOydE4&fileExtension
=txt",
""
]
],
"mp4": [
[
%203%20-%20WIS%20in%20Path%20Graphs%20-%20A%20Linear-Time%20Algorithm%20%2810%20min
%29.caefa4f0cd3211e59a7f0323c83d8ef3/full/540p/index.mp4?
Expires=1499817600&Signature=E5ZWeEzv~CAOYzeIPTOHucR-
1K3c9milXWLmKOaTAFDLdl3deHJGWZiBS9E1owfZpHGHdtztPZI3cDAOXt3qmp~Y2HGAUaO-
xEz1Fddpotx1xROIaZfmFtOa3Z19E8K~zPDvRoC1O5KK8~0pYpZjcyaz2k3yucrqKq4B3E1osIM_&Key-
""
]
],
"pdf": [
[
wis3-typed.pdf?Expires=1499817600&Signature=YU~7-
iwMVnYN~pcmJAV8ocm00Yjb0yWSbaBqi7gbEUfGSbaqULvcOqxVEAC7L~diAR3qoaMERS7dCqb2M9wwlfJ7
~ZmEzeyPQNbu~1rLsxEOxSAD0AsezhemC6CKWtnW2GgcI6X87mqE9lCO9vtbVkCxmVrOZkJyqk5kAXVk-
TA_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
],
[
"wis-in-path-graphs-a-reconstruction-algorithm",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/-E0qNy1ER6WNKjctRFelug?
expiry=1499817600000&hmac=SzvGJS5bQWlQABuo7G8GYCNCf93n6qjXcT90l7-
_kJY&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/-E0qNy1ER6WNKjctRFelug?
expiry=1499817600000&hmac=RsHqnxQ3BDLVuETSoroOb182wR5P3MVr1YtkzGNbUZw&fileExtension
=txt",
""
]
],
"mp4": [
[
%204%20-%20WIS%20in%20Path%20Graphs%20-%20A%20Reconstruction%20Algorithm
%20%287%20min%29.c6f286b0cd3211e59f57c57b4fab9f16/full/540p/index.mp4?
Expires=1499817600&Signature=WN9bgOv-7Wy9-Umqy0KDo1bvwV7KzgZiVFLgv~a~ff5em-
hj45GbTgxGH47ImbpFfcsJ7bDCaxFh3dO5GgP3EBI9-vu3MyMmon62ZW0zLO9cryh-
nrWGWjBtVsyeJqtZoFzyKwNcXOf791GrwG3IxvvQqZGFREVb5gN28b2Does_&Key-Pair-
""
]
],
"pdf": [
[
wis4-typed.pdf?Expires=1499817600&Signature=dbzo-kOA0NneNdESbgIya-
NuFo5ZraI3bbAZzjNK93F6dFHupYS8HFWgfi7VhhMyRl2C1XwYJ-
tloc9cXZqpli1mKOP9xlXp5LKZ9rzANcdZ~6mcO714fnH3t5O3WAVK3-
dOb~I1p03YgSkn7ozEC1G6xq~pd9ONPxlrTzH2BBs_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
],
[
"principles-of-dynamic-programming",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/wwQHfVJ5QUeEB31SeXFHfg?
expiry=1499817600000&hmac=Xoi1TnGF82-
LUXBclUBLwTkjLQ9l_wtujRP6Nevr6Aw&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/wwQHfVJ5QUeEB31SeXFHfg?
expiry=1499817600000&hmac=dms6VWm34y0xlbKRnZYV44UsSqwedOqkeqeJ0ZNF46M&fileExtension
=txt",
""
]
],
"mp4": [
[
%205%20-%20Principles%20of%20Dynamic%20Programming%20%288%20min
%29.c772da40cd3211e5ab457fc70f4db0b9/full/540p/index.mp4?
Expires=1499817600&Signature=dLYIiLihFGfy9i7dQEMAkUUn~W5J6O9H75qFip-
zLkbG0xyKEL9TWlAYX3Ca9w0TymljCJN-HqASMIZ8FUcj4FH~CRu-
qVhaz3DIAu5QRwxEmLUE4X9PWyL8J~UFVxx1l36gTYxU7RzvUxDvyGxLT0TOVwTHm1K0E9nPdFNnVtQ_&Ke
""
]
],
"pdf": [
[
wis5-typed.pdf?
Expires=1499817600&Signature=JPaiYvegVRGZjjUZty1HfoE165LtcYQAqiWebkdPcaR4R4T83MyFS4
Uvn-yp~M40PWHdlS7iBLYRP21K~rwaQWtztrUR8bR9bIvBhwR4subyaDFeT1DJ8bnV3NQ7-
HH4mJ0pJEUDsoIsSnhEnm-K-9JBv1PSwaI100K~WV4Y04I_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
]
]
]
]
],
[
"week-4",
[
[
"xxvi-the-knapsack-problem-week-4",
[
[
"week-4-overview",
{
"html": [
[
content>\n \n DYNAMIC PROGRAMMING BOOT CAMP: This week is devoted to the
dynamic programming design paradigm and a selection of killer applications: the
famous Knapsack problem in Part XXVI, the sequence alignment problem in Part XXVII,
and computing optimal binary search trees in Part XXVIII.\n \n \n HOMEWORK
#4: The fourth problem set and programming assignment reinforce the concepts and
algorithms studied in the lectures, and the programming assignment asks you to
implement a dynamic programming algorithm for the Knapsack problem.\n \n \n
SUGGESTED READINGS FOR WEEK 3:\n \n <ul bullettype=\"bullets\">\n <li>\n
\n CLRS Chapter 15\n \n </li>\n <li>\n \n DPV Chapter 6\n
\n </li>\n <li>\n \n KT Sections 6.3-6.6\n \n </li>\n
</ul>\n</co-content>\n<style>\n body {\n padding: 50px 85px 50px
$','$$'], ['$','$'] ],\n displayMath: [ [\"\\\\[\",\"\\\\]\"] ],\n
"instructions"
]
]
}
],
[
"the-knapsack-problem",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/QHU9GVcGTzm1PRlXBo85xA?
expiry=1499817600000&hmac=EbDPKDQxIRGAh-
hyDwxiaieU0_owrUr2iOn8Bzw0Sqc&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/QHU9GVcGTzm1PRlXBo85xA?
expiry=1499817600000&hmac=rYudaFHYVj3R5Ecvk38kuuVHvTRqf3U-
7wyDGLFnTnM&fileExtension=txt",
""
]
],
"mp4": [
[
%201%20-%20The%20Knapsack%20Problem%20%289%20min
%29.c89f2540cd3211e590a77f5aabd5e0c6/full/540p/index.mp4?
Expires=1499817600&Signature=HXrI2zMlRkRkIIS7zxlr8OuvOz89818MnYHTgzP9~CqOubiY-
x023MzFmubedVgqXduE-9xoGMEDbuE292aicQmy5Sv8mja-G5gQdtX-p1dS9hPMr3ez-
Z2Y7EaLfKC471xWwvMx1hE1XG~7rmyRjsLZxCeYfh71t2g1FZW4Sl8_&Key-Pair-
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_8823210d86d196073a78a0b60dc6301b_algo2-dp-
knapsack1-typed.pdf?Expires=1499817600&Signature=d8CIL5fCu9s5UIKgzrfY3yi-
~14AUESXJ6zz79PmcnkZ~68T16dbtLJOrhm1iHAyrGh1OhnR6KLyUmVpk1YDK9jyF8-
fPZpn2BU2weHgIc4XzRpzBDwmhcKCAbSZVDRzLjlsxnKqLRAm-
9tRk0Q4DFwP6qhBIwEaYsW0Iz5qiuA_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
"algo2-dp-knapsack1-typed"
]
]
}
],
[
"a-dynamic-programming-algorithm",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/eVi7p9C0TUKYu6fQtP1C4Q?
expiry=1499817600000&hmac=G33GcmN3OwDZOPnzsYiV8m_fy0_R9oevdvc1mn2tLg0&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/eVi7p9C0TUKYu6fQtP1C4Q?
expiry=1499817600000&hmac=iC1EvFblB6m_Kmr3TXrEZoVtcmJw8owNsu1MAElX61Q&fileExtension
=txt",
""
]
],
"mp4": [
[
%202%20-%20A%20Dynamic%20Programming%20Algorithm%20%289%20min
%29.d624c120cd3211e5b9bfdf06f13656c4/full/540p/index.mp4?
Expires=1499817600&Signature=C0Xb-0Bxn34X-AlsoakcBBj-
zoTVgm8h44LBJv9NvlBAcT4CPbNR6yCTeY7cV6wq8p3B162YGV8Sjeo-8a7WYQ0lUVKjMUg-
wah7SYQ4supujD8kO-7c3oUE1uA~~Sw3iLOtvgOEufzNQyScz~mWehKxM9EoqqBYhSPvrbzLAQU_&Key-
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_8823210d86d196073a78a0b60dc6301b_algo2-dp-
knapsack2-typed.pdf?
Expires=1499817600&Signature=Bgx4202Ul8lAgt~4T6AEs4pamAIzNrQkYvomS8o~9SSqSCDxfRZdJG
BEDshtLy3nWPNZQIPzDloqh1-FGFKVXRQNpeGMbji-
ZdgNhoMLjMqw6uUCJ~ZtUsmneDaPKDyD4zVaO~Yg2ZvbUy846m7k0DHrZbJ3162EYNOqWIPSLKw_&Key-
"algo2-dp-knapsack2-typed"
]
]
}
],
[
"example-review-optional",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/BZSQmrGbTu-UkJqxm37vuQ?
expiry=1499817600000&hmac=VeNsYMUN1XLv93LHWiFme1MtE3dnt0SVxUCfXlVxkbc&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/BZSQmrGbTu-UkJqxm37vuQ?
expiry=1499817600000&hmac=9WQH5LrZQhoyYH5AGuq88pbNiItnxMP4ln8S9psAvhs&fileExtension
=txt",
""
]
],
"mp4": [
[
"https://d3c33hcgiwev3.cloudfront.net/algo2-
knapsack-example_v2.f4171340cd3211e5a86743eb252f59ba/full/540p/index.mp4?
Expires=1499817600&Signature=WB7tNHkTT4WZrsJZkT1e--KjtdrJiy66-740Bwpu-
6anHwTr9qZaMOy7Ao9ZeaMwwE2eAoZJgXhiY6zXEH~6lprXOeqCHXdUkxL9IYKZ47Wmb6bG4s6ggmiLbgwS
4DfmNdJ4aaz7IKsXgru5xSnDsHJchVvvUi~1aZ7xYV9F7UM_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_8823210d86d196073a78a0b60dc6301b_algo2-
knapsack-example-typed.pdf?
Expires=1499817600&Signature=fkAWh9DB94Wx269MTaK67STYHq5NW5WrZSOK8CuU9xrvL1dUPlV9LI
CqIwE~AyPwl6ZUV3mcgFFJPPTxN1bphl3YLb9FHGC7OyPDh6RT~jSWfPEIY9~jr~QGIbwrFL7dUHz5DLh9r
luA6~tHK-mGUZGLO24IP~Q5E4XEKnk~RJc_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
"algo2-knapsack-example-typed"
]
]
}
]
]
],
[
"xxvii-sequence-alignment-week-4",
[
[
"optimal-substructure",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/_RbvKxmuQAKW7ysZrlACng?
expiry=1499817600000&hmac=kn9JeERXlKFD1L1estmAcWU02661XUjzUDqdLTIDlo8&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/_RbvKxmuQAKW7ysZrlACng?
expiry=1499817600000&hmac=RdYCQVdxLHC1BEFqH4ZJLI9_TjeFkzwUOZh6Z1HhYAM&fileExtension
=txt",
""
]
],
"mp4": [
[
%201%20-%20Optimal%20Substructure%20%2814%20min
%29.d1f0b460cd3211e5ac0d7790239fd55b/full/540p/index.mp4?
Expires=1499817600&Signature=gt3wHLJRXEZ4duGRwNYQ7Lhdd3D6JBNxcw8UswwhafPeOQIcFTwNTu
hfpM6F4D8YCmO~mD3k77HhPo7fv6UrSVxdGTYLjxbQA50BUDs4E9xNZ9W-
Yk1iLRE5iCeEStg7C2~83m17yKKyje1p9twP6RtaiymfCb0oVdUfNw28PjY_&Key-Pair-
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_383db2597c0de845da0d9632ce7bb33d_algo2-dp-
alignment1-typed.pdf?Expires=1499817600&Signature=MTU-
pi2CM4j5SppTfZBiEDW2kGu1ufpNr8v2CzToRS1yBm5JR~sCcnR1IiaS00PfCdBrCp5XQYJmJ9ic~dTJshx
OTyaOV4N91ucWoPCOv-g7qZNDy9hL-FSKlwcrhwIr3iHRDRiQsOt1Ou3NqiXlkfL~t37~Q0solHBRK2-
Utd8_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
"algo2-dp-alignment1-typed"
]
]
}
],
[
"a-dynamic-programming-algorithm",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/mpqg9W5VSniaoPVuVTp4NA?
expiry=1499817600000&hmac=iPTr3-
LobjqP_iLyMmhUVUM4Vib4TjZ9PifpJNM3Lf8&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/mpqg9W5VSniaoPVuVTp4NA?
expiry=1499817600000&hmac=M4Kkx5qI-
tmLXu6EOtd8wEl3BvyPP9mhZMwowFlHQ6o&fileExtension=txt",
""
]
],
"mp4": [
[
%202%20-%20A%20Dynamic%20Programming%20Algorithm%20%2812%20min
%29.e01e7720cd3211e5a86743eb252f59ba/full/540p/index.mp4?
Expires=1499817600&Signature=irqw2Jb1yPDVoVVnt46M3Z2LwahWakvzv~H8sCubJ1h90TMPeef1x0
Qt-
bacqjIq9RqlTUcO9QO0pPm36SpFEQCKbEh0ER90j0rvSWRdZpyMvVDB1EJrEXb1DDU5gGwCJT0ttXoZ3-
UnVLxfO7hOHl24n3eo5d2pMtj9VCB7uvk_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_383db2597c0de845da0d9632ce7bb33d_algo2-dp-
alignment2-typed.pdf?
Expires=1499817600&Signature=Ii~keGzh7tIQGEWhAA0Jo9ifWDXNexgmkvxquKazT0UcMtIbcgfY9L
KZGt59IjoBIqckySgx7cr1IUbjm4YXeYiNk9LFbUOIxddybqPqCzkPXZXIDANroTD8NIsT2fOsJt2Kil8jb
ytUECba~HrkGwUGpsAdNjC-3EkjA~PmPzU_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
"algo2-dp-alignment2-typed"
]
]
}
]
]
],
[
"xxviii-optimal-binary-search-trees-week-4",
[
[
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/9NNVZExdS-OTVWRMXQvjFQ?
expiry=1499817600000&hmac=jujc-
6_diY6hMjSl_7gfclQWop9SWf_5KuedfDb8W1Q&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/9NNVZExdS-OTVWRMXQvjFQ?
expiry=1499817600000&hmac=UlQxLi1sTI8BMxadqBblXsSXUuwS6R5ge3LDoTslzdY&fileExtension
=txt",
""
]
],
"mp4": [
[
%29.d2ca7290cd3211e590a77f5aabd5e0c6/full/540p/index.mp4?
Expires=1499817600&Signature=Fhv5z3Agj~2XA-
D01~41xnUXpGszUvTj~ttPInGxRw~kwkznaR3y2DZUKJ8kSAowbG8guOKEU4LsOSxdoU7q6hpEJtaEvkgZ7
kbV8tdZrGrQvoe~YjP6hy21gsBJUXtbOqVDRcwXrttNyT82-dX6DsAIb~sHYsEJ-4cWsA9Ch7c_&Key-
""
]
],
"pdf": [
[
"https://d3c33hcgiwev3.cloudfront.net/_39390dcc586519be0d6767b28e8a41c4_algo2-dp-
bst1-typed.pdf?
Expires=1499817600&Signature=HY8dKOgZ67e7TkyRj6VCIO3scq0~exMCsbvCxzGJvgfpRh~JfmUTGM
pTJSP3uuGq6LRMWLIdVWjLIxONvmmra7c9AldjMUYoQfPZ0KoWqPachSjv98gV1oCTg5OV7VhmDDYBS0r1j
Kf~H5vyqaE~GyijFri~56PWXDMm9l0SzdI_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
"algo2-dp-bst1-typed"
]
]
}
],
[
"optimal-substructure",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/yuSB0-IFTnSkgdPiBV50iQ?
expiry=1499817600000&hmac=tan4fvlCS129GrMud1TeToNnG0AF_LbBIa4Sv6eKnW0&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/yuSB0-IFTnSkgdPiBV50iQ?
expiry=1499817600000&hmac=4U52AuavnUQYWr4C7oR5wQJSGFxQ-
00E229GopowTj8&fileExtension=txt",
""
]
],
"mp4": [
[
%202%20-%20Optimal%20Substructure%20%289%20min
%29.cc521b21cd3211e5a86743eb252f59ba/full/540p/index.mp4?
Expires=1499817600&Signature=aiZv2F8~yzCaqwX6BjqFWhkMRiY3hzZhfQLYPsUpeRtj1xr9b5Wh2f
4eDPOmQK7cOBRgI4WweP-2mFBTskdr0qS8iT-
HDffzrskA5AHWhyMpUB~ijQF7ZjwGbRGA1puV23hBbYyQSa6Ime2iybli2prxFa67SKBQSqcLiBohn8s_&K
ey-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
bst2-typed.pdf?
Expires=1499817600&Signature=OkWwmDkNs1dUdwFsYfuq4Y1aqD~uVuQeo8d0TVphyZgFVTUEva8fA-
4fhpjBFYdTadItjcnxXZuH5g~a8zrQBUmTp-6sdP9vTgc02aONRKvCB5Kn6n-
Gvr2jqHFlg4BLSaAynoha7pZUM0JfPTSoTC3heJLnAUYikxMunsRDhWQ_&Key-Pair-
]
]
}
],
[
"proof-of-optimal-substructure",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/Vnmt099FSnS5rdPfRXp0pg?
expiry=1499817600000&hmac=VOZPvReGJFki_ckdHLNeyo4t7LCX8qnRfcSiMOM0H9I&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/Vnmt099FSnS5rdPfRXp0pg?
expiry=1499817600000&hmac=MN-
XmPP9ScyvQDc2Zj3UufvxYkVkJKEsVDpEdDd58x4&fileExtension=txt",
""
]
],
"mp4": [
[
%203%20-%20Proof%20of%20Optimal%20Substructure%20%287%20min
%29.c55c5650cd3211e58b944901e1f880e1/full/540p/index.mp4?
Expires=1499817600&Signature=GhMcW2pP3qOCsvmoAi3xQ3Sb7FjP1q4xGXcSKcj7N5N4scadm02dng
aP9c9hFztjCWf~ryQ8uxRXU2d0XnqUrEzCLLWs6KW7wT5VKWk2RZdtSg6yG3FUp9dgJlQ4gR2vTfQ8bYa0D
aLH2FS8iwibFbD1-BiP15z9JA9ykNXCxEU_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
""
]
],
"pdf": [
[
bst2-typed.pdf?
Expires=1499817600&Signature=OkWwmDkNs1dUdwFsYfuq4Y1aqD~uVuQeo8d0TVphyZgFVTUEva8fA-
4fhpjBFYdTadItjcnxXZuH5g~a8zrQBUmTp-6sdP9vTgc02aONRKvCB5Kn6n-
Gvr2jqHFlg4BLSaAynoha7pZUM0JfPTSoTC3heJLnAUYikxMunsRDhWQ_&Key-Pair-
]
]
}
],
[
"a-dynamic-programming-algorithm-i",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/evuQnsoLQbq7kJ7KC6G6Qw?
expiry=1499817600000&hmac=o0lXmJ3KzRlXuWkSX3KMJxl0wMXybvWiTBr_QCXmPi0&fileExtension
=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/evuQnsoLQbq7kJ7KC6G6Qw?
expiry=1499817600000&hmac=WbPtSg_cj8lEdGafhSnGzoiuoi2qQnV2fH-
EXcXcEvk&fileExtension=txt",
""
]
],
"mp4": [
[
%204%20-%20A%20Dynamic%20Programming%20Algorithm%20I%20%2810%20min
%29.c9a21650cd3211e590ba93556b0ccbbe/full/540p/index.mp4?
Expires=1499817600&Signature=eyonGcfF6GqXQBQfRO~~313EFrBZH0kqV42AvxoSf8LcJMl7cdJQwk
2P5dma-8kzLwu5ulfaknzDFVM32pOTtMhck14fjz-UzmWvt-k9kLPd8IZbZLm-
PBwJY~lwCBu5GXSB9M4bVLdzEgXr4S59xeBUNmpXbq~3P-zVuUFdY~s_&Key-Pair-
""
]
],
"pdf": [
[
bst3-typed.pdf?
Expires=1499817600&Signature=egIf3ySyT61TjKHyXq9tPpmAI912PzDXKlAPbrvt287TsONbfBle2c
0a~uj8KLfoWYwdbWmiO5~dkygLX6kkOgfnSXJ-V2Zyn9OT7YcxjDFX7jPvg4DbG3~F0Zsf7dbrIniL-
~il9LiDvWulGr6q2GdOcYz4-9ZZxIgnqZmega4_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
],
[
"a-dynamic-programming-algorithm-ii",
{
"en.srt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/x0T70uGpTwmE-9LhqV8JTQ?
expiry=1499817600000&hmac=-w39mT3S53B_F80Lv_o1NT6yPw-
lTl8Y1MJJgRUdcN0&fileExtension=srt",
""
]
],
"en.txt": [
[
"https://www.coursera.org/api/subtitleAssetProxy.v1/x0T70uGpTwmE-9LhqV8JTQ?
expiry=1499817600000&hmac=PpJMPxypRL1_IaPrGSR-
b6szOXqpWxxi83uPITTaZWE&fileExtension=txt",
""
]
],
"mp4": [
[
%205%20-%20A%20Dynamic%20Programming%20Algorithm%20II%20%289%20min
%29.c8264bc0cd3211e590a77f5aabd5e0c6/full/540p/index.mp4?
Expires=1499817600&Signature=bIHKqqsWQNeT7j9~zcPtdqxHa6oCCa~Yexctr2wi3fXU8M8WrVSUux
LyzBlOwJ58HGvRh9ioto0Lh-2ORgvNMdLOVxHoneD6-
ERIurpoHf6PNjPPsPxMNugYqDjNUqSCyHskHedtVijrsJIWToOHw8IVD6Fow3dGe7wYyz1N7~I_&Key-
""
]
],
"pdf": [
[
bst3-typed.pdf?
Expires=1499817600&Signature=egIf3ySyT61TjKHyXq9tPpmAI912PzDXKlAPbrvt287TsONbfBle2c
0a~uj8KLfoWYwdbWmiO5~dkygLX6kkOgfnSXJ-V2Zyn9OT7YcxjDFX7jPvg4DbG3~F0Zsf7dbrIniL-
~il9LiDvWulGr6q2GdOcYz4-9ZZxIgnqZmega4_&Key-Pair-Id=APKAJLTNE6QMUY6HBC5A",
]
]
}
]
]
],
[
"problem-set-4",
[
[
{
"html": [
[
content>\n <ol bullettype=\"numbers\">\n <li>\n \n Give a
dynamic programming algorithm that computes an optimal binary search tree and runs
in $$O(n^2)$$ time.\n \n </li>\n </ol>\n</co-content>\n<style>\n body {\n
padding: 50px 85px 50px 85px;\n}\n\ntable th, table td {\n border: 1px solid
#e0e0e0;\n padding: 5px 20px;\n text-align: left;\n}\ninput {\n margin:
10px;\n}\n}\nth {\n font-weight: bold;\n}\ntd, th {\n display: table-cell;\n
vertical-align: inherit;\n}\nimg {\n height: auto;\n max-width: 100%;\n}\npre
{\n display: block;\n margin: 20px;\n background: #424242;\n color:
#fff;\n font-size: 13px;\n white-space: pre-wrap;\n padding: 9.5px;\n
margin: 0 0 10px;\n border: 1px solid #ccc;\n}\n</style>\n<script async=\"\"
$','$$'], ['$','$'] ],\n displayMath: [ [\"\\\\[\",\"\\\\]\"] ],\n
"instructions"
]
]
}
]
]
],
[
"final-exam-1-attempt-per-24-hours",
[
[
"info-and-faq-for-final-exam",
{
"html": [
[
content>\n \n 1. Unlike the problem sets, you have only ONE attempt per 24
hours. Thus DO NOT START THE EXAM until you are ready.\n \n \n 2. There are
10 questions, and each is worth 1 point. Many are of the \"select all that apply\"
type, rather than the strict multiple choice format that is more common on the
problem sets. You will receive partial credit for each option that you leave
correctly checked or correctly unchecked. (So if you mark 4 out of the 5 options
for a problem correctly, you'll receive 0.8 out of the 1 point.) You need 7 points
total to pass the exam. All questions are about material covered in the required
(i.e., non-optional) videos.\n \n \n 3. Roughly half of the questions
follow fairly directly from the lecture material (assuming that you understand it
thoroughly). Roughly a quarter of the questions are variations on problem set
questions. Roughly a quarter of the questions demand more thought, for example by
asking you to consider whether certain results from lecture do or do not extend to
more general situations.\n \n \n 4. Good luck!\n \n</co-
content>\n<style>\n body {\n padding: 50px 85px 50px 85px;\n}\n\ntable th, table
td {\n border: 1px solid #e0e0e0;\n padding: 5px 20px;\n text-align:
left;\n}\ninput {\n margin: 10px;\n}\n}\nth {\n font-weight: bold;\n}\ntd, th
{\n display: table-cell;\n vertical-align: inherit;\n}\nimg {\n height:
auto;\n max-width: 100%;\n}\npre {\n display: block;\n margin: 20px;\n
background: #424242;\n color: #fff;\n font-size: 13px;\n white-space: pre-
wrap;\n padding: 9.5px;\n margin: 0 0 10px;\n border: 1px solid
#ccc;\n}\n</style>\n<script async=\"\"
$','$$'], ['$','$'] ],\n displayMath: [ [\"\\\\[\",\"\\\\]\"] ],\n
"instructions"
]
]
}
]
]
]
]
]
]

Algorithms Greedy Syllabus Parsed

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Algorithms Greedy Syllabus Parsed

Загружено:

Авторское право:

Доступные форматы

[

Вам также может понравиться