title updates

content/CSE332S/CSE332S_L1.md

@@ -1,4 +1,4 @@
-# CSE332S Lecture 1
+# CSE332S Object-Oriented Programming in C++ (Lecture 1)
 
 ## Today:
 

content/CSE332S/CSE332S_L10.md

@@ -1,4 +1,4 @@
-# CSE332S Lecture 10
+# CSE332S Object-Oriented Programming in C++ (Lecture 10)
 
 ## Associative Containers
 

content/CSE332S/CSE332S_L11.md

@@ -1,4 +1,4 @@
-# CSE332S Lecture 11
+# CSE332S Object-Oriented Programming in C++ (Lecture 11)
 
 ## Operator overloading intro
 

content/CSE332S/CSE332S_L12.md

@@ -1,4 +1,4 @@
-# CSE332S Lecture 12
+# CSE332S Object-Oriented Programming in C++ (Lecture 12)
 
 ## Object-Oriented Programming (OOP) in C++
 

content/CSE332S/CSE332S_L13.md

@@ -1,4 +1,4 @@
-# CSE332S Lecture 13
+# CSE332S Object-Oriented Programming in C++ (Lecture 13)
 
 ## Memory layout of a C++ program, variables and their lifetimes
 

content/CSE332S/CSE332S_L14.md

@@ -1,4 +1,4 @@
-# CSE332S Lecture 14
+# CSE332S Object-Oriented Programming in C++ (Lecture 14)
 
 ## Copy control
 

content/CSE332S/CSE332S_L15.md

@@ -1,4 +1,4 @@
-# CSE332S Lecture 15
+# CSE332S Object-Oriented Programming in C++ (Lecture 15)
 
 ## Move semantics introduction and motivation
 

content/CSE332S/CSE332S_L16.md

@@ -1,4 +1,4 @@
-# CSE332S Lecture 16
+# CSE332S Object-Oriented Programming in C++ (Lecture 16)
 
 ## Intro to OOP design and principles
 

content/CSE332S/CSE332S_L17.md

@@ -1,4 +1,4 @@
-# CSE332S Lecture 17
+# CSE332S Object-Oriented Programming in C++ (Lecture 17)
 
 ## Object Oriented Programming Building Blocks
 

content/CSE332S/CSE332S_L2.md

@@ -1,4 +1,4 @@
-# CSE332S Lecture 2
+# CSE332S Object-Oriented Programming in C++ (Lecture 2)
 
 Today we'll talk generally about C++ development (plus a few platform specifics):
 

content/CSE332S/CSE332S_L3.md

@@ -1,4 +1,4 @@
-# CSE332S Lecture 3
+# CSE332S Object-Oriented Programming in C++ (Lecture 3)
 
 ## C++ basic data types
 

content/CSE332S/CSE332S_L4.md

@@ -1,4 +1,4 @@
-# CSE332S Lecture 4
+# CSE332S Object-Oriented Programming in C++ (Lecture 4)
 
 ## Namespace details
 

content/CSE332S/CSE332S_L5.md

@@ -1,4 +1,4 @@
-# CSE332S Lecture 5
+# CSE332S Object-Oriented Programming in C++ (Lecture 5)
 
 ## Function and the Call Stack
 

content/CSE332S/CSE332S_L6.md

@@ -1,4 +1,4 @@
-# CSE332S Lecture 6
+# CSE332S Object-Oriented Programming in C++ (Lecture 6)
 
 ## Expressions
 

content/CSE332S/CSE332S_L7.md

@@ -1,8 +1,8 @@
-# CSE332S Lecture 7
+# CSE332S Object-Oriented Programming in C++ (Lecture 7)
 
 ## Debugging
 
-Debugger let’s us:
+Debugger let's us:
 
 1. Execute code incrementally
    a. Line by line, function to function, breakpoint to breakpoint

content/CSE332S/CSE332S_L8.md

@@ -1,4 +1,4 @@
-# CSE332S Lecture 8
+# CSE332S Object-Oriented Programming in C++ (Lecture 8)
 
 ## From procedural to object-oriented programming
 

content/CSE332S/CSE332S_L9.md

@@ -1,4 +1,4 @@
-# CSE332S Lecture 9
+# CSE332S Object-Oriented Programming in C++ (Lecture 9)
 
 ## Sequential Containers
 

content/CSE332S/index.md

@@ -1,6 +1,10 @@
-# CSE332S
+# CSE332S Course Description
 
 **Object-Oriented Software Development Laboratory**  
 **Spring 2025**  
 
 Instructor: **Jon Shidal**
+
+## Course Description
+
+Intensive focus on practical aspects of designing, implementing and debugging software, using object-oriented, procedural, and generic programming techniques. The course emphasizes familiarity and proficiency with a wide range of C++ language features through hands-on practice completing studio exercises and lab assignments, supplemented with readings and summary presentations for each session. An evening midterm exam at which attendance is required will be given on March 25. Prerequisites: CSE 131 and CSE 247.

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

content/CSE442T/CSE442T_L1.md

@@ -1,4 +1,4 @@
-# CSE442T Lecture 1
+# CSE442T Introduction to Cryptography (Lecture 1)
 
 ## Chapter 1: Introduction
 

content/CSE442T/CSE442T_L10.md

@@ -1,4 +1,4 @@
-# Lecture 10
+# CSE442T Introduction to Cryptography (Lecture 10)
 
 ## Chapter 2: Computational Hardness
 

content/CSE442T/CSE442T_L11.md

@@ -1,4 +1,4 @@
-# Lecture 11
+# CSE442T Introduction to Cryptography (Lecture 11)
 
 Exam info posted tonight.
 

content/CSE442T/CSE442T_L12.md

@@ -1,4 +1,4 @@
-# Lecture 12
+# CSE442T Introduction to Cryptography (Lecture 12)
 
 ## Chapter 3: Indistinguishability and Pseudorandomness
 

content/CSE442T/CSE442T_L13.md

@@ -1,4 +1,4 @@
-# Lecture 13
+# CSE442T Introduction to Cryptography (Lecture 13)
 
 ## Chapter 3: Indistinguishability and Pseudorandomness
 

content/CSE442T/CSE442T_L14.md

@@ -1,4 +1,4 @@
-# Lecture 14
+# CSE442T Introduction to Cryptography (Lecture 14)
 
 ## Recap
 

content/CSE442T/CSE442T_L15.md

@@ -1,4 +1,4 @@
-# CSE442T Lecture 15
+# CSE442T Introduction to Cryptography (Lecture 15)
 
 ## Chapter 3: Indistinguishability and Pseudorandomness
 

content/CSE442T/CSE442T_L16.md

@@ -1,4 +1,4 @@
-# Lecture 16
+# CSE442T Introduction to Cryptography (Lecture 16)
 
 ## Chapter 3: Indistinguishability and Pseudorandomness
 

content/CSE442T/CSE442T_L17.md

@@ -1,4 +1,4 @@
-# Lecture 17
+# CSE442T Introduction to Cryptography (Lecture 17)
 
 ## Chapter 3: Indistinguishability and Pseudorandomness
 

content/CSE442T/CSE442T_L18.md

@@ -1,4 +1,4 @@
-# CSE442T Lecture 18
+# CSE442T Introduction to Cryptography (Lecture 18)
 
 ## Chapter 5: Authentication
 

content/CSE442T/CSE442T_L19.md

@@ -1,4 +1,4 @@
-# CSE442T Lecture 19
+# CSE442T Introduction to Cryptography (Lecture 19)
 
 ## Chapter 5: Authentication
 

content/CSE442T/CSE442T_L2.md

@@ -1,4 +1,4 @@
-# CSE442T Lecture 2
+# CSE442T Introduction to Cryptography (Lecture 2)
 
 ## Probability review
 

content/CSE442T/CSE442T_L20.md

@@ -1,4 +1,4 @@
-# CSE442T Lecture 20
+# CSE442T Introduction to Cryptography (Lecture 20)
 
 ## Chapter 5: Authentication
 

content/CSE442T/CSE442T_L21.md

@@ -1,4 +1,4 @@
-# CSE442T Lecture 21
+# CSE442T Introduction to Cryptography (Lecture 21)
 
 ## Chapter 5: Authentication
 

content/CSE442T/CSE442T_L22.md

@@ -1,4 +1,4 @@
-# CSE442T Lecture 22
+# CSE442T Introduction to Cryptography (Lecture 22)
 
 ## Chapter 7: Composability
 

content/CSE442T/CSE442T_L23.md

@@ -1,4 +1,4 @@
-# CSE442T Lecture 23
+# CSE442T Introduction to Cryptography (Lecture 23)
 
 ## Chapter 7: Composability
 

content/CSE442T/CSE442T_L24.md

@@ -1,4 +1,4 @@
-# CSE442T Lecture 24
+# CSE442T Introduction to Cryptography (Lecture 24)
 
 ## Chapter 7: Composability
 

content/CSE442T/CSE442T_L3.md

@@ -1,4 +1,4 @@
-# CSE442T Lecture 3
+# CSE442T Introduction to Cryptography (Lecture 3)
 
 All algorithms $C(x)\to y$, $x,y\in \{0,1\}^*$ 
 

content/CSE442T/CSE442T_L4.md

@@ -1,4 +1,4 @@
-# CSE442T Lecture 4
+# CSE442T Introduction to Cryptography (Lecture 4)
 
 ## Recap
 

content/CSE442T/CSE442T_L5.md

@@ -1,4 +1,4 @@
-# Lecture 5
+# CSE442T Introduction to Cryptography (Lecture 5)
 
 ## Chapter 2: Computational Hardness
 

content/CSE442T/CSE442T_L6.md

@@ -1,4 +1,4 @@
-# Lecture 6
+# CSE442T Introduction to Cryptography (Lecture 6)
 
 ## Review
 

content/CSE442T/CSE442T_L7.md

@@ -1,4 +1,4 @@
-# Lecture 7
+# CSE442T Introduction to Cryptography (Lecture 7)
 
 ## Chapter 2: Computational Hardness
 

content/CSE442T/CSE442T_L8.md

@@ -1,4 +1,4 @@
-# Lecture 8
+# CSE442T Introduction to Cryptography (Lecture 8)
 
 ## Chapter 2: Computational Hardness
 

content/CSE442T/CSE442T_L9.md

@@ -1,4 +1,4 @@
-# Lecture 9
+# CSE442T Introduction to Cryptography (Lecture 9)
 
 ## Chapter 2: Computational Hardness
 

content/CSE442T/Exam_reviews/CSE442T_E1.md

@@ -1,4 +1,4 @@
-# System check for exam list
+# CSE442T Exam 1 Review
 
 **The exam will take place in class on Monday, October 21.**
 

content/CSE442T/index.md

@@ -1,4 +1,4 @@
-# CSE 442T
+# CSE442T Course Description
 
 ## Course Description
 
@@ -6,7 +6,7 @@ This course is an introduction to the theory of cryptography. Topics include:
 
 One-way functions, Pseudorandomness, Private-key cryptography, Public-key cryptography, Authentication, and etc.
 
-### Instructor:
+### Instructor
 
 [Brian Garnett](bcgarnett@wustl.edu)
 
@@ -16,15 +16,15 @@ Proof based course and write proofs.
 
 CSE 433 for practical applications.
 
-### Office Hours:
+### Office Hours
 
 Right after class! 4-5 Mon, Urbaur Hall 227
 
-### Textbook:
+### Textbook
 
 [A course in cryptography Lecture Notes](https://www.cs.cornell.edu/courses/cs4830/2010fa/lecnotes.pdf)
 
-### Comments:
+## Comments
 
 Most proofs are not hard to understand.
 
@@ -39,7 +39,7 @@ I'm having a hard time to recover them without reading the book.
 
 The lecturer's explanation is good but you'd better always pay attention in class or you'll having a hard time to catch up with the proof.
 
-### Notations used in this course
+## Notations used in this course
 
 The notations used in this course is very complicated. However, since we need to defined those concepts mathematically, we have to use those notations. Here are some notations I changed or emphasized for better readability at least for myself.
 

content/Math4201/_meta.js

@@ -12,4 +12,5 @@ export default {
     Math4201_L7: "Topology I (Lecture 7)",
     Math4201_L8: "Topology I (Lecture 8)",
     Math4201_L9: "Topology I (Lecture 9)",
+    Math4201_L10: "Topology I (Lecture 10)",
 }