CS 491 Lecture 3 – Media and Resource Management
Before This Class A Before next lecture: Watch http://youtu.be/XQOk5Z-c3yQ. Watch http://youtu.be/HhgOh3odhYU. Skim the SoundPool API (http://developer.android.com/reference/android/media/SoundPool.html) for playing sounds simultaneously. Hey, A. Today we’re going to explore getting Android to play sounds and show pictures. Many of the killer mobile apps these days are rich with media, and in order to reach our first million, we’ll have […]
HNRS 304.503 Lecture 2 – Introductions
Agenda lab next week posting on the blog share introductions discuss chapters 1 and 2 Outside Notes http://www.newyorker.com/reporting/2010/12/20/101220fa_fact_paumgarten http://www.youtube.com/watch?v=b9GpQ21uEmQ TODO Read for Wednesday chapters 3 and 4. Haiku
HNRS 304.503 Lecture 1 – Game on
Welcome to Honors 304.503, Digital Game Development. Let’s start with a little game. It’s a two-player dice game with really simple rules. Each player gets a 12-sided die. The game has 100 rounds, or more if you have time. In each round, both players roll. Whoever rolls a 12 — let’s call the game Duodeciduel […]
CS 491 Lecture 2: Activity and View
Before this class Everyone Install the Android SDK. Don’t forget Eclipse and the ADT plugin! Watch your A lesson or B lesson, details of which were sent to your UWEC account. Come to class with two things: a quarter sheet of paper with two questions and two connections/observations and your teaching outline. Bring your laptop […]
CS 491 Lecture 1: AppInventor
Introduction Welcome to CS 491, Mobile Software Development. In this class, we’re going write software for mobile devices, which have changed a bit. We’ll be focusing on Android. Without getting political, let me explain why: iOS development requires Apple hardware. We don’t have any. We don’t have room for any. You must pay $99/year for […]
HNRS 304.503 Lecture 0 – Tentative agenda
Call top-down teaching the kind of teaching where we you start from theory and abstraction and work your way down to application. I’m not going to take a top-down approach in this class. Call bottom-up teaching the kind of teaching where you start with practical realizations and generalize up. This will be my approach to […]
CS 145 Lecture 27 – Final review
Agenda our own String class indexOf replace startsWith concat a 2-D ripple a bus counter Bingo board Code MyString.java package prefinal; public class MyString { private char[] charries; public MyString(char[] src) { charries = src; } /** * Gets the index of first instance of the * specified character. If character cannot * be found, […]
CS 330 Lecture 40 – Shell scripting, or Why I love Linux
Agenda shell scripting programs are methods speed and terseness caters to file manipulation globbing loops I/O redirection some problems resizing a bunch of images comparing two directories change extensions on a bunch of files checking for new mail sending spam finding big files preparing code for blog posts Code shrinken.sh #!/bin/sh mkdir -p dialup_friendlies for […]
CS 145 Lecture 26 – Sound
Agenda digital music WAV format binary file I/O generate static generate pitches generate chords Code WavIO.java import java.io.DataOutputStream; import java.io.FileNotFoundException; import java.io.FileOutputStream; import java.io.IOException; import java.nio.ByteBuffer; import java.nio.ByteOrder; public class WavIO { /** * The sampling frequency. */ public static final int SAMPLE_RATE = 22050; /** * Write the buffer containing audio samples to the […]
CS 330 Lecture 39 – Logic programming
Agenda atoms and variables facts and rules a path in a graph? Prolog’s DFS algorithm even or odd? member? sorted? notmember? hascycle? Code pdb.pl lang(scheme). lang(c). static(c). staticlang(X) :- lang(X), static(X). /* Graph stuff */ edge(a, b). edge(b, e). edge(b, d). edge(c, d). path(X, Y) :- edge(X, Y). path(X, Y) :- edge(X, Z), path(Z, Y). […]