CS 240: Lecture 15 – Recurrence Relations
Dear students: This semester is moving right along. We started by discussing the need to gauge the expected running time of our code in a machine-independent way. Coming up with an exact number of operations is too hard. Instead we decided to focus only on the dominant terms of an algorithm’s cost function. The result […]
CS 240: Lecture 14 – Queue Lab
Dear students: Today we will devote our entire time together to a lab on queues. 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. When […]
CS 240: Lecture 13 – Stacks and Queues Continued
Dear students: Today we continue our discussion of stacks and queues through some exercises. Postfix Evaluation Let’s see an example of an algorithm that uses a stack. Support you want to write code to evaluate an arbitrary arithmetic expression. Something of this form: $$7 + 5 \times 2 – 3$$ You might break the expression […]
CS 347: Lab 9 – Media Queries
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 HTML files into Crowdsource in order to receive credit. Task 1 Recreate the following page using an […]
CS 347: Lab 8 – Position
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 A pricing grid is a pattern […]
CS 240: Lecture 12 – Stacks and Queues
Dear students: It’s time to introduce a new abstract data type: the queue. Like the stack, queue is only an interface. It can be implemented many different ways. In fact, Java doesn’t even have a Queue class. Today we’ll examine some of the possible implementations and look at some situations in which stacks and queues […]
CS 240: Lecture 11 – Linked List Lab
Dear students: Today we will devote our entire time together to a lab on linked lists. 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 347: Forcing HTTPS
When your browser sends an HTTP request from your local computer to a remote server and the server sends back a response, malicious users on the network could capture or sniff the messages. The headers and bodies of HTTP messages are readable. This is bad. Your messages might contain trade secrets, personal information that could […]
CS 347: Lab 7 – Flexbox 2
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 10 – Stack
Dear students: We’ve been talking about list as an abstract data type. We’ve also been talking about array lists and linked lists, which are two data structures that are commonly used to implement a list. Today we look at a new abstract data type: the stack. Stack A stack is an abstract data type representing […]