There are assignments in a variety of langauges that are preconfigured to work with OK. They come bundled with OK tests. To enable submission, changing a few characters is all you need.
You are free to use these resources for a noncommercial purpose. If you teach at an accredited higher ed school or K12 instutition - you may use these assignments in your course.
{ "name": "Project 1: Hog", "endpoint": "cal/cs61a/sp17/hog", ... }
Each assignment contains a file ending with `.ok` - the only thing that you need to change to enable submission the "endpoint" inside of the file. You can change it to your assignment endpoint on the OK Server and that's all it'll take to enable submission. For more details, view the ok server demo video.
## Using Standalone
To use these assignments as a standalone assignment, you do _not_ need to change the endpoint.
# CS1 Assignments
## CS61A
CS61A at UC Berkeley is the introductory course for CS majors. It has been recognized as one the five best computer science in the US.
It focuses on abstraction, recursion, and problem solving. The assignments are rigorous and use a variety of languages.
| Category | Course | Langauge | Name | Days | Description | Link |
|----------|----------------------|----------|------------------------------|---------|-------------------------------------------------------------------------|-----------------------------------------------------------------|
| Project | [CS 61A](http://cs61a.org) | Python | Hog (Dice based game) | 10 days | Dice based game using higher order functions and functional programming | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/proj/hog/ ) |
| Project | [CS 61A](http://cs61a.org) | Python | Hog Contest (Game Strategy) | 10 days | Optional Game Strategy Contest | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/proj/hog_contest/) |
| Project | [CS 61A](http://cs61a.org) | Python | Yelp Maps (Machine Learning) | 10 days | Use a Yelp Dataset to recommend restaurants with lists and dictionaries | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/proj/maps/ ) |
| Project | [CS 61A](http://cs61a.org) | Python | Ants vs. Some Bees (Game) | 11 days | Use OOP to build a Plants vs Zombies Game with great graphics | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/proj/ants/ ) |
| Project | [CS 61A](http://cs61a.org) | Python | Scheme Interpreter | 17 days | Build a Scheme Interpreter using recursion | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/proj/scheme/ ) |
| Project | [CS 61A](http://cs61a.org) | Scheme | Scheme Art Contest | 10 days | Use Scheme turtles to build art! | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/proj/scheme_contest/) |
| Homework | [CS 61A](http://cs61a.org) | Python | HW 1 | 6 days | Conditionals | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/hw/hw01/ ) |
| Homework | [CS 61A](http://cs61a.org) | Python | HW 2 | 6 days | Functions | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/hw/hw02/ ) |
| Homework | [CS 61A](http://cs61a.org) | Python | HW 3 | 6 days | Higher Order Functions | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/hw/hw03/ ) |
| Homework | [CS 61A](http://cs61a.org) | Python | HW 4 | 6 days | Recursion | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/hw/hw04/ ) |
| Homework | [CS 61A](http://cs61a.org) | Python | HW 5 | 6 days | Data Abstraction + Recursion | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/hw/hw05/ ) |
| Homework | [CS 61A](http://cs61a.org) | Python | HW 6 | 6 days | Abstract Data Types | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/hw/hw06/ ) |
| Homework | [CS 61A](http://cs61a.org) | Python | HW 7 | 6 days | Object Oriented Programming | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/hw/hw07/ ) |
| Homework | [CS 61A](http://cs61a.org) | Scheme | HW 9 | 7 days | Scheme Lists & Recursion | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/hw/hw09/ ) |
| Homework | [CS 61A](http://cs61a.org) | Scheme | HW 10 | 6 days | More Scheme | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/hw/hw10/ ) |
| Homework | [CS 61A](http://cs61a.org) | Python | HW 11 | 6 days | Trees + OOP | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/hw/hw11/ ) |
| Homework | [CS 61A](http://cs61a.org) | Python | HW 12 | 6 days | Streams & Infinite | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/hw/hw12/ ) |
| Homework | [CS 61A](http://cs61a.org) | SQL | HW 13 | 7 days | Recursive SQL | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/hw/hw13/ ) |
| Lab | [CS 61A](http://cs61a.org) | Python | Lab 00 | 5 days | Introduction and Workflow | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/lab/lab00/ ) |
| Lab | [CS 61A](http://cs61a.org) | Python | Lab 01 | 2 days | Expressions and Control Structures | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/lab/lab01/ ) |
| Lab | [CS 61A](http://cs61a.org) | Python | Lab 02 | 2 days | Lambdas and Higher-Order Functions | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/lab/lab02/ ) |
| Lab | [CS 61A](http://cs61a.org) | Python | Lab 03 | 4 days | Recursion and Midterm Review | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/lab/lab03/ ) |
| Lab | [CS 61A](http://cs61a.org) | Python | Lab 04 | 2 days | Lists and Data Abstraction | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/lab/lab04/ ) |
| Lab | [CS 61A](http://cs61a.org) | Python | Lab 05 | 2 days | Mutable Sequences and Trees | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/lab/lab05/ ) |
| Lab | [CS 61A](http://cs61a.org) | Python | Lab 06 | 2 days | Object-Oriented Programming | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/lab/lab06/ ) |
| Lab | [CS 61A](http://cs61a.org) | Python | Lab 07 | 2 days | Recursive Objects | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/lab/lab07/ ) |
| Lab | [CS 61A](http://cs61a.org) | Python | Lab 08 | 4 days | Midterm Review | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/lab/lab08/ ) |
| Lab | [CS 61A](http://cs61a.org) | Scheme | Lab 09 | 2 days | Scheme | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/lab/lab09/ ) |
| Lab | [CS 61A](http://cs61a.org) | Python | Lab 10 | 2 days | Interpreters | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/lab/lab10/ ) |
| Lab | [CS 61A](http://cs61a.org) | Python | Lab 11 | 2 days | Iterators and Generators | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/lab/lab11/ ) |
| Lab | [CS 61A](http://cs61a.org) | SQL | Lab 12 | 2 days | SQL | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/lab/lab12/ ) |
| Lab | [CS 61A](http://cs61a.org) | SQL | Lab 13 | 2 days | SeQueL (optional lab) | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/lab/lab13/ ) |
| Lab | [CS 61A](http://cs61a.org) | Spark | Lab 14 | 2 days | Spark | [View >](https://inst.eecs.berkeley.edu/~cs61a/fa16/lab/lab14/ ) |
# Data Science Assignments
## Data 8
The Foundations of Data Science. Inferential thinking, computational thinking, and real-world relevance.
More details are available on the official course site [data8.org](http://data8.org)
[Data 8 Course Materials >](https://github.com/data-8/data8assets/tree/gh-pages/materials/sp17)
## Data 100
Principles and Techniques of Data Science
Materials [Data100 Materials](https://github.com/DS-100/sp17-materials)