separate chaining and linear probing are two implementation in hashing that we use to reduce collisions.
i know that linear probing is the fastest in general than other implemenataions .
but what i'm confused about is when the collisions are frequent,which of these implementations will allow fastest searches?
thank you
xandra
Last Activity: Feb 7 '07, 03:11 PM
Joined: Nov 7 '06
Location:
-
need help in hashing please?
-
hash function
i didn't understand what does it mean for a hash function to produce well-dispersed output, and why it is important?
thank u for ur help -
interpolation search
i understood the concept of interpolation search.
but i couldn't understand what would be the steps for that search.
for example, if i'm searching for J in this file
A A B E F H J M N N N N O P P P P P R R R R T T T Z Z Z Z Z Z Z
i know that i have to look in the begining of this file. but what is the steps to find j?
thank you for your help -
need help in sorting
there is a property in the book saying:
block sorting on P processors using butcher's sort with merging comparators can sort N records in a bout (Log p)2/ 2 parallell sort.
and i have question depending in this property asking how many parellel steps would be required to sort 100,000 records using 32 processors?
my answer was (log32) = (1.5)2 = 2.26/2 =1.132
1.132 *100000= 113273.8
is what am doing correct?... -
need help in doubly linked list
hello:
i'm not sure what the operations that would be affected if we didn't maintain a tail pointer in doubly linked list?
so why is it important?
your help is appreciated
thank you -
need help please
hello:
i didn't understand how the quicksort performance will decrease if there were too many duplicate values in the file to be sorted.
thank you for your help -
please i need help in ADT
suppose you are given the sorce code for a c++ class, and asked if the class shown is an ADT. on what factors would your decisions be based?
thanks alot for your help -
o-notation
i have another question regarding the o-notation.
how does using strings insted of simple types like integers alter the
o-notation of operations?
thanks -
breadth-first traversal
i have questions in breadth-first traversal.your help will be
appreciated.
1. what is the purpose of the queue in breath-first traversal?
2 suppose you had a function call displayAtDepthN which when given a tree
and depth would display only the nodes at that depth. explain how this
could be used to give a breadth-first traversal of the tree,and why it
would not be as efficient as one using a queue.
...
No activity results to display