Write a method that does a reverse lookup

Assignment Help Basic Computer Science
Reference no: EM131313335

Rewrite Exercise 2 using the SortedList class.

Exercise 2

Write a program that stores names and phone numbers from a text file in a dictionary, with the name being the key. Write a method that does a reverse lookup, that is, finds a name given a phone number. Write a Windows application to test your implementation.

Reference no: EM131313335

What is the difference in time

Using a small array (less than 20 elements), compare the sorting times between the insertion sort and QuickSort. What is the difference in time? Can you explain why this dif

Write findmin and findmax methods for the avltree class

Using the Timing class, compare the times for the methods implemented in Exercise 1 to the same methods in the BinarySearchTree class. Your test program should insert a sort

What is the ranking of the algorithms

To perform the tests, create a randomly generated array of 1,000 elements. What is the ranking of the algorithms? What happens when you increase the array size to 10,000 ele

Create a new hash class that uses an arraylist

Using the Hashtable class, write a spelling-checker program that reads through a text file and checks for spelling errors. You will, of course, have to limit your dictionary

Determine the number of the last person left in the circle

Write a program that allows you to place n people in a circle and specify that every mth person will be killed. The program should determine the number of the last person le

Display a list of each of the integers

Write a program that generates 10,000 random integers in the range of 0-9 and stores them in a binary search tree. Using one of the algorithms discussed in this chapter, dis

Display all the words in the file

Write a program that generates 10,000 random integers in the range of 0-9 and stores them in a binary search tree. Using one of the algorithms discussed in this chapter, dis

Bit array implementation

Both implementations should use the same sets. Using the Timing class, compare the major operations (union, intersection, difference, and subset) of each implementation and

Reviews

Write a Review

 
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd