All living organisms make up the (4 points)

Show the array that results from the following sequence of key insertions using a hashing system under the given conditions: 5,

sergejj [24]

Answer:

a) Linear probing is one of the hashing technique in which we insert values into the hash table indexes based on hash value.

Hash value of key can be calculated as :

H(key) = key % size ;

Here H(key) is the index where the value of key is stored in hash table.

----------

Given,

Keys to be inserted are : 5 , 205, 406,5205, 8205 ,307

and size of the array : 100.

First key to be inserted is : 5

So, H(5) = 5%100 = 5,

So, key 5 is inserted at 5th index of hash table.

-----

Next key to inserted is : 205

So, H(205) = 205%100 = 5 (here collision happens)

Recompute hash value as follows:

H(key) =(key+i) % size here i= 1,2,3...

So, H(205) =( 205+1)%100 = 206%100 = 6

So, key 205 is inserted in the 6th index of the hash table.

----------

Next Key to be inserted : 406

H(406) = 406%100 = 6(collision occurs)

H(406) =(406+1) %100 = 407%100 = 7

So, the value 406 is inserted in 7the index of the hash table.

-----------------

Next key : 5205

H(5205) = 5205%100 = 5(collision)

So, H(5205) = (5205+1)%100 = 6( again collision)

So, H(5205) = 5205+2)%100 = 7(again collision)

So, H(5205) = (5205+3)%100 = 8 ( no collision)

So, value 5205 is inserted at 8th index of the hash table.

-------------

Similarly 8205 is inserted at 9th index of the hash table because , we have collisions from 5th to 8th indexes.

-------------

Next key value is : 307

H(307) = 307%100 = 7(collision)

So, (307+3)%100 = 310%100 = 10(no collision)

So, 307 is inserted at 10th index of the hash table.

So, hash table will look like this:

Key index

5 5

205 6

406 7

5205 8

8205 9

307 10

b) Quadratic probing:

Quadratic probing is also similar to linear probing but the difference is in collision resolution. In linear probing in case of collision we use : H(key) = (key+i)%size but here we use H(key) =( key+i^2)%size.

Applying Quadratic probing on above keys:.

First key to be inserted : 5.

5 will go to index 5 of the hash table.

-------

Next key = 205 .

H(205) = 205%100 = 5(collision)

So. H(key)= (205+1^2)%100 = 6(no collision)

So, 205 is inserted into 6th index of the hash table.

--------

Next key to be inserted 406:

So, 406 %100 = 6 (collision)

(406+1^2)%100 = 7(no collision)

So, 406 is moved to 7th index of the hash table.

----------

Next key is : 5205

So, 5205%100 = 5 (collision)

So, (5205+1^2)%100 = 6 ( again collision)

So, (5205+2^2)%100 = 9 ( no collision)

So, 5205 inserted into 9th index of hash table.

-----------

Next key is 8205:

Here collision happens at 5the , 6the , 9th indexes,

So H(8205) = (8205+4^2)%100 = 8221%100 = 21

So, value 8205 is inserted in 21st index of hash table.

--------

Next value is 307.

Here there is collision at 7the index.

So, H(307) = (307+1^2)%100 = 308%100= 8.

So, 307 is inserted at 8the index of the hash table.

Key Index

5 5

205 6

406 7

5205 9

8205 21

307 8

3 0

3 years ago

HELP BRAINLST!! How is labor already being automated in supermarkets?

11Alexandr11 [23.1K]

Answer:

Self-checkouts as well.

Explanation:

6 0

3 years ago

<img src="https://tex.z-dn.net/?f=1%20%5Ctimes%202" id="TexFormula1" title="1 \times 2" alt="1 \times 2" align="absmiddle" class

Ber [7]

The answer is 2, but this is something you should know

8 0

3 years ago

Read 2 more answers

What function does an extranet perform?

dsp73

Answer:

An extranet is a private network that uses Internet technology and the public telecommunication system to securely share part of a business's information or operations with suppliers, vendors, partners, customers, or other businesses.

6 0

3 years ago

Write a code that calculates the Greatest Common Divisor (GCD) of two positive integers (user-defined inputs). Include an except

STALIN [3.7K]

Answer:

This program is written using Java programming language

import java.util.*;

public class calcGcd

{

public static void main (String [] args)

{

int num1, num2;

Scanner input = new Scanner(System.in);

//Input two integers

num1 = input.nextInt();

num2 = input.nextInt();

//Get least of the two integers

int least = num1;

if(num1 > num2)

{

least = num2;

}

//Initialize gcd to 1

int gcd = 1;

//Calculate gcd using for loop

for(int i=1;i<=least;i++)

{

if(num1%i == 0 && num2%i == 0)

{

gcd = i;

}

if(gcd == 1)

{

System.out.print("GCD is 1");

}

else

{

System.out.print("GCD is "+gcd);

}

Explanation:

To calculate the GCD, the program uses a for loop that iterates from 1 to the smaller number of the user input.

Within this iteration, the program checks for a common divisor of the two user inputs by the iterating element

The GCD is then displayed afterwards;

However, if the GCD is 1; the program prints the message "GCD is 1"

Line by Line Explanation

This line declares two integer numbers

int num1, num2;

This line allows user the program to accept user defined inputs

Scanner input = new Scanner(System.in);

The next two line allows gets inputs from the user

num1 = input.nextInt();

num2 = input.nextInt();

To calculate the GCD, the smaller of the two numbers is needed. The smaller number is derived using the following if statement

int least = num1;

if(num1 > num2)

{

least = num2;

}

The next line initializes GCD to 1

int gcd = 1;

The GCD is calculated using the following for loop

The GCD is the highest number that can divide both numbers

for(int i=1;i<=least;i++)

{

if(num1%i == 0 && num2%i == 0)

{

gcd = i;

}

The following is printed if the calculated GCD is 1

if(gcd == 1)

{

System.out.print("GCD is 1");

}

Otherwise, the following is printed

else

{

System.out.print("GCD is "+gcd);

}

8 0

3 years ago