teaching machines

CS 330 Lecture 20 – Recursion, Cases, and Pattern Matching

Dear students, Today we solve more problems in Haskell together. Along the way we will discover some of the peculiarities of functional programming, like the lack of iteration, the supremacy of recursion, and the beauty of pattern matching: Here is an exercise that I ask you to complete with a neighbor: Collatz The first number […]

CS 330 Homework – Nogramming – due before May 15

See the PDF.

CS 318 Lab 14 – Web Jam

Dear students, Let’s shake things up a bit today. When game developers get together to build a game in a very short amount of time, they call that a game jam. We will have a web jam. I want to devote all of today’s lab time to that, so I won’t be doing any talking. […]

CS 330 Lecture 19 – Functions and Lists

Dear students, Today we solve more problems in Haskell together. Along the way we will discover some of the peculiarities of functional programming, like the supremacy of linked lists. First, an exercise to complete with a neighbor: Parallelogram Write a function pcomplete that completes a parallelogram. Suppose you are given three points in 2D space. […]

CS 330 Lecture 18 – Haskell

Dear students, Today we begin our foray in the Haskell language, which is very different from the Java and C that you have been steeped in. I want to introduce its craziness by just solving some problems. We’ll see what we encounter. Here are the tasks I will ask you to complete with a neighbor: […]

CS 318 Lab 13 – Responsive Design

Dear students, Today we begin our investigation into responsive design, of which designer Ethan Marcotte had this to say: Recently, an emergent discipline called “responsive architecture” has begun asking how physical spaces can respond to the presence of people passing through them. Through a combination of embedded robotics and tensile materials, architects are experimenting with […]

SIGCSE 2017: Towards Computational Making with Madeup

I’m presenting Madeup at SIGCSE 2017 in Seattle, and I offer below the manuscript of my talk. Introduction Madeup is a tool I began building in 2013 in order to study and teach the algorithms of everyday objects. It’s a language for making things up—things that live in 3D space, things that I could print […]

Clockwork

My dream some day is to teach CS 491: Bad GUIs. We would learn the principles of good interface design by examining (and implementing!) terrible user interfaces. The first assignment would be to design an unreadable clock widget. Perhaps like this one: If it’s not terrible enough, reload the page. I saw a clock like […]

CS 318 Lab 12 – Mockups

Dear students, The next milestone of your project is to create mockups of your pages. The intent behind a mockup is to create a visual sketch of your page that can help you create a feel for the overall layout. Its audience is both you, your collaborators, and your client. There’s a great temptation to […]

CS 330 Lecture 17 – Heap of Trouble

Dear students, Let’s start with a What Does This Do! Absorb this code into your brain, and predict its output. After a minute of silent reflection, we’ll discuss. void mkfoo(char *s) { s = malloc(sizeof(char) * 4); strcpy(s, "foo"); } int main(int argc, char **argv) { char *text = "slar"; mkfoo(text); printf("%s", text); return 0; […]

1 79 80 81 82 83 204