Data Structures - 10

by

Implement Hash Tables

 

#include <stdio.h>

#include <stdlib.h>

 

struct set

{

    int key;

    int data;

};

struct set *array;

int capacity = 10; // Capacity of hash is 10

int size = 0;

int hashFunction(int key)

{

    return (key % capacity);

}

int checkPrime(int n)

{

    int i;

    if (n == 1 || n == 0)

    {

        return 0;

    }

    for (i = 2; i < n / 2; i++)

    {

        if (n % i == 0)

        {

            return 0;

        }

    }

    return 1;

}

int getPrime(int n)

{

    if (n % 2 == 0)

    {

        n++;

    }

    while (!checkPrime(n))

    {

        n += 2;

    }

    return n;

}

void init_array()

{

    capacity = getPrime(capacity);

    array = (struct set *)malloc(capacity * sizeof(struct set));

    int i;

    for (i = 0; i < capacity; i++)

    {

        array[i].key = 0;

        array[i].data = 0;

    }

}

void insert(int key, int data)

{

    int index = hashFunction(key);

    if (array[index].data == 0)

    {

        array[index].key = key;

        array[index].data = data;

        size++;

        printf("\n Key (%d) has been inserted \n", key);

    }

    else if (array[index].key == key)

    {

        array[index].data = data;

    }

    else

    {

        printf("\n Collision occured \n");

    }

}

void remove_element(int key)

{

    int index = hashFunction(key);

    if (array[index].data == 0)

    {

        printf("\n This key does not exist\n");

    }

    else

    {

        array[index].key = 0;

        array[index].data = 0;

        size--;

        printf("\n Key (%d) has been removed \n", key);

    }

}

void display()

{

    int i;

    for (i = 0; i < capacity; i++)

    {

        if (array[i].data == 0)

        {

            printf("\n array[%d]: / ", i);

        }

        else

        {

            printf("\n key: %d array[%d]: %d \t", array[i].key, i, array[i].data);

        }

    }

}

int size_of_hashtable()

{

    return size;

}

int main()

{

    int choice, key, data, n;

    int c = 0;

    init_array();

    do

    {

        printf("1.Insert item in the Hash Table "

               "\n2.Remove item from the Hash Table"

               "\n3.Check the size of Hash Table "

               "\n4.Display a Hash Table"

               "\n\n Please enter your choice: ");

        scanf("%d", &choice);

        switch (choice)

        {

        case 1:

            printf("Enter key -:\t");

            scanf("%d", &key);

            printf("Enter data -:\t");

            scanf("%d", &data);

            insert(key, data);

            break;

 

        case 2:

            printf("Enter the key to delete-:");

            scanf("%d", &key);

            remove_element(key);

            break;

 

        case 3:

            n = size_of_hashtable();

            printf("Size of Hash Table is-:%d\n", n);

            break;

 

        case 4:

            display();

            break;

        default:

            printf("Invalid Input\n");

        }

        printf("\nDo you want to continue (press 1 for yes): ");

        scanf("%d", &c);

    } while (c == 1);

}

 

Comments

Post a Comment

Popular posts from this blog

Computer Architecture and Organization - 4

by
Image
Aim:  To implement various 4-bit arithmetic Micro-operations           using arithmetic unit.   Theory Arithmetic micro operation of the form L:   R A  ( R A + R B ) refers to two data items contained in R A and R B input to a parallel adder with the result being stored back in R A (Fig.). Loading      of the result in R A is subject to the availability   of the control   signal designated as L   (that   is   load control of R A ) . Note that adder being a combinational logic, the adder output is available after a delay of the associated combinational circuit. Input to adder may be also controlled by providing AND word gates on the data paths from R A and R B to the adder under the control signal C (Fig.). the control signals `C' and 2's complement are at logic `0' for add operation.   The subtract micro operation L:   R A  ( R A - R B ) in 2's comp...
Read more

Design and Analysis of Algorithms - 2

by
Image
Implement functions to print n th Fibonacci number using iteration and recursive method. Compare the performance of two methods by counting number of steps executed on various inputs. Also draw a comparative chart. Code:   #include<stdio.h>   int count_ite=0; int count_rec=0; void febo_ite(int ); int febo_rec(int );   int main() {     int n,ans;     printf("Enter position of number: ");     scanf("%d",&n);     febo_ite(n);     ans=febo_rec(n);     printf("Using Recursion: %d th number is = %d\n",n,ans);     printf("No of Steps= %d\n\n",count_rec); }   void febo_ite(int n) {     count_ite++;     int next,i, first=0,second=1;     count_ite++;     if(n==0)     {         count_ite++;  ...
Read more

Design and Analysis of Algorithms - 6

by
Image
Implement program for randomized version of quick sort and compare its performance with normal version of quick sort using steps count on various number of inputs.   Code: #include<stdio.h> #include<stdlib.h> #include<time.h>   int count=0; int r_count=0; void quick_sort(int a[],int start,int n) {     int i,j,pivot,temp;     count++;     if(start<n)         {             count++;             pivot=start;             count++;             i=start;             count++;             j=n;     ...
Read more

Design and Analysis of Algorithms - 1

by
Image
Implement a function for each of following problems and count the  number of steps executed/Time taken by each function on various  inputs and write complexity of each function. Also draw a  comparative chart. In each of the following function N will be passed  by user.                     1. To calculate sum of 1 to N number using loop.                     2. To calculate sum of 1 to N number using equation.                     3. To calculate sum of 1 to N numbers using recursion. Code:   #include <stdio.h> int count_loop=0; int count_rec=0; int count_eq=0;   int sum_loop(int n) {     int i,sum=0;     count_loop++;     for(i=1;i<=n;i++)     {         count_loop++; ...
Read more

Artificial Intelligence - 7

by
Image
  AIM: Write a program to build Multi-layer Perceptron to implement any Boolean functions as mentioned below without using any python packages. AND, OR, XOR, XNOR, NOR, NAND, NOT x1, NOT x2, NULL, IDENTITY, INHIBITION ( 𝑥 1 ∧ ¬ 𝑥 2), INHIBITION ( 𝑥 2 ∧ ¬ 𝑥 1), TRANSFER x1, TRANSFER x2, IMPLICATION ( 𝑥 1 ∨ ¬ 𝑥 2), IMPLICATION ( 𝑥 2 ∨ ¬ 𝑥 1)   Program: class  perceptronNeuron:      def   __init__ ( self ,  x ,  w ,  w0 ):         l = [ww  for  ww  in  x]         l.insert( 0 ,  1 )          self .x = l          self .y =  0         l = [ww  for  ww  in  w]         l.insert( 0 ,...
Read more