2016-2017 2017-2018 2018-2019 2019-2020 2020-2021
Browse
by subject...
    Schedule
view...
 
  COVID-19 Scheduling Updates!
Due to recent announcements about Autumn Quarter (see the President's update), please expect ongoing changes to the class schedule.

21 - 30 of 90 results for: CS

CS 143: Compilers

Principles and practices for design and implementation of compilers and interpreters. Topics: lexical analysis; parsing theory; symbol tables; type systems; scope; semantic analysis; intermediate representations; runtime environments; code generation; and basic program analysis and optimization. Students construct a compiler for a simple object-oriented language during course programming projects. Prerequisites: 103 or 103B, and 107.
Terms: Spr | Units: 3-4 | UG Reqs: GER:DB-EngrAppSci

CS 151: Logic Programming

Logic Programming is a style of programming based on symbolic logic. In writing a logic program, the programmer describes the application area of the program (as a set of logical sentences) without reference to the internal data structures or operations of the system executing the program. In this regard, a logic program is more of a specification than an implementation; and logic programs are often called runnable specifications. This course introduces basic logic programming theory, current technology, and examples of common applications, notably deductive databases, logical spreadsheets, enterprise management, computational law, and game playing. Work in the course takes the form of readings and exercises, weekly programming assignments, and a term-long project. Prerequisite: CS 106B or equivalent.
Terms: Spr | Units: 3

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

This course is designed as a deep dive into the design, analysis, implementation, and theory of data structures. Over the course of the quarter, we'll explore fundamental techniques in data structure design (isometries, amortization, randomization, word-level parallelism, etc.). In doing so, we'll see a number of classic data structures like Fibonacci heaps and suffix trees as well as more modern data structures like count-min sketches and range minimum queries. By the time we've finished, we'll have seen some truly beautiful strategies for solving problems efficiently. Prerequisites: CS107 and CS161.
Terms: Spr | Units: 3-4
Instructors: Schwarz, K. (PI)

CS 168: The Modern Algorithmic Toolbox

This course will provide a rigorous and hands-on introduction to the central ideas and algorithms that constitute the core of the modern algorithms toolkit. Emphasis will be on understanding the high-level theoretical intuitions and principles underlying the algorithms we discuss, as well as developing a concrete understanding of when and how to implement and apply the algorithms. The course will be structured as a sequence of one-week investigations; each week will introduce one algorithmic idea, and discuss the motivation, theoretical underpinning, and practical applications of that algorithmic idea. Each topic will be accompanied by a mini-project in which students will be guided through a practical application of the ideas of the week. Topics include hashing, dimension reduction and LSH, boosting, linear programming, gradient descent, sampling and estimation, and an introduction to spectral techniques. Prerequisites: CS107 and CS161, or permission from the instructor.
Terms: Spr | Units: 3-4
Instructors: Valiant, G. (PI)

CS 184: Bridging Policy and Tech Through Design (PUBLPOL 170)

This project-based course aims to bring together students from computer science and the social sciences to work with external partner organizations at the nexus of digital technology and public policy. Students will collaborate in interdisciplinary teams on a problem with a partner organization. Along with the guidance of faculty mentors and the teaching staff, students will engage in a project with outcomes ranging from policy memos and white papers to data visualizations and software. Possible projects suggested by partner organizations will be presented at an information session in early March. Following the infosession, a course application will open for teams to be selected before the start of Spring Quarter. Students may apply to a project with a partner organization or with a preformed team and their own idea to be reviewed for approval by the course staff. There will be one meeting per week for the full class and at least one weekly meeting with the project-based team mentors. Prerequisites: Appropriate preparation depends on the nature of the project proposed, and will be verified by the teaching staff based on your application.
Terms: Spr | Units: 3
Instructors: Ullman, J. (PI)

CS 191: Senior Project

Restricted to Computer Science 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. Public presentation of final application or research results is required. Prerequisite: Completion of at least 135 units and consent of instructor. Project proposal form is required before the beginning of the quarter of enrollment: https://cs.stanford.edu/degrees/undergrad/Senior%20Project%20Proposal.pdf
Terms: Aut, Win, Spr, Sum | Units: 1-6 | Repeatable for credit
Instructors: Agrawala, M. (PI) ; Aiken, A. (PI) ; Altman, R. (PI) ; Angst, R. (PI) ; Bailis, P. (PI) ; Batzoglou, S. (PI) ; Bejerano, G. (PI) ; Bernstein, M. (PI) ; Blikstein, P. (PI) ; Bohg, J. (PI) ; Boneh, D. (PI) ; Borenstein, J. (PI) ; Boyd, S. (PI) ; Cain, J. (PI) ; Cao, P. (PI) ; Charikar, M. (PI) ; Cheriton, D. (PI) ; Dally, B. (PI) ; Dill, D. (PI) ; Dror, R. (PI) ; Durumeric, Z. (PI) ; Engler, D. (PI) ; Ermon, S. (PI) ; Fedkiw, R. (PI) ; Feigenbaum, E. (PI) ; Fikes, R. (PI) ; Finn, C. (PI) ; Fisher, K. (PI) ; Fox, A. (PI) ; Fox, J. (PI) ; Garcia-Molina, H. (PI) ; Genesereth, M. (PI) ; Gill, J. (PI) ; Girod, B. (PI) ; Goel, A. (PI) ; Goel, S. (PI) ; Goodman, N. (PI) ; Gregg, C. (PI) ; Guibas, L. (PI) ; Hanrahan, P. (PI) ; Hashimoto, T. (PI) ; Hennessy, J. (PI) ; Horowitz, M. (PI) ; Icard, T. (PI) ; James, D. (PI) ; Johari, R. (PI) ; Jurafsky, D. (PI) ; Katti, S. (PI) ; Kay, M. (PI) ; Khatib, O. (PI) ; Kochenderfer, M. (PI) ; Koller, D. (PI) ; Kozyrakis, C. (PI) ; Kundaje, A. (PI) ; Lam, M. (PI) ; Landay, J. (PI) ; Latombe, J. (PI) ; Lee, C. (PI) ; Leskovec, J. (PI) ; Levis, P. (PI) ; Levitt, M. (PI) ; Levoy, M. (PI) ; Li, F. (PI) ; Liang, P. (PI) ; Ma, T. (PI) ; Manning, C. (PI) ; Mazieres, D. (PI) ; McCarthy, J. (PI) ; McKeown, N. (PI) ; Mitchell, J. (PI) ; Mitra, S. (PI) ; Montanari, A. (PI) ; Musen, M. (PI) ; Nayak, P. (PI) ; Ng, A. (PI) ; Niebles Duque, J. (PI) ; Olukotun, O. (PI) ; Ousterhout, J. (PI) ; Paepcke, A. (PI) ; Pande, V. (PI) ; Parlante, N. (PI) ; Pea, R. (PI) ; Piech, C. (PI) ; Plotkin, S. (PI) ; Plummer, R. (PI) ; Poldrack, R. (PI) ; Potts, C. (PI) ; Prabhakar, B. (PI) ; Pratt, V. (PI) ; Raghavan, P. (PI) ; Rajaraman, A. (PI) ; Re, C. (PI) ; Reingold, O. (PI) ; Roberts, E. (PI) ; Rosenblum, M. (PI) ; Roughgarden, T. (PI) ; Rubin, D. (PI) ; Sadigh, D. (PI) ; Sahami, M. (PI) ; Salisbury, J. (PI) ; Savarese, S. (PI) ; Saxena, A. (PI) ; Schwarz, K. (PI) ; Shoham, Y. (PI) ; Sosic, R. (PI) ; Tan, L. (PI) ; Thrun, S. (PI) ; Tobagi, F. (PI) ; Trippel, C. (PI) ; Ullman, J. (PI) ; Valiant, G. (PI) ; Van Roy, B. (PI) ; Wang, G. (PI) ; Widom, J. (PI) ; Wiederhold, G. (PI) ; Winograd, T. (PI) ; Winstein, K. (PI) ; Wootters, M. (PI) ; Wu, J. (PI) ; Yamins, D. (PI) ; Yeung, S. (PI) ; Young, P. (PI) ; Zaharia, M. (PI) ; Zelenski, J. (PI) ; Zou, J. (PI)

CS 191W: Writing Intensive Senior Project (WIM)

Restricted to Computer Science students. Writing-intensive version of CS191. Register using instructor's section number. Prerequisite: Completion of at least 135 units and consent of instructor. Project proposal form is required before the beginning of the quarter of enrollment: https://cs.stanford.edu/degrees/undergrad/Senior%20Project%20Proposal.pdf
Terms: Aut, Win, Spr | Units: 3-6 | Repeatable for credit
Instructors: Agrawala, M. (PI) ; Aiken, A. (PI) ; Altman, R. (PI) ; Batzoglou, S. (PI) ; Bejerano, G. (PI) ; Bernstein, M. (PI) ; Blikstein, P. (PI) ; Bohg, J. (PI) ; Boneh, D. (PI) ; Borenstein, J. (PI) ; Boyd, S. (PI) ; Brunskill, E. (PI) ; Cain, J. (PI) ; Cao, P. (PI) ; Charikar, M. (PI) ; Cheriton, D. (PI) ; Dally, B. (PI) ; Dill, D. (PI) ; Dror, R. (PI) ; Durumeric, Z. (PI) ; Engler, D. (PI) ; Ermon, S. (PI) ; Fatahalian, K. (PI) ; Fedkiw, R. (PI) ; Feigenbaum, E. (PI) ; Fikes, R. (PI) ; Finn, C. (PI) ; Fisher, K. (PI) ; Fox, A. (PI) ; Fox, J. (PI) ; Garcia-Molina, H. (PI) ; Genesereth, M. (PI) ; Gill, J. (PI) ; Girod, B. (PI) ; Goel, A. (PI) ; Goel, S. (PI) ; Goodman, N. (PI) ; Gregg, C. (PI) ; Guibas, L. (PI) ; Hanrahan, P. (PI) ; Hashimoto, T. (PI) ; Hennessy, J. (PI) ; Horowitz, M. (PI) ; Icard, T. (PI) ; James, D. (PI) ; Johari, R. (PI) ; Jurafsky, D. (PI) ; Katti, S. (PI) ; Kay, M. (PI) ; Khatib, O. (PI) ; Kochenderfer, M. (PI) ; Koller, D. (PI) ; Kozyrakis, C. (PI) ; Kundaje, A. (PI) ; Lam, M. (PI) ; Landay, J. (PI) ; Latombe, J. (PI) ; Leskovec, J. (PI) ; Levis, P. (PI) ; Levitt, M. (PI) ; Levoy, M. (PI) ; Li, F. (PI) ; Liang, P. (PI) ; Manning, C. (PI) ; Mazieres, D. (PI) ; McCarthy, J. (PI) ; McKeown, N. (PI) ; Mitchell, J. (PI) ; Mitra, S. (PI) ; Montanari, A. (PI) ; Musen, M. (PI) ; Nayak, P. (PI) ; Ng, A. (PI) ; Niebles Duque, J. (PI) ; Okamura, A. (PI) ; Olukotun, O. (PI) ; Ousterhout, J. (PI) ; Paepcke, A. (PI) ; Pande, V. (PI) ; Parlante, N. (PI) ; Pea, R. (PI) ; Piech, C. (PI) ; Plotkin, S. (PI) ; Plummer, R. (PI) ; Potts, C. (PI) ; Prabhakar, B. (PI) ; Pratt, V. (PI) ; Raghavan, P. (PI) ; Rajaraman, A. (PI) ; Re, C. (PI) ; Reingold, O. (PI) ; Roberts, E. (PI) ; Rosenblum, M. (PI) ; Roughgarden, T. (PI) ; Rubin, D. (PI) ; Saberi, A. (PI) ; Sadigh, D. (PI) ; Sahami, M. (PI) ; Salisbury, J. (PI) ; Savarese, S. (PI) ; Saxena, A. (PI) ; Schwarz, K. (PI) ; Shoham, Y. (PI) ; Tan, L. (PI) ; Thrun, S. (PI) ; Tobagi, F. (PI) ; Trippel, C. (PI) ; Ullman, J. (PI) ; Valiant, G. (PI) ; Van Roy, B. (PI) ; Wang, G. (PI) ; Wetzstein, G. (PI) ; Widom, J. (PI) ; Wiederhold, G. (PI) ; Winograd, T. (PI) ; Winstein, K. (PI) ; Wodtke, C. (PI) ; Wu, J. (PI) ; Yeung, S. (PI) ; Young, P. (PI) ; Zaharia, M. (PI) ; Zelenski, J. (PI) ; Zou, J. (PI)

CS 192: Programming Service Project

Restricted to Computer Science students. Appropriate academic credit (without financial support) is given for volunteer computer programming work of public benefit and educational value. Register using the section number associated with the instructor. Prerequisite: consent of instructor.
Terms: Aut, Win, Spr, Sum | Units: 1-4 | Repeatable for credit
Instructors: Aiken, A. (PI) ; Altman, R. (PI) ; Batzoglou, S. (PI) ; Bejerano, G. (PI) ; Bernstein, M. (PI) ; Boneh, D. (PI) ; Cain, J. (PI) ; Cao, P. (PI) ; Cheriton, D. (PI) ; Dally, B. (PI) ; Dill, D. (PI) ; Engler, D. (PI) ; Fedkiw, R. (PI) ; Feigenbaum, E. (PI) ; Fikes, R. (PI) ; Fisher, K. (PI) ; Fox, A. (PI) ; Fox, J. (PI) ; Garcia-Molina, H. (PI) ; Genesereth, M. (PI) ; Gill, J. (PI) ; Girod, B. (PI) ; Goel, A. (PI) ; Gregg, C. (PI) ; Guibas, L. (PI) ; Hanrahan, P. (PI) ; Hashimoto, T. (PI) ; Hennessy, J. (PI) ; Horowitz, M. (PI) ; Johari, R. (PI) ; Jurafsky, D. (PI) ; Katti, S. (PI) ; Kay, M. (PI) ; Khatib, O. (PI) ; Koller, D. (PI) ; Kozyrakis, C. (PI) ; Lam, M. (PI) ; Latombe, J. (PI) ; Leskovec, J. (PI) ; Levis, P. (PI) ; Levitt, M. (PI) ; Levoy, M. (PI) ; Li, F. (PI) ; Manning, C. (PI) ; Mazieres, D. (PI) ; McCarthy, J. (PI) ; McKeown, N. (PI) ; Mitchell, J. (PI) ; Musen, M. (PI) ; Nayak, P. (PI) ; Ng, A. (PI) ; Olukotun, O. (PI) ; Ousterhout, J. (PI) ; Parlante, N. (PI) ; Plotkin, S. (PI) ; Plummer, R. (PI) ; Prabhakar, B. (PI) ; Pratt, V. (PI) ; Raghavan, P. (PI) ; Rajaraman, A. (PI) ; Roberts, E. (PI) ; Rosenblum, M. (PI) ; Roughgarden, T. (PI) ; Sahami, M. (PI) ; Salisbury, J. (PI) ; Schwarz, K. (PI) ; Shoham, Y. (PI) ; Thrun, S. (PI) ; Tobagi, F. (PI) ; Trippel, C. (PI) ; Ullman, J. (PI) ; Van Roy, B. (PI) ; Widom, J. (PI) ; Wiederhold, G. (PI) ; Winograd, T. (PI) ; Wu, J. (PI) ; Young, P. (PI) ; Zelenski, J. (PI)

CS 193P: iOS Application Development

Terms: Spr | Units: 3
Instructors: Hegarty, P. (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