CS 330 Lecture 34 – Fold, Tail Recursion, and Lambdas
Agenda what ?s think about this all, any, sum, product, size, join tail recursion fold/reduce/inject lambdas in Java lambdas in Ruby lambdas in C++ Think About This Code april23.hs Haiku
CS 245 Lab 11 – Threads
First, if you have checkpoints left over from last lab, get them inspected during the first 15 minutes of this lab. No credit will be awarded past these 15 minutes. Don’t forget to work in pairs! Where possible, please work with someone that you did not work with last week. The exchange of new ideas […]
CS 245 Lecture 23 – Tree Edits and Traversals
Agenda what ?s the uses of trees think about this adding elements removing elements traversing TODO Start preassignment 3. Due before May 9. Think About This What is printed by the following code? What’s printed if we replace Stack with Queue, push with enqueue, and pop with dequeue? Code BinarySearchTree.java BSTBFF.java Haiku
CS 245 Preassignment 3 – due before May 9
See the PDF.
CS 330 Lecture 33 – Map, Fold, Filter, Lambdas
Agenda what ?s program this three patterns for-each combine filter anonymous functions TODO Read chapter 6 in Learn You a Haskell (http://learnyouahaskell.com/higher-order-functions). 1/4 sheet. Program This Code april21.hs Haiku
CS 330 Lecture 32 – Type Inference, Functions, and Lists
Agenda what ?s type interference in other languages type signatures curried functions infinite lists list processing case statements pattern matching map lambda Think About This Code april18.hs Haiku
CS 245 Lecture 22 – Stacks and Binary Search Tree
Agenda what ?s the purpose of stacks and queues a postfix expression calculator binary search tree TODO Watch a random YouTube video on stacks and queues. Read about Java’s Stack badness. Read about using stacks and queues for time management. 1/4 sheet. Design This Program This Code BinarySearchTree.java Haiku
CS 245 Lab 10 – Maze Traversal
First, if you have checkpoints left over from last lab, get them inspected during the first 15 minutes of this lab. No credit will be awarded past these 15 minutes. Work in pairs, where possible. Prefer working with someone that you did not work with last lab. The exchange of new ideas and perspectives is […]
CS 330 Lecture 31 – On to Haskell
Agenda what ?s concerns about languages: speed of execution ease of development program correctness think about this the functional paradigm Haskell lists and strings ranges head, cons, tail initials sum add1/abs/threshold for-each pattern, map higher order functions TODO Read chapters 1 and 2 of Learn You a Haskell. 1/4 sheet. Think About This Code april16.hs Haiku
CS 245 Lecture 21 – Linked List, Stack, and Queue
Agenda what ?s why are we here? finishing up linked list and Snake stacks and queues a postfix calculator an HTML validator Program This Program This Code HashSet.java LinkedList.java SnakesOnAFrame.java Stack.java Valhalla.java Haiku