MATH 182: Algorithms
Lecture, three hours; discussion, one hour. Requisite: course 3C or 32A, and 61. Not open for credit to students with credit for Computer Science 180. Graphs, greedy algorithms, divide and conquer algorithms, dynamic programming, network flow. Emphasis on designing efficient algorithms useful in diverse areas such as bioinformatics and allocation of resources. P/NP or letter grading.
4 units, upper division
Offered every quarter
- Predicted GPA
- 3.26
- A or A minus
- 47%
- D, F or withdrew
- 2%
- Lec 1
- Mon/Wed/Fri 3:00-3:50 PM
- Geology Building 4645
- Wang, A.Y.
- Dis 1A
- Thu 3:00-3:50 PM
- Not posted
- By instructor
- Fall 2021 to Fall 2025
- All instructors
- 3.26 GPA
- 47% A
- 2% DFW
- 373 grades
- CONLEY
- 3.17 GPA
- 50% A
- 7% DFW
- 70 grades
- ARANT
- 3.20 GPA
- 37% A
- 0% DFW
- 63 grades
- VICARIA ANGEL
- 3.58 GPA
- 73% A
- 2% DFW
- 59 grades
- LUTZ
- 3.35 GPA
- 52% A
- 0% DFW
- 56 grades
- MARKS
- 3.24 GPA
- 47% A
- 0% DFW
- 36 grades
- SOSKIN
- 3.06 GPA
- 30% A
- 3% DFW
- 33 grades
- ADKISSON
- 3.17 GPA
- 35% A
- 0% DFW
- 31 grades
- PAK
- 3.22 GPA
- 36% A
- 0% DFW
- 25 grades
- Prerequisites
- Requisite: course 3C or 32A, and 61.
- Restrictions
- All Math Majors and Minors, Casb Majors, Premajors Are Excluded
- Grading
- Letter or P/NP
- Final exam
- Mon Mar 15, 8:00 AM
What past students say
Read from 7 reviews, all instructors
No professor is listed for this term yet, so these count the reviews of every professor who has taught it.
- Recommend
- 3 recommend it
- Teaching
- 5 say clear
- Exams
- 2 say easy, 2 moderate, 1 hard
- Lectures
- 1 says recorded
- Past exams
- 1 says not shared
- Curve
- 2 say not curved
- Textbook
- 1 says needed
Each figure counts the reviews that say so. Most reviews skip most topics.