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

2161 - 2170 of 9648 results for: ...

print preview printer friendly page

CS 193S: Scalable Web 2.0 Programming

Course charts development path for a large scale modern web service. Resource efficiency demands a single developer should be able to build, test and deploy a single codebase using only open source tools and libraries. Difficult to accomplish in practice due to variety of skill sets needed for UI, client, server and database coding. Course framework presented offers solution that does not sacrifice long term scalability and maintenability for rapid development cycles and easy prototyping. Programming projects provide overview of technologies and critical contraints. Prerequisites: CS107, CS108.
Terms: Win | Units: 3
Instructors: Jannink, J. (PI)

CS 194: Software Project

Design, specification, coding, and testing of a significant team programming project under faculty supervision. Documentation includes a detailed proposal. Public demonstration of the project at the end of the quarter. Prerequisites: CS 110 and CS 161.
Terms: Spr | Units: 3 | Repeatable for credit
Instructors: Plummer, R. (PI)

CS 196: Computer Consulting

Focus is on Macintosh and Windows operating system maintenance and troubleshooting through hardware and software foundation and concepts. Topics include operating systems, networking, security, troubleshooting methodology with emphasis on Stanford's computing environment. Not a programming course. Prerequisite: 1C or equivalent.
Terms: Win, Spr | Units: 2

CS 198: Teaching Computer Science

Students lead a discussion section of 106A while learning how to teach a programming language at the introductory level. Focus is on teaching skills, techniques, and course specifics. Application and interview required; see http://cs198.stanford.edu.
Terms: Aut, Win, Spr | Units: 3-4
Instructors: Bush, M. (PI) ; Ruth, E. (PI) ; Sahami, M. (PI) ; Wang, L. (PI)

CS 199: Independent Work

Special study under faculty direction, usually leading to a written report. Letter grade; if not appropriate, enroll in 199P.
Terms: Aut, Win, Spr, Sum | Units: 1-6 | Repeatable for credit
Instructors: Aiken, A. (PI) ; Altman, R. (PI) ; Baker, M. (PI) ; Batzoglou, S. (PI) ; Bejerano, G. (PI) ; Blikstein, P. (PI) ; Boneh, D. (PI) ; Brafman, R. (PI) ; Cain, J. (PI) ; Cao, P. (PI) ; Cheriton, D. (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) ; Guibas, L. (PI) ; Hanrahan, P. (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) ; 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) ; 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) ; Winograd, T. (PI) ; Young, P. (PI) ; Zelenski, J. (PI)

CS 199P: Independent Work

(Staff)
Terms: Aut, Win, Spr, Sum | Units: 1-6 | Repeatable for credit
Instructors: Aiken, A. (PI) ; Altman, R. (PI) ; Baker, M. (PI) ; Batzoglou, S. (PI) ; Bejerano, G. (PI) ; Boneh, D. (PI) ; Brafman, R. (PI) ; Cain, J. (PI) ; Cao, P. (PI) ; Cheriton, D. (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) ; Guibas, L. (PI) ; Hanrahan, P. (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) ; 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) ; 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) ; Winograd, T. (PI) ; Young, P. (PI) ; Zelenski, J. (PI)

CS 202: Law for Computer Science Professionals

Intellectual property law as it relates to computer science including copyright registration, patents, and trade secrets; contract issues such as non-disclosure/non-compete agreements, license agreements, and works-made-for-hire; dispute resolution; and principles of business formation and ownership. Emphasis is on topics of current interest such as open source and the free software movement, peer-to-peer sharing, encryption, data mining, and spam.
Terms: Win | Units: 1
Instructors: Hansen, D. (PI)

CS 205A: Mathematical Methods for Robotics, Vision, and Graphics

Continuous mathematics background necessary for research in robotics, vision, and graphics. Possible topics: linear algebra; the conjugate gradient method; ordinary and partial differential equations; vector and tensor calculus. Prerequisites: 106B or X; MATH 51 and 113; or equivalents.
Terms: Aut | Units: 3
Instructors: Fedkiw, R. (PI)

CS 207: The Economics of Software

How software products are moved into the marketplace and how the resulting intellectual property is exploited. Concepts that are outside of the common knowledge of computer scientists such as business terms and spreadsheet computations to quantitatively compare alternatives. Goal is to contribute to informed decision making in high-tech product design, acquisition, production, mar-keting, selection of business structures, outsourcing, and impact of taxation policies. No specific background required.
Terms: Aut | Units: 1
Instructors: Wiederhold, G. (PI)

CS 210A: Software Project Experience with Corporate Partners

Two quarter project course. Focus is on real world software development. Corporate partners provide loosely defined challenges from their R&D labs for which they are seeking innovative solutions and ideas. Student teams function as small startup companies with a technical advisory board comprised of the instructional staff. Exposure to: current practices in software engineering; exploration of the design space; significant development experience with creative freedoms; working in groups; real world software engineering challenges; public presentation of technical work; creating written descriptions of technical work. Prerequisite: CS 108 or CS110.
Terms: Win | Units: 3-4
Instructors: Borenstein, 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