Help needed urgently -Had a power (electricity) failure at re-installation

I need your help in fixing this BIG problem. I had an app reset which required me to re-install my 8900 Os. In the process of installation. Having gotten to the level where it says Do not disconnect your device..
Loading JVM and the system application window
waiting for device initialization
A colleague of mine trying to resolve some issues with his printer mistakenly Pull my power cable off
I tried starting all over again but the system would not recognize the phone and could not even come up with the com port number>
the phone blinks intermittently too.
How do I resolve this issue.
Thank you

Hi and Welcome to the Forums!
Two possibilities for you:
http://crackberry.com/blackberry-101-lecture-12-how-reload-operating-system-nuked-blackberry
http://forums.crackberry.com/f3/how-wipe-jl_cmder-53502/
Good luck and let us know!
Occam's Razor nearly always applies when troubleshooting technology issues!
If anyone has been helpful to you, please show your appreciation by clicking the button inside of their post. Please click here and read, along with the threads to which it links, for helpful information to guide you as you proceed. I always recommend that you treat your BlackBerry like any other computing device, including using a regular backup schedule...click here for an article with instructions.
Join our BBM Channels
BSCF General Channel
PIN: C0001B7B4 Display/Scan Bar Code
Knowledge Base Updates
PIN: C0005A9AA Display/Scan Bar Code

Similar Messages

HT201210 i have an error of no 11. kindly help, needed urgently

i have an error of no 11. kindly help, needed urgently
when i try to upgrage my
iphone 3gs wit 4.1 to new latest 5.1
it gives the erorr of 11. what that mean? Reply as soon as you can !
thnx

Error -1 may indicate a hardware issue with your device. Follow Troubleshooting security software issues, and restore your device on a different known-good computer. If the errors persist on another computer, the device may need service.

Some J2ME midlets doubts!! help needed urgently!!!

Hi,
I am currently working in a company where it does wireless technology like WAP and I am assigned a task of creating a screensaver midlet. I have some doubts on the midlets.
1) How do i use a midlet suites? From what I heard from my colleagues & friends, a servlet is needed for midlets to interact with one another. is it true?
2) How do I get the startin midlet to take note the phone is idling so that the screen saver midlet can be called?
Help needed urgently... if there is any source codes for me to refer to would be better... Thanks...
Leonard

indicates that MIDlet suites are isolated (on purpose) from each other, so you can't write over another one's address space.
Also, I believe (at least on cell phones) that you have to specifically enter the Java Apps mode; unless you do the app won't execute. If you are in Java apps mode and a call comes in, the cell's OS puts the Java app currently executing on "Pause" mode and switches back to phone mode.
Not sure if you will be able to have a Java app do that automatically.
BTW why do you need a screensaver on an LCD display? Is it really intended to show an advertisement?
Download and real all the docs you can from Sun, once you get over the generic Java deficiencies MIDlet's aren't that hard.

Load bar at start up, then shut down. HELP NEEDED URGENTLY!!! plss....

Load bar at start up, then shut down. HELP NEEDED URGENTLY!!! plss..

The startup disk may need repairing.
Startup your Mac while holding down the Command + R keys so you can access the built in utiliites to repair the startup disk if necessary or restore OS X using OS X Recovery

Help needed urgently on a problem..plzzz

hi..this is a linear congruential generator. I have to implement it and i need the execution time for the program.
for your understanding i'm providing an example below.
Xn=(( a* xn-1 )+b) mod m
If X0=7 ; a = 7 ; b =7 ; m=10
Then
X0 = 7
X1 =((7 * 7) + 7))mod 10 = 6
X2 = ((6*7)+7))mod 10 = 9
X3 = ((9*7)+7) mod 10 = 0
X4 = ((0*7)+7) mod 10 = 7
Now since the cycle is being repeated i.e 7 appears again�so the period is 4 coz there are 4 diff nos. i.e 7,6,9,0�..
help required urgently....your help will be appreciated...thankyou..

Hi,
I wrote the code so that it catches any cycle (not only the "big" one).
Otherwise it will enter infinite loop...
The time complexity is O(N*logN): it can do at most N iterations (here N is your 'm'), and in each iteration there can be O(log N) comparisons (since I maintain TreeSet).
Interesting issue: is it possible to supply such (x0, a, b, m) tuple such that all possible values from 0 to m-1 will be output? I think no :)
Here is the program:
package recurr;
import java.util.TreeSet;
import java.util.Comparator;
public class Recurrences {
     private static long x0, a, b, m;
     private static TreeSet theSet;
     public static void main(String[] args)
          long l0, l1, l2, l3;
          try {
               x0 = Long.parseLong(args[0]);
               a = Long.parseLong(args[1]);
               b = Long.parseLong(args[2]);
               m = Long.parseLong(args[3]);
          } catch(NumberFormatException nfe) {
               nfe.printStackTrace();
          System.out.println("X[0]: " + x0 + "\n");
          long curr = x0;
          boolean cut = false;
          int i;
          // initialize the set
          theSet = new TreeSet(new LongComparator());
          // we can get at most m distinct values (from 0 to m-1) through recurrences
          for(i=1; i <= m; ++i) {
               // iterate until we find duplicate
               theSet.add(new Long(curr));
               curr = recurrence(curr);
               if(theSet.contains(new Long(curr))) {
                    cut = true;
                    break;
               System.out.println("X[" + i + "]: " + curr + "\n");
          if(cut) {
               System.out.println("Cycle found: the next will come " + curr + "\n");
          } else {
               System.out.println("No cycle found!");
          System.out.println("----------------------------------");
          System.out.println("Totally " + (i-1) + " iterations");
     private static long recurrence(long previous)
          return (a*previous + b)%m;
     static class LongComparator implements Comparator
          public int compare(Object o1, Object o2)
               if(((Long)o1).longValue() < ((Long)o2).longValue()) {
                    return -1;
               } else if(((Long)o1).longValue() > ((Long)o2).longValue()) {
                    return 1;
               } else return 0;
}

Help needed Urgently- Rebate based on collected amount

Dear all,
I come across scenario while discussiion with client that they require rebate with collection. Details of the requirement are given below:
1. SAP rebates run on billed values & set the accrual in rebate agreement on the rate what we have specified in the rebate agreement. Requirement is that, If i have billed on 1000$ & my accrual value is 100$ with the rate of 10%. If i collected 800$ instead of 1000$, then i need to pay the accrual on the basis of 800$ not on the basis of 1000$. It means i have to adjust accrual amount on the basis of 800$. Conclusion is that i have to pay not 100$ accrual instead less then 100$ on the basis of 800$ which i collected.
2. In month 1 have billed on 5000$, my accrual amount is 500$ with rate of 10%. In the 2nd month i have to bill 1000$ and i have given an discount of 500$, it means my billed value is 500$ and my accrual amount is 50$@10%. In month 3 again i billed 500$ and my accrual amount is 50$@10%.
Requirement is that, when i am going to pay the accrual to client, i should pay correct accrual for which he is entitled for. Means i should pay 100$ accrual not 600$ because i have already given an discount of 500$. Discount which i have given already of 500$ should need to be offest with the first month accrual of 500$. So remaning accrual is 100$.
Great if somebody can help me out for the solutioning of the above requirements.

Thanks Ivano,
Somebody has started the conversation.
Let me put my questions again.
This requirement is nothing to do with Payment procedure in the agreement type.
1. In any month if i billed 1000$, so my account receivable would be 1000$. My rebate for that month is 100$ at the rate of 10%. During customer receipt if i collected against my invoice 900$ instead of 1000$, my accrual needs to be corrected 90$ instead of 100$.
I know this can not be fullfilled by standard SAP, by any thoughts on this welcomed.
2. I know Rebate can be settled partially or full settlement by payment method( by cheque, bank transfer, or by credit memo) we have configure in rebate agreement type. But here requirement is totally different.
Here, i need to pay the Rebate as a Discount instead of by cheque or by credit memo. While doing the partial or full settlement system will take into account collected accrual up to that day & apply as a discount to the final bill.
Scenario is like that sometimes customer asked to give us the discount on bill for whatever they accrued so far.
This is again cannot solved by standard SAP, but any thought by any body welcome. We have already thought that we need to enhance the solution.
Solution needed urgently.

Help Needed Urgently- Deadline Approaching

I have developed a CD ROM, and it was working ok up til now.
When I go to play the projector file now, it sometimes runs out of
virtual memory, saying flash is low on memory. to increase
available memory quit flash and allocate more memory in the system
properties dialogue box.
Can somebody please tell me, is this that my computer hasn't
enough RAM or is there a properties menu i can't see?
the program is only 5.38MB so I can't see why there would be
a problem. there are quite a few videos in it, but the problems
don't occurr when I go to use the videos and they are streamed from
outside the projector so memory should only be used when they are
called on?
The frames it happens on are purely text, with an image, no
videos or major coding. It happens with three buttons that i can
see

I hope this helps. I had a similar problem when using scenes.
If you have a screen with more than one frame in a layer that
is recursive (no stop), it will just continue to loop around and
around, even though not necessarily visible to the user. I recall
that if the cycle goes more than a certain amount -- 256 loops(?)
-- Flash stops the program and gives that error.
Some of the experts here can (hopefully) provide the real
technical reason why this happens. But, I was able to fix it by
making sure that I did not have any recursive loops in any scene.
I hope this starts a thread of discussion with experts,
because I am pretty sure this the issue. You may also search for
resolutions using this principle as your search criteria. That is
how I found my solution.
r

Unable to allocate 27160 bytes.........Help needed urgently

hi
in my production database in getting this error..
ORA-04031: unable to allocate 27160 bytes of shared memory ("shared
pool","unknown object","sga heap(1,0)","session param values")
help needed urgently

If you have a program that does not use bind variables you can get this error.
In such cases you do not want to increase the size of the shared pool, but reduce it, and flush regularly. This is a bug in the application and should be fixed to use bind variables.
Another possible workaround is setting cursor_sharing = force, but this can cause other problems, so should only be used as a last resort. If the apps connections can be distinguished by user account or machine, then a log on trigger could be set cursor_sharing just for that application, to limit the damage until the vendor can fix it.

Html to wml conversion help needed urgently

Hello everybody,
I need static HTML to WML code urgently as soon as possible.
Can please somebody help.
Moreover, how to discard the tags in HTML which are not in WML.The problem is that few tags are not mandatory to close.So, what should be the rule of discarding tags?
Please help!!!!
iwapsms

http://www.google.co.uk/search?q=html+2+wml&start=0&ie=utf-8&oe=utf-8

Java Progrramming HELP, Needed Urgently, T hanks

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,

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).

Need to reinstall Acrobat XI - cloud says it's installed - help needed urgently!

i am using osx / adobe creative cloud.
needed to deinstall acrobat XI. did it with app cleaner by mistake.
now acc tells me it is installed and i can not reinstall it again.
help urgently needed!
PROBLEM SOLVED
go to applications/utilities/adobe installers/acrobat XI deinstall (in my case)

Hi rbt_11,
Please go to
Applications --> Utilities --> Adobe Installers and check if you have any uninstaller for Acrobat XI.
Incase if you find the uninstaller then run that and uninstall the remnants of this software.
Thanks
Kapil

Help needed to run a power Mac ap on Intel Mac.

Hi, I have a Davis Vantage Pro weather station that ran happily on my old Quicksilver Power Mac. Now I have upgraded to a Mac pro machine running Tiger, the 'Weatherlink' software won't work. Davis, a main player in scientific technologies have not upgraded their Mac software (unbelievably!)
Will Rosetta help here? .... or do I need to get a P.C?
Hope someone can advise.
Thanks
Lunasa

PPC apps run transparently on Intel Macs, however, in your case it may be a matter of incompatibility. The software is simply not compatible with the current versions of OS X. This has nothing to do with Rosetta. You would have the same problem on your QuickSilver were you to upgrade to Tiger.
If you transferred the software using Migration Assistant, then try reinstalling the software on the Intel Mac (but first be sure you fully uninstall the transferred app.)

Help neede urgently(Problem in adding exponential numbers)

Hi,
Actually i want to add the contents of two files which contains exponential numbers.
i'm not able to add these numbers. Can any one help me?
import java.io.*;
import java.nio.*;
class userFile
     public static void main(String[] args) throws IOException
          try
               BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
          String s1,s2,s3;
          FileReader fr1,fr2;
          System.out.println("Enter first file :");
          s1=br.readLine();
          System.out.println("Enter second file :");
          s2=br.readLine();
          System.out.println("Enter new file :");
          s3=br.readLine();
          fr1= new FileReader(s1);
          fr2= new FileReader(s2);
          BufferedReader fin1=new BufferedReader(fr1);
          BufferedReader fin2=new BufferedReader(fr2);
          String str1,str2,str3;
          double i1,i2,i3;
          OutputStream fout=new FileOutputStream(s3);
          while((str1=fin1.readLine()) != null)
               while((str2=fin2.readLine()) != null)
               i1=Float.parseFloat(str1);
               System.out.println(i1);
               i2=Float.parseFloat(str2);
               System.out.println(i2);
               i3=i1+i2;
               System.out.println("i3=" +i3);
               str3 = Float.toString(i3);
               byte buf[]=str3.getBytes();
               fout.write(buf);
               fout.write('\n');
          catch(NumberFormatException e)
               System.out.println(e);
}I need help urgently.
Thanks in advance.

By "exponential number, do you mean one in scientific notation (eg. -1.55743e21) or what?
What do your files look like?
What problem are you encountering? Is an exception being thrown? If so, give us the exact message (copy/paste). Is the results simply not what was expected? If so, give us the input, the expected results and the actual results for us to compare and consider.
Chuck

New motherboard faulty boot help needed urgently

So i just baught my new amd athlon 64 3000 +with a msi k8mm3 mainboared. when i finshed installing it and booted it up it detects both hard drives and all the memory. then it says "loading dmi pool .........." then the maxtor drive overlay splash appears. after that it goes to where you can select to start in safe mode and what ever you select it loads for a second and then restarts and does the same thing again. i've tried changing the power supply, leads, reset the cmos and unplugged all unnessery equipment but it still does it. any help will be appreciated.
here's my spec
HD (1) western digital 40gb (windows xp home OS installed)
HD (2) maxtor 200gb
ATI radeon 9600xt 256mb graphics card
350 watt power supply
cd rom
floppy

If this is a current system in where you had Windows installed and you just replaced those parts, then you will have to do a repair/install of windows due to different chipset drivers and whatnot. This might prevent you from having to do a complete format/re-install. Otherwise you might have to completely format your system. No other way around it.

Help needed urgently with cc

i cannot download and open ccfiles on windows 7 premium, im a mature student struggling to get a library of tutorials together to look back on, but cc keeps stopping i cant download update or get new apps, i pay monthly and i'm getting nowhere even after 12 mths i've no library. files are empty and my photoshop never seems to work correctly. If i cant get this sorted in some way i will be giving up the ghost, ive had enough of struggling with what is supposed to be so easy to do, my confidence as now reached rock bottom.
If theres anyone out there that can help, in plain english as i'm no expert. Please! you are most wellcome to talk as much as you want, i will be eternally gratefull....Norma R

This is an open forum with a mix of program users and Adobe staff, not Adobe support... you need Adobe support
Adobe contact information - http://helpx.adobe.com/contact.html may help
-Select your product and what you need help with
-Click on the blue box "Still need help? Contact us"

Help needed urgently -Had a power (electricity) failure at re-installation

Similar Messages

Maybe you are looking for