Computer Science 270:

Introduction to Algorithms and Theory of Computing (4.0 units)

Algorithm analysis. Greedy algorithms, divide and conquer, dynamic programming, graph algorithms. NP-completeness and basic recursion theory and undecidability. Sorting lower bounds. Number-theory based cryptography.
SectionSessionTypeTimeDaysRegisteredInstructorLocationSyllabusInfo
29956D001Lecture4:30-5:50pmMon, Wed57 of 60Shahriar ShamsianMHP101session dates
29957D001Lecture6:00-7:30pmMon, Wed54 of 60Shahriar ShamsianMHP101session dates
29958D001Lecture3:30-5:00pmTue, Thu57 of 60Shahriar ShamsianTHH210session dates
30231D001Lecture2:00-3:20pmTue, Thu59 of 60Shahriar ShamsianGFS101session dates
30267R001Discussion10:00-11:50amFriday78 of 80SLH100session dates
30268R001Discussion12:00-1:50pmFriday73 of 80ZHS159session dates
30269D001Discussion2:00-3:50pmFriday76 of 82ZHS159session dates
30224R001Quiz7:00-8:50pmFriday227 of 240TBAsession dates
Information accurate as of July 15, 2020 4:57 pm.
All Summer 2020 courses will be taught remotely. Faculty will contact students to provide information to login to classes.