Implement a program that prompts the user to enter two positive numbers as formatted below Enter num1:Enter num2:Input validation MUST be completedinput must be all digitsinput must be a positive number,Integer Overflow for the individual inputs and the sum of the inputs is now VALID and needs to be handled as described below with the ADDITION ALGORITHM.If NOT valid (non-digits or negative) then re-prompt as formatted below INVALID RE-Enter num3 incorrect inputs in a row and stop program. This is the 3 strikes and you're out rule. PROGRAM ABORTADDITION ALGORITHThe input CANNOT be converted to a true int, unsigned int, long, unsigned long or long long data typeThe solution is to use an array to store each individual digit of the numberFor example, the inputted number: "1234" could be stored in the array nums backwards, so the ones position is at index 0 of the array. 4 = 10^0 (ones position) so that nums[0] = 43 = 10^1 (tens position) so that nums[1] = 32 = 10^2 (hundreds position) so that nums[2] = 21 = 10^3 (thousands position) so that nums[3] = 1The program will perform the addition operation by implementing the usual paper-and-pencil addition algorithm (adding the ones digits and if greater than 10, then carry the 1 to the tens position, etc)Add starting with ones digits and carry the 1 if 10 or over. For the below example the following steps are completedsum[0] = 5+6+0(no carry over) =11 store the 1 and carry the 1 to the next index.sum[1] = 4+7+1(carry over)=12 store the 2 and carry the 1 to the next index.sum[2] = 3+8+1(carry over) = 12 store the 2 and carry the 1 to the next index.sum[3] = 2+9+1(carry over) = 12 store the 2 and carry the 1 to the next index.sum[4] = 1+0+1(carry over) = 2 store the 2Reverse the sum array to get the answer. The ones place at index 0, should be written as the right most value.Answer: 22221Outputs the sum of the two positive integers when input is valid as formatted below in the example test runs.Make sure to follow the Grading Rubric and Academic Integrity guidelines outlined in the syllabus.Expected Program Output:Test Run #1Enter num1: 12345Enter num2: 9876 12345+ 9876---------- 22221Test Run #2 Enter num1: 378Enter num2: 16429 378+ 16429----------- 16807 Test Run #3Enter num1: -378INVALID RE-Enter num1: abcINVALID RE-Enter num1: 18446744073709551616 Enter num2: 16abcINVALID RE-Enter num2: -16INVALID RE-Enter num2: 18446744073709551616 18446744073709551616+ 18446744073709551616 ----------------------------------- 36893488147419103232 Test Run #4Enter num1: -378INVALID RE-Enter num1: abcINVALID RE-Enter num1: 18446744073709551614 Enter num2: 16abcINVALID RE-Enter num2: -16INVALID RE-Enter num2: -2 PROGRAM ABORT Test Run #5 Enter num1: -378INVALID RE-Enter num1: abcINVALID RE-Enter num1: 18446744073709551619 Enter num2: 16abcINVALID RE-Enter num2: -16INVALID RE-Enter num2: 1 18446744073709551619+ 1------------------------------------ 18446744073709551620 Test Run #6 Enter num1: 111213141516171819Enter num2: 2132435465768798 111213141516171819+ 2132435465768798--------------------------------- 113345576981940617

Dear Student, As no programming language is mentioned, I am assuming it to be Java.

Answered: ll digits input must be a p

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Implement a program that prompts the user to enter two positive numbers as formatted below

Enter num1:

Enter num2:
- Input validation MUST be completed
  - input must be all digits
  - input must be a positive number,
- Integer Overflow for the individual inputs and the sum of the inputs is now VALID and needs to be handled as described below with the ADDITION ALGORITHM.
- If NOT valid (non-digits or negative) then re-prompt as formatted below
  
  INVALID RE-Enter num
  - 3 incorrect inputs in a row and stop program. This is the 3 strikes and you're out rule.
  PROGRAM ABORT
  - ADDITION ALGORITH
    
    The input CANNOT be converted to a true int, unsigned int, long, unsigned long or long long data type
    
    The solution is to use an array to store each individual digit of the number
    
    For example, the inputted number: "1234" could be stored in the array nums backwards, so the ones position is at index 0 of the array.
    
    4 = 10^0 (ones position) so that nums[0] = 4
    
    3 = 10^1 (tens position) so that nums[1] = 3
    
    2 = 10^2 (hundreds position) so that nums[2] = 2
    
    1 = 10^3 (thousands position) so that nums[3] = 1
    
    The program will perform the addition operation by implementing the usual paper-and-pencil addition algorithm (adding the ones digits and if greater than 10, then carry the 1 to the tens position, etc)
    
    Add starting with ones digits and carry the 1 if 10 or over. For the below example the following steps are completed
    
    sum[0] = 5+6+0(no carry over) =11 store the 1 and carry the 1 to the next index.
    
    sum[1] = 4+7+1(carry over)=12 store the 2 and carry the 1 to the next index.
    
    sum[2] = 3+8+1(carry over) = 12 store the 2 and carry the 1 to the next index.
    
    sum[3] = 2+9+1(carry over) = 12 store the 2 and carry the 1 to the next index.
    
    sum[4] = 1+0+1(carry over) = 2 store the 2
    
    Reverse the sum array to get the answer. The ones place at index 0, should be written as the right most value.
    
    Answer: 22221
  1. Outputs the sum of the two positive integers when input is valid as formatted below in the example test runs.
  2. Make sure to follow the Grading Rubric and Academic Integrity guidelines outlined in the syllabus.
  Expected Program Output:
  
  Test Run #1
  
  Enter num1: 12345
  
  Enter num2: 9876
  
  12345
  + 9876
  ----------
  22221
  
  Test Run #2
  
  Enter num1: 378
  
  Enter num2: 16429
  
  378
  
  + 16429
  
  -----------
  
  16807
  
  Test Run #3
  
  Enter num1: -378
  
  INVALID RE-Enter num1: abc
  
  INVALID RE-Enter num1: 18446744073709551616
  
  Enter num2: 16abc
  
  INVALID RE-Enter num2: -16
  
  INVALID RE-Enter num2: 18446744073709551616
  
  18446744073709551616
  
  + 18446744073709551616
  
  -----------------------------------
  
  36893488147419103232
  
  Test Run #4
  
  Enter num1: -378
  
  INVALID RE-Enter num1: abc
  
  INVALID RE-Enter num1: 18446744073709551614
  
  Enter num2: 16abc
  
  INVALID RE-Enter num2: -16
  
  INVALID RE-Enter num2: -2
  
  PROGRAM ABORT
  
  Test Run #5
  
  Enter num1: -378
  
  INVALID RE-Enter num1: abc
  
  INVALID RE-Enter num1: 18446744073709551619
  
  Enter num2: 16abc
  
  INVALID RE-Enter num2: -16
  
  INVALID RE-Enter num2: 1
  
  18446744073709551619
  
  + 1
  
  ------------------------------------
  
  18446744073709551620
  
  Test Run #6
  
  Enter num1: 111213141516171819
  
  Enter num2: 2132435465768798
  
  111213141516171819
  
  + 2132435465768798
  
  ---------------------------------
  
  113345576981940617

Expert Solution

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Follow-up Questions

Read through expert solutions to related follow-up questions below.

Follow-up Question

Apologies, Can you have this written in C++ THANK YOU

Solution

by Bartleby Expert

SEE SOLUTION

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.