spcs:summer2014:sim
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Last revision Both sides next revision | ||
|
spcs:summer2014:sim [2014/07/28 12:27] ffpaladin [Assignments] |
spcs:summer2014:sim [2014/08/01 14:37] ffpaladin |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| {{:spcs:winter2014:screen_shot_2013-12-30_at_7.51.47_pm.png|}} | {{:spcs:winter2014:screen_shot_2013-12-30_at_7.51.47_pm.png|}} | ||
| + | |||
| + | (1) - 02 20 02 | ||
| + | (2) - 22 36 30 | ||
| + | ( ) - 06 36 02 | ||
| ====== Computer Simulations and Interactive Media ====== | ====== Computer Simulations and Interactive Media ====== | ||
| Line 74: | Line 78: | ||
| * [[d4|Day 4]] - Guest Speaker, Finite State Machines | * [[d4|Day 4]] - Guest Speaker, Finite State Machines | ||
| Week 2 | Week 2 | ||
| - | * [[d5|Day 5]] - Turing Test, Dartmouth Conference, AI, Loebner, Cleverbot, Eliza Effect, Imitation Game, Selection, Insertion, Bubble, Binary Search, Binary Search Tree, Processing.js, Big-O, Animations | + | * [[d5|Day 5]] - Turing Test, Dartmouth Conference, AI, Loebner, Cleverbot, Eliza Effect, Imitation Game, Selection, Insertion, Bubble, Binary Search, Binary Search Tree, Processing.js, Big-O, Animations, Divide and Conquer |
| * [[d6|Day 6]] - Prototypes, Traveling Sales Person, Adjacency Matrix, Dijkstra's Algorithm, Depth First Search, Breadth First Search, Greedy Algorithm, Brute Force Algorithm, NP Complete, Polynomial Time, Non-Polynomial Time, Directed/Undirected Graph, Weighted/Unweighted Graph | * [[d6|Day 6]] - Prototypes, Traveling Sales Person, Adjacency Matrix, Dijkstra's Algorithm, Depth First Search, Breadth First Search, Greedy Algorithm, Brute Force Algorithm, NP Complete, Polynomial Time, Non-Polynomial Time, Directed/Undirected Graph, Weighted/Unweighted Graph | ||
| * [[d7|Day 7]] - Field Trip | * [[d7|Day 7]] - Field Trip | ||
| * [[d8|Day 8]] - OOP, Abstraction, Polymorphism, Inheritance, Encapsulation, Greedy Best-First Search, A*, Flood Filling, Internships, Methods, Classes, Objects, Heuristics, Tree Search, Prototypes | * [[d8|Day 8]] - OOP, Abstraction, Polymorphism, Inheritance, Encapsulation, Greedy Best-First Search, A*, Flood Filling, Internships, Methods, Classes, Objects, Heuristics, Tree Search, Prototypes | ||
| - | * [[d9|Day 9]] - Circuits, kD Trees, Arduino, Guest Speaker | + | * [[d9|Day 9]] - Circuits, kD Trees, Arduino, Ohm's Law, Logic Gates, Guest Speaker |
| Week 3 | Week 3 | ||
| * [[d10|Day 10]] - Game Design, Game Theory, Game Studies, Game Trees, Alternate Reality Game, Hash Tables, Hash Functions, Ludus Paida Narrative, Ludology Narratology Debate, Game AI, Decision Trees, Concept Net, Implication, Demorgans Law, Double Implication (iff) | * [[d10|Day 10]] - Game Design, Game Theory, Game Studies, Game Trees, Alternate Reality Game, Hash Tables, Hash Functions, Ludus Paida Narrative, Ludology Narratology Debate, Game AI, Decision Trees, Concept Net, Implication, Demorgans Law, Double Implication (iff) | ||
| - | * [[d11|Day 11]] - Cellular Automata | + | * [[d11|Day 11]] - Cellular Automata, Networks, Servers, Information Conformity, Probabilities, Asch Experiment, Game Developers, Game Developers Conference |
| * [[d12|Day 12]] - Field Trip | * [[d12|Day 12]] - Field Trip | ||
| * [[d13|Day 13]] - Guest Speaker | * [[d13|Day 13]] - Guest Speaker | ||
| Line 92: | Line 96: | ||
| * [[Final Projects]] | * [[Final Projects]] | ||
| * [[fg|Final Groups]] | * [[fg|Final Groups]] | ||
| + | * [[https://plus.google.com/photos/110478996885609825075/albums/6042478131581869361?authkey=CPPxhryGutvEcQ|PHOTOS!]] | ||
| ---- | ---- | ||
| - | |||
| ====== Research Journals ====== | ====== Research Journals ====== | ||
/soe/sherol/.html/teaching/data/pages/spcs/summer2014/sim.txt · Last modified: 2014/08/01 15:39 by ffpaladin
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 3.0 Unported
