Verified Document

Algorithm, There Is A Need Term Paper

Compared to other associative array data structures, hash tables are most useful when a large number of records of data are to be stored.

The hash table size is unlimited (or limited only by available storage space). In this case no need to expand the table and recreate a hash function.

Disadvantages

It's difficult (not efficient) to print all elements in hash table.

It's not efficient to find minimum element or maximum element.

The hash table has fixed size. At some point all the elements in the array will be filled. The only alternative at that point is to expand the table, which means modify the hash function to accommodate the increased address space.

Hash table are more difficult and error-prone to write and use.

Hash tables in general exhibit poor locality of reference that is, the data to be accessed is distributed seemingly at random in memory. Because hash tables cause access patterns that jump around, this can be trigger microprocessor cache misses that cause long delays.

References

Augenstein Moshe J., Yedidyah, Langsam, and Aaron Tenenbaum. "Introduction to Data

Structures." Data Structures using C. And C++. United State of America: Prentice-Hall, Inc., 1996.22-24.

Carlson, David. "Hash Tables." Saint Vincent College. 2004. Saint Vincent College. 6 July 2005 http://cis.stvincent.edu/swd/hash/hash.html.

"Trees." Data Structures and Others Objects using C++.
Ed. Susan Hartman. Canada: Addison Wesley Longman, 1997. 424-429.

Parlante, Nick. "Binary Trees." cslibrary.stanford.edu. cslibrary.stanford.edu. 6 July 2005 http://cslibrary.stanford.edu/110/BinaryTrees.html.

Shahidi, Amin, and Dennis Schmidt. "Lecture 10 March 20, 2002." www.sis.pitt.edu.6 July 2005 http://www.sis.pitt.edu/~klynch/Spring2002/lecture10/Lecture10_032002.htm#_Linked_List_Pros.

Algorithmic efficiency - Wikipedia, the free encyclopedia." Wikipedia. 2005. Wikipedia. 6 July 2005 http://en.wikipedia.org/wiki/Algorithmic_efficiency.

Big O. notation - Wikipedia, the free encyclopedia." Wikipedia. 2005. Wikipedia. 6 July 2005 http://en.wikipedia.org/wiki/Big_O_notation.

Programming Tutorial: Linked Lists, Trees, Hash Tables." vergil.chemistry.gatech.edu. 2001.

The Sherill Group. 6 July 2005 http://vergil.chemistry.gatech.edu/resources/programming/c-tutorial/lists.html.

Linked list - Wikipedia, the free encyclopedia." Wikipedia. 2005. Wikipedia. 6 July 2005 http://en.wikipedia.org/wiki/Linked_list.

Run time." National Institute of Standard and Technology. 2005. National Institute of Standard and Technology. 6 July 2005 http://www.nist.gov/dads/HTML/runtime.html.

Sources used in this document:
References

Augenstein Moshe J., Yedidyah, Langsam, and Aaron Tenenbaum. "Introduction to Data

Structures." Data Structures using C. And C++. United State of America: Prentice-Hall, Inc., 1996.22-24.

Carlson, David. "Hash Tables." Saint Vincent College. 2004. Saint Vincent College. 6 July 2005 http://cis.stvincent.edu/swd/hash/hash.html.

Main, Michael, and Walter Savitch. "Trees." Data Structures and Others Objects using C++.
Parlante, Nick. "Binary Trees." cslibrary.stanford.edu. cslibrary.stanford.edu. 6 July 2005 http://cslibrary.stanford.edu/110/BinaryTrees.html.
Shahidi, Amin, and Dennis Schmidt. "Lecture 10 March 20, 2002." www.sis.pitt.edu.6 July 2005 http://www.sis.pitt.edu/~klynch/Spring2002/lecture10/Lecture10_032002.htm#_Linked_List_Pros.
Algorithmic efficiency - Wikipedia, the free encyclopedia." Wikipedia. 2005. Wikipedia. 6 July 2005 http://en.wikipedia.org/wiki/Algorithmic_efficiency.
Big O. notation - Wikipedia, the free encyclopedia." Wikipedia. 2005. Wikipedia. 6 July 2005 http://en.wikipedia.org/wiki/Big_O_notation.
The Sherill Group. 6 July 2005 http://vergil.chemistry.gatech.edu/resources/programming/c-tutorial/lists.html.
Linked list - Wikipedia, the free encyclopedia." Wikipedia. 2005. Wikipedia. 6 July 2005 http://en.wikipedia.org/wiki/Linked_list.
Run time." National Institute of Standard and Technology. 2005. National Institute of Standard and Technology. 6 July 2005 http://www.nist.gov/dads/HTML/runtime.html.
Cite this Document:
Copy Bibliography Citation

Related Documents

Algorithm Is a Computable Set of Steps
Words: 1393 Length: 5 Document Type: Essay

Algorithm is a computable set of steps arranged thus in order to achieve a certain end. There are various algorithms used in bioinformatics and not all are necessarily deterministic. Some are in fact known as randomized algorithms that incorporate randomness. Classification of algorithms in Bioinformatics Classification by purpose Each algorithm has a goal. The Quick Sort algorithm for instance sorts data in ascending or descending order, but algorithms in bioinformatics are grouped by

Algorithm and Visual Basic Programming
Words: 404 Length: 2 Document Type:

Visual Basic Programming and Algorithm Solution to Chapter 5 Exercise Code of Net Pay Project ' Purpose: To display Net Pay ' Programmer: on Public Class Form1 Private Sub-Label1_Click (ByVal sender As System.Object, ByVal e As System.EventArgs) Handles Label1.Click End Sub Private Sub-Form1_Load (ByVal sender As System.Object, ByVal e As System.EventArgs) Handles MyBase.Load End Sub Private Sub-Label2_Click (ByVal sender As System.Object, ByVal e As System.EventArgs) Handles Label2.Click End Sub Private Sub-Button1_Click (ByVal sender As System.Object, ByVal e As System.EventArgs)

Visual Basic Programming and Algorithm
Words: 931 Length: 3 Document Type:

Algorithm and Visual Basic Programming Jerry Feingold is the owners of a small restaurant who intends to develop a program that will assist him calculating the total amount used to tip a waiter at the restaurant. The program is designed to deduct any liquor charge from the overall total bill, followed by calculating the tip by using a percentage of the remainder. Finally, the program should be designed to display the

RSA Public-Key Algorithm As Cited in Kaufman,
Words: 461 Length: 1 Document Type: Term Paper

RSA Public-Key Algorithm As cited in Kaufman, Perlman & Speciner the security features inherent to an RSA public-key algorithm depends on the difficulty that an attacker has in factoring very large, preferably prime numbers. One specific example of an RSA might be as follows: "Step 1: Choose two very large primes" usually by using random number generation, such as "simple e.g., P=47, Q=71 and set N = P*Q = 3337 and

String Matching Algorithm String Searching
Words: 1884 Length: 6 Document Type: Research Paper

Future Considerations The most recent developments are focused on pattern matching where not only are issues such as string and alpha numerals sought for and matched, but also more complicated patterns such as trees, graphs, arrays, and point sets. The objective, here, is to find non-trivial properties and then from these perform closely matching combinatorial patterns. Much research is being performed on this, and the area has progressed from being simply algorithmic

Heuristic Decision Making Versus Algorithm Decision Making
Words: 774 Length: 2 Document Type: Research Paper

Heuristic Decision Making Heuristics are useful cognitive processes, unconscious or conscious, that ignore some of the information. Because the utilization of heuristics do not involve so much effort, the classical perspective has been that, decisions made from such processes, result in greater errors than do "rational" decisions that are based on statistical or logical models. However, numerous decisions do not meet rational model assumptions, and it is often an empirical issue

Sign Up for Unlimited Study Help

Our semester plans gives you unlimited, unrestricted access to our entire library of resources —writing tools, guides, example essays, tutorials, class notes, and more.

Get Started Now