Java Progrramming HELP, Needed Urgently, T hanks

Question

hey guys,
I have this lab I need to be done tomorrow, its been weeks lol of thinking and figuring things out can someone make it work ? Pleaseeeee !
I feel like going out and yelling for help lol I have been trying to figure this out for weeks now.
I am pasting my Lab and My Codes I did so far, And Please I really need this done today at any rate, all help would be kindly appreciated.
A Java program is required that will produce a number of reports based on the data from the Product file. This file contains the product name, cost, quantity and UPC. The file name must be input. Valid data from the file will be loaded into an array.
A menu will provide the following options: (Note there are changes from previous assignment.)
1     Display of all valid product information including extended price and GST including totals sorted by name.
2     Display of all invalid records sorted by name.
3     Search and display a certain product by name.
4     Sort by UPC and use a binary search and display a certain product by UPC. (valid records)
9 Exit.
Processing requirements:
Input the data from a file and load the records into an object array. Use this object array to produce the above reports.
Code a class definition exactly as given in the following UML.
(For specific students: you may code the UPC as an integer but if not numeric throw an exception that is handled in main. Document your choice in your submission).
Product
? Name : String
? UPC : String
? Cost : Real
? Quantity : Integer
+ Product (Name : String, UPC : String, Cost : Real, Quantity : Integer)
+ Calculate Extended Cost() : Real
+ Calculate GST(): Real
Input Record:
Product name: String
UPC: String
Cost: real
Quantity: integer
Output Reports
1. Display of all product information including extended cost and GST including totals of these 3 fields.
Following is a sample of the output required:
************************ Product Cost REPORT ****************************
Product                    Cost Quantity Extended Cost     GST     Total Cost
Diamond Necklace 12345678901x 54,321.99 188 10,212,534.12 510,626.71 10,723,160.83
Tissues 98989898989x 1.99 2 3.98      0.20     4.18
TOTALS                         10,212,538.10 510,626.91 10,723,165.01
2. Display of all invalid records and the count.
Following is a sample of the output required:
Invalid UPC Records = 1
Count Record
1          Tiara Diamond, 12345678901x, 36020.00, 2
3. Search and display a certain product by name. Display appropriate message if not found.
Following is a sample of the output required:
Enter product name: CrownJewels
CrownJewels 99999999991x     100,000.00 1 100,000.00 5,000.00 $105,000.00
6. Display the product information sorted by name
Following is a sample of the output required:
************************ Product Cost REPORT ****************************
Product                    Cost Quantity Extended Cost     GST     Total Cost
CrownJewels 99999999991x 100,000.00 1 100,000.00 5,000.00 $105,000.00
Diamond Necklace 12345678901x 54,321.99 188 10,212,534.12 510,626.71 $10,723,160.83
Pearls      88888888881x 10,000.00 1 10,000.00 500.00 $10,500.00
RubyRing      77777777771x 10,000.00 1 10,000.00 500.00 $10,500.00
Tissues      98989898989x 1.99 2 3.98 0.20     $4.18
TOTALS          (complete these values)           xxx           xxx      xxx
Java coding requirements for this assignment
Main methods required
1.     Load array with all records. Display exception messages only for records that have invalid data in any of the fields. Return array of valid records and logical size.
2.     Validate the UPC. Display each report when requested from the menu.
3.     Justify the data in the columns. Right justify numeric fields; left justify the alpha fields.
4.     A method for each report required in the menu.
Class methods
5.     Use the object method for the extended cost.
6.     Use the object method for the GST.
You may use additional methods in the main program but do not add any methods in the class definition.
Use DecimalFormat for rounding.
Create an array to hold the objects. Assume that we only need to process a file of a maximum of 500 records but the file may be larger than 500 records.
A Universal Product Code consists of 12 digits. The first digit (from the left) is the UPC type. The next five digits are the Manufacturer code. The next five digits are the product code which is assigned by the manufacturer. The final digit is the check digit. A person can determine the check digit of a Universal Product Code by doing the following:
Step 1: Sum all of the digits in the odd positions together.
0+4+0+1+5+9 = 19
Step 2: Multiply the sum from Step 1 by 3.
3 * 19 = 57
Step 3: Sum all of the digits in the even positions together.
6+2+0+1+8 = 17
Step 4: Sum together the results from Step 2 and Step 3.
17 + 57 = 74
Step 5: Subtract the sum from the next highest multiple of 10.
80 - 74 = 6 [check digit]
TEST DATA:
Step 1: Create 5 or MORE additional records that will test all conditions. Include these in your documentation. Identify what field is tested in your test data. (Example: error in each field of the record, rounding up, rounding down, valid UPC, invalid UPC, formatting of report, file too large
Step 2: Use the file attached.
GODDDDDDDDDDDDDD lol pasting it made me go crazy,
these are my codes so far, HOwever the problem is ONLY DISPLAY MENU SHOWS, nothing else even though i have enough codes that it can show something,
My codes are as follows:
I am working on Eclipse.
import java.util.Arrays;
import java.util.Scanner;
import java.io.*;
import java.util.*;
import java.io.IOException;
* Name : Sana Ghani
* Date : July 10
public class lab56
     public static Scanner file;
     public static Scanner parse;
     public static Scanner input = new Scanner(System.in);
     public static Scanner searchInput = new Scanner(System.in);
     public static void main(String[] args) throws Exception
          Product1[] validProduct = new Product1[500];
          int logicalSize = 0;
          int menuChoice=0;
          String FileName = getFileName();
          displayMenu();
          switch(menuChoice)
          case 1:
               displayAllValidRecords(validProduct, logicalSize);
               try
               // Open an output stream
               OutputStream fout = new FileOutputStream ("myfile.txt");
               // Print a line of text
               new PrintStream(fout).println ("hello world!");
               // Close our output stream
               fout.close();          
               // Catches any error conditions
               catch (IOException e)
                    System.err.println ("Unable to write to file");
                    System.exit(-1);
               break;
          case 2:
               break;
          case 3:
               binarySearchByName( validProduct,logicalSize);
               break;
          case 4:
               break;
          case 5:
               break;
          menuChoice = displayMenu();
     public static void display(Product1[]validProduct, int logicalSize)throws Exception
          String Product, UPC;
          double Cost;
          int Quantity;
          for(int index =0; index<logicalSize; index++)
               Product = validProduct[index].GetName();
               UPC = validProduct[index].GetUPC();
               Cost=validProduct[index].GetCost();
               Quantity=validProduct[index].GetQuantity();
               System.out.println(Product+"\t\t"+UPC+"\t\t"+Cost+"\t\t"+Quantity);
     public static String getFileName()
          String fileName;
          Scanner input = new Scanner(System.in);
          System.out.print("Please enter a file name: ");
          fileName = input.next();
          return fileName;
     public static int displayMenu()
          int menuChoice;
          boolean validFlag = false;
          do
               System.out.println("\n\n*************************************");
               System.out.println(" Product Display Menu ");
               System.out.println("*************************************");
               System.out.println("(1)Display All Records");
               System.out.println("(2)Display All Invalid Records");
               System.out.println("(3)Search by Product Name");
               System.out.println("(4)Sort by Product Name");
               System.out.println("(5)Exit");
               System.out.println("*************************************");
               System.out.print("Enter your choice(1-5): ");
               menuChoice = input.nextInt();
               if ((menuChoice >= 1) && (menuChoice <= 5))
                    validFlag = true;
               if (!validFlag)
                    System.out.println("You have chosen " + menuChoice + ", " + menuChoice +
                    " is not valid. Please try again");
          }while(!validFlag);
          return menuChoice;
     public static String loadArray(Product1 [] ValidProduct, String fileName)throws Exception
          int logicalSize=0;//will always have to declare
          String record;//will always have to declare
          String Product, UPC;//variable names from
          double Quantity;
          double Cost;
          Scanner file = new Scanner(new File(fileName));//open
          record = file.nextLine();//read a line
          record = file.nextLine();//read a line
          for(int index = 0; index < ValidProduct.length && file.hasNext(); index++)//check to see if the file has data
               record = file.nextLine();
               parse = new Scanner(record).useDelimiter(",");
               String Name = parse.next();
               UPC = parse.next();
               Cost = parse.nextDouble();
               Quantity=parse.nextDouble();
               ValidProduct[index] = new Product1 ( Name, UPC, Cost, (int) Quantity);
//               create the object-- call the constructor and pass info
               logicalSize++;
          return logicalSize+".txt";
     public static double roundDouble(double value, int position)
          java.math.BigDecimal bd = new java.math.BigDecimal(value);
          bd = bd.setScale(position,java.math.BigDecimal.ROUND_UP);
          return bd.doubleValue();
     * This method will print report about valid records
     public static void displayAllRecords( Product1[]valid, int ValidProduct,
               Product1[] invalid, int InvalidProduct)
//          Print valid records
          displayAllValidRecords(valid, ValidProduct);
//          Print invalid UPC records
          displayAllValidRecords(invalid, InvalidProduct);
     public static void displayOneRecord(Product1[]valid, int index)
          double extendedCost, GST, SumofGST = 0, // Total Extended Cost
          totalCost, SumOfTotalCost = 0; // Total Extended Cost + GST
//          Print title
          System.out.println(leftJustify("Product", 50) +
                    leftJustify("UPC", 15) +
                    rightJustify("Cost", 10) +
                    rightJustify("Quantity", 5) +
                    rightJustify("Extended Cost", 15) +
                    rightJustify("GST", 5) +
                    rightJustify("Total Cost", 13));
          extendedCost = valid[index].CalculateExtendedCost();
          extendedCost = roundDouble(extendedCost, 2);
          GST = valid[index].CalculateGST();
          GST = roundDouble(GST, 2);
          totalCost = extendedCost + GST;
          totalCost = roundDouble(totalCost, 2);
//          justify method ensures all values are of the same size
          System.out.println(//leftJustify(i+"",3) + ": " +
                    leftJustify(valid[index].GetName(), 50) +
                    leftJustify(valid[index].GetUPC(), 15) +
                    rightJustify(valid[index].GetCost()+"", 10) +
                    rightJustify(valid[index].GetQuantity()+"", 5) +
                    rightJustify(extendedCost+"", 10) +
                    rightJustify(GST+"", 10) +
                    rightJustify(totalCost+"", 10));
     * This method will print report about valid records
     public static void displayAllValidRecords( Product1[]valid, int validCounter)
          double extendedCost, sumOfExtendedCost = 0, // Total Extended Cost
          GST, sumOfGST = 0, // Total GST
          totalCost, sumOfTotalCost = 0; // Total Extended Cost + GST
          System.out.println("************************ XYZ Product " +
                    "Cost REPORT ****************************" +
//          Print title
          System.out.println(leftJustify("Product", 50) +
                    leftJustify("UPC", 15) +
                    rightJustify("Cost", 10) +
                    rightJustify("Qty", 5) +
                    rightJustify("Extended Cost", 15) +
                    rightJustify("GST", 5) +
                    rightJustify("Total Cost", 13));
//          Print Records
          for(int i=0; i<validCounter; i++)
               extendedCost = valid.CalculateExtendedCost();
               extendedCost = roundDouble(extendedCost, 2);
               GST = valid[i].CalculateGST();
               GST = roundDouble(GST, 2);
               totalCost = extendedCost + GST;
               totalCost = roundDouble(totalCost, 2);
//               justify method ensures all values are of the same size
               System.out.println(//leftJustify(i+"",3) + ": " +
                         leftJustify(valid[i].GetName(), 50) +
                         leftJustify(valid[i].GetUPC(), 15) +
                         rightJustify(valid[i].getClass()+"", 10) +
                         rightJustify(valid[i].GetQuantity()+"", 5) +
                         rightJustify(extendedCost+"", 10) +
                         rightJustify(GST+"", 10) +
                         rightJustify(totalCost+"", 10));
               sumOfExtendedCost += extendedCost;
               sumOfGST += GST;
               sumOfTotalCost += totalCost;
     private static void sortByName(Product1 [] ValidProduct, int logicalSize) throws Exception
          Product1 temp;
          for (int outer = logicalSize-1; outer > 1; outer --)
               for (int inner = 0; inner < outer; inner ++)
                    if (ValidProduct[inner].GetName().compareToIgnoreCase(ValidProduct[inner+1].GetName())>0)
                         temp = ValidProduct[inner];
                         ValidProduct[inner] = ValidProduct[inner + 1];
                         ValidProduct [+ 1] = temp;
     public static void binarySearchByName(Product1 [] ValidProduct, int logicalSize)
          int high = logicalSize - 1;
          int low = 0;
          int mid = 0;
          int count = 0;
          int compare = 0;
          boolean found = false;
          System.out.print("Enter a product name");
          String product = input.nextLine();
          while (high >= low && !found)
               count += 1;
               mid = (high + low) / 2;
               compare = ValidProduct[mid].GetName().compareToIgnoreCase(product);
               if (compare == 0)
                    System.out.println("Found: " + ValidProduct[mid].GetName());
                    found = true;
               else if (compare < 0)
                    low = mid + 1;
               else
                    high = mid - 1;
          if (!found)
               System.out.println(product + " not found.");
          System.out.println(count + " steps");
          System.out.println();
     public static String leftJustify(String field, int width)
          StringBuffer buffer = new StringBuffer(field);
          while (buffer.length() < width)
               buffer.append(' ');
          return buffer.toString();
     public static String rightJustify(String field, int width)
          StringBuffer buffer = new StringBuffer(field);
          while (buffer.length() < width)
               buffer.append(' ');
          return buffer.toString();
     public static void displayValidRecords(Product1 [] ValidProduct, int logicalSize) throws Exception {
          long longMAX_POSSIBLE_UPC_CODE = 999999999999L;
          // set input stream and get number
          Scanner stdin = new Scanner(System.in);
          System.out.print("Enter a 12-digit UPC number: ");
          long input =stdin.nextLong();
          long number = input;
          // determine whether number is a possible UPC code
          if ((input < 0)|| (input > longMAX_POSSIBLE_UPC_CODE)) {
               // not a UPC code
               System.out.println(input +"is an invalid UPC code");
          else {   
               // might be a UPC code
               // determine digits
               int d12 = (int) (number % 10);
               number /= 10;
               int d11 = (int) (number % 10);
               number /= 10;
               int d10 = (int) (number % 10);
               number /= 10;
               int d9 = (int) (number % 10);
               number /= 10;
               int d8 = (int) (number % 10);
               number /= 10;
               int d7 = (int) (number % 10);
               number /= 10;
               int d6 = (int) (number % 10);
               number /= 10;
               int d5 = (int) (number % 10);
               number /= 10;
               int d4 = (int) (number % 10);
               number /= 10;
               int d3 = (int) (number % 10);
               number /= 10;
               int d2 = (int) (number % 10);
               number /= 10;
               int d1 = (int) (number % 10);
               number /= 10;
               // compute sums of first 5 even digits and the odd digits
               int m = d2 + d4 d6 d8 + d10;
               int n = d1 + d3 d5 d7 + d9 + d11;
               // use UPC formula to determine required value for d12
               int r = 10 - ((m +3*n) % 10);
               // based on r, can test whether number is a UPC code
               if (r == d12) {
                    // is a UPCcode
                    System.out.println(input+" is a valid UPC code");
               else {   
                    // not a UPCcode
                    System.out.println(input+" is not valid UPC code");
Any help would be great thanks !!
Take care,

Answer 1

1) It's your problem that you waited until the last minute before you went for help...not ours. We'll give your problem the same attention as anyone elses...therefore your problem isn't any more urgent than any other problem here.
2) I don't intend on doing your entire assignment. Nor do I intend on reading all of it. If you need help with a specific requirement, then post the information/code relevant to that requirement. I don't know how to help you when you bury the problem inside a 9 mile long essay.
3) Post code in tags so it's formatted and readable. (there's a *code* button up above that makes the tags for you).