2013-2014 2014-2015 2015-2016 2016-2017 2017-2018
Browse
by subject...
    Schedule
view...
 

1 - 10 of 79 results for: CS

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: Aut, Win, Spr | Units: 1 | Grading: Satisfactory/No Credit

CS 49N: Using Bits to Control Atoms

This is a crash course in how to use a stripped-down computer system aboutnthe size of a credit card (the rasberry pi computer) to control as manyndifferent sensors as we can implement in ten weeks, including LEDs, motionnsensors, light controllers, and accelerometers. The ability to fearlesslyngrab a set of hardware devices, examine the data sheet to see how to usenit, and stitch them together using simple code is a secret weapon thatnsoftware-only people lack, and allows you to build many interestingngadgets. We will start with a ``bare metal'' system --- no operatingnsystem, no support --- and teach you how to read device data sheetsndescribing sensors and write the minimal code needed to control themn(including how to debug when things go wrong, as they always do). Thisncourse differs from most in that it is deliberately mostly about what andnwhy rather than how --- our hope is that the things you are able at the endnwill inspire you to follow the rest of the CS curriculum to understandnbetter how things you've used work. Prerequisites: knowledge of the Cnprogramming language. A Linux or Mac laptop that you are comfortablencoding on.
Terms: Spr | Units: 3 | Grading: Letter or Credit/No Credit
Instructors: Engler, D. (PI)

CS 50: Using Tech for Good

Students in the class will work in small teams to implement high-impact projects for partner organizations. Taught by the CS+Social Good team, the aim of the class is to empower you to leverage technology for social good by inspiring action, facilitating collaboration, and forging pathways towards global change. Recommended: CS 106B, CS 42 or 142. Class is open to students of all years.May be repeat for credit
Terms: Aut, Spr | Units: 2 | Repeatable for credit | Grading: Satisfactory/No Credit

CS 52: CS + Social Good: Implementing Sustainable Social Impact Projects

Continuation of CS51 (Building Social Impact Projects for Change). Teams enter the quarter having completed and tested a minimal viable product (MVP) with a well-defined target user, and a community partner. Students will learn to apply scalable technical frameworks, methods to measure social impact, tools for deployment, user acquisition techniques and growth/exit strategies. The purpose of the class is to facilitate students to build a sustainable infrastructure around their product idea. CS52 will host mentors, guest speakers and industry experts for various workshops and coaching-sessions. The class culminates in a showcase where students share their projects with stakeholders and the public. Prerequisite: CS 51, or consent of instructor.
Terms: Spr | Units: 2 | Grading: Letter or Credit/No Credit
Instructors: Cain, J. (PI)

CS 62N: Let There Be Computations

The class will discuss the Theory of Computing as an ambitious intellectual endeavor with impact beyond Computer Science. What are computations? How can their study capture important aspects of the evolution of species, the structure of social networks, and the working of your smart phone? What are the laws of efficiency and complexity that govern computations? We will see surprising algorithms for very familiar problems as well as simple problems no one knows how to solve efficiently. We will encounter logic paradoxes that expose the limitations of computations and explore the different worlds we may be living in, depending on the answers to some of the central problems on computations.n nThe class is intended for students with a wide range of interests. The course will not involve programming. While our class will not rely on any deep mathematics (beyond basic high-school math) we will deal with mathematical formalization of concepts and with mathematical problem-solving. Therefore, some mathematical maturity and interest would be useful.
Terms: Spr | Units: 3 | Grading: Letter or Credit/No Credit

CS 101: Introduction to Computing Principles

Introduces the essential ideas of computing: data representation, algorithms, programming "code", computer hardware, networking, security, and social issues. Students learn how computers work and what they can do through hands-on exercises. In particular, students will see the capabilities and weaknesses of computer systems so they are not mysterious or intimidating. Course features many small programming exercises, although no prior programming experience is assumed or required. CS101 is not a complete programming course such as CS106A. CS101 is effectively an alternative to CS105. A laptop computer is recommended for the in-class exercises.
Terms: Spr | Units: 3-5 | UG Reqs: GER:DB-EngrAppSci | Grading: Letter or Credit/No Credit
Instructors: Taylor, A. (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. Prerequisite: CS106B or equivalent. CS106B may be taken concurrently with CS103.
Terms: Aut, Win, Spr | Units: 3-5 | UG Reqs: GER:DB-Math, WAY-FR | Grading: Letter or Credit/No Credit

CS 103A: Mathematical Problem-solving Strategies

Problem solving strategies and techniques in discrete mathematics and computer science. Additional problem solving practice for CS103. In-class participation required. Prerequisite: consent of instructor. Co-requisite: CS103.
Terms: Aut, Win, Spr | Units: 1 | Grading: Satisfactory/No Credit

CS 106A: Programming Methodology (ENGR 70A)

Introduction to the engineering of computer applications emphasizing modern software engineering principles: object-oriented design, decomposition, encapsulation, abstraction, and testing. Emphasis is on good programming style and the built-in facilities of respective languages. No prior programming experience required. Summer quarter enrollment is limited.nnAlternative versions of CS106A are available which cover most of the same material but in different programming languages:nnJava (Fall, Win, Spr, or Sum qtr enroll in CS106A section 1) nJavascript (Fall qtr enroll in CS 106A Section 2)nPython (Winter or Spring qtr enroll in CS 106A Section 3)
Terms: Aut, Win, Spr, Sum | Units: 3-5 | UG Reqs: GER:DB-EngrAppSci, WAY-FR | Grading: Letter or Credit/No Credit

CS 106AP: Programming Methodology in Python

Introduction to the engineering of computer applications in Python, emphasizing modern software engineering principles: decomposition, abstraction, and testing. Emphasis is on good programming style. This course covers most of the same material as CS106A Section 1 in Java and CS 106A Section 2 in JavaScript, but this course uses the Python programming language which is popular for general engineering and web development. Required readings will all be available for free on the web. Students are encouraged to bring a laptop to lecture to do the live exercises which are integrated with lecture. No prior programming experience required. To enroll in this class, enroll in CS 106A Section 3.nnMay be taken for 3 units by grad students.
Terms: Win, Spr | Units: 3-5 | Grading: Letter or Credit/No Credit
Instructors: Parlante, N. (PI)
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