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.
29956D001Lecture3:30-4:50pmMon, Wed121 of 123Shahriar ShamsianTHH101 & ONLINEsession dates
29957D001Lecture5:00-6:20pmMon, Wed115 of 121Shahriar ShamsianTHH201 & ONLINEsession dates
30267D001Discussion10:00-11:50amFriday79 of 82SAL101 & ONLINEsession dates
30268R001Discussion12:00-1:50pmFriday79 of 80MHP101 & ONLINEsession dates
30269R001Discussion2:00-3:50pmFriday78 of 81SAL101 & ONLINEsession dates
30224R001Quiz7:00-8:50pmFriday236 of 243TBA & ONLINEsession dates
Information accurate as of September 10, 2021 5:03 pm.
In Fall 2021, USC is returning to the normal grade option election deadlines and standards. For more information on this, please visit the Fall 2021 academic FAQs.