Assignments

Assignments will maintained on this page. Consult it for details, speifications, expectations, hints and updates. At times the deadlines may not be achievable due to unexpected diffulties in the assignment or in your academic or personal lives. In such instances please request an extension via e-mail.

There will be three submission modes: via e-mail, via hard copy and by the homework submission program, hsp. Please regard the particular mode requested on each assignment. For details on hsp, see Homework Submission Program

Assignment #0

a) By class time on Wed., please send me e-mail from the address to which you prefer mail regarding this course be sent. Include the following information:

• Your name and preferred nickname, if any.
• A four-letter "handle", i.e. a code name, unknown to anyone else, to be used for otherwise anonymous submittals.
• Your graduation year.
• Your (likely) major.
• When did you take CS117 ?
• What programming languages do you know?
• What you expect to get out of this course?
• If you were to pick a programming project for this course already, what would it be?
• What are some of your favorite springtime activities?

Reading: read Ch. 1 in Kruse.

Assignment #1

See the program rat0.cpp handed out in class.

a) List operations that you would want to have in a rational number class.

Due: Wed., format: handwritten.

b) Perform some of the updates as indicated there.

due date: classtime on Fri.

deliverables: program listing and sample rum.

See program rat5.cpp handed out in class and available on Accounts/courses/cs127/rnau
Modify it or your own rat program to

• a) use const and & correctly
• b) make << a free function
• c) include more functions of your choice

Assignment #2

See the program stack1.cpp handed out in class and available on Accounts/courses/cs127/rnau
Modify it,or your own stack program, so that

• a) top is the index of the top item on the stack (rather than where the next item will go. Carefully consider all the changes needed to make this work correctly.
  Due: classtime Wed
  Deliverables: hardcopy of program and sample runs
• b) If this all goes very smoothly, template your stack and test it on several types, including Rats. You can turn this part in whenever and if ever you complete it.

Assignment #3

See the program stack31.cpp handed out in class and available on Accounts/courses/cs127/rnau
Modify so that

• a) Pop works
• b) You have a working destructor
• c) Template it
• d) Put your templated stack class into a file named stack.h and hsp it.
• e) (Optional) If this goes well, test it on the evaluation of arithmetic expressions in postfix form.
  
  Due: a-d by classtime Mon
  Deliverables: hsp stack.h

Assignment #4

Refer to the linked list implementation of a queue started in class
You should try to complete and test

• a) void EnQ(char item)
• b) char DeQ()
• c) ~Queue
• d) Do not template your queue class (yet).
  Put it (or as far as you get) into a file named queue.h and hsp it.
• hints: On DeQ - Is the Q empty? Does it just have one node? Save the character; move the front; delete the oldfront; return the character.
  On EnQ - Special case = empty queue. Get a new node. Fill in its char; set its link to NULL. Hook it up to the old rear and make it the new rear.
  On ~Queue: This should be a lot like ~Stack.
  
  Due: as far as you can get by classtime Wed; you can modify it later
  Deliverable: hsp queue.h

Assignment #5

Refer to your linked list implementation of a stack and the program SQ.cpp in which a stack was derived from a queue. You are to write and test a program QS.cpp in which you derive a queue from a stack. For the sake of simplicity - do not use templates, and have your two classes and main() all in the same file.

Due: classtime Monday 4/16
Deliverable: hsp QS.cpp

Assignment #6

See the SnowFlake.cpp program on the account and discussed in class. Get rid of my main() and replace it by one that uses turtle graphics to draw squares, then pentagons, etc. Aim for generality. You might want to make a turtle class and file turtle.h.

Due: Let's see how far you get by classtime Wednesday 4/18
Deliverable: hsp - include "turtle" in the title

Assignment #7

See the program Pstrings0.cpp on the account and being discussed in class. In the comments are several suggestions for additional functions to add to the class, viz. length(), AllCaps(), Adds and Deletes and concatenation. Add and test some of these.

Due: As far as you can get by Monday 4/23
Deliverable: hsp - call it pstring.cpp please.

Assignment #8

See the program pizza.cpp on the account and used in the lab. In the comments are several suggestions for additional functionality to add to the program, viz. more and better colors, a new shape, better olives, red peppersl. pepperoni, etc.(), Add and test some of these.

Due: As far as you can get by Monday 4/23 also. You probably needn't spend much more time on it then you did in the lab.
Deliverable: hsp call it pizza.cpp

Assignment #9

See the program qsort.cpp on the account and discussed in class. Modify it so that rather than using recursion it uses a stack. Use a templated stack class. What to stack is the question. There are at least two possibilities. You can stack indices either in pairs (use a little Pair struct) or individual indices just so long as you Pop them in the reverse order. The indices represent the endpoints of the subarray to be sorted.

Hints:

• Leave Split alone.
• Stack indices, not components.
• Outline of your main: Push the original endpoints. Loop until ?. Pop a pair of endpoints. If ? then Split and Push two pairs of endpoints.

Assignment #10

• p297, 7.4 E2, and E3
• p338, 8.5 E3
• p350, 8.7 E1
• p362, 8.8 E8(f)
• p370, 8.9 E1, and E2(d)&(e)
• p383, 9.2 E1, and E2
• p387, 9.3 E3

Deadline: Wed, 5/9, 8:30 am

Format: hardwritten is fine

Assignment #11

Consider the airport7.cpp program demonstrated in class, which stores the airport codes in a tree. You will find a version of it on our class account. It does a number of things, but one thing it doesn't do is search. That's your job. In particular,

• a) Put a dozen or so names into a file.
• b) Make the program work with names rather than airport codes.
• c) Write and test a function which binary searches the tree for a name; do this recursively. It will be quite similar to the inTree function
• d) If that goes well, also write the binary search iteratively, i.e. use link chasing.

Deliverables: Your copy of the program via hsp.

Deadline: classtime, Wed 5/16

Assignment #12

Consider the zoo program demonstrated in class. You will find a version of it, named zoo.cpp, on our class account. However that version does not store the tree to a file and retrieve it. That's your job! You are to complete the outTree and inTree functions.

Some suggestions:

• Sit down and think about which one of the standard tree traversals - preorder, inorder, postorder - makes sense here.
• Use it to output the tree to the screen.
• Recursion is probably easier than link chasing.
• Write outTree to write to a file, echoing to the screen.
• Check the file.
• Use the same traversal to write inTree, i.e. to read in the file. See me if you need a hint.

Deliverables: Your copy of zoo.cpp via hsp.

Deadline: Fri 5/18

Project

• • Proposal

    Deadline: Thurs 5/17

    A brief proposal on your intended final project. The final project must include data structures, preferably something using linked structures. The default project is to graphically demonstrate data structures. But even in that case a more specific proposal is required.

    Format: by e-mail

• • Outline

    Deadline: Mon 5/21

    This could be in pseudo-code (preferred) or English or C++. It should be an outline of what your program does.

    Format: hsp, call it poject0 in a folder called Project. In fact, all your hsp for the project should be there.

• • First draft of the program

    Deadline: 11:59 pm, the last day of classes.

    This should be a working program. It need not be complete. It can contain stubs.

    Format: hsp, project1.cpp

• • Final version

    Absolute deadline: 5:00 pm, last day of exams

    Formats: Both a hardcopy included in your portfolio and copies of all relevant files suitably named, e.g. project2.cpp, via hsp.