What do you want to save?
Add Code snippet
New code examples
-
Other 2021-09-27 15:05:02
write a function that will concatenate two circular linked list producing one circular linked list
#include <stdio.h> #include <stdlib.h> struct node { int data; struct node *next; }; struct node *even = NULL; struct node *odd = NULL; struct node *list = NULL; //Create Linked List void insert(int data) { // Allocate memory for n... Add solution -
Other 2021-09-27 07:59:03
linked list menu driven program in c
#include<stdio.h> #include<conio.h> #include<process.h> struct node { int data; struct node *next; }*start=NULL,*q,*t; int main() { int ch;  ... Add solution -
C 2021-09-25 15:51:04
BlockChain in c
int hash(); void printStruct(); void printChain(); void printWallet(); void setLocation(); int Random(); int rand(); int getBlock(); void printNewChain(); struct Block{ int locationBefore; int machineID; int locationCurrent; }; int Random(int lower, int u... Add solution -
C 2021-09-25 13:16:02
lru page replacement algorithm in c
/* This code is contributed by : Tanishq Vyas (github : https://github.com/tanishqvyas ) */ #include <stdlib.h> #include <stdio.h> int main(int argc, char const *argv[]) { int length; int num_frames; printf("Enter the ... Add solution -
C 2021-09-24 23:10:06
array value from user c
#include <stdio.h> int main(void) { int size, i; printf("Enter the size of the arrays:\n"); scanf("%d", &size); int arr1[size]; printf("Enter the elements of the array:\n"); for (i = 0; i < size; i++) { scan... Add solution -
C 2021-09-24 18:41:03
insertion singly linked list in c
/** * C program to insert a new node at the beginning of a Singly Linked List */ #include <stdio.h> #include <stdlib.h> /* Structure of a node */ struct node { int data; // Data struct node *next; // Address }*head; v... Add solution -
Other 2021-09-23 19:21:02
os SJF scheduling algorithms in c
#include<stdio.h> int main() { int bt[20],p[20],wt[20],tat[20],i,j,n,total=0,pos,temp; float avg_wt,avg_tat; printf("Enter number of process:"); &nbs... Add solution -
Other 2021-09-23 15:43:08
bst traversal with recursion c
# include <stdio.h> # include <conio.h> # include <stdlib.h> typedef struct BST { int data; struct BST *lchild, *rchild; } node; void insert(node *, node *); void inorder(node *); void preorder(nod... Add solution -
Java 2021-09-22 12:28:05
java print 2d array as table
for (int row = 0; row < arr.length; row++)//Cycles through rows { for (int col = 0; col < arr[row].length; col++)//Cycles through columns { System.out.printf("%5d", arr[row][col]); //change the %5d to however much space you want ... Add solution