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

1 - 10 of 225 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 Consultant (RCC). Final project. Not a programming course.
Terms: Aut | Units: 1
Instructors: Smith, S. (PI)

CS 1U: Practical Unix

A practical introduction to using the Unix operating system with a focus on Linux command line skills. Class will consist of video tutorials and weekly hands-on lab sections. The time listed on AXESS is for the first week's logistical meeting only. Topics include: grep and regular expressions, ZSH, Vim and Emacs, basic and advanced GDB features, permissions, working with the file system, revision control, Unix utilities, environment customization, and using Python for shell scripts. Topics may be added, given sufficient interest. Course website: http://cs1u.stanford.edu
Terms: Spr | Units: 1

CS 2C: Multimedia Production

Sound, image and video editing techniques and applications, including understanding file formats and publishing multimedia online. Topics: GarageBand, Photoshop, iMovie, Final Cut Pro, and iDVD. Weekly lecture followed by lab section. Second unit for additional creative production assignments completed out of class time and extensive Final Project. Not a programming course, but will use computer multimedia applications heavily for editing.
Terms: Aut, Win | Units: 1-2

CS 10SC: Great Ideas in Computer Science

Computers have come to permeate many aspects of our lives, from how we communicate with each other to how we produce and consume information. And while it is all too easy to think of computing in terms of the products and applications we see emerging from technology companies, the intellectual foundations of computer science go much deeper. Indeed, beneath the surface of the tools we use, the social networks we engage in, and the web of information we search, lays a field rich with fascinating, intellectually exciting, and sometimes unexpectedly surprising ideas.nnnIn this seminar, we will explore several of the great ideas in computer science, looking at both challenging problems and their impact on real applications. From understanding how search engines on the Web work to looking at mathematical theories underlying social networks, from questioning whether a computer can be intelligent to analyzing the notion of what is even possible to compute, this seminar will take us on a series of intellectual excursions that will change the way you look at computers.nnnNo prior experience with computer science or programming is required, but a high school mathematics background, an interest in problem-solving, and a healthy curiosity will go a long way toward ensuring an enjoyable and enlightening experience. Students will work in small groups to research topics in computer science they find most intriguing. The course will also take advantage of Stanford's location in the heart of Silicon Valley by conducting field trips to local companies and the Computer History Museum.
Terms: Aut | Units: 2

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: Spr | 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. Digital SLRs and editing software will be provided to those students who do not wish to use their own.
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 73N: The Business of the Internet

Preference to freshmen. Issues in Internet history, technology, and public policy are discussed as well as the Internet's impact on commerce, education, government, and health care. Writing for the web. Participants develop a substantial website.
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, and electronic voting.
Terms: Aut | Units: 3 | UG Reqs: GER:DB-EngrAppSci
Instructors: Dill, D. (PI)

CS 96SI: Functional Programming Style in Lisp/Scheme and Haskell

Lambdas, closures, functions as first-class objects, functional idioms, code-as-data. Lazy evaluation, freed-point programming, strong, typing, side-effect free programming. Short programming exercises bi-weekly, final project comparable in difficulty to 106B assignment.
Terms: Spr | Units: 2
Instructors: Cain, 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