teaching machines

CS 347: Lab 18 – Acrostic

Dear students: Welcome to lab. Now’s your chance to apply the ideas you read about. Find a partner and complete as much of the task below as you can. At the end of our time together, paste your files into Crowdsource in order to receive credit. Task 1 Reverse engineer the following app using React: […]

CS 240: Lecture 29 – Red-black Trees

Dear students: AVL trees are one solution to the problem of balancing binary search trees. They do an excellent job of minimizing the height. Humans have continued to invent other self-balancing trees that occasionally beat out AVL trees. The red-black tree, for instance, tends to have cheaper insertions because it is not as sensitive to […]

CS 240: Lecture 28 – Binary Search Tree Lab

Dear students: Today we will devote our entire time together to a lab on binary search trees. Follow these guidelines: You may work with one other person. If there’s an odd number of people, one group of three is permitted. Upload the required files to Autolab. Run the Autolab tests as often as you’d like. […]

CS 240: Lecture 27 – AVL Trees

Dear students: Last time we introduced a special case of binary trees in which the left descendents are all less than their root and all the right descendents are greater. Such a tree holds the binary search in its bones. The binary search is fast, right? We like that. To get that speed, we need […]

CS 347: Lab 17 – Follownet Client

Dear students: Welcome to lab. Now’s your chance to apply the ideas you read about. Find a partner and complete as much of the task below as you can. Actually, today’s lab is entirely optional. We’ll make it a workday for your project. But here’s an exercise in case you really want one. Task 1 […]

CS 347: Lab 16 – Follownet

Dear students: Welcome to lab. Now’s your chance to apply the ideas you read about. Find a partner and complete as much of the task below as you can. At the end of our time together, paste your files into Crowdsource in order to receive credit. Task 1 Create a database with two tables. The […]

CS 240: Lecture 26 – Binary Search Trees

Dear students: Fall break is over. Just four more weeks to the next one. And then two more weeks of the semester after that. Then finals. Then whew. In the weeks that we have left we’ll be talking about trees, dictionaries, hashing, and graphs. The good news is that these are all useful tools. The […]

CS 240: Lecture 25 – Expression Tree Lab

Dear students: Today we will devote our entire time together to a lab on expression trees. Follow these guidelines: You may work with one other person. If there’s an odd number of people, one group of three is permitted. Complete the lab using a single computer. Take turns at the keyboard. Talk to each other. […]

CS 240: Lecture 24 – Binary Trees

Dear students: We put the sorts behind us. Of course, nothing ever goes away in software development. We just put layers on top of it. Most of the time, we concern ourselves only with the outermost layer of abstraction: what are the methods named and what parameters do they expect? This class is meant to […]

CS 240: Lecture 22 – Sort Review

Dear students: In today’s lab, we’ll work through a few exercises to investigate radix sort and review the five sorting algorithms we’ve discussed: Radix sort exercise Sort review There’s nothing to turn in. Ask lots of questions! TODO You have some work to do before the next class: Complete the second take of mastery quiz […]

1 2 3 4 5 201