uploaded

Author: Developer-Rakeen

Algorithms/5. Diagonal Difference.c

@@ -0,0 +1,50 @@
+#include<stdio.h>
+#include<stdlib.h>
+int main()
+{
+int n,**arr,i,j,sum1=0,sum2=0;
+printf("Enter size:");
+scanf("%d",&n);
+arr=(int**)malloc(n*sizeof(int*));
+for(i=0;i<n;i++)
+{
+*(arr+i)=(int*)malloc(n*sizeof(int));
+}
+printf("Enter %d elements:\n",n*n);
+for(i=0;i<n;i++)
+{
+for(j=0;j<n;j++)
+{
+scanf("%d",*(arr+i)+j);
+}
+}
+for(i=0;i<n;i++)
+{
+for(j=0;j<n;j++)
+{
+if(i==j)
+{
+sum1=sum1+*(*(arr+i)+j);
+}
+ if(i+j==n-1)
+{
+sum2=sum2+*(*(arr+i)+j);
+}
+}
+}
+if(sum1<sum2)
+{
+printf("%d\n",sum2-sum1);
+}
+else
+{
+printf("%d\n",sum1-sum2);
+}
+for(i=0;i<n;i++)
+{
+free(*(arr+i));
+}
+free(arr);
+arr=NULL;
+return 0;
+}

Algorithms/6. Plus Minus.c

@@ -0,0 +1,35 @@
+#include<stdio.h>
+#include<stdlib.h>
+int main()
+{
+int n,i,*arr,countp=0,countn=0,countz=0;
+printf("Enter size:");
+scanf("%d",&n);
+arr=(int*)malloc(n*sizeof(int));
+printf("Enter %d elements:",n);
+for(i=0;i<n;i++)
+{
+scanf("%d",arr+i);
+}
+for(i=0;i<n;i++)
+{
+if(0<*(arr+i))
+{
+countp++;
+}
+else if(0==*(arr+i))
+{
+countz++;
+}
+else if(0>*(arr+i))
+{
+countn++;
+}
+}
+printf("%f\n",(float)countp/n);
+printf("%f\n",(float)countn/n);
+printf("%f\n",(float)countz/n);
+free(arr);
+arr=NULL;
+return 0;
+}

Algorithms/7. Staircase.c

@@ -0,0 +1,20 @@
+#include<stdio.h>
+int main()
+{
+int i,j,k,n;
+printf("Enter size:");
+scanf("%d",&n);
+for(i=1;i<=n;i++)
+{
+for(j=i;j<n;j++)
+{
+printf(" ");
+}
+for(k=1;k<=i;k++)
+{
+printf("#");
+}
+printf("\n");
+}
+return 0;
+}

Data Structures/10. Print in Reverse.c

@@ -0,0 +1,85 @@
+#include<stdio.h>
+#include<stdlib.h>
+struct SinglyLinkedListNode
+{
+int data;
+struct SinglyLinkedListNode* next;
+};
+struct SinglyLinkedListNode* head=NULL;
+typedef struct SinglyLinkedListNode SinglyLinkedListNode;
+void append()
+{
+SinglyLinkedListNode* temp;
+temp=(SinglyLinkedListNode*)malloc(sizeof(SinglyLinkedListNode));
+printf("Enter node data:");
+scanf("%d",&temp->data);
+temp->next=NULL;
+if(head==NULL)
+{
+head=temp;
+}
+else
+{
+SinglyLinkedListNode* p;
+p=head;
+while(p->next!=NULL)
+{
+p=p->next;
+}
+p->next=temp;
+}
+}
+void reverse_print()
+{
+int i,j,len=0,k,temporary;
+SinglyLinkedListNode *p,*q,*temp;
+i=0;
+temp=head;
+while(temp!=NULL)
+{
+len++;
+temp=temp->next;
+}
+j=len-1;
+p=q=head;
+while(i<j)
+{
+ k=0;
+ while(k<j)
+ {
+ q=q->next;
+ k++;
+ }
+ temporary=p->data;
+ p->data=q->data;
+ q->data=temporary;
+ i++;
+ j--;
+ p=p->next;
+ q=head;
+ }
+ temp=head;
+ while(temp!=NULL)
+{
+printf("%d\n",temp->data);
+temp=temp->next;
+}
+}
+int main()
+{
+int i,j,n,t;
+printf("Enter number:");
+scanf("%d",&t);
+for(i=0;i<t;i++)
+{
+printf("Enter size:");
+scanf("%d",&n);
+for(j=0;j<n;j++)
+{
+append();
+}
+reverse_print();
+head=NULL;
+}
+return 0;
+}

Data Structures/6. Insert a Node at the Tail of a Linked List.c

@@ -0,0 +1,53 @@
+#include<stdio.h>
+#include<stdlib.h>
+struct SinglyLinkedListNode
+{
+int data;
+struct SinglyLinkedListNode* next;
+};
+struct SinglyLinkedListNode* head=NULL;
+typedef struct SinglyLinkedListNode SinglyLinkedListNode;
+void append()
+{
+SinglyLinkedListNode* temp;
+temp=(SinglyLinkedListNode*)malloc(sizeof(SinglyLinkedListNode));
+printf("Enter node data:");
+scanf("%d",&temp->data);
+temp->next=NULL;
+if(head==NULL)
+{
+head=temp;
+}
+else
+{
+SinglyLinkedListNode* p;
+p=head;
+while(p->next!=NULL)
+{
+p=p->next;
+}
+p->next=temp;
+}
+}
+void display()
+{
+SinglyLinkedListNode* temp;
+temp=head;
+while(temp!=NULL)
+{
+printf("%d\n",temp->data);
+temp=temp->next;
+}
+}
+int main()
+{
+int i,n;
+printf("Enter size:");
+scanf("%d",&n);
+for(i=0;i<n;i++)
+{
+append();
+}
+display();
+return 0;
+}

Data Structures/7. Insert a node at the head of a linked list.c

@@ -0,0 +1,48 @@
+#include<stdio.h>
+#include<stdlib.h>
+struct SinglyLinkedListNode
+{
+int data;
+struct SinglyLinkedListNode* next;
+};
+struct SinglyLinkedListNode* head=NULL;
+typedef struct SinglyLinkedListNode SinglyLinkedListNode;
+void addatbegin()
+{
+SinglyLinkedListNode* temp;
+temp=(SinglyLinkedListNode*)malloc(sizeof(SinglyLinkedListNode));
+printf("Enter node data:");
+scanf("%d",&temp->data);
+temp->next=NULL;
+if(head==NULL)
+{
+head=temp;
+}
+else
+{
+temp->next=head;
+head=temp;
+}
+}
+void display()
+{
+SinglyLinkedListNode* temp;
+temp=head;
+while(temp!=NULL)
+{
+printf("%d\n",temp->data);
+temp=temp->next;
+}
+}
+int main()
+{
+int i,n;
+printf("Enter size:");
+scanf("%d",&n);
+for(i=0;i<n;i++)
+{
+addatbegin();
+}
+display();
+return 0;
+}

Data Structures/8. Insert a node at a specific position in a linked list.c

@@ -0,0 +1,82 @@
+#include<stdio.h>
+#include<stdlib.h>
+struct SinglyLinkedListNode
+{
+int data;
+struct SinglyLinkedListNode* next;
+};
+struct SinglyLinkedListNode* head=NULL;
+typedef struct SinglyLinkedListNode SinglyLinkedListNode;
+void append()
+{
+SinglyLinkedListNode* temp;
+temp=(SinglyLinkedListNode*)malloc(sizeof(SinglyLinkedListNode));
+printf("Enter node data:");
+scanf("%d",&temp->data);
+temp->next=NULL;
+if(head==NULL)
+{
+head=temp;
+}
+else
+{
+SinglyLinkedListNode* p;
+p=head;
+while(p->next!=NULL)
+{
+p=p->next;
+}
+p->next=temp;
+}
+}
+void addatloc()
+{
+int loc,i;
+SinglyLinkedListNode* temp,*p;
+temp=(SinglyLinkedListNode*)malloc(sizeof(SinglyLinkedListNode));
+printf("Enter node data:");
+scanf("%d",&temp->data);
+temp->next=NULL;
+printf("Enter loc to add:");
+scanf("%d",&loc);
+if(loc==0)
+{
+temp->next=head;
+head=temp;
+}
+else
+{
+p=head;
+i=0;
+ while(i<loc-1)
+ {
+ p=p->next;
+ i++;
+ }
+ temp->next=p->next;
+ p->next=temp;
+}
+}
+void display()
+{
+SinglyLinkedListNode* temp;
+temp=head;
+while(temp!=NULL)
+{
+printf("%d ",temp->data);
+temp=temp->next;
+}
+}
+int main()
+{
+int i,n;
+printf("Enter size:");
+scanf("%d",&n);
+for(i=0;i<n;i++)
+{
+append();
+}
+addatloc();
+display();
+return 0;
+}