Getting Started
After starting Eclipse, create a new project called Lab21_01. Import FindDuplicateCount.java from the assignment page (right click the file and save into the project directory).
Part 1: Create RemainderFunc.java
This program asks for two inputs from the user:
- Max number, maxnum
- Divisor, divisor
Then it displays all numbers that are multiples of divisor starting at 1 up to maxnum (inclusive) as shown in the sample runs below. You must use the remainder (%) operation for this task.
Sample Runs (user input shown in blue, with each run separated by a dashed-line):
| Please enter the max number: 10Please enter the divisor: 2Multiples of 2 between 1 and 10 (inclusive) are:246810Please enter the max number: -2Invalid input. Please enter a valid max number (>= 0): -8Invalid input. Please enter a valid max number (>= 0): 10Please enter the divisor: 3Multiples of 3 between 1 and 10 (inclusive) are:369Please enter the max number: 8Please enter the divisor: -2Invalid input. Please enter a valid divisor (> 0): 0Invalid input. Please enter a valid divisor (> 0): -5Invalid input. Please enter a valid divisor (> 0): 10Multiples of 10 between 1 and 8 (inclusive) are:No number were found. Please enter the max number: -9Invalid input. Please enter a valid max number (>= 0): -10Invalid input. Please enter a valid max number (>= 0): 25 Please enter the divisor: 0 |
Invalid input. Please enter a valid divisor (> 0): 0
Invalid input. Please enter a valid divisor (> 0): -8 Invalid input. Please enter a valid divisor (> 0): 4 Multiples of 4 between 1 and 25 (inclusive) are:
4
8
12
16
20
24
Part 2: Fill-in FindDuplicateCount.java
You are given an integer array (arr) declared in the program. Count all the numbers that are repeated in the array entries. If there are no duplicates then your program should output should print out according to the expected output below. If there is only one duplicate then the message should state that. Finally, for two or more duplicates then the output should match the expected output. Your solution should use loops (hint: nested loops) and should work for any integer array.
Expected Output:
| There are no duplicates with value 1 beyond index 0There are 3 more occurrences of value 2 starting at index 1There are 2 more occurrences of value 2 starting at index 2There are 2 more occurrences of value 3 starting at index 3There is only 1 more occurrence of value 4 starting at index 4There is only 1 more occurrence of value 2 starting at index 5There are no duplicates with value 4 beyond index 6There is only 1 more occurrence of value 3 starting at index 7There are no duplicates with value 0 beyond index 8There are no duplicates with value 5 beyond index 9 |
| There are no duplicates with value 3 beyond index 10There are no duplicates with value 2 beyond index 11 |
Part 3: (Assessment) Logic Check
Create a Word document or text file named Part3 that contains answers to the following:
- When did you take CSE-020?
- How long did this lab take to finish?
- Any difficult topics for you in these two exercises? If so list them:
- For the array given in java, which index is the last check we need to make to count all the duplicates?
- Interpret the number 101010 in bases 2, 10, 16. For each, convert to the other two bases (for example, when interpreting as base 2, convert to bases 10 and 16; when interpreting as base 10, convert to bases 2 and 16; etc.).
Reviews
There are no reviews yet.