Em Andamento

Java B-tree manipulation

I am looking for some one to write a java application that builds a b-tree out of a set of phone numbers.

The application shall provide the following functional interfaces.

1. Add a phone number to the tree.

2. Delete a phone number from the tree.

3. The search shall be able to identify a partial match. For example, if a phone number of “408?? is added to the list, then any number beginning with “408?? submitted to the search request, shall be return a success match and action required

4. This can not be implemented a string lists.

5. Code need to be optimized for performance.

6. A stand alone test program is required that demonstrate the above functionality, preferable an interactive command line interface to the test program.

7. The source code for the test program and the search algorithm need to be delivered

## Deliverables

I am looking for some one to write a java application that builds a b-tree out of a set of phone numbers.

The application shall provide the following functional interfaces.

1. Add a phone number to the tree. The phone number to be added will be passed a java String and a separate action with it. The action will be an integer value. The Java string passed can be of varying lengths. You need to parse the string into individual numbers before adding to the list.

2. Delete a phone number from the tree. The phone number to be deleted will be passed a java String. You need to parse the string into individual numbers before adding to the list.

3. Search the tree. A java string representing the phone number will be passed. The application shall search the tree for a match and returns the status and the action that was initially passed. You need to parse the string into individual numbers before adding to the list.

4. The search shall be able to identify a partial match. For example, if a phone number of “408?? is added to the list, then any number beginning with “408?? submitted to the search request, shall be return a success match and action required. If no match, return the false and the action will be ignored. Another example, if a phone number of “8?? is added to the list, then any number beginning with “8?? submitted to the search request, shall be return a success match and action required. If no match, return the false and the action will be ignored.

5. This can not be implemented a string lists.

6. Code need to be optimized for performance.

7. A stand alone test program is required that demonstrate the above functionality, preferable an interactive command line interface to the test program.

8. The source code for the test program and the search algorithm need to be delivered

Habilidades: Engenharia, Java, MySQL, PHP, Gestão de projetos, Arquitetura de software, Teste de Software

Ver mais: string source code java, string search algorithm c, string search algorithm, string match algorithm, string match, string manipulation c, string b, string algorithm, search a tree, search algorithm example, program algorithm example, php parse tree, match string, match 3 algorithm, line algorithm, java command line application, beginning algorithm, a search algorithm example, algorithm string, algorithm for tree, algorithm b, command line program tree, a b, the tree, parse a string

Acerca do Empregador:
( 19 comentários ) San Francisco, United States

ID do Projeto: #3035810

Premiar a:

sdgenterprises

See private message.

$85 USD em 14 dias
(6 Avaliações)
2.9

6 freelancers estão ofertando em média $85 para este trabalho

TopOfStack

See private message.

$85 USD in 14 dias
(174 Comentários)
7.1
TaylorSmallwood

See private message.

$85 USD in 14 dias
(12 Comentários)
4.9
rogersilverstone

See private message.

$85 USD in 14 dias
(124 Comentários)
4.9
dayaranjanie

See private message.

$85 USD in 14 dias
(6 Comentários)
3.5
zenithtechp

See private message.

$85 USD in 14 dias
(6 Comentários)
3.3