CS 240: Lecture 9 – Linked Lists
Dear students: We are in the middle of a discussion of linear structures and the complexities of their operations. We started with an array-based list, and now we move on to a linked list. Today we’ll examine how the two approaches to lists differ. Muddiest Points But first, I will address a sample of your […]
CS 240: Lecture 8 – Dynamic Arrays Lab
Dear students: Today we will devote our entire time together to a lab on dynamic arrays. Find the lab on the schedule on the main Canvas page. 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 […]
CS 347: Lab 5 – Box Model
Dear students: Welcome to lab. Now’s your chance to apply the ideas you read about. Find a partner and complete as many of the tasks below as you can. At the end of our time together, paste your HTML files into Crowdsource in order to receive credit. Task 1 Create 300-by-300 cards for five sequential […]
CS 240: Lecture 7 – Amortized Analyis of ArrayList
Dear students: Today we begin our application of complexity analysis to real live data structures that software developers use everyday. The first data structure to go under the microscope is the array-based list. Before that, though, we need to discuss one alternative view of the complexity classes. Limit Definitions Last week we looked at ways […]
CS 347: Project 1 – Static Site – due September 30
In this first project, you will create a static website for a client using HTML and CSS. A static website is one whose content is baked into the HTML. This is in contrast to a dynamic website whose content is generated on the fly using JavaScript and queries to web services. You will create a […]
CS 240: Lecture 6 – Analysis Lab Continued
Dear students: Today we will continue analysing algorithms in the lab exercises we started on Friday. TODO Read 7.01-7.03 in OpenDSA. Read Amortized Analysis Explained. Keep working on PA1. Run into issues now, while there’s time to address them. See you next time. Sincerely,
CS 347: Lab 4 – Adding Style
Dear students: Welcome to lab. Now’s your chance to apply the ideas you read about. Find a partner and complete as many of the tasks below as you can. At the end of our time together, paste your HTML files into Crowdsource in order to receive credit. Task 1 Recreate the following page using an […]
CS 240: Lecture 5 – Analysis Lab
Dear students: Today we will practice measuring or analysing algorithms in lab exercises. But first we need to muddy the waters just a bit more. What is cost function of this algorithm? public static boolean contains(int target, int[] numbers) { for (int number : numbers) { if (number == target) { return true; } } […]
CS 347: Lab 3 – More HTML
Dear students: Welcome to lab. Now’s your chance to apply the ideas you read about. Find a partner and complete as many of the tasks below as you can. At the end of our time together, paste your HTML files into Crowdsource in order to receive credit. (There’s only one text box. Just paste them […]
CS 240: Lecture 4 – Asymptotic Complexity
Dear students: If I asked you how fast you can run, you probably wouldn’t give me a number. Rather, you’d ask me how far. To get a complete picture of your speed, I might ask how fast you run a mile, a 5K, a 10K, and a marathon. Similarly, when I ask an algorithm how […]