2019-2020 2020-2021 2021-2022 2022-2023 2023-2024
Browse
by subject...
    Schedule
view...
 

41 - 50 of 206 results for: CS

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

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

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 166: Data Structures

Techniques in the design, analysis, and implementation of data structures. Isometries between data structures (including red/black trees and 2-3-4 trees), amortized analysis (including Fibonacci heaps and splay trees), and randomization (including count-min sketches and dynamic perfect hash tables). Data structures for integers and strings (including van Emde Boas trees and suffix trees). Possible additional topics include functional data structures, concurrent data structures, and spatial data structures. Prerequisites: CS107 and CS161.
Terms: Spr | Units: 3-4
Instructors: Schwarz, K. (PI)

CS 167: Readings in Algorithms

Recent research in the design and analysis of algorithms. Readings cover both classical and emerging topics, such as: computational models for massive data sets; data privacy; dimensionality reduction; exact and approximate algorithms for NP-hard problems; graph algorithms; hashing; online learning; search trees; streaming and sketching. Students are expected to respond to research papers, deliver an oral presentation, and complete a reading or programming project. Limited enrollment; preference given to undergraduates. Prerequisites: CS161.
Terms: Spr | Units: 3

CS 170: Stanford Laptop Orchestra: Composition, Coding, and Performance (MUSIC 128)

Classroom instantiation of the Stanford Laptop Orchestra (SLOrk) which includes public performances. An ensemble of more than 20 humans, laptops, controllers, and special speaker arrays designed to provide each computer-mediated instrument with its sonic identity and presence. Topics and activities include issues of composing for laptop orchestras, instrument design, sound synthesis, programming, and live performance. May be repeated four times for credit.
Terms: Spr | Units: 1-5 | UG Reqs: WAY-CE | Repeatable 4 times (up to 20 units total)
Instructors: Wang, G. (PI)

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 181: Computers, Ethics, and Public Policy

(Formerly 201.) Primarily for majors entering computer-related fields. Ethical and social issues related to the development and use of computer technology. Ethical theory, and social, political, and legal considerations. Scenarios in problem areas: privacy, reliability and risks of complex systems, and responsibility of professionals for applications and consequences of their work. Prerequisite: 106B or X.
Terms: Aut, Win, Spr | Units: 4 | UG Reqs: WAY-ER, GER:EC-EthicReas

CS 181W: Computers, Ethics, and Public Policy (WIM)

Writing-intensive version of CS181. Satisfies the WIM requirement for Computer Science and Computer Systems Engineering undergraduates.
Terms: Aut, Win, Spr | Units: 4 | UG Reqs: WAY-ER, GER:EC-EthicReas

CS 191: Senior Project

Restricted to Computer Science and Computer Systems Engineering students. Group or individual projects under faculty direction. Register using instructor's section number. A project can be either a significant software application or publishable research. Software application projects include substantial programming and modern user-interface technologies and are comparable in scale to shareware programs or commercial applications. Research projects may result in a paper publishable in an academic journal or presentable at a conference. Required public presentation of final application or research results.
Terms: Aut, Win, Spr, Sum | Units: 1-6 | Repeatable for credit
Instructors: Aiken, A. (PI) ; Akeley, K. (PI) ; Altman, R. (PI) ; Baker, M. (PI) ; Barbagli, F. (PI) ; Batzoglou, S. (PI) ; Bejerano, G. (PI) ; Bernstein, M. (PI) ; Blikstein, P. (PI) ; Boneh, D. (PI) ; Boyd, S. (PI) ; Bradski, G. (PI) ; Brafman, R. (PI) ; Cain, J. (PI) ; Cao, P. (PI) ; Casado, M. (PI) ; Cheriton, D. (PI) ; Cooper, S. (PI) ; Dally, B. (PI) ; De-Micheli, G. (PI) ; Dill, D. (PI) ; Dwork, C. (PI) ; Engler, D. (PI) ; Fedkiw, R. (PI) ; Feigenbaum, E. (PI) ; Fikes, R. (PI) ; Fisher, K. (PI) ; Fogg, B. (PI) ; Fox, A. (PI) ; Garcia-Molina, H. (PI) ; Genesereth, M. (PI) ; Gill, J. (PI) ; Girod, B. (PI) ; Goel, A. (PI) ; Golub, G. (PI) ; Goodman, N. (PI) ; Guibas, L. (PI) ; Hanrahan, P. (PI) ; Heer, J. (PI) ; Hennessy, J. (PI) ; Horowitz, M. (PI) ; Johari, R. (PI) ; Johnson, M. (PI) ; Jurafsky, D. (PI) ; Katti, S. (PI) ; Kay, M. (PI) ; Khatib, O. (PI) ; Klemmer, S. (PI) ; Koller, D. (PI) ; Koltun, V. (PI) ; Konolige, K. (PI) ; Kozyrakis, C. (PI) ; Kundaje, A. (PI) ; Lam, M. (PI) ; Latombe, J. (PI) ; Leskovec, J. (PI) ; Levis, P. (PI) ; Levitt, M. (PI) ; Levoy, M. (PI) ; Li, F. (PI) ; Liang, P. (PI) ; Manna, Z. (PI) ; Manning, C. (PI) ; Mazieres, D. (PI) ; McCarthy, J. (PI) ; McCluskey, E. (PI) ; McKeown, N. (PI) ; Meng, T. (PI) ; Mitchell, J. (PI) ; Montanari, A. (PI) ; Motwani, R. (PI) ; Musen, M. (PI) ; Nass, C. (PI) ; Nayak, P. (PI) ; Ng, A. (PI) ; Nilsson, N. (PI) ; Olukotun, O. (PI) ; Ousterhout, J. (PI) ; Paepcke, A. (PI) ; Parlante, N. (PI) ; Pea, R. (PI) ; Plotkin, S. (PI) ; Plummer, R. (PI) ; Prabhakar, B. (PI) ; Pratt, V. (PI) ; Raghavan, P. (PI) ; Rajaraman, A. (PI) ; Re, C. (PI) ; Roberts, E. (PI) ; Rosenblum, M. (PI) ; Roughgarden, T. (PI) ; Sahami, M. (PI) ; Salisbury, J. (PI) ; Savarese, S. (PI) ; Schwarz, K. (PI) ; Shoham, Y. (PI) ; Thrun, S. (PI) ; Tobagi, F. (PI) ; Trevisan, L. (PI) ; Ullman, J. (PI) ; Valiant, G. (PI) ; Van Roy, B. (PI) ; Wang, G. (PI) ; Widom, J. (PI) ; Wiederhold, G. (PI) ; Williams, R. (PI) ; Winograd, T. (PI) ; Young, P. (PI) ; Zelenski, J. (PI)
Filter Results:
term offered
updating results...
teaching presence
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints