Self Study
The blog is use for self study/ learning purpose. Good Luck !! Jay Hind !! PSPD !!!
18 November 2026
15 April 2026
Exercise Date; 15.04.2026
1.
scanf("%d", &no);
for(i=1; i<=no; i++)
{
for(j=1; j<=no; j++)
{
printf("%d", j);
}
printf("\n");
}
int i, j;
scanf("%d", &no);
for(i=no; i>=1; i--)
{
for(j=i; j>=1; j--)
{
printf("%d", no-j);
}
printf("\n");
}
9.
int i, j;
scanf("%d", &no);
for(i=no; i>=1; i--)
{
for(j=1; j<=no-i; j++)
{
printf("%d", i);
}
printf("\n");
}
10.
int i, j;
scanf("%d", &no);
for(i=no; i>=1; i--)
{
for(j=1; j<=no-i; j++)
{
printf("%d", j);
}
printf("\n");
}
11.
int i, j;
scanf("%d", &no);
for(i=no; i>=1; i--)
{
for(j=1; j<=no-i; j++)
{
printf("%d", no-i);
}
printf("\n");
}
12.
int i, j;
scanf("%d", &no);
for(i=no; i>=1; i--)
{
for(j=1; j<=no-i; j++)
{
printf("%d", no-j);
}
printf("\n");
}
24 March 2026
Linked List Insert at END
#include<stdio.h>
#include<conio.h>
struct NODE
{
int data;
struct NODE *next;
};
typedef struct NODE node;
node *head, *end;
int count=0;
void insert_end();
void display();
void delete_end();
void main()
{
int ch;
clrscr();
do
{
printf("\n1. Insert Node at End");
printf("\n2. Display");
printf("\n3. Delete Node from End");
printf("\n4. Exit ");
printf("\n\nEnter your choice: ");
scanf("%d", &ch);
switch(ch)
{
case 1:
insert_end();
break;
case 2:
display();
getch();
break;
case 3:
delete_end();
break;
case 4:
break;
default:
printf("\n Please Enter Proper Choice");
break;
}
}while(ch != 4);
}
void insert_end()
{
node *temp;
temp=(node *)malloc(sizeof(node));
printf("\n Enter value for new node: ");
scanf("%d",&temp->data);
temp->next=NULL;
if(head==NULL)
head=temp;
end->next=temp;
end=temp;
count++;
}
void display()
{
node *temp;
if(count == 0)
printf("\n Please insert node first \n");
else
{
printf("\n You have inserted %d nodes",count);
printf("\n The next list as: ");
for(temp=head;temp !=NULL;temp=temp->next)
{
printf(" %d ",temp->data);
}
}
}
void delete_end()
{
node *temp;
int i;
if(count == 0)
printf("\n Please insert a node \n");
else
{
for(temp=head,i=1;i<count-1;temp=temp->next,i++);
temp->next=NULL;
printf("\n\n You have Deleted node %d\n\n", end->data);
free(end);
end=temp;
count--;
}
}
06 March 2026
Binary Search
#include<stdio.h>
#include<conio.h>
void main()
{
int array[99], i, first, last, middle, n, search;
clrscr();
printf("Enter number of elements\n");
scanf("%d",&n);
printf("Enter Elements into the Array\n");
for (i=0; i<n; i++)
{
scanf("%d",&array[i]);
}
printf("Enter value to find\n");
scanf("%d",&search);
first = 0;
last = n - 1;
middle = (first+last) / 2;
while(first <= last)
{
if (array[middle] < search)
{
first = middle + 1;
}
else if(array[middle] == search)
{
printf("%d found at location %d\n", search, middle+1);
break;
}
else
{
last = middle - 1;
}
middle = (first + last)/2;
}
if(first > last)
{
printf("%d is not found in the list.\n", search);
}
getch();
}
Linear Search/ Sequential Search
#include<stdio.h>
#include<conio.h>
void main()
{
int array[99], num, i, search, found=0;
clrscr();
printf("Enter the number of elements: ");
scanf("%d", &num);
printf("Enter the elements one by one:\\n");
for (i = 0; i < num; i++)
{
scanf("%d", &array[i]);
}
printf("Enter the element to be searched: ");
scanf("%d", &search);
for (i = 0; i < num; i++)
{
if (search == array[i])
{
found = 1;
break;
}
}
if (found == 1)
{
printf("Element is present in the array at position %d\\n", i+1);
}
else
{
printf("Element is not present in the array\\n");
}
getch();
}
03 March 2026
Insertion Sort
#include<stdio.h>
#include<conio.h>
void main()
{
int arr[99], no, i, j, temp;
clrscr();
printf("Enter number of elements: ");
scanf("%d", &no);
printf("Enter %d integers: ", no);
for (i = 0; i < no; i++)
{
scanf("%d", &arr[i]);
}
for (i = 1; i < no; i++)
{
temp = arr[i];
j = i - 1;
while (j >= 0 && arr[j] > temp)
{
arr[j + 1] = arr[j]; // Move element to the right
j = j - 1; // Move to the previous element
}
// Move origional element into its correct position
arr[j + 1] = temp;
}
printf("Sorted elements:\n");
for (i = 0; i < no; i++)
{
printf("%d ", arr[i]);
}
printf("\n");
getch();
}
Selection Sort
#include<stdio.h>
#include<conio.h>
void main()
{
int a[99], no, i, j, min, temp;
clrscr();
printf("\nEnter size of an array: ");
scanf("%d", &no);
printf("\nEnter elements of an array:\n");
for(i=0; i<no; i++)
{
scanf("%d", &a[i]);
}
for (i=0; i<no; i++)
{
min = i;
for (j=i+1; j<no; j++)
{
if (a[j] < a[min])
min = j;
}
temp = a[i];
a[i] = a[min];
a[min] = temp;
}
printf("\n\nAfter sorting:\n");
for(i=0; i<no; i++)
{
printf("\n%d", a[i]);
}
getch();
}
-
1. int i, j; scanf("%d", &no); for(i=1; i<=no; i++) { for(j=1; j<=no; j++) { printf(...
-
#include<stdio.h> #include<conio.h> void main() { int deque[5], ch, i, value, front=-1, rear=-1; clrscr(); do { prin...
-
#include<stdio.h> #include<conio.h> struct NODE { int data; struct NODE *next; }; typedef struct NODE node; node *head, *end...