2013-2014 2014-2015 2015-2016 2016-2017 2017-2018
Browse
by subject...
    Schedule
view...
 
  Are you a Computer Science Student? Want to make Stanford's systems even better?
Do you want to help improve the Stanford systems that you and your friends use all the time? We are looking for students interested in hacking on ExploreCourses and other upcoming university systems. Click here to learn more!

21 - 30 of 88 results for: CS

CS 140E: Operating systems design and implementation

This is an experimental course offering. Students will implement a simple, clean operating system (virtual memory, processes, file system) on a rasberry pi computer and use the result to run a variety of devices. Enrollment is limited, and students should expect the course to have rough edges since it is the first offering.
Terms: Win | Units: 3-4 | Grading: Letter or Credit/No Credit

CS 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, MapReduce, Apache Spark, 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 | Grading: Letter or Credit/No Credit

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 | Grading: Letter or Credit/No Credit

CS 181: Computers, Ethics, and Public Policy

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. To take this course, students need permission of instructor and may need to complete an assignment due at the first day of class.
Terms: Win, Spr | Units: 4 | UG Reqs: GER:EC-EthicReas, WAY-ER | Grading: Letter or Credit/No Credit

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

Writing-intensive version of CS181. Satisfies the WIM requirement for Computer Science, Engineering Physics, STS, and Math/Comp Sci undergraduates. To take this course, students need permission of instructor and may need to complete an assignment due at the first day of class.
Terms: Win, Spr | Units: 4 | UG Reqs: GER:EC-EthicReas, WAY-ER | Grading: Letter (ABCD/NP)

CS 190: Software Design Studio

Terms: Win | Units: 3 | Grading: Letter or Credit/No Credit

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. Prerequisite: Completion of at least 135 units.
Terms: Aut, Win, Spr, Sum | Units: 1-6 | Repeatable for credit | Grading: Letter (ABCD/NP)
Instructors: Agrawala, M. (PI) ; Aiken, A. (PI) ; Akeley, K. (PI) ; Altman, R. (PI) ; Angst, R. (PI) ; Bailis, P. (PI) ; Baker, M. (PI) ; Barbagli, F. (PI) ; Batzoglou, S. (PI) ; Bejerano, G. (PI) ; Bernstein, M. (PI) ; Blikstein, P. (PI) ; Boneh, D. (PI) ; Borenstein, J. (PI) ; Boyd, S. (PI) ; Bradski, G. (PI) ; Brafman, R. (PI) ; Cain, J. (PI) ; Cao, P. (PI) ; Casado, M. (PI) ; Charikar, M. (PI) ; Cheriton, D. (PI) ; Cooper, S. (PI) ; Dally, B. (PI) ; De-Micheli, G. (PI) ; Dill, D. (PI) ; Dror, R. (PI) ; Dwork, C. (PI) ; Engler, D. (PI) ; Ermon, S. (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) ; Goel, S. (PI) ; Goodman, N. (PI) ; Guibas, L. (PI) ; Hanrahan, P. (PI) ; Heer, J. (PI) ; Hennessy, J. (PI) ; Horowitz, M. (PI) ; James, D. (PI) ; Johari, R. (PI) ; Johnson, M. (PI) ; Jurafsky, D. (PI) ; Katti, S. (PI) ; Kay, M. (PI) ; Khatib, O. (PI) ; Klemmer, S. (PI) ; Kochenderfer, M. (PI) ; Koller, D. (PI) ; Koltun, V. (PI) ; Konolige, K. (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) ; Manna, Z. (PI) ; Manning, C. (PI) ; Mazieres, D. (PI) ; McCarthy, J. (PI) ; McCluskey, E. (PI) ; McKeown, N. (PI) ; Meng, T. (PI) ; Mitchell, J. (PI) ; Mitra, S. (PI) ; Montanari, A. (PI) ; Motwani, R. (PI) ; Musen, M. (PI) ; Nass, C. (PI) ; Nayak, P. (PI) ; Ng, A. (PI) ; Niebles Duque, J. (PI) ; Nilsson, N. (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) ; Sahami, M. (PI) ; Salisbury, J. (PI) ; Savarese, S. (PI) ; Saxena, A. (PI) ; Schwarz, K. (PI) ; Shoham, Y. (PI) ; Sosic, R. (PI) ; Stepp, M. (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) ; Williams, V. (PI) ; Winograd, T. (PI) ; Winstein, K. (PI) ; Wootters, M. (PI) ; Young, P. (PI) ; Zaharia, M. (PI) ; Zelenski, J. (PI)

CS 191W: Writing Intensive Senior Project (WIM)

Restricted to Computer Science and Computer Systems Engineering students. Writing-intensive version of CS191. Register using the section number of an Academic Council member. Prerequisite: Completion of at least 135 units.
Terms: Aut, Win, Spr | Units: 3-6 | Repeatable for credit | Grading: Letter (ABCD/NP)
Instructors: Agrawala, M. (PI) ; 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) ; Borenstein, J. (PI) ; Boyd, S. (PI) ; Bradski, G. (PI) ; Brafman, R. (PI) ; Brunskill, E. (PI) ; Cain, J. (PI) ; Cao, P. (PI) ; Casado, M. (PI) ; Charikar, M. (PI) ; Cheriton, D. (PI) ; Cooper, S. (PI) ; Dally, B. (PI) ; De-Micheli, G. (PI) ; Dill, D. (PI) ; Dror, R. (PI) ; Dwork, C. (PI) ; Engler, D. (PI) ; Ermon, S. (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) ; Goodman, N. (PI) ; Guibas, L. (PI) ; Hanrahan, P. (PI) ; Heer, J. (PI) ; Hennessy, J. (PI) ; Horowitz, M. (PI) ; James, D. (PI) ; Johari, R. (PI) ; Johnson, M. (PI) ; Jurafsky, D. (PI) ; Katti, S. (PI) ; Kay, M. (PI) ; Khatib, O. (PI) ; Klemmer, S. (PI) ; Kochenderfer, M. (PI) ; Koller, D. (PI) ; Koltun, V. (PI) ; Konolige, K. (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) ; Mackey, L. (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) ; Mitra, S. (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) ; 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) ; Saberi, A. (PI) ; Sahami, M. (PI) ; Salisbury, J. (PI) ; Savarese, S. (PI) ; Saxena, A. (PI) ; Schwarz, K. (PI) ; Shoham, Y. (PI) ; Stepp, M. (PI) ; Thrun, S. (PI) ; Tobagi, F. (PI) ; Trevisan, L. (PI) ; Ullman, J. (PI) ; Valiant, G. (PI) ; Van Roy, B. (PI) ; Wang, G. (PI) ; Wetzstein, G. (PI) ; Widom, J. (PI) ; Wiederhold, G. (PI) ; Williams, R. (PI) ; Williams, V. (PI) ; Winograd, T. (PI) ; Winstein, K. (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.
Terms: Aut, Win, Spr, Sum | Units: 1-4 | Repeatable for credit | Grading: Letter or Credit/No Credit
Instructors: Aiken, A. (PI) ; Altman, R. (PI) ; Baker, M. (PI) ; Barbagli, F. (PI) ; Batzoglou, S. (PI) ; Bejerano, G. (PI) ; Bernstein, M. (PI) ; Boneh, D. (PI) ; Bradski, G. (PI) ; Brafman, R. (PI) ; Cain, J. (PI) ; Cao, P. (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) ; Gregg, C. (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) ; Lam, M. (PI) ; Latombe, J. (PI) ; Leskovec, J. (PI) ; Levis, P. (PI) ; Levitt, M. (PI) ; Levoy, M. (PI) ; Li, F. (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) ; Motwani, R. (PI) ; Musen, M. (PI) ; Nass, C. (PI) ; Nayak, P. (PI) ; Ng, A. (PI) ; Nilsson, N. (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) ; Trevisan, L. (PI) ; Ullman, J. (PI) ; Van Roy, B. (PI) ; Widom, J. (PI) ; Wiederhold, G. (PI) ; Williams, R. (PI) ; Winograd, T. (PI) ; Young, P. (PI) ; Zelenski, J. (PI)

CS 194: Software Project

Terms: Win, Spr | Units: 3 | Repeatable for credit | Grading: Letter (ABCD/NP)
Filter Results:
term offered
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