Jess: Data Structures, Week 4

Chapter 3: Lists, Stacks, and Queues

3.1 You are given a list, L, and another list, P, containing integers sorted in ascending order. The operation printLots(L,P) will print the elements in L that are in positions specified by P. For instance, if P =…

Jess: Data Structures, Week 3

Finish the fizz buzz problem as a Java program. Given the list of numbers from 1 to 100, for each number,
if it is divisible by 3, print out “fizz”
if it is divisible by 5, print out “buzz”
if it is both divisible by 5 and 3, print out “fizz buzz”

Jess: Data Structures, Week 5

Chapter 4: Trees

4.1 For the tree in Figure 4.70:
a. Which node is the root?
/usr is the root

b. Which nodes are leaves?
junk, junk, work,

John’s Data Structures Week 8

Chapter 6: Stacks

1 . State three more axioms about the stack of T ADT .

For any stack s and element e, pop(push(s,e)) = s .
For any stack s and element e, top(push(s,e)) = e .
For any stack s, and element e, empty?(push(s,e))…

Week 1 Blog Post

This week is the first and probably the most confusing weeks. I moved up to the house on Thursday, found my room, and went to the UW business entrepreneurship class that evening. The speakers talked about the difference between working for large and small companies and what it means to be the owner…

Dom Software Architecture Week 5

This weeks readings on Software Architecture began by stating changes between web 1.0 and 2.0 in the last 20 years. Web 2.0 client/server interactions have advanced from a simple request and responses model, to a more elaborate complex system.

Dom’s Data Structures Week 3

The if statement comes in three forms:

• The simple if statement

• The if-else statement

• The if-else if statement

Dom Software Architecture Week 3

If something isn’t web 2.0, what would you call it? What existed before web 1.0?

If it is not considered web 2.0 then it is most likely called web 1.0 which by this time is not used since web 2.0 is the common and up to date today. Since web 1.0…

Paul’s Software Architecture Week 4

Software architecture is a slippery topic, and one which I hope to understand better by writing about it. In analogy with building architecture, a software architect is responsible for coming up with a high-level plan, including the choice of materials and methods…

John’s Week 7 Data Structures

This week I skipped ahead to chapter 17 on Binary Trees. After learning about binary trees I then sought out how to write a binary tree in Ruby. I ended up with the following code that creates a binary tree with a root and then a left and right child node off of the root.