Document Actions
400 Level
20 CS 403: Organization of Programming Languages
3 Undergraduate
The course covers various significant concepts and features in the design and implementation of modern programming languages.
20 CS 471: Design & Analysis of Algorithms 1
3 Undergraduate
An introduction to the study of algorithms. Analysis of computing time, asymptotic notation, introduction to lower bound theory. Introduction to the theory of parallel algorithms and architectures. Induction, correctness proofs, and recurrence relations. Graphs, digraphs, and sets. Probability and average complexity of algorithms.
20 CS 472: Design & Analysis of Algorithms 2
3 Undergraduate
Introduction to probabilistic algorithms. Lower bound theory. Major design strategies: the greedy method, divide-andconquer, dynamic programming, backtracking and branch-and-bound, introduction to NPcomplete problems.
UC's PlanetLab Contribution Upgraded Thanks to Major Equipment Donation from HP