From 85cc16561d12c5686411f8d5347f92f637c265c8 Mon Sep 17 00:00:00 2001 From: bradle11 Date: Fri, 9 Jan 2015 05:24:09 -0600 Subject: [PATCH 1/2] Update README.md Added CS374@UIUC --- README.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/README.md b/README.md index 905ae74..b1ddf77 100644 --- a/README.md +++ b/README.md @@ -196,6 +196,8 @@ Courses - [Textbook](http://web.engr.illinois.edu/~mfleck/building-blocks/) Written by the professor. Includes Instructor's Guide. - [Assignments](https://courses.engr.illinois.edu/cs173/fa2014/A-lecture/Homework/index.html) - [Exams](https://courses.engr.illinois.edu/cs173/fa2014/A-lecture/Exams/index.html) +- [CS 374](https://courses.engr.illinois.edu/cs498374/fa2014/) **Algorithms & Models of Computation** *University of Illinois Urbana-Champaign* + - CS 498 section 374 (unofficially "CS 374") covers fundamental tools and techniques from theoretical computer science, including design and analysis of algorithms, formal languages and automata, computability, and complexity. Specific topics include regular and context-free languages, finite-state automata, recursive algorithms (including divide and conquer, backtracking, dynamic programming, and greedy algorithms), fundamental graph algorithms (including depth- and breadth-first search, topological sorting, minimum spanning trees, and shortest paths), undecidability, and NP-completeness. The course also has a strong focus on clear technical communication. ------- From f2a5c494121fc395a80f21713f22faca4c4bc104 Mon Sep 17 00:00:00 2001 From: bradle11 Date: Fri, 9 Jan 2015 12:22:33 -0600 Subject: [PATCH 2/2] Added CS374@UIUC Added links for assignments, lecture notes, and lecture videos. --- README.md | 5 ++++- 1 file changed, 4 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index b1ddf77..a323e1e 100644 --- a/README.md +++ b/README.md @@ -197,7 +197,10 @@ Courses - [Assignments](https://courses.engr.illinois.edu/cs173/fa2014/A-lecture/Homework/index.html) - [Exams](https://courses.engr.illinois.edu/cs173/fa2014/A-lecture/Exams/index.html) - [CS 374](https://courses.engr.illinois.edu/cs498374/fa2014/) **Algorithms & Models of Computation** *University of Illinois Urbana-Champaign* - - CS 498 section 374 (unofficially "CS 374") covers fundamental tools and techniques from theoretical computer science, including design and analysis of algorithms, formal languages and automata, computability, and complexity. Specific topics include regular and context-free languages, finite-state automata, recursive algorithms (including divide and conquer, backtracking, dynamic programming, and greedy algorithms), fundamental graph algorithms (including depth- and breadth-first search, topological sorting, minimum spanning trees, and shortest paths), undecidability, and NP-completeness. The course also has a strong focus on clear technical communication. + - CS 498 section 374 (unofficially "CS 374") covers fundamental tools and techniques from theoretical computer science, including design and analysis of algorithms, formal languages and automata, computability, and complexity. Specific topics include regular and context-free languages, finite-state automata, recursive algorithms (including divide and conquer, backtracking, dynamic programming, and greedy algorithms), fundamental graph algorithms (including depth- and breadth-first search, topological sorting, minimum spanning trees, and shortest paths), undecidability, and NP-completeness. The course also has a strong focus on clear technical communication. + - [Assignments/Exams](https://courses.engr.illinois.edu/cs498374/fa2014/work.html) + - [Lecture Notes/Labs](https://courses.engr.illinois.edu/cs498374/fa2014/lectures.html) + - [Lecture videos](http://recordings.engineering.illinois.edu/ess/portal/section/115f3def-7371-4e98-b72f-6efe53771b2a) -------