Posts

How to insert and delete elements in an array using C

-
       Array is one of the important data structures widely used in programming. This blog post includes the insertion and deletion of elements in array. Insertion:               An array is declared and inputs are read from the user. To insert an element, the position and data are the inputs. Using loop , we insert the element and displayed the output after insertion. C Program: #include <stdio.h> int main() {     int a[10];     int n,i,j,k;     printf("Enter the number of elements:");     scanf("%d",&n);     printf("Enter the elements:");     for(i=0;i<n;i++)     {         scanf("%d",&a[i]);     }     printf("Enter the position to insert an element:");     scanf("%d...
Post a Comment
Read more

Hash table implementation in C

-
               A hash table has an array of buckets. It has a key and value. Key is to find the position of the bucket. Value is to be stored on that location. It can be done by two ways as follows. ·        Using linked list ·        Linear probing Here, we use linked list to implement the hash table. Code: #include <stdio.h> #include <stdlib.h> #include <string.h> //The size of the hash table is defined as 4. #define SIZE 4 //create a node for hash table. it has a key, value and a pointer to point the next node struct h_Node {     int h_key;     int h_value;     struct h_Node* h_next; }; // create a hash table struct h_Node* hashTable[SIZE];   // Hash function to find the hash code int hashCode(int h_key) {     return h_key % SIZE; } // this function adds the ...
Post a Comment
Read more

Binary Tree implementation in C

-
               Tree is a non-linear data structure which deals with root element and child nodes.Root is the main node which connects the entire data structure. It has childs which is divided into 2 types. The two categories are Left and right. Let us create a binary tree which has exactly two child is given below… C implementation of binary Tree using Linked list: Here, the binary tree is created using linked list . A node is created as root. It has two nodes and data. ‘createNode()’ creates a node with memory and data. There are three traversal to print the node data. Pre-order traversal : It follows ‘Root-left child-right child’ format. Post – order traversal :it uses ‘left child – right child- root’ format. In-order traversal :It has ‘left child- root- right child’ format. Code: #include <stdio.h> #include <stdlib.h> // create the tree as linked list struct T_Node {     int data; ...
Post a Comment
Read more

Graph implementation in C

-
                 Graph is a non-linear one which has vertices and edges. Vertices are the nodes and the edges are links which connect the nodes. General representation of G is represented by G = (V,E) Where, V represents by vertices and E represents by edges. Let us implement the graph in two different ways as follows.. 1.       Adjacency Matrix 2.       Adjacency List 1.Adjacency Matrix implementation of Graph:               This method follows a two-dimensional Matrix to implement the graph. It creates a 2D matrix to get the graph structure. It reads the edges from the user and assigns the value. Finally displays the graph. C Program: #include <stdio.h> #define V 4 void printIt(int adjM_graph[V][V]) {     for (int i = 0; i < V; i++) {         f...
Post a Comment
Read more

Linked List implementation for deletion, search and reverse Operations in C

-
              As earlier post contains the linked list implementation and insertion operation in C. here, I include the operations on linked list which contains deletion, search and reverse. Code: #include <stdio.h> #include <stdlib.h> // Node structure is created struct L_Node {     int n_data;     struct L_Node* next; }; //Let us create a new node struct L_Node* createNode(int n_data) {     struct L_Node* newNode = (struct L_Node*)malloc(sizeof(struct L_Node));     newNode->n_data = n_data;     newNode->next = NULL;     return newNode; } // creation of Insertion at end void insertEnd(struct L_Node** head, int n_data) {     struct L_Node* newNode = createNode(n_data);     if (*head == NULL) {         *head = newNode;    ...
Post a Comment
Read more

Linked list implementation in C

-
               It is a mostly used linear data structure in programming. Linked list has a collection of nodes and pointers. Pointers has the address of the next node. Node has the data. First node is called Head node. Last node has null pointer. Let us implement the linked list with insertion operation. Program: #include <stdio.h> #include <stdlib.h> // creation of   the node structure struct l_Node {     int n_data;     struct l_Node* next; }; //create a new node struct l_Node* createNode(int n_data) {     struct l_Node* newNode = (struct l_Node*)malloc(sizeof(struct l_Node));     if (!newNode) {         printf("Memory is not allocated\n");         exit(1);     }     newNode->n_data = n_data;     newNode->next = NUL...
Post a Comment
Read more

Queue implementation in C

-
                Queue is another linear data structures . Have you stand in a queue. People who stands in the front will go first. Same principle is applicable here. This principle is called FIFO(First In First Out). Functions and variables in queue: First element denotes front. Last element represents rear. To insert an element in rear end use enqueue (). To delete an element, consider dequeue() function. ‘peek()’ is a function which makes the user to view the front element. It doesn’t delete the element. Let us create a queue using arrays in C . Program: #include < stdio.h > #include < stdlib.h > #define MAX 9    // Let us declare the maximum size of queue int queue[MAX]; int front = -1, rear = -1; // queue is full or not int isFull() {     return (rear == MAX - 1); } // Queue empty checking int isEmpty() {     return (fr...
Post a Comment
Read more