Design Tools (Pseudocode)
Instruction: Create a program plan, algorithm, flowchart and pseudocode for the following cases:
A Department Store classifies its credit card holders as to local, national and international. A local card holder resides in Metro Manila, a national, anywhere in the Philippines and an international, anywhere in the world. The programmer must store a code 01, 02, and 03 for local, national and international card holders respectively. The program is to read the cards and store the proper code in each card.
Flowcharting (Iteration Structure)
An electric company bases its charges on two rates, customers are charged P25.00 per kilowatt-hour for the first 300 kilowatt-hours used in a month and P30.00 each for all kilowatt-hours used thereafter. Compute for the amount due from a customer after reading the kilowatt-hours used. Assume that there are 100 records of customers.
Flowcharting (Iteration Structure)
Write an algorithm and draw a flowchart that will convert a given decimal number (N10) to its equivalent binary number (N2).
Flowcharting (Selection Structure)
A company classifies its products by weights as follows:
Class A – 12 pound or over
Class B – 5 to 11.9 pounds
Class C – less than 5 pounds
Show the logic of determining into which class to place an item.
Given is GROSS_PAY, draw a flowchart that will compute for DEDUCTIONS and NET_PAY for employee’s weekly payroll. Consider the conditions:
If Civil Status = ‘SINGLE’
DEDUCTIONS = GROSS_PAY * 0.03
If Civil Status = ‘MARRIED’
DEDUCTIONS = GROSS_PAY * 0.06
If Civil Status = ‘WIDOW’
DEDUCTIONS = GROSS_PAY * 0.05
If Civil Status = ‘HEAD OF THE FAMILY’
DEDUCTIONS = GROSS_PAY * 0.02
Using the formula:
[NET_PAY = GROSS_PAY – DEDUCTIONS]
Create a program plan, an algorithm, and draw a flowchart that uses sequence structure, that would accept two (2) numbers represented by X and Y. Print the two number after interchanging their values.
1. The straight-line method for computing the yearly depreciation in value D for an item is given by the formula
D = P – S
Y
Perform the following using the given Array below.
Given : int[] arr = new int[6] { 5, 8, 9, 25, 0, 7 };
1. (arr[4] + arr[0)]] * arr[2]
Perform the following using the given Array below.
Given : int[] arr = new int[6] { 5, 8, 9, 25, 0, 7 };
Solve the recurrence using change of variable method: T(n) = 2T(n/2)+nlogn