Trance-0/NoteNextra-origin
1
0
Fork 0
Code Issues Pull Requests Actions 1 Packages Projects Releases Wiki Activity

title updates

Browse Source
This commit is contained in:
Trance-0
2025-09-17 14:27:46 -05:00
parent 60173cbc64
commit e8b1850bde
57 changed files with 72 additions and 63 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
content/CSE347/index.md
View File

@@ -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