From: Neil Smith Date: Wed, 8 Mar 2017 19:59:34 +0000 (-0800) Subject: Added description of M269 skills X-Git-Url: https://git.njae.me.uk/?a=commitdiff_plain;h=25d47f05fdce2bb59f9ed7e338d4fd3c57987d70;p=ou-summer-of-code-2017.git Added description of M269 skills --- diff --git a/m269-skills.ipynb b/m269-skills.ipynb new file mode 100644 index 0000000..025c9b4 --- /dev/null +++ b/m269-skills.ipynb @@ -0,0 +1,79 @@ +{ + "cells": [ + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "# Things M269 students know" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "## Things they can do\n", + "* Lists, list operations, sublist slices\n", + "* Sets\n", + "* Dictionaries\n", + "* Integer, real, modular arithmetic.\n", + "* Simple hashes\n", + "* Graph search: DFS, BFS, best first search, Dijkstra's algorithm" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "## Things they have libraries to do\n", + "* Stack\n", + "* Trees: properties, traversals\n", + "* Priority queue\n", + "* Sorts\n", + "* Linear & KMP search\n", + "* Generating minimal spanning trees,\n", + "* Topological sorts\n", + "* Knapsack problem" + ] + }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "## Things they have seen\n", + "* Edit distance and dynamic programming\n", + "* Minimax search\n", + "* Genetic algorithms" + ] + }, + { + "cell_type": "code", + "execution_count": null, + "metadata": { + "collapsed": true + }, + "outputs": [], + "source": [] + } + ], + "metadata": { + "kernelspec": { + "display_name": "Python 3", + "language": "python", + "name": "python3" + }, + "language_info": { + "codemirror_mode": { + "name": "ipython", + "version": 3 + }, + "file_extension": ".py", + "mimetype": "text/x-python", + "name": "python", + "nbconvert_exporter": "python", + "pygments_lexer": "ipython3", + "version": "3.5.2" + } + }, + "nbformat": 4, + "nbformat_minor": 1 +}