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

1 - 10 of 170 results for: CS

CS 1C: Introduction to Computing at Stanford

For those with limited experience with computers or who want to learn more about Stanford's computing environment. Topics include: computer maintenance and security, computing resources, Internet privacy, and copyright law. One-hour lecture/demonstration in dormitory clusters prepared and administered weekly by the Resident Computer Coordinator (RCC). Final project. Not a programming course.
Terms: Aut | Units: 1

CS 2C: Intermediate Computing at Stanford

Continuation of 1C. Sound, image and video editing including understanding and publishing multimedia. Applications include GarageBand, Photoshop, Acrobat, iMovie, Final Cut Pro, and iDVD. One-hour lecture/workshop in dormitory clusters prepared and administered weekly by the Resident Computer Coordinator (RCC). Advanced section also available. Final project. Not a programming course.
Instructors: Chan, K. (PI)

CS 21N: Can Machines Know? Can Machines Feel?

Preference to freshmen. Can mental attitudes attributed to people and sometimes to animals, including knowledge, belief, desire, and intention, also be ascribed to machines? Can light sensors have a belief? Can a pool cleaning robot or tax-preparation software have an intention? If not, why not? If yes, what are the rules of such ascription, and do they vary between human beings and machines? Sources include philosophy, neuroscience, computer science, and artificial intelligence. Topics: logic, probability theory, and elements of computation. Students present a paper.
Terms: Aut | Units: 3 | UG Reqs: GER:DB-EngrAppSci
Instructors: Shoham, Y. (PI)

CS 45N: Computers and Photography: From Capture to Sharing

Preference to freshmen with exerience in photography and use of computers. How a photographer creates photos, makes them available for computer viewing, reliably stores them, organizes them, tags them, searches them, and distributes them online. Access to a digital SLR camera and to PhotoShop Elements or equivalent software is required; no programming experience required.
Terms: Aut | Units: 3-4 | UG Reqs: WAY-CE

CS 48N: The Science of Art

Preference to freshmen. The interwoven histories of science and Western art from the Renaissance to the 19th century. Emphasis is on the revolutions in science and mathematics that inspired parallel revolutions in the visual arts such as Brunelleschi's invention of linear perspective, Newton's discoveries in geometric optics, and the theories of color vision proposed by Goethe, Young, and Helmholtz. The scientific principles behind image making including digital image synthesis and computer graphics. No programming experience required.
Terms: Win | Units: 3 | UG Reqs: GER:DB-EngrAppSci
Instructors: Levoy, M. (PI)

CS 51N: Visionaries in Computer Science

Preference to freshmen. How visionaries anticipated the future; how could they see what their contemporaries did not? How can others strive for comparable achievements? The insights of Alan Turing, Vannevar Bush, Richard Licklider, Ted Nelson, Morton Heilig, Ivan Sutherland, Douglas Engelbart, Alan Kay, Frederick Brooks, and others.
Terms: Spr | Units: 3 | UG Reqs: GER:DB-EngrAppSci

CS 73N: Business on the Information Highways

Preference to freshmen. The capabilities of the Internet and its services. Writing for the web. The effect on commerce, education, government, and health care. Technical and business alternatives. Who is hurt and who benefits from the changes? Participants develop web publications.
Terms: Spr | Units: 3 | UG Reqs: GER:DB-EngrAppSci, Writing 2

CS 74N: Digital Dilemmas

Preference to freshmen. Issues where policy decision making requires understanding computer and communications technology. Technology basics taught in non-technology terms. Topics include consumer privacy, government surveillance, file sharing and intellectual property. Focus is on technology in elections including topics such as voter registration databases, and electronic and Internet voting.
Terms: Aut | Units: 3 | UG Reqs: GER:DB-EngrAppSci
Instructors: Dill, D. (PI)

CS 103: Mathematical Foundations of Computing

Mathematical foundations required for computer science, including propositional predicate logic, induction, sets, functions, and relations. Formal language theory, including regular expressions, grammars, finite automata, Turing machines, and NP-completeness. Mathematical rigor, proof techniques, and applications. May not be taken by students who have completed 103A,B or 103X. Prerequisite: 106A or equivalent.
Terms: Win | Units: 3-5 | UG Reqs: GER:DB-Math, WAY-FR
Instructors: Plummer, R. (PI)

CS 103A: Discrete Mathematics for Computer Science

Final offering of this course. Mathematical foundations required for computer science. Topics: propositional and predicate logic, proof techniques, induction, recursion, combinatorics, and functions. Corequisite: 106A or X.
Terms: Aut | Units: 3 | UG Reqs: GER:DB-Math
Instructors: Plummer, R. (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