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

11 - 20 of 217 results for: CS

print preview printer friendly page

CS 55N: Computer and Information Security

Preference to freshmen. Why computer systems are vulnerable to attack. Common software bugs, how to exploit technology for blocking common attacks, cryptography, and legal issues.
Terms: Aut | Units: 3 | UG Reqs: GER:DB-EngrAppSci
Instructors: Boneh, D. (PI)

CS 76N: Elections and Technology

Freshmen Seminar. Since the disastrous Presidential election in Florida in 2000, problems with and worries about technology in elections have gained increasing attention. Are electronic voting machines secure? Are paper ballots secure? Why can't we just vote over our cell phones or the internet? Should voters have to show identification? How do legislators decide these things? How can technologists be heard? We'll look into these questions as we watch others struggle with them in the 2012 Presidential election.
Terms: Aut | Units: 3
Instructors: Dill, D. (PI)

CS 81N: Hackers and Heroes

This course is about dreamers, role models, and the spirit of adventure. Hackers are said to be the soul of computing: playful programmers who think progress is best made by trial and error, guided by the "hacker ethic." Another view has hackers as nettlesome troublemakers -- "computer bums" at best, or maybe just plain criminals. In this class, you'll decide, by interviewing real hackers about their exploits and learning how to do your own hacks. We'll study major moments in the fifty-year history of hacking and read from texts including Steven Levy's "Hackers," John Markoff's "What the Dormouse Said," Andy Hertzfeld's "Revolution in The Valley," and Peter Seibel's "Coders at Work."
Terms: Spr | Units: 3
Instructors: Winstein, K. (PI)

CS 91SI: Digital Canvas: Intro to Visual Design on the Web

Introduction to visual design concepts with a focus on modern interfaces like web, mobile and app. Topics include visual design elements and principles such as color theory, layout and composition, typography, and aspects of communication. Students will analyze existing designs, and use various technical tools to implement their own designs. This course consists of a series of in-class activities, design projects, peer critique sessions, and guest speakers. Recommended prerequisites: some web programming experience. Application required.
Terms: Aut, Spr | Units: 2
Instructors: Bernstein, M. (PI)

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
Instructors: Parlante, N. (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: 106A or equivalent.
Terms: Aut, Win, Spr | Units: 3-5 | UG Reqs: GER:DB-Math, WAY-FR
Instructors: Dill, D. (PI) ; Schwarz, K. (PI)

CS 105: Introduction to Computers

For non-technical majors. What computers are and how they work. Practical experience in programming. Construction of computer programs and basic design techniques. A survey of Internet technology and the basics of computer hardware. Students in technical fields and students looking to acquire programming skills should take 106A or 106X. Students with prior computer science experience at the level of 106 or above require consent of instructor. Prerequisite: minimal math skills.
Terms: Aut, Win | Units: 3-5 | UG Reqs: GER:DB-EngrAppSci, WAY-FR
Instructors: Cooper, S. (PI) ; Young, P. (PI)

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. Uses the Java programming language. Emphasis is on good programming style and the built-in facilities of the Java language. No prior programming experience required. Summer quarter enrollment is limited. Priority given to Stanford students.
Terms: Aut, Win, Spr, Sum | Units: 3-5 | UG Reqs: WAY-FR, GER:DB-EngrAppSci

CS 106B: Programming Abstractions (ENGR 70B)

Abstraction and its relation to programming. Software engineering principles of data abstraction and modularity. Object-oriented programming, fundamental data structures (such as stacks, queues, sets) and data-directed design. Recursion and recursive data structures (linked lists, trees, graphs). Introduction to time and space complexity analysis. Uses the programming language C++ covering its basic facilities. Prerequisite: 106A or equivalent. Summer quarter enrollment is limited. Priority given to Stanford students.
Terms: Aut, Win, Spr, Sum | Units: 3-5 | UG Reqs: GER:DB-EngrAppSci, WAY-FR
Instructors: Roberts, E. (PI) ; Stepp, M. (PI) ; Watson, R. (PI)

CS 106L: Standard C++ Programming Laboratory

Supplemental lab to 106B and 106X. Additional features of standard C++ programming practice. Possible topics include advanced C++ language features, standard libraries, STL containers and algorithms, object memory management, operator overloading, and inheritance. Prerequisite: consent of instructor. Corequisite: 106B or 106X.
Terms: Aut, Spr | Units: 1
Instructors: Cibils Bernardes, C. (PI) ; Lee, C. (PI) ; Miller, K. (PI) ; Stepp, M. (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