Rajan

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 ...

AIM:   Write C Program to implement searching algorithms for the following: 1.  SequentialSearch( )   #include<stdio.h> #include<conio.h> #define SIZE 5   int seq_search(int ele[], int item) {     int i = -1;     int j = 0;       for (j = 0; j < SIZE; j++) {         if (ele[j] == item) {             i = j;             break;         }     }     return i; }   int main() {     int ele[SIZE];     int i = 0;     int item;     int pos;     printf("\n------ Enter Values ------ \n\n");       for (i = ...

AIM:   Write C Programs to implement Binary Search Tree. Code: #include <stdio.h > #include <stdlib.h>     struct node   {     int info;     struct node * lchild;     struct node * rchild;   }*root;   void find(int item, struct node **par, struct node **loc) {   struct node *ptr, *ptrsave;     if (root == NULL)   {     *loc = NULL;     *par = NULL;     return;   }     if (item == root->info)   {     *loc = root;     *par = NULL;     return;   }     if (item < root->info)     ptr = root->lchild;   else     ptr = root->rchild;   ptrsave = root;    ...