Part A. Diagrams and Pseudocode

1. Read the paper on Nassi-Schneiderman charts (pdf attached)
2. Watch the two videos on Flowcharts and pseudocode

Solve the next:

1. Using problems 1 and 2 below, draw the Nassi Schneider diagram.
2. Using problems 1 and 2 below, draw the flowchart.
3. Using problems 1, 2 and 3 below, write the pseudo-code.

Problems

1. To find the maximum number in a sequence of input with a sentinel value of 0 (that is, stop reading numbers when the user enters 0).
2. Write the algorithm for the non-recursive linear (sequential) search.
3. Write the algorithm for the non-recursive binary search.

Part B. Decision tables

1. Watch the three videos on decision tables

Solve the next:

1. Draw the decision tables for all the problems below
2. For the decision tables above, reduce the tables if possible.

Problems

1. A month is to be represented as an integer. A valid month is in the range of 1..12. An integer < 1 is invalid, or an integer > 12 is invalid. Consider how this can be simplified or reduced.
2. An employee is either hourly or salaried. An hourly employee is paid by calculating an hourly wage and an hourly employee that works more than 40 hours is paid overtime. An hourly employee that works less than 40 hours must produce an absence report. A salaried employee can work any number of hours.
3. A new program to determine parking rates is to be developed. Users will select (from a dropdown) the classification of the vehicle owner (faculty/staff or student), the location of the parking (garage or open lot) and the type of vehicle (large or small). Students with a small vehicle pay $250.00 in a lot and $350.00 in a garage. Students with a large vehicle may park in a lot for $400.00. Faculty/staff may park small vehicles anywhere for $150.00 and large vehicles in a lot for $200.00. Large vehicles are not allowed in the garage.