🕷️ Crawler Inspector

URL Lookup

Direct Parameter Lookup

Raw Queries and Responses

1. Shard Calculation

Query:

Response:

Calculated Shard: 143 (from laksa169)

2. Crawled Status Check

Query:

curl -X POST \
  'http://laksa143.int.ahrefs:8124/' \
  -H 'Content-Type: text/plain' \
  -H 'X-ClickHouse-Database: crawler3' \
  -H 'Authorization: Basic YXBpOg==' \
  -d 'SELECT getAhrefsURLFromUnparsed(src_unparsed) AS found_url, ifNull(toUnixTimestamp(download_stamp), 0) AS crawl_time, ifNull(toUnixTimestamp(props_url_first_seen), 0) AS first_indexed_time, download_http_code AS http_code, src_unparsed AS src_unparsed, src_root_hash AS src_root_hash, history_drop_reason AS history_drop_reason, meta_title AS meta_title, meta_descriptions AS meta_descriptions, attrs_boilerpipe_text AS attrs_boilerpipe_text, attrs_markdown AS attrs_markdown, attrs_readable_markdown AS attrs_readable_markdown, meta_canonical AS meta_canonical FROM crawler3.page_info_local FINAL PREWHERE (src_root_hash, src_unparsed) IN ((getAhrefsRootHashFromUnparsed(getAhrefsUnparsedNoserviceFromURL(\'https://stanford-cs161.github.io/winter2024/lectures/\')), getAhrefsUnparsedNoserviceFromURL(\'https://stanford-cs161.github.io/winter2024/lectures/\'))) FORMAT JSONEachRow'

Response:

{"found_url":"https:\/\/stanford-cs161.github.io\/winter2024\/lectures\/","crawl_time":1775302645,"first_indexed_time":1705076344,"http_code":200,"src_unparsed":"io,github!stanford-cs161,\/winter2024\/lectures\/ s443","src_root_hash":"2566890010099092343","history_drop_reason":null,"meta_title":"Lectures | CS 161 (Archived)","meta_descriptions":["A listing of all the course lectures."],"attrs_boilerpipe_text":"General Lecture Information\nLectures will be recorded and the recordings can be accessed on\nCanvas\n.\nLecture 1: Why are you here?\nMon, Jan 8, 10:30 am\n–\n12:00 pm\n(Nima)\nLecture resources\nLecture notes: [\nPDF\n]\nSlides: [\nPDF\n] [\nPowerPoint\n]\nPython notebook: [\nColab\n] [\nZip\n]\nConcept check questions: [\nInteractive SVG\n] [\nSolved PDF\n]\nAdditional reading: AI Part I 1.1, 1.2, 1.3, 3.1\nRecording\nVideo: [\nCanvas\n]\nLecture 2: Asymptotics, Worst-Case Analysis, and MergeSort\nWed, Jan 10, 10:30 am\n–\n12:00 pm\n(Nima)\nPre-lecture resources\nPre-lecture exercise: [\nPDF\n]\nPre-lecture Python notebook: [\nColab\n] [\nZip\n]\nLecture resources\nLecture notes: [\nPDF\n]\nSlides: [\nPDF\n] [\nPowerPoint\n]\nPython notebook: [\nColab\n] [\nZip\n]\nConcept check questions on asymptotics: [\nInteractive SVG\n] [\nSolved PDF\n]\nConcept check questions on sorting: [\nInteractive SVG\n] [\nSolved PDF\n]\nAdditional reading: AI Part I 1.4, 1.5, 1.6, 2; CLRS 2.3, 3\nRecording\nVideo: [\nCanvas\n]\nLecture 3: Solving Recurrences and the Master Theorem\nWed, Jan 17, 10:30 am\n–\n12:00 pm\n(Moses)\nPre-lecture resources\nPre-lecture exercise: [\nPDF\n]\nLecture resources\nLecture notes: [\nPDF\n]\nSlides: [\nPDF\n] [\nPowerPoint\n]\nConcept check questions: [\nInteractive SVG\n] [\nSolved PDF\n]\nAdditional reading: AI Part I 4; CLRS 4.3, 4.4, 4.5\nRecording\nVideo: [\nCanvas\n]\nMon, Jan 22, 10:30 am\n–\n12:00 pm\n(Nima)\nPre-lecture resources\nPre-lecture exercise: [\nPDF\n]\nLecture resources\nLecture notes: [\nPDF\n]\nSlides: [\nPDF\n] [\nPowerPoint\n]\nPython notebook: [\nColab\n] [\nZip\n]\nConcept check questions: [\nInteractive SVG\n] [\nSolved PDF\n]\nAdditional reading: AI Part I 6; CLRS 9\nRecording\nVideo: [\nCanvas\n]\nLecture 5: Randomized Algorithms and QuickSort\nWed, Jan 24, 10:30 am\n–\n12:00 pm\n(Nima)\nPre-lecture resources\nPre-lecture exercise: [\nPDF\n]\nLecture resources\nLecture notes: [\nPDF\n]\nSlides: [\nPDF\n] [\nPowerPoint\n]\nPython notebook: [\nColab\n] [\nZip\n]\nConcept check questions: [\nInteractive SVG\n] [\nSolved PDF\n]\nAdditional reading: AI Part I 5; CLRS 5.1, 5.2, 5.3, 7\nRecording\nVideo: [\nCanvas\n]\nLecture 6: BucketSort and Lower Bounds for Sorting\nMon, Jan 29, 10:30 am\n–\n12:00 pm\n(Moses)\nPre-lecture resources\nPre-lecture exercise: [\nPDF\n]\nLecture resources\nLecture notes: [\nPDF\n]\nSlides: [\nPDF\n] [\nPowerPoint\n]\nPython notebook: [\nColab\n] [\nZip\n]\nConcept check questions: [\nInteractive SVG\n] [\nSolved PDF\n]\nAdditional reading: AI Part I 5.6; CLRS 8.1, 8.2; [\nAvrim Blum’s notes on sorting lower bounds\n]\nRecording\nVideo: [\nCanvas\n]\nLecture 7: Binary Search Trees and Red-Black Trees\nWed, Jan 31, 10:30 am\n–\n12:00 pm\n(Moses)\nPre-lecture resources\nPre-lecture exercise: [\nPDF\n]\nLecture resources\nLecture notes: [\nPDF\n]\nSlides: [\nPDF\n] [\nPowerPoint\n]\nConcept check questions: [\nInteractive SVG\n] [\nSolved PDF\n]\nAdditional reading: AI Part II 11; CLRS 12.1, 12.2, 12.3, 13\nRecording\nVideo: [\nCanvas\n]\nLecture 8: Hashing\nMon, Feb 5, 10:30 am\n–\n12:00 pm\n(Nima)\nPre-lecture resources\nPre-lecture exercise: [\nPDF\n]\nLecture resources\nLecture notes: [\nPDF\n]\nSlides: [\nPDF\n] [\nPowerPoint\n]\nPython notebook: [\nColab\n] [\nZip\n]\nConcept check questions: [\nInteractive SVG\n] [\nSolved PDF\n]\nAdditional reading: AI Part II 12; CLRS 11\nRecording\nVideo: [\nCanvas\n]\nLecture 9: Graphs and BFS and DFS\nWed, Feb 7, 10:30 am\n–\n12:00 pm\n(Nima)\nPre-lecture resources\nPre-lecture exercise: [\nPDF\n]\nLecture resources\nLecture notes: [\nPDF\n]\nSlides: [\nPDF\n] [\nPowerPoint\n]\nPython notebook: [\nColab\n] [\nZip\n]\nConcept check questions: [\nInteractive SVG\n] [\nSolved PDF\n]\nAdditional reading: AI Part II 7, 8.1, 8.2, 8.3, 8.4, 8.5; CLRS 22.1, 22.2, 22.3, 22.4\nRecording\nVideo: [\nCanvas\n]\nLecture 10: Strongly Connected Components\nMon, Feb 12, 10:30 am\n–\n12:00 pm\n(Moses)\nPre-lecture resources\nPre-lecture exercise: [\nPDF\n]\nLecture resources\nLecture notes: [\nPDF\n]\nSlides: [\nPDF\n] [\nPowerPoint\n]\nPython notebook: [\nColab\n] [\nZip\n]\nConcept check questions: [\nInteractive SVG\n] [\nSolved PDF\n]\nAdditional reading: AI Part II 8.6; CLRS 22.5\nRecording\nVideo: [\nCanvas\n]\nLecture 11: Dijkstra and Bellman-Ford\nWed, Feb 14, 10:30 am\n–\n12:00 pm\n(Moses)\nPre-lecture resources\nPre-lecture exercise: [\nPDF\n]\nLecture resources\nLecture notes: [\nPDF\n]\nSlides: [\nPDF\n] [\nPowerPoint\n]\nPython notebook: [\nColab\n] [\nZip\n]\nConcept check questions: [\nInteractive SVG\n] [\nSolved PDF\n]\nAdditional reading: AI Part II 9, Part III 18.1, 18.2; CLRS 24.1, 24.3\nRecording\nVideo: [\nCanvas\n]\nLecture 12: Dynamic Programming: Bellman-Ford and Floyd-Warshall\nWed, Feb 21, 10:30 am\n–\n12:00 pm\n(Nima)\nPre-lecture resources\nPre-lecture exercise: [\nPDF\n]\nLecture resources\nLecture notes: [\nPDF\n]\nSlides: [\nPDF\n] [\nPowerPoint\n]\nPython notebook: [\nColab\n] [\nZip\n]\nConcept check questions: [\nInteractive SVG\n] [\nSolved PDF\n]\nAdditional reading: AI Part III 18; CLRS 25.2, 15.1\nRecording\nVideo: [\nCanvas\n]\nLecture 13: More Dynamic Programming: LCS, Knapsack, Independent Set\nMon, Feb 26, 10:30 am\n–\n12:00 pm\n(Moses)\nPre-lecture resources\nPre-lecture exercise: None this time!\nLecture resources\nLecture notes: [\nPDF\n]\nSlides: [\nPDF\n] [\nPowerPoint\n]\nConcept check questions: [\nInteractive SVG\n] [\nSolved PDF\n]\nAdditional reading: AI Part III 16; CLRS 15.4\nRecording\nVideo: [\nCanvas\n]\nLecture 14: Greedy Algorithms\nWed, Feb 28, 10:30 am\n–\n12:00 pm\n(Moses)\nPre-lecture resources\nPre-lecture exercise: [\nPDF\n]\nLecture resources\nLecture notes: [\nPDF\n]\nSlides: [\nPDF\n] [\nPowerPoint\n]\nPython notebook: [\nColab\n] [\nZip\n]\nConcept check questions: [\nInteractive SVG\n] [\nSolved PDF\n]\nAdditional reading: AI Part III 13, 14; CLRS 16.1, 16.2, 16.3\nLecture 15: Minimum Spanning Trees\nMon, Mar 4, 10:30 am\n–\n12:00 pm\n(Nima)\nPre-lecture resources\nPre-lecture exercise: [\nPDF\n]\nLecture resources (coming)\nLecture notes: [\nPDF\n]\nSlides: [\nPDF\n] [\nPowerPoint\n]\nPython notebook: [\nColab\n] [\nZip\n]\nConcept check questions: [\nInteractive SVG\n] [\nSolved PDF\n]\nAdditional reading: AI Part III 15; CLRS 23\nRecording\nVideo: [\nCanvas\n]\nLecture 16: Max-Flow and the Ford-Fulkerson Algorithm\nWed, Mar 6, 10:30 am\n–\n12:00 pm\n(Nima)\nPre-lecture resources\nPre-lecture exercise: [\nPDF\n]\nLecture resources\nLecture notes: [\nPDF\n]\nSlides: [\nPDF\n] [\nPowerPoint\n]\nConcept check questions: [\nInteractive SVG\n] [\nSolved PDF\n]\nAdditional reading: CLRS 26.1, 26.2, 26.3; Alexander Schrijver’s paper:\nOn the history of the transportation and maximum flow problem\nRecording\nVideo: [\nCanvas\n]\nLecture 17: Stable Matchings and Gale-Shapley\nMon, Mar 11, 10:30 am\n–\n12:00 pm\n(Moses)\nPre-lecture resources\nPre-lecture exercise: None this time!\nLecture resources\nLecture notes: [\nPDF\n]\nSlides: [\nPDF\n] [\nPowerPoint\n]\nConcept check questions: [\nInteractive SVG\n] [\nSolved PDF\n]\nAdditional reading:\nLecture notes by Tim Roughgarden\n.\nRecording\nVideo: [\nCanvas\n]\nLecture 18: What's next?\nWed, Mar 13, 10:30 am\n–\n12:00 pm\n(Moses)\nPre-lecture resources\nPre-lecture exercise: None this time!\nLecture resources\nSlides: [\nPDF\n] [\nPowerPoint\n]\nRecording\nVideo: [\nCanvas\n]","attrs_markdown":"[CS 161 (Archived)](https:\/\/stanford-cs161.github.io\/winter2024\/)\n\n- [Schedule](https:\/\/stanford-cs161.github.io\/winter2024\/schedule\/)\n- [Lectures](https:\/\/stanford-cs161.github.io\/winter2024\/lectures\/)\n- [EthiCS Lectures](https:\/\/stanford-cs161.github.io\/winter2024\/ethics\/)\n- [Sections](https:\/\/stanford-cs161.github.io\/winter2024\/sections\/)\n- [Homework](https:\/\/stanford-cs161.github.io\/winter2024\/homework\/)\n- [Exams](https:\/\/stanford-cs161.github.io\/winter2024\/exams\/)\n- [Resources](https:\/\/stanford-cs161.github.io\/winter2024\/resources\/)\n- [Policies](https:\/\/stanford-cs161.github.io\/winter2024\/policies\/)\n- [Staff \/ Office Hours](https:\/\/stanford-cs161.github.io\/winter2024\/staff\/)\n- [CS 161A](https:\/\/stanford-cs161.github.io\/winter2024\/cs161a\/)\n\nThis site uses [Just the Docs](https:\/\/github.com\/pmarsceill\/just-the-docs), a documentation theme for Jekyll.\n\n- [Canvas](https:\/\/canvas.stanford.edu\/courses\/185149)\n- [Ed](https:\/\/edstem.org\/us\/courses\/50592)\n- [Gradescope](https:\/\/www.gradescope.com\/courses\/688809)\n\n## General Lecture Information\n- Lectures will be recorded and the recordings can be accessed on [Canvas](https:\/\/canvas.stanford.edu\/courses\/185149).\n## Lectures\n## Lecture 1: Why are you here?\n[Mon, Jan 8, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240108T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240108T1200&p1=1240) (Nima)\n\n##### Lecture resources\n- Lecture notes: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture1-notes.pdf)\\]\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture1-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture1-slides.pptx)\\]\n- Python notebook: \\[[Colab](http:\/\/colab.research.google.com\/github\/stanford-cs161\/winter2024-extra\/blob\/colab\/lecture1_karatsuba.ipynb)\\] \\[[Zip](https:\/\/stanford-cs161.github.io\/winter2024-extra\/lecture1_karatsuba.zip)\\]\n- Concept check questions: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/multiplication.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/multiplication.pdf)\\]\n- Additional reading: AI Part I 1.1, 1.2, 1.3, 3.1\n##### Recording\n- Video: \\[[Canvas](https:\/\/stanford-pilot.hosted.panopto.com\/Panopto\/Pages\/Viewer.aspx?id=bc93eae7-82b1-478e-b373-b0dd00055712)\\]\n\n## Lecture 2: Asymptotics, Worst-Case Analysis, and MergeSort\n[Wed, Jan 10, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240110T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240110T1200&p1=1240) (Nima)\n\n##### Pre-lecture resources\n- Pre-lecture exercise: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture2-pre.pdf)\\]\n- Pre-lecture Python notebook: \\[[Colab](http:\/\/colab.research.google.com\/github\/stanford-cs161\/winter2024-extra\/blob\/colab\/lecture2_pre.ipynb)\\] \\[[Zip](https:\/\/stanford-cs161.github.io\/winter2024-extra\/lecture2_pre.zip)\\]\n##### Lecture resources\n- Lecture notes: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture2-notes.pdf)\\]\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture2-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture2-slides.pptx)\\]\n- Python notebook: \\[[Colab](http:\/\/colab.research.google.com\/github\/stanford-cs161\/winter2024-extra\/blob\/colab\/lecture2_sorting.ipynb)\\] \\[[Zip](https:\/\/stanford-cs161.github.io\/winter2024-extra\/lecture2_sorting.zip)\\]\n- Concept check questions on asymptotics: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/asymptotics.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/asymptotics.pdf)\\]\n- Concept check questions on sorting: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/sorting.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/sorting.pdf)\\]\n- Additional reading: AI Part I 1.4, 1.5, 1.6, 2; CLRS 2.3, 3\n##### Recording\n- Video: \\[[Canvas](https:\/\/stanford-pilot.hosted.panopto.com\/Panopto\/Pages\/Viewer.aspx?id=7676a00c-8c7b-420c-85f4-b0dd0005576d)\\]\n\n## Lecture 3: Solving Recurrences and the Master Theorem\n[Wed, Jan 17, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240117T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240117T1200&p1=1240) (Moses)\n\n##### Pre-lecture resources\n- Pre-lecture exercise: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture3-pre.pdf)\\]\n##### Lecture resources\n- Lecture notes: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture3-notes.pdf)\\]\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture3-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture3-slides.pptx)\\]\n- Concept check questions: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/recurrence.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/recurrence.pdf)\\]\n- Additional reading: AI Part I 4; CLRS 4.3, 4.4, 4.5\n##### Recording\n- Video: \\[[Canvas](https:\/\/stanford-pilot.hosted.panopto.com\/Panopto\/Pages\/Viewer.aspx?id=d2cc4ef3-4b5c-4013-a377-b0dd000557ba)\\]\n\n## Lecture 4: Median and Selection\n[Mon, Jan 22, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240122T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240122T1200&p1=1240) (Nima)\n\n##### Pre-lecture resources\n- Pre-lecture exercise: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture4-pre.pdf)\\]\n##### Lecture resources\n- Lecture notes: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture4-notes.pdf)\\]\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture4-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture4-slides.pptx)\\]\n- Python notebook: \\[[Colab](http:\/\/colab.research.google.com\/github\/stanford-cs161\/winter2024-extra\/blob\/colab\/lecture4_select.ipynb)\\] \\[[Zip](https:\/\/stanford-cs161.github.io\/winter2024-extra\/lecture4_select.zip)\\]\n- Concept check questions: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/select.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/select.pdf)\\]\n- Additional reading: AI Part I 6; CLRS 9\n##### Recording\n- Video: \\[[Canvas](https:\/\/stanford-pilot.hosted.panopto.com\/Panopto\/Pages\/Viewer.aspx?id=397943e0-5f06-4ed3-bed2-b0ff01310f78)\\]\n\n## Lecture 5: Randomized Algorithms and QuickSort\n[Wed, Jan 24, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240124T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240124T1200&p1=1240) (Nima)\n\n##### Pre-lecture resources\n- Pre-lecture exercise: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture5-pre.pdf)\\]\n##### Lecture resources\n- Lecture notes: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture5-notes.pdf)\\]\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture5-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture5-slides.pptx)\\]\n- Python notebook: \\[[Colab](http:\/\/colab.research.google.com\/github\/stanford-cs161\/winter2024-extra\/blob\/colab\/lecture5_quicksort.ipynb)\\] \\[[Zip](https:\/\/stanford-cs161.github.io\/winter2024-extra\/lecture5_quicksort.zip)\\]\n- Concept check questions: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/random.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/random.pdf)\\]\n- Additional reading: AI Part I 5; CLRS 5.1, 5.2, 5.3, 7\n##### Recording\n- Video: \\[[Canvas](https:\/\/stanford-pilot.hosted.panopto.com\/Panopto\/Pages\/Viewer.aspx?id=b7874fa8-cbbd-48ca-a017-b0dd000557fd)\\]\n\n## Lecture 6: BucketSort and Lower Bounds for Sorting\n[Mon, Jan 29, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240129T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240129T1200&p1=1240) (Moses)\n\n##### Pre-lecture resources\n- Pre-lecture exercise: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture6-pre.pdf)\\]\n##### Lecture resources\n- Lecture notes: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture6-notes.pdf)\\]\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture6-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture6-slides.pptx)\\]\n- Python notebook: \\[[Colab](http:\/\/colab.research.google.com\/github\/stanford-cs161\/winter2024-extra\/blob\/colab\/lecture6_bucketsort.ipynb)\\] \\[[Zip](https:\/\/stanford-cs161.github.io\/winter2024-extra\/lecture6_bucketsort.zip)\\]\n- Concept check questions: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/sortingmodels.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/sortingmodels.pdf)\\]\n- Additional reading: AI Part I 5.6; CLRS 8.1, 8.2; \\[[Avrim Blum’s notes on sorting lower bounds](http:\/\/www.cs.cmu.edu\/~avrim\/451f11\/lectures\/lect0913.pdf)\\]\n##### Recording\n- Video: \\[[Canvas](https:\/\/stanford-pilot.hosted.panopto.com\/Panopto\/Pages\/Viewer.aspx?id=16d283da-eabc-470f-8801-b0dd0005584b)\\]\n\n## Lecture 7: Binary Search Trees and Red-Black Trees\n[Wed, Jan 31, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240131T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240131T1200&p1=1240) (Moses)\n\n##### Pre-lecture resources\n- Pre-lecture exercise: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture7-pre.pdf)\\]\n##### Lecture resources\n- Lecture notes: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture7-notes.pdf)\\]\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture7-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture7-slides.pptx)\\]\n- Concept check questions: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/bst.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/bst.pdf)\\]\n- Additional reading: AI Part II 11; CLRS 12.1, 12.2, 12.3, 13\n##### Recording\n- Video: \\[[Canvas](https:\/\/stanford-pilot.hosted.panopto.com\/Panopto\/Pages\/Viewer.aspx?id=a6e68b7c-6016-4b80-aeca-b0dd0005585e)\\]\n\n## Lecture 8: Hashing\n[Mon, Feb 5, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240205T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240205T1200&p1=1240) (Nima)\n\n##### Pre-lecture resources\n- Pre-lecture exercise: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture8-pre.pdf)\\]\n##### Lecture resources\n- Lecture notes: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture8-notes.pdf)\\]\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture8-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture8-slides.pptx)\\]\n- Python notebook: \\[[Colab](http:\/\/colab.research.google.com\/github\/stanford-cs161\/winter2024-extra\/blob\/colab\/lecture8_hashing.ipynb)\\] \\[[Zip](https:\/\/stanford-cs161.github.io\/winter2024-extra\/lecture8_hashing.zip)\\]\n- Concept check questions: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/hashing.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/hashing.pdf)\\]\n- Additional reading: AI Part II 12; CLRS 11\n##### Recording\n- Video: \\[[Canvas](https:\/\/stanford-pilot.hosted.panopto.com\/Panopto\/Pages\/Viewer.aspx?id=7403154f-3b33-49ee-b75b-b0dd0005588e)\\]\n\n## Lecture 9: Graphs and BFS and DFS\n[Wed, Feb 7, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240207T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240207T1200&p1=1240) (Nima)\n\n##### Pre-lecture resources\n- Pre-lecture exercise: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture9-pre.pdf)\\]\n##### Lecture resources\n- Lecture notes: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture9-notes.pdf)\\]\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture9-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture9-slides.pptx)\\]\n- Python notebook: \\[[Colab](http:\/\/colab.research.google.com\/github\/stanford-cs161\/winter2024-extra\/blob\/colab\/lecture9_graphs.ipynb)\\] \\[[Zip](https:\/\/stanford-cs161.github.io\/winter2024-extra\/lecture9_graphs.zip)\\]\n- Concept check questions: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/bfsdfs.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/bfsdfs.pdf)\\]\n- Additional reading: AI Part II 7, 8.1, 8.2, 8.3, 8.4, 8.5; CLRS 22.1, 22.2, 22.3, 22.4\n##### Recording\n- Video: \\[[Canvas](https:\/\/stanford-pilot.hosted.panopto.com\/Panopto\/Pages\/Viewer.aspx?id=392878c1-e58b-4aa7-83bb-b0dd000558b0)\\]\n\n## Lecture 10: Strongly Connected Components\n[Mon, Feb 12, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240212T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240212T1200&p1=1240) (Moses)\n\n##### Pre-lecture resources\n- Pre-lecture exercise: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture10-pre.pdf)\\]\n##### Lecture resources\n- Lecture notes: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture10-notes.pdf)\\]\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture10-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture10-slides.pptx)\\]\n- Python notebook: \\[[Colab](http:\/\/colab.research.google.com\/github\/stanford-cs161\/winter2024-extra\/blob\/colab\/lecture10_scc.ipynb)\\] \\[[Zip](https:\/\/stanford-cs161.github.io\/winter2024-extra\/lecture10_scc.zip)\\]\n- Concept check questions: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/scc.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/scc.pdf)\\]\n- Additional reading: AI Part II 8.6; CLRS 22.5\n##### Recording\n- Video: \\[[Canvas](https:\/\/stanford-pilot.hosted.panopto.com\/Panopto\/Pages\/Viewer.aspx?id=5e56256c-98f8-43f6-8702-b0dd000558dc)\\]\n\n## Lecture 11: Dijkstra and Bellman-Ford\n[Wed, Feb 14, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240214T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240214T1200&p1=1240) (Moses)\n\n##### Pre-lecture resources\n- Pre-lecture exercise: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture11-pre.pdf)\\]\n##### Lecture resources\n- Lecture notes: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture11-notes.pdf)\\]\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture11-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture11-slides.pptx)\\]\n- Python notebook: \\[[Colab](http:\/\/colab.research.google.com\/github\/stanford-cs161\/winter2024-extra\/blob\/colab\/lecture11_dijkstra.ipynb)\\] \\[[Zip](https:\/\/stanford-cs161.github.io\/winter2024-extra\/lecture11_dijkstra.zip)\\]\n- Concept check questions: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/dijkstra.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/dijkstra.pdf)\\]\n- Additional reading: AI Part II 9, Part III 18.1, 18.2; CLRS 24.1, 24.3\n##### Recording\n- Video: \\[[Canvas](https:\/\/stanford-pilot.hosted.panopto.com\/Panopto\/Pages\/Viewer.aspx?id=d90ca3e3-23de-4737-9148-b0dd000558f9)\\]\n\n## Lecture 12: Dynamic Programming: Bellman-Ford and Floyd-Warshall\n[Wed, Feb 21, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240221T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240221T1200&p1=1240) (Nima)\n\n##### Pre-lecture resources\n- Pre-lecture exercise: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture12-pre.pdf)\\]\n##### Lecture resources\n- Lecture notes: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture12-notes.pdf)\\]\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture12-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture12-slides.pptx)\\]\n- Python notebook: \\[[Colab](http:\/\/colab.research.google.com\/github\/stanford-cs161\/winter2024-extra\/blob\/colab\/lecture12_dp.ipynb)\\] \\[[Zip](https:\/\/stanford-cs161.github.io\/winter2024-extra\/lecture12_dp.zip)\\]\n- Concept check questions: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/dp1.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/dp1.pdf)\\]\n- Additional reading: AI Part III 18; CLRS 25.2, 15.1\n##### Recording\n- Video: \\[[Canvas](https:\/\/stanford-pilot.hosted.panopto.com\/Panopto\/Pages\/Viewer.aspx?id=ba8ec6b7-b8b2-4c77-8cf3-b0dd00055941)\\]\n\n## Lecture 13: More Dynamic Programming: LCS, Knapsack, Independent Set\n[Mon, Feb 26, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240226T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240226T1200&p1=1240) (Moses)\n\n##### Pre-lecture resources\n- Pre-lecture exercise: None this time\\!\n##### Lecture resources\n- Lecture notes: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture13-notes.pdf)\\]\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture13-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture13-slides.pptx)\\]\n- Concept check questions: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/dp2.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/dp2.pdf)\\]\n- Additional reading: AI Part III 16; CLRS 15.4\n##### Recording\n- Video: \\[[Canvas](https:\/\/stanford-pilot.hosted.panopto.com\/Panopto\/Pages\/Viewer.aspx?id=27748bef-3608-4ca8-9b1d-b0dd00055970)\\]\n\n## Lecture 14: Greedy Algorithms\n[Wed, Feb 28, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240228T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240228T1200&p1=1240) (Moses)\n\n##### Pre-lecture resources\n- Pre-lecture exercise: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture14-pre.pdf)\\]\n##### Lecture resources\n- Lecture notes: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture14-notes.pdf)\\]\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture14-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture14-slides.pptx)\\]\n- Python notebook: \\[[Colab](http:\/\/colab.research.google.com\/github\/stanford-cs161\/winter2024-extra\/blob\/colab\/lecture14_greedy.ipynb)\\] \\[[Zip](https:\/\/stanford-cs161.github.io\/winter2024-extra\/lecture14_greedy.zip)\\]\n- Concept check questions: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/greedy.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/greedy.pdf)\\]\n- Additional reading: AI Part III 13, 14; CLRS 16.1, 16.2, 16.3\n\n## Lecture 15: Minimum Spanning Trees\n[Mon, Mar 4, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240304T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240304T1200&p1=1240) (Nima)\n\n##### Pre-lecture resources\n- Pre-lecture exercise: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture15-pre.pdf)\\]\n##### Lecture resources (coming)\n- Lecture notes: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture15-notes.pdf)\\]\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture15-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture15-slides.pptx)\\]\n- Python notebook: \\[[Colab](http:\/\/colab.research.google.com\/github\/stanford-cs161\/winter2024-extra\/blob\/colab\/lecture15_mst.ipynb)\\] \\[[Zip](https:\/\/stanford-cs161.github.io\/winter2024-extra\/lecture15_mst.zip)\\]\n- Concept check questions: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/mst.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/mst.pdf)\\]\n- Additional reading: AI Part III 15; CLRS 23\n##### Recording\n- Video: \\[[Canvas](https:\/\/stanford-pilot.hosted.panopto.com\/Panopto\/Pages\/Viewer.aspx?id=8df01122-97bf-411d-a516-b0dd000559b6)\\]\n\n## Lecture 16: Max-Flow and the Ford-Fulkerson Algorithm\n[Wed, Mar 6, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240306T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240306T1200&p1=1240) (Nima)\n\n##### Pre-lecture resources\n- Pre-lecture exercise: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture16-pre.pdf)\\]\n##### Lecture resources\n- Lecture notes: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture16-notes.pdf)\\]\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture16-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture16-slides.pptx)\\]\n- Concept check questions: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/maxflow.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/maxflow.pdf)\\]\n- Additional reading: CLRS 26.1, 26.2, 26.3; Alexander Schrijver’s paper: [On the history of the transportation and maximum flow problem](https:\/\/link.springer.com\/article\/10.1007\/s101070100259)\n##### Recording\n- Video: \\[[Canvas](https:\/\/stanford-pilot.hosted.panopto.com\/Panopto\/Pages\/Viewer.aspx?id=b8d10584-0ce3-47a1-b819-b0dd000559cf)\\]\n\n## Lecture 17: Stable Matchings and Gale-Shapley\n[Mon, Mar 11, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240311T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240311T1200&p1=1240) (Moses)\n\n##### Pre-lecture resources\n- Pre-lecture exercise: None this time\\!\n##### Lecture resources\n- Lecture notes: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture17-notes.pdf)\\]\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture17-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture17-slides.pptx)\\]\n- Concept check questions: \\[[Interactive SVG](https:\/\/stanford-cs161.github.io\/winter2024-bank\/stablematching.svg)\\] \\[[Solved PDF](https:\/\/stanford-cs161.github.io\/winter2024-bank\/stablematching.pdf)\\]\n- Additional reading: [Lecture notes by Tim Roughgarden](https:\/\/timroughgarden.org\/f16\/l\/l2.pdf).\n##### Recording\n- Video: \\[[Canvas](https:\/\/stanford-pilot.hosted.panopto.com\/Panopto\/Pages\/Viewer.aspx?id=8c32635b-2319-4405-91c0-b0dd00055a05)\\]\n\n## Lecture 18: What's next?\n[Wed, Mar 13, 10:30 am](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240313T1030&p1=1240) – [12:00 pm](https:\/\/www.timeanddate.com\/worldclock\/fixedtime.html?iso=20240313T1200&p1=1240) (Moses)\n\n##### Pre-lecture resources\n- Pre-lecture exercise: None this time\\!\n##### Lecture resources\n- Slides: \\[[PDF](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture18-slides.pdf)\\] \\[[PowerPoint](https:\/\/stanford-cs161.github.io\/winter2024\/assets\/files\/lecture18-slides.pptx)\\]\n##### Recording\n- Video: \\[[Canvas](https:\/\/stanford-pilot.hosted.panopto.com\/Panopto\/Pages\/Viewer.aspx?id=eec973d2-85d6-4ede-a234-b0dd00055a2e)\\]","attrs_readable_markdown":null,"meta_canonical":null}

3. Robots.txt Check

Query:

Response:

4. Spam/Ban Check

Query:

Response:

5. Seen Status Check

ℹ️ Skipped - page is already crawled

📄

INDEXABLE

✅

CRAWLED

8 days ago

🤖

ROBOTS SERVER UNREACHABLE

Failed to connect to robots server: Operation timed out after 2002 milliseconds with 0 bytes received

Page Info Filters

Filter	Status	Condition	Details
HTTP status	PASS	`download_http_code = 200`	HTTP 200
Age cutoff	PASS	`download_stamp > now() - 6 MONTH`	0.3 months ago
History drop	PASS	`isNull(history_drop_reason)`	No drop reason
Spam/ban	PASS	`fh_dont_index != 1 AND ml_spam_score = 0`	ml_spam_score=0
Canonical	PASS	`meta_canonical IS NULL OR = '' OR = src_unparsed`	Not set

Page Details

Property	Value
URL	https://stanford-cs161.github.io/winter2024/lectures/
Last Crawled	2026-04-04 11:37:25 (8 days ago)
First Indexed	2024-01-12 16:19:04 (2 years ago)
HTTP Status Code	200
Meta Title	Lectures \| CS 161 (Archived)
Meta Description	A listing of all the course lectures.
Meta Canonical	null
Boilerpipe Text	General Lecture Information Lectures will be recorded and the recordings can be accessed on Canvas . Lecture 1: Why are you here? Mon, Jan 8, 10:30 am – 12:00 pm (Nima) Lecture resources Lecture notes: [ PDF ] Slides: [ PDF ] [ PowerPoint ] Python notebook: [ Colab ] [ Zip ] Concept check questions: [ Interactive SVG ] [ Solved PDF ] Additional reading: AI Part I 1.1, 1.2, 1.3, 3.1 Recording Video: [ Canvas ] Lecture 2: Asymptotics, Worst-Case Analysis, and MergeSort Wed, Jan 10, 10:30 am – 12:00 pm (Nima) Pre-lecture resources Pre-lecture exercise: [ PDF ] Pre-lecture Python notebook: [ Colab ] [ Zip ] Lecture resources Lecture notes: [ PDF ] Slides: [ PDF ] [ PowerPoint ] Python notebook: [ Colab ] [ Zip ] Concept check questions on asymptotics: [ Interactive SVG ] [ Solved PDF ] Concept check questions on sorting: [ Interactive SVG ] [ Solved PDF ] Additional reading: AI Part I 1.4, 1.5, 1.6, 2; CLRS 2.3, 3 Recording Video: [ Canvas ] Lecture 3: Solving Recurrences and the Master Theorem Wed, Jan 17, 10:30 am – 12:00 pm (Moses) Pre-lecture resources Pre-lecture exercise: [ PDF ] Lecture resources Lecture notes: [ PDF ] Slides: [ PDF ] [ PowerPoint ] Concept check questions: [ Interactive SVG ] [ Solved PDF ] Additional reading: AI Part I 4; CLRS 4.3, 4.4, 4.5 Recording Video: [ Canvas ] Mon, Jan 22, 10:30 am – 12:00 pm (Nima) Pre-lecture resources Pre-lecture exercise: [ PDF ] Lecture resources Lecture notes: [ PDF ] Slides: [ PDF ] [ PowerPoint ] Python notebook: [ Colab ] [ Zip ] Concept check questions: [ Interactive SVG ] [ Solved PDF ] Additional reading: AI Part I 6; CLRS 9 Recording Video: [ Canvas ] Lecture 5: Randomized Algorithms and QuickSort Wed, Jan 24, 10:30 am – 12:00 pm (Nima) Pre-lecture resources Pre-lecture exercise: [ PDF ] Lecture resources Lecture notes: [ PDF ] Slides: [ PDF ] [ PowerPoint ] Python notebook: [ Colab ] [ Zip ] Concept check questions: [ Interactive SVG ] [ Solved PDF ] Additional reading: AI Part I 5; CLRS 5.1, 5.2, 5.3, 7 Recording Video: [ Canvas ] Lecture 6: BucketSort and Lower Bounds for Sorting Mon, Jan 29, 10:30 am – 12:00 pm (Moses) Pre-lecture resources Pre-lecture exercise: [ PDF ] Lecture resources Lecture notes: [ PDF ] Slides: [ PDF ] [ PowerPoint ] Python notebook: [ Colab ] [ Zip ] Concept check questions: [ Interactive SVG ] [ Solved PDF ] Additional reading: AI Part I 5.6; CLRS 8.1, 8.2; [ Avrim Blum’s notes on sorting lower bounds ] Recording Video: [ Canvas ] Lecture 7: Binary Search Trees and Red-Black Trees Wed, Jan 31, 10:30 am – 12:00 pm (Moses) Pre-lecture resources Pre-lecture exercise: [ PDF ] Lecture resources Lecture notes: [ PDF ] Slides: [ PDF ] [ PowerPoint ] Concept check questions: [ Interactive SVG ] [ Solved PDF ] Additional reading: AI Part II 11; CLRS 12.1, 12.2, 12.3, 13 Recording Video: [ Canvas ] Lecture 8: Hashing Mon, Feb 5, 10:30 am – 12:00 pm (Nima) Pre-lecture resources Pre-lecture exercise: [ PDF ] Lecture resources Lecture notes: [ PDF ] Slides: [ PDF ] [ PowerPoint ] Python notebook: [ Colab ] [ Zip ] Concept check questions: [ Interactive SVG ] [ Solved PDF ] Additional reading: AI Part II 12; CLRS 11 Recording Video: [ Canvas ] Lecture 9: Graphs and BFS and DFS Wed, Feb 7, 10:30 am – 12:00 pm (Nima) Pre-lecture resources Pre-lecture exercise: [ PDF ] Lecture resources Lecture notes: [ PDF ] Slides: [ PDF ] [ PowerPoint ] Python notebook: [ Colab ] [ Zip ] Concept check questions: [ Interactive SVG ] [ Solved PDF ] Additional reading: AI Part II 7, 8.1, 8.2, 8.3, 8.4, 8.5; CLRS 22.1, 22.2, 22.3, 22.4 Recording Video: [ Canvas ] Lecture 10: Strongly Connected Components Mon, Feb 12, 10:30 am – 12:00 pm (Moses) Pre-lecture resources Pre-lecture exercise: [ PDF ] Lecture resources Lecture notes: [ PDF ] Slides: [ PDF ] [ PowerPoint ] Python notebook: [ Colab ] [ Zip ] Concept check questions: [ Interactive SVG ] [ Solved PDF ] Additional reading: AI Part II 8.6; CLRS 22.5 Recording Video: [ Canvas ] Lecture 11: Dijkstra and Bellman-Ford Wed, Feb 14, 10:30 am – 12:00 pm (Moses) Pre-lecture resources Pre-lecture exercise: [ PDF ] Lecture resources Lecture notes: [ PDF ] Slides: [ PDF ] [ PowerPoint ] Python notebook: [ Colab ] [ Zip ] Concept check questions: [ Interactive SVG ] [ Solved PDF ] Additional reading: AI Part II 9, Part III 18.1, 18.2; CLRS 24.1, 24.3 Recording Video: [ Canvas ] Lecture 12: Dynamic Programming: Bellman-Ford and Floyd-Warshall Wed, Feb 21, 10:30 am – 12:00 pm (Nima) Pre-lecture resources Pre-lecture exercise: [ PDF ] Lecture resources Lecture notes: [ PDF ] Slides: [ PDF ] [ PowerPoint ] Python notebook: [ Colab ] [ Zip ] Concept check questions: [ Interactive SVG ] [ Solved PDF ] Additional reading: AI Part III 18; CLRS 25.2, 15.1 Recording Video: [ Canvas ] Lecture 13: More Dynamic Programming: LCS, Knapsack, Independent Set Mon, Feb 26, 10:30 am – 12:00 pm (Moses) Pre-lecture resources Pre-lecture exercise: None this time! Lecture resources Lecture notes: [ PDF ] Slides: [ PDF ] [ PowerPoint ] Concept check questions: [ Interactive SVG ] [ Solved PDF ] Additional reading: AI Part III 16; CLRS 15.4 Recording Video: [ Canvas ] Lecture 14: Greedy Algorithms Wed, Feb 28, 10:30 am – 12:00 pm (Moses) Pre-lecture resources Pre-lecture exercise: [ PDF ] Lecture resources Lecture notes: [ PDF ] Slides: [ PDF ] [ PowerPoint ] Python notebook: [ Colab ] [ Zip ] Concept check questions: [ Interactive SVG ] [ Solved PDF ] Additional reading: AI Part III 13, 14; CLRS 16.1, 16.2, 16.3 Lecture 15: Minimum Spanning Trees Mon, Mar 4, 10:30 am – 12:00 pm (Nima) Pre-lecture resources Pre-lecture exercise: [ PDF ] Lecture resources (coming) Lecture notes: [ PDF ] Slides: [ PDF ] [ PowerPoint ] Python notebook: [ Colab ] [ Zip ] Concept check questions: [ Interactive SVG ] [ Solved PDF ] Additional reading: AI Part III 15; CLRS 23 Recording Video: [ Canvas ] Lecture 16: Max-Flow and the Ford-Fulkerson Algorithm Wed, Mar 6, 10:30 am – 12:00 pm (Nima) Pre-lecture resources Pre-lecture exercise: [ PDF ] Lecture resources Lecture notes: [ PDF ] Slides: [ PDF ] [ PowerPoint ] Concept check questions: [ Interactive SVG ] [ Solved PDF ] Additional reading: CLRS 26.1, 26.2, 26.3; Alexander Schrijver’s paper: On the history of the transportation and maximum flow problem Recording Video: [ Canvas ] Lecture 17: Stable Matchings and Gale-Shapley Mon, Mar 11, 10:30 am – 12:00 pm (Moses) Pre-lecture resources Pre-lecture exercise: None this time! Lecture resources Lecture notes: [ PDF ] Slides: [ PDF ] [ PowerPoint ] Concept check questions: [ Interactive SVG ] [ Solved PDF ] Additional reading: Lecture notes by Tim Roughgarden . Recording Video: [ Canvas ] Lecture 18: What's next? Wed, Mar 13, 10:30 am – 12:00 pm (Moses) Pre-lecture resources Pre-lecture exercise: None this time! Lecture resources Slides: [ PDF ] [ PowerPoint ] Recording Video: [ Canvas ]
Markdown	[CS 161 (Archived)](https://stanford-cs161.github.io/winter2024/) - [Schedule](https://stanford-cs161.github.io/winter2024/schedule/) - [Lectures](https://stanford-cs161.github.io/winter2024/lectures/) - [EthiCS Lectures](https://stanford-cs161.github.io/winter2024/ethics/) - [Sections](https://stanford-cs161.github.io/winter2024/sections/) - [Homework](https://stanford-cs161.github.io/winter2024/homework/) - [Exams](https://stanford-cs161.github.io/winter2024/exams/) - [Resources](https://stanford-cs161.github.io/winter2024/resources/) - [Policies](https://stanford-cs161.github.io/winter2024/policies/) - [Staff / Office Hours](https://stanford-cs161.github.io/winter2024/staff/) - [CS 161A](https://stanford-cs161.github.io/winter2024/cs161a/) This site uses [Just the Docs](https://github.com/pmarsceill/just-the-docs), a documentation theme for Jekyll. - [Canvas](https://canvas.stanford.edu/courses/185149) - [Ed](https://edstem.org/us/courses/50592) - [Gradescope](https://www.gradescope.com/courses/688809) ## General Lecture Information - Lectures will be recorded and the recordings can be accessed on [Canvas](https://canvas.stanford.edu/courses/185149). ## Lectures ## Lecture 1: Why are you here? [Mon, Jan 8, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240108T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240108T1200&p1=1240) (Nima) ##### Lecture resources - Lecture notes: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture1-notes.pdf)\] - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture1-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture1-slides.pptx)\] - Python notebook: \[[Colab](http://colab.research.google.com/github/stanford-cs161/winter2024-extra/blob/colab/lecture1_karatsuba.ipynb)\] \[[Zip](https://stanford-cs161.github.io/winter2024-extra/lecture1_karatsuba.zip)\] - Concept check questions: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/multiplication.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/multiplication.pdf)\] - Additional reading: AI Part I 1.1, 1.2, 1.3, 3.1 ##### Recording - Video: \[[Canvas](https://stanford-pilot.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=bc93eae7-82b1-478e-b373-b0dd00055712)\] ## Lecture 2: Asymptotics, Worst-Case Analysis, and MergeSort [Wed, Jan 10, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240110T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240110T1200&p1=1240) (Nima) ##### Pre-lecture resources - Pre-lecture exercise: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture2-pre.pdf)\] - Pre-lecture Python notebook: \[[Colab](http://colab.research.google.com/github/stanford-cs161/winter2024-extra/blob/colab/lecture2_pre.ipynb)\] \[[Zip](https://stanford-cs161.github.io/winter2024-extra/lecture2_pre.zip)\] ##### Lecture resources - Lecture notes: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture2-notes.pdf)\] - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture2-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture2-slides.pptx)\] - Python notebook: \[[Colab](http://colab.research.google.com/github/stanford-cs161/winter2024-extra/blob/colab/lecture2_sorting.ipynb)\] \[[Zip](https://stanford-cs161.github.io/winter2024-extra/lecture2_sorting.zip)\] - Concept check questions on asymptotics: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/asymptotics.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/asymptotics.pdf)\] - Concept check questions on sorting: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/sorting.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/sorting.pdf)\] - Additional reading: AI Part I 1.4, 1.5, 1.6, 2; CLRS 2.3, 3 ##### Recording - Video: \[[Canvas](https://stanford-pilot.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=7676a00c-8c7b-420c-85f4-b0dd0005576d)\] ## Lecture 3: Solving Recurrences and the Master Theorem [Wed, Jan 17, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240117T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240117T1200&p1=1240) (Moses) ##### Pre-lecture resources - Pre-lecture exercise: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture3-pre.pdf)\] ##### Lecture resources - Lecture notes: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture3-notes.pdf)\] - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture3-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture3-slides.pptx)\] - Concept check questions: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/recurrence.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/recurrence.pdf)\] - Additional reading: AI Part I 4; CLRS 4.3, 4.4, 4.5 ##### Recording - Video: \[[Canvas](https://stanford-pilot.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=d2cc4ef3-4b5c-4013-a377-b0dd000557ba)\] ## Lecture 4: Median and Selection [Mon, Jan 22, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240122T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240122T1200&p1=1240) (Nima) ##### Pre-lecture resources - Pre-lecture exercise: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture4-pre.pdf)\] ##### Lecture resources - Lecture notes: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture4-notes.pdf)\] - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture4-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture4-slides.pptx)\] - Python notebook: \[[Colab](http://colab.research.google.com/github/stanford-cs161/winter2024-extra/blob/colab/lecture4_select.ipynb)\] \[[Zip](https://stanford-cs161.github.io/winter2024-extra/lecture4_select.zip)\] - Concept check questions: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/select.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/select.pdf)\] - Additional reading: AI Part I 6; CLRS 9 ##### Recording - Video: \[[Canvas](https://stanford-pilot.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=397943e0-5f06-4ed3-bed2-b0ff01310f78)\] ## Lecture 5: Randomized Algorithms and QuickSort [Wed, Jan 24, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240124T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240124T1200&p1=1240) (Nima) ##### Pre-lecture resources - Pre-lecture exercise: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture5-pre.pdf)\] ##### Lecture resources - Lecture notes: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture5-notes.pdf)\] - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture5-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture5-slides.pptx)\] - Python notebook: \[[Colab](http://colab.research.google.com/github/stanford-cs161/winter2024-extra/blob/colab/lecture5_quicksort.ipynb)\] \[[Zip](https://stanford-cs161.github.io/winter2024-extra/lecture5_quicksort.zip)\] - Concept check questions: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/random.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/random.pdf)\] - Additional reading: AI Part I 5; CLRS 5.1, 5.2, 5.3, 7 ##### Recording - Video: \[[Canvas](https://stanford-pilot.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=b7874fa8-cbbd-48ca-a017-b0dd000557fd)\] ## Lecture 6: BucketSort and Lower Bounds for Sorting [Mon, Jan 29, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240129T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240129T1200&p1=1240) (Moses) ##### Pre-lecture resources - Pre-lecture exercise: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture6-pre.pdf)\] ##### Lecture resources - Lecture notes: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture6-notes.pdf)\] - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture6-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture6-slides.pptx)\] - Python notebook: \[[Colab](http://colab.research.google.com/github/stanford-cs161/winter2024-extra/blob/colab/lecture6_bucketsort.ipynb)\] \[[Zip](https://stanford-cs161.github.io/winter2024-extra/lecture6_bucketsort.zip)\] - Concept check questions: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/sortingmodels.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/sortingmodels.pdf)\] - Additional reading: AI Part I 5.6; CLRS 8.1, 8.2; \[[Avrim Blum’s notes on sorting lower bounds](http://www.cs.cmu.edu/~avrim/451f11/lectures/lect0913.pdf)\] ##### Recording - Video: \[[Canvas](https://stanford-pilot.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=16d283da-eabc-470f-8801-b0dd0005584b)\] ## Lecture 7: Binary Search Trees and Red-Black Trees [Wed, Jan 31, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240131T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240131T1200&p1=1240) (Moses) ##### Pre-lecture resources - Pre-lecture exercise: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture7-pre.pdf)\] ##### Lecture resources - Lecture notes: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture7-notes.pdf)\] - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture7-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture7-slides.pptx)\] - Concept check questions: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/bst.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/bst.pdf)\] - Additional reading: AI Part II 11; CLRS 12.1, 12.2, 12.3, 13 ##### Recording - Video: \[[Canvas](https://stanford-pilot.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=a6e68b7c-6016-4b80-aeca-b0dd0005585e)\] ## Lecture 8: Hashing [Mon, Feb 5, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240205T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240205T1200&p1=1240) (Nima) ##### Pre-lecture resources - Pre-lecture exercise: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture8-pre.pdf)\] ##### Lecture resources - Lecture notes: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture8-notes.pdf)\] - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture8-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture8-slides.pptx)\] - Python notebook: \[[Colab](http://colab.research.google.com/github/stanford-cs161/winter2024-extra/blob/colab/lecture8_hashing.ipynb)\] \[[Zip](https://stanford-cs161.github.io/winter2024-extra/lecture8_hashing.zip)\] - Concept check questions: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/hashing.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/hashing.pdf)\] - Additional reading: AI Part II 12; CLRS 11 ##### Recording - Video: \[[Canvas](https://stanford-pilot.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=7403154f-3b33-49ee-b75b-b0dd0005588e)\] ## Lecture 9: Graphs and BFS and DFS [Wed, Feb 7, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240207T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240207T1200&p1=1240) (Nima) ##### Pre-lecture resources - Pre-lecture exercise: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture9-pre.pdf)\] ##### Lecture resources - Lecture notes: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture9-notes.pdf)\] - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture9-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture9-slides.pptx)\] - Python notebook: \[[Colab](http://colab.research.google.com/github/stanford-cs161/winter2024-extra/blob/colab/lecture9_graphs.ipynb)\] \[[Zip](https://stanford-cs161.github.io/winter2024-extra/lecture9_graphs.zip)\] - Concept check questions: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/bfsdfs.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/bfsdfs.pdf)\] - Additional reading: AI Part II 7, 8.1, 8.2, 8.3, 8.4, 8.5; CLRS 22.1, 22.2, 22.3, 22.4 ##### Recording - Video: \[[Canvas](https://stanford-pilot.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=392878c1-e58b-4aa7-83bb-b0dd000558b0)\] ## Lecture 10: Strongly Connected Components [Mon, Feb 12, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240212T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240212T1200&p1=1240) (Moses) ##### Pre-lecture resources - Pre-lecture exercise: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture10-pre.pdf)\] ##### Lecture resources - Lecture notes: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture10-notes.pdf)\] - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture10-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture10-slides.pptx)\] - Python notebook: \[[Colab](http://colab.research.google.com/github/stanford-cs161/winter2024-extra/blob/colab/lecture10_scc.ipynb)\] \[[Zip](https://stanford-cs161.github.io/winter2024-extra/lecture10_scc.zip)\] - Concept check questions: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/scc.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/scc.pdf)\] - Additional reading: AI Part II 8.6; CLRS 22.5 ##### Recording - Video: \[[Canvas](https://stanford-pilot.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=5e56256c-98f8-43f6-8702-b0dd000558dc)\] ## Lecture 11: Dijkstra and Bellman-Ford [Wed, Feb 14, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240214T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240214T1200&p1=1240) (Moses) ##### Pre-lecture resources - Pre-lecture exercise: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture11-pre.pdf)\] ##### Lecture resources - Lecture notes: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture11-notes.pdf)\] - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture11-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture11-slides.pptx)\] - Python notebook: \[[Colab](http://colab.research.google.com/github/stanford-cs161/winter2024-extra/blob/colab/lecture11_dijkstra.ipynb)\] \[[Zip](https://stanford-cs161.github.io/winter2024-extra/lecture11_dijkstra.zip)\] - Concept check questions: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/dijkstra.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/dijkstra.pdf)\] - Additional reading: AI Part II 9, Part III 18.1, 18.2; CLRS 24.1, 24.3 ##### Recording - Video: \[[Canvas](https://stanford-pilot.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=d90ca3e3-23de-4737-9148-b0dd000558f9)\] ## Lecture 12: Dynamic Programming: Bellman-Ford and Floyd-Warshall [Wed, Feb 21, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240221T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240221T1200&p1=1240) (Nima) ##### Pre-lecture resources - Pre-lecture exercise: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture12-pre.pdf)\] ##### Lecture resources - Lecture notes: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture12-notes.pdf)\] - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture12-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture12-slides.pptx)\] - Python notebook: \[[Colab](http://colab.research.google.com/github/stanford-cs161/winter2024-extra/blob/colab/lecture12_dp.ipynb)\] \[[Zip](https://stanford-cs161.github.io/winter2024-extra/lecture12_dp.zip)\] - Concept check questions: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/dp1.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/dp1.pdf)\] - Additional reading: AI Part III 18; CLRS 25.2, 15.1 ##### Recording - Video: \[[Canvas](https://stanford-pilot.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=ba8ec6b7-b8b2-4c77-8cf3-b0dd00055941)\] ## Lecture 13: More Dynamic Programming: LCS, Knapsack, Independent Set [Mon, Feb 26, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240226T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240226T1200&p1=1240) (Moses) ##### Pre-lecture resources - Pre-lecture exercise: None this time\! ##### Lecture resources - Lecture notes: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture13-notes.pdf)\] - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture13-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture13-slides.pptx)\] - Concept check questions: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/dp2.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/dp2.pdf)\] - Additional reading: AI Part III 16; CLRS 15.4 ##### Recording - Video: \[[Canvas](https://stanford-pilot.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=27748bef-3608-4ca8-9b1d-b0dd00055970)\] ## Lecture 14: Greedy Algorithms [Wed, Feb 28, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240228T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240228T1200&p1=1240) (Moses) ##### Pre-lecture resources - Pre-lecture exercise: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture14-pre.pdf)\] ##### Lecture resources - Lecture notes: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture14-notes.pdf)\] - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture14-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture14-slides.pptx)\] - Python notebook: \[[Colab](http://colab.research.google.com/github/stanford-cs161/winter2024-extra/blob/colab/lecture14_greedy.ipynb)\] \[[Zip](https://stanford-cs161.github.io/winter2024-extra/lecture14_greedy.zip)\] - Concept check questions: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/greedy.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/greedy.pdf)\] - Additional reading: AI Part III 13, 14; CLRS 16.1, 16.2, 16.3 ## Lecture 15: Minimum Spanning Trees [Mon, Mar 4, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240304T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240304T1200&p1=1240) (Nima) ##### Pre-lecture resources - Pre-lecture exercise: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture15-pre.pdf)\] ##### Lecture resources (coming) - Lecture notes: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture15-notes.pdf)\] - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture15-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture15-slides.pptx)\] - Python notebook: \[[Colab](http://colab.research.google.com/github/stanford-cs161/winter2024-extra/blob/colab/lecture15_mst.ipynb)\] \[[Zip](https://stanford-cs161.github.io/winter2024-extra/lecture15_mst.zip)\] - Concept check questions: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/mst.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/mst.pdf)\] - Additional reading: AI Part III 15; CLRS 23 ##### Recording - Video: \[[Canvas](https://stanford-pilot.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=8df01122-97bf-411d-a516-b0dd000559b6)\] ## Lecture 16: Max-Flow and the Ford-Fulkerson Algorithm [Wed, Mar 6, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240306T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240306T1200&p1=1240) (Nima) ##### Pre-lecture resources - Pre-lecture exercise: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture16-pre.pdf)\] ##### Lecture resources - Lecture notes: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture16-notes.pdf)\] - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture16-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture16-slides.pptx)\] - Concept check questions: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/maxflow.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/maxflow.pdf)\] - Additional reading: CLRS 26.1, 26.2, 26.3; Alexander Schrijver’s paper: [On the history of the transportation and maximum flow problem](https://link.springer.com/article/10.1007/s101070100259) ##### Recording - Video: \[[Canvas](https://stanford-pilot.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=b8d10584-0ce3-47a1-b819-b0dd000559cf)\] ## Lecture 17: Stable Matchings and Gale-Shapley [Mon, Mar 11, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240311T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240311T1200&p1=1240) (Moses) ##### Pre-lecture resources - Pre-lecture exercise: None this time\! ##### Lecture resources - Lecture notes: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture17-notes.pdf)\] - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture17-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture17-slides.pptx)\] - Concept check questions: \[[Interactive SVG](https://stanford-cs161.github.io/winter2024-bank/stablematching.svg)\] \[[Solved PDF](https://stanford-cs161.github.io/winter2024-bank/stablematching.pdf)\] - Additional reading: [Lecture notes by Tim Roughgarden](https://timroughgarden.org/f16/l/l2.pdf). ##### Recording - Video: \[[Canvas](https://stanford-pilot.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=8c32635b-2319-4405-91c0-b0dd00055a05)\] ## Lecture 18: What's next? [Wed, Mar 13, 10:30 am](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240313T1030&p1=1240) – [12:00 pm](https://www.timeanddate.com/worldclock/fixedtime.html?iso=20240313T1200&p1=1240) (Moses) ##### Pre-lecture resources - Pre-lecture exercise: None this time\! ##### Lecture resources - Slides: \[[PDF](https://stanford-cs161.github.io/winter2024/assets/files/lecture18-slides.pdf)\] \[[PowerPoint](https://stanford-cs161.github.io/winter2024/assets/files/lecture18-slides.pptx)\] ##### Recording - Video: \[[Canvas](https://stanford-pilot.hosted.panopto.com/Panopto/Pages/Viewer.aspx?id=eec973d2-85d6-4ede-a234-b0dd00055a2e)\]
Readable Markdown	null
Shard	143 (laksa)
Root Hash	2566890010099092343
Unparsed URL	io,github!stanford-cs161,/winter2024/lectures/ s443