teaching machines

CS 330 Lecture 25 – List Comprehensions and Map

Agenda what ?s program this list comprehensions translating between list comprehensions and imperative loops map Note We start with a Program This to gel our understanding of Haskell function structure: Write function indexOf, which accepts a needle and haystack, and returns where the needle lives in the haystack. If the needle can’t be found, it […]

CS 491 Lecture 17 – Game Jam

TODO Finish up the character animations from last lab if you haven’t already. The next lab assumes that you have them working. Lab Today we will change things up a bit. We will have a game jam. For the next 75 minutes, we will hastily put together a game that satisfies some theme. Jams like this […]

CS 330 Lecture 24 – Pattern Matching and List Comprehensions

Agenda what ?s functions capitalize (with guards, case, and pattern matching) tail’ nbelows contains indexOf list comprehensions how to translate TODO Bleakr’s due before April 6. Note Last time we mentioned that a primary theme of a functional language is that functions are a big deal. They can be stored in variables, they are a […]

Pacman

My version of 3D Pacman.

Honors 104.502 Lecture 15 – Collecting Coins and Effectors

Agenda what ?s Note Code b4a938c

CS 330 Lecture 23 – Functions in Haskell

Agenda what ?s what we mean by functional functions are first-class immutability expressions everywhere functions in Haskell coping with looplessness guards to case statements to pattern matching TODO Watch Erik Meijer discuss list comprehensions in both Haskell and Microsoft’s LINQ in the video below. On a 1/4 sheet, generate 3 interesting lists using Haskell’s list […]

CS 491 Lecture 16 – Animation States

TODO Watch these videos from the Unity documentation: The Animation View Animation Curves and Events The Animator Component The Animator Controller Animator Scripting On a 1/4 sheet, write down 2-3 questions or observations about the content of the videos or animation in general. Lab Today we start a little game called Roundup, where a round character […]

CS 330 Lecture 22 – Haskell

Agenda what ?s exam post mortem hello, Haskell what we mean by functional Haskell examples TODO Read chapters 3 and 4 of Learn You a Haskell for Great Good! On a 1/4 sheet, answer these questions: What’s the type signature of the max function as reported by :t? What does the signature mean? When defining a function with […]

CS 491 Lecture 14 – Animation

TODO Participate in Pixar in a Box on Khan Academy. Walk through at least the Animation section, but it’s all pretty interesting. On a 1/4 sheet, describe a theme that you might like to pursue in your final project, which will involve animated objects and animated characters. What’s object animation would you like to create? Character animation? […]

CS 330 Lecture 21 – Weak Typing in C

Agenda what ?s weak typing examples array allocation big endian is negative check for floats unions “polymorphism” in C TODO Read chapters 1 and 2 of Learn You a Haskell for a Great Good! (Use the free online version.) On a 1/4 sheet, answer these questions: What are two ways we can express the integer division of 9 […]

1 10 11 12 13 14 26