lab

#include<stdio.h>
#include<stdlib.h>

#define LIMIT 30

enum record_status {EMPTY, DELETED, OCCUPIED};

struct Student
{
      int student_id;
      float marksOop345;
      char student_name[30];
};

struct Record
{
      struct Student info;
      enum record_status status;
};

int hash_function(int key)
{
      return (key % LIMIT);
}

int search_records(int key, struct Record hash_table[])
{
      int count, temp, position;
      temp = hash_function(key);
      position = temp;
      for(count = 1; count != LIMIT - 1; count++)
      {
            if(hash_table[position].status == EMPTY)
            {
                  return -1;
            }
            if(hash_table[position].info.student_id == key)
            {
                  return position;
            }
            position = (temp + count) % LIMIT;
      }
      return -1;
}

void insert_records(struct Student sturec, struct Record hash_table[])
{
      int count, position, temp;
      int key = sturec.student_id;
      temp = hash_function(key);
      position = temp;
      for(count = 1; count != LIMIT - 1; count++)
      {
            if(hash_table[position].status == EMPTY || hash_table[position].status == DELETED)
            {
                  hash_table[position].info = sturec;
                  hash_table[position].status = OCCUPIED;
                  printf("\nRecord Inserted into Hash Table\n");
                  return;
            }
            if(hash_table[position].info.student_id == key)
            {
                  printf("\nDuplicate Record cannot be Inserted\n");
                  return;
            }
            position = (temp + count) % LIMIT;
      }
      printf("\nHash Table Limit Exceeded\n");
}

void display_records(struct Record hash_table[])
{
      int count;
      printf("\nHash Table\n");
      for(count = 0; count < LIMIT; count++)
      {
            printf("[%d]:\t", count);
            if(hash_table[count].status == OCCUPIED)
            {
                  printf("Occupied - ID: %d Name: %s Marks: %f",hash_table[count].info.student_id, hash_table[count].info.student_name, hash_table[count].info.marksOop345);
            }
            else if(hash_table[count].status == DELETED)
            {
                  printf("\nRecord is Deleted\n");
            }
            else
            {
                  printf("\nHash Table is Empty\n");
            }
      }
}

void delete_records(int key, struct Record hash_table[])
{
      int position = search_records(key, hash_table);
      if(position == -1)
      {
            printf("\nKey Not Found\n");
      }
      else
      {
            hash_table[position].status = DELETED;
      }
}

int main()
{
      int count, key, option;
      struct Record hash_table[LIMIT];
      struct Student sturec;
      for(count = 0; count <= LIMIT - 1; count++)
      {
            hash_table[count].status = EMPTY;
      }
      while(1)
      {
            printf("1. Insert a Record\n");
            printf("2. Delete a Record\n");
            printf("3. Search a Record\n");
            printf("4. Display Records\n");
            printf("5. Exit\n");
            printf("Enter Your Option:\t");
            scanf("%d", &option);
            switch(option)
            {
                  case 1: printf("\nEnter Student ID:\t");
                          scanf("%d", &sturec.student_id);
                          printf("Enter Student Name:\t");
                          scanf("%s", sturec.student_name);
                          printf("Enter Marks:\t");
                          scanf("%d", &sturec.marksOop345);
                          insert_records(sturec, hash_table);
                          break;

                  case 2: printf("\nEnter the Key to Delete:\t");
                          scanf("%d", &key);
                          delete_records(key, hash_table);
                          break;

                  case 3: printf("\nEnter the Key to Search:\t");
                          scanf("%d", &key);
                          count = search_records(key, hash_table);
                          if(count == -1)
                          {
                                printf("\nRecord Not Found\n");
                          }
                          else
                          {
                                printf("\nRecord Found at Index Position:\t%d\n", count);
                          }
                          break;

                  case 4: display_records(hash_table);
                          break;

                  case 5: exit(1);
            }
      }
      return 0;
}