C211 Lab 2: ACME Sports Drinks Help the company figure out if it can ship all of the drink it makes each day!

Summary

In this lab, you will calculate how many cans, boxes, and trucks ACME will need in order to ship all of its drink each day. If at any time you have any questions, please raise your hand or ask your neighbor.

Step 1: volume->cans

1. Define cyl-vol (the procedure I just made in class). It should start with:

     (define cyl-vol
             (lambda (rad ht)
                     ...))
     

   HINT: copy it from the board!
    
   
2. Write everything you're doing into the lab book. You don't have to write a book, just record your steps.
    
   
3. Write a procedure that calculates the number of cans needed and returns the value it calculated. It should use cyl-vol and begin:

     (define vol->cans
           (lambda (vol can-rad can-ht)
                   ...))
     

   Fill in the "..." with code that uses the cyl-vol procedure to calculate the volume that will fit in each can, then figures out how many cans it will need. can-rad & can-ht are the radius and height of a can (respectively).
    
   The volume will most likely not fit in an exact amount of cans; there will be some left over that must be put into a can to partially fill it. So you could end up with 43 full cans and one that's only half full -- you still need 44 cans.
    
   HINT: there's a procedure in Scheme called ceiling. It rounds any non-whole number up. For example, 3.2 becomes 4.0 and 3.6 becomes 4.0.
    
   
4. Think up and write down at least five test cases (think about possible can shapes and volumes that might be different than the rest).
   Here's a sample test case:

     > (vol->cans 1400 2 4)
     28.0
     

   As you can see, this means that 28 cans of radius 2 and height 4 are needed to pack 1400 units of Sports Drink.
   Put these test cases into your lab book and explain the expected result.
    
   Once you've got code written in your lab book and some cases you can use to test it (as well as full english sentences explaining briefly what you have to do), put your code into SWL and test it. Document in your lab book how each test turns out, and then any debugging you do as well.
    
   

Step 2: cans->boxes

1. Define cans->boxes. It should begin like:

     (define cans->boxes
           (lambda (cans box-capacity)
                   ...))
     

   The parameter box-capacity represents the number of cans that fit in one box.
    
   Do this step much like the first, writing your code in the lab book first, and then desiging test cases. Once you've got those, put your code into SWL and try it out. Document all your steps and the results of what you do and change.

Step 3: boxes->trucks

1. Define boxes->trucks. It should begin like:

     (define boxes->trucks
           (lambda (boxes truck-capacity)
                   ...))
     

   NOTE: Remember ceiling? Recall also that even if there is one box more than it takes to fill a truck, a second truck must be used. If there are (+ 1 truck-capacity) boxes, it takes two trucks to move the whole lot!
    
   

Step 4: the fun part!

• a volume of Sports Drink
• a #<procedure> that converts volume into cans (step 1)
• a #<procedure> that converts cans into boxes (step 2)
• and a #<procedure> that converts boxes into trucks (you guessed it, step 3!)

Step 4.1: rewrite

• What is the functional difference between these two versions of the procedure?
• Why did I have you write it the other way?
• What advantage would we gain by putting the procedures in the parameter list?

Step 5: Make it useful!

(define enough-drivers?
      (lambda (num-drivers vol)
              ...))

Challenge Step: Side effects and the if keyword

Today we have enough trucks to ship ## units of Sports Drink!
(Where the ## is the actual volume of Sports Drink)

We need ## more drivers to ship today's volume of Sports Drink.
(Where the ## here is the additional number of drivers needed to complete the shipment)