UCLA

Computer Science Department

Algorithms & Complexity

CS 180

Instructor:

Fall 2016-17

Majid Sarrafzadeh
3532C Boelter Hall
majid@cs.ucla.edu

CLASS TIME:
OFFICE HOURS:
PLACE:
BOOK:
CLASS PAGE:

TR 10:0011:50am
TR 8:00 to 9:00 am , Boelter 3532 C
Boelter 3400
Algorithm Design by Kleinberg - Tardos
CCLE

TA Hours (all in Boelter Hall 2432)

Anahita

Office Hours: Tuesday 11:30 1:30 pm

Ang

Office Hours: Mon 12 - 2 pm

Arman

Office Hours: Wed 5 7 pm

ZhengLiang

Office Hours: Mon 9:30am - 11:30am

GRADING:
HOMEWORKS
MIDTERM

FINAL
Class Participation

30%
(1)
(1)

(almost) weekly
30% Thursday October 27 (in class; 90 minutes)
40% Tuesday, December 6, 8:00am-11:00am

Very Important

Late policy: All homework are due Wednesday 10 am to Thursday 9:59 am

(before the class starts) . Late homework will NOT (absolutely NOT) be accepted.
Homework will be returned in your discussion hour on Fridays.
You must write your discussion section (number, time, and TA first name) on
the upper right hand side of your homework. And your name on the upper left.
DESCRIPTION:
Prerequisites: course 32, Mathematics 61, junior standing in computer science.
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.