title updates

content/CSE347/CSE347_L1.md

@@ -1,4 +1,4 @@
-# Lecture 1
+# CSE347 Analysis of Algorithms (Lecture 1)
 
 ## Greedy Algorithms
 

content/CSE347/CSE347_L10.md

@@ -1,4 +1,4 @@
-# Lecture 10
+# CSE347 Analysis of Algorithms (Lecture 10)
 
 ## Online Algorithms
 

content/CSE347/CSE347_L11.md

@@ -1,4 +1,4 @@
-# Lecture 11
+# CSE347 Analysis of Algorithms (Lecture 11)
 
 ## More randomized algorithms
 

content/CSE347/CSE347_L2.md

@@ -1,4 +1,4 @@
-# Lecture 2
+# CSE347 Analysis of Algorithms (Lecture 2)
 
 ## Divide and conquer
 

content/CSE347/CSE347_L3.md

@@ -1,4 +1,4 @@
-# Lecture 3
+# CSE347 Analysis of Algorithms (Lecture 3)
 
 ## Dynamic programming
 

content/CSE347/CSE347_L4.md

@@ -1,4 +1,4 @@
-# Lecture 4
+# CSE347 Analysis of Algorithms (Lecture 4)
 
 ## Maximum Flow
 

content/CSE347/CSE347_L5.md

@@ -1,4 +1,4 @@
-# Lecture 5
+# CSE347 Analysis of Algorithms (Lecture 5)
 
 ## Takeaway from Bipartite Matching
 

content/CSE347/CSE347_L6.md

@@ -1,4 +1,4 @@
-# Lecture 6
+# CSE347 Analysis of Algorithms (Lecture 6)
 
 ## NP-completeness
 

content/CSE347/CSE347_L7.md

@@ -1,4 +1,4 @@
-# Lecture 7
+# CSE347 Analysis of Algorithms (Lecture 7)
 
 ## Known NP-Complete Problems
 

content/CSE347/CSE347_L8.md

@@ -1,4 +1,4 @@
-# Lecture 8
+# CSE347 Analysis of Algorithms (Lecture 8)
 
 ## NP-optimization problem
 

content/CSE347/CSE347_L9.md

@@ -1,4 +1,4 @@
-# Lecture 9
+# CSE347 Analysis of Algorithms (Lecture 9)
 
 ## Randomized Algorithms
 

content/CSE347/index.md

@@ -1,4 +1,4 @@
-# CSE 347
+# CSE347 Course Description
 
 This is a course about fancy algorithms.
 
@@ -18,4 +18,8 @@ It's hard if you don't know the tricks for solving leetcode problems.
 
 I've been doing leetcode daily problems for almost 2 years when I get into the course.
 
-It's relatively easy for me but I do have a hard time to get every proof right.
+It's relatively easy for me but I do have a hard time to get every proof right.
+
+## Course Description
+
+Introduces techniques for the mathematical analysis of algorithms, including randomized algorithms and non-worst-case analyses such as amortized and competitive analysis. Introduces the standard paradigms of divide-and-conquer, greedy, and dynamic programming algorithms, as well as reductions. Also provides an introduction to the study of intractability and techniques to determine when good algorithms cannot be designed. Note: A Wednesday recitation section will be required. Times TBD based on students' schedules. Attendance is required for two evening exams. Evening exams will be October 22 and December 3 from 6:30 - 8:30pm. Prerequisites: (CSE 240 or Math 310) and CSE 247