Lecture, three hours; discussion, one hour. Requisites: courses 32B, 33B, 115A, Program in Computing 10A or Computer Science 31. Introduction to numerical methods with emphasis on algorithms, analysis of algorithms, and computer implementation issues. Solution of nonlinear equations. Numerical differentiation, integration, and interpolation. Direct methods for solving linear systems. Letter grading.

Review Summary

Clarity
0.0 / 10
Organization
0.0 / 10
Time
0-5 hrs/week
Overall
0.0 / 10

Reviews

    Quarter Taken: Fall 2022 In-Person
    Grade: P

    do yourself a favor and don't take this class with this professor. after giving us extremely easy homework assignments and a very reasonable midterm, he gave a 10x more difficult final that was half of our grade. he literally ramped up the difficulty after we already didn't have TAs in the course because of the strike, and they explained the concepts so much better than he did. he literally talks in circles and half of his lectures consist of "um". he was also extremely unaccommodating, and ignored all piazza questions and emails after final grades were released.

    Quarter Taken: Fall 2022 In-Person
    Grade: B+

    Thought this class was gonna be chill after easy homework and a chill midterm (the average was around 90), then my boy Pedro thinks the average was too high and bumped up the difficulty of the final, worth 50% of your grade, with the absence of TA's help in discussion sections due to the strike. The final consists of questions that rarely occur in past homework and looked nothing like the practice final. Actually pissed because it's so unfair literally every professor chose to make the final more accommodating because of the strike but he chose to make his teaching look tough by giving us a hard final.

Course

Previously taught
23S 23W 22F 21F

Grading Information

  • No group projects

  • Attendance not required

  • 1 midterm

  • Finals week final

  • 100% recommend the textbook

Previous Grades

Grade distributions not available.