Unlimited Digit-Number ADT
$30-5000 USD
Paid on delivery
Develop an ADT with the following operations for unlimited-digit numbers. In the following descriptions, number refers to a linked list of digits, and M, N and O are all numbers.
Increment: A method that increases the value of the number by 1. Sample usage: [url removed, login to view]();
You should allow for three possibilities in the function regarding the initial value of N.
a. N is NULL
b. N is not Null, and the value is between 0 and 8.
c. N is not Null, and the value is 9.
Copy: A method that copies one number to another. Create copies of each node in the original. Sample usage: [url removed, login to view](M);
Sum: A method that takes two numbers and sums them. Sample usage: [url removed, login to view](M); (adds M to N)
DisplayNumber: A method that displays its argument (a number) in standard (most-significant digit first) form. Sample usage: [url removed, login to view]();
The nodes are of the following type:
struct digit
{ int Value; // a digit value, 0-9
digit* Next;
};
typedef digit* number;
The ADT should be a C++ class, with all functions and data declared in the appropriate sections. You may use recursion if you wish. Include a short program that adequately tests all the procedures in the ADT.
## Deliverables
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Complete ownership and distribution copyrights to all work purchased.
## Platform
Visual C++
## Deadline information
Must be completed by 11/13/2002.
Project ID: #2881176