Individual Assignment

Individual Assignment

Phyllis Lenoir

PRG/210

June 13, 2011

Raj Kayathi

The one section which requires an iteration structure would be the following:

Design a program which automatically links the individual suffix orders to the correct expediters. To do this, programmers should create algorithms detailing the step-by-step process of removing my ID from each individual order and transferring the order to the correct expediter's ID.

The selection structure I use will be the single selection structure. The single selection structure will determine that, if accounts unknown to my ID have my ID attached to them, then they will be changed to the correct expedite r ID:

Input "Change"

If Change = "X" and

"Y" = Orders that are not Phyllis', and

"Z" = "Results after change" Then

Write X/Y = Z

Input "Complete Order Changes"

End If

Write "Order Changes Complete."

The purpose of this pseudocode is to initiate and complete the changes to all of the orders that belong to the expediters, and not to myself.

Once the program is initiated, its intent will be to make sure all accounts accurately display the correct ID's of each expediter. The reason I chose the single-alternative selection structure is because I am still unsure how the process works, so I decided to use the most simple structure for now, and am hoping I have a better understanding of how this works.

The program eventually will be designed to automatically make changes to each order so the correct ID will be attached. There are six expediters in my area for a specific purpose, and the program will focus on the six choices of expediter ID's to attach to the orders.

One other area the program eventually should include would be the any new accounts which the expediters are assigned, and the orders attached to these accounts must display the correct ID's without reverting back to my ID. If this can be accomplished, the program should work perfectly.

References

Venit, S. & Drake, E. (2009).