Algorithms

Hi,
    I was wondering if anyone knew whether the implementation of the 

hash function in a hash map is the same as in a hash table, i.e. are 

the same implementation options available for a hash map?

Also, I wonder why Hash tables were deprecated in Java 5 other than 

having multiple locks in the ConcurrentHashMap class and whether 

ConcurrentHashMap implements the same hash functions as a Hash Table.

This is likely a question for Oracle or Microsoft or for someone who has worked there.  If anyone knows, please share.


Thanks,



Saad

Your task is to develop an algorithm that would sort data such as these from least to greatest. Specifically, given an unsorted set of N decimal values, your algorithm should sort them to give an answer of the sorted data. For this set of N = 6, your algorithm should produce:

-0.12
0.53
0.98
1.36
1.92
3.18

Execute your algorithm for a different set of data, such as a subset of the given data, data you make up, or another month's climate data, such as February 2017: https://www.ncdc.noaa.gov/sotc/global-regions/201702

Does your algorithm work for any N? Have you thought of corner cases it might need to handle, such as N = 0 or N = 1?
Reply·Email·View Thread

private string CheckResponse(int mSize)
{
    //ComPort.DataReceived += SerialPortDataReceived;

    string response;
    int intBuffer;
    intBuffer = ComPort.BytesToRead;
    byte[] byteBuffer = new byte[intBuffer];
    ComPort.Read(byteBuffer, 0, intBuffer);

    response = Encoding.ASCII.GetString(byteBuffer);

    while(response.Length != mSize)
    {
        intBuffer = ComPort.BytesToRead;
        byteBuffer = new byte[intBuffer];
        ComPort.Read(byteBuffer, 0, intBuffer);
        response += Encoding.ASCII.GetString(byteBuffer);
    }

    return response;
}