Problem Set 10: Credit Card

Task Outline

• Due Date: Monday, November 25, 2019
• Total Points: 10
• Implement a Java program that determines whether a provided credit card number is valid, according to Luhn's algorithm.

Background Theory

• Every credit card has a number, both printed on its face, and embedded in the magnetic stripe on its back. That number is also stored in a database somewhere, so that when your card is used to buy something, the creditor knows whom to bill.
• There are many people with credit cards in this world, so those numbers are pretty long:
  • American Express: 15-digit numbers
  • MasterCard: 16-digit numbers
  • Visa: 13- and 16-digit numbers
• Credit cards companies don't just assign a random series of digits to compose their credit card numbers. Rather, there is actually some structure to them:
  • American Express numbers must start with 34 or 37.
  • MasterCard numbers must start with 51, 52, 53, 54 or 55.
  • Visa numbers must start with 4.
• Credit card numbers also have a checksum built into them, which is a mathematical relationship between at least one number, and the others. This checksum enables computers to detect errors and fraudulent credit card numbers, without having to query a database, which can be slow.
• Credit card companies use an algorithm developed by Hans Peter Luhn, a researcher from IBM.
• According to Luhn's algorithm, you can determine if a credit card is valid by executing the following steps:
  1. Multiply every other digit by 2, starting with the number's second-to-last digit, and then add those products' digits together.
  2. Take this result, and add it to the sum of the digits that weren't multiplied by 2.
  3. If the total's last digit is 0, then that credit card number is valid.

Example Case

• Consider an example of Luhn's algorithm with the following American Express number: 378282246310005
• For the sake of clarity, I have underlined every other digit, starting with the number's second-to-last digit:

• Then, multiply each of the underlined digits(highlighted in bold) by 2:

• The partial products are as follows:

• Next, add those products' digits(Note: not the products themselves) together:

• Now, add the result of 27 to the sum of the digits in the credit card number that weren't multiplied by 2:

• Notice that the last digit in the result of 60 is a 0, so the credit card number is legitimate.

Hints

• Note that the credit card number is being brought into the function as a String. This means that you will have to use the substring() method throughout your program, to separate out the individual digits.
• You will have to convert between String values and integers. Use the Integer.parseInt() function to perform this conversion, as follows:

String sample = "123";
int num = Integer.parseInt(sample);

• Luhn's algorithm clearly specifies that you must sum the digits starting from the second-to-last digit. Does this mean that you have to perform a reverse loop? Not necessarily. Think about what happens when a credit card has an odd quantity of digits, it means that we have to sum all of the elements located at the odd-numbered indexes:

• Now, think about what happens when a credit card has an even quantity of digits. In this case, we have to sum all of the elements located at the even-numbered indexes:

Code Distribution

Contents of pset10.zip:

PSet10CreditCard/
├── CreditCard.class
├── CreditCard.ctxt
├── CreditCard.java
├── CreditCardJUnitTest.class
├── CreditCardJUnitTest.ctxt
├── CreditCardJUnitTest.java
├── package.bluej
└── README.TXT

Specification

• Write a Java program in the file CreditCard.java which calculates the amount of radiation exposure in a given time period.
• You will write your solution in a function called validate(String digits) right below the place where it says: YOUR CODE HERE
• If the credit card number is valid, then your validate function should return a String corresponding to the specific credit card brand. These return values should be AMEX, MASTERCARD, VISA, or VALID. Otherwise, if the credit card number is not valid, then your validate function should return the String INVALID.
• When the function call validate("378282246310005") is executed, the output of the program should be: AMEX

Testing

• Click on the Run Tests button to execute the JUnit test bench. JUnit indicates a successful test with a green bar, and an unsuccessful test with a red bar.

Submission

• Upload the file CreditCard.java to the Web-CAT automated grading platform.