Concluído

Unlimited Digit-Number ADT

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.

Habilidades: Programação C, Engenharia, MySQL, PHP, Arquitetura de software, Teste de Software

Veja mais: struct c programming, recursion programming, recursion in programming, recursion function, programming recursion, programming number, number programming, number function, node programming, n is a number, linked int, function number, c programming typedef, c programming struct, c programming linked list, argument programming, adt programming, programming tests, unlimited, m@sum

Acerca do Empregador:
( 5 comentários ) United States

ID do Projeto: #2881176

Concedido a:

idleswell

See private message.

$9 USD em 14 dias
(172 Comentários)
5.9

19 freelancers estão ofertando em média $20 para esse trabalho

cyclonesoftru

See private message.

$8.5 USD in 14 dias
(124 Comentários)
8.2
softdreamsvw

See private message.

$12.75 USD in 14 dias
(55 Comentários)
7.1
oleg21

See private message.

$29.75 USD in 14 dias
(137 Comentários)
7.0
markmangrich

See private message.

$42.5 USD in 14 dias
(11 Comentários)
5.5
sanatanvw

See private message.

$21.25 USD in 14 dias
(72 Comentários)
5.5
aprykhodko

See private message.

$12.75 USD in 14 dias
(25 Comentários)
5.3
leepwo

See private message.

$25.5 USD in 14 dias
(41 Comentários)
4.7
herculesevw

See private message.

$20.4 USD in 14 dias
(79 Comentários)
4.7
abvw

See private message.

$17 USD in 14 dias
(21 Comentários)
4.4
vw139994vw

See private message.

$11.05 USD in 14 dias
(60 Comentários)
4.5
javabeevw

See private message.

$25.5 USD in 14 dias
(18 Comentários)
3.9
balaji99

See private message.

$8.5 USD in 14 dias
(51 Comentários)
3.2
pepitovw

See private message.

$5.1 USD in 14 dias
(1 Comentário)
2.6
aktvw

See private message.

$17 USD in 14 dias
(8 Comentários)
2.0
easlern

See private message.

$17 USD in 14 dias
(1 Comentário)
0.0
ionutzvw

See private message.

$17 USD in 14 dias
(0 Comentários)
0.0
rownakhasan

See private message.

$34 USD in 14 dias
(0 Comentários)
0.0
dm682

See private message.

$42.5 USD in 14 dias
(0 Comentários)
0.0