Lab 9

Lab assignment: Structs for the storage and retrieval of data - Dictionary Version

This week in lab we'll be using structs and arrays of structs again, to be sure you understand them.

We've given you the code to read in a dictionary, and it should look pretty familiar.

You do not need to modify any of the code to read in the dictionary, your code should be before main (for the struct) and after the dictionary is fully read in.

A sample run of the program will look like the following.  (User input is shown in bold, though in your program it will not be bold.)

1 point

Enter a letter: g

g    89334    97902

2 points

a    0       15472

b    15473   29035

c    29036   52783

...

3 points

a    0       15472   0.0587137

b    15473   29035   0.051466

c    29036   52783   0.090114

...

Notes:

Submission:

1. You should work with a partner for this (and all the remaining) lab(s).  Only one of you need to submit the program to Blackboard, though you should be certain that both of your names be present in a comment at the top of the .c or .cpp source file.

1.5 If you work alone, include just your name in a comment at the top so that I know you worked alone, and not have to guess.

2. You should turn in to Blackboard by the END OF THE LAB (8:50 for the 8-9 lab session, 9:50 for the 9-10 lab session).  I know it's tempting to keep working on it, but other classes come in, and it's not fair to the students who are limited to that particular time span if you go over.  Which isn't to say that you can't work on it later, to check your solution against the one I post for your own understanding.  But what you submit for a grade should be before the next hour begins.

3. If you wish, you may submit your lab by 11 am on Thursday for a 1 point penalty.  If you can't finish up the second point by the end of lab, you can still earn the score by completing all three steps and submitting your code by the day after.