data structures and algorithms, Java

1. Assess how the choice of data structures and algorithm design methods impacts the performance of programs.

 Write programs using object-oriented design principles.

 Solve problems using data structures such as linear lists, stacks, queues, hash tables, binary trees, heaps and binary search trees

.  Solve problems using algorithm design methods such as the greedy method, divide and conquer, dynamic programming and backtracking.

Download the zip file containing an Eclipse project. Implement your solutions to the problems below in the Eclipse project. The project also contains unit tests which you should use to test your work.

1. Hashtable. Complete the implementation of the hashtable in the class When a new Hashtable is created, the array should be initialised with a size which is the smallest prime number larger than or equal to the requested initial capacity. The default probe type should be LINEAR_PROBE. Store objects in the array using the Pair class to store both key and value. When storing a new key/value pair, use the findEmpty method to find an unoccupied location starting the search at the value found by hashing the key and with a stepNum of zero. If this position is occupied, use the getNextLocation method (which is implemented for Version 2 – 16 Oct 12 you) to find the next location to search based on the probe type being used, and call findEmpty again with the new location. You will also need to use the getNextLocation method when implementing find, which searches for an existing value – again, start the search at the value calculated by hashing the key. If there is no Pair object at that location, the key was not found. If there is a Pair object at that location then either its key matches the one we're looking for, in which case return the value associated with the Pair, or it doesn't match. If it doesn't match, we need to find the next location to search using getNextLocation, and call find again with this new value.

2. Complexity. Using a multi-line comment at the top of the Hashtable class, describe the complexity of the get and put methods in your implementation, include the best, worst and average-case scenarios. What happens to the complexity as the load factor increases, and what would the worst-case complexity be if the load factor were increased to 1.0?

Habilidades: Algoritmos, Java, Arquitectura de software

Ver más: tree algorithms in data structures, sorting algorithms in data structures with examples, sorting algorithms in data structures, quick sorting algorithms in data structures, problem solving with algorithms and data structures, list of sorting algorithms in data structures, introduction to algorithms and data structures, good book on algorithms and data structures, c algorithms and data structures, best book for algorithms and data structures in c, algorithms and data structures tutorial, algorithms and data structures in c, algorithms and data structures for dummies, algorithms and data structures for beginners, java projects using data structures

Información del empleador:
( 2 comentarios ) london, United Kingdom

Nº del proyecto: #12747055

Adjudicado a:


HI Contact me for an efficient, perfect, well documented development of your project according to 100% accuracy and requirements, with dedicated support. Thanks Farah Saif

£25 GBP en 1 día
(217 comentarios)

12 freelancers están ofertando el promedio de £83 para este trabajo


need an A grade? contact me.

£88 GBP en 1 día
(82 comentarios)

My Degree is MS Computer Software Engineering. I teach Data structure and Algorithm. I have Excellent concepts linked lists, pointers, Trees, Binary Trees, stack and queues, FIFO, LIFO, recursion Graphs, Complexity an Más

£92 GBP en 4 días
(91 comentarios)

Hello My name is Ahmed, i'm a top rated freelancer. i worked over 100 projects and over 250 hours doing java projects. plus i passed freelancer java v3 exam with score 3.75 plus i got 2 java certificate 1Z0-803 and 1Z Más

£50 GBP en 3 días
(305 comentarios)
£60 GBP en 1 día
(44 comentarios)
£166 GBP en 1 día
(9 comentarios)
£33 GBP en 1 día
(17 comentarios)
£200 GBP en 1 día
(2 comentarios)

Dear Sir, I carefully read your specifications and can help you in your project. It seems to be a quite standard academic assingment assignment. My bid covers code and unit tests as required. I can run this task acc Más

£100 GBP en 4 días
(6 comentarios)

Hi, I am an experienced java developer. I am very good in data structures and algorithms. I would complete the task in the given time. I would love to work with you and I hope you would love the work I'll do for you. T Más

£60 GBP en 1 día
(1 comentario)

Haven read the job description carefully, I assure you that I can get the project done and delivered on time even within the stipulated budget. As an experienced mathematician, I have been able to fix problems pertaini Más

£10 GBP en 1 día
(0 comentarios)

A proposal has not yet been provided

£111 GBP en 5 días
(0 comentarios)