dibs

COM SCI 180: Introduction to Algorithms and Complexity

Lecture, four hours; discussion, two hours; outside study, six hours. Enforced requisites: course 32, Mathematics 61. Designed for junior/senior Computer Science majors. Introduction to design and analysis of algorithms. Design techniques: divide-and-conquer, greedy method, dynamic programming; selection of prototypical algorithms; choice of data structures and representations; complexity measures: time, space, upper, lower bounds, asymptotic complexity; NP-completeness. Letter grading.

4 units, upper division

Offered every quarter

Predicted GPA
3.17
A or A minus
42%
D, F or withdrew
3%
Lec 1
Mon/Wed 4:00-5:50 PM
Franz Hall 1178
Ostrovsky, R.
Dis 1A
Fri 8:00-9:50 AM
Dodd Hall 161
Dis 1B
Fri 8:00-9:50 AM
Public Affairs Building 2250
Dis 1C
Fri 2:00-3:50 PM
Dodd Hall 170
Dis 1D
Fri 2:00-3:50 PM
Public Affairs Building 1246
By instructor
Fall 2021 to Fall 2025
All instructors
3.17 GPA
42% A
3% DFW
2,797 grades
OSTROVSKY
3.77 GPA
86% A
0% DFW
195 grades
SARRAFZADEH
3.02 GPA
33% A
3% DFW
1,412 grades
HSIEH
3.28 GPA
47% A
2% DFW
544 grades
BATISTA
3.24 GPA
42% A
2% DFW
387 grades
REINMAN
3.13 GPA
43% A
2% DFW
234 grades
GAFNI
3.32 GPA
52% A
0% DFW
25 grades
Prerequisites
COM SCI 32
MATH 61
Restrictions
Computer Science, Computer Science and Engineering, Computerengineering, Computational and Systems Biology, Electrical Engineering, Linguistics and Computer Science Majors or Computational and Systems Biology Pre-Major or Bioinfrm Minors
Grading
Letter only
Final exam
Thu Mar 18, 3:00 PM

What past students say about OSTROVSKY in this class

Read from 21 reviews of OSTROVSKY

Recommend
4 recommend it, 5 advise against
Teaching
2 say clear, 12 unclear
Exams
2 say easy, 6 moderate, 2 hard
Lectures
1 says recorded
Curve
3 say curved
Slides
2 say not posted
Attendance
1 says not required
Textbook
5 say needed, 1 says not needed

Each figure counts the reviews that say so. Most reviews skip most topics.