printer friendly pageCS 149: Parallel Computing
This course is an introduction to parallelism and parallel programming. Most new computer architectures are parallel; programming these machines requires knowledge of the basic issues of and techniques for writing parallel software. Topics: varieties of parallelism in current hardware (e.g., fast networks, multicore, accelerators such as GPUs, vector instruction sets), importance of locality, implicit vs. explicit parallelism, shared vs. non-shared memory, synchronization mechanisms (locking, atomicity, transactions, barriers), and parallel programming models (threads, data parallel/streaming, futures, SPMD, message passing, SIMT, transactions, and nested parallelism). Significant parallel programming assignments will be given as homework. The course is open to students who have completed the introductory CS course sequence through 110 and have taken
CS 143.
Terms: Win
| Units: 3-4
| UG Reqs: GER:DB-EngrAppSci
Instructors:
Aiken, A. (PI)
;
Olukotun, O. (PI)
CS 154: Introduction to Automata and Complexity Theory
This course provides a mathematical introduction to the following questions: What is computation? Given a computational model, what problems can we hope to solve in principle with this model? Besides those solvable in principle, what problems can we hope to efficiently solve? In many cases we can give completely rigorous answers; in other cases, these questions have become major open problems in computer science and mathematics. By the end of this course, students will be able to classify computational problems in terms of their computational complexity (Is the problem regular? Not regular? Decidable? Recognizable? Neither? Solvable in P? NP-complete? PSPACE-complete?, etc.). Students will gain a deeper appreciation for some of the fundamental issues in computing that are independent of trends of technology, such as the Church-Turing Thesis and the P versus NP problem. Prerequisites:
CS 103 or 103B.
Terms: Win
| Units: 3-4
| UG Reqs: GER:DB-EngrAppSci
Instructors:
Williams, R. (PI)
CS 155: Computer and Network Security
For seniors and first-year graduate students. Principles of computer systems security. Attack techniques and how to defend against them. Topics include: network attacks and defenses, operating system security, application security (web, apps, databases), malware, privacy, and security for mobile devices. Course projects focus on building reliable code. Prerequisite: 110. Recommended: basic Unix.
Terms: Spr
| Units: 3
| UG Reqs: GER:DB-EngrAppSci
Instructors:
Boneh, D. (PI)
;
Mitchell, J. (PI)
CS 157: Logic and Automated Reasoning
An elementary exposition from a computational point of view of propositional and predicate logic, axiomatic theories, and theories with equality and induction. Interpretations, models, validity, proof, strategies, and applications. Automated deduction: polarity, skolemization, unification, resolution, equality. Prerequisite: 103 or 103B.
Terms: Aut
| Units: 3
| UG Reqs: GER:DB-EngrAppSci
Instructors:
Genesereth, M. (PI)
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, Spr, Sum
| Units: 3-5
| UG Reqs: GER:DB-EngrAppSci, WAY-FR
CS 178: Digital Photography
Scientific, artistic, and computing aspects of digital photography. Topics: lenses and optics, light and sensors, optical effects in nature, perspective and depth of field, sampling and noise, the camera as a computing platform, image processing and editing, history of photography, computational photography. Counts as a CS elective in the Graphics track. Prerequisites: introductory calculus; students must have a digital camera with manual control over shutter speed and aperture. Loaner cameras may be available. No programming experience required. GER:DB-EngrAppSci
Terms: Spr
| Units: 3-5
| UG Reqs: WAY-CE, GER:DB-EngrAppSci
Instructors:
Levoy, M. (PI)
CS 75N: Cell Phones, Sensors, and You
Focuses on the role of cell phones as the first prevalent wearable sensors that gather information about you that can be both useful and potentially harmful. Topics include the state of technology, sociological and privacy implications, potential governmental regulation, etc. Addresses omniscient "big brother" technology including radar guns and the recording devices that led to the Watergate scandal. Students will gather and compile information on topics and come to class ready to discuss and debate with formulated opinions.
| UG Reqs: GER:DB-EngrAppSci
CS 164: Computing with Physical Objects: Algorithms for Shape and Motion
Algorithms and data structures dealing with the representation and manipulation of physical objects and entities in the computer. Computational structures for shape and motion, shape fitting and matching, triangulations and other spatial subdivisions, and low-dimensional search and optimization. Examples relevant to computer graphics, computer vision, robotics and geometric computation emphasizing algorithmic paradigms applicable to multidimensional data. Prerequisites:
CS 103 or 103B, and
CS 109 or
STATS 116, and
CS 106B/X or consent of instructor.
| UG Reqs: GER:DB-EngrAppSci
EARTHSYS 101: Energy and the Environment (ENERGY 101)
Energy use in modern society and the consequences of current and future energy use patterns. Case studies illustrate resource estimation, engineering analysis of energy systems, and options for managing carbon emissions. Focus is on energy definitions, use patterns, resource estimation, pollution. Recommended:
MATH 21 or 42.
Terms: Win
| Units: 3
| UG Reqs: GER:DB-EngrAppSci, WAY-AQR, WAY-SMA
Instructors:
Durlofsky, L. (PI)
;
Kovscek, A. (PI)
;
Gerhart, K. (TA)
...
more instructors for EARTHSYS 101 »
Instructors:
Durlofsky, L. (PI)
;
Kovscek, A. (PI)
;
Gerhart, K. (TA)
;
Laboy, B. (TA)
;
Wallace, S. (TA)
;
Yi, I. (TA)
EARTHSYS 102: Renewable Energy Sources and Greener Energy Processes (ENERGY 102)
The energy sources that power society are rooted in fossil energy although energy from the core of the Earth and the sun is almost inexhaustible; but the rate at which energy can be drawn from them with today's technology is limited. The renewable energy resource base, its conversion to useful forms, and practical methods of energy storage. Geothermal, wind, solar, biomass, and tidal energies; resource extraction and its consequences. Recommended:
MATH 21 or 42.
Terms: Spr
| Units: 3
| UG Reqs: WAY-SMA, GER:DB-EngrAppSci
Instructors:
Gerritsen, M. (PI)
;
Kovscek, A. (PI)
Filter Results: