| |
|
|
Buyer Summary:
|
| |
| Username: |
|
| Feedback Score: |
11
reviews
|
| Award Reliability: |
14 posted 9 paid |
| |
|
| Location: |
Shenzhen, China
|
| Member Since: |
October 4, 2007 |
| |
|
|
|
| Invited Users: |
There are no invited users
|
Description
*Purpose
This assignment emphasizes the details of programming a data structure, with careful
attention to making sure that each operation keeps the integrity of the structure. It should also
provided practice in recursion. In addition, you will demonstrate your ability to analyze the
run-time costs of your code. This is an individual assignment: each student must work
independently, and any assistance must be acknowledged in the README file.
*Task
Must write a collection class, which would be suitable to be kept in a class
library. Note: your job is to write part of a library; in this assignment you should not use a
collection class library (of course, you can still use the built-in arrays of Java, and you can use
java.util.Scanner and the classes in java.lang and java.io, such as String).
The class you write must be called RadixSearchTrie. It must have a constructor with no
arguments, to produce an object representing an empty collection. It must be part of a
package called GeneCollection; that is, the RadixSearchTrie.java file must be in a
directory called GeneCollection.
To clients, this class should appear as an implementation of the interface GCInterface. The
interface is at Page 2 of this document.
Internally, the collection class must be structured as a radix search trie. The detail explanation
of the radix search trie is included in the Appendix Section at the end of this document.
As well as the collection class and any associated classes for Nodes, you must produce a
textual file called README. This must contain a statement about the authorship of the code
you submit, including acknowledgements of all assistance you received (for example,
conversations with friends, resources you found on the web, etc). The README must also
contain a big-O running time for each method you implemented, and an answer to the
following question.
"Fred Foolish claims that the worst case scalability of the getDescription method in the radix trie is O(log n) where n is the total length of all the genes in the collection. Fred says this because the depth of a tree is approximately the logarithm of the number of nodes, and you have at most one node for each character in each gene. Show that Fred is wrong in general,and explain the errors in his argument."
*IMPORTANT*
package GeneCollection;
/*
* This interface represents the API
* suitable for an object which keeps a collection of genes, each with associated
* information. A gene is given by a String, with the special property that every
* character is A, C, G or T. In real uses, the associated information would
* be voluminous, including discoverer, literature citation, species, chromosome
* identifier, location within chromosome, purpose, date first mentioned, etc etc;
* however for this simple example we will assume the associated information
* is just a String description.
*/
public interface GCInterface {
/*
* Find the description associated with a given gene.
* If the gene is not in the collection, return null.
*/
public String findDescription(String gene);
/*
* add a new gene to the collection, with an associated description.
* Neither argument may be null. If the gene is already present in the collection,
* the new description replaces the old; otherwise the new description and gene
* are added.
*/
public void newGene(String gene, String description);
/*
* return the number of genes in the collection.
*/
public int numberOfGenes();
/*
* return the number of genes in the collection which have a given gene as prefix.
*/
public int numberOfGenes(String prefix);
/*
* remove a gene and its associated description.
* This must not be called with a null argument.
*/
public void remove(String gene);
}
Please See the Attached file for more Details
Reminder
You may not start working in this and any request before
your bid is accepted. Users who violate this policy
may have their accounts permanently suspended.
|
|
|
Kiev,
UA
location |
US$73
bid amount
|
(14
reviews)
feedback |
2 day(s)
delivery time |
|
| |
I've read it carefully. I offer good commented code according to the requirement.
Bid Time: 10-01-2008 06:24
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
Sydney,
AU
location |
US$80
bid amount
|
(No Feedback
Yet)
feedback |
3 day(s)
delivery time |
|
| |
Hi, i can do it, i have 5 year experience in JAVA, and done many times this kind of school project, it is easy for me, please check your PM, thank you.
Bid Time: 09-30-2008 03:45
|
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
Banglore,
IN
location |
US$100
bid amount
|
(No Feedback
Yet)
feedback |
5 day(s)
delivery time |
|
| |
Hi,
Please refer PMB for more details
Thanks
softid solutions
Bid Time: 09-30-2008 05:12
|
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
Coimbatore,
IN
location |
US$100
bid amount
|
(No Feedback
Yet)
feedback |
10 day(s)
delivery time |
|
| |
please view pm
Bid Time: 09-30-2008 08:31
|
|
|
|
|
| Shortlist |
| Decline Bid |
|
|
noida,
IN
location |
US$170
bid amount
|
(No Feedback
Yet)
feedback |
2 day(s)
delivery time |
|
| |
please look at pmb
Bid Time: 10-01-2008 06:26
|
|
|
|
|
|
|
|
| |
| Get the Free
Step-by-Step Guide on How to Use GetACoder |
The act of
outsourcing jobs has become easy in the past few years
thanks to GetACoder. However, our team aims at making the
whole process even easier. So, it has now come the time to
provide you with a step-by-step guidance on how to use this
service and succeed in the outsourcing world totally for
FREE.
It doesn't matter if you are a more experienced user or a
novice; using GetACoder will become even simpler with the
help of this E-book. There are two major sections: a Buyers
section and a Coders section.
Buyers will learn:
- How to outsource safely
- How to pick the best freelancers
- How to manage time and money
Coders will learn:
- How to get the best jobs
- How to secure their payments
- How to build a long-lasting relationship with buyers
...and MUCH MORE
Clear examples and pictures illustrating key situations,
great tips and real testimonies of some of our best users...
all in this Outsourcing Guide. So don't loose the
outstanding opportunity to download GetACoder FREE E-book.
|
 |
|
 GetACoder is a leading Global Services Marketplace doing business in more than 200 countries. Our unique system accelerates your time to market and provides your business with key competitive advantages. When you use GetACoder you are stretching your budget and saving as much as 60% over traditional outsourcing. GetACoder is changing business, now it's no longer about what you own or build but which resources and talent you can access. With GetACoder you reduce expenses, increase efficiencies, aggressively grow your business, and create a sustainable competitive advantage. GetACoder makes outsourcing to any part of the world an easy task! With GetACoder it's simple to outsource any business request, gain access to global talent and manage jobs online. One of the main advantages of GetACoder is the low labor cost. The typically rates are about seven times lower than the ones in the US or Europe. Posting a request at GetACoder allows the right professional or company to find you and to bid for your work. We are building a reputation for exceeding our customers' expectations and for becoming an extremely cost effective way to outsource work. Use GetACoder when you want to save money, increase efficiency or accelerate the development of your request. With GetACoder you focus on growing your business and let others do the tedious work. Post your request on GetACoder for free. Find out why people outsource jobs with us day after day. Thousands of Satisfied Customers - Submit/View Quotes
| - | We view GetACoder as an opportunity to provide a global exposure to our knowledge and experience. - | | - | This site helps us gain knowledge and even pocket money. - | | - | Yes it's good site I will learn more about this programs and I will get more knowledge. - |
|
|
| |
© 2004-2012 GetACoder. All rights reserved. |
|
