CS 107E: Computer Systems from the Ground Up
Introduction to the fundamental concepts of computer systems through bare metal programming on the Raspberry Pi. Explores how five concepts come together in computer systems: hardware, architecture, assembly code, the C language, and software development tools. Students do all programming with a Raspberry Pi kit and several add-ons (LEDs, buttons). Topics covered include: the C programming language, data representation, machine-level code, computer arithmetic, compilation, memory organization and management, debugging, hardware, and I/O. Prerequisite: 106B or X, and consent of instructor. There is a $50 required lab fee.
Terms: Win, Spr
| Units: 3-5
| UG Reqs: WAY-FR
Instructors:
Gregg, C. (PI)
;
Hanrahan, P. (PI)
;
Levis, P. (PI)
;
Zelenski, J. (PI)
;
Miller, M. (TA)
;
Truong, L. (TA)
;
Watson, J. (TA)
CS 109: Introduction to Probability for Computer Scientists
Topics include: counting and combinatorics, random variables, conditional probability, independence, distributions, expectation, point estimation, and limit theorems. Applications of probability in computer science including machine learning and the use of probability in the analysis of algorithms. Prerequisites: 103, 106B or X, multivariate calculus at the level of
MATH 51 or
CME 100 or equivalent.
Terms: Aut, Spr, Sum
| Units: 3-5
| UG Reqs: WAY-AQR, WAY-FR, GER:DB-EngrAppSci
Instructors:
Piech, C. (PI)
;
Sahami, M. (PI)
;
Yan, L. (PI)
;
Banerjee, O. (TA)
;
Chartock, E. (TA)
;
Chen, J. (TA)
;
Chen, W. (TA)
;
Corcoran, B. (TA)
;
Daniel, J. (TA)
;
Dasu, G. (TA)
;
Davis, A. (TA)
;
Glaser, N. (TA)
;
Hemmati, S. (TA)
;
Istrate, A. (TA)
;
Johnston, L. (TA)
;
Kim, S. (TA)
;
Le, Y. (TA)
;
Liu, Y. (TA)
;
Moore, D. (TA)
;
Palamuttam, R. (TA)
;
Prasetio, C. (TA)
;
Redondo, E. (TA)
;
Shukla, A. (TA)
;
Ulmer, B. (TA)
;
Wright, D. (TA)
;
Yan, L. (TA)
CS 161: Design and Analysis of Algorithms
Worst and average case analysis. Recurrences and asymptotics. Efficient algorithms for sorting, searching, and selection. Data structures: binary search trees, heaps, hash tables. Algorithm design techniques: divide-and-conquer, dynamic programming, greedy algorithms, amortized analysis, randomization. Algorithms for fundamental graph problems: minimum-cost spanning tree, connected components, topological sort, and shortest paths. Possible additional topics: network flow, string searching. Prerequisite: 103 or 103B; 109 or
STATS 116.
Terms: Aut, Win, Sum
| Units: 3-5
| UG Reqs: GER:DB-EngrAppSci, WAY-FR
Instructors:
Eng, D. (PI)
;
Guibas, L. (PI)
;
Wootters, M. (PI)
;
Blaine, E. (TA)
;
Chatziafratis, V. (TA)
;
Chen, J. (TA)
;
Chen, M. (TA)
;
Chen, S. (TA)
;
Chen, W. (TA)
;
Corcoran, B. (TA)
;
Diana, E. (TA)
;
Gabrielsson, R. (TA)
;
Gan, E. (TA)
;
Garcia, A. (TA)
;
Hancock, B. (TA)
;
Hong, J. (TA)
;
Hu, S. (TA)
;
Khandwala, N. (TA)
;
Kim, S. (TA)
;
Murphy, D. (TA)
;
Paskov, I. (TA)
;
Redondo, E. (TA)
;
Rong, K. (TA)
;
Su, J. (TA)
;
Vu, A. (TA)
;
Warshaw, D. (TA)
;
Wright, D. (TA)
;
Wu, X. (TA)
ECON 50: Economic Analysis I
Individual consumer and firm behavior under perfect competition. The role of markets and prices in a decentralized economy. Monopoly in partial equilibrium. Economic tools developed from multivariable calculus using partial differentiation and techniques for constrained and unconstrained optimization. Prerequisites:
Econ 1 or 1V, and
Math 51 or
Math 51A or
CME 100 or
CME 100A.
Terms: Aut, Win, Spr, Sum
| Units: 5
| UG Reqs: WAY-SI, WAY-FR, GER:DB-Math
ECON 51: Economic Analysis II
Neoclassical analysis of general equilibrium, welfare economics, imperfect competition, externalities and public goods, risk and uncertainty, game theory, adverse selection, and moral hazard. Multivariate calculus is used. Prerequisite:
ECON 50.
Terms: Win, Spr
| Units: 5
| UG Reqs: WAY-FR, WAY-SI
ECON 136: Market Design
Use of economic theory and analysis to design allocation mechanisms and market institutions. Course focuses on three areas: the design of matching algorithms to solve assignment problems, with applications to school choice, entry-level labor markets, and kidney exchanges; the design of auctions to solve general resource allocation problems, with applications to the sale of natural resources, financial assets, radio spectrum, and advertising; and the design of platforms and exchanges, with applications to internet markets. Emphasis on connecting economic theory to practical applications. Students must write term paper. Prerequisites: recommended:
ECON 51 (Public Policy majors may take
PUBLPOL 51 as a substitute for
ECON 51).
Terms: Aut
| Units: 5
| UG Reqs: WAY-FR
Instructors:
Milgrom, P. (PI)
;
Storms, E. (TA)
ECON 137: Decision Modeling and Information
Effective decision models consider a decision maker's alternatives, information and preferences. The construction of such models in single-party situations with emphasis on the role of information. The course then evolves to two-party decision situations where one party has more information than the other. Models examined include: bidding exercises and the winner's curse, the Akerlof Model and adverse selection, the Principal-Agent model and risk sharing, moral hazard and contract design. Prerequisite:
ECON 102A or equivalent. Recommended:
Econ 50, Optimization and simulation in Excel.
Terms: Aut
| Units: 5
| UG Reqs: WAY-AQR, WAY-FR
Instructors:
McKeon, S. (PI)
;
Mok, T. (TA)
ECON 160: Game Theory and Economic Applications
Introduction to game theory and its applications to economics. Topics: strategic and extensive form games, dominant strategies, Nash equilibrium, subgame-perfect equilibrium, and Bayesian equilibrium. The theory is applied to repeated games, voting, auctions, and bargaining with examples from economics and political science. Prerequisites: Working knowledge of calculus and basic probability theory.
Terms: Win
| Units: 5
| UG Reqs: WAY-FR, WAY-SI
Instructors:
Saraniti, B. (PI)
;
Noda, S. (TA)
ECON 180: Honors Game Theory
Rigorous introduction to game theory and applications. Topics include solution concepts for static and dynamic games of complete and incomplete information, signaling games, repeated games, bargaining, and elements of cooperative game theory. Applications mainly from economics, but also political science, biology, and computer science. Prerequisites: Experience with abstract mathematics and willingness to work hard. No background in economics required.
Terms: Aut
| Units: 5
| UG Reqs: GER:DB-SocSci, WAY-FR, WAY-SI
Instructors:
Segal, I. (PI)
;
Chen, W. (TA)
ECON 182: Honors Market Design
Rigorous introduction to the theory of matching and resource allocation, and its application to practical market design. Theory covers two-sided matching, "house allocation" problems, random assignment, and their variants. Applied topics include school choice, labor market, house allocation, and organ allocation for transplantation. Final paper required. Forms a sequence with
ECON 180 and
ECON 181, but can be taken independently. Prerequisites: Experience with abstract mathematics and willingness tonwork hard. No prior knowledge of economics is required, although basic knowledge in game theory is useful.
Terms: Spr
| Units: 5
| UG Reqs: WAY-FR
Instructors:
Kojima, F. (PI)
Filter Results: