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

1 - 5 of 5 results for: CS106B

CME 253: Introduction to GPU Computing and CUDA

Covers the fundamentals of accelerating applications with GPUs (Graphics Processing Units); GPU programming with CUDA and OpenACC, debugging, thrust/CUB, profiling, optimization, debugging, and other CUDA tools. Libraries to easily accelerate compute code will be presented and deployment on larger systems will be addressed, including multi-GPU environments. Several practical examples will be detailed, including deep learning. Pre-requiste: knowledge of C/C++ at the level of CME211 or CS106b.
Terms: given next year | Units: 1 | Grading: Satisfactory/No Credit

CME 257: Advanced Topics in Scientific Computing with Julia

This short course runs from the 2nd to the 5th week of the quarter. This course will rapidly introduce students to the new Julia language, with the goal of giving students the knowledge and experience necessary to begin contributing to the language and package ecosystem while using Julia for their own scientific computing needs. The course will begin with learning the basics of Julia with an emphasis on its object-oriented features, and then introduce students to Github and package development. Additional topics include: common packages, interfacing with C shared object libraries, and Julia's core linear algebra implementation. Lectures will be interactive, with an emphasis on collaboration and learning by example. Prerequisites: Data structures at the level of CS106B, experience with one or more scientific computing languages (e.g. Python, Matlab, or R), and some familiarity with C/C++ and the Unix shell. No prior experience with Julia or Github is required.
Terms: Aut | Units: 1 | Grading: Satisfactory/No Credit
Instructors: Nelson, B. (PI)

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.
Terms: Aut, Win, Spr, Sum | Units: 3-5 | UG Reqs: GER:DB-EngrAppSci, WAY-FR | Grading: Letter or Credit/No Credit

CS 198B: Additional Topics in Teaching Computer Science

Students build on the teaching skills developed in CS198. Focus is on techniques used to teach topics covered in CS106B. Prerequisite: successful completion of CS198.
Terms: Win, Spr | Units: 1 | Grading: Satisfactory/No Credit

CS 240H: Functional Systems in Haskell

Covers an array of practical issues and techniques that arise when building real-world systems in the Haskell programming language. Topics include the basics of Haskell, laziness, monads, parsers, testing and debugging, performance tuning, interfacing to native code, concurrency and I/O paradigms, language extensions, meta-programming, and applications to the web and security. Concepts will be reinforced through a few individual programming assignments followed by a larger team project. Prior familiarity with Haskell may be helpful but is not required. Prerequisites: CS106B or 106X.
Terms: Win | Units: 3-4 | Grading: Letter or Credit/No Credit
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